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_smtcomp.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-25 06:10:40,404 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-25 06:10:40,406 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-25 06:10:40,421 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-25 06:10:40,421 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-25 06:10:40,422 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-25 06:10:40,423 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-25 06:10:40,425 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-25 06:10:40,427 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-25 06:10:40,427 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-25 06:10:40,428 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-25 06:10:40,429 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-25 06:10:40,430 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-25 06:10:40,431 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-25 06:10:40,432 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-25 06:10:40,434 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-25 06:10:40,436 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-25 06:10:40,438 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-25 06:10:40,440 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-25 06:10:40,441 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-25 06:10:40,443 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-25 06:10:40,443 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-25 06:10:40,443 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-25 06:10:40,445 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-25 06:10:40,445 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-25 06:10:40,447 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-25 06:10:40,447 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-25 06:10:40,448 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-25 06:10:40,448 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-25 06:10:40,448 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-25 06:10:40,449 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-25 06:10:40,449 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_smtcomp.epf [2018-01-25 06:10:40,457 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-25 06:10:40,458 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-25 06:10:40,459 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-25 06:10:40,459 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-25 06:10:40,459 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-25 06:10:40,459 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-25 06:10:40,459 INFO L133 SettingsManager]: * Precise comparison operator=true [2018-01-25 06:10:40,459 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-25 06:10:40,460 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-25 06:10:40,460 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-25 06:10:40,460 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-25 06:10:40,460 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-25 06:10:40,460 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-25 06:10:40,460 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-25 06:10:40,460 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-25 06:10:40,461 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-25 06:10:40,461 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-25 06:10:40,461 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-25 06:10:40,461 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-25 06:10:40,461 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-25 06:10:40,461 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-25 06:10:40,461 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-25 06:10:40,462 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-25 06:10:40,462 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-25 06:10:40,462 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 06:10:40,462 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-25 06:10:40,462 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-25 06:10:40,463 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-25 06:10:40,463 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-25 06:10:40,463 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-25 06:10:40,463 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-25 06:10:40,463 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-25 06:10:40,463 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-25 06:10:40,463 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-25 06:10:40,464 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-25 06:10:40,464 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-25 06:10:40,496 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-25 06:10:40,506 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-25 06:10:40,509 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-25 06:10:40,510 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-25 06:10:40,510 INFO L276 PluginConnector]: CDTParser initialized [2018-01-25 06:10:40,511 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-25 06:10:40,737 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-25 06:10:40,744 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-25 06:10:40,745 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-25 06:10:40,745 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-25 06:10:40,751 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-25 06:10:40,752 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 06:10:40" (1/1) ... [2018-01-25 06:10:40,754 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c105265 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:10:40, skipping insertion in model container [2018-01-25 06:10:40,755 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 06:10:40" (1/1) ... [2018-01-25 06:10:40,767 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 06:10:40,812 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 06:10:40,933 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 06:10:40,955 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 06:10:40,968 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:10:40 WrapperNode [2018-01-25 06:10:40,968 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-25 06:10:40,969 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-25 06:10:40,969 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-25 06:10:40,970 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-25 06:10:40,986 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:10:40" (1/1) ... [2018-01-25 06:10:40,986 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:10:40" (1/1) ... [2018-01-25 06:10:41,001 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:10:40" (1/1) ... [2018-01-25 06:10:41,001 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:10:40" (1/1) ... [2018-01-25 06:10:41,011 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:10:40" (1/1) ... [2018-01-25 06:10:41,015 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:10:40" (1/1) ... [2018-01-25 06:10:41,017 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:10:40" (1/1) ... [2018-01-25 06:10:41,019 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-25 06:10:41,019 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-25 06:10:41,020 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-25 06:10:41,020 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-25 06:10:41,020 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:10:40" (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-25 06:10:41,068 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-25 06:10:41,068 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-25 06:10:41,069 INFO L136 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2018-01-25 06:10:41,069 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-25 06:10:41,069 INFO L136 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2018-01-25 06:10:41,069 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_atomic_add_return [2018-01-25 06:10:41,069 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_atomic_sub_return [2018-01-25 06:10:41,069 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_sub [2018-01-25 06:10:41,069 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_init [2018-01-25 06:10:41,069 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_get [2018-01-25 06:10:41,069 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_put [2018-01-25 06:10:41,069 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_cleanup [2018-01-25 06:10:41,070 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_release [2018-01-25 06:10:41,070 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2018-01-25 06:10:41,070 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_get [2018-01-25 06:10:41,070 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init_internal [2018-01-25 06:10:41,070 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init [2018-01-25 06:10:41,070 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_create [2018-01-25 06:10:41,070 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-25 06:10:41,071 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-25 06:10:41,071 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-25 06:10:41,071 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-25 06:10:41,071 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-25 06:10:41,071 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-25 06:10:41,072 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-25 06:10:41,072 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-25 06:10:41,072 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-25 06:10:41,072 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2018-01-25 06:10:41,072 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2018-01-25 06:10:41,072 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-25 06:10:41,073 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-25 06:10:41,073 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-25 06:10:41,073 INFO L128 BoogieDeclarations]: Found specification of procedure memset [2018-01-25 06:10:41,073 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-25 06:10:41,073 INFO L128 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2018-01-25 06:10:41,073 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_atomic_add_return [2018-01-25 06:10:41,074 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_atomic_sub_return [2018-01-25 06:10:41,074 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_sub [2018-01-25 06:10:41,074 INFO L128 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2018-01-25 06:10:41,074 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_init [2018-01-25 06:10:41,074 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_get [2018-01-25 06:10:41,074 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_put [2018-01-25 06:10:41,074 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_cleanup [2018-01-25 06:10:41,074 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_release [2018-01-25 06:10:41,075 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2018-01-25 06:10:41,075 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_get [2018-01-25 06:10:41,075 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_init_internal [2018-01-25 06:10:41,075 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_init [2018-01-25 06:10:41,075 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_create [2018-01-25 06:10:41,075 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-25 06:10:41,076 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-25 06:10:41,076 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-25 06:10:41,076 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-25 06:10:41,322 WARN L455 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-01-25 06:10:41,499 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-25 06:10:41,500 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 06:10:41 BoogieIcfgContainer [2018-01-25 06:10:41,500 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-25 06:10:41,501 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-25 06:10:41,501 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-25 06:10:41,503 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-25 06:10:41,503 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.01 06:10:40" (1/3) ... [2018-01-25 06:10:41,504 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5db18c1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 06:10:41, skipping insertion in model container [2018-01-25 06:10:41,504 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:10:40" (2/3) ... [2018-01-25 06:10:41,504 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5db18c1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 06:10:41, skipping insertion in model container [2018-01-25 06:10:41,504 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 06:10:41" (3/3) ... [2018-01-25 06:10:41,506 INFO L105 eAbstractionObserver]: Analyzing ICFG memleaks_test22_2_true-valid-memsafety_true-termination.i [2018-01-25 06:10:41,513 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-25 06:10:41,521 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 23 error locations. [2018-01-25 06:10:41,574 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-25 06:10:41,574 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-25 06:10:41,574 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-25 06:10:41,574 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-25 06:10:41,574 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-25 06:10:41,575 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-25 06:10:41,575 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-25 06:10:41,575 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-25 06:10:41,576 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-25 06:10:41,594 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states. [2018-01-25 06:10:41,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-25 06:10:41,599 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:10:41,599 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:10:41,600 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-25 06:10:41,604 INFO L82 PathProgramCache]: Analyzing trace with hash -998986606, now seen corresponding path program 1 times [2018-01-25 06:10:41,607 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:10:41,675 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:10:41,675 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:10:41,675 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:10:41,675 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:10:41,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:10:41,738 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:10:41,884 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-25 06:10:41,886 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:10:41,886 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 06:10:41,887 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:10:41,957 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 06:10:41,968 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 06:10:41,968 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 06:10:41,970 INFO L87 Difference]: Start difference. First operand 143 states. Second operand 5 states. [2018-01-25 06:10:42,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:10:42,043 INFO L93 Difference]: Finished difference Result 274 states and 291 transitions. [2018-01-25 06:10:42,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 06:10:42,045 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-01-25 06:10:42,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:10:42,057 INFO L225 Difference]: With dead ends: 274 [2018-01-25 06:10:42,058 INFO L226 Difference]: Without dead ends: 146 [2018-01-25 06:10:42,061 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 06:10:42,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-01-25 06:10:42,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 144. [2018-01-25 06:10:42,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-01-25 06:10:42,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 153 transitions. [2018-01-25 06:10:42,100 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 153 transitions. Word has length 17 [2018-01-25 06:10:42,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:10:42,100 INFO L432 AbstractCegarLoop]: Abstraction has 144 states and 153 transitions. [2018-01-25 06:10:42,100 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 06:10:42,100 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 153 transitions. [2018-01-25 06:10:42,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-25 06:10:42,101 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:10:42,101 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-25 06:10:42,101 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-25 06:10:42,102 INFO L82 PathProgramCache]: Analyzing trace with hash -2077747980, now seen corresponding path program 1 times [2018-01-25 06:10:42,102 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:10:42,103 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:10:42,104 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:10:42,104 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:10:42,104 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:10:42,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:10:42,125 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:10:42,184 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-25 06:10:42,184 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:10:42,184 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 06:10:42,185 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:10:42,186 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 06:10:42,187 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 06:10:42,187 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 06:10:42,187 INFO L87 Difference]: Start difference. First operand 144 states and 153 transitions. Second operand 6 states. [2018-01-25 06:10:42,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:10:42,401 INFO L93 Difference]: Finished difference Result 146 states and 155 transitions. [2018-01-25 06:10:42,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 06:10:42,401 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-01-25 06:10:42,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:10:42,403 INFO L225 Difference]: With dead ends: 146 [2018-01-25 06:10:42,404 INFO L226 Difference]: Without dead ends: 145 [2018-01-25 06:10:42,405 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-25 06:10:42,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-01-25 06:10:42,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 143. [2018-01-25 06:10:42,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-01-25 06:10:42,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 152 transitions. [2018-01-25 06:10:42,421 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 152 transitions. Word has length 19 [2018-01-25 06:10:42,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:10:42,422 INFO L432 AbstractCegarLoop]: Abstraction has 143 states and 152 transitions. [2018-01-25 06:10:42,422 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 06:10:42,422 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 152 transitions. [2018-01-25 06:10:42,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-25 06:10:42,423 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:10:42,423 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-25 06:10:42,423 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-25 06:10:42,423 INFO L82 PathProgramCache]: Analyzing trace with hash -2077747979, now seen corresponding path program 1 times [2018-01-25 06:10:42,424 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:10:42,425 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:10:42,425 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:10:42,425 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:10:42,426 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:10:42,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:10:42,449 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:10:42,780 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-25 06:10:42,781 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:10:42,781 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 06:10:42,781 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:10:42,781 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-25 06:10:42,782 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-25 06:10:42,782 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-25 06:10:42,782 INFO L87 Difference]: Start difference. First operand 143 states and 152 transitions. Second operand 7 states. [2018-01-25 06:10:43,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:10:43,028 INFO L93 Difference]: Finished difference Result 145 states and 154 transitions. [2018-01-25 06:10:43,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-25 06:10:43,029 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2018-01-25 06:10:43,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:10:43,032 INFO L225 Difference]: With dead ends: 145 [2018-01-25 06:10:43,032 INFO L226 Difference]: Without dead ends: 144 [2018-01-25 06:10:43,032 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-25 06:10:43,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-01-25 06:10:43,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 142. [2018-01-25 06:10:43,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-01-25 06:10:43,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 151 transitions. [2018-01-25 06:10:43,048 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 151 transitions. Word has length 19 [2018-01-25 06:10:43,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:10:43,048 INFO L432 AbstractCegarLoop]: Abstraction has 142 states and 151 transitions. [2018-01-25 06:10:43,049 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-25 06:10:43,049 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 151 transitions. [2018-01-25 06:10:43,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-25 06:10:43,050 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:10:43,050 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-25 06:10:43,051 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-25 06:10:43,051 INFO L82 PathProgramCache]: Analyzing trace with hash -471802203, now seen corresponding path program 1 times [2018-01-25 06:10:43,051 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:10:43,052 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:10:43,053 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:10:43,053 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:10:43,053 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:10:43,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:10:43,072 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:10:43,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:10:43,153 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:10:43,153 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-25 06:10:43,153 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:10:43,154 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-25 06:10:43,154 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-25 06:10:43,154 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-25 06:10:43,154 INFO L87 Difference]: Start difference. First operand 142 states and 151 transitions. Second operand 7 states. [2018-01-25 06:10:43,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:10:43,232 INFO L93 Difference]: Finished difference Result 238 states and 253 transitions. [2018-01-25 06:10:43,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-25 06:10:43,232 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2018-01-25 06:10:43,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:10:43,235 INFO L225 Difference]: With dead ends: 238 [2018-01-25 06:10:43,235 INFO L226 Difference]: Without dead ends: 159 [2018-01-25 06:10:43,236 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-25 06:10:43,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-01-25 06:10:43,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 151. [2018-01-25 06:10:43,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-01-25 06:10:43,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 160 transitions. [2018-01-25 06:10:43,256 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 160 transitions. Word has length 27 [2018-01-25 06:10:43,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:10:43,256 INFO L432 AbstractCegarLoop]: Abstraction has 151 states and 160 transitions. [2018-01-25 06:10:43,256 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-25 06:10:43,256 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 160 transitions. [2018-01-25 06:10:43,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-25 06:10:43,258 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:10:43,258 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-25 06:10:43,258 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-25 06:10:43,258 INFO L82 PathProgramCache]: Analyzing trace with hash 131109242, now seen corresponding path program 1 times [2018-01-25 06:10:43,259 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:10:43,260 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:10:43,260 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:10:43,261 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:10:43,261 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:10:43,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:10:43,281 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:10:43,395 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-25 06:10:43,396 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:10:43,396 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-25 06:10:43,396 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:10:43,396 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-25 06:10:43,396 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-25 06:10:43,396 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-01-25 06:10:43,397 INFO L87 Difference]: Start difference. First operand 151 states and 160 transitions. Second operand 10 states. [2018-01-25 06:10:43,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:10:43,621 INFO L93 Difference]: Finished difference Result 151 states and 160 transitions. [2018-01-25 06:10:43,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-25 06:10:43,622 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 34 [2018-01-25 06:10:43,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:10:43,624 INFO L225 Difference]: With dead ends: 151 [2018-01-25 06:10:43,624 INFO L226 Difference]: Without dead ends: 150 [2018-01-25 06:10:43,624 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-25 06:10:43,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-01-25 06:10:43,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2018-01-25 06:10:43,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-01-25 06:10:43,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 159 transitions. [2018-01-25 06:10:43,637 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 159 transitions. Word has length 34 [2018-01-25 06:10:43,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:10:43,638 INFO L432 AbstractCegarLoop]: Abstraction has 150 states and 159 transitions. [2018-01-25 06:10:43,638 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-25 06:10:43,638 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 159 transitions. [2018-01-25 06:10:43,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-25 06:10:43,639 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:10:43,639 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-25 06:10:43,639 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-25 06:10:43,640 INFO L82 PathProgramCache]: Analyzing trace with hash 131109243, now seen corresponding path program 1 times [2018-01-25 06:10:43,640 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:10:43,641 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:10:43,641 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:10:43,641 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:10:43,641 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:10:43,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:10:43,659 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:10:43,691 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-25 06:10:43,691 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:10:43,691 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 06:10:43,691 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:10:43,692 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 06:10:43,692 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 06:10:43,692 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 06:10:43,692 INFO L87 Difference]: Start difference. First operand 150 states and 159 transitions. Second operand 4 states. [2018-01-25 06:10:43,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:10:43,728 INFO L93 Difference]: Finished difference Result 266 states and 282 transitions. [2018-01-25 06:10:43,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 06:10:43,729 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-01-25 06:10:43,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:10:43,730 INFO L225 Difference]: With dead ends: 266 [2018-01-25 06:10:43,731 INFO L226 Difference]: Without dead ends: 151 [2018-01-25 06:10:43,732 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-25 06:10:43,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-01-25 06:10:43,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2018-01-25 06:10:43,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-01-25 06:10:43,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 160 transitions. [2018-01-25 06:10:43,745 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 160 transitions. Word has length 34 [2018-01-25 06:10:43,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:10:43,745 INFO L432 AbstractCegarLoop]: Abstraction has 151 states and 160 transitions. [2018-01-25 06:10:43,745 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 06:10:43,745 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 160 transitions. [2018-01-25 06:10:43,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-25 06:10:43,747 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:10:43,747 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-25 06:10:43,747 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-25 06:10:43,747 INFO L82 PathProgramCache]: Analyzing trace with hash -2110897305, now seen corresponding path program 1 times [2018-01-25 06:10:43,747 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:10:43,748 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:10:43,749 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:10:43,749 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:10:43,749 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:10:43,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:10:43,767 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:10:43,813 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-25 06:10:43,813 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:10:43,813 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 06:10:43,814 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 36 with the following transitions: [2018-01-25 06:10:43,815 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-25 06:10:43,860 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 06:10:43,860 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 06:10:46,377 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 06:10:46,379 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-25 06:10:46,400 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 06:10:46,401 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:10:46,401 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-25 06:10:46,413 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:10:46,413 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 06:10:46,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:10:46,461 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 06:10:46,529 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-25 06:10:46,529 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 06:10:46,656 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-25 06:10:46,689 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:10:46,690 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-25 06:10:46,695 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:10:46,695 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 06:10:46,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:10:46,760 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 06:10:46,767 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-25 06:10:46,767 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 06:10:46,800 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-25 06:10:46,802 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 06:10:46,802 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 5, 5] total 9 [2018-01-25 06:10:46,802 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 06:10:46,803 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 06:10:46,803 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 06:10:46,803 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-01-25 06:10:46,803 INFO L87 Difference]: Start difference. First operand 151 states and 160 transitions. Second operand 6 states. [2018-01-25 06:10:46,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:10:46,850 INFO L93 Difference]: Finished difference Result 267 states and 283 transitions. [2018-01-25 06:10:46,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 06:10:46,851 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2018-01-25 06:10:46,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:10:46,852 INFO L225 Difference]: With dead ends: 267 [2018-01-25 06:10:46,852 INFO L226 Difference]: Without dead ends: 152 [2018-01-25 06:10:46,853 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 134 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2018-01-25 06:10:46,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-01-25 06:10:46,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2018-01-25 06:10:46,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-01-25 06:10:46,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 161 transitions. [2018-01-25 06:10:46,865 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 161 transitions. Word has length 35 [2018-01-25 06:10:46,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:10:46,865 INFO L432 AbstractCegarLoop]: Abstraction has 152 states and 161 transitions. [2018-01-25 06:10:46,866 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 06:10:46,866 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 161 transitions. [2018-01-25 06:10:46,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-25 06:10:46,867 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:10:46,867 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-25 06:10:46,868 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-25 06:10:46,868 INFO L82 PathProgramCache]: Analyzing trace with hash 1181841647, now seen corresponding path program 1 times [2018-01-25 06:10:46,868 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:10:46,869 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:10:46,869 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:10:46,869 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:10:46,869 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:10:46,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:10:46,887 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:10:47,100 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-25 06:10:47,100 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:10:47,101 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-25 06:10:47,101 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:10:47,101 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-25 06:10:47,101 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-25 06:10:47,101 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-25 06:10:47,102 INFO L87 Difference]: Start difference. First operand 152 states and 161 transitions. Second operand 7 states. [2018-01-25 06:10:47,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:10:47,210 INFO L93 Difference]: Finished difference Result 220 states and 236 transitions. [2018-01-25 06:10:47,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-25 06:10:47,212 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2018-01-25 06:10:47,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:10:47,214 INFO L225 Difference]: With dead ends: 220 [2018-01-25 06:10:47,214 INFO L226 Difference]: Without dead ends: 163 [2018-01-25 06:10:47,215 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-25 06:10:47,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-01-25 06:10:47,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 159. [2018-01-25 06:10:47,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-01-25 06:10:47,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 169 transitions. [2018-01-25 06:10:47,230 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 169 transitions. Word has length 36 [2018-01-25 06:10:47,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:10:47,230 INFO L432 AbstractCegarLoop]: Abstraction has 159 states and 169 transitions. [2018-01-25 06:10:47,231 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-25 06:10:47,231 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 169 transitions. [2018-01-25 06:10:47,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-25 06:10:47,232 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:10:47,232 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-25 06:10:47,232 INFO L371 AbstractCegarLoop]: === Iteration 9 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-25 06:10:47,233 INFO L82 PathProgramCache]: Analyzing trace with hash 1401343739, now seen corresponding path program 2 times [2018-01-25 06:10:47,233 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:10:47,237 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:10:47,237 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:10:47,237 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:10:47,237 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:10:47,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:10:47,255 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:10:47,322 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-25 06:10:47,322 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:10:47,323 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 06:10:47,323 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-25 06:10:47,323 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-25 06:10:47,323 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:10:47,323 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-25 06:10:47,336 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-25 06:10:47,336 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-25 06:10:47,365 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 06:10:47,369 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 06:10:47,374 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 06:10:47,414 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-25 06:10:47,416 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 06:10:47,439 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-25 06:10:47,440 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 06:10:47,453 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-25 06:10:47,454 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:36 [2018-01-25 06:10:48,023 WARN L146 SmtUtils]: Spent 126ms on a formula simplification. DAG size of input: 45 DAG size of output 17 [2018-01-25 06:10:48,280 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-25 06:10:48,280 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 06:10:48,675 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-25 06:10:48,696 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-25 06:10:48,696 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14, 13] imperfect sequences [6] total 31 [2018-01-25 06:10:48,696 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:10:48,696 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-25 06:10:48,696 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-25 06:10:48,697 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=840, Unknown=0, NotChecked=0, Total=930 [2018-01-25 06:10:48,697 INFO L87 Difference]: Start difference. First operand 159 states and 169 transitions. Second operand 15 states. [2018-01-25 06:10:49,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:10:49,687 INFO L93 Difference]: Finished difference Result 179 states and 189 transitions. [2018-01-25 06:10:49,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-25 06:10:49,687 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 36 [2018-01-25 06:10:49,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:10:49,689 INFO L225 Difference]: With dead ends: 179 [2018-01-25 06:10:49,689 INFO L226 Difference]: Without dead ends: 178 [2018-01-25 06:10:49,690 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=118, Invalid=1072, Unknown=0, NotChecked=0, Total=1190 [2018-01-25 06:10:49,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-01-25 06:10:49,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 158. [2018-01-25 06:10:49,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-01-25 06:10:49,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 168 transitions. [2018-01-25 06:10:49,709 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 168 transitions. Word has length 36 [2018-01-25 06:10:49,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:10:49,710 INFO L432 AbstractCegarLoop]: Abstraction has 158 states and 168 transitions. [2018-01-25 06:10:49,710 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-25 06:10:49,710 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 168 transitions. [2018-01-25 06:10:49,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-01-25 06:10:49,712 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:10:49,712 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-25 06:10:49,712 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-25 06:10:49,713 INFO L82 PathProgramCache]: Analyzing trace with hash 599601906, now seen corresponding path program 1 times [2018-01-25 06:10:49,713 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:10:49,714 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:10:49,714 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-25 06:10:49,714 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:10:49,714 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:10:49,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:10:49,731 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:10:49,817 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-25 06:10:49,818 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:10:49,818 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-25 06:10:49,818 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:10:49,818 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-25 06:10:49,818 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-25 06:10:49,818 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-01-25 06:10:49,819 INFO L87 Difference]: Start difference. First operand 158 states and 168 transitions. Second operand 10 states. [2018-01-25 06:10:50,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:10:50,162 INFO L93 Difference]: Finished difference Result 158 states and 168 transitions. [2018-01-25 06:10:50,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-25 06:10:50,162 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 41 [2018-01-25 06:10:50,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:10:50,163 INFO L225 Difference]: With dead ends: 158 [2018-01-25 06:10:50,164 INFO L226 Difference]: Without dead ends: 156 [2018-01-25 06:10:50,164 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-25 06:10:50,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-01-25 06:10:50,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2018-01-25 06:10:50,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-01-25 06:10:50,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 166 transitions. [2018-01-25 06:10:50,182 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 166 transitions. Word has length 41 [2018-01-25 06:10:50,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:10:50,183 INFO L432 AbstractCegarLoop]: Abstraction has 156 states and 166 transitions. [2018-01-25 06:10:50,183 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-25 06:10:50,183 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 166 transitions. [2018-01-25 06:10:50,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-01-25 06:10:50,184 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:10:50,184 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-25 06:10:50,184 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-25 06:10:50,184 INFO L82 PathProgramCache]: Analyzing trace with hash 599601907, now seen corresponding path program 1 times [2018-01-25 06:10:50,184 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:10:50,185 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:10:50,185 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:10:50,185 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:10:50,185 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:10:50,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:10:50,201 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:10:50,246 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-25 06:10:50,246 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:10:50,246 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 06:10:50,246 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 42 with the following transitions: [2018-01-25 06:10:50,247 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-25 06:10:50,249 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 06:10:50,249 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 06:10:52,610 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 06:10:52,610 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-25 06:10:52,617 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 06:10:52,617 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:10:52,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 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-25 06:10:52,629 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:10:52,629 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 06:10:52,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:10:52,667 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 06:10:52,764 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-25 06:10:52,765 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 06:10:52,863 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-25 06:10:52,890 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:10:52,890 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-25 06:10:52,894 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:10:52,894 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 06:10:52,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:10:52,941 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 06:10:52,945 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-25 06:10:52,945 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 06:10:52,971 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-25 06:10:52,973 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 06:10:52,973 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 6, 6] total 11 [2018-01-25 06:10:52,973 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 06:10:52,974 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-25 06:10:52,974 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-25 06:10:52,974 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2018-01-25 06:10:52,974 INFO L87 Difference]: Start difference. First operand 156 states and 166 transitions. Second operand 7 states. [2018-01-25 06:10:53,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:10:53,003 INFO L93 Difference]: Finished difference Result 269 states and 286 transitions. [2018-01-25 06:10:53,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 06:10:53,004 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2018-01-25 06:10:53,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:10:53,005 INFO L225 Difference]: With dead ends: 269 [2018-01-25 06:10:53,005 INFO L226 Difference]: Without dead ends: 157 [2018-01-25 06:10:53,005 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 157 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=77, Unknown=0, NotChecked=0, Total=132 [2018-01-25 06:10:53,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-01-25 06:10:53,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2018-01-25 06:10:53,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-01-25 06:10:53,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 167 transitions. [2018-01-25 06:10:53,019 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 167 transitions. Word has length 41 [2018-01-25 06:10:53,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:10:53,019 INFO L432 AbstractCegarLoop]: Abstraction has 157 states and 167 transitions. [2018-01-25 06:10:53,019 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-25 06:10:53,020 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 167 transitions. [2018-01-25 06:10:53,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-01-25 06:10:53,020 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:10:53,021 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-25 06:10:53,021 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-25 06:10:53,021 INFO L82 PathProgramCache]: Analyzing trace with hash -1379512829, now seen corresponding path program 1 times [2018-01-25 06:10:53,021 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:10:53,022 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:10:53,022 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:10:53,023 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:10:53,023 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:10:53,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:10:53,029 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:10:53,099 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-25 06:10:53,099 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:10:53,099 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-25 06:10:53,099 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:10:53,100 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-25 06:10:53,100 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-25 06:10:53,100 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 06:10:53,100 INFO L87 Difference]: Start difference. First operand 157 states and 167 transitions. Second operand 3 states. [2018-01-25 06:10:53,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:10:53,248 INFO L93 Difference]: Finished difference Result 176 states and 189 transitions. [2018-01-25 06:10:53,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-25 06:10:53,248 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2018-01-25 06:10:53,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:10:53,249 INFO L225 Difference]: With dead ends: 176 [2018-01-25 06:10:53,249 INFO L226 Difference]: Without dead ends: 161 [2018-01-25 06:10:53,250 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-25 06:10:53,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-01-25 06:10:53,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 153. [2018-01-25 06:10:53,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-01-25 06:10:53,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 162 transitions. [2018-01-25 06:10:53,263 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 162 transitions. Word has length 39 [2018-01-25 06:10:53,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:10:53,263 INFO L432 AbstractCegarLoop]: Abstraction has 153 states and 162 transitions. [2018-01-25 06:10:53,263 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-25 06:10:53,264 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 162 transitions. [2018-01-25 06:10:53,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-25 06:10:53,264 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:10:53,264 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-25 06:10:53,265 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-25 06:10:53,265 INFO L82 PathProgramCache]: Analyzing trace with hash 710655879, now seen corresponding path program 2 times [2018-01-25 06:10:53,265 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:10:53,266 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:10:53,266 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:10:53,266 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:10:53,266 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:10:53,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:10:53,281 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:10:53,365 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-25 06:10:53,366 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:10:53,366 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 06:10:53,366 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-25 06:10:53,366 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-25 06:10:53,366 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:10:53,366 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-25 06:10:53,376 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-25 06:10:53,377 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-25 06:10:53,396 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 06:10:53,398 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 06:10:53,401 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 06:10:53,410 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-25 06:10:53,411 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 06:10:53,425 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-25 06:10:53,425 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 06:10:53,436 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-25 06:10:53,436 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:36 [2018-01-25 06:10:53,893 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-25 06:10:53,893 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 06:10:58,293 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-25 06:10:58,314 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-25 06:10:58,317 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [15, 13] imperfect sequences [7] total 33 [2018-01-25 06:10:58,317 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:10:58,317 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-01-25 06:10:58,317 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-01-25 06:10:58,318 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=949, Unknown=2, NotChecked=0, Total=1056 [2018-01-25 06:10:58,318 INFO L87 Difference]: Start difference. First operand 153 states and 162 transitions. Second operand 16 states. [2018-01-25 06:10:59,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:10:59,270 INFO L93 Difference]: Finished difference Result 157 states and 165 transitions. [2018-01-25 06:10:59,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-25 06:10:59,270 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 42 [2018-01-25 06:10:59,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:10:59,271 INFO L225 Difference]: With dead ends: 157 [2018-01-25 06:10:59,271 INFO L226 Difference]: Without dead ends: 155 [2018-01-25 06:10:59,271 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 305 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=136, Invalid=1194, Unknown=2, NotChecked=0, Total=1332 [2018-01-25 06:10:59,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-01-25 06:10:59,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 151. [2018-01-25 06:10:59,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-01-25 06:10:59,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 160 transitions. [2018-01-25 06:10:59,285 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 160 transitions. Word has length 42 [2018-01-25 06:10:59,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:10:59,285 INFO L432 AbstractCegarLoop]: Abstraction has 151 states and 160 transitions. [2018-01-25 06:10:59,286 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-01-25 06:10:59,286 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 160 transitions. [2018-01-25 06:10:59,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-01-25 06:10:59,286 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:10:59,286 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-25 06:10:59,286 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-25 06:10:59,287 INFO L82 PathProgramCache]: Analyzing trace with hash -495427355, now seen corresponding path program 1 times [2018-01-25 06:10:59,287 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:10:59,288 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:10:59,288 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-25 06:10:59,288 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:10:59,288 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:10:59,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:10:59,294 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:10:59,324 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-25 06:10:59,324 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:10:59,324 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 06:10:59,324 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:10:59,324 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 06:10:59,325 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 06:10:59,325 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 06:10:59,325 INFO L87 Difference]: Start difference. First operand 151 states and 160 transitions. Second operand 6 states. [2018-01-25 06:10:59,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:10:59,348 INFO L93 Difference]: Finished difference Result 155 states and 163 transitions. [2018-01-25 06:10:59,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 06:10:59,349 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2018-01-25 06:10:59,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:10:59,350 INFO L225 Difference]: With dead ends: 155 [2018-01-25 06:10:59,350 INFO L226 Difference]: Without dead ends: 135 [2018-01-25 06:10:59,350 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-25 06:10:59,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-01-25 06:10:59,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2018-01-25 06:10:59,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-01-25 06:10:59,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 142 transitions. [2018-01-25 06:10:59,369 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 142 transitions. Word has length 41 [2018-01-25 06:10:59,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:10:59,370 INFO L432 AbstractCegarLoop]: Abstraction has 135 states and 142 transitions. [2018-01-25 06:10:59,370 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 06:10:59,370 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 142 transitions. [2018-01-25 06:10:59,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-01-25 06:10:59,370 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:10:59,371 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-25 06:10:59,371 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-25 06:10:59,371 INFO L82 PathProgramCache]: Analyzing trace with hash -961369019, now seen corresponding path program 1 times [2018-01-25 06:10:59,371 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:10:59,372 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:10:59,372 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:10:59,372 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:10:59,372 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:10:59,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:10:59,384 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:10:59,452 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-25 06:10:59,452 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:10:59,452 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-25 06:10:59,452 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:10:59,452 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-25 06:10:59,453 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-25 06:10:59,453 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-25 06:10:59,453 INFO L87 Difference]: Start difference. First operand 135 states and 142 transitions. Second operand 8 states. [2018-01-25 06:10:59,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:10:59,515 INFO L93 Difference]: Finished difference Result 223 states and 234 transitions. [2018-01-25 06:10:59,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-25 06:10:59,516 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 45 [2018-01-25 06:10:59,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:10:59,517 INFO L225 Difference]: With dead ends: 223 [2018-01-25 06:10:59,517 INFO L226 Difference]: Without dead ends: 135 [2018-01-25 06:10:59,518 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-25 06:10:59,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-01-25 06:10:59,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2018-01-25 06:10:59,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-01-25 06:10:59,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 141 transitions. [2018-01-25 06:10:59,539 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 141 transitions. Word has length 45 [2018-01-25 06:10:59,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:10:59,539 INFO L432 AbstractCegarLoop]: Abstraction has 135 states and 141 transitions. [2018-01-25 06:10:59,539 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-25 06:10:59,539 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 141 transitions. [2018-01-25 06:10:59,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-01-25 06:10:59,540 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:10:59,540 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-25 06:10:59,540 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-25 06:10:59,540 INFO L82 PathProgramCache]: Analyzing trace with hash -1966279804, now seen corresponding path program 1 times [2018-01-25 06:10:59,540 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:10:59,541 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:10:59,541 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:10:59,541 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:10:59,541 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:10:59,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:10:59,553 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:10:59,620 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-25 06:10:59,620 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:10:59,620 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-25 06:10:59,621 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:10:59,621 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-25 06:10:59,621 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-25 06:10:59,621 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-01-25 06:10:59,621 INFO L87 Difference]: Start difference. First operand 135 states and 141 transitions. Second operand 10 states. [2018-01-25 06:10:59,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:10:59,705 INFO L93 Difference]: Finished difference Result 225 states and 235 transitions. [2018-01-25 06:10:59,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-25 06:10:59,706 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 50 [2018-01-25 06:10:59,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:10:59,707 INFO L225 Difference]: With dead ends: 225 [2018-01-25 06:10:59,707 INFO L226 Difference]: Without dead ends: 135 [2018-01-25 06:10:59,708 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-25 06:10:59,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-01-25 06:10:59,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2018-01-25 06:10:59,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-01-25 06:10:59,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 140 transitions. [2018-01-25 06:10:59,726 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 140 transitions. Word has length 50 [2018-01-25 06:10:59,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:10:59,727 INFO L432 AbstractCegarLoop]: Abstraction has 135 states and 140 transitions. [2018-01-25 06:10:59,727 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-25 06:10:59,727 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 140 transitions. [2018-01-25 06:10:59,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-01-25 06:10:59,727 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:10:59,728 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-25 06:10:59,728 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-25 06:10:59,728 INFO L82 PathProgramCache]: Analyzing trace with hash 273504900, now seen corresponding path program 1 times [2018-01-25 06:10:59,728 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:10:59,729 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:10:59,729 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:10:59,729 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:10:59,730 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:10:59,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:10:59,747 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:10:59,924 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-25 06:10:59,924 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:10:59,925 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-01-25 06:10:59,925 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:10:59,925 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-25 06:10:59,925 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-25 06:10:59,925 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-01-25 06:10:59,925 INFO L87 Difference]: Start difference. First operand 135 states and 140 transitions. Second operand 13 states. [2018-01-25 06:11:00,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:11:00,177 INFO L93 Difference]: Finished difference Result 135 states and 140 transitions. [2018-01-25 06:11:00,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-25 06:11:00,177 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 61 [2018-01-25 06:11:00,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:11:00,178 INFO L225 Difference]: With dead ends: 135 [2018-01-25 06:11:00,178 INFO L226 Difference]: Without dead ends: 133 [2018-01-25 06:11:00,178 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-25 06:11:00,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-01-25 06:11:00,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2018-01-25 06:11:00,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-01-25 06:11:00,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 138 transitions. [2018-01-25 06:11:00,190 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 138 transitions. Word has length 61 [2018-01-25 06:11:00,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:11:00,191 INFO L432 AbstractCegarLoop]: Abstraction has 133 states and 138 transitions. [2018-01-25 06:11:00,191 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-25 06:11:00,191 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 138 transitions. [2018-01-25 06:11:00,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-01-25 06:11:00,191 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:11:00,192 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-25 06:11:00,192 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-25 06:11:00,192 INFO L82 PathProgramCache]: Analyzing trace with hash 273504901, now seen corresponding path program 1 times [2018-01-25 06:11:00,192 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:11:00,193 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:11:00,193 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:11:00,193 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:11:00,193 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:11:00,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:11:00,205 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:11:00,248 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-25 06:11:00,248 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:11:00,248 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 06:11:00,248 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 62 with the following transitions: [2018-01-25 06:11:00,249 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-25 06:11:00,251 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 06:11:00,251 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 06:11:03,306 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 06:11:03,307 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-25 06:11:03,315 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 06:11:03,315 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:11:03,315 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-25 06:11:03,323 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:11:03,323 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 06:11:03,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:11:03,353 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 06:11:03,379 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-25 06:11:03,379 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 06:11:03,494 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-25 06:11:03,515 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:11:03,515 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-25 06:11:03,525 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:11:03,525 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 06:11:03,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:11:03,597 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 06:11:03,603 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-25 06:11:03,603 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 06:11:03,709 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-25 06:11:03,711 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 06:11:03,711 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7, 7, 7] total 13 [2018-01-25 06:11:03,711 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 06:11:03,711 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-25 06:11:03,712 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-25 06:11:03,712 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2018-01-25 06:11:03,712 INFO L87 Difference]: Start difference. First operand 133 states and 138 transitions. Second operand 8 states. [2018-01-25 06:11:03,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:11:03,748 INFO L93 Difference]: Finished difference Result 242 states and 252 transitions. [2018-01-25 06:11:03,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-25 06:11:03,748 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 61 [2018-01-25 06:11:03,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:11:03,749 INFO L225 Difference]: With dead ends: 242 [2018-01-25 06:11:03,749 INFO L226 Difference]: Without dead ends: 134 [2018-01-25 06:11:03,750 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-25 06:11:03,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-01-25 06:11:03,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2018-01-25 06:11:03,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-01-25 06:11:03,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 139 transitions. [2018-01-25 06:11:03,762 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 139 transitions. Word has length 61 [2018-01-25 06:11:03,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:11:03,762 INFO L432 AbstractCegarLoop]: Abstraction has 134 states and 139 transitions. [2018-01-25 06:11:03,762 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-25 06:11:03,762 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 139 transitions. [2018-01-25 06:11:03,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-01-25 06:11:03,763 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:11:03,763 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-25 06:11:03,763 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-25 06:11:03,763 INFO L82 PathProgramCache]: Analyzing trace with hash -1969498855, now seen corresponding path program 2 times [2018-01-25 06:11:03,763 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:11:03,764 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:11:03,764 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:11:03,764 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:11:03,764 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:11:03,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:11:03,782 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:11:03,864 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-25 06:11:03,865 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:11:03,865 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 06:11:03,865 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-25 06:11:03,865 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-25 06:11:03,865 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:11:03,865 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-25 06:11:03,874 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-25 06:11:03,874 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-25 06:11:03,910 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 06:11:03,916 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 06:11:03,920 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 06:11:03,928 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-25 06:11:03,929 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 06:11:03,942 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-25 06:11:03,943 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 06:11:03,960 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-25 06:11:03,961 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:36 [2018-01-25 06:11:06,164 WARN L143 SmtUtils]: Spent 2017ms on a formula simplification that was a NOOP. DAG size: 27 [2018-01-25 06:11:06,629 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-25 06:11:06,629 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 06:11:07,255 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-25 06:11:07,277 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-25 06:11:07,278 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [18, 16] imperfect sequences [8] total 40 [2018-01-25 06:11:07,278 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:11:07,278 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-25 06:11:07,278 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-25 06:11:07,278 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=1428, Unknown=0, NotChecked=0, Total=1560 [2018-01-25 06:11:07,279 INFO L87 Difference]: Start difference. First operand 134 states and 139 transitions. Second operand 19 states. [2018-01-25 06:11:08,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:11:08,305 INFO L93 Difference]: Finished difference Result 134 states and 139 transitions. [2018-01-25 06:11:08,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-01-25 06:11:08,306 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 62 [2018-01-25 06:11:08,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:11:08,307 INFO L225 Difference]: With dead ends: 134 [2018-01-25 06:11:08,307 INFO L226 Difference]: Without dead ends: 132 [2018-01-25 06:11:08,307 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 91 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 507 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=173, Invalid=1807, Unknown=0, NotChecked=0, Total=1980 [2018-01-25 06:11:08,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-01-25 06:11:08,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2018-01-25 06:11:08,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-01-25 06:11:08,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 137 transitions. [2018-01-25 06:11:08,352 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 137 transitions. Word has length 62 [2018-01-25 06:11:08,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:11:08,352 INFO L432 AbstractCegarLoop]: Abstraction has 132 states and 137 transitions. [2018-01-25 06:11:08,352 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-01-25 06:11:08,352 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 137 transitions. [2018-01-25 06:11:08,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-01-25 06:11:08,353 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:11:08,354 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-25 06:11:08,354 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-25 06:11:08,354 INFO L82 PathProgramCache]: Analyzing trace with hash -525790244, now seen corresponding path program 1 times [2018-01-25 06:11:08,354 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:11:08,355 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:11:08,356 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-25 06:11:08,356 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:11:08,356 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:11:08,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:11:08,376 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:11:08,550 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-25 06:11:08,550 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:11:08,550 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-01-25 06:11:08,551 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:11:08,551 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-25 06:11:08,551 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-25 06:11:08,551 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-01-25 06:11:08,552 INFO L87 Difference]: Start difference. First operand 132 states and 137 transitions. Second operand 11 states. [2018-01-25 06:11:08,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:11:08,686 INFO L93 Difference]: Finished difference Result 194 states and 202 transitions. [2018-01-25 06:11:08,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-25 06:11:08,687 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 71 [2018-01-25 06:11:08,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:11:08,688 INFO L225 Difference]: With dead ends: 194 [2018-01-25 06:11:08,688 INFO L226 Difference]: Without dead ends: 132 [2018-01-25 06:11:08,689 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-25 06:11:08,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-01-25 06:11:08,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2018-01-25 06:11:08,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-01-25 06:11:08,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 136 transitions. [2018-01-25 06:11:08,709 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 136 transitions. Word has length 71 [2018-01-25 06:11:08,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:11:08,709 INFO L432 AbstractCegarLoop]: Abstraction has 132 states and 136 transitions. [2018-01-25 06:11:08,709 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-25 06:11:08,709 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 136 transitions. [2018-01-25 06:11:08,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-01-25 06:11:08,710 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:11:08,711 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-25 06:11:08,711 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-25 06:11:08,711 INFO L82 PathProgramCache]: Analyzing trace with hash -1264904852, now seen corresponding path program 1 times [2018-01-25 06:11:08,711 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:11:08,712 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:11:08,712 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:11:08,712 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:11:08,712 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:11:08,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:11:08,735 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:11:09,088 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-25 06:11:09,089 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:11:09,089 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-01-25 06:11:09,089 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:11:09,089 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-25 06:11:09,089 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-25 06:11:09,090 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2018-01-25 06:11:09,090 INFO L87 Difference]: Start difference. First operand 132 states and 136 transitions. Second operand 18 states. [2018-01-25 06:11:09,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:11:09,855 INFO L93 Difference]: Finished difference Result 162 states and 174 transitions. [2018-01-25 06:11:09,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-01-25 06:11:09,855 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 84 [2018-01-25 06:11:09,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:11:09,856 INFO L225 Difference]: With dead ends: 162 [2018-01-25 06:11:09,857 INFO L226 Difference]: Without dead ends: 160 [2018-01-25 06:11:09,857 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=59, Invalid=493, Unknown=0, NotChecked=0, Total=552 [2018-01-25 06:11:09,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-01-25 06:11:09,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 155. [2018-01-25 06:11:09,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-01-25 06:11:09,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 167 transitions. [2018-01-25 06:11:09,874 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 167 transitions. Word has length 84 [2018-01-25 06:11:09,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:11:09,875 INFO L432 AbstractCegarLoop]: Abstraction has 155 states and 167 transitions. [2018-01-25 06:11:09,875 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-25 06:11:09,875 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 167 transitions. [2018-01-25 06:11:09,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-01-25 06:11:09,876 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:11:09,876 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-25 06:11:09,876 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-25 06:11:09,877 INFO L82 PathProgramCache]: Analyzing trace with hash -1264904851, now seen corresponding path program 1 times [2018-01-25 06:11:09,877 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:11:09,877 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:11:09,878 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:11:09,878 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:11:09,878 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:11:09,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:11:09,894 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:11:09,990 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-25 06:11:09,991 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:11:09,991 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 06:11:09,991 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 85 with the following transitions: [2018-01-25 06:11:09,991 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-25 06:11:09,994 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 06:11:09,994 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 06:11:13,012 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 06:11:13,012 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-25 06:11:13,014 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 06:11:13,014 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:11:13,014 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-25 06:11:13,032 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:11:13,033 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 06:11:13,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:11:13,086 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 06:11:13,186 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-25 06:11:13,186 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 06:11:13,558 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-25 06:11:13,578 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:11:13,578 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-25 06:11:13,581 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:11:13,581 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 06:11:13,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:11:13,664 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 06:11:13,672 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-25 06:11:13,673 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 06:11:13,876 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-25 06:11:13,878 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 06:11:13,878 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 8, 8] total 15 [2018-01-25 06:11:13,878 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 06:11:13,878 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-25 06:11:13,879 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-25 06:11:13,879 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=117, Unknown=0, NotChecked=0, Total=210 [2018-01-25 06:11:13,879 INFO L87 Difference]: Start difference. First operand 155 states and 167 transitions. Second operand 9 states. [2018-01-25 06:11:13,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:11:13,960 INFO L93 Difference]: Finished difference Result 285 states and 309 transitions. [2018-01-25 06:11:13,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-25 06:11:13,960 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 84 [2018-01-25 06:11:13,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:11:13,961 INFO L225 Difference]: With dead ends: 285 [2018-01-25 06:11:13,961 INFO L226 Difference]: Without dead ends: 156 [2018-01-25 06:11:13,961 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 327 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=137, Unknown=0, NotChecked=0, Total=240 [2018-01-25 06:11:13,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-01-25 06:11:13,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2018-01-25 06:11:13,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-01-25 06:11:13,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 168 transitions. [2018-01-25 06:11:13,987 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 168 transitions. Word has length 84 [2018-01-25 06:11:13,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:11:13,987 INFO L432 AbstractCegarLoop]: Abstraction has 156 states and 168 transitions. [2018-01-25 06:11:13,987 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-25 06:11:13,988 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 168 transitions. [2018-01-25 06:11:13,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-01-25 06:11:13,988 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:11:13,989 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-25 06:11:13,989 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-25 06:11:13,989 INFO L82 PathProgramCache]: Analyzing trace with hash -242617255, now seen corresponding path program 2 times [2018-01-25 06:11:13,989 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:11:13,990 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:11:13,990 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:11:13,990 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:11:13,990 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:11:14,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:11:14,012 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:11:14,081 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-25 06:11:14,081 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:11:14,081 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 06:11:14,081 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-25 06:11:14,082 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-25 06:11:14,082 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:11:14,082 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-25 06:11:14,090 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-25 06:11:14,090 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-25 06:11:14,140 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 06:11:14,148 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 06:11:14,154 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 06:11:14,158 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-25 06:11:14,158 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 06:11:14,175 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-25 06:11:14,175 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 06:11:14,190 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-25 06:11:14,190 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:36 [2018-01-25 06:11:15,116 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-25 06:11:15,116 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 06:11:17,895 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-25 06:11:17,916 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-25 06:11:17,916 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [20, 18] imperfect sequences [9] total 45 [2018-01-25 06:11:17,917 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:11:17,917 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-25 06:11:17,917 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-25 06:11:17,917 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=1826, Unknown=1, NotChecked=0, Total=1980 [2018-01-25 06:11:17,918 INFO L87 Difference]: Start difference. First operand 156 states and 168 transitions. Second operand 21 states. [2018-01-25 06:11:19,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:11:19,157 INFO L93 Difference]: Finished difference Result 156 states and 168 transitions. [2018-01-25 06:11:19,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-01-25 06:11:19,157 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 85 [2018-01-25 06:11:19,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:11:19,158 INFO L225 Difference]: With dead ends: 156 [2018-01-25 06:11:19,158 INFO L226 Difference]: Without dead ends: 154 [2018-01-25 06:11:19,159 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 131 SyntacticMatches, 4 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 684 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=202, Invalid=2347, Unknown=1, NotChecked=0, Total=2550 [2018-01-25 06:11:19,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-01-25 06:11:19,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2018-01-25 06:11:19,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-01-25 06:11:19,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 164 transitions. [2018-01-25 06:11:19,179 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 164 transitions. Word has length 85 [2018-01-25 06:11:19,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:11:19,179 INFO L432 AbstractCegarLoop]: Abstraction has 154 states and 164 transitions. [2018-01-25 06:11:19,179 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-25 06:11:19,179 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 164 transitions. [2018-01-25 06:11:19,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-01-25 06:11:19,179 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:11:19,180 INFO L322 BasicCegarLoop]: trace histogram [5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:11:19,180 INFO L371 AbstractCegarLoop]: === Iteration 24 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-25 06:11:19,180 INFO L82 PathProgramCache]: Analyzing trace with hash 1137159674, now seen corresponding path program 1 times [2018-01-25 06:11:19,180 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:11:19,181 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:11:19,181 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-25 06:11:19,181 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:11:19,181 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:11:19,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:11:19,197 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:11:19,366 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-01-25 06:11:19,366 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:11:19,366 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 06:11:19,366 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 89 with the following transitions: [2018-01-25 06:11:19,367 INFO L201 CegarAbsIntRunner]: [0], [2], [6], [10], [12], [13], [16], [17], [19], [20], [21], [28], [30], [31], [36], [38], [52], [54], [56], [59], [60], [64], [67], [68], [69], [72], [73], [74], [78], [80], [81], [92], [93], [96], [97], [100], [101], [123], [124], [127], [130], [131], [134], [135], [136], [138], [139], [140], [145], [148], [153], [154], [158], [159], [160], [161], [162], [163], [164], [165], [166], [167], [170], [171], [174], [175], [176], [177], [178], [179], [180], [181], [182], [183], [184], [185], [194], [195], [196], [197], [198] [2018-01-25 06:11:19,368 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 06:11:19,368 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 06:11:22,381 INFO L262 AbstractInterpreter]: Error location(s) were unreachable [2018-01-25 06:11:22,381 INFO L268 AbstractInterpreter]: Visited 74 different actions 82 times. Merged at 3 different actions 6 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 23 variables. [2018-01-25 06:11:22,383 INFO L395 sIntCurrentIteration]: Generating AbsInt predicates [2018-01-25 06:11:23,654 INFO L232 lantSequenceWeakener]: Weakened 52 states. On average, predicates are now at 70.96% of their original sizes. [2018-01-25 06:11:23,655 INFO L408 sIntCurrentIteration]: Unifying AI predicates Received shutdown request... [2018-01-25 06:11:24,424 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-25 06:11:24,428 WARN L187 ceAbstractionStarter]: Timeout [2018-01-25 06:11:24,428 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.01 06:11:24 BoogieIcfgContainer [2018-01-25 06:11:24,428 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-25 06:11:24,429 INFO L168 Benchmark]: Toolchain (without parser) took 43691.00 ms. Allocated memory was 299.4 MB in the beginning and 1.5 GB in the end (delta: 1.2 GB). Free memory was 258.3 MB in the beginning and 405.1 MB in the end (delta: -146.8 MB). Peak memory consumption was 1.0 GB. Max. memory is 5.3 GB. [2018-01-25 06:11:24,429 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 299.4 MB. Free memory is still 265.2 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-25 06:11:24,429 INFO L168 Benchmark]: CACSL2BoogieTranslator took 224.00 ms. Allocated memory is still 299.4 MB. Free memory was 258.3 MB in the beginning and 244.1 MB in the end (delta: 14.2 MB). Peak memory consumption was 14.2 MB. Max. memory is 5.3 GB. [2018-01-25 06:11:24,430 INFO L168 Benchmark]: Boogie Preprocessor took 49.92 ms. Allocated memory is still 299.4 MB. Free memory was 244.1 MB in the beginning and 242.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-25 06:11:24,430 INFO L168 Benchmark]: RCFGBuilder took 480.62 ms. Allocated memory is still 299.4 MB. Free memory was 242.1 MB in the beginning and 206.9 MB in the end (delta: 35.2 MB). Peak memory consumption was 35.2 MB. Max. memory is 5.3 GB. [2018-01-25 06:11:24,430 INFO L168 Benchmark]: TraceAbstraction took 42927.34 ms. Allocated memory was 299.4 MB in the beginning and 1.5 GB in the end (delta: 1.2 GB). Free memory was 206.9 MB in the beginning and 405.1 MB in the end (delta: -198.2 MB). Peak memory consumption was 994.0 MB. Max. memory is 5.3 GB. [2018-01-25 06:11:24,432 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.12 ms. Allocated memory is still 299.4 MB. Free memory is still 265.2 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 224.00 ms. Allocated memory is still 299.4 MB. Free memory was 258.3 MB in the beginning and 244.1 MB in the end (delta: 14.2 MB). Peak memory consumption was 14.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 49.92 ms. Allocated memory is still 299.4 MB. Free memory was 244.1 MB in the beginning and 242.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 480.62 ms. Allocated memory is still 299.4 MB. Free memory was 242.1 MB in the beginning and 206.9 MB in the end (delta: 35.2 MB). Peak memory consumption was 35.2 MB. Max. memory is 5.3 GB. * TraceAbstraction took 42927.34 ms. Allocated memory was 299.4 MB in the beginning and 1.5 GB in the end (delta: 1.2 GB). Free memory was 206.9 MB in the beginning and 405.1 MB in the end (delta: -198.2 MB). Peak memory consumption was 994.0 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.500011 RENAME_VARIABLES(MILLISECONDS) : 0.103665 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.194130 PROJECTAWAY(MILLISECONDS) : 0.042938 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.100428 DISJOIN(MILLISECONDS) : 0.680735 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.129836 ADD_EQUALITY(MILLISECONDS) : 0.021571 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.006967 #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.247721 RENAME_VARIABLES(MILLISECONDS) : 0.055731 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.100754 PROJECTAWAY(MILLISECONDS) : 0.041607 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.033568 DISJOIN(MILLISECONDS) : 0.509410 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.070573 ADD_EQUALITY(MILLISECONDS) : 0.013853 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.004705 #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.223221 RENAME_VARIABLES(MILLISECONDS) : 0.049122 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.093895 PROJECTAWAY(MILLISECONDS) : 0.022189 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.053735 DISJOIN(MILLISECONDS) : 0.479283 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.062167 ADD_EQUALITY(MILLISECONDS) : 0.010733 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.006563 #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.334751 RENAME_VARIABLES(MILLISECONDS) : 0.088610 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.137268 PROJECTAWAY(MILLISECONDS) : 0.039157 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.037578 DISJOIN(MILLISECONDS) : 0.354223 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.112369 ADD_EQUALITY(MILLISECONDS) : 0.013845 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.005447 #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 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 72 LocStat_MAX_WEQGRAPH_SIZE : 6 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 570 LocStat_NO_SUPPORTING_DISEQUALITIES : 63 LocStat_NO_DISJUNCTIONS : -144 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 102 TransStat_MAX_WEQGRAPH_SIZE : 6 TransStat_MAX_SIZEOF_WEQEDGELABEL : 2 TransStat_NO_SUPPORTING_EQUALITIES : 187 TransStat_NO_SUPPORTING_DISEQUALITIES : 11 TransStat_NO_DISJUNCTIONS : 106 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.277121 RENAME_VARIABLES(MILLISECONDS) : 0.044659 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.260491 PROJECTAWAY(MILLISECONDS) : 0.008472 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.040515 DISJOIN(MILLISECONDS) : 0.423802 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.056738 ADD_EQUALITY(MILLISECONDS) : 0.008203 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.003520 #CONJOIN_DISJUNCTIVE : 157 #RENAME_VARIABLES : 257 #UNFREEZE : 0 #CONJOIN : 335 #PROJECTAWAY : 265 #ADD_WEAK_EQUALITY : 33 #DISJOIN : 3 #RENAME_VARIABLES_DISJUNCTIVE : 253 #ADD_EQUALITY : 208 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 10 * 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 analyzing trace of length 89 with TraceHistMax 5, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 23 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1294). Cancelled while BasicCegarLoop was analyzing trace of length 89 with TraceHistMax 5, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 23 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1411). Cancelled while BasicCegarLoop was analyzing trace of length 89 with TraceHistMax 5, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 23 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1411). Cancelled while BasicCegarLoop was analyzing trace of length 89 with TraceHistMax 5, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 23 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1265). Cancelled while BasicCegarLoop was analyzing trace of length 89 with TraceHistMax 5, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 23 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1265). Cancelled while BasicCegarLoop was analyzing trace of length 89 with TraceHistMax 5, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 23 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1267). Cancelled while BasicCegarLoop was analyzing trace of length 89 with TraceHistMax 5, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 23 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1267). Cancelled while BasicCegarLoop was analyzing trace of length 89 with TraceHistMax 5, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 23 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1256). Cancelled while BasicCegarLoop was analyzing trace of length 89 with TraceHistMax 5, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 23 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1256). Cancelled while BasicCegarLoop was analyzing trace of length 89 with TraceHistMax 5, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 23 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1258). Cancelled while BasicCegarLoop was analyzing trace of length 89 with TraceHistMax 5, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 23 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1258). Cancelled while BasicCegarLoop was analyzing trace of length 89 with TraceHistMax 5, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 23 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1344). Cancelled while BasicCegarLoop was analyzing trace of length 89 with TraceHistMax 5, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 23 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1340). Cancelled while BasicCegarLoop was analyzing trace of length 89 with TraceHistMax 5, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 23 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1344). Cancelled while BasicCegarLoop was analyzing trace of length 89 with TraceHistMax 5, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 23 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1340). Cancelled while BasicCegarLoop was analyzing trace of length 89 with TraceHistMax 5, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 23 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1339). Cancelled while BasicCegarLoop was analyzing trace of length 89 with TraceHistMax 5, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 23 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1339). Cancelled while BasicCegarLoop was analyzing trace of length 89 with TraceHistMax 5, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 23 known predicates. - TimeoutResultAtElement [Line: 1443]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 1443). Cancelled while BasicCegarLoop was analyzing trace of length 89 with TraceHistMax 5, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 23 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1099). Cancelled while BasicCegarLoop was analyzing trace of length 89 with TraceHistMax 5, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 23 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1100). Cancelled while BasicCegarLoop was analyzing trace of length 89 with TraceHistMax 5, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 23 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1100). Cancelled while BasicCegarLoop was analyzing trace of length 89 with TraceHistMax 5, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 23 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1099). Cancelled while BasicCegarLoop was analyzing trace of length 89 with TraceHistMax 5, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 23 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 21 procedures, 143 locations, 23 error locations. TIMEOUT Result, 42.8s OverallTime, 24 OverallIterations, 5 TraceHistogramMax, 7.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3006 SDtfs, 962 SDslu, 16605 SDs, 0 SdLazy, 5801 SolverSat, 223 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1561 GetRequests, 1213 SyntacticMatches, 18 SemanticMatches, 330 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1881 ImplicationChecksByTransitivity, 15.6s 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, 14.0s AbstIntTime, 5 AbstIntIterations, 1 AbstIntStrong, 0.923116248750123 AbsIntWeakeningRatio, 0.9195402298850575 AbsIntAvgWeakeningVarsNumRemoved, 4.977011494252873 AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 23 MinimizatonAttempts, 55 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 17.2s 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_smtcomp.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-25_06-11-24-443.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_smtcomp.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-25_06-11-24-443.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_smtcomp.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-25_06-11-24-443.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_smtcomp.epf_AutomizerC.xml/Csv-VPDomainBenchmark-1-2018-01-25_06-11-24-443.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_smtcomp.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-1-2018-01-25_06-11-24-443.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_smtcomp.epf_AutomizerC.xml/Csv-VPDomainBenchmark-2-2018-01-25_06-11-24-443.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_smtcomp.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-2-2018-01-25_06-11-24-443.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_smtcomp.epf_AutomizerC.xml/Csv-VPDomainBenchmark-3-2018-01-25_06-11-24-443.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_smtcomp.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-3-2018-01-25_06-11-24-443.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_smtcomp.epf_AutomizerC.xml/Csv-VPDomainBenchmark-4-2018-01-25_06-11-24-443.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_smtcomp.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-4-2018-01-25_06-11-24-443.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_smtcomp.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-25_06-11-24-443.csv Completed graceful shutdown