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/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test22_2_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 16:01:37,237 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 16:01:37,238 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 16:01:37,254 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 16:01:37,254 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 16:01:37,255 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 16:01:37,257 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 16:01:37,258 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 16:01:37,260 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 16:01:37,261 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 16:01:37,262 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 16:01:37,262 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 16:01:37,263 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 16:01:37,265 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 16:01:37,266 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 16:01:37,268 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 16:01:37,271 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 16:01:37,273 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 16:01:37,274 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 16:01:37,276 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 16:01:37,278 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 16:01:37,279 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 16:01:37,279 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 16:01:37,280 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 16:01:37,281 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 16:01:37,282 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 16:01:37,282 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 16:01:37,283 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 16:01:37,283 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 16:01:37,284 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 16:01:37,284 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 16:01:37,284 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf [2018-01-24 16:01:37,293 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 16:01:37,293 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 16:01:37,294 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 16:01:37,294 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 16:01:37,294 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 16:01:37,294 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 16:01:37,295 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 16:01:37,295 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 16:01:37,295 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 16:01:37,295 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 16:01:37,296 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 16:01:37,296 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 16:01:37,296 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 16:01:37,296 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 16:01:37,296 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 16:01:37,296 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 16:01:37,296 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 16:01:37,297 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 16:01:37,297 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 16:01:37,297 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 16:01:37,297 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 16:01:37,297 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 16:01:37,297 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 16:01:37,297 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 16:01:37,298 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 16:01:37,298 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 16:01:37,298 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 16:01:37,298 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 16:01:37,298 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-24 16:01:37,299 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 16:01:37,299 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 16:01:37,299 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 16:01:37,299 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-24 16:01:37,300 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 16:01:37,300 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 16:01:37,334 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 16:01:37,345 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 16:01:37,348 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 16:01:37,349 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 16:01:37,350 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 16:01:37,350 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test22_2_true-valid-memsafety_true-termination.i [2018-01-24 16:01:37,523 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 16:01:37,530 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 16:01:37,532 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 16:01:37,532 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 16:01:37,539 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 16:01:37,540 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 04:01:37" (1/1) ... [2018-01-24 16:01:37,543 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71d0b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:01:37, skipping insertion in model container [2018-01-24 16:01:37,543 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 04:01:37" (1/1) ... [2018-01-24 16:01:37,561 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 16:01:37,611 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 16:01:37,738 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 16:01:37,767 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 16:01:37,781 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:01:37 WrapperNode [2018-01-24 16:01:37,781 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 16:01:37,782 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 16:01:37,782 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 16:01:37,782 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 16:01:37,794 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:01:37" (1/1) ... [2018-01-24 16:01:37,794 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:01:37" (1/1) ... [2018-01-24 16:01:37,806 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:01:37" (1/1) ... [2018-01-24 16:01:37,806 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:01:37" (1/1) ... [2018-01-24 16:01:37,818 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:01:37" (1/1) ... [2018-01-24 16:01:37,822 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:01:37" (1/1) ... [2018-01-24 16:01:37,825 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:01:37" (1/1) ... [2018-01-24 16:01:37,829 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 16:01:37,830 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 16:01:37,830 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 16:01:37,830 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 16:01:37,831 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:01:37" (1/1) ... No working directory specified, using /storage/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-01-24 16:01:37,896 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 16:01:37,897 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 16:01:37,929 INFO L136 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2018-01-24 16:01:37,929 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-24 16:01:37,929 INFO L136 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2018-01-24 16:01:37,930 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_atomic_add_return [2018-01-24 16:01:37,930 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_atomic_sub_return [2018-01-24 16:01:37,930 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_sub [2018-01-24 16:01:37,930 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_init [2018-01-24 16:01:37,930 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_get [2018-01-24 16:01:37,930 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_put [2018-01-24 16:01:37,931 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_cleanup [2018-01-24 16:01:37,931 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_release [2018-01-24 16:01:37,931 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2018-01-24 16:01:37,931 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_get [2018-01-24 16:01:37,931 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init_internal [2018-01-24 16:01:37,931 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init [2018-01-24 16:01:37,932 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_create [2018-01-24 16:01:37,932 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-24 16:01:37,932 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 16:01:37,932 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 16:01:37,932 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 16:01:37,932 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-24 16:01:37,933 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-24 16:01:37,933 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 16:01:37,933 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 16:01:37,933 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 16:01:37,933 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2018-01-24 16:01:37,933 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2018-01-24 16:01:37,933 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-24 16:01:37,934 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-24 16:01:37,934 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 16:01:37,934 INFO L128 BoogieDeclarations]: Found specification of procedure memset [2018-01-24 16:01:37,934 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-24 16:01:37,934 INFO L128 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2018-01-24 16:01:37,934 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_atomic_add_return [2018-01-24 16:01:37,934 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_atomic_sub_return [2018-01-24 16:01:37,935 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_sub [2018-01-24 16:01:37,935 INFO L128 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2018-01-24 16:01:37,935 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_init [2018-01-24 16:01:37,935 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_get [2018-01-24 16:01:37,935 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_put [2018-01-24 16:01:37,935 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_cleanup [2018-01-24 16:01:37,935 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_release [2018-01-24 16:01:37,936 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2018-01-24 16:01:37,936 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_get [2018-01-24 16:01:37,936 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_init_internal [2018-01-24 16:01:37,936 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_init [2018-01-24 16:01:37,936 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_create [2018-01-24 16:01:37,936 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-24 16:01:37,936 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 16:01:37,936 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 16:01:37,937 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 16:01:38,204 WARN L455 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-01-24 16:01:38,402 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 16:01:38,403 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 04:01:38 BoogieIcfgContainer [2018-01-24 16:01:38,403 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 16:01:38,404 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 16:01:38,404 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 16:01:38,407 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 16:01:38,407 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 04:01:37" (1/3) ... [2018-01-24 16:01:38,409 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58088d20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 04:01:38, skipping insertion in model container [2018-01-24 16:01:38,409 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:01:37" (2/3) ... [2018-01-24 16:01:38,409 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58088d20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 04:01:38, skipping insertion in model container [2018-01-24 16:01:38,409 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 04:01:38" (3/3) ... [2018-01-24 16:01:38,411 INFO L105 eAbstractionObserver]: Analyzing ICFG memleaks_test22_2_true-valid-memsafety_true-termination.i [2018-01-24 16:01:38,418 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 16:01:38,424 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 23 error locations. [2018-01-24 16:01:38,475 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 16:01:38,475 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 16:01:38,475 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 16:01:38,475 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 16:01:38,475 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 16:01:38,476 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 16:01:38,476 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 16:01:38,476 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 16:01:38,477 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 16:01:38,497 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states. [2018-01-24 16:01:38,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-24 16:01:38,503 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:01:38,503 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:01:38,504 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-01-24 16:01:38,509 INFO L82 PathProgramCache]: Analyzing trace with hash -998986606, now seen corresponding path program 1 times [2018-01-24 16:01:38,511 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:01:38,561 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:01:38,561 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:01:38,561 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:01:38,561 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:01:38,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:01:38,625 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:01:38,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:01:38,866 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:01:38,867 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 16:01:38,867 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:01:38,871 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 16:01:38,887 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 16:01:38,888 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 16:01:38,891 INFO L87 Difference]: Start difference. First operand 143 states. Second operand 5 states. [2018-01-24 16:01:38,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:01:38,976 INFO L93 Difference]: Finished difference Result 274 states and 291 transitions. [2018-01-24 16:01:38,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 16:01:38,978 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-01-24 16:01:38,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:01:38,994 INFO L225 Difference]: With dead ends: 274 [2018-01-24 16:01:38,994 INFO L226 Difference]: Without dead ends: 146 [2018-01-24 16:01:38,999 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 16:01:39,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-01-24 16:01:39,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 144. [2018-01-24 16:01:39,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-01-24 16:01:39,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 153 transitions. [2018-01-24 16:01:39,053 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 153 transitions. Word has length 17 [2018-01-24 16:01:39,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:01:39,054 INFO L432 AbstractCegarLoop]: Abstraction has 144 states and 153 transitions. [2018-01-24 16:01:39,054 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 16:01:39,054 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 153 transitions. [2018-01-24 16:01:39,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 16:01:39,055 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:01:39,055 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:01:39,055 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-01-24 16:01:39,055 INFO L82 PathProgramCache]: Analyzing trace with hash -2077747980, now seen corresponding path program 1 times [2018-01-24 16:01:39,056 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:01:39,058 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:01:39,058 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:01:39,058 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:01:39,058 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:01:39,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:01:39,083 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:01:39,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:01:39,161 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:01:39,161 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 16:01:39,161 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:01:39,163 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 16:01:39,163 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 16:01:39,164 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 16:01:39,164 INFO L87 Difference]: Start difference. First operand 144 states and 153 transitions. Second operand 6 states. [2018-01-24 16:01:39,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:01:39,334 INFO L93 Difference]: Finished difference Result 146 states and 155 transitions. [2018-01-24 16:01:39,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 16:01:39,334 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-01-24 16:01:39,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:01:39,337 INFO L225 Difference]: With dead ends: 146 [2018-01-24 16:01:39,337 INFO L226 Difference]: Without dead ends: 145 [2018-01-24 16:01:39,338 INFO L525 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-01-24 16:01:39,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-01-24 16:01:39,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 143. [2018-01-24 16:01:39,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-01-24 16:01:39,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 152 transitions. [2018-01-24 16:01:39,356 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 152 transitions. Word has length 19 [2018-01-24 16:01:39,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:01:39,356 INFO L432 AbstractCegarLoop]: Abstraction has 143 states and 152 transitions. [2018-01-24 16:01:39,356 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 16:01:39,357 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 152 transitions. [2018-01-24 16:01:39,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 16:01:39,357 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:01:39,358 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:01:39,358 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-01-24 16:01:39,358 INFO L82 PathProgramCache]: Analyzing trace with hash -2077747979, now seen corresponding path program 1 times [2018-01-24 16:01:39,358 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:01:39,360 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:01:39,360 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:01:39,360 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:01:39,360 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:01:39,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:01:39,383 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:01:39,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:01:39,645 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:01:39,645 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 16:01:39,645 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:01:39,645 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 16:01:39,646 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 16:01:39,646 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-24 16:01:39,646 INFO L87 Difference]: Start difference. First operand 143 states and 152 transitions. Second operand 7 states. [2018-01-24 16:01:39,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:01:39,887 INFO L93 Difference]: Finished difference Result 145 states and 154 transitions. [2018-01-24 16:01:39,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 16:01:39,888 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2018-01-24 16:01:39,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:01:39,890 INFO L225 Difference]: With dead ends: 145 [2018-01-24 16:01:39,890 INFO L226 Difference]: Without dead ends: 144 [2018-01-24 16:01:39,891 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-01-24 16:01:39,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-01-24 16:01:39,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 142. [2018-01-24 16:01:39,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-01-24 16:01:39,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 151 transitions. [2018-01-24 16:01:39,906 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 151 transitions. Word has length 19 [2018-01-24 16:01:39,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:01:39,907 INFO L432 AbstractCegarLoop]: Abstraction has 142 states and 151 transitions. [2018-01-24 16:01:39,907 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 16:01:39,907 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 151 transitions. [2018-01-24 16:01:39,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-24 16:01:39,908 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:01:39,908 INFO L322 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-01-24 16:01:39,909 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-01-24 16:01:39,909 INFO L82 PathProgramCache]: Analyzing trace with hash -471802203, now seen corresponding path program 1 times [2018-01-24 16:01:39,909 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:01:39,911 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:01:39,911 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:01:39,911 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:01:39,912 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:01:39,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:01:39,930 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:01:40,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:01:40,042 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:01:40,042 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 16:01:40,042 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:01:40,043 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 16:01:40,043 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 16:01:40,043 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-24 16:01:40,044 INFO L87 Difference]: Start difference. First operand 142 states and 151 transitions. Second operand 7 states. [2018-01-24 16:01:40,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:01:40,122 INFO L93 Difference]: Finished difference Result 238 states and 253 transitions. [2018-01-24 16:01:40,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 16:01:40,123 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2018-01-24 16:01:40,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:01:40,125 INFO L225 Difference]: With dead ends: 238 [2018-01-24 16:01:40,125 INFO L226 Difference]: Without dead ends: 159 [2018-01-24 16:01:40,126 INFO L525 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-01-24 16:01:40,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-01-24 16:01:40,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 151. [2018-01-24 16:01:40,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-01-24 16:01:40,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 160 transitions. [2018-01-24 16:01:40,146 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 160 transitions. Word has length 27 [2018-01-24 16:01:40,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:01:40,147 INFO L432 AbstractCegarLoop]: Abstraction has 151 states and 160 transitions. [2018-01-24 16:01:40,147 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 16:01:40,147 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 160 transitions. [2018-01-24 16:01:40,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-24 16:01:40,149 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:01:40,149 INFO L322 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-01-24 16:01:40,149 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-01-24 16:01:40,149 INFO L82 PathProgramCache]: Analyzing trace with hash 131109242, now seen corresponding path program 1 times [2018-01-24 16:01:40,149 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:01:40,151 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:01:40,151 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:01:40,151 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:01:40,151 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:01:40,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:01:40,173 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:01:40,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:01:40,286 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:01:40,286 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-24 16:01:40,287 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:01:40,287 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-24 16:01:40,287 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-24 16:01:40,287 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-01-24 16:01:40,288 INFO L87 Difference]: Start difference. First operand 151 states and 160 transitions. Second operand 10 states. [2018-01-24 16:01:40,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:01:40,517 INFO L93 Difference]: Finished difference Result 151 states and 160 transitions. [2018-01-24 16:01:40,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 16:01:40,517 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 34 [2018-01-24 16:01:40,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:01:40,518 INFO L225 Difference]: With dead ends: 151 [2018-01-24 16:01:40,518 INFO L226 Difference]: Without dead ends: 150 [2018-01-24 16:01:40,519 INFO L525 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-01-24 16:01:40,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-01-24 16:01:40,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2018-01-24 16:01:40,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-01-24 16:01:40,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 159 transitions. [2018-01-24 16:01:40,531 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 159 transitions. Word has length 34 [2018-01-24 16:01:40,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:01:40,532 INFO L432 AbstractCegarLoop]: Abstraction has 150 states and 159 transitions. [2018-01-24 16:01:40,532 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-24 16:01:40,532 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 159 transitions. [2018-01-24 16:01:40,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-24 16:01:40,533 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:01:40,533 INFO L322 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-01-24 16:01:40,534 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-01-24 16:01:40,534 INFO L82 PathProgramCache]: Analyzing trace with hash 131109243, now seen corresponding path program 1 times [2018-01-24 16:01:40,534 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:01:40,535 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:01:40,535 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:01:40,536 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:01:40,536 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:01:40,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:01:40,554 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:01:40,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:01:40,606 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:01:40,606 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 16:01:40,606 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:01:40,607 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 16:01:40,607 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 16:01:40,607 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 16:01:40,607 INFO L87 Difference]: Start difference. First operand 150 states and 159 transitions. Second operand 4 states. [2018-01-24 16:01:40,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:01:40,630 INFO L93 Difference]: Finished difference Result 266 states and 282 transitions. [2018-01-24 16:01:40,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 16:01:40,630 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-01-24 16:01:40,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:01:40,632 INFO L225 Difference]: With dead ends: 266 [2018-01-24 16:01:40,632 INFO L226 Difference]: Without dead ends: 151 [2018-01-24 16:01:40,633 INFO L525 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-01-24 16:01:40,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-01-24 16:01:40,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2018-01-24 16:01:40,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-01-24 16:01:40,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 160 transitions. [2018-01-24 16:01:40,643 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 160 transitions. Word has length 34 [2018-01-24 16:01:40,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:01:40,643 INFO L432 AbstractCegarLoop]: Abstraction has 151 states and 160 transitions. [2018-01-24 16:01:40,643 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 16:01:40,644 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 160 transitions. [2018-01-24 16:01:40,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-24 16:01:40,645 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:01:40,645 INFO L322 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-01-24 16:01:40,645 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-01-24 16:01:40,646 INFO L82 PathProgramCache]: Analyzing trace with hash -2110897305, now seen corresponding path program 1 times [2018-01-24 16:01:40,646 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:01:40,647 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:01:40,648 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:01:40,648 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:01:40,648 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:01:40,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:01:40,666 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:01:40,716 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:01:40,717 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:01:40,717 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 16:01:40,718 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 36 with the following transitions: [2018-01-24 16:01:40,719 INFO L201 CegarAbsIntRunner]: [0], [2], [6], [10], [31], [36], [52], [60], [64], [68], [71], [73], [74], [78], [80], [81], [131], [134], [135], [136], [138], [139], [140], [158], [159], [160], [161], [162], [164], [170], [174], [182], [196], [197], [198] [2018-01-24 16:01:40,778 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 16:01:40,778 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 16:01:43,636 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 16:01:43,637 INFO L268 AbstractInterpreter]: Visited 35 different actions 43 times. Merged at 3 different actions 6 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 21 variables. [2018-01-24 16:01:43,658 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 16:01:43,658 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:01:43,659 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/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-01-24 16:01:43,672 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:01:43,672 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 16:01:43,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:01:43,726 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:01:43,758 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:01:43,758 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:01:43,845 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:01:43,865 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:01:43,865 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 16:01:43,869 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:01:43,870 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 16:01:43,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:01:43,939 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:01:43,953 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:01:43,953 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:01:43,977 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:01:43,979 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 16:01:43,979 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 5, 5] total 9 [2018-01-24 16:01:43,979 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 16:01:43,979 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 16:01:43,980 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 16:01:43,980 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-01-24 16:01:43,980 INFO L87 Difference]: Start difference. First operand 151 states and 160 transitions. Second operand 6 states. [2018-01-24 16:01:44,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:01:44,042 INFO L93 Difference]: Finished difference Result 267 states and 283 transitions. [2018-01-24 16:01:44,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 16:01:44,042 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2018-01-24 16:01:44,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:01:44,044 INFO L225 Difference]: With dead ends: 267 [2018-01-24 16:01:44,044 INFO L226 Difference]: Without dead ends: 152 [2018-01-24 16:01:44,045 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 134 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2018-01-24 16:01:44,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-01-24 16:01:44,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2018-01-24 16:01:44,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-01-24 16:01:44,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 161 transitions. [2018-01-24 16:01:44,054 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 161 transitions. Word has length 35 [2018-01-24 16:01:44,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:01:44,055 INFO L432 AbstractCegarLoop]: Abstraction has 152 states and 161 transitions. [2018-01-24 16:01:44,055 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 16:01:44,055 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 161 transitions. [2018-01-24 16:01:44,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-24 16:01:44,056 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:01:44,056 INFO L322 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-01-24 16:01:44,056 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-01-24 16:01:44,056 INFO L82 PathProgramCache]: Analyzing trace with hash 1181841647, now seen corresponding path program 1 times [2018-01-24 16:01:44,056 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:01:44,058 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:01:44,058 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:01:44,058 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:01:44,058 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:01:44,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:01:44,076 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:01:44,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:01:44,155 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:01:44,155 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 16:01:44,155 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:01:44,155 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 16:01:44,156 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 16:01:44,156 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-24 16:01:44,156 INFO L87 Difference]: Start difference. First operand 152 states and 161 transitions. Second operand 7 states. [2018-01-24 16:01:44,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:01:44,221 INFO L93 Difference]: Finished difference Result 220 states and 236 transitions. [2018-01-24 16:01:44,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 16:01:44,222 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2018-01-24 16:01:44,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:01:44,224 INFO L225 Difference]: With dead ends: 220 [2018-01-24 16:01:44,224 INFO L226 Difference]: Without dead ends: 163 [2018-01-24 16:01:44,225 INFO L525 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-01-24 16:01:44,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-01-24 16:01:44,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 159. [2018-01-24 16:01:44,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-01-24 16:01:44,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 169 transitions. [2018-01-24 16:01:44,235 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 169 transitions. Word has length 36 [2018-01-24 16:01:44,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:01:44,235 INFO L432 AbstractCegarLoop]: Abstraction has 159 states and 169 transitions. [2018-01-24 16:01:44,236 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 16:01:44,236 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 169 transitions. [2018-01-24 16:01:44,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-24 16:01:44,237 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:01:44,237 INFO L322 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-01-24 16:01:44,237 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-01-24 16:01:44,238 INFO L82 PathProgramCache]: Analyzing trace with hash 1401343739, now seen corresponding path program 2 times [2018-01-24 16:01:44,238 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:01:44,239 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:01:44,239 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:01:44,239 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:01:44,239 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:01:44,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:01:44,256 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:01:44,294 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:01:44,295 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:01:44,295 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 16:01:44,295 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-24 16:01:44,295 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-24 16:01:44,295 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:01:44,296 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/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-01-24 16:01:44,308 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 16:01:44,308 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 16:01:44,336 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 16:01:44,340 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 16:01:44,345 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:01:44,374 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-01-24 16:01:44,376 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:01:44,402 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-01-24 16:01:44,403 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:01:44,421 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-01-24 16:01:44,421 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:36 [2018-01-24 16:01:45,121 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-24 16:01:45,121 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:01:45,592 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-24 16:01:45,615 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-24 16:01:45,615 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14, 13] imperfect sequences [6] total 31 [2018-01-24 16:01:45,615 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:01:45,615 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-24 16:01:45,615 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-24 16:01:45,616 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=840, Unknown=0, NotChecked=0, Total=930 [2018-01-24 16:01:45,616 INFO L87 Difference]: Start difference. First operand 159 states and 169 transitions. Second operand 15 states. [2018-01-24 16:01:46,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:01:46,581 INFO L93 Difference]: Finished difference Result 179 states and 189 transitions. [2018-01-24 16:01:46,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-24 16:01:46,582 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 36 [2018-01-24 16:01:46,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:01:46,583 INFO L225 Difference]: With dead ends: 179 [2018-01-24 16:01:46,583 INFO L226 Difference]: Without dead ends: 178 [2018-01-24 16:01:46,584 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=118, Invalid=1072, Unknown=0, NotChecked=0, Total=1190 [2018-01-24 16:01:46,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-01-24 16:01:46,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 158. [2018-01-24 16:01:46,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-01-24 16:01:46,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 168 transitions. [2018-01-24 16:01:46,604 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 168 transitions. Word has length 36 [2018-01-24 16:01:46,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:01:46,604 INFO L432 AbstractCegarLoop]: Abstraction has 158 states and 168 transitions. [2018-01-24 16:01:46,604 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-24 16:01:46,605 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 168 transitions. [2018-01-24 16:01:46,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-01-24 16:01:46,606 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:01:46,607 INFO L322 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, 1, 1, 1, 1, 1] [2018-01-24 16:01:46,607 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-01-24 16:01:46,607 INFO L82 PathProgramCache]: Analyzing trace with hash 599601906, now seen corresponding path program 1 times [2018-01-24 16:01:46,607 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:01:46,608 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:01:46,609 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 16:01:46,609 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:01:46,609 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:01:46,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:01:46,627 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:01:46,764 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-24 16:01:46,764 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:01:46,764 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-24 16:01:46,764 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:01:46,765 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-24 16:01:46,765 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-24 16:01:46,765 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-01-24 16:01:46,765 INFO L87 Difference]: Start difference. First operand 158 states and 168 transitions. Second operand 10 states. [2018-01-24 16:01:47,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:01:47,009 INFO L93 Difference]: Finished difference Result 158 states and 168 transitions. [2018-01-24 16:01:47,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 16:01:47,010 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 41 [2018-01-24 16:01:47,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:01:47,011 INFO L225 Difference]: With dead ends: 158 [2018-01-24 16:01:47,011 INFO L226 Difference]: Without dead ends: 156 [2018-01-24 16:01:47,011 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-01-24 16:01:47,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-01-24 16:01:47,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2018-01-24 16:01:47,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-01-24 16:01:47,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 166 transitions. [2018-01-24 16:01:47,028 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 166 transitions. Word has length 41 [2018-01-24 16:01:47,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:01:47,028 INFO L432 AbstractCegarLoop]: Abstraction has 156 states and 166 transitions. [2018-01-24 16:01:47,029 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-24 16:01:47,029 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 166 transitions. [2018-01-24 16:01:47,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-01-24 16:01:47,030 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:01:47,030 INFO L322 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, 1, 1, 1, 1, 1] [2018-01-24 16:01:47,030 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-01-24 16:01:47,030 INFO L82 PathProgramCache]: Analyzing trace with hash 599601907, now seen corresponding path program 1 times [2018-01-24 16:01:47,030 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:01:47,031 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:01:47,032 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:01:47,032 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:01:47,032 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:01:47,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:01:47,047 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:01:47,088 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:01:47,089 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:01:47,089 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 16:01:47,089 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 42 with the following transitions: [2018-01-24 16:01:47,089 INFO L201 CegarAbsIntRunner]: [0], [2], [6], [10], [31], [36], [52], [60], [64], [68], [69], [72], [73], [74], [78], [80], [81], [123], [126], [131], [134], [135], [136], [138], [139], [140], [158], [159], [160], [161], [162], [164], [170], [174], [182], [183], [184], [196], [197], [198] [2018-01-24 16:01:47,091 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 16:01:47,092 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 16:01:50,794 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 16:01:50,795 INFO L268 AbstractInterpreter]: Visited 40 different actions 48 times. Merged at 3 different actions 6 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 21 variables. [2018-01-24 16:01:50,796 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 16:01:50,797 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:01:50,797 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/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-01-24 16:01:50,810 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:01:50,810 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 16:01:50,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:01:50,846 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:01:50,862 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:01:50,863 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:01:50,958 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:01:50,983 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:01:50,984 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 6 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 16:01:50,988 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:01:50,988 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 16:01:51,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:01:51,037 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:01:51,042 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:01:51,042 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:01:51,078 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:01:51,079 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 16:01:51,079 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 6, 6] total 11 [2018-01-24 16:01:51,079 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 16:01:51,080 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 16:01:51,080 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 16:01:51,080 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2018-01-24 16:01:51,081 INFO L87 Difference]: Start difference. First operand 156 states and 166 transitions. Second operand 7 states. [2018-01-24 16:01:51,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:01:51,109 INFO L93 Difference]: Finished difference Result 269 states and 286 transitions. [2018-01-24 16:01:51,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 16:01:51,110 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2018-01-24 16:01:51,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:01:51,111 INFO L225 Difference]: With dead ends: 269 [2018-01-24 16:01:51,111 INFO L226 Difference]: Without dead ends: 157 [2018-01-24 16:01:51,112 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 157 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=77, Unknown=0, NotChecked=0, Total=132 [2018-01-24 16:01:51,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-01-24 16:01:51,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2018-01-24 16:01:51,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-01-24 16:01:51,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 167 transitions. [2018-01-24 16:01:51,123 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 167 transitions. Word has length 41 [2018-01-24 16:01:51,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:01:51,124 INFO L432 AbstractCegarLoop]: Abstraction has 157 states and 167 transitions. [2018-01-24 16:01:51,124 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 16:01:51,124 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 167 transitions. [2018-01-24 16:01:51,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-01-24 16:01:51,124 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:01:51,124 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:01:51,124 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-01-24 16:01:51,125 INFO L82 PathProgramCache]: Analyzing trace with hash -1379512829, now seen corresponding path program 1 times [2018-01-24 16:01:51,125 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:01:51,126 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:01:51,126 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:01:51,126 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:01:51,126 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:01:51,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:01:51,133 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:01:51,162 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-24 16:01:51,163 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:01:51,163 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 16:01:51,163 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:01:51,163 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 16:01:51,163 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 16:01:51,163 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 16:01:51,164 INFO L87 Difference]: Start difference. First operand 157 states and 167 transitions. Second operand 3 states. [2018-01-24 16:01:51,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:01:51,296 INFO L93 Difference]: Finished difference Result 176 states and 189 transitions. [2018-01-24 16:01:51,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 16:01:51,296 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2018-01-24 16:01:51,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:01:51,297 INFO L225 Difference]: With dead ends: 176 [2018-01-24 16:01:51,298 INFO L226 Difference]: Without dead ends: 161 [2018-01-24 16:01:51,298 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 16:01:51,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-01-24 16:01:51,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 153. [2018-01-24 16:01:51,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-01-24 16:01:51,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 162 transitions. [2018-01-24 16:01:51,311 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 162 transitions. Word has length 39 [2018-01-24 16:01:51,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:01:51,311 INFO L432 AbstractCegarLoop]: Abstraction has 153 states and 162 transitions. [2018-01-24 16:01:51,311 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 16:01:51,312 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 162 transitions. [2018-01-24 16:01:51,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-24 16:01:51,312 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:01:51,312 INFO L322 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-01-24 16:01:51,313 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-01-24 16:01:51,313 INFO L82 PathProgramCache]: Analyzing trace with hash 710655879, now seen corresponding path program 2 times [2018-01-24 16:01:51,313 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:01:51,314 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:01:51,314 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:01:51,314 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:01:51,314 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:01:51,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:01:51,329 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:01:51,431 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:01:51,431 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:01:51,431 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 16:01:51,431 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-24 16:01:51,432 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-24 16:01:51,432 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:01:51,432 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/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-01-24 16:01:51,441 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 16:01:51,442 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 16:01:51,459 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 16:01:51,461 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 16:01:51,464 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:01:51,468 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-01-24 16:01:51,469 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:01:51,479 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-01-24 16:01:51,480 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:01:51,490 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-01-24 16:01:51,490 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:36 [2018-01-24 16:01:52,031 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-24 16:01:52,031 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:01:58,435 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-24 16:01:58,455 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-24 16:01:58,460 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [15, 13] imperfect sequences [7] total 33 [2018-01-24 16:01:58,460 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:01:58,461 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-01-24 16:01:58,461 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-01-24 16:01:58,461 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=948, Unknown=3, NotChecked=0, Total=1056 [2018-01-24 16:01:58,461 INFO L87 Difference]: Start difference. First operand 153 states and 162 transitions. Second operand 16 states. [2018-01-24 16:01:59,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:01:59,485 INFO L93 Difference]: Finished difference Result 157 states and 165 transitions. [2018-01-24 16:01:59,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-24 16:01:59,486 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 42 [2018-01-24 16:01:59,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:01:59,487 INFO L225 Difference]: With dead ends: 157 [2018-01-24 16:01:59,487 INFO L226 Difference]: Without dead ends: 155 [2018-01-24 16:01:59,488 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 299 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=136, Invalid=1193, Unknown=3, NotChecked=0, Total=1332 [2018-01-24 16:01:59,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-01-24 16:01:59,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 151. [2018-01-24 16:01:59,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-01-24 16:01:59,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 160 transitions. [2018-01-24 16:01:59,503 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 160 transitions. Word has length 42 [2018-01-24 16:01:59,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:01:59,503 INFO L432 AbstractCegarLoop]: Abstraction has 151 states and 160 transitions. [2018-01-24 16:01:59,503 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-01-24 16:01:59,503 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 160 transitions. [2018-01-24 16:01:59,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-01-24 16:01:59,504 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:01:59,504 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:01:59,504 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-01-24 16:01:59,505 INFO L82 PathProgramCache]: Analyzing trace with hash -495427355, now seen corresponding path program 1 times [2018-01-24 16:01:59,505 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:01:59,506 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:01:59,506 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 16:01:59,506 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:01:59,506 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:01:59,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:01:59,514 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:01:59,551 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-24 16:01:59,551 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:01:59,552 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 16:01:59,552 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:01:59,552 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 16:01:59,552 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 16:01:59,552 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 16:01:59,552 INFO L87 Difference]: Start difference. First operand 151 states and 160 transitions. Second operand 6 states. [2018-01-24 16:01:59,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:01:59,577 INFO L93 Difference]: Finished difference Result 155 states and 163 transitions. [2018-01-24 16:01:59,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 16:01:59,577 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2018-01-24 16:01:59,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:01:59,578 INFO L225 Difference]: With dead ends: 155 [2018-01-24 16:01:59,578 INFO L226 Difference]: Without dead ends: 135 [2018-01-24 16:01:59,578 INFO L525 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-01-24 16:01:59,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-01-24 16:01:59,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2018-01-24 16:01:59,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-01-24 16:01:59,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 142 transitions. [2018-01-24 16:01:59,591 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 142 transitions. Word has length 41 [2018-01-24 16:01:59,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:01:59,591 INFO L432 AbstractCegarLoop]: Abstraction has 135 states and 142 transitions. [2018-01-24 16:01:59,592 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 16:01:59,592 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 142 transitions. [2018-01-24 16:01:59,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-01-24 16:01:59,592 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:01:59,592 INFO L322 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, 1, 1, 1] [2018-01-24 16:01:59,592 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-01-24 16:01:59,592 INFO L82 PathProgramCache]: Analyzing trace with hash -961369019, now seen corresponding path program 1 times [2018-01-24 16:01:59,592 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:01:59,593 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:01:59,593 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:01:59,593 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:01:59,593 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:01:59,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:01:59,603 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:01:59,648 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-24 16:01:59,649 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:01:59,649 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 16:01:59,649 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:01:59,649 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 16:01:59,649 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 16:01:59,649 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-24 16:01:59,649 INFO L87 Difference]: Start difference. First operand 135 states and 142 transitions. Second operand 8 states. [2018-01-24 16:01:59,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:01:59,719 INFO L93 Difference]: Finished difference Result 223 states and 234 transitions. [2018-01-24 16:01:59,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 16:01:59,720 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 45 [2018-01-24 16:01:59,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:01:59,720 INFO L225 Difference]: With dead ends: 223 [2018-01-24 16:01:59,720 INFO L226 Difference]: Without dead ends: 135 [2018-01-24 16:01:59,721 INFO L525 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-01-24 16:01:59,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-01-24 16:01:59,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2018-01-24 16:01:59,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-01-24 16:01:59,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 141 transitions. [2018-01-24 16:01:59,734 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 141 transitions. Word has length 45 [2018-01-24 16:01:59,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:01:59,735 INFO L432 AbstractCegarLoop]: Abstraction has 135 states and 141 transitions. [2018-01-24 16:01:59,735 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 16:01:59,735 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 141 transitions. [2018-01-24 16:01:59,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-01-24 16:01:59,735 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:01:59,736 INFO L322 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:01:59,736 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-01-24 16:01:59,736 INFO L82 PathProgramCache]: Analyzing trace with hash -1966279804, now seen corresponding path program 1 times [2018-01-24 16:01:59,736 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:01:59,737 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:01:59,737 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:01:59,737 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:01:59,737 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:01:59,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:01:59,748 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:01:59,838 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-24 16:01:59,838 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:01:59,839 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-24 16:01:59,839 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:01:59,839 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-24 16:01:59,839 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-24 16:01:59,839 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-01-24 16:01:59,840 INFO L87 Difference]: Start difference. First operand 135 states and 141 transitions. Second operand 10 states. [2018-01-24 16:01:59,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:01:59,930 INFO L93 Difference]: Finished difference Result 225 states and 235 transitions. [2018-01-24 16:01:59,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 16:01:59,930 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 50 [2018-01-24 16:01:59,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:01:59,932 INFO L225 Difference]: With dead ends: 225 [2018-01-24 16:01:59,932 INFO L226 Difference]: Without dead ends: 135 [2018-01-24 16:01:59,932 INFO L525 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-01-24 16:01:59,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-01-24 16:01:59,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2018-01-24 16:01:59,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-01-24 16:01:59,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 140 transitions. [2018-01-24 16:01:59,952 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 140 transitions. Word has length 50 [2018-01-24 16:01:59,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:01:59,952 INFO L432 AbstractCegarLoop]: Abstraction has 135 states and 140 transitions. [2018-01-24 16:01:59,952 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-24 16:01:59,953 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 140 transitions. [2018-01-24 16:01:59,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-01-24 16:01:59,953 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:01:59,954 INFO L322 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:01:59,954 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-01-24 16:01:59,954 INFO L82 PathProgramCache]: Analyzing trace with hash 273504900, now seen corresponding path program 1 times [2018-01-24 16:01:59,954 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:01:59,955 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:01:59,955 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:01:59,955 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:01:59,956 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:01:59,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:01:59,973 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:02:00,165 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-24 16:02:00,166 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:02:00,166 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-01-24 16:02:00,166 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:02:00,166 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-24 16:02:00,166 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-24 16:02:00,166 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-01-24 16:02:00,166 INFO L87 Difference]: Start difference. First operand 135 states and 140 transitions. Second operand 13 states. [2018-01-24 16:02:00,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:02:00,529 INFO L93 Difference]: Finished difference Result 135 states and 140 transitions. [2018-01-24 16:02:00,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-24 16:02:00,529 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 61 [2018-01-24 16:02:00,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:02:00,530 INFO L225 Difference]: With dead ends: 135 [2018-01-24 16:02:00,530 INFO L226 Difference]: Without dead ends: 133 [2018-01-24 16:02:00,530 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2018-01-24 16:02:00,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-01-24 16:02:00,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2018-01-24 16:02:00,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-01-24 16:02:00,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 138 transitions. [2018-01-24 16:02:00,543 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 138 transitions. Word has length 61 [2018-01-24 16:02:00,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:02:00,543 INFO L432 AbstractCegarLoop]: Abstraction has 133 states and 138 transitions. [2018-01-24 16:02:00,544 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-24 16:02:00,544 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 138 transitions. [2018-01-24 16:02:00,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-01-24 16:02:00,544 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:02:00,544 INFO L322 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:02:00,544 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-01-24 16:02:00,544 INFO L82 PathProgramCache]: Analyzing trace with hash 273504901, now seen corresponding path program 1 times [2018-01-24 16:02:00,544 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:02:00,545 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:02:00,545 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:02:00,545 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:02:00,545 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:02:00,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:02:00,559 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:02:00,632 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:02:00,632 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:02:00,632 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 16:02:00,633 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 62 with the following transitions: [2018-01-24 16:02:00,633 INFO L201 CegarAbsIntRunner]: [0], [2], [6], [10], [12], [13], [17], [31], [36], [38], [52], [54], [60], [64], [67], [68], [69], [72], [73], [74], [78], [80], [81], [92], [95], [123], [124], [127], [130], [131], [134], [135], [136], [138], [139], [140], [145], [148], [158], [159], [160], [161], [162], [163], [164], [166], [170], [171], [174], [175], [176], [182], [183], [184], [185], [194], [196], [197], [198] [2018-01-24 16:02:00,635 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 16:02:00,635 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 16:02:03,983 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 16:02:03,983 INFO L268 AbstractInterpreter]: Visited 59 different actions 67 times. Merged at 3 different actions 6 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 22 variables. [2018-01-24 16:02:04,023 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 16:02:04,023 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:02:04,023 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/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-01-24 16:02:04,029 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:02:04,029 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 16:02:04,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:02:04,058 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:02:04,094 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:02:04,094 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:02:04,186 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:02:04,206 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:02:04,206 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 9 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 16:02:04,211 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:02:04,211 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 16:02:04,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:02:04,274 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:02:04,278 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:02:04,279 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:02:04,339 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:02:04,340 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 16:02:04,341 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7, 7, 7] total 13 [2018-01-24 16:02:04,341 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 16:02:04,341 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 16:02:04,341 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 16:02:04,341 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2018-01-24 16:02:04,341 INFO L87 Difference]: Start difference. First operand 133 states and 138 transitions. Second operand 8 states. [2018-01-24 16:02:04,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:02:04,366 INFO L93 Difference]: Finished difference Result 242 states and 252 transitions. [2018-01-24 16:02:04,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 16:02:04,366 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 61 [2018-01-24 16:02:04,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:02:04,367 INFO L225 Difference]: With dead ends: 242 [2018-01-24 16:02:04,367 INFO L226 Difference]: Without dead ends: 134 [2018-01-24 16:02:04,368 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 236 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=105, Unknown=0, NotChecked=0, Total=182 [2018-01-24 16:02:04,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-01-24 16:02:04,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2018-01-24 16:02:04,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-01-24 16:02:04,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 139 transitions. [2018-01-24 16:02:04,379 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 139 transitions. Word has length 61 [2018-01-24 16:02:04,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:02:04,379 INFO L432 AbstractCegarLoop]: Abstraction has 134 states and 139 transitions. [2018-01-24 16:02:04,379 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 16:02:04,380 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 139 transitions. [2018-01-24 16:02:04,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-01-24 16:02:04,380 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:02:04,380 INFO L322 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:02:04,380 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-01-24 16:02:04,381 INFO L82 PathProgramCache]: Analyzing trace with hash -1969498855, now seen corresponding path program 2 times [2018-01-24 16:02:04,381 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:02:04,382 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:02:04,382 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:02:04,382 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:02:04,382 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:02:04,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:02:04,397 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:02:04,533 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:02:04,534 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:02:04,534 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 16:02:04,534 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-24 16:02:04,534 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-24 16:02:04,534 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:02:04,534 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/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-01-24 16:02:04,552 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 16:02:04,553 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 16:02:04,580 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 16:02:04,590 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 16:02:04,594 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:02:04,610 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-01-24 16:02:04,611 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:02:04,640 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-01-24 16:02:04,640 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:02:04,652 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-01-24 16:02:04,653 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:36 [2018-01-24 16:02:06,807 WARN L143 SmtUtils]: Spent 2012ms on a formula simplification that was a NOOP. DAG size: 21 [2018-01-24 16:02:07,307 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-01-24 16:02:07,307 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:02:08,059 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-01-24 16:02:08,093 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-24 16:02:08,093 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [18, 16] imperfect sequences [8] total 40 [2018-01-24 16:02:08,093 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:02:08,094 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-24 16:02:08,094 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-24 16:02:08,094 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=1428, Unknown=0, NotChecked=0, Total=1560 [2018-01-24 16:02:08,095 INFO L87 Difference]: Start difference. First operand 134 states and 139 transitions. Second operand 19 states. [2018-01-24 16:02:09,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:02:09,236 INFO L93 Difference]: Finished difference Result 134 states and 139 transitions. [2018-01-24 16:02:09,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-01-24 16:02:09,275 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 62 [2018-01-24 16:02:09,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:02:09,276 INFO L225 Difference]: With dead ends: 134 [2018-01-24 16:02:09,276 INFO L226 Difference]: Without dead ends: 132 [2018-01-24 16:02:09,276 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 91 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 507 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=173, Invalid=1807, Unknown=0, NotChecked=0, Total=1980 [2018-01-24 16:02:09,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-01-24 16:02:09,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2018-01-24 16:02:09,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-01-24 16:02:09,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 137 transitions. [2018-01-24 16:02:09,296 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 137 transitions. Word has length 62 [2018-01-24 16:02:09,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:02:09,297 INFO L432 AbstractCegarLoop]: Abstraction has 132 states and 137 transitions. [2018-01-24 16:02:09,297 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-01-24 16:02:09,297 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 137 transitions. [2018-01-24 16:02:09,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-01-24 16:02:09,298 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:02:09,298 INFO L322 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, 1, 1, 1, 1, 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-01-24 16:02:09,298 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-01-24 16:02:09,298 INFO L82 PathProgramCache]: Analyzing trace with hash -525790244, now seen corresponding path program 1 times [2018-01-24 16:02:09,299 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:02:09,299 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:02:09,299 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 16:02:09,299 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:02:09,300 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:02:09,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:02:09,314 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:02:09,525 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-01-24 16:02:09,525 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:02:09,525 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-01-24 16:02:09,525 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:02:09,526 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-24 16:02:09,526 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-24 16:02:09,526 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-01-24 16:02:09,526 INFO L87 Difference]: Start difference. First operand 132 states and 137 transitions. Second operand 11 states. [2018-01-24 16:02:09,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:02:09,625 INFO L93 Difference]: Finished difference Result 194 states and 202 transitions. [2018-01-24 16:02:09,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-24 16:02:09,626 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 71 [2018-01-24 16:02:09,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:02:09,627 INFO L225 Difference]: With dead ends: 194 [2018-01-24 16:02:09,628 INFO L226 Difference]: Without dead ends: 132 [2018-01-24 16:02:09,628 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2018-01-24 16:02:09,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-01-24 16:02:09,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2018-01-24 16:02:09,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-01-24 16:02:09,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 136 transitions. [2018-01-24 16:02:09,648 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 136 transitions. Word has length 71 [2018-01-24 16:02:09,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:02:09,648 INFO L432 AbstractCegarLoop]: Abstraction has 132 states and 136 transitions. [2018-01-24 16:02:09,648 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-24 16:02:09,648 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 136 transitions. [2018-01-24 16:02:09,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-01-24 16:02:09,649 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:02:09,649 INFO L322 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-24 16:02:09,649 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-01-24 16:02:09,650 INFO L82 PathProgramCache]: Analyzing trace with hash -1264904852, now seen corresponding path program 1 times [2018-01-24 16:02:09,650 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:02:09,651 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:02:09,651 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:02:09,651 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:02:09,651 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:02:09,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:02:09,672 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:02:10,007 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-01-24 16:02:10,007 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:02:10,007 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-01-24 16:02:10,007 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:02:10,008 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-24 16:02:10,008 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-24 16:02:10,008 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2018-01-24 16:02:10,008 INFO L87 Difference]: Start difference. First operand 132 states and 136 transitions. Second operand 18 states. [2018-01-24 16:02:10,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:02:10,617 INFO L93 Difference]: Finished difference Result 162 states and 174 transitions. [2018-01-24 16:02:10,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-01-24 16:02:10,618 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 84 [2018-01-24 16:02:10,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:02:10,619 INFO L225 Difference]: With dead ends: 162 [2018-01-24 16:02:10,619 INFO L226 Difference]: Without dead ends: 160 [2018-01-24 16:02:10,619 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=493, Unknown=0, NotChecked=0, Total=552 [2018-01-24 16:02:10,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-01-24 16:02:10,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 155. [2018-01-24 16:02:10,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-01-24 16:02:10,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 167 transitions. [2018-01-24 16:02:10,634 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 167 transitions. Word has length 84 [2018-01-24 16:02:10,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:02:10,634 INFO L432 AbstractCegarLoop]: Abstraction has 155 states and 167 transitions. [2018-01-24 16:02:10,635 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-24 16:02:10,635 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 167 transitions. [2018-01-24 16:02:10,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-01-24 16:02:10,636 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:02:10,636 INFO L322 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-24 16:02:10,636 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-01-24 16:02:10,636 INFO L82 PathProgramCache]: Analyzing trace with hash -1264904851, now seen corresponding path program 1 times [2018-01-24 16:02:10,636 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:02:10,637 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:02:10,637 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:02:10,637 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:02:10,637 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:02:10,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:02:10,652 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:02:10,769 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:02:10,770 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:02:10,770 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 16:02:10,770 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 85 with the following transitions: [2018-01-24 16:02:10,770 INFO L201 CegarAbsIntRunner]: [0], [2], [6], [10], [12], [13], [17], [19], [20], [21], [24], [31], [36], [38], [39], [42], [52], [54], [56], [60], [64], [67], [68], [69], [72], [73], [74], [78], [80], [81], [82], [92], [93], [96], [97], [100], [101], [123], [124], [127], [130], [131], [134], [135], [136], [138], [139], [140], [141], [145], [148], [153], [154], [158], [159], [160], [161], [162], [163], [164], [166], [167], [168], [170], [171], [174], [175], [176], [177], [178], [182], [183], [184], [185], [186], [192], [194], [195], [196], [197], [198] [2018-01-24 16:02:10,773 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 16:02:10,773 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 16:02:13,913 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 16:02:13,913 INFO L268 AbstractInterpreter]: Visited 81 different actions 89 times. Merged at 3 different actions 6 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 26 variables. [2018-01-24 16:02:13,922 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 16:02:13,922 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:02:13,922 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/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-01-24 16:02:13,930 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:02:13,930 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 16:02:13,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:02:13,978 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:02:13,991 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:02:13,991 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:02:14,207 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:02:14,238 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:02:14,238 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 12 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 16:02:14,242 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:02:14,242 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 16:02:14,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:02:14,341 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:02:14,350 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:02:14,350 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:02:14,420 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:02:14,421 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 16:02:14,421 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 8, 8] total 15 [2018-01-24 16:02:14,421 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 16:02:14,422 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 16:02:14,422 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 16:02:14,422 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=117, Unknown=0, NotChecked=0, Total=210 [2018-01-24 16:02:14,422 INFO L87 Difference]: Start difference. First operand 155 states and 167 transitions. Second operand 9 states. [2018-01-24 16:02:14,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:02:14,453 INFO L93 Difference]: Finished difference Result 285 states and 309 transitions. [2018-01-24 16:02:14,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 16:02:14,454 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 84 [2018-01-24 16:02:14,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:02:14,455 INFO L225 Difference]: With dead ends: 285 [2018-01-24 16:02:14,455 INFO L226 Difference]: Without dead ends: 156 [2018-01-24 16:02:14,456 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 327 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=137, Unknown=0, NotChecked=0, Total=240 [2018-01-24 16:02:14,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-01-24 16:02:14,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2018-01-24 16:02:14,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-01-24 16:02:14,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 168 transitions. [2018-01-24 16:02:14,472 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 168 transitions. Word has length 84 [2018-01-24 16:02:14,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:02:14,472 INFO L432 AbstractCegarLoop]: Abstraction has 156 states and 168 transitions. [2018-01-24 16:02:14,472 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 16:02:14,472 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 168 transitions. [2018-01-24 16:02:14,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-01-24 16:02:14,473 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:02:14,474 INFO L322 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:02:14,474 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-01-24 16:02:14,474 INFO L82 PathProgramCache]: Analyzing trace with hash -242617255, now seen corresponding path program 2 times [2018-01-24 16:02:14,474 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:02:14,475 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:02:14,475 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:02:14,475 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:02:14,475 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:02:14,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:02:14,500 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:02:14,617 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:02:14,617 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:02:14,617 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 16:02:14,617 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-24 16:02:14,618 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-24 16:02:14,618 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:02:14,618 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/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-01-24 16:02:14,625 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 16:02:14,626 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 16:02:14,677 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 16:02:14,686 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 16:02:14,692 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:02:14,696 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-01-24 16:02:14,697 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:02:14,715 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-01-24 16:02:14,716 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:02:14,732 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-01-24 16:02:14,733 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:36 [2018-01-24 16:02:15,510 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-01-24 16:02:15,510 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:02:20,233 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-01-24 16:02:20,253 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-24 16:02:20,253 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [20, 18] imperfect sequences [9] total 45 [2018-01-24 16:02:20,253 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:02:20,254 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-24 16:02:20,254 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-24 16:02:20,255 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=1825, Unknown=2, NotChecked=0, Total=1980 [2018-01-24 16:02:20,255 INFO L87 Difference]: Start difference. First operand 156 states and 168 transitions. Second operand 21 states. Received shutdown request... [2018-01-24 16:02:20,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 16:02:20,305 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-24 16:02:20,308 WARN L187 ceAbstractionStarter]: Timeout [2018-01-24 16:02:20,308 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 04:02:20 BoogieIcfgContainer [2018-01-24 16:02:20,309 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 16:02:20,309 INFO L168 Benchmark]: Toolchain (without parser) took 42785.30 ms. Allocated memory was 299.9 MB in the beginning and 1.3 GB in the end (delta: 974.7 MB). Free memory was 258.9 MB in the beginning and 722.1 MB in the end (delta: -463.2 MB). Peak memory consumption was 511.5 MB. Max. memory is 5.3 GB. [2018-01-24 16:02:20,310 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 299.9 MB. Free memory is still 264.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 16:02:20,310 INFO L168 Benchmark]: CACSL2BoogieTranslator took 249.92 ms. Allocated memory is still 299.9 MB. Free memory was 258.9 MB in the beginning and 244.9 MB in the end (delta: 14.1 MB). Peak memory consumption was 14.1 MB. Max. memory is 5.3 GB. [2018-01-24 16:02:20,310 INFO L168 Benchmark]: Boogie Preprocessor took 47.25 ms. Allocated memory is still 299.9 MB. Free memory was 244.9 MB in the beginning and 242.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 16:02:20,310 INFO L168 Benchmark]: RCFGBuilder took 573.51 ms. Allocated memory is still 299.9 MB. Free memory was 242.9 MB in the beginning and 208.4 MB in the end (delta: 34.5 MB). Peak memory consumption was 34.5 MB. Max. memory is 5.3 GB. [2018-01-24 16:02:20,311 INFO L168 Benchmark]: TraceAbstraction took 41904.56 ms. Allocated memory was 299.9 MB in the beginning and 1.3 GB in the end (delta: 974.7 MB). Free memory was 208.4 MB in the beginning and 722.1 MB in the end (delta: -513.7 MB). Peak memory consumption was 460.9 MB. Max. memory is 5.3 GB. [2018-01-24 16:02:20,313 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.14 ms. Allocated memory is still 299.9 MB. Free memory is still 264.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 249.92 ms. Allocated memory is still 299.9 MB. Free memory was 258.9 MB in the beginning and 244.9 MB in the end (delta: 14.1 MB). Peak memory consumption was 14.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 47.25 ms. Allocated memory is still 299.9 MB. Free memory was 244.9 MB in the beginning and 242.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 573.51 ms. Allocated memory is still 299.9 MB. Free memory was 242.9 MB in the beginning and 208.4 MB in the end (delta: 34.5 MB). Peak memory consumption was 34.5 MB. Max. memory is 5.3 GB. * TraceAbstraction took 41904.56 ms. Allocated memory was 299.9 MB in the beginning and 1.3 GB in the end (delta: 974.7 MB). Free memory was 208.4 MB in the beginning and 722.1 MB in the end (delta: -513.7 MB). Peak memory consumption was 460.9 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 34 LocStat_MAX_WEQGRAPH_SIZE : 3 LocStat_MAX_SIZEOF_WEQEDGELABEL : 1 LocStat_NO_SUPPORTING_EQUALITIES : 256 LocStat_NO_SUPPORTING_DISEQUALITIES : 25 LocStat_NO_DISJUNCTIONS : -68 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 53 TransStat_MAX_WEQGRAPH_SIZE : 6 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 108 TransStat_NO_SUPPORTING_DISEQUALITIES : 9 TransStat_NO_DISJUNCTIONS : 57 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.436871 RENAME_VARIABLES(MILLISECONDS) : 0.090332 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.184836 PROJECTAWAY(MILLISECONDS) : 0.045199 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.113939 DISJOIN(MILLISECONDS) : 0.747351 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.114014 ADD_EQUALITY(MILLISECONDS) : 0.018308 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.006864 #CONJOIN_DISJUNCTIVE : 86 #RENAME_VARIABLES : 145 #UNFREEZE : 0 #CONJOIN : 178 #PROJECTAWAY : 142 #ADD_WEAK_EQUALITY : 9 #DISJOIN : 4 #RENAME_VARIABLES_DISJUNCTIVE : 141 #ADD_EQUALITY : 111 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 8 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 39 LocStat_MAX_WEQGRAPH_SIZE : 6 LocStat_MAX_SIZEOF_WEQEDGELABEL : 1 LocStat_NO_SUPPORTING_EQUALITIES : 296 LocStat_NO_SUPPORTING_DISEQUALITIES : 30 LocStat_NO_DISJUNCTIONS : -78 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 60 TransStat_MAX_WEQGRAPH_SIZE : 6 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 120 TransStat_NO_SUPPORTING_DISEQUALITIES : 9 TransStat_NO_DISJUNCTIONS : 64 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.472980 RENAME_VARIABLES(MILLISECONDS) : 0.097412 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.211397 PROJECTAWAY(MILLISECONDS) : 0.051825 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.047111 DISJOIN(MILLISECONDS) : 0.726925 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.121680 ADD_EQUALITY(MILLISECONDS) : 0.021317 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.007508 #CONJOIN_DISJUNCTIVE : 96 #RENAME_VARIABLES : 160 #UNFREEZE : 0 #CONJOIN : 203 #PROJECTAWAY : 159 #ADD_WEAK_EQUALITY : 15 #DISJOIN : 4 #RENAME_VARIABLES_DISJUNCTIVE : 156 #ADD_EQUALITY : 128 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 8 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 58 LocStat_MAX_WEQGRAPH_SIZE : 6 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 451 LocStat_NO_SUPPORTING_DISEQUALITIES : 49 LocStat_NO_DISJUNCTIONS : -116 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 85 TransStat_MAX_WEQGRAPH_SIZE : 6 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 164 TransStat_NO_SUPPORTING_DISEQUALITIES : 11 TransStat_NO_DISJUNCTIONS : 90 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.243962 RENAME_VARIABLES(MILLISECONDS) : 0.048219 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.102017 PROJECTAWAY(MILLISECONDS) : 0.028737 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.046362 DISJOIN(MILLISECONDS) : 0.737948 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.061409 ADD_EQUALITY(MILLISECONDS) : 0.010988 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.004112 #CONJOIN_DISJUNCTIVE : 132 #RENAME_VARIABLES : 217 #UNFREEZE : 0 #CONJOIN : 284 #PROJECTAWAY : 223 #ADD_WEAK_EQUALITY : 27 #DISJOIN : 4 #RENAME_VARIABLES_DISJUNCTIVE : 212 #ADD_EQUALITY : 180 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 10 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 80 LocStat_MAX_WEQGRAPH_SIZE : 6 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 662 LocStat_NO_SUPPORTING_DISEQUALITIES : 71 LocStat_NO_DISJUNCTIONS : -160 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 115 TransStat_MAX_WEQGRAPH_SIZE : 6 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 233 TransStat_NO_SUPPORTING_DISEQUALITIES : 13 TransStat_NO_DISJUNCTIONS : 121 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.406319 RENAME_VARIABLES(MILLISECONDS) : 0.097494 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.168692 PROJECTAWAY(MILLISECONDS) : 0.046105 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.041702 DISJOIN(MILLISECONDS) : 0.367850 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.121763 ADD_EQUALITY(MILLISECONDS) : 0.015250 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.004292 #CONJOIN_DISJUNCTIVE : 175 #RENAME_VARIABLES : 279 #UNFREEZE : 0 #CONJOIN : 383 #PROJECTAWAY : 292 #ADD_WEAK_EQUALITY : 33 #DISJOIN : 4 #RENAME_VARIABLES_DISJUNCTIVE : 273 #ADD_EQUALITY : 254 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 12 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1294). Cancelled while BasicCegarLoop was constructing difference of abstraction (156states) and interpolant automaton (currently 3 states, 21 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1294). Cancelled while BasicCegarLoop was constructing difference of abstraction (156states) and interpolant automaton (currently 3 states, 21 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1411). Cancelled while BasicCegarLoop was constructing difference of abstraction (156states) and interpolant automaton (currently 3 states, 21 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1411). Cancelled while BasicCegarLoop was constructing difference of abstraction (156states) and interpolant automaton (currently 3 states, 21 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1265). Cancelled while BasicCegarLoop was constructing difference of abstraction (156states) and interpolant automaton (currently 3 states, 21 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1265). Cancelled while BasicCegarLoop was constructing difference of abstraction (156states) and interpolant automaton (currently 3 states, 21 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1267). Cancelled while BasicCegarLoop was constructing difference of abstraction (156states) and interpolant automaton (currently 3 states, 21 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1267). Cancelled while BasicCegarLoop was constructing difference of abstraction (156states) and interpolant automaton (currently 3 states, 21 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1256). Cancelled while BasicCegarLoop was constructing difference of abstraction (156states) and interpolant automaton (currently 3 states, 21 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1256). Cancelled while BasicCegarLoop was constructing difference of abstraction (156states) and interpolant automaton (currently 3 states, 21 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1258). Cancelled while BasicCegarLoop was constructing difference of abstraction (156states) and interpolant automaton (currently 3 states, 21 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1258). Cancelled while BasicCegarLoop was constructing difference of abstraction (156states) and interpolant automaton (currently 3 states, 21 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1344). Cancelled while BasicCegarLoop was constructing difference of abstraction (156states) and interpolant automaton (currently 3 states, 21 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1340). Cancelled while BasicCegarLoop was constructing difference of abstraction (156states) and interpolant automaton (currently 3 states, 21 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1344). Cancelled while BasicCegarLoop was constructing difference of abstraction (156states) and interpolant automaton (currently 3 states, 21 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1340). Cancelled while BasicCegarLoop was constructing difference of abstraction (156states) and interpolant automaton (currently 3 states, 21 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1339). Cancelled while BasicCegarLoop was constructing difference of abstraction (156states) and interpolant automaton (currently 3 states, 21 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1339). Cancelled while BasicCegarLoop was constructing difference of abstraction (156states) and interpolant automaton (currently 3 states, 21 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 1443]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 1443). Cancelled while BasicCegarLoop was constructing difference of abstraction (156states) and interpolant automaton (currently 3 states, 21 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1099). Cancelled while BasicCegarLoop was constructing difference of abstraction (156states) and interpolant automaton (currently 3 states, 21 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1100). Cancelled while BasicCegarLoop was constructing difference of abstraction (156states) and interpolant automaton (currently 3 states, 21 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1100). Cancelled while BasicCegarLoop was constructing difference of abstraction (156states) and interpolant automaton (currently 3 states, 21 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1099). Cancelled while BasicCegarLoop was constructing difference of abstraction (156states) and interpolant automaton (currently 3 states, 21 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 39. - StatisticsResult: Ultimate Automizer benchmark data CFG has 21 procedures, 143 locations, 23 error locations. TIMEOUT Result, 41.8s OverallTime, 23 OverallIterations, 5 TraceHistogramMax, 5.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2924 SDtfs, 805 SDslu, 15701 SDs, 0 SdLazy, 4871 SolverSat, 164 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1556 GetRequests, 1213 SyntacticMatches, 18 SemanticMatches, 324 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1854 ImplicationChecksByTransitivity, 19.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=159occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 13.1s AbstIntTime, 4 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 22 MinimizatonAttempts, 55 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 20.7s InterpolantComputationTime, 1731 NumberOfCodeBlocks, 1717 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 2351 ConstructedInterpolants, 173 QuantifiedInterpolants, 563179 SizeOfPredicates, 64 NumberOfNonLiveVariables, 3114 ConjunctsInSsa, 257 ConjunctsInUnsatCore, 47 InterpolantComputations, 23 PerfectInterpolantSequences, 117/251 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_2_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_16-02-20-327.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_2_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-24_16-02-20-327.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_2_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-24_16-02-20-327.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_2_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-VPDomainBenchmark-1-2018-01-24_16-02-20-327.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_2_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-1-2018-01-24_16-02-20-327.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_2_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-VPDomainBenchmark-2-2018-01-24_16-02-20-327.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_2_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-2-2018-01-24_16-02-20-327.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_2_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-VPDomainBenchmark-3-2018-01-24_16-02-20-327.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_2_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-3-2018-01-24_16-02-20-327.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_2_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_16-02-20-327.csv Completed graceful shutdown