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_Camel+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test22_3_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-acfac67 [2018-01-28 22:42:54,612 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-28 22:42:54,613 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-28 22:42:54,628 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-28 22:42:54,628 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-28 22:42:54,629 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-28 22:42:54,630 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-28 22:42:54,631 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-28 22:42:54,633 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-28 22:42:54,634 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-28 22:42:54,635 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-28 22:42:54,635 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-28 22:42:54,636 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-28 22:42:54,637 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-28 22:42:54,638 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-28 22:42:54,641 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-28 22:42:54,643 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-28 22:42:54,645 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-28 22:42:54,646 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-28 22:42:54,647 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-28 22:42:54,649 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-28 22:42:54,650 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-28 22:42:54,650 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-28 22:42:54,651 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-28 22:42:54,652 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-28 22:42:54,653 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-28 22:42:54,653 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-28 22:42:54,654 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-28 22:42:54,654 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-28 22:42:54,654 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-28 22:42:54,655 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-28 22:42:54,655 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf [2018-01-28 22:42:54,663 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-28 22:42:54,664 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-28 22:42:54,664 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-28 22:42:54,665 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-28 22:42:54,665 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-28 22:42:54,665 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-28 22:42:54,665 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-28 22:42:54,665 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-28 22:42:54,666 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-28 22:42:54,666 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-28 22:42:54,666 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-28 22:42:54,666 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-28 22:42:54,666 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-28 22:42:54,666 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-28 22:42:54,666 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-28 22:42:54,666 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-28 22:42:54,667 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-28 22:42:54,667 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-28 22:42:54,667 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-28 22:42:54,667 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-28 22:42:54,667 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-28 22:42:54,667 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-28 22:42:54,667 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-28 22:42:54,668 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-28 22:42:54,668 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-28 22:42:54,668 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-28 22:42:54,668 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-28 22:42:54,668 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-28 22:42:54,668 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-28 22:42:54,669 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-28 22:42:54,669 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-28 22:42:54,669 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-28 22:42:54,669 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-28 22:42:54,669 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-28 22:42:54,700 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-28 22:42:54,709 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-28 22:42:54,712 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-28 22:42:54,714 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-28 22:42:54,714 INFO L276 PluginConnector]: CDTParser initialized [2018-01-28 22:42:54,715 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test22_3_true-valid-memsafety_true-termination.i [2018-01-28 22:42:54,902 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-28 22:42:54,907 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-28 22:42:54,933 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-28 22:42:54,934 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-28 22:42:54,938 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-28 22:42:54,939 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 10:42:54" (1/1) ... [2018-01-28 22:42:54,941 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@330060e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:42:54, skipping insertion in model container [2018-01-28 22:42:54,942 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 10:42:54" (1/1) ... [2018-01-28 22:42:54,954 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-28 22:42:55,000 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-28 22:42:55,123 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-28 22:42:55,151 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-28 22:42:55,165 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:42:55 WrapperNode [2018-01-28 22:42:55,165 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-28 22:42:55,166 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-28 22:42:55,166 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-28 22:42:55,166 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-28 22:42:55,177 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:42:55" (1/1) ... [2018-01-28 22:42:55,177 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:42:55" (1/1) ... [2018-01-28 22:42:55,188 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:42:55" (1/1) ... [2018-01-28 22:42:55,188 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:42:55" (1/1) ... [2018-01-28 22:42:55,197 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:42:55" (1/1) ... [2018-01-28 22:42:55,201 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:42:55" (1/1) ... [2018-01-28 22:42:55,203 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:42:55" (1/1) ... [2018-01-28 22:42:55,207 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-28 22:42:55,207 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-28 22:42:55,208 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-28 22:42:55,208 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-28 22:42:55,209 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:42:55" (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-28 22:42:55,257 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-28 22:42:55,257 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-28 22:42:55,257 INFO L136 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2018-01-28 22:42:55,258 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-28 22:42:55,258 INFO L136 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2018-01-28 22:42:55,258 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_atomic_add_return [2018-01-28 22:42:55,258 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_atomic_sub_return [2018-01-28 22:42:55,258 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_sub [2018-01-28 22:42:55,258 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_init [2018-01-28 22:42:55,258 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_get [2018-01-28 22:42:55,259 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_put [2018-01-28 22:42:55,259 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_cleanup [2018-01-28 22:42:55,259 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_release [2018-01-28 22:42:55,259 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2018-01-28 22:42:55,259 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_get [2018-01-28 22:42:55,259 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init_internal [2018-01-28 22:42:55,260 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init [2018-01-28 22:42:55,260 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_create [2018-01-28 22:42:55,260 INFO L136 BoogieDeclarations]: Found implementation of procedure f_22_get [2018-01-28 22:42:55,260 INFO L136 BoogieDeclarations]: Found implementation of procedure f_22_put [2018-01-28 22:42:55,260 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-28 22:42:55,260 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-28 22:42:55,261 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-28 22:42:55,261 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-28 22:42:55,261 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-28 22:42:55,261 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-28 22:42:55,261 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-28 22:42:55,261 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-28 22:42:55,262 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-28 22:42:55,262 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2018-01-28 22:42:55,262 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2018-01-28 22:42:55,262 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-28 22:42:55,262 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-28 22:42:55,262 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-28 22:42:55,263 INFO L128 BoogieDeclarations]: Found specification of procedure memset [2018-01-28 22:42:55,263 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-28 22:42:55,263 INFO L128 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2018-01-28 22:42:55,263 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_atomic_add_return [2018-01-28 22:42:55,263 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_atomic_sub_return [2018-01-28 22:42:55,263 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_sub [2018-01-28 22:42:55,264 INFO L128 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2018-01-28 22:42:55,264 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_init [2018-01-28 22:42:55,264 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_get [2018-01-28 22:42:55,264 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_put [2018-01-28 22:42:55,264 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_cleanup [2018-01-28 22:42:55,264 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_release [2018-01-28 22:42:55,264 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2018-01-28 22:42:55,265 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_get [2018-01-28 22:42:55,265 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_init_internal [2018-01-28 22:42:55,265 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_init [2018-01-28 22:42:55,265 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_create [2018-01-28 22:42:55,265 INFO L128 BoogieDeclarations]: Found specification of procedure f_22_get [2018-01-28 22:42:55,265 INFO L128 BoogieDeclarations]: Found specification of procedure f_22_put [2018-01-28 22:42:55,265 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-28 22:42:55,265 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-28 22:42:55,265 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-28 22:42:55,266 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-28 22:42:55,529 WARN L455 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-01-28 22:42:55,761 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-28 22:42:55,761 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 10:42:55 BoogieIcfgContainer [2018-01-28 22:42:55,762 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-28 22:42:55,763 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-28 22:42:55,763 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-28 22:42:55,766 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-28 22:42:55,767 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 10:42:54" (1/3) ... [2018-01-28 22:42:55,767 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22aca530 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 10:42:55, skipping insertion in model container [2018-01-28 22:42:55,768 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:42:55" (2/3) ... [2018-01-28 22:42:55,768 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22aca530 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 10:42:55, skipping insertion in model container [2018-01-28 22:42:55,768 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 10:42:55" (3/3) ... [2018-01-28 22:42:55,770 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test22_3_true-valid-memsafety_true-termination.i [2018-01-28 22:42:55,779 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-28 22:42:55,788 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 23 error locations. [2018-01-28 22:42:55,839 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-28 22:42:55,839 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-28 22:42:55,839 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-28 22:42:55,839 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-28 22:42:55,840 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-28 22:42:55,840 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-28 22:42:55,840 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-28 22:42:55,840 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-28 22:42:55,841 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-28 22:42:55,863 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states. [2018-01-28 22:42:55,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-28 22:42:55,870 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:42:55,872 INFO L330 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] [2018-01-28 22:42:55,872 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-28 22:42:55,877 INFO L82 PathProgramCache]: Analyzing trace with hash -1885508389, now seen corresponding path program 1 times [2018-01-28 22:42:55,879 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:42:55,880 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:42:55,945 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:42:55,946 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:42:55,946 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:42:55,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:42:56,006 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:42:56,211 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-28 22:42:56,214 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:42:56,214 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-28 22:42:56,216 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-28 22:42:56,231 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-28 22:42:56,231 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-28 22:42:56,234 INFO L87 Difference]: Start difference. First operand 184 states. Second operand 5 states. [2018-01-28 22:42:56,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:42:56,321 INFO L93 Difference]: Finished difference Result 350 states and 367 transitions. [2018-01-28 22:42:56,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-28 22:42:56,322 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-01-28 22:42:56,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:42:56,333 INFO L225 Difference]: With dead ends: 350 [2018-01-28 22:42:56,333 INFO L226 Difference]: Without dead ends: 188 [2018-01-28 22:42:56,337 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-28 22:42:56,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-01-28 22:42:56,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 186. [2018-01-28 22:42:56,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-01-28 22:42:56,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 195 transitions. [2018-01-28 22:42:56,377 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 195 transitions. Word has length 22 [2018-01-28 22:42:56,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:42:56,377 INFO L432 AbstractCegarLoop]: Abstraction has 186 states and 195 transitions. [2018-01-28 22:42:56,377 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-28 22:42:56,378 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 195 transitions. [2018-01-28 22:42:56,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-28 22:42:56,378 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:42:56,378 INFO L330 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] [2018-01-28 22:42:56,379 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-28 22:42:56,379 INFO L82 PathProgramCache]: Analyzing trace with hash -1475872018, now seen corresponding path program 1 times [2018-01-28 22:42:56,379 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:42:56,379 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:42:56,381 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:42:56,381 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:42:56,381 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:42:56,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:42:56,402 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:42:56,481 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-28 22:42:56,482 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:42:56,482 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-28 22:42:56,484 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-28 22:42:56,484 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-28 22:42:56,484 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-28 22:42:56,484 INFO L87 Difference]: Start difference. First operand 186 states and 195 transitions. Second operand 6 states. [2018-01-28 22:42:56,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:42:56,707 INFO L93 Difference]: Finished difference Result 189 states and 198 transitions. [2018-01-28 22:42:56,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-28 22:42:56,707 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-01-28 22:42:56,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:42:56,710 INFO L225 Difference]: With dead ends: 189 [2018-01-28 22:42:56,710 INFO L226 Difference]: Without dead ends: 188 [2018-01-28 22:42:56,711 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-28 22:42:56,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-01-28 22:42:56,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 185. [2018-01-28 22:42:56,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-01-28 22:42:56,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 194 transitions. [2018-01-28 22:42:56,729 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 194 transitions. Word has length 23 [2018-01-28 22:42:56,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:42:56,730 INFO L432 AbstractCegarLoop]: Abstraction has 185 states and 194 transitions. [2018-01-28 22:42:56,730 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-28 22:42:56,730 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 194 transitions. [2018-01-28 22:42:56,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-28 22:42:56,731 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:42:56,731 INFO L330 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] [2018-01-28 22:42:56,731 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-28 22:42:56,731 INFO L82 PathProgramCache]: Analyzing trace with hash -1475872017, now seen corresponding path program 1 times [2018-01-28 22:42:56,732 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:42:56,732 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:42:56,733 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:42:56,733 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:42:56,734 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:42:56,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:42:56,753 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:42:57,024 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-28 22:42:57,024 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:42:57,024 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-28 22:42:57,024 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-28 22:42:57,025 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-28 22:42:57,025 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-28 22:42:57,025 INFO L87 Difference]: Start difference. First operand 185 states and 194 transitions. Second operand 7 states. [2018-01-28 22:42:57,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:42:57,268 INFO L93 Difference]: Finished difference Result 188 states and 197 transitions. [2018-01-28 22:42:57,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-28 22:42:57,268 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2018-01-28 22:42:57,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:42:57,270 INFO L225 Difference]: With dead ends: 188 [2018-01-28 22:42:57,270 INFO L226 Difference]: Without dead ends: 187 [2018-01-28 22:42:57,270 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-01-28 22:42:57,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-01-28 22:42:57,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 184. [2018-01-28 22:42:57,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-01-28 22:42:57,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 193 transitions. [2018-01-28 22:42:57,282 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 193 transitions. Word has length 23 [2018-01-28 22:42:57,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:42:57,283 INFO L432 AbstractCegarLoop]: Abstraction has 184 states and 193 transitions. [2018-01-28 22:42:57,283 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-28 22:42:57,283 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 193 transitions. [2018-01-28 22:42:57,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-28 22:42:57,284 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:42:57,284 INFO L330 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, 1, 1] [2018-01-28 22:42:57,285 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-28 22:42:57,285 INFO L82 PathProgramCache]: Analyzing trace with hash -39640287, now seen corresponding path program 1 times [2018-01-28 22:42:57,285 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:42:57,285 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:42:57,287 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:42:57,287 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:42:57,287 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:42:57,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:42:57,309 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:42:57,430 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-28 22:42:57,430 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:42:57,430 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-28 22:42:57,430 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-28 22:42:57,431 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-28 22:42:57,431 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-01-28 22:42:57,431 INFO L87 Difference]: Start difference. First operand 184 states and 193 transitions. Second operand 9 states. [2018-01-28 22:42:57,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:42:57,532 INFO L93 Difference]: Finished difference Result 312 states and 327 transitions. [2018-01-28 22:42:57,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-28 22:42:57,532 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 38 [2018-01-28 22:42:57,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:42:57,534 INFO L225 Difference]: With dead ends: 312 [2018-01-28 22:42:57,535 INFO L226 Difference]: Without dead ends: 206 [2018-01-28 22:42:57,536 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-01-28 22:42:57,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-01-28 22:42:57,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 199. [2018-01-28 22:42:57,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-01-28 22:42:57,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 208 transitions. [2018-01-28 22:42:57,552 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 208 transitions. Word has length 38 [2018-01-28 22:42:57,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:42:57,552 INFO L432 AbstractCegarLoop]: Abstraction has 199 states and 208 transitions. [2018-01-28 22:42:57,553 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-28 22:42:57,553 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 208 transitions. [2018-01-28 22:42:57,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-01-28 22:42:57,554 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:42:57,554 INFO L330 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, 1, 1, 1] [2018-01-28 22:42:57,554 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-28 22:42:57,555 INFO L82 PathProgramCache]: Analyzing trace with hash 490857740, now seen corresponding path program 1 times [2018-01-28 22:42:57,555 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:42:57,555 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:42:57,556 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:42:57,557 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:42:57,557 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:42:57,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:42:57,575 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:42:57,670 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-28 22:42:57,671 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:42:57,671 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-28 22:42:57,672 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-28 22:42:57,672 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-28 22:42:57,672 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-01-28 22:42:57,672 INFO L87 Difference]: Start difference. First operand 199 states and 208 transitions. Second operand 10 states. [2018-01-28 22:42:57,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:42:57,912 INFO L93 Difference]: Finished difference Result 199 states and 208 transitions. [2018-01-28 22:42:57,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-28 22:42:57,912 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 39 [2018-01-28 22:42:57,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:42:57,914 INFO L225 Difference]: With dead ends: 199 [2018-01-28 22:42:57,914 INFO L226 Difference]: Without dead ends: 198 [2018-01-28 22:42:57,915 INFO L533 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-28 22:42:57,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-01-28 22:42:57,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2018-01-28 22:42:57,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-01-28 22:42:57,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 207 transitions. [2018-01-28 22:42:57,927 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 207 transitions. Word has length 39 [2018-01-28 22:42:57,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:42:57,928 INFO L432 AbstractCegarLoop]: Abstraction has 198 states and 207 transitions. [2018-01-28 22:42:57,928 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-28 22:42:57,928 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 207 transitions. [2018-01-28 22:42:57,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-01-28 22:42:57,930 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:42:57,930 INFO L330 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, 1, 1, 1] [2018-01-28 22:42:57,930 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-28 22:42:57,930 INFO L82 PathProgramCache]: Analyzing trace with hash 490857741, now seen corresponding path program 1 times [2018-01-28 22:42:57,930 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:42:57,930 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:42:57,932 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:42:57,932 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:42:57,932 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:42:57,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:42:57,950 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:42:58,006 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-28 22:42:58,007 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:42:58,007 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-28 22:42:58,007 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-28 22:42:58,008 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-28 22:42:58,008 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-28 22:42:58,008 INFO L87 Difference]: Start difference. First operand 198 states and 207 transitions. Second operand 4 states. [2018-01-28 22:42:58,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:42:58,039 INFO L93 Difference]: Finished difference Result 347 states and 363 transitions. [2018-01-28 22:42:58,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-28 22:42:58,040 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2018-01-28 22:42:58,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:42:58,042 INFO L225 Difference]: With dead ends: 347 [2018-01-28 22:42:58,042 INFO L226 Difference]: Without dead ends: 202 [2018-01-28 22:42:58,043 INFO L533 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-28 22:42:58,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-01-28 22:42:58,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 199. [2018-01-28 22:42:58,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-01-28 22:42:58,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 208 transitions. [2018-01-28 22:42:58,053 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 208 transitions. Word has length 39 [2018-01-28 22:42:58,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:42:58,053 INFO L432 AbstractCegarLoop]: Abstraction has 199 states and 208 transitions. [2018-01-28 22:42:58,053 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-28 22:42:58,053 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 208 transitions. [2018-01-28 22:42:58,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-01-28 22:42:58,054 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:42:58,054 INFO L330 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, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:42:58,054 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-28 22:42:58,054 INFO L82 PathProgramCache]: Analyzing trace with hash -748848629, now seen corresponding path program 1 times [2018-01-28 22:42:58,054 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:42:58,055 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:42:58,055 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:42:58,055 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:42:58,056 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:42:58,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:42:58,072 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:42:58,120 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-28 22:42:58,120 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:42:58,120 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP 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-28 22:42:58,133 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:42:58,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:42:58,181 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:42:58,213 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-28 22:42:58,235 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:42:58,235 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-01-28 22:42:58,235 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-28 22:42:58,236 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-28 22:42:58,236 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-01-28 22:42:58,236 INFO L87 Difference]: Start difference. First operand 199 states and 208 transitions. Second operand 6 states. [2018-01-28 22:42:58,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:42:58,302 INFO L93 Difference]: Finished difference Result 351 states and 367 transitions. [2018-01-28 22:42:58,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-28 22:42:58,303 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 43 [2018-01-28 22:42:58,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:42:58,305 INFO L225 Difference]: With dead ends: 351 [2018-01-28 22:42:58,305 INFO L226 Difference]: Without dead ends: 206 [2018-01-28 22:42:58,307 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-01-28 22:42:58,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-01-28 22:42:58,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 203. [2018-01-28 22:42:58,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-01-28 22:42:58,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 212 transitions. [2018-01-28 22:42:58,322 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 212 transitions. Word has length 43 [2018-01-28 22:42:58,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:42:58,322 INFO L432 AbstractCegarLoop]: Abstraction has 203 states and 212 transitions. [2018-01-28 22:42:58,322 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-28 22:42:58,323 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 212 transitions. [2018-01-28 22:42:58,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-01-28 22:42:58,324 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:42:58,325 INFO L330 BasicCegarLoop]: trace histogram [2, 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] [2018-01-28 22:42:58,325 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-28 22:42:58,325 INFO L82 PathProgramCache]: Analyzing trace with hash 931815433, now seen corresponding path program 2 times [2018-01-28 22:42:58,325 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:42:58,325 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:42:58,327 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:42:58,327 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:42:58,327 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:42:58,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:42:58,347 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:42:58,430 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-28 22:42:58,430 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:42:58,431 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-28 22:42:58,442 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-28 22:42:58,472 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-28 22:42:58,476 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-28 22:42:58,481 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:42:58,525 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-28 22:42:58,527 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:42:58,550 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-28 22:42:58,550 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:42:58,570 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-28 22:42:58,570 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:36 [2018-01-28 22:42:59,402 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-28 22:42:59,439 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-28 22:42:59,440 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [6] total 19 [2018-01-28 22:42:59,440 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-28 22:42:59,441 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-28 22:42:59,441 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2018-01-28 22:42:59,442 INFO L87 Difference]: Start difference. First operand 203 states and 212 transitions. Second operand 19 states. [2018-01-28 22:43:02,044 WARN L143 SmtUtils]: Spent 2040ms on a formula simplification that was a NOOP. DAG size: 32 [2018-01-28 22:43:05,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:43:05,077 INFO L93 Difference]: Finished difference Result 445 states and 466 transitions. [2018-01-28 22:43:05,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-01-28 22:43:05,077 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 47 [2018-01-28 22:43:05,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:43:05,079 INFO L225 Difference]: With dead ends: 445 [2018-01-28 22:43:05,079 INFO L226 Difference]: Without dead ends: 300 [2018-01-28 22:43:05,080 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=104, Invalid=652, Unknown=0, NotChecked=0, Total=756 [2018-01-28 22:43:05,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2018-01-28 22:43:05,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 206. [2018-01-28 22:43:05,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-01-28 22:43:05,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 215 transitions. [2018-01-28 22:43:05,094 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 215 transitions. Word has length 47 [2018-01-28 22:43:05,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:43:05,094 INFO L432 AbstractCegarLoop]: Abstraction has 206 states and 215 transitions. [2018-01-28 22:43:05,094 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-01-28 22:43:05,094 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 215 transitions. [2018-01-28 22:43:05,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-01-28 22:43:05,096 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:43:05,096 INFO L330 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:43:05,096 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-28 22:43:05,096 INFO L82 PathProgramCache]: Analyzing trace with hash -1281962573, now seen corresponding path program 1 times [2018-01-28 22:43:05,096 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:43:05,096 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:43:05,098 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:43:05,098 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-28 22:43:05,098 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:43:05,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:43:05,109 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:43:05,215 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-28 22:43:05,216 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:43:05,216 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-28 22:43:05,216 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-28 22:43:05,216 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-28 22:43:05,216 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-01-28 22:43:05,217 INFO L87 Difference]: Start difference. First operand 206 states and 215 transitions. Second operand 9 states. [2018-01-28 22:43:05,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:43:05,323 INFO L93 Difference]: Finished difference Result 295 states and 311 transitions. [2018-01-28 22:43:05,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-28 22:43:05,324 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2018-01-28 22:43:05,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:43:05,326 INFO L225 Difference]: With dead ends: 295 [2018-01-28 22:43:05,326 INFO L226 Difference]: Without dead ends: 220 [2018-01-28 22:43:05,326 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-01-28 22:43:05,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-01-28 22:43:05,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 216. [2018-01-28 22:43:05,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-01-28 22:43:05,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 226 transitions. [2018-01-28 22:43:05,347 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 226 transitions. Word has length 54 [2018-01-28 22:43:05,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:43:05,348 INFO L432 AbstractCegarLoop]: Abstraction has 216 states and 226 transitions. [2018-01-28 22:43:05,348 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-28 22:43:05,348 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 226 transitions. [2018-01-28 22:43:05,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-01-28 22:43:05,349 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:43:05,349 INFO L330 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:43:05,350 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-28 22:43:05,350 INFO L82 PathProgramCache]: Analyzing trace with hash 647693160, now seen corresponding path program 1 times [2018-01-28 22:43:05,350 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:43:05,350 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:43:05,351 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:43:05,351 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:43:05,351 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:43:05,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:43:05,362 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:43:05,410 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-28 22:43:05,410 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:43:05,410 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-28 22:43:05,411 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-28 22:43:05,411 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-28 22:43:05,411 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-28 22:43:05,411 INFO L87 Difference]: Start difference. First operand 216 states and 226 transitions. Second operand 3 states. [2018-01-28 22:43:05,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:43:05,549 INFO L93 Difference]: Finished difference Result 241 states and 254 transitions. [2018-01-28 22:43:05,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-28 22:43:05,549 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2018-01-28 22:43:05,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:43:05,551 INFO L225 Difference]: With dead ends: 241 [2018-01-28 22:43:05,551 INFO L226 Difference]: Without dead ends: 222 [2018-01-28 22:43:05,551 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 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-28 22:43:05,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2018-01-28 22:43:05,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 209. [2018-01-28 22:43:05,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-01-28 22:43:05,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 218 transitions. [2018-01-28 22:43:05,566 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 218 transitions. Word has length 54 [2018-01-28 22:43:05,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:43:05,567 INFO L432 AbstractCegarLoop]: Abstraction has 209 states and 218 transitions. [2018-01-28 22:43:05,567 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-28 22:43:05,567 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 218 transitions. [2018-01-28 22:43:05,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-01-28 22:43:05,567 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:43:05,568 INFO L330 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:43:05,568 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-28 22:43:05,568 INFO L82 PathProgramCache]: Analyzing trace with hash 407930235, now seen corresponding path program 1 times [2018-01-28 22:43:05,568 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:43:05,568 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:43:05,569 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:43:05,569 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:43:05,569 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:43:05,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:43:05,580 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:43:05,672 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-28 22:43:05,672 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:43:05,672 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-28 22:43:05,673 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-28 22:43:05,673 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-28 22:43:05,673 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-28 22:43:05,673 INFO L87 Difference]: Start difference. First operand 209 states and 218 transitions. Second operand 6 states. [2018-01-28 22:43:05,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:43:05,722 INFO L93 Difference]: Finished difference Result 213 states and 221 transitions. [2018-01-28 22:43:05,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-28 22:43:05,723 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2018-01-28 22:43:05,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:43:05,724 INFO L225 Difference]: With dead ends: 213 [2018-01-28 22:43:05,724 INFO L226 Difference]: Without dead ends: 183 [2018-01-28 22:43:05,725 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-28 22:43:05,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-01-28 22:43:05,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2018-01-28 22:43:05,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-01-28 22:43:05,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 190 transitions. [2018-01-28 22:43:05,741 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 190 transitions. Word has length 55 [2018-01-28 22:43:05,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:43:05,742 INFO L432 AbstractCegarLoop]: Abstraction has 183 states and 190 transitions. [2018-01-28 22:43:05,742 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-28 22:43:05,742 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 190 transitions. [2018-01-28 22:43:05,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-01-28 22:43:05,743 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:43:05,743 INFO L330 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2018-01-28 22:43:05,743 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-28 22:43:05,743 INFO L82 PathProgramCache]: Analyzing trace with hash 1897274958, now seen corresponding path program 1 times [2018-01-28 22:43:05,743 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:43:05,743 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:43:05,745 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:43:05,745 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:43:05,745 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:43:05,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:43:05,760 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:43:05,862 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-28 22:43:05,862 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:43:05,862 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-01-28 22:43:05,862 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-28 22:43:05,863 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-28 22:43:05,863 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-01-28 22:43:05,863 INFO L87 Difference]: Start difference. First operand 183 states and 190 transitions. Second operand 12 states. [2018-01-28 22:43:06,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:43:06,164 INFO L93 Difference]: Finished difference Result 183 states and 190 transitions. [2018-01-28 22:43:06,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-28 22:43:06,164 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2018-01-28 22:43:06,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:43:06,166 INFO L225 Difference]: With dead ends: 183 [2018-01-28 22:43:06,166 INFO L226 Difference]: Without dead ends: 181 [2018-01-28 22:43:06,166 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2018-01-28 22:43:06,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-01-28 22:43:06,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2018-01-28 22:43:06,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-01-28 22:43:06,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 188 transitions. [2018-01-28 22:43:06,176 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 188 transitions. Word has length 56 [2018-01-28 22:43:06,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:43:06,176 INFO L432 AbstractCegarLoop]: Abstraction has 181 states and 188 transitions. [2018-01-28 22:43:06,176 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-28 22:43:06,177 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 188 transitions. [2018-01-28 22:43:06,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-01-28 22:43:06,177 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:43:06,177 INFO L330 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2018-01-28 22:43:06,178 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-28 22:43:06,178 INFO L82 PathProgramCache]: Analyzing trace with hash 1897274959, now seen corresponding path program 1 times [2018-01-28 22:43:06,178 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:43:06,178 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:43:06,179 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:43:06,179 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:43:06,179 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:43:06,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:43:06,194 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:43:06,273 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-28 22:43:06,274 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:43:06,274 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP 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-28 22:43:06,281 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:43:06,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:43:06,310 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:43:06,324 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-28 22:43:06,350 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:43:06,351 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-01-28 22:43:06,351 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-28 22:43:06,351 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-28 22:43:06,351 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-01-28 22:43:06,351 INFO L87 Difference]: Start difference. First operand 181 states and 188 transitions. Second operand 8 states. [2018-01-28 22:43:06,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:43:06,430 INFO L93 Difference]: Finished difference Result 330 states and 344 transitions. [2018-01-28 22:43:06,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-28 22:43:06,431 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 56 [2018-01-28 22:43:06,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:43:06,433 INFO L225 Difference]: With dead ends: 330 [2018-01-28 22:43:06,433 INFO L226 Difference]: Without dead ends: 188 [2018-01-28 22:43:06,433 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-01-28 22:43:06,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-01-28 22:43:06,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 185. [2018-01-28 22:43:06,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-01-28 22:43:06,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 192 transitions. [2018-01-28 22:43:06,450 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 192 transitions. Word has length 56 [2018-01-28 22:43:06,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:43:06,450 INFO L432 AbstractCegarLoop]: Abstraction has 185 states and 192 transitions. [2018-01-28 22:43:06,451 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-28 22:43:06,451 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 192 transitions. [2018-01-28 22:43:06,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-01-28 22:43:06,452 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:43:06,452 INFO L330 BasicCegarLoop]: trace histogram [4, 4, 4, 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] [2018-01-28 22:43:06,452 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-28 22:43:06,452 INFO L82 PathProgramCache]: Analyzing trace with hash -1277991663, now seen corresponding path program 2 times [2018-01-28 22:43:06,452 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:43:06,452 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:43:06,453 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:43:06,454 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:43:06,454 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:43:06,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:43:06,472 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:43:06,542 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:43:06,542 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:43:06,542 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP 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-28 22:43:06,553 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-28 22:43:06,581 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-28 22:43:06,585 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-28 22:43:06,590 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:43:06,607 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-28 22:43:06,608 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:43:06,628 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-28 22:43:06,629 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:43:06,646 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-28 22:43:06,646 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:36 [2018-01-28 22:43:07,230 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-01-28 22:43:07,250 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-28 22:43:07,266 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [8] total 22 [2018-01-28 22:43:07,267 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-01-28 22:43:07,267 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-01-28 22:43:07,267 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=390, Unknown=0, NotChecked=0, Total=462 [2018-01-28 22:43:07,267 INFO L87 Difference]: Start difference. First operand 185 states and 192 transitions. Second operand 22 states. [2018-01-28 22:43:09,502 WARN L143 SmtUtils]: Spent 2022ms on a formula simplification that was a NOOP. DAG size: 31 [2018-01-28 22:43:10,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:43:10,547 INFO L93 Difference]: Finished difference Result 332 states and 348 transitions. [2018-01-28 22:43:10,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-01-28 22:43:10,547 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 60 [2018-01-28 22:43:10,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:43:10,548 INFO L225 Difference]: With dead ends: 332 [2018-01-28 22:43:10,548 INFO L226 Difference]: Without dead ends: 190 [2018-01-28 22:43:10,549 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=152, Invalid=904, Unknown=0, NotChecked=0, Total=1056 [2018-01-28 22:43:10,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-01-28 22:43:10,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 187. [2018-01-28 22:43:10,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-01-28 22:43:10,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 194 transitions. [2018-01-28 22:43:10,570 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 194 transitions. Word has length 60 [2018-01-28 22:43:10,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:43:10,571 INFO L432 AbstractCegarLoop]: Abstraction has 187 states and 194 transitions. [2018-01-28 22:43:10,571 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-01-28 22:43:10,571 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 194 transitions. [2018-01-28 22:43:10,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-01-28 22:43:10,572 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:43:10,572 INFO L330 BasicCegarLoop]: trace histogram [5, 5, 5, 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] [2018-01-28 22:43:10,572 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-28 22:43:10,572 INFO L82 PathProgramCache]: Analyzing trace with hash 31187167, now seen corresponding path program 1 times [2018-01-28 22:43:10,572 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:43:10,572 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:43:10,573 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:43:10,574 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-28 22:43:10,574 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:43:10,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:43:10,589 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:43:10,746 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-01-28 22:43:10,746 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:43:10,746 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-28 22:43:10,746 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-28 22:43:10,747 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-28 22:43:10,747 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-28 22:43:10,747 INFO L87 Difference]: Start difference. First operand 187 states and 194 transitions. Second operand 8 states. [2018-01-28 22:43:11,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:43:11,028 INFO L93 Difference]: Finished difference Result 305 states and 316 transitions. [2018-01-28 22:43:11,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-28 22:43:11,028 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 72 [2018-01-28 22:43:11,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:43:11,029 INFO L225 Difference]: With dead ends: 305 [2018-01-28 22:43:11,029 INFO L226 Difference]: Without dead ends: 187 [2018-01-28 22:43:11,029 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-01-28 22:43:11,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-01-28 22:43:11,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2018-01-28 22:43:11,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-01-28 22:43:11,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 193 transitions. [2018-01-28 22:43:11,042 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 193 transitions. Word has length 72 [2018-01-28 22:43:11,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:43:11,043 INFO L432 AbstractCegarLoop]: Abstraction has 187 states and 193 transitions. [2018-01-28 22:43:11,043 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-28 22:43:11,043 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 193 transitions. [2018-01-28 22:43:11,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-01-28 22:43:11,043 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:43:11,043 INFO L330 BasicCegarLoop]: trace histogram [5, 5, 5, 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] [2018-01-28 22:43:11,043 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-28 22:43:11,044 INFO L82 PathProgramCache]: Analyzing trace with hash -605147406, now seen corresponding path program 1 times [2018-01-28 22:43:11,044 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:43:11,044 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:43:11,044 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:43:11,044 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:43:11,045 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:43:11,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:43:11,055 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:43:11,321 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-01-28 22:43:11,321 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:43:11,321 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-28 22:43:11,322 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-28 22:43:11,322 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-28 22:43:11,322 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-01-28 22:43:11,322 INFO L87 Difference]: Start difference. First operand 187 states and 193 transitions. Second operand 10 states. [2018-01-28 22:43:11,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:43:11,745 INFO L93 Difference]: Finished difference Result 307 states and 317 transitions. [2018-01-28 22:43:11,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-28 22:43:11,745 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 77 [2018-01-28 22:43:11,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:43:11,746 INFO L225 Difference]: With dead ends: 307 [2018-01-28 22:43:11,746 INFO L226 Difference]: Without dead ends: 187 [2018-01-28 22:43:11,746 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2018-01-28 22:43:11,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-01-28 22:43:11,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2018-01-28 22:43:11,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-01-28 22:43:11,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 192 transitions. [2018-01-28 22:43:11,759 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 192 transitions. Word has length 77 [2018-01-28 22:43:11,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:43:11,759 INFO L432 AbstractCegarLoop]: Abstraction has 187 states and 192 transitions. [2018-01-28 22:43:11,759 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-28 22:43:11,759 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 192 transitions. [2018-01-28 22:43:11,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-01-28 22:43:11,760 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:43:11,760 INFO L330 BasicCegarLoop]: trace histogram [5, 5, 5, 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] [2018-01-28 22:43:11,760 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-28 22:43:11,760 INFO L82 PathProgramCache]: Analyzing trace with hash 506176770, now seen corresponding path program 1 times [2018-01-28 22:43:11,760 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:43:11,761 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:43:11,761 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:43:11,761 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:43:11,761 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:43:11,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:43:11,776 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:43:11,991 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-01-28 22:43:11,992 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:43:11,992 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-01-28 22:43:11,992 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-28 22:43:11,992 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-28 22:43:11,992 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2018-01-28 22:43:11,993 INFO L87 Difference]: Start difference. First operand 187 states and 192 transitions. Second operand 17 states. [2018-01-28 22:43:12,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:43:12,522 INFO L93 Difference]: Finished difference Result 187 states and 192 transitions. [2018-01-28 22:43:12,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-01-28 22:43:12,542 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 88 [2018-01-28 22:43:12,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:43:12,543 INFO L225 Difference]: With dead ends: 187 [2018-01-28 22:43:12,543 INFO L226 Difference]: Without dead ends: 185 [2018-01-28 22:43:12,544 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=537, Unknown=0, NotChecked=0, Total=600 [2018-01-28 22:43:12,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-01-28 22:43:12,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2018-01-28 22:43:12,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-01-28 22:43:12,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 190 transitions. [2018-01-28 22:43:12,562 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 190 transitions. Word has length 88 [2018-01-28 22:43:12,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:43:12,562 INFO L432 AbstractCegarLoop]: Abstraction has 185 states and 190 transitions. [2018-01-28 22:43:12,562 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-28 22:43:12,562 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 190 transitions. [2018-01-28 22:43:12,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-01-28 22:43:12,563 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:43:12,564 INFO L330 BasicCegarLoop]: trace histogram [5, 5, 5, 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] [2018-01-28 22:43:12,564 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-28 22:43:12,564 INFO L82 PathProgramCache]: Analyzing trace with hash 506176771, now seen corresponding path program 1 times [2018-01-28 22:43:12,564 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:43:12,564 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:43:12,565 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:43:12,565 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:43:12,565 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:43:12,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:43:12,586 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:43:12,686 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:43:12,686 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:43:12,686 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-28 22:43:12,695 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:43:12,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:43:12,750 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:43:12,774 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:43:12,806 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:43:12,806 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-01-28 22:43:12,807 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-28 22:43:12,807 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-28 22:43:12,807 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2018-01-28 22:43:12,807 INFO L87 Difference]: Start difference. First operand 185 states and 190 transitions. Second operand 10 states. [2018-01-28 22:43:12,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:43:12,868 INFO L93 Difference]: Finished difference Result 330 states and 340 transitions. [2018-01-28 22:43:12,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-28 22:43:12,868 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 88 [2018-01-28 22:43:12,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:43:12,869 INFO L225 Difference]: With dead ends: 330 [2018-01-28 22:43:12,869 INFO L226 Difference]: Without dead ends: 192 [2018-01-28 22:43:12,870 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2018-01-28 22:43:12,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-01-28 22:43:12,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 189. [2018-01-28 22:43:12,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-01-28 22:43:12,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 194 transitions. [2018-01-28 22:43:12,882 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 194 transitions. Word has length 88 [2018-01-28 22:43:12,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:43:12,883 INFO L432 AbstractCegarLoop]: Abstraction has 189 states and 194 transitions. [2018-01-28 22:43:12,883 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-28 22:43:12,883 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 194 transitions. [2018-01-28 22:43:12,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-01-28 22:43:12,884 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:43:12,884 INFO L330 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:43:12,884 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-28 22:43:12,884 INFO L82 PathProgramCache]: Analyzing trace with hash -2016582715, now seen corresponding path program 2 times [2018-01-28 22:43:12,884 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:43:12,884 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:43:12,885 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:43:12,885 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:43:12,886 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:43:12,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:43:12,901 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:43:13,134 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:43:13,134 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:43:13,135 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP 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-28 22:43:13,140 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-28 22:43:13,169 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-28 22:43:13,175 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-28 22:43:13,181 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:43:13,189 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-28 22:43:13,190 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:43:13,214 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-28 22:43:13,215 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:43:13,228 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-28 22:43:13,228 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:36 [2018-01-28 22:43:14,129 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-01-28 22:43:14,160 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-28 22:43:14,160 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [10] total 29 [2018-01-28 22:43:14,161 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-01-28 22:43:14,161 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-01-28 22:43:14,161 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=705, Unknown=0, NotChecked=0, Total=812 [2018-01-28 22:43:14,162 INFO L87 Difference]: Start difference. First operand 189 states and 194 transitions. Second operand 29 states. [2018-01-28 22:43:15,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:43:15,800 INFO L93 Difference]: Finished difference Result 332 states and 344 transitions. [2018-01-28 22:43:15,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-01-28 22:43:15,800 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 92 [2018-01-28 22:43:15,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:43:15,801 INFO L225 Difference]: With dead ends: 332 [2018-01-28 22:43:15,801 INFO L226 Difference]: Without dead ends: 194 [2018-01-28 22:43:15,802 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 410 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=238, Invalid=1742, Unknown=0, NotChecked=0, Total=1980 [2018-01-28 22:43:15,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-01-28 22:43:15,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 191. [2018-01-28 22:43:15,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-01-28 22:43:15,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 196 transitions. [2018-01-28 22:43:15,820 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 196 transitions. Word has length 92 [2018-01-28 22:43:15,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:43:15,820 INFO L432 AbstractCegarLoop]: Abstraction has 191 states and 196 transitions. [2018-01-28 22:43:15,821 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-01-28 22:43:15,821 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 196 transitions. [2018-01-28 22:43:15,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-01-28 22:43:15,822 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:43:15,822 INFO L330 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:43:15,822 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-28 22:43:15,822 INFO L82 PathProgramCache]: Analyzing trace with hash -559271400, now seen corresponding path program 1 times [2018-01-28 22:43:15,822 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:43:15,823 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:43:15,823 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:43:15,823 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-28 22:43:15,823 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:43:15,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:43:15,843 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:43:16,028 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2018-01-28 22:43:16,028 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:43:16,029 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-01-28 22:43:16,029 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-28 22:43:16,029 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-28 22:43:16,029 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-01-28 22:43:16,029 INFO L87 Difference]: Start difference. First operand 191 states and 196 transitions. Second operand 13 states. [2018-01-28 22:43:16,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:43:16,117 INFO L93 Difference]: Finished difference Result 275 states and 283 transitions. [2018-01-28 22:43:16,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-28 22:43:16,117 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 112 [2018-01-28 22:43:16,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:43:16,118 INFO L225 Difference]: With dead ends: 275 [2018-01-28 22:43:16,118 INFO L226 Difference]: Without dead ends: 191 [2018-01-28 22:43:16,119 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2018-01-28 22:43:16,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-01-28 22:43:16,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2018-01-28 22:43:16,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-01-28 22:43:16,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 195 transitions. [2018-01-28 22:43:16,141 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 195 transitions. Word has length 112 [2018-01-28 22:43:16,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:43:16,141 INFO L432 AbstractCegarLoop]: Abstraction has 191 states and 195 transitions. [2018-01-28 22:43:16,141 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-28 22:43:16,141 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 195 transitions. [2018-01-28 22:43:16,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-01-28 22:43:16,142 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:43:16,142 INFO L330 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:43:16,142 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-28 22:43:16,142 INFO L82 PathProgramCache]: Analyzing trace with hash -1320811839, now seen corresponding path program 1 times [2018-01-28 22:43:16,142 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:43:16,143 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:43:16,144 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:43:16,144 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:43:16,144 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:43:16,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:43:16,172 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:43:16,300 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:43:16,301 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:43:16,301 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP 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-28 22:43:16,309 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:43:16,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:43:16,377 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:43:16,398 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:43:16,418 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:43:16,419 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-01-28 22:43:16,419 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-28 22:43:16,419 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-28 22:43:16,419 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2018-01-28 22:43:16,419 INFO L87 Difference]: Start difference. First operand 191 states and 195 transitions. Second operand 12 states. [2018-01-28 22:43:16,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:43:16,469 INFO L93 Difference]: Finished difference Result 334 states and 342 transitions. [2018-01-28 22:43:16,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-28 22:43:16,470 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 130 [2018-01-28 22:43:16,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:43:16,471 INFO L225 Difference]: With dead ends: 334 [2018-01-28 22:43:16,471 INFO L226 Difference]: Without dead ends: 198 [2018-01-28 22:43:16,472 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2018-01-28 22:43:16,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-01-28 22:43:16,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 195. [2018-01-28 22:43:16,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-01-28 22:43:16,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 199 transitions. [2018-01-28 22:43:16,495 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 199 transitions. Word has length 130 [2018-01-28 22:43:16,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:43:16,496 INFO L432 AbstractCegarLoop]: Abstraction has 195 states and 199 transitions. [2018-01-28 22:43:16,496 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-28 22:43:16,496 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 199 transitions. [2018-01-28 22:43:16,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-01-28 22:43:16,498 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:43:16,498 INFO L330 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:43:16,498 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-28 22:43:16,498 INFO L82 PathProgramCache]: Analyzing trace with hash -848285949, now seen corresponding path program 2 times [2018-01-28 22:43:16,498 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:43:16,499 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:43:16,500 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:43:16,500 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:43:16,500 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:43:16,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:43:16,528 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:43:16,677 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:43:16,677 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:43:16,677 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-28 22:43:16,683 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-28 22:43:16,729 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-28 22:43:16,734 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-28 22:43:16,740 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:43:16,744 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-01-28 22:43:16,745 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:43:16,756 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-28 22:43:16,756 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:43:16,768 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-28 22:43:16,768 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:36 [2018-01-28 22:43:17,746 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-01-28 22:43:17,766 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-28 22:43:17,766 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [12] total 33 [2018-01-28 22:43:17,767 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-01-28 22:43:17,767 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-01-28 22:43:17,767 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=922, Unknown=0, NotChecked=0, Total=1056 [2018-01-28 22:43:17,767 INFO L87 Difference]: Start difference. First operand 195 states and 199 transitions. Second operand 33 states. [2018-01-28 22:43:19,915 WARN L143 SmtUtils]: Spent 2029ms on a formula simplification that was a NOOP. DAG size: 39 [2018-01-28 22:43:22,393 WARN L143 SmtUtils]: Spent 2021ms on a formula simplification that was a NOOP. DAG size: 36 [2018-01-28 22:43:23,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:43:23,603 INFO L93 Difference]: Finished difference Result 336 states and 346 transitions. [2018-01-28 22:43:23,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-01-28 22:43:23,603 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 134 [2018-01-28 22:43:23,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:43:23,604 INFO L225 Difference]: With dead ends: 336 [2018-01-28 22:43:23,605 INFO L226 Difference]: Without dead ends: 200 [2018-01-28 22:43:23,606 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 111 SyntacticMatches, 3 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 598 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=311, Invalid=2341, Unknown=0, NotChecked=0, Total=2652 [2018-01-28 22:43:23,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2018-01-28 22:43:23,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 197. [2018-01-28 22:43:23,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-01-28 22:43:23,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 201 transitions. [2018-01-28 22:43:23,628 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 201 transitions. Word has length 134 [2018-01-28 22:43:23,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:43:23,629 INFO L432 AbstractCegarLoop]: Abstraction has 197 states and 201 transitions. [2018-01-28 22:43:23,629 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-01-28 22:43:23,629 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 201 transitions. [2018-01-28 22:43:23,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-01-28 22:43:23,631 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:43:23,631 INFO L330 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:43:23,631 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-28 22:43:23,631 INFO L82 PathProgramCache]: Analyzing trace with hash 877029956, now seen corresponding path program 1 times [2018-01-28 22:43:23,632 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:43:23,632 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:43:23,633 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:43:23,633 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-28 22:43:23,633 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:43:23,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:43:23,677 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:43:24,057 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2018-01-28 22:43:24,057 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:43:24,057 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2018-01-28 22:43:24,057 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-01-28 22:43:24,057 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-01-28 22:43:24,058 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=419, Unknown=0, NotChecked=0, Total=462 [2018-01-28 22:43:24,058 INFO L87 Difference]: Start difference. First operand 197 states and 201 transitions. Second operand 22 states. [2018-01-28 22:43:24,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:43:24,489 INFO L93 Difference]: Finished difference Result 236 states and 246 transitions. [2018-01-28 22:43:24,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-01-28 22:43:24,489 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 138 [2018-01-28 22:43:24,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:43:24,490 INFO L225 Difference]: With dead ends: 236 [2018-01-28 22:43:24,491 INFO L226 Difference]: Without dead ends: 234 [2018-01-28 22:43:24,491 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=75, Invalid=795, Unknown=0, NotChecked=0, Total=870 [2018-01-28 22:43:24,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-01-28 22:43:24,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 230. [2018-01-28 22:43:24,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2018-01-28 22:43:24,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 238 transitions. [2018-01-28 22:43:24,521 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 238 transitions. Word has length 138 [2018-01-28 22:43:24,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:43:24,522 INFO L432 AbstractCegarLoop]: Abstraction has 230 states and 238 transitions. [2018-01-28 22:43:24,522 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-01-28 22:43:24,522 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 238 transitions. [2018-01-28 22:43:24,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-01-28 22:43:24,523 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:43:24,523 INFO L330 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:43:24,523 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-28 22:43:24,524 INFO L82 PathProgramCache]: Analyzing trace with hash -1488281606, now seen corresponding path program 1 times [2018-01-28 22:43:24,524 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:43:24,524 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:43:24,525 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:43:24,525 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:43:24,525 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:43:24,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:43:24,545 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:43:24,723 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2018-01-28 22:43:24,723 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:43:24,723 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP 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-28 22:43:24,728 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:43:24,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:43:24,776 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:43:24,911 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-28 22:43:24,931 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:43:24,932 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2018-01-28 22:43:24,932 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-01-28 22:43:24,932 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-01-28 22:43:24,932 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=462, Unknown=0, NotChecked=0, Total=552 [2018-01-28 22:43:24,933 INFO L87 Difference]: Start difference. First operand 230 states and 238 transitions. Second operand 24 states. [2018-01-28 22:43:25,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:43:25,171 INFO L93 Difference]: Finished difference Result 408 states and 424 transitions. [2018-01-28 22:43:25,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-01-28 22:43:25,171 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 138 [2018-01-28 22:43:25,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:43:25,172 INFO L225 Difference]: With dead ends: 408 [2018-01-28 22:43:25,172 INFO L226 Difference]: Without dead ends: 235 [2018-01-28 22:43:25,173 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=118, Invalid=812, Unknown=0, NotChecked=0, Total=930 [2018-01-28 22:43:25,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2018-01-28 22:43:25,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 232. [2018-01-28 22:43:25,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-01-28 22:43:25,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 238 transitions. [2018-01-28 22:43:25,194 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 238 transitions. Word has length 138 [2018-01-28 22:43:25,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:43:25,194 INFO L432 AbstractCegarLoop]: Abstraction has 232 states and 238 transitions. [2018-01-28 22:43:25,194 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-01-28 22:43:25,194 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 238 transitions. [2018-01-28 22:43:25,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-01-28 22:43:25,195 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:43:25,195 INFO L330 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 22:43:25,195 INFO L371 AbstractCegarLoop]: === Iteration 25 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-28 22:43:25,195 INFO L82 PathProgramCache]: Analyzing trace with hash 650404191, now seen corresponding path program 1 times [2018-01-28 22:43:25,195 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:43:25,195 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:43:25,196 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:43:25,196 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:43:25,197 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:43:25,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:43:25,216 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:43:25,756 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2018-01-28 22:43:25,757 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:43:25,757 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2018-01-28 22:43:25,757 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-01-28 22:43:25,757 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-01-28 22:43:25,758 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2018-01-28 22:43:25,758 INFO L87 Difference]: Start difference. First operand 232 states and 238 transitions. Second operand 27 states. [2018-01-28 22:43:26,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:43:26,502 INFO L93 Difference]: Finished difference Result 248 states and 258 transitions. [2018-01-28 22:43:26,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-01-28 22:43:26,503 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 161 [2018-01-28 22:43:26,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:43:26,504 INFO L225 Difference]: With dead ends: 248 [2018-01-28 22:43:26,504 INFO L226 Difference]: Without dead ends: 246 [2018-01-28 22:43:26,504 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=109, Invalid=1451, Unknown=0, NotChecked=0, Total=1560 [2018-01-28 22:43:26,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2018-01-28 22:43:26,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 241. [2018-01-28 22:43:26,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-01-28 22:43:26,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 251 transitions. [2018-01-28 22:43:26,528 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 251 transitions. Word has length 161 [2018-01-28 22:43:26,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:43:26,529 INFO L432 AbstractCegarLoop]: Abstraction has 241 states and 251 transitions. [2018-01-28 22:43:26,529 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-01-28 22:43:26,529 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 251 transitions. [2018-01-28 22:43:26,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-01-28 22:43:26,530 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:43:26,530 INFO L330 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 22:43:26,530 INFO L371 AbstractCegarLoop]: === Iteration 26 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-28 22:43:26,530 INFO L82 PathProgramCache]: Analyzing trace with hash 650404192, now seen corresponding path program 1 times [2018-01-28 22:43:26,530 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:43:26,530 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:43:26,531 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:43:26,531 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:43:26,531 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:43:26,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:43:26,549 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:43:26,827 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:43:26,827 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:43:26,827 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP 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-28 22:43:26,833 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:43:26,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:43:26,902 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:43:26,950 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:43:26,973 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:43:26,973 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2018-01-28 22:43:26,974 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-28 22:43:26,974 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-28 22:43:26,974 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=117, Unknown=0, NotChecked=0, Total=210 [2018-01-28 22:43:26,974 INFO L87 Difference]: Start difference. First operand 241 states and 251 transitions. Second operand 15 states. [2018-01-28 22:43:27,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:43:27,065 INFO L93 Difference]: Finished difference Result 422 states and 442 transitions. [2018-01-28 22:43:27,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-28 22:43:27,066 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 161 [2018-01-28 22:43:27,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:43:27,068 INFO L225 Difference]: With dead ends: 422 [2018-01-28 22:43:27,068 INFO L226 Difference]: Without dead ends: 248 [2018-01-28 22:43:27,069 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=97, Invalid=143, Unknown=0, NotChecked=0, Total=240 [2018-01-28 22:43:27,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2018-01-28 22:43:27,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 245. [2018-01-28 22:43:27,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-01-28 22:43:27,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 255 transitions. [2018-01-28 22:43:27,103 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 255 transitions. Word has length 161 [2018-01-28 22:43:27,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:43:27,104 INFO L432 AbstractCegarLoop]: Abstraction has 245 states and 255 transitions. [2018-01-28 22:43:27,104 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-28 22:43:27,104 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 255 transitions. [2018-01-28 22:43:27,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-01-28 22:43:27,105 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:43:27,105 INFO L330 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 22:43:27,105 INFO L371 AbstractCegarLoop]: === Iteration 27 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-28 22:43:27,105 INFO L82 PathProgramCache]: Analyzing trace with hash 1824861406, now seen corresponding path program 2 times [2018-01-28 22:43:27,106 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:43:27,106 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:43:27,106 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:43:27,107 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:43:27,107 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:43:27,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:43:27,134 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:43:27,325 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:43:27,325 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:43:27,326 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-28 22:43:27,331 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-28 22:43:27,380 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-28 22:43:27,387 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-28 22:43:27,395 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:43:27,399 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-01-28 22:43:27,400 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:43:27,421 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-28 22:43:27,421 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:43:27,432 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-28 22:43:27,432 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:36 [2018-01-28 22:43:29,079 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2018-01-28 22:43:29,110 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-28 22:43:29,110 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [28] imperfect sequences [15] total 42 [2018-01-28 22:43:29,111 INFO L409 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-01-28 22:43:29,111 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-01-28 22:43:29,111 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=1528, Unknown=0, NotChecked=0, Total=1722 [2018-01-28 22:43:29,112 INFO L87 Difference]: Start difference. First operand 245 states and 255 transitions. Second operand 42 states. [2018-01-28 22:43:31,382 WARN L143 SmtUtils]: Spent 2028ms on a formula simplification that was a NOOP. DAG size: 34 [2018-01-28 22:43:33,735 WARN L143 SmtUtils]: Spent 2027ms on a formula simplification that was a NOOP. DAG size: 35 [2018-01-28 22:43:35,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:43:35,915 INFO L93 Difference]: Finished difference Result 424 states and 446 transitions. [2018-01-28 22:43:35,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-01-28 22:43:35,915 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 165 [2018-01-28 22:43:35,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:43:35,916 INFO L225 Difference]: With dead ends: 424 [2018-01-28 22:43:35,916 INFO L226 Difference]: Without dead ends: 250 [2018-01-28 22:43:35,918 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 134 SyntacticMatches, 5 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1082 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=476, Invalid=4080, Unknown=0, NotChecked=0, Total=4556 [2018-01-28 22:43:35,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-01-28 22:43:35,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 247. [2018-01-28 22:43:35,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2018-01-28 22:43:35,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 256 transitions. [2018-01-28 22:43:35,958 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 256 transitions. Word has length 165 [2018-01-28 22:43:35,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:43:35,958 INFO L432 AbstractCegarLoop]: Abstraction has 247 states and 256 transitions. [2018-01-28 22:43:35,958 INFO L433 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-01-28 22:43:35,958 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 256 transitions. [2018-01-28 22:43:35,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-01-28 22:43:35,960 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:43:35,960 INFO L330 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 22:43:35,960 INFO L371 AbstractCegarLoop]: === Iteration 28 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-28 22:43:35,960 INFO L82 PathProgramCache]: Analyzing trace with hash 1297898285, now seen corresponding path program 1 times [2018-01-28 22:43:35,960 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:43:35,960 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:43:35,961 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:43:35,961 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-28 22:43:35,962 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:43:35,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:43:35,989 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:43:36,356 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:43:36,357 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:43:36,357 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP 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-28 22:43:36,368 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:43:36,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:43:36,461 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:43:36,495 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:43:36,529 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:43:36,529 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-01-28 22:43:36,529 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-28 22:43:36,530 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-28 22:43:36,530 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=150, Unknown=0, NotChecked=0, Total=272 [2018-01-28 22:43:36,530 INFO L87 Difference]: Start difference. First operand 247 states and 256 transitions. Second operand 17 states. [2018-01-28 22:43:36,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:43:36,651 INFO L93 Difference]: Finished difference Result 426 states and 444 transitions. [2018-01-28 22:43:36,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-28 22:43:36,651 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 174 [2018-01-28 22:43:36,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:43:36,653 INFO L225 Difference]: With dead ends: 426 [2018-01-28 22:43:36,653 INFO L226 Difference]: Without dead ends: 254 [2018-01-28 22:43:36,654 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=126, Invalid=180, Unknown=0, NotChecked=0, Total=306 [2018-01-28 22:43:36,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2018-01-28 22:43:36,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 251. [2018-01-28 22:43:36,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-01-28 22:43:36,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 260 transitions. [2018-01-28 22:43:36,697 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 260 transitions. Word has length 174 [2018-01-28 22:43:36,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:43:36,697 INFO L432 AbstractCegarLoop]: Abstraction has 251 states and 260 transitions. [2018-01-28 22:43:36,697 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-28 22:43:36,697 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 260 transitions. [2018-01-28 22:43:36,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-01-28 22:43:36,698 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:43:36,699 INFO L330 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 22:43:36,699 INFO L371 AbstractCegarLoop]: === Iteration 29 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-28 22:43:36,699 INFO L82 PathProgramCache]: Analyzing trace with hash -781800337, now seen corresponding path program 2 times [2018-01-28 22:43:36,699 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:43:36,699 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:43:36,700 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:43:36,700 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:43:36,700 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:43:36,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:43:36,728 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:43:37,156 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:43:37,156 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:43:37,156 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-28 22:43:37,168 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-28 22:43:37,234 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-28 22:43:37,242 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-28 22:43:37,250 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:43:37,376 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-28 22:43:37,377 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-28 22:43:37,378 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:43:37,379 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:43:37,380 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:43:37,380 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-01-28 22:43:37,512 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-28 22:43:37,516 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-28 22:43:37,523 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-28 22:43:37,523 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:26 [2018-01-28 22:43:37,532 WARN L1033 $PredicateComparison]: unable to prove that (exists ((LDV_INIT_LIST_HEAD_~list.offset Int) (v_DerPreprocessor_2 Int)) (and (= |c_#memory_int| (store |c_old(#memory_int)| |c_LDV_INIT_LIST_HEAD_#in~list.base| (let ((.cse0 (+ LDV_INIT_LIST_HEAD_~list.offset 4))) (store (store (select |c_old(#memory_int)| |c_LDV_INIT_LIST_HEAD_#in~list.base|) LDV_INIT_LIST_HEAD_~list.offset v_DerPreprocessor_2) .cse0 (select (select |c_#memory_int| |c_LDV_INIT_LIST_HEAD_#in~list.base|) .cse0))))) (<= LDV_INIT_LIST_HEAD_~list.offset |c_LDV_INIT_LIST_HEAD_#in~list.offset|))) is different from true [2018-01-28 22:43:37,545 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 27 [2018-01-28 22:43:37,547 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:43:37,551 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 35 [2018-01-28 22:43:37,558 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:43:37,558 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:43:37,562 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 37 [2018-01-28 22:43:37,562 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-28 22:43:37,569 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:43:37,572 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:43:37,600 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:43:37,600 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:37, output treesize:9 [2018-01-28 22:43:38,791 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:43:38,792 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 36 [2018-01-28 22:43:38,794 INFO L682 Elim1Store]: detected equality via solver [2018-01-28 22:43:38,795 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:43:38,796 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 15 [2018-01-28 22:43:38,796 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:43:38,799 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:43:38,802 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:43:38,802 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:13 [2018-01-28 22:43:39,429 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-01-28 22:43:39,435 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-01-28 22:43:39,435 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:43:39,437 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:43:39,438 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:43:39,438 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-01-28 22:43:39,510 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2018-01-28 22:43:39,531 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-28 22:43:39,531 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [50] imperfect sequences [17] total 65 [2018-01-28 22:43:39,532 INFO L409 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-01-28 22:43:39,532 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-01-28 22:43:39,533 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=239, Invalid=3796, Unknown=1, NotChecked=124, Total=4160 [2018-01-28 22:43:39,533 INFO L87 Difference]: Start difference. First operand 251 states and 260 transitions. Second operand 65 states. [2018-01-28 22:43:42,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:43:42,648 INFO L93 Difference]: Finished difference Result 420 states and 437 transitions. [2018-01-28 22:43:42,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-01-28 22:43:42,648 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 178 [2018-01-28 22:43:42,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:43:42,649 INFO L225 Difference]: With dead ends: 420 [2018-01-28 22:43:42,649 INFO L226 Difference]: Without dead ends: 248 [2018-01-28 22:43:42,652 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1594 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=406, Invalid=8339, Unknown=1, NotChecked=184, Total=8930 [2018-01-28 22:43:42,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2018-01-28 22:43:42,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 245. [2018-01-28 22:43:42,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-01-28 22:43:42,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 248 transitions. [2018-01-28 22:43:42,680 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 248 transitions. Word has length 178 [2018-01-28 22:43:42,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:43:42,681 INFO L432 AbstractCegarLoop]: Abstraction has 245 states and 248 transitions. [2018-01-28 22:43:42,681 INFO L433 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-01-28 22:43:42,681 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 248 transitions. [2018-01-28 22:43:42,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-01-28 22:43:42,682 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:43:42,682 INFO L330 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 22:43:42,682 INFO L371 AbstractCegarLoop]: === Iteration 30 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-28 22:43:42,683 INFO L82 PathProgramCache]: Analyzing trace with hash -1588564862, now seen corresponding path program 1 times [2018-01-28 22:43:42,683 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:43:42,683 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:43:42,684 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:43:42,684 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-28 22:43:42,684 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:43:42,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:43:42,703 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:43:43,638 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2018-01-28 22:43:43,639 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:43:43,639 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-28 22:43:43,644 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:43:43,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:43:43,743 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:43:44,079 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-01-28 22:43:44,108 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:43:44,108 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18] total 37 [2018-01-28 22:43:44,109 INFO L409 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-01-28 22:43:44,109 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-01-28 22:43:44,109 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=1154, Unknown=0, NotChecked=0, Total=1332 [2018-01-28 22:43:44,109 INFO L87 Difference]: Start difference. First operand 245 states and 248 transitions. Second operand 37 states. [2018-01-28 22:43:45,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:43:45,598 INFO L93 Difference]: Finished difference Result 430 states and 436 transitions. [2018-01-28 22:43:45,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-01-28 22:43:45,599 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 197 [2018-01-28 22:43:45,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:43:45,600 INFO L225 Difference]: With dead ends: 430 [2018-01-28 22:43:45,600 INFO L226 Difference]: Without dead ends: 268 [2018-01-28 22:43:45,601 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 622 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=540, Invalid=4290, Unknown=0, NotChecked=0, Total=4830 [2018-01-28 22:43:45,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2018-01-28 22:43:45,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 252. [2018-01-28 22:43:45,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2018-01-28 22:43:45,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 254 transitions. [2018-01-28 22:43:45,643 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 254 transitions. Word has length 197 [2018-01-28 22:43:45,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:43:45,644 INFO L432 AbstractCegarLoop]: Abstraction has 252 states and 254 transitions. [2018-01-28 22:43:45,644 INFO L433 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-01-28 22:43:45,644 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 254 transitions. [2018-01-28 22:43:45,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-01-28 22:43:45,645 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:43:45,646 INFO L330 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 22:43:45,646 INFO L371 AbstractCegarLoop]: === Iteration 31 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-28 22:43:45,646 INFO L82 PathProgramCache]: Analyzing trace with hash 1611558565, now seen corresponding path program 1 times [2018-01-28 22:43:45,646 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:43:45,646 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:43:45,647 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:43:45,647 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:43:45,647 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:43:45,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:43:45,680 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:43:46,177 INFO L134 CoverageAnalysis]: Checked inductivity of 458 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 446 trivial. 0 not checked. [2018-01-28 22:43:46,177 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:43:46,177 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-28 22:43:46,183 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:43:46,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:43:46,256 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:43:46,770 INFO L134 CoverageAnalysis]: Checked inductivity of 458 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-01-28 22:43:46,791 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:43:46,791 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 19] total 43 [2018-01-28 22:43:46,792 INFO L409 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-01-28 22:43:46,792 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-01-28 22:43:46,793 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=1603, Unknown=0, NotChecked=0, Total=1806 [2018-01-28 22:43:46,793 INFO L87 Difference]: Start difference. First operand 252 states and 254 transitions. Second operand 43 states. [2018-01-28 22:43:48,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:43:48,717 INFO L93 Difference]: Finished difference Result 436 states and 441 transitions. [2018-01-28 22:43:48,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-01-28 22:43:48,717 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 220 [2018-01-28 22:43:48,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:43:48,718 INFO L225 Difference]: With dead ends: 436 [2018-01-28 22:43:48,718 INFO L226 Difference]: Without dead ends: 271 [2018-01-28 22:43:48,720 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 740 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=631, Invalid=6011, Unknown=0, NotChecked=0, Total=6642 [2018-01-28 22:43:48,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2018-01-28 22:43:48,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 255. [2018-01-28 22:43:48,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2018-01-28 22:43:48,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 257 transitions. [2018-01-28 22:43:48,747 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 257 transitions. Word has length 220 [2018-01-28 22:43:48,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:43:48,747 INFO L432 AbstractCegarLoop]: Abstraction has 255 states and 257 transitions. [2018-01-28 22:43:48,747 INFO L433 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-01-28 22:43:48,747 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 257 transitions. [2018-01-28 22:43:48,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2018-01-28 22:43:48,748 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:43:48,749 INFO L330 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 22:43:48,749 INFO L371 AbstractCegarLoop]: === Iteration 32 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-28 22:43:48,749 INFO L82 PathProgramCache]: Analyzing trace with hash -1417048159, now seen corresponding path program 1 times [2018-01-28 22:43:48,749 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:43:48,749 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:43:48,750 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:43:48,750 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:43:48,750 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:43:48,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:43:48,913 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:43:56,747 INFO L134 CoverageAnalysis]: Checked inductivity of 519 backedges. 34 proven. 477 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-28 22:43:56,747 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:43:56,748 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-28 22:43:56,753 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:43:56,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:43:56,846 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:43:57,014 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-01-28 22:43:57,015 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 12 treesize of output 11 [2018-01-28 22:43:57,016 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:43:57,017 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:43:57,021 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:43:57,022 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-01-28 22:43:57,174 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2018-01-28 22:43:57,176 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:43:57,176 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-01-28 22:43:57,177 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:43:57,181 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:43:57,186 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:43:57,187 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2018-01-28 22:43:57,392 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2018-01-28 22:43:57,395 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:43:57,396 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:43:57,397 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:43:57,397 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 52 [2018-01-28 22:43:57,398 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:43:57,406 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:43:57,416 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-28 22:43:57,416 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:43 [2018-01-28 22:43:57,672 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 38 [2018-01-28 22:43:57,676 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:43:57,678 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:43:57,679 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:43:57,680 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:43:57,681 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:43:57,683 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:43:57,684 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 85 [2018-01-28 22:43:57,684 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:43:57,702 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:43:57,716 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-28 22:43:57,716 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:63, output treesize:59 [2018-01-28 22:43:58,188 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 47 [2018-01-28 22:43:58,192 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:43:58,193 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:43:58,194 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:43:58,196 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:43:58,197 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:43:58,198 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:43:58,199 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:43:58,200 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:43:58,201 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:43:58,202 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:43:58,203 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 126 [2018-01-28 22:43:58,203 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:43:58,228 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:43:58,246 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-01-28 22:43:58,247 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:79, output treesize:75 [2018-01-28 22:43:58,583 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 56 [2018-01-28 22:43:58,586 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:43:58,587 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:43:58,588 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:43:58,589 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:43:58,590 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:43:58,590 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:43:58,591 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:43:58,592 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:43:58,593 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:43:58,594 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:43:58,595 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:43:58,596 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:43:58,597 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:43:58,598 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:43:58,598 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:43:58,599 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 175 [2018-01-28 22:43:58,600 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:43:58,638 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:43:58,660 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-01-28 22:43:58,661 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:95, output treesize:91 [2018-01-28 22:43:59,493 WARN L143 SmtUtils]: Spent 643ms on a formula simplification that was a NOOP. DAG size: 44 [2018-01-28 22:43:59,755 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 65 [2018-01-28 22:43:59,760 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:43:59,761 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:43:59,762 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:43:59,763 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:43:59,764 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:43:59,765 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:43:59,766 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:43:59,767 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:43:59,768 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:43:59,769 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:43:59,770 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:43:59,771 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:43:59,772 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:43:59,773 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:43:59,774 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:43:59,774 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:43:59,775 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:43:59,776 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:43:59,777 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:43:59,779 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:43:59,780 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:43:59,781 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 232 [2018-01-28 22:43:59,781 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:43:59,829 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:43:59,852 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-01-28 22:43:59,852 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:111, output treesize:107 [2018-01-28 22:44:02,116 WARN L143 SmtUtils]: Spent 2010ms on a formula simplification that was a NOOP. DAG size: 50 [2018-01-28 22:44:03,525 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 74 [2018-01-28 22:44:03,528 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:44:03,529 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:44:03,530 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:44:03,531 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:44:03,532 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:44:03,532 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:44:03,533 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:44:03,534 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:44:03,535 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:44:03,535 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:44:03,536 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:44:03,537 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:44:03,538 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:44:03,538 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:44:03,539 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:44:03,540 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:44:03,540 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:44:03,542 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:44:03,543 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:44:03,543 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:44:03,544 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:44:03,545 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:44:03,546 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:44:03,546 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:44:03,547 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:44:03,548 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:44:03,549 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:44:03,550 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:44:03,551 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 297 [2018-01-28 22:44:03,551 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:44:03,618 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:44:03,644 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2018-01-28 22:44:03,645 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:127, output treesize:123 [2018-01-28 22:44:07,144 WARN L143 SmtUtils]: Spent 2013ms on a formula simplification that was a NOOP. DAG size: 56 [2018-01-28 22:44:18,223 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 83 [2018-01-28 22:44:18,229 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:44:18,230 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:44:18,231 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:44:18,232 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:44:18,236 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:44:18,237 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:44:18,238 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:44:18,239 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:44:18,240 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:44:18,241 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:44:18,242 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:44:18,243 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:44:18,244 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:44:18,245 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:44:18,246 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:44:18,247 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:44:18,248 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:44:18,249 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:44:18,250 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:44:18,251 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:44:18,252 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:44:18,253 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:44:18,253 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:44:18,255 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:44:18,255 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:44:18,256 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:44:18,257 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:44:18,258 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:44:18,259 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:44:18,260 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:44:18,260 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:44:18,261 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:44:18,262 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:44:18,263 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:44:18,264 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:44:18,264 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:44:18,266 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 36 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 370 [2018-01-28 22:44:18,267 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:44:18,353 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:44:18,388 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2018-01-28 22:44:18,388 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:143, output treesize:139 [2018-01-28 22:44:30,132 WARN L143 SmtUtils]: Spent 800ms on a formula simplification that was a NOOP. DAG size: 62 [2018-01-28 22:44:54,741 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 92 [2018-01-28 22:44:54,748 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:44:54,750 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:44:54,752 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:44:54,755 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:44:54,764 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:44:54,766 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:44:54,767 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:44:54,768 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:44:54,770 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:44:54,772 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:44:54,774 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:44:54,775 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:44:54,777 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:44:54,779 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:44:54,781 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:44:54,782 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:44:54,783 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:44:54,784 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:44:54,785 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:44:54,786 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:44:54,787 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:44:54,788 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:44:54,790 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:44:54,790 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:44:54,792 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:44:54,793 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:44:54,794 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:44:54,795 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:44:54,796 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:44:54,797 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:44:54,798 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:44:54,799 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:44:54,800 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:44:54,801 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:44:54,802 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:44:54,803 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:44:54,804 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:44:54,805 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:44:54,806 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:44:54,807 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:44:54,808 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:44:54,809 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:44:54,810 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:44:54,811 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:44:54,812 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:44:54,814 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 45 disjoint index pairs (out of 36 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 451 [2018-01-28 22:44:54,815 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:44:54,929 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:44:54,965 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-2 vars, End of recursive call: 8 dim-0 vars, and 1 xjuncts. [2018-01-28 22:44:54,966 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:159, output treesize:155 Received shutdown request... [2018-01-28 22:44:58,475 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-28 22:44:58,476 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-28 22:44:58,480 WARN L185 ceAbstractionStarter]: Timeout [2018-01-28 22:44:58,481 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.01 10:44:58 BoogieIcfgContainer [2018-01-28 22:44:58,481 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-28 22:44:58,482 INFO L168 Benchmark]: Toolchain (without parser) took 123579.35 ms. Allocated memory was 303.6 MB in the beginning and 1.2 GB in the end (delta: 847.2 MB). Free memory was 262.6 MB in the beginning and 507.9 MB in the end (delta: -245.3 MB). Peak memory consumption was 601.9 MB. Max. memory is 5.3 GB. [2018-01-28 22:44:58,483 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 303.6 MB. Free memory is still 268.6 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-28 22:44:58,483 INFO L168 Benchmark]: CACSL2BoogieTranslator took 232.36 ms. Allocated memory is still 303.6 MB. Free memory was 262.6 MB in the beginning and 248.6 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 5.3 GB. [2018-01-28 22:44:58,483 INFO L168 Benchmark]: Boogie Preprocessor took 41.01 ms. Allocated memory is still 303.6 MB. Free memory was 248.6 MB in the beginning and 244.7 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 5.3 GB. [2018-01-28 22:44:58,483 INFO L168 Benchmark]: RCFGBuilder took 554.28 ms. Allocated memory is still 303.6 MB. Free memory was 244.7 MB in the beginning and 206.1 MB in the end (delta: 38.6 MB). Peak memory consumption was 38.6 MB. Max. memory is 5.3 GB. [2018-01-28 22:44:58,483 INFO L168 Benchmark]: TraceAbstraction took 122718.09 ms. Allocated memory was 303.6 MB in the beginning and 1.2 GB in the end (delta: 847.2 MB). Free memory was 206.1 MB in the beginning and 507.9 MB in the end (delta: -301.9 MB). Peak memory consumption was 545.4 MB. Max. memory is 5.3 GB. [2018-01-28 22:44:58,485 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 303.6 MB. Free memory is still 268.6 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 232.36 ms. Allocated memory is still 303.6 MB. Free memory was 262.6 MB in the beginning and 248.6 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 41.01 ms. Allocated memory is still 303.6 MB. Free memory was 248.6 MB in the beginning and 244.7 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 554.28 ms. Allocated memory is still 303.6 MB. Free memory was 244.7 MB in the beginning and 206.1 MB in the end (delta: 38.6 MB). Peak memory consumption was 38.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 122718.09 ms. Allocated memory was 303.6 MB in the beginning and 1.2 GB in the end (delta: 847.2 MB). Free memory was 206.1 MB in the beginning and 507.9 MB in the end (delta: -301.9 MB). Peak memory consumption was 545.4 MB. Max. memory is 5.3 GB. * 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 230 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 101 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 230 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 101 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 230 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 101 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 230 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 101 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 230 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 101 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 230 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 101 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 230 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 101 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 230 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 101 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 230 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 101 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 230 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 101 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 230 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 101 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 230 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 101 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1344). Cancelled while BasicCegarLoop was analyzing trace of length 230 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 101 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1340). Cancelled while BasicCegarLoop was analyzing trace of length 230 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 101 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1344). Cancelled while BasicCegarLoop was analyzing trace of length 230 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 101 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1340). Cancelled while BasicCegarLoop was analyzing trace of length 230 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 101 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 230 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 101 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 230 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 101 known predicates. - TimeoutResultAtElement [Line: 1452]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 1452). Cancelled while BasicCegarLoop was analyzing trace of length 230 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 101 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 230 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 101 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 230 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 101 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 230 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 101 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 230 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 101 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 23 procedures, 184 locations, 23 error locations. TIMEOUT Result, 122.6s OverallTime, 32 OverallIterations, 16 TraceHistogramMax, 34.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5081 SDtfs, 2410 SDslu, 50930 SDs, 0 SdLazy, 22096 SolverSat, 424 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 13.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2504 GetRequests, 1744 SyntacticMatches, 11 SemanticMatches, 749 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 5651 ImplicationChecksByTransitivity, 30.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=255occurred in iteration=31, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 31 MinimizatonAttempts, 206 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 15.2s InterpolantComputationTime, 4817 NumberOfCodeBlocks, 4641 NumberOfCodeBlocksAsserted, 46 NumberOfCheckSat, 4771 ConstructedInterpolants, 420 QuantifiedInterpolants, 2789395 SizeOfPredicates, 145 NumberOfNonLiveVariables, 6185 ConjunctsInSsa, 610 ConjunctsInUnsatCore, 46 InterpolantComputations, 22 PerfectInterpolantSequences, 2391/5394 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: 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_3_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-28_22-44-58-493.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_3_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-28_22-44-58-493.csv Completed graceful shutdown