java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test22_1_false-valid-memtrack_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-a74eeac-m [2018-02-02 19:19:56,861 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 19:19:56,863 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 19:19:56,871 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 19:19:56,872 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 19:19:56,872 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 19:19:56,873 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 19:19:56,874 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 19:19:56,875 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 19:19:56,876 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 19:19:56,876 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 19:19:56,876 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 19:19:56,877 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 19:19:56,877 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 19:19:56,878 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 19:19:56,879 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 19:19:56,881 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 19:19:56,882 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 19:19:56,882 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 19:19:56,883 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 19:19:56,885 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 19:19:56,885 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 19:19:56,885 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 19:19:56,886 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 19:19:56,886 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 19:19:56,887 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 19:19:56,887 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 19:19:56,887 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 19:19:56,888 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 19:19:56,888 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 19:19:56,888 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 19:19:56,888 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf [2018-02-02 19:19:56,897 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 19:19:56,898 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 19:19:56,899 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 19:19:56,899 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 19:19:56,899 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 19:19:56,899 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 19:19:56,899 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 19:19:56,900 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 19:19:56,900 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 19:19:56,900 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 19:19:56,900 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 19:19:56,900 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 19:19:56,900 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 19:19:56,900 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 19:19:56,901 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 19:19:56,901 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 19:19:56,901 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 19:19:56,901 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 19:19:56,901 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 19:19:56,901 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 19:19:56,902 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 19:19:56,902 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 19:19:56,902 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-02 19:19:56,902 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-02 19:19:56,902 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-02 19:19:56,930 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 19:19:56,941 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 19:19:56,948 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 19:19:56,949 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 19:19:56,950 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 19:19:56,950 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 19:19:57,094 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 19:19:57,095 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 19:19:57,096 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 19:19:57,096 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 19:19:57,101 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 19:19:57,102 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 07:19:57" (1/1) ... [2018-02-02 19:19:57,105 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5fc89e21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:19:57, skipping insertion in model container [2018-02-02 19:19:57,105 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 07:19:57" (1/1) ... [2018-02-02 19:19:57,114 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 19:19:57,148 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 19:19:57,242 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 19:19:57,258 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 19:19:57,266 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:19:57 WrapperNode [2018-02-02 19:19:57,266 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 19:19:57,266 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 19:19:57,267 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 19:19:57,267 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 19:19:57,277 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:19:57" (1/1) ... [2018-02-02 19:19:57,277 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:19:57" (1/1) ... [2018-02-02 19:19:57,286 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:19:57" (1/1) ... [2018-02-02 19:19:57,286 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:19:57" (1/1) ... [2018-02-02 19:19:57,293 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:19:57" (1/1) ... [2018-02-02 19:19:57,295 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:19:57" (1/1) ... [2018-02-02 19:19:57,297 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:19:57" (1/1) ... [2018-02-02 19:19:57,299 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 19:19:57,299 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 19:19:57,299 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 19:19:57,299 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 19:19:57,300 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:19:57" (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 19:19:57,333 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 19:19:57,333 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 19:19:57,333 INFO L136 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2018-02-02 19:19:57,333 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-02-02 19:19:57,333 INFO L136 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2018-02-02 19:19:57,333 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_atomic_add_return [2018-02-02 19:19:57,333 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_atomic_sub_return [2018-02-02 19:19:57,333 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_sub [2018-02-02 19:19:57,334 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_init [2018-02-02 19:19:57,334 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_get [2018-02-02 19:19:57,334 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_put [2018-02-02 19:19:57,334 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_cleanup [2018-02-02 19:19:57,334 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_release [2018-02-02 19:19:57,334 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2018-02-02 19:19:57,334 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_get [2018-02-02 19:19:57,334 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init_internal [2018-02-02 19:19:57,335 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init [2018-02-02 19:19:57,335 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_create [2018-02-02 19:19:57,335 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-02-02 19:19:57,335 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 19:19:57,335 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-02 19:19:57,335 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-02 19:19:57,335 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-02 19:19:57,335 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-02 19:19:57,336 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 19:19:57,336 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 19:19:57,336 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 19:19:57,336 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2018-02-02 19:19:57,336 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2018-02-02 19:19:57,336 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-02 19:19:57,336 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-02 19:19:57,336 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 19:19:57,336 INFO L128 BoogieDeclarations]: Found specification of procedure memset [2018-02-02 19:19:57,337 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-02-02 19:19:57,337 INFO L128 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2018-02-02 19:19:57,337 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_atomic_add_return [2018-02-02 19:19:57,337 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_atomic_sub_return [2018-02-02 19:19:57,337 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_sub [2018-02-02 19:19:57,337 INFO L128 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2018-02-02 19:19:57,337 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_init [2018-02-02 19:19:57,337 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_get [2018-02-02 19:19:57,337 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_put [2018-02-02 19:19:57,337 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_cleanup [2018-02-02 19:19:57,338 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_release [2018-02-02 19:19:57,338 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2018-02-02 19:19:57,338 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_get [2018-02-02 19:19:57,338 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_init_internal [2018-02-02 19:19:57,338 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_init [2018-02-02 19:19:57,338 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_create [2018-02-02 19:19:57,338 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-02-02 19:19:57,338 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 19:19:57,338 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 19:19:57,338 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 19:19:57,519 WARN L455 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-02-02 19:19:57,645 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 19:19:57,646 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 07:19:57 BoogieIcfgContainer [2018-02-02 19:19:57,646 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 19:19:57,647 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 19:19:57,647 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 19:19:57,648 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 19:19:57,649 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 07:19:57" (1/3) ... [2018-02-02 19:19:57,649 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62f5b4f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 07:19:57, skipping insertion in model container [2018-02-02 19:19:57,649 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:19:57" (2/3) ... [2018-02-02 19:19:57,649 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62f5b4f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 07:19:57, skipping insertion in model container [2018-02-02 19:19:57,650 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 07:19:57" (3/3) ... [2018-02-02 19:19:57,651 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test22_1_false-valid-memtrack_true-termination.i [2018-02-02 19:19:57,657 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-02 19:19:57,663 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 23 error locations. [2018-02-02 19:19:57,695 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 19:19:57,696 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 19:19:57,696 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-02 19:19:57,696 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-02 19:19:57,696 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 19:19:57,696 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 19:19:57,696 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 19:19:57,696 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 19:19:57,697 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 19:19:57,710 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states. [2018-02-02 19:19:57,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-02 19:19:57,718 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:19:57,719 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 19:19:57,719 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 19:19:57,723 INFO L82 PathProgramCache]: Analyzing trace with hash -1956546830, now seen corresponding path program 1 times [2018-02-02 19:19:57,725 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:19:57,725 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:19:57,779 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:19:57,779 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:19:57,779 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:19:57,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:19:57,825 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:19:57,924 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 19:19:57,926 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:19:57,926 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 19:19:57,975 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 19:19:57,985 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 19:19:57,986 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 19:19:57,987 INFO L87 Difference]: Start difference. First operand 142 states. Second operand 5 states. [2018-02-02 19:19:58,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:19:58,031 INFO L93 Difference]: Finished difference Result 148 states and 156 transitions. [2018-02-02 19:19:58,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 19:19:58,033 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-02-02 19:19:58,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:19:58,044 INFO L225 Difference]: With dead ends: 148 [2018-02-02 19:19:58,044 INFO L226 Difference]: Without dead ends: 145 [2018-02-02 19:19:58,045 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 19:19:58,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-02-02 19:19:58,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 143. [2018-02-02 19:19:58,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-02-02 19:19:58,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 151 transitions. [2018-02-02 19:19:58,079 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 151 transitions. Word has length 17 [2018-02-02 19:19:58,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:19:58,079 INFO L432 AbstractCegarLoop]: Abstraction has 143 states and 151 transitions. [2018-02-02 19:19:58,079 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 19:19:58,079 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 151 transitions. [2018-02-02 19:19:58,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-02 19:19:58,079 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:19:58,080 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 19:19:58,080 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 19:19:58,080 INFO L82 PathProgramCache]: Analyzing trace with hash 1123892084, now seen corresponding path program 1 times [2018-02-02 19:19:58,080 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:19:58,080 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:19:58,081 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:19:58,081 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:19:58,081 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:19:58,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:19:58,095 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:19:58,133 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 19:19:58,133 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:19:58,133 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 19:19:58,135 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 19:19:58,135 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 19:19:58,135 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 19:19:58,136 INFO L87 Difference]: Start difference. First operand 143 states and 151 transitions. Second operand 6 states. [2018-02-02 19:19:58,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:19:58,292 INFO L93 Difference]: Finished difference Result 144 states and 152 transitions. [2018-02-02 19:19:58,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 19:19:58,292 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-02-02 19:19:58,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:19:58,293 INFO L225 Difference]: With dead ends: 144 [2018-02-02 19:19:58,293 INFO L226 Difference]: Without dead ends: 144 [2018-02-02 19:19:58,294 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 19:19:58,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-02-02 19:19:58,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 142. [2018-02-02 19:19:58,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-02-02 19:19:58,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 150 transitions. [2018-02-02 19:19:58,301 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 150 transitions. Word has length 19 [2018-02-02 19:19:58,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:19:58,301 INFO L432 AbstractCegarLoop]: Abstraction has 142 states and 150 transitions. [2018-02-02 19:19:58,301 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 19:19:58,301 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 150 transitions. [2018-02-02 19:19:58,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-02 19:19:58,301 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:19:58,301 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 19:19:58,301 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 19:19:58,302 INFO L82 PathProgramCache]: Analyzing trace with hash 1123892085, now seen corresponding path program 1 times [2018-02-02 19:19:58,302 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:19:58,302 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:19:58,302 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:19:58,303 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:19:58,303 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:19:58,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:19:58,319 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:19:58,493 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 19:19:58,494 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:19:58,494 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 19:19:58,494 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 19:19:58,494 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 19:19:58,495 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 19:19:58,495 INFO L87 Difference]: Start difference. First operand 142 states and 150 transitions. Second operand 7 states. [2018-02-02 19:19:58,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:19:58,727 INFO L93 Difference]: Finished difference Result 143 states and 151 transitions. [2018-02-02 19:19:58,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 19:19:58,728 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2018-02-02 19:19:58,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:19:58,729 INFO L225 Difference]: With dead ends: 143 [2018-02-02 19:19:58,729 INFO L226 Difference]: Without dead ends: 143 [2018-02-02 19:19:58,729 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-02-02 19:19:58,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-02-02 19:19:58,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 141. [2018-02-02 19:19:58,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-02-02 19:19:58,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 149 transitions. [2018-02-02 19:19:58,742 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 149 transitions. Word has length 19 [2018-02-02 19:19:58,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:19:58,742 INFO L432 AbstractCegarLoop]: Abstraction has 141 states and 149 transitions. [2018-02-02 19:19:58,742 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 19:19:58,742 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 149 transitions. [2018-02-02 19:19:58,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-02 19:19:58,743 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:19:58,743 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 19:19:58,743 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 19:19:58,743 INFO L82 PathProgramCache]: Analyzing trace with hash -1414777661, now seen corresponding path program 1 times [2018-02-02 19:19:58,743 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:19:58,743 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:19:58,745 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:19:58,745 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:19:58,745 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:19:58,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:19:58,758 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:19:58,817 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 19:19:58,817 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:19:58,817 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 19:19:58,817 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 19:19:58,818 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 19:19:58,818 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 19:19:58,818 INFO L87 Difference]: Start difference. First operand 141 states and 149 transitions. Second operand 7 states. [2018-02-02 19:19:58,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:19:58,849 INFO L93 Difference]: Finished difference Result 157 states and 166 transitions. [2018-02-02 19:19:58,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 19:19:58,850 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2018-02-02 19:19:58,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:19:58,852 INFO L225 Difference]: With dead ends: 157 [2018-02-02 19:19:58,852 INFO L226 Difference]: Without dead ends: 157 [2018-02-02 19:19:58,852 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 19:19:58,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-02-02 19:19:58,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 150. [2018-02-02 19:19:58,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-02-02 19:19:58,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 158 transitions. [2018-02-02 19:19:58,864 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 158 transitions. Word has length 27 [2018-02-02 19:19:58,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:19:58,865 INFO L432 AbstractCegarLoop]: Abstraction has 150 states and 158 transitions. [2018-02-02 19:19:58,865 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 19:19:58,865 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 158 transitions. [2018-02-02 19:19:58,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-02 19:19:58,866 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:19:58,866 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 19:19:58,866 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 19:19:58,866 INFO L82 PathProgramCache]: Analyzing trace with hash 1439517623, now seen corresponding path program 1 times [2018-02-02 19:19:58,866 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:19:58,866 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:19:58,868 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:19:58,868 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:19:58,868 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:19:58,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:19:58,881 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:19:58,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 19:19:58,944 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:19:58,944 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-02 19:19:58,945 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 19:19:58,945 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 19:19:58,945 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-02-02 19:19:58,945 INFO L87 Difference]: Start difference. First operand 150 states and 158 transitions. Second operand 10 states. [2018-02-02 19:19:59,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:19:59,141 INFO L93 Difference]: Finished difference Result 149 states and 157 transitions. [2018-02-02 19:19:59,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 19:19:59,142 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 34 [2018-02-02 19:19:59,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:19:59,142 INFO L225 Difference]: With dead ends: 149 [2018-02-02 19:19:59,143 INFO L226 Difference]: Without dead ends: 149 [2018-02-02 19:19:59,143 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 19:19:59,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-02-02 19:19:59,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2018-02-02 19:19:59,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-02-02 19:19:59,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 157 transitions. [2018-02-02 19:19:59,148 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 157 transitions. Word has length 34 [2018-02-02 19:19:59,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:19:59,149 INFO L432 AbstractCegarLoop]: Abstraction has 149 states and 157 transitions. [2018-02-02 19:19:59,149 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 19:19:59,149 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 157 transitions. [2018-02-02 19:19:59,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-02 19:19:59,149 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:19:59,150 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 19:19:59,150 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 19:19:59,150 INFO L82 PathProgramCache]: Analyzing trace with hash 1439517624, now seen corresponding path program 1 times [2018-02-02 19:19:59,150 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:19:59,150 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:19:59,151 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:19:59,151 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:19:59,151 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:19:59,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:19:59,164 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:19:59,188 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 19:19:59,188 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:19:59,188 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 19:19:59,189 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 19:19:59,189 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 19:19:59,189 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 19:19:59,189 INFO L87 Difference]: Start difference. First operand 149 states and 157 transitions. Second operand 4 states. [2018-02-02 19:19:59,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:19:59,207 INFO L93 Difference]: Finished difference Result 152 states and 160 transitions. [2018-02-02 19:19:59,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 19:19:59,207 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-02-02 19:19:59,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:19:59,209 INFO L225 Difference]: With dead ends: 152 [2018-02-02 19:19:59,209 INFO L226 Difference]: Without dead ends: 150 [2018-02-02 19:19:59,209 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 19:19:59,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-02-02 19:19:59,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2018-02-02 19:19:59,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-02-02 19:19:59,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 158 transitions. [2018-02-02 19:19:59,214 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 158 transitions. Word has length 34 [2018-02-02 19:19:59,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:19:59,215 INFO L432 AbstractCegarLoop]: Abstraction has 150 states and 158 transitions. [2018-02-02 19:19:59,215 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 19:19:59,215 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 158 transitions. [2018-02-02 19:19:59,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-02 19:19:59,216 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:19:59,216 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 19:19:59,216 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 19:19:59,216 INFO L82 PathProgramCache]: Analyzing trace with hash -204456797, now seen corresponding path program 1 times [2018-02-02 19:19:59,216 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:19:59,216 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:19:59,217 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:19:59,217 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:19:59,217 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:19:59,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:19:59,229 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:19:59,254 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 19:19:59,255 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:19:59,255 INFO L213 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 19:19:59,263 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:19:59,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:19:59,299 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:19:59,318 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 19:19:59,337 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 19:19:59,337 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-02-02 19:19:59,337 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 19:19:59,338 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 19:19:59,338 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-02-02 19:19:59,338 INFO L87 Difference]: Start difference. First operand 150 states and 158 transitions. Second operand 6 states. [2018-02-02 19:19:59,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:19:59,352 INFO L93 Difference]: Finished difference Result 153 states and 161 transitions. [2018-02-02 19:19:59,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 19:19:59,352 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2018-02-02 19:19:59,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:19:59,353 INFO L225 Difference]: With dead ends: 153 [2018-02-02 19:19:59,353 INFO L226 Difference]: Without dead ends: 151 [2018-02-02 19:19:59,353 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 19:19:59,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-02-02 19:19:59,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2018-02-02 19:19:59,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-02-02 19:19:59,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 159 transitions. [2018-02-02 19:19:59,358 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 159 transitions. Word has length 35 [2018-02-02 19:19:59,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:19:59,359 INFO L432 AbstractCegarLoop]: Abstraction has 151 states and 159 transitions. [2018-02-02 19:19:59,359 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 19:19:59,359 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 159 transitions. [2018-02-02 19:19:59,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-02 19:19:59,360 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:19:59,360 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 19:19:59,360 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 19:19:59,360 INFO L82 PathProgramCache]: Analyzing trace with hash -1829139958, now seen corresponding path program 1 times [2018-02-02 19:19:59,360 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:19:59,360 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:19:59,361 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:19:59,362 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:19:59,362 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:19:59,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:19:59,374 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:19:59,428 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 19:19:59,428 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:19:59,429 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 19:19:59,429 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 19:19:59,429 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 19:19:59,429 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 19:19:59,429 INFO L87 Difference]: Start difference. First operand 151 states and 159 transitions. Second operand 7 states. [2018-02-02 19:19:59,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:19:59,462 INFO L93 Difference]: Finished difference Result 161 states and 169 transitions. [2018-02-02 19:19:59,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 19:19:59,463 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2018-02-02 19:19:59,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:19:59,464 INFO L225 Difference]: With dead ends: 161 [2018-02-02 19:19:59,465 INFO L226 Difference]: Without dead ends: 161 [2018-02-02 19:19:59,465 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 19:19:59,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-02-02 19:19:59,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 157. [2018-02-02 19:19:59,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-02-02 19:19:59,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 165 transitions. [2018-02-02 19:19:59,470 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 165 transitions. Word has length 36 [2018-02-02 19:19:59,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:19:59,470 INFO L432 AbstractCegarLoop]: Abstraction has 157 states and 165 transitions. [2018-02-02 19:19:59,470 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 19:19:59,470 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 165 transitions. [2018-02-02 19:19:59,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-02 19:19:59,471 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:19:59,471 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 19:19:59,471 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 19:19:59,471 INFO L82 PathProgramCache]: Analyzing trace with hash 371943704, now seen corresponding path program 2 times [2018-02-02 19:19:59,472 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:19:59,472 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:19:59,473 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:19:59,473 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:19:59,473 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:19:59,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:19:59,484 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:19:59,529 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 19:19:59,529 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:19:59,530 INFO L213 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 19:19:59,538 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 19:19:59,564 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-02-02 19:19:59,564 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 19:19:59,568 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:19:59,595 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 19:19:59,597 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 19:19:59,615 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 19:19:59,615 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:19:59,629 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 19:19:59,629 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:36 [2018-02-02 19:20:01,888 WARN L143 SmtUtils]: Spent 2058ms on a formula simplification that was a NOOP. DAG size: 27 [2018-02-02 19:20:02,340 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 19:20:02,358 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:20:02,358 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [6] total 19 [2018-02-02 19:20:02,358 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 19:20:02,358 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 19:20:02,358 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2018-02-02 19:20:02,359 INFO L87 Difference]: Start difference. First operand 157 states and 165 transitions. Second operand 19 states. [2018-02-02 19:20:03,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:20:03,489 INFO L93 Difference]: Finished difference Result 178 states and 185 transitions. [2018-02-02 19:20:03,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 19:20:03,489 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 36 [2018-02-02 19:20:03,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:20:03,490 INFO L225 Difference]: With dead ends: 178 [2018-02-02 19:20:03,490 INFO L226 Difference]: Without dead ends: 176 [2018-02-02 19:20:03,490 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=99, Invalid=603, Unknown=0, NotChecked=0, Total=702 [2018-02-02 19:20:03,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-02-02 19:20:03,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 157. [2018-02-02 19:20:03,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-02-02 19:20:03,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 165 transitions. [2018-02-02 19:20:03,495 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 165 transitions. Word has length 36 [2018-02-02 19:20:03,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:20:03,495 INFO L432 AbstractCegarLoop]: Abstraction has 157 states and 165 transitions. [2018-02-02 19:20:03,495 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 19:20:03,496 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 165 transitions. [2018-02-02 19:20:03,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-02 19:20:03,496 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:20:03,497 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 19:20:03,497 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 19:20:03,497 INFO L82 PathProgramCache]: Analyzing trace with hash -1983848104, now seen corresponding path program 1 times [2018-02-02 19:20:03,497 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:20:03,497 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:20:03,498 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:20:03,498 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 19:20:03,498 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:20:03,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:20:03,503 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:20:03,521 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 19:20:03,521 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:20:03,522 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 19:20:03,522 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 19:20:03,522 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 19:20:03,522 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 19:20:03,523 INFO L87 Difference]: Start difference. First operand 157 states and 165 transitions. Second operand 3 states. [2018-02-02 19:20:03,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:20:03,634 INFO L93 Difference]: Finished difference Result 174 states and 183 transitions. [2018-02-02 19:20:03,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 19:20:03,634 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-02-02 19:20:03,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:20:03,635 INFO L225 Difference]: With dead ends: 174 [2018-02-02 19:20:03,635 INFO L226 Difference]: Without dead ends: 161 [2018-02-02 19:20:03,636 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 19:20:03,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-02-02 19:20:03,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 153. [2018-02-02 19:20:03,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-02-02 19:20:03,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 160 transitions. [2018-02-02 19:20:03,640 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 160 transitions. Word has length 34 [2018-02-02 19:20:03,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:20:03,640 INFO L432 AbstractCegarLoop]: Abstraction has 153 states and 160 transitions. [2018-02-02 19:20:03,640 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 19:20:03,640 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 160 transitions. [2018-02-02 19:20:03,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-02 19:20:03,641 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:20:03,641 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 19:20:03,641 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 19:20:03,642 INFO L82 PathProgramCache]: Analyzing trace with hash 515535126, now seen corresponding path program 1 times [2018-02-02 19:20:03,642 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:20:03,642 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:20:03,643 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:20:03,643 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:20:03,643 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:20:03,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:20:03,648 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:20:03,678 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 19:20:03,678 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:20:03,678 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 19:20:03,678 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 19:20:03,678 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 19:20:03,678 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 19:20:03,678 INFO L87 Difference]: Start difference. First operand 153 states and 160 transitions. Second operand 6 states. [2018-02-02 19:20:03,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:20:03,691 INFO L93 Difference]: Finished difference Result 138 states and 144 transitions. [2018-02-02 19:20:03,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 19:20:03,692 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2018-02-02 19:20:03,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:20:03,692 INFO L225 Difference]: With dead ends: 138 [2018-02-02 19:20:03,692 INFO L226 Difference]: Without dead ends: 138 [2018-02-02 19:20:03,693 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 19:20:03,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-02-02 19:20:03,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2018-02-02 19:20:03,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-02-02 19:20:03,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 144 transitions. [2018-02-02 19:20:03,697 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 144 transitions. Word has length 36 [2018-02-02 19:20:03,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:20:03,697 INFO L432 AbstractCegarLoop]: Abstraction has 138 states and 144 transitions. [2018-02-02 19:20:03,698 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 19:20:03,698 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 144 transitions. [2018-02-02 19:20:03,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-02 19:20:03,699 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:20:03,699 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 19:20:03,699 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 19:20:03,699 INFO L82 PathProgramCache]: Analyzing trace with hash -723967063, now seen corresponding path program 1 times [2018-02-02 19:20:03,699 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:20:03,699 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:20:03,700 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:20:03,701 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:20:03,701 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:20:03,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:20:03,714 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:20:03,807 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 19:20:03,807 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:20:03,808 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-02 19:20:03,808 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 19:20:03,808 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 19:20:03,808 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-02-02 19:20:03,809 INFO L87 Difference]: Start difference. First operand 138 states and 144 transitions. Second operand 10 states. [2018-02-02 19:20:04,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:20:04,045 INFO L93 Difference]: Finished difference Result 136 states and 142 transitions. [2018-02-02 19:20:04,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 19:20:04,045 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 42 [2018-02-02 19:20:04,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:20:04,045 INFO L225 Difference]: With dead ends: 136 [2018-02-02 19:20:04,045 INFO L226 Difference]: Without dead ends: 136 [2018-02-02 19:20:04,046 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 19:20:04,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-02-02 19:20:04,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2018-02-02 19:20:04,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-02-02 19:20:04,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 142 transitions. [2018-02-02 19:20:04,048 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 142 transitions. Word has length 42 [2018-02-02 19:20:04,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:20:04,049 INFO L432 AbstractCegarLoop]: Abstraction has 136 states and 142 transitions. [2018-02-02 19:20:04,049 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 19:20:04,049 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 142 transitions. [2018-02-02 19:20:04,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-02 19:20:04,050 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:20:04,050 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 19:20:04,050 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 19:20:04,050 INFO L82 PathProgramCache]: Analyzing trace with hash -723967062, now seen corresponding path program 1 times [2018-02-02 19:20:04,050 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:20:04,050 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:20:04,051 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:20:04,051 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:20:04,051 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:20:04,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:20:04,061 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:20:04,110 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 19:20:04,110 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:20:04,110 INFO L213 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 19:20:04,117 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:20:04,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:20:04,142 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:20:04,164 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 19:20:04,191 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 19:20:04,192 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-02-02 19:20:04,192 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 19:20:04,192 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 19:20:04,192 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-02-02 19:20:04,192 INFO L87 Difference]: Start difference. First operand 136 states and 142 transitions. Second operand 8 states. [2018-02-02 19:20:04,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:20:04,302 INFO L93 Difference]: Finished difference Result 139 states and 145 transitions. [2018-02-02 19:20:04,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 19:20:04,302 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 42 [2018-02-02 19:20:04,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:20:04,303 INFO L225 Difference]: With dead ends: 139 [2018-02-02 19:20:04,303 INFO L226 Difference]: Without dead ends: 137 [2018-02-02 19:20:04,303 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 19:20:04,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-02-02 19:20:04,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2018-02-02 19:20:04,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-02-02 19:20:04,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 143 transitions. [2018-02-02 19:20:04,306 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 143 transitions. Word has length 42 [2018-02-02 19:20:04,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:20:04,306 INFO L432 AbstractCegarLoop]: Abstraction has 137 states and 143 transitions. [2018-02-02 19:20:04,306 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 19:20:04,306 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 143 transitions. [2018-02-02 19:20:04,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-02 19:20:04,307 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:20:04,307 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 19:20:04,307 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 19:20:04,307 INFO L82 PathProgramCache]: Analyzing trace with hash -1816266347, now seen corresponding path program 2 times [2018-02-02 19:20:04,307 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:20:04,308 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:20:04,308 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:20:04,308 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:20:04,308 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:20:04,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:20:04,318 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:20:04,354 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 19:20:04,354 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:20:04,355 INFO L213 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 19:20:04,368 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 19:20:04,389 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-02-02 19:20:04,390 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 19:20:04,393 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:20:04,400 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 19:20:04,400 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 19:20:04,416 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 19:20:04,416 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:20:04,432 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 19:20:04,432 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:36 [2018-02-02 19:20:04,830 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 19:20:04,849 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:20:04,849 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [8] total 22 [2018-02-02 19:20:04,849 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 19:20:04,849 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 19:20:04,850 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=390, Unknown=0, NotChecked=0, Total=462 [2018-02-02 19:20:04,850 INFO L87 Difference]: Start difference. First operand 137 states and 143 transitions. Second operand 22 states. [2018-02-02 19:20:05,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:20:05,652 INFO L93 Difference]: Finished difference Result 138 states and 144 transitions. [2018-02-02 19:20:05,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-02 19:20:05,652 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 43 [2018-02-02 19:20:05,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:20:05,653 INFO L225 Difference]: With dead ends: 138 [2018-02-02 19:20:05,653 INFO L226 Difference]: Without dead ends: 136 [2018-02-02 19:20:05,654 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=147, Invalid=845, Unknown=0, NotChecked=0, Total=992 [2018-02-02 19:20:05,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-02-02 19:20:05,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2018-02-02 19:20:05,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-02-02 19:20:05,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 142 transitions. [2018-02-02 19:20:05,657 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 142 transitions. Word has length 43 [2018-02-02 19:20:05,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:20:05,657 INFO L432 AbstractCegarLoop]: Abstraction has 136 states and 142 transitions. [2018-02-02 19:20:05,657 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 19:20:05,657 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 142 transitions. [2018-02-02 19:20:05,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-02 19:20:05,658 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:20:05,658 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 19:20:05,658 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 19:20:05,658 INFO L82 PathProgramCache]: Analyzing trace with hash -2123180192, now seen corresponding path program 1 times [2018-02-02 19:20:05,659 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:20:05,659 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:20:05,659 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:20:05,660 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 19:20:05,660 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:20:05,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:20:05,668 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:20:05,714 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 19:20:05,714 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:20:05,715 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 19:20:05,715 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 19:20:05,715 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 19:20:05,715 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-02 19:20:05,715 INFO L87 Difference]: Start difference. First operand 136 states and 142 transitions. Second operand 8 states. [2018-02-02 19:20:05,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:20:05,735 INFO L93 Difference]: Finished difference Result 138 states and 143 transitions. [2018-02-02 19:20:05,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 19:20:05,735 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 47 [2018-02-02 19:20:05,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:20:05,736 INFO L225 Difference]: With dead ends: 138 [2018-02-02 19:20:05,736 INFO L226 Difference]: Without dead ends: 136 [2018-02-02 19:20:05,736 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 19:20:05,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-02-02 19:20:05,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2018-02-02 19:20:05,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-02-02 19:20:05,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 141 transitions. [2018-02-02 19:20:05,738 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 141 transitions. Word has length 47 [2018-02-02 19:20:05,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:20:05,738 INFO L432 AbstractCegarLoop]: Abstraction has 136 states and 141 transitions. [2018-02-02 19:20:05,738 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 19:20:05,738 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 141 transitions. [2018-02-02 19:20:05,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-02 19:20:05,738 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:20:05,738 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 19:20:05,738 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 19:20:05,738 INFO L82 PathProgramCache]: Analyzing trace with hash -1684319326, now seen corresponding path program 1 times [2018-02-02 19:20:05,738 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:20:05,739 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:20:05,739 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:20:05,739 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:20:05,739 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:20:05,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:20:05,745 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:20:05,804 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 19:20:05,804 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:20:05,804 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-02 19:20:05,805 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 19:20:05,805 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 19:20:05,805 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-02-02 19:20:05,805 INFO L87 Difference]: Start difference. First operand 136 states and 141 transitions. Second operand 10 states. [2018-02-02 19:20:05,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:20:05,848 INFO L93 Difference]: Finished difference Result 140 states and 144 transitions. [2018-02-02 19:20:05,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 19:20:05,849 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 52 [2018-02-02 19:20:05,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:20:05,850 INFO L225 Difference]: With dead ends: 140 [2018-02-02 19:20:05,850 INFO L226 Difference]: Without dead ends: 136 [2018-02-02 19:20:05,850 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 19:20:05,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-02-02 19:20:05,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2018-02-02 19:20:05,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-02-02 19:20:05,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 140 transitions. [2018-02-02 19:20:05,853 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 140 transitions. Word has length 52 [2018-02-02 19:20:05,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:20:05,853 INFO L432 AbstractCegarLoop]: Abstraction has 136 states and 140 transitions. [2018-02-02 19:20:05,854 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 19:20:05,854 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 140 transitions. [2018-02-02 19:20:05,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-02-02 19:20:05,854 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:20:05,854 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 19:20:05,854 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 19:20:05,854 INFO L82 PathProgramCache]: Analyzing trace with hash 1703813979, now seen corresponding path program 1 times [2018-02-02 19:20:05,855 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:20:05,855 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:20:05,855 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:20:05,855 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:20:05,855 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:20:05,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:20:05,863 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:20:05,952 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 19:20:05,952 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:20:05,952 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-02-02 19:20:05,952 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 19:20:05,952 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 19:20:05,952 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-02-02 19:20:05,952 INFO L87 Difference]: Start difference. First operand 136 states and 140 transitions. Second operand 13 states. [2018-02-02 19:20:06,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:20:06,140 INFO L93 Difference]: Finished difference Result 134 states and 138 transitions. [2018-02-02 19:20:06,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 19:20:06,140 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 63 [2018-02-02 19:20:06,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:20:06,140 INFO L225 Difference]: With dead ends: 134 [2018-02-02 19:20:06,141 INFO L226 Difference]: Without dead ends: 134 [2018-02-02 19:20:06,141 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2018-02-02 19:20:06,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-02-02 19:20:06,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2018-02-02 19:20:06,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-02-02 19:20:06,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 138 transitions. [2018-02-02 19:20:06,144 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 138 transitions. Word has length 63 [2018-02-02 19:20:06,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:20:06,144 INFO L432 AbstractCegarLoop]: Abstraction has 134 states and 138 transitions. [2018-02-02 19:20:06,144 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 19:20:06,144 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 138 transitions. [2018-02-02 19:20:06,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-02-02 19:20:06,145 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:20:06,145 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 19:20:06,145 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 19:20:06,146 INFO L82 PathProgramCache]: Analyzing trace with hash 1703813980, now seen corresponding path program 1 times [2018-02-02 19:20:06,146 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:20:06,146 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:20:06,150 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:20:06,150 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:20:06,150 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:20:06,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:20:06,163 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:20:06,200 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 19:20:06,200 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:20:06,200 INFO L213 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 19:20:06,207 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:20:06,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:20:06,241 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:20:06,255 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 19:20:06,273 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 19:20:06,273 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-02-02 19:20:06,273 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 19:20:06,273 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 19:20:06,273 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2018-02-02 19:20:06,274 INFO L87 Difference]: Start difference. First operand 134 states and 138 transitions. Second operand 10 states. [2018-02-02 19:20:06,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:20:06,288 INFO L93 Difference]: Finished difference Result 137 states and 141 transitions. [2018-02-02 19:20:06,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 19:20:06,289 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 63 [2018-02-02 19:20:06,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:20:06,289 INFO L225 Difference]: With dead ends: 137 [2018-02-02 19:20:06,289 INFO L226 Difference]: Without dead ends: 135 [2018-02-02 19:20:06,289 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 19:20:06,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-02-02 19:20:06,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2018-02-02 19:20:06,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-02-02 19:20:06,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 139 transitions. [2018-02-02 19:20:06,291 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 139 transitions. Word has length 63 [2018-02-02 19:20:06,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:20:06,292 INFO L432 AbstractCegarLoop]: Abstraction has 135 states and 139 transitions. [2018-02-02 19:20:06,292 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 19:20:06,292 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 139 transitions. [2018-02-02 19:20:06,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-02-02 19:20:06,292 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:20:06,292 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 19:20:06,292 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 19:20:06,292 INFO L82 PathProgramCache]: Analyzing trace with hash 1580383825, now seen corresponding path program 2 times [2018-02-02 19:20:06,292 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:20:06,292 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:20:06,299 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:20:06,299 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:20:06,299 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:20:06,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:20:06,307 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:20:06,348 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 19:20:06,349 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:20:06,349 INFO L213 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 19:20:06,355 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 19:20:06,379 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-02-02 19:20:06,379 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 19:20:06,383 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:20:06,388 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 19:20:06,388 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 19:20:06,399 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 19:20:06,399 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:20:06,408 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 19:20:06,408 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:36 [2018-02-02 19:20:06,907 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 19:20:06,924 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:20:06,924 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [10] total 27 [2018-02-02 19:20:06,925 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-02 19:20:06,925 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-02 19:20:06,926 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=603, Unknown=0, NotChecked=0, Total=702 [2018-02-02 19:20:06,926 INFO L87 Difference]: Start difference. First operand 135 states and 139 transitions. Second operand 27 states. [2018-02-02 19:20:07,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:20:07,828 INFO L93 Difference]: Finished difference Result 136 states and 140 transitions. [2018-02-02 19:20:07,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-02 19:20:07,829 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 64 [2018-02-02 19:20:07,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:20:07,829 INFO L225 Difference]: With dead ends: 136 [2018-02-02 19:20:07,829 INFO L226 Difference]: Without dead ends: 134 [2018-02-02 19:20:07,830 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 319 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=213, Invalid=1347, Unknown=0, NotChecked=0, Total=1560 [2018-02-02 19:20:07,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-02-02 19:20:07,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2018-02-02 19:20:07,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-02-02 19:20:07,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 138 transitions. [2018-02-02 19:20:07,831 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 138 transitions. Word has length 64 [2018-02-02 19:20:07,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:20:07,832 INFO L432 AbstractCegarLoop]: Abstraction has 134 states and 138 transitions. [2018-02-02 19:20:07,832 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-02 19:20:07,832 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 138 transitions. [2018-02-02 19:20:07,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-02-02 19:20:07,832 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:20:07,832 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 19:20:07,832 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 19:20:07,832 INFO L82 PathProgramCache]: Analyzing trace with hash -1086612526, now seen corresponding path program 1 times [2018-02-02 19:20:07,832 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:20:07,832 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:20:07,833 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:20:07,833 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 19:20:07,833 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:20:07,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:20:07,842 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:20:07,925 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 19:20:07,925 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:20:07,926 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-02 19:20:07,926 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 19:20:07,926 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 19:20:07,926 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-02-02 19:20:07,926 INFO L87 Difference]: Start difference. First operand 134 states and 138 transitions. Second operand 11 states. [2018-02-02 19:20:07,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:20:07,998 INFO L93 Difference]: Finished difference Result 137 states and 140 transitions. [2018-02-02 19:20:07,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 19:20:07,999 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 74 [2018-02-02 19:20:07,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:20:07,999 INFO L225 Difference]: With dead ends: 137 [2018-02-02 19:20:07,999 INFO L226 Difference]: Without dead ends: 134 [2018-02-02 19:20:07,999 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 19:20:08,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-02-02 19:20:08,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2018-02-02 19:20:08,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-02-02 19:20:08,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 137 transitions. [2018-02-02 19:20:08,001 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 137 transitions. Word has length 74 [2018-02-02 19:20:08,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:20:08,001 INFO L432 AbstractCegarLoop]: Abstraction has 134 states and 137 transitions. [2018-02-02 19:20:08,001 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 19:20:08,001 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 137 transitions. [2018-02-02 19:20:08,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-02-02 19:20:08,002 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:20:08,002 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 19:20:08,002 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 19:20:08,002 INFO L82 PathProgramCache]: Analyzing trace with hash 27384906, now seen corresponding path program 1 times [2018-02-02 19:20:08,002 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:20:08,002 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:20:08,003 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:20:08,003 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:20:08,003 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:20:08,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:20:08,015 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:20:08,190 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 19:20:08,190 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:20:08,190 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-02-02 19:20:08,190 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 19:20:08,191 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 19:20:08,191 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2018-02-02 19:20:08,191 INFO L87 Difference]: Start difference. First operand 134 states and 137 transitions. Second operand 18 states. [2018-02-02 19:20:08,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:20:08,434 INFO L93 Difference]: Finished difference Result 141 states and 144 transitions. [2018-02-02 19:20:08,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 19:20:08,434 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 87 [2018-02-02 19:20:08,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:20:08,435 INFO L225 Difference]: With dead ends: 141 [2018-02-02 19:20:08,435 INFO L226 Difference]: Without dead ends: 141 [2018-02-02 19:20:08,436 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 19:20:08,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-02-02 19:20:08,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 132. [2018-02-02 19:20:08,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-02-02 19:20:08,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 135 transitions. [2018-02-02 19:20:08,438 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 135 transitions. Word has length 87 [2018-02-02 19:20:08,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:20:08,438 INFO L432 AbstractCegarLoop]: Abstraction has 132 states and 135 transitions. [2018-02-02 19:20:08,438 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 19:20:08,438 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 135 transitions. [2018-02-02 19:20:08,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-02-02 19:20:08,439 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:20:08,439 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 19:20:08,439 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 19:20:08,439 INFO L82 PathProgramCache]: Analyzing trace with hash 27384907, now seen corresponding path program 1 times [2018-02-02 19:20:08,439 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:20:08,439 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:20:08,440 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:20:08,441 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:20:08,441 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:20:08,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:20:08,453 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:20:08,512 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 19:20:08,512 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:20:08,512 INFO L213 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 19:20:08,519 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:20:08,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:20:08,561 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:20:08,575 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 19:20:08,595 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 19:20:08,595 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-02-02 19:20:08,596 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 19:20:08,596 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 19:20:08,596 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2018-02-02 19:20:08,596 INFO L87 Difference]: Start difference. First operand 132 states and 135 transitions. Second operand 12 states. [2018-02-02 19:20:08,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:20:08,624 INFO L93 Difference]: Finished difference Result 135 states and 138 transitions. [2018-02-02 19:20:08,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 19:20:08,625 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 87 [2018-02-02 19:20:08,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:20:08,626 INFO L225 Difference]: With dead ends: 135 [2018-02-02 19:20:08,626 INFO L226 Difference]: Without dead ends: 133 [2018-02-02 19:20:08,626 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 19:20:08,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-02-02 19:20:08,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2018-02-02 19:20:08,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-02-02 19:20:08,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 136 transitions. [2018-02-02 19:20:08,629 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 136 transitions. Word has length 87 [2018-02-02 19:20:08,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:20:08,629 INFO L432 AbstractCegarLoop]: Abstraction has 133 states and 136 transitions. [2018-02-02 19:20:08,629 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 19:20:08,629 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 136 transitions. [2018-02-02 19:20:08,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-02-02 19:20:08,630 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:20:08,630 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 19:20:08,630 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 19:20:08,630 INFO L82 PathProgramCache]: Analyzing trace with hash -556652480, now seen corresponding path program 2 times [2018-02-02 19:20:08,630 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:20:08,630 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:20:08,631 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:20:08,631 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:20:08,631 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:20:08,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:20:08,641 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:20:08,732 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 19:20:08,733 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:20:08,733 INFO L213 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 19:20:08,741 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 19:20:08,796 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-02-02 19:20:08,796 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 19:20:08,801 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:20:08,812 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 19:20:08,812 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 19:20:08,827 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 19:20:08,827 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:20:08,841 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 19:20:08,841 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:36 [2018-02-02 19:20:09,649 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 19:20:09,678 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:20:09,679 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [12] total 31 [2018-02-02 19:20:09,679 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-02-02 19:20:09,679 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-02-02 19:20:09,679 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=804, Unknown=0, NotChecked=0, Total=930 [2018-02-02 19:20:09,679 INFO L87 Difference]: Start difference. First operand 133 states and 136 transitions. Second operand 31 states. [2018-02-02 19:20:10,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:20:10,883 INFO L93 Difference]: Finished difference Result 134 states and 137 transitions. [2018-02-02 19:20:10,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-02 19:20:10,884 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 88 [2018-02-02 19:20:10,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:20:10,884 INFO L225 Difference]: With dead ends: 134 [2018-02-02 19:20:10,884 INFO L226 Difference]: Without dead ends: 132 [2018-02-02 19:20:10,885 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 67 SyntacticMatches, 3 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 488 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=286, Invalid=1876, Unknown=0, NotChecked=0, Total=2162 [2018-02-02 19:20:10,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-02-02 19:20:10,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2018-02-02 19:20:10,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-02-02 19:20:10,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 135 transitions. [2018-02-02 19:20:10,887 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 135 transitions. Word has length 88 [2018-02-02 19:20:10,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:20:10,888 INFO L432 AbstractCegarLoop]: Abstraction has 132 states and 135 transitions. [2018-02-02 19:20:10,888 INFO L433 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-02-02 19:20:10,888 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 135 transitions. [2018-02-02 19:20:10,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-02-02 19:20:10,888 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:20:10,889 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 19:20:10,889 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 19:20:10,889 INFO L82 PathProgramCache]: Analyzing trace with hash -2005833160, now seen corresponding path program 1 times [2018-02-02 19:20:10,889 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:20:10,889 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:20:10,890 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:20:10,890 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 19:20:10,890 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:20:10,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:20:10,904 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:20:10,971 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 19:20:10,972 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:20:10,972 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-02 19:20:10,972 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 19:20:10,972 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 19:20:10,972 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-02-02 19:20:10,973 INFO L87 Difference]: Start difference. First operand 132 states and 135 transitions. Second operand 11 states. [2018-02-02 19:20:11,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:20:11,027 INFO L93 Difference]: Finished difference Result 134 states and 136 transitions. [2018-02-02 19:20:11,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 19:20:11,027 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 87 [2018-02-02 19:20:11,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:20:11,028 INFO L225 Difference]: With dead ends: 134 [2018-02-02 19:20:11,028 INFO L226 Difference]: Without dead ends: 132 [2018-02-02 19:20:11,028 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 19:20:11,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-02-02 19:20:11,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2018-02-02 19:20:11,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-02-02 19:20:11,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 134 transitions. [2018-02-02 19:20:11,031 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 134 transitions. Word has length 87 [2018-02-02 19:20:11,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:20:11,031 INFO L432 AbstractCegarLoop]: Abstraction has 132 states and 134 transitions. [2018-02-02 19:20:11,031 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 19:20:11,031 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 134 transitions. [2018-02-02 19:20:11,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-02-02 19:20:11,032 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:20:11,032 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 19:20:11,032 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 19:20:11,032 INFO L82 PathProgramCache]: Analyzing trace with hash -1275758021, now seen corresponding path program 1 times [2018-02-02 19:20:11,032 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:20:11,032 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:20:11,033 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:20:11,033 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:20:11,033 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:20:11,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:20:11,049 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:20:11,278 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 19:20:11,279 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:20:11,305 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2018-02-02 19:20:11,305 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 19:20:11,306 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 19:20:11,306 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=419, Unknown=0, NotChecked=0, Total=462 [2018-02-02 19:20:11,306 INFO L87 Difference]: Start difference. First operand 132 states and 134 transitions. Second operand 22 states. [2018-02-02 19:20:11,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:20:11,586 INFO L93 Difference]: Finished difference Result 135 states and 137 transitions. [2018-02-02 19:20:11,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-02 19:20:11,586 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 103 [2018-02-02 19:20:11,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:20:11,587 INFO L225 Difference]: With dead ends: 135 [2018-02-02 19:20:11,587 INFO L226 Difference]: Without dead ends: 135 [2018-02-02 19:20:11,587 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 19:20:11,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-02-02 19:20:11,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 130. [2018-02-02 19:20:11,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-02-02 19:20:11,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 132 transitions. [2018-02-02 19:20:11,589 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 132 transitions. Word has length 103 [2018-02-02 19:20:11,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:20:11,589 INFO L432 AbstractCegarLoop]: Abstraction has 130 states and 132 transitions. [2018-02-02 19:20:11,589 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 19:20:11,589 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 132 transitions. [2018-02-02 19:20:11,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-02-02 19:20:11,590 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:20:11,590 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 19:20:11,590 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 19:20:11,590 INFO L82 PathProgramCache]: Analyzing trace with hash -1275758020, now seen corresponding path program 1 times [2018-02-02 19:20:11,590 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:20:11,590 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:20:11,591 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:20:11,591 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:20:11,591 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:20:11,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:20:11,607 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:20:11,712 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 19:20:11,712 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:20:11,712 INFO L213 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 19:20:11,720 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:20:11,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:20:11,785 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:20:11,811 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 19:20:11,840 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 19:20:11,840 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2018-02-02 19:20:11,840 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 19:20:11,840 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 19:20:11,841 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=102, Unknown=0, NotChecked=0, Total=182 [2018-02-02 19:20:11,841 INFO L87 Difference]: Start difference. First operand 130 states and 132 transitions. Second operand 14 states. [2018-02-02 19:20:11,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:20:11,863 INFO L93 Difference]: Finished difference Result 133 states and 135 transitions. [2018-02-02 19:20:11,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 19:20:11,863 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 103 [2018-02-02 19:20:11,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:20:11,863 INFO L225 Difference]: With dead ends: 133 [2018-02-02 19:20:11,863 INFO L226 Difference]: Without dead ends: 131 [2018-02-02 19:20:11,864 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 19:20:11,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-02-02 19:20:11,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2018-02-02 19:20:11,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-02-02 19:20:11,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 133 transitions. [2018-02-02 19:20:11,865 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 133 transitions. Word has length 103 [2018-02-02 19:20:11,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:20:11,865 INFO L432 AbstractCegarLoop]: Abstraction has 131 states and 133 transitions. [2018-02-02 19:20:11,865 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 19:20:11,865 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 133 transitions. [2018-02-02 19:20:11,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-02-02 19:20:11,866 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:20:11,866 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 19:20:11,866 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 19:20:11,866 INFO L82 PathProgramCache]: Analyzing trace with hash 666975281, now seen corresponding path program 2 times [2018-02-02 19:20:11,866 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:20:11,866 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:20:11,867 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:20:11,867 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:20:11,867 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:20:11,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:20:11,878 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:20:11,946 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 19:20:11,946 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:20:11,947 INFO L213 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 19:20:11,962 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 19:20:12,018 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-02-02 19:20:12,018 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 19:20:12,024 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:20:12,028 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 19:20:12,028 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 19:20:12,038 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 19:20:12,038 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:20:12,047 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 19:20:12,048 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:36 [2018-02-02 19:20:12,830 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 19:20:12,848 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:20:12,848 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [14] total 37 [2018-02-02 19:20:12,848 INFO L409 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-02-02 19:20:12,848 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-02-02 19:20:12,848 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=1167, Unknown=0, NotChecked=0, Total=1332 [2018-02-02 19:20:12,849 INFO L87 Difference]: Start difference. First operand 131 states and 133 transitions. Second operand 37 states. [2018-02-02 19:20:14,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:20:14,255 INFO L93 Difference]: Finished difference Result 132 states and 134 transitions. [2018-02-02 19:20:14,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-02-02 19:20:14,255 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 104 [2018-02-02 19:20:14,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:20:14,255 INFO L225 Difference]: With dead ends: 132 [2018-02-02 19:20:14,255 INFO L226 Difference]: Without dead ends: 130 [2018-02-02 19:20:14,256 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 77 SyntacticMatches, 5 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 768 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=385, Invalid=2807, Unknown=0, NotChecked=0, Total=3192 [2018-02-02 19:20:14,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-02-02 19:20:14,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2018-02-02 19:20:14,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-02-02 19:20:14,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 132 transitions. [2018-02-02 19:20:14,258 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 132 transitions. Word has length 104 [2018-02-02 19:20:14,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:20:14,258 INFO L432 AbstractCegarLoop]: Abstraction has 130 states and 132 transitions. [2018-02-02 19:20:14,258 INFO L433 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-02-02 19:20:14,258 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 132 transitions. [2018-02-02 19:20:14,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-02-02 19:20:14,258 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:20:14,258 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 19:20:14,258 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 19:20:14,259 INFO L82 PathProgramCache]: Analyzing trace with hash -603686051, now seen corresponding path program 1 times [2018-02-02 19:20:14,259 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:20:14,259 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:20:14,259 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:20:14,260 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 19:20:14,260 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:20:14,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:20:14,274 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:20:14,366 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 19:20:14,367 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:20:14,367 INFO L213 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 19:20:14,372 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:20:14,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:20:14,410 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:20:14,418 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 19:20:14,436 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 19:20:14,436 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2018-02-02 19:20:14,437 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 19:20:14,437 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 19:20:14,437 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=133, Unknown=0, NotChecked=0, Total=240 [2018-02-02 19:20:14,437 INFO L87 Difference]: Start difference. First operand 130 states and 132 transitions. Second operand 16 states. [2018-02-02 19:20:14,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:20:14,457 INFO L93 Difference]: Finished difference Result 133 states and 135 transitions. [2018-02-02 19:20:14,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 19:20:14,468 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 109 [2018-02-02 19:20:14,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:20:14,468 INFO L225 Difference]: With dead ends: 133 [2018-02-02 19:20:14,468 INFO L226 Difference]: Without dead ends: 131 [2018-02-02 19:20:14,469 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 19:20:14,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-02-02 19:20:14,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2018-02-02 19:20:14,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-02-02 19:20:14,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 133 transitions. [2018-02-02 19:20:14,471 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 133 transitions. Word has length 109 [2018-02-02 19:20:14,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:20:14,472 INFO L432 AbstractCegarLoop]: Abstraction has 131 states and 133 transitions. [2018-02-02 19:20:14,472 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 19:20:14,472 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 133 transitions. [2018-02-02 19:20:14,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-02-02 19:20:14,472 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:20:14,472 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 19:20:14,473 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 19:20:14,473 INFO L82 PathProgramCache]: Analyzing trace with hash 1049768338, now seen corresponding path program 2 times [2018-02-02 19:20:14,473 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:20:14,473 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:20:14,474 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:20:14,474 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:20:14,474 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:20:14,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:20:14,491 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:20:14,620 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 19:20:14,621 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:20:14,621 INFO L213 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 19:20:14,630 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 19:20:14,679 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-02-02 19:20:14,679 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 19:20:14,685 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:20:14,742 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 19:20:14,743 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 19:20:14,743 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:20:14,744 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:20:14,745 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:20:14,745 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-02-02 19:20:14,836 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 19:20:14,838 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 19:20:14,841 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 19:20:14,841 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:26 [2018-02-02 19:20:14,870 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 19:20:14,872 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:20:14,875 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 19:20:14,892 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:20:14,893 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:20:14,896 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 19:20:14,896 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 19:20:14,901 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:20:14,904 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:20:14,907 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 19:20:14,907 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:37, output treesize:9 [2018-02-02 19:20:15,220 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:20:15,221 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 19:20:15,222 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 19:20:15,223 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:20:15,224 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 19:20:15,224 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:20:15,226 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:20:15,228 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:20:15,228 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:13 [2018-02-02 19:20:15,555 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 19:20:15,556 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 19:20:15,556 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:20:15,557 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:20:15,558 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 19:20:15,558 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-02-02 19:20:15,593 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 19:20:15,610 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:20:15,611 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [41] imperfect sequences [16] total 55 [2018-02-02 19:20:15,611 INFO L409 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-02-02 19:20:15,611 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-02-02 19:20:15,612 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=2773, Unknown=0, NotChecked=0, Total=2970 [2018-02-02 19:20:15,612 INFO L87 Difference]: Start difference. First operand 131 states and 133 transitions. Second operand 55 states. [2018-02-02 19:20:17,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:20:17,110 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2018-02-02 19:20:17,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-02-02 19:20:17,111 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 110 [2018-02-02 19:20:17,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:20:17,111 INFO L225 Difference]: With dead ends: 114 [2018-02-02 19:20:17,111 INFO L226 Difference]: Without dead ends: 112 [2018-02-02 19:20:17,113 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1033 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=313, Invalid=5693, Unknown=0, NotChecked=0, Total=6006 [2018-02-02 19:20:17,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-02-02 19:20:17,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2018-02-02 19:20:17,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-02-02 19:20:17,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 112 transitions. [2018-02-02 19:20:17,114 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 112 transitions. Word has length 110 [2018-02-02 19:20:17,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:20:17,114 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 112 transitions. [2018-02-02 19:20:17,114 INFO L433 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-02-02 19:20:17,115 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2018-02-02 19:20:17,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-02-02 19:20:17,115 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:20:17,115 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 19:20:17,115 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 19:20:17,115 INFO L82 PathProgramCache]: Analyzing trace with hash 1499710248, now seen corresponding path program 1 times [2018-02-02 19:20:17,115 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:20:17,115 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:20:17,116 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:20:17,116 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 19:20:17,116 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:20:17,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:20:17,127 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:20:17,266 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 19:20:17,266 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:20:17,266 INFO L213 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 19:20:17,273 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:20:17,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:20:17,327 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:20:17,340 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 19:20:17,369 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 19:20:17,369 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2018-02-02 19:20:17,369 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 19:20:17,369 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 19:20:17,370 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=168, Unknown=0, NotChecked=0, Total=306 [2018-02-02 19:20:17,370 INFO L87 Difference]: Start difference. First operand 112 states and 112 transitions. Second operand 18 states. [2018-02-02 19:20:17,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:20:17,391 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2018-02-02 19:20:17,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-02 19:20:17,391 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 111 [2018-02-02 19:20:17,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:20:17,392 INFO L225 Difference]: With dead ends: 115 [2018-02-02 19:20:17,392 INFO L226 Difference]: Without dead ends: 113 [2018-02-02 19:20:17,392 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 19:20:17,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-02-02 19:20:17,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-02-02 19:20:17,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-02-02 19:20:17,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2018-02-02 19:20:17,393 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 111 [2018-02-02 19:20:17,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:20:17,393 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2018-02-02 19:20:17,393 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 19:20:17,393 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2018-02-02 19:20:17,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-02-02 19:20:17,394 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:20:17,394 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 19:20:17,394 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 19:20:17,394 INFO L82 PathProgramCache]: Analyzing trace with hash 1331478557, now seen corresponding path program 2 times [2018-02-02 19:20:17,394 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:20:17,394 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:20:17,395 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:20:17,395 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:20:17,395 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:20:17,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:20:17,411 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:20:17,572 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 19:20:17,573 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:20:17,573 INFO L213 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 19:20:17,578 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 19:20:17,630 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-02 19:20:17,630 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 19:20:17,633 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:20:17,643 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 19:20:17,660 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 19:20:17,661 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2018-02-02 19:20:17,661 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 19:20:17,661 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 19:20:17,661 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=187, Unknown=0, NotChecked=0, Total=342 [2018-02-02 19:20:17,661 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 19 states. [2018-02-02 19:20:17,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:20:17,700 INFO L93 Difference]: Finished difference Result 116 states and 116 transitions. [2018-02-02 19:20:17,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 19:20:17,701 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 112 [2018-02-02 19:20:17,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:20:17,701 INFO L225 Difference]: With dead ends: 116 [2018-02-02 19:20:17,701 INFO L226 Difference]: Without dead ends: 114 [2018-02-02 19:20:17,701 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 19:20:17,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-02-02 19:20:17,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2018-02-02 19:20:17,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-02-02 19:20:17,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 114 transitions. [2018-02-02 19:20:17,703 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 114 transitions. Word has length 112 [2018-02-02 19:20:17,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:20:17,703 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 114 transitions. [2018-02-02 19:20:17,703 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 19:20:17,703 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 114 transitions. [2018-02-02 19:20:17,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-02-02 19:20:17,703 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:20:17,703 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 19:20:17,703 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 19:20:17,703 INFO L82 PathProgramCache]: Analyzing trace with hash 411263432, now seen corresponding path program 3 times [2018-02-02 19:20:17,704 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:20:17,704 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:20:17,704 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:20:17,704 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 19:20:17,704 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:20:17,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:20:17,715 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:20:17,885 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 19:20:17,885 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:20:17,885 INFO L213 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 19:20:17,893 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-02 19:20:26,811 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-02-02 19:20:26,811 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 19:20:26,817 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:20:26,995 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 19:20:27,015 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 19:20:27,015 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 24] total 41 [2018-02-02 19:20:27,015 INFO L409 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-02-02 19:20:27,015 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-02-02 19:20:27,016 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=472, Invalid=1168, Unknown=0, NotChecked=0, Total=1640 [2018-02-02 19:20:27,016 INFO L87 Difference]: Start difference. First operand 114 states and 114 transitions. Second operand 41 states. [2018-02-02 19:20:27,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:20:27,126 INFO L93 Difference]: Finished difference Result 117 states and 117 transitions. [2018-02-02 19:20:27,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-02 19:20:27,126 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 113 [2018-02-02 19:20:27,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:20:27,126 INFO L225 Difference]: With dead ends: 117 [2018-02-02 19:20:27,127 INFO L226 Difference]: Without dead ends: 115 [2018-02-02 19:20:27,127 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 650 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=518, Invalid=1374, Unknown=0, NotChecked=0, Total=1892 [2018-02-02 19:20:27,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-02-02 19:20:27,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2018-02-02 19:20:27,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-02-02 19:20:27,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2018-02-02 19:20:27,128 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 115 transitions. Word has length 113 [2018-02-02 19:20:27,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:20:27,128 INFO L432 AbstractCegarLoop]: Abstraction has 115 states and 115 transitions. [2018-02-02 19:20:27,128 INFO L433 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-02-02 19:20:27,129 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 115 transitions. [2018-02-02 19:20:27,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-02-02 19:20:27,129 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:20:27,129 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 19:20:27,129 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 19:20:27,129 INFO L82 PathProgramCache]: Analyzing trace with hash 1949365629, now seen corresponding path program 4 times [2018-02-02 19:20:27,129 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:20:27,129 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:20:27,130 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:20:27,130 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 19:20:27,130 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:20:27,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-02 19:20:27,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-02 19:20:27,253 INFO L410 BasicCegarLoop]: Counterexample might be feasible [2018-02-02 19:20:27,267 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification free ensures #res.base == #ptr.base && #res.offset == #ptr.offset; is not ensure(true) [2018-02-02 19:20:27,273 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-02-02 19:20:27,288 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 07:20:27 BoogieIcfgContainer [2018-02-02 19:20:27,288 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 19:20:27,289 INFO L168 Benchmark]: Toolchain (without parser) took 30194.76 ms. Allocated memory was 402.7 MB in the beginning and 872.9 MB in the end (delta: 470.3 MB). Free memory was 359.3 MB in the beginning and 420.9 MB in the end (delta: -61.5 MB). Peak memory consumption was 408.8 MB. Max. memory is 5.3 GB. [2018-02-02 19:20:27,290 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 402.7 MB. Free memory is still 366.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 19:20:27,290 INFO L168 Benchmark]: CACSL2BoogieTranslator took 170.39 ms. Allocated memory is still 402.7 MB. Free memory was 359.3 MB in the beginning and 344.8 MB in the end (delta: 14.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 5.3 GB. [2018-02-02 19:20:27,290 INFO L168 Benchmark]: Boogie Preprocessor took 32.30 ms. Allocated memory is still 402.7 MB. Free memory was 344.8 MB in the beginning and 343.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-02 19:20:27,291 INFO L168 Benchmark]: RCFGBuilder took 347.08 ms. Allocated memory is still 402.7 MB. Free memory was 343.5 MB in the beginning and 306.4 MB in the end (delta: 37.1 MB). Peak memory consumption was 37.1 MB. Max. memory is 5.3 GB. [2018-02-02 19:20:27,291 INFO L168 Benchmark]: TraceAbstraction took 29641.64 ms. Allocated memory was 402.7 MB in the beginning and 872.9 MB in the end (delta: 470.3 MB). Free memory was 306.4 MB in the beginning and 420.9 MB in the end (delta: -114.5 MB). Peak memory consumption was 355.8 MB. Max. memory is 5.3 GB. [2018-02-02 19:20:27,292 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 402.7 MB. Free memory is still 366.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 170.39 ms. Allocated memory is still 402.7 MB. Free memory was 359.3 MB in the beginning and 344.8 MB in the end (delta: 14.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 32.30 ms. Allocated memory is still 402.7 MB. Free memory was 344.8 MB in the beginning and 343.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 347.08 ms. Allocated memory is still 402.7 MB. Free memory was 343.5 MB in the beginning and 306.4 MB in the end (delta: 37.1 MB). Peak memory consumption was 37.1 MB. Max. memory is 5.3 GB. * TraceAbstraction took 29641.64 ms. Allocated memory was 402.7 MB in the beginning and 872.9 MB in the end (delta: 470.3 MB). Free memory was 306.4 MB in the beginning and 420.9 MB in the end (delta: -114.5 MB). Peak memory consumption was 355.8 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, 29.5s OverallTime, 33 OverallIterations, 16 TraceHistogramMax, 9.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3827 SDtfs, 1065 SDslu, 33630 SDs, 0 SdLazy, 11654 SolverSat, 304 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1687 GetRequests, 1105 SyntacticMatches, 10 SemanticMatches, 572 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3804 ImplicationChecksByTransitivity, 10.1s 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.6s SatisfiabilityAnalysisTime, 9.2s 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_19-20-27-298.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_19-20-27-298.csv Received shutdown request...