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_5_false-valid-deref.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cceb4a [2018-01-29 23:54:46,096 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-29 23:54:46,098 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-29 23:54:46,113 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-29 23:54:46,114 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-29 23:54:46,115 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-29 23:54:46,116 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-29 23:54:46,118 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-29 23:54:46,120 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-29 23:54:46,121 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-29 23:54:46,121 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-29 23:54:46,122 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-29 23:54:46,123 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-29 23:54:46,124 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-29 23:54:46,125 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-29 23:54:46,128 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-29 23:54:46,130 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-29 23:54:46,132 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-29 23:54:46,133 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-29 23:54:46,134 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-29 23:54:46,137 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-29 23:54:46,137 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-29 23:54:46,137 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-29 23:54:46,138 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-29 23:54:46,139 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-29 23:54:46,141 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-29 23:54:46,141 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-29 23:54:46,142 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-29 23:54:46,142 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-29 23:54:46,142 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-29 23:54:46,143 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-29 23:54:46,143 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-29 23:54:46,152 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-29 23:54:46,152 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-29 23:54:46,153 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-29 23:54:46,153 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-29 23:54:46,153 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-29 23:54:46,153 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-29 23:54:46,154 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-29 23:54:46,154 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-29 23:54:46,154 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-29 23:54:46,154 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-29 23:54:46,154 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-29 23:54:46,154 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-29 23:54:46,155 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-29 23:54:46,155 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-29 23:54:46,155 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-29 23:54:46,155 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-29 23:54:46,155 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-29 23:54:46,155 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-29 23:54:46,155 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-29 23:54:46,156 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-29 23:54:46,156 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-29 23:54:46,156 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-29 23:54:46,156 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-29 23:54:46,156 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-29 23:54:46,156 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-29 23:54:46,157 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-29 23:54:46,157 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-29 23:54:46,157 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-29 23:54:46,157 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-29 23:54:46,157 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-29 23:54:46,157 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-29 23:54:46,158 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-29 23:54:46,158 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-29 23:54:46,159 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-29 23:54:46,191 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-29 23:54:46,201 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-29 23:54:46,204 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-29 23:54:46,205 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-29 23:54:46,206 INFO L276 PluginConnector]: CDTParser initialized [2018-01-29 23:54:46,206 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test22_5_false-valid-deref.i [2018-01-29 23:54:46,385 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-29 23:54:46,390 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-29 23:54:46,391 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-29 23:54:46,391 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-29 23:54:46,396 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-29 23:54:46,397 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 11:54:46" (1/1) ... [2018-01-29 23:54:46,399 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3495bee9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:54:46, skipping insertion in model container [2018-01-29 23:54:46,400 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 11:54:46" (1/1) ... [2018-01-29 23:54:46,413 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-29 23:54:46,461 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-29 23:54:46,589 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-29 23:54:46,613 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-29 23:54:46,623 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:54:46 WrapperNode [2018-01-29 23:54:46,623 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-29 23:54:46,623 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-29 23:54:46,623 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-29 23:54:46,623 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-29 23:54:46,636 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:54:46" (1/1) ... [2018-01-29 23:54:46,637 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:54:46" (1/1) ... [2018-01-29 23:54:46,650 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:54:46" (1/1) ... [2018-01-29 23:54:46,650 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:54:46" (1/1) ... [2018-01-29 23:54:46,659 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:54:46" (1/1) ... [2018-01-29 23:54:46,662 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:54:46" (1/1) ... [2018-01-29 23:54:46,664 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:54:46" (1/1) ... [2018-01-29 23:54:46,667 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-29 23:54:46,667 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-29 23:54:46,667 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-29 23:54:46,668 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-29 23:54:46,669 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:54:46" (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-29 23:54:46,717 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-29 23:54:46,717 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-29 23:54:46,717 INFO L136 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2018-01-29 23:54:46,717 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-29 23:54:46,717 INFO L136 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2018-01-29 23:54:46,717 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_atomic_sub_return [2018-01-29 23:54:46,717 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_sub [2018-01-29 23:54:46,717 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_init [2018-01-29 23:54:46,717 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_put [2018-01-29 23:54:46,718 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_cleanup [2018-01-29 23:54:46,718 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_release [2018-01-29 23:54:46,718 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2018-01-29 23:54:46,718 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init_internal [2018-01-29 23:54:46,718 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init [2018-01-29 23:54:46,718 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_create [2018-01-29 23:54:46,719 INFO L136 BoogieDeclarations]: Found implementation of procedure f_22_put [2018-01-29 23:54:46,719 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-29 23:54:46,719 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-29 23:54:46,719 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-29 23:54:46,719 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-29 23:54:46,719 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-29 23:54:46,720 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-29 23:54:46,720 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-29 23:54:46,720 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-29 23:54:46,720 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-29 23:54:46,720 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2018-01-29 23:54:46,720 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2018-01-29 23:54:46,721 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-29 23:54:46,721 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-29 23:54:46,721 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-29 23:54:46,721 INFO L128 BoogieDeclarations]: Found specification of procedure memset [2018-01-29 23:54:46,721 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-29 23:54:46,721 INFO L128 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2018-01-29 23:54:46,721 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_atomic_sub_return [2018-01-29 23:54:46,722 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_sub [2018-01-29 23:54:46,722 INFO L128 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2018-01-29 23:54:46,722 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_init [2018-01-29 23:54:46,722 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_put [2018-01-29 23:54:46,722 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_cleanup [2018-01-29 23:54:46,722 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_release [2018-01-29 23:54:46,722 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2018-01-29 23:54:46,722 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_init_internal [2018-01-29 23:54:46,722 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_init [2018-01-29 23:54:46,722 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_create [2018-01-29 23:54:46,722 INFO L128 BoogieDeclarations]: Found specification of procedure f_22_put [2018-01-29 23:54:46,722 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-29 23:54:46,723 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-29 23:54:46,723 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-29 23:54:46,723 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-29 23:54:46,985 WARN L455 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-01-29 23:54:47,168 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-29 23:54:47,169 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 11:54:47 BoogieIcfgContainer [2018-01-29 23:54:47,169 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-29 23:54:47,170 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-29 23:54:47,170 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-29 23:54:47,173 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-29 23:54:47,174 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.01 11:54:46" (1/3) ... [2018-01-29 23:54:47,174 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@202e0d38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.01 11:54:47, skipping insertion in model container [2018-01-29 23:54:47,174 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:54:46" (2/3) ... [2018-01-29 23:54:47,175 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@202e0d38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.01 11:54:47, skipping insertion in model container [2018-01-29 23:54:47,175 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 11:54:47" (3/3) ... [2018-01-29 23:54:47,176 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test22_5_false-valid-deref.i [2018-01-29 23:54:47,184 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-29 23:54:47,192 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 19 error locations. [2018-01-29 23:54:47,236 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-29 23:54:47,236 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-29 23:54:47,236 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-29 23:54:47,236 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-29 23:54:47,236 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-29 23:54:47,236 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-29 23:54:47,237 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-29 23:54:47,237 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-29 23:54:47,238 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-29 23:54:47,256 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states. [2018-01-29 23:54:47,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-29 23:54:47,264 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:54:47,265 INFO L350 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-29 23:54:47,265 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_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-29 23:54:47,269 INFO L82 PathProgramCache]: Analyzing trace with hash -1409337998, now seen corresponding path program 1 times [2018-01-29 23:54:47,271 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:54:47,271 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:54:47,319 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:54:47,319 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:54:47,319 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:54:47,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:54:47,375 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:54:47,593 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-29 23:54:47,596 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:54:47,596 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-29 23:54:47,598 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-29 23:54:47,614 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-29 23:54:47,614 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-29 23:54:47,617 INFO L87 Difference]: Start difference. First operand 151 states. Second operand 5 states. [2018-01-29 23:54:47,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:54:47,702 INFO L93 Difference]: Finished difference Result 284 states and 299 transitions. [2018-01-29 23:54:47,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-29 23:54:47,705 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-01-29 23:54:47,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:54:47,719 INFO L225 Difference]: With dead ends: 284 [2018-01-29 23:54:47,719 INFO L226 Difference]: Without dead ends: 155 [2018-01-29 23:54:47,724 INFO L553 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-29 23:54:47,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-01-29 23:54:47,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 153. [2018-01-29 23:54:47,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-01-29 23:54:47,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 161 transitions. [2018-01-29 23:54:47,774 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 161 transitions. Word has length 22 [2018-01-29 23:54:47,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:54:47,775 INFO L432 AbstractCegarLoop]: Abstraction has 153 states and 161 transitions. [2018-01-29 23:54:47,775 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-29 23:54:47,775 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 161 transitions. [2018-01-29 23:54:47,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-29 23:54:47,776 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:54:47,776 INFO L350 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-29 23:54:47,776 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_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-29 23:54:47,776 INFO L82 PathProgramCache]: Analyzing trace with hash 769916615, now seen corresponding path program 1 times [2018-01-29 23:54:47,777 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:54:47,777 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:54:47,779 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:54:47,779 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:54:47,779 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:54:47,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:54:47,801 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:54:47,854 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-29 23:54:47,854 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:54:47,855 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-29 23:54:47,856 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-29 23:54:47,857 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-29 23:54:47,857 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-29 23:54:47,857 INFO L87 Difference]: Start difference. First operand 153 states and 161 transitions. Second operand 6 states. [2018-01-29 23:54:48,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:54:48,060 INFO L93 Difference]: Finished difference Result 156 states and 164 transitions. [2018-01-29 23:54:48,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-29 23:54:48,061 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-01-29 23:54:48,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:54:48,063 INFO L225 Difference]: With dead ends: 156 [2018-01-29 23:54:48,063 INFO L226 Difference]: Without dead ends: 155 [2018-01-29 23:54:48,064 INFO L553 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-29 23:54:48,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-01-29 23:54:48,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 152. [2018-01-29 23:54:48,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-01-29 23:54:48,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 160 transitions. [2018-01-29 23:54:48,079 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 160 transitions. Word has length 23 [2018-01-29 23:54:48,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:54:48,079 INFO L432 AbstractCegarLoop]: Abstraction has 152 states and 160 transitions. [2018-01-29 23:54:48,079 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-29 23:54:48,079 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 160 transitions. [2018-01-29 23:54:48,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-29 23:54:48,080 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:54:48,080 INFO L350 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-29 23:54:48,080 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_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-29 23:54:48,080 INFO L82 PathProgramCache]: Analyzing trace with hash 769916616, now seen corresponding path program 1 times [2018-01-29 23:54:48,080 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:54:48,080 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:54:48,081 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:54:48,082 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:54:48,082 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:54:48,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:54:48,103 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:54:48,427 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-29 23:54:48,428 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:54:48,428 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-29 23:54:48,428 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-29 23:54:48,428 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-29 23:54:48,429 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-29 23:54:48,429 INFO L87 Difference]: Start difference. First operand 152 states and 160 transitions. Second operand 7 states. [2018-01-29 23:54:48,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:54:48,703 INFO L93 Difference]: Finished difference Result 155 states and 163 transitions. [2018-01-29 23:54:48,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-29 23:54:48,703 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2018-01-29 23:54:48,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:54:48,706 INFO L225 Difference]: With dead ends: 155 [2018-01-29 23:54:48,706 INFO L226 Difference]: Without dead ends: 154 [2018-01-29 23:54:48,706 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-01-29 23:54:48,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-01-29 23:54:48,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 151. [2018-01-29 23:54:48,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-01-29 23:54:48,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 159 transitions. [2018-01-29 23:54:48,720 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 159 transitions. Word has length 23 [2018-01-29 23:54:48,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:54:48,721 INFO L432 AbstractCegarLoop]: Abstraction has 151 states and 159 transitions. [2018-01-29 23:54:48,721 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-29 23:54:48,721 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 159 transitions. [2018-01-29 23:54:48,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-01-29 23:54:48,723 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:54:48,723 INFO L350 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-29 23:54:48,724 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_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-29 23:54:48,724 INFO L82 PathProgramCache]: Analyzing trace with hash -670738525, now seen corresponding path program 1 times [2018-01-29 23:54:48,724 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:54:48,725 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:54:48,726 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:54:48,726 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:54:48,726 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:54:48,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:54:48,749 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:54:48,862 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-29 23:54:48,863 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:54:48,863 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-29 23:54:48,863 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-29 23:54:48,863 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-29 23:54:48,864 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-01-29 23:54:48,864 INFO L87 Difference]: Start difference. First operand 151 states and 159 transitions. Second operand 10 states. [2018-01-29 23:54:49,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:54:49,149 INFO L93 Difference]: Finished difference Result 153 states and 161 transitions. [2018-01-29 23:54:49,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-29 23:54:49,150 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 39 [2018-01-29 23:54:49,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:54:49,151 INFO L225 Difference]: With dead ends: 153 [2018-01-29 23:54:49,152 INFO L226 Difference]: Without dead ends: 152 [2018-01-29 23:54:49,152 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-01-29 23:54:49,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-01-29 23:54:49,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 150. [2018-01-29 23:54:49,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-01-29 23:54:49,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 158 transitions. [2018-01-29 23:54:49,164 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 158 transitions. Word has length 39 [2018-01-29 23:54:49,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:54:49,165 INFO L432 AbstractCegarLoop]: Abstraction has 150 states and 158 transitions. [2018-01-29 23:54:49,165 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-29 23:54:49,165 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 158 transitions. [2018-01-29 23:54:49,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-01-29 23:54:49,166 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:54:49,167 INFO L350 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-29 23:54:49,167 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_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-29 23:54:49,167 INFO L82 PathProgramCache]: Analyzing trace with hash -670738524, now seen corresponding path program 1 times [2018-01-29 23:54:49,167 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:54:49,167 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:54:49,169 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:54:49,169 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:54:49,169 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:54:49,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:54:49,189 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:54:49,223 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-29 23:54:49,223 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:54:49,223 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-29 23:54:49,223 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-29 23:54:49,224 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-29 23:54:49,224 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-29 23:54:49,224 INFO L87 Difference]: Start difference. First operand 150 states and 158 transitions. Second operand 4 states. [2018-01-29 23:54:49,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:54:49,253 INFO L93 Difference]: Finished difference Result 266 states and 280 transitions. [2018-01-29 23:54:49,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-29 23:54:49,253 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2018-01-29 23:54:49,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:54:49,255 INFO L225 Difference]: With dead ends: 266 [2018-01-29 23:54:49,256 INFO L226 Difference]: Without dead ends: 154 [2018-01-29 23:54:49,257 INFO L553 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-29 23:54:49,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-01-29 23:54:49,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 151. [2018-01-29 23:54:49,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-01-29 23:54:49,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 159 transitions. [2018-01-29 23:54:49,270 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 159 transitions. Word has length 39 [2018-01-29 23:54:49,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:54:49,270 INFO L432 AbstractCegarLoop]: Abstraction has 151 states and 159 transitions. [2018-01-29 23:54:49,270 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-29 23:54:49,271 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 159 transitions. [2018-01-29 23:54:49,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-01-29 23:54:49,272 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:54:49,272 INFO L350 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-29 23:54:49,273 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_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-29 23:54:49,273 INFO L82 PathProgramCache]: Analyzing trace with hash -973665193, now seen corresponding path program 1 times [2018-01-29 23:54:49,273 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:54:49,273 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:54:49,274 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:54:49,274 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:54:49,275 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:54:49,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:54:49,293 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:54:49,420 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-29 23:54:49,421 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:54:49,421 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-29 23:54:49,421 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-29 23:54:49,422 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-29 23:54:49,422 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-01-29 23:54:49,422 INFO L87 Difference]: Start difference. First operand 151 states and 159 transitions. Second operand 9 states. [2018-01-29 23:54:49,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:54:49,584 INFO L93 Difference]: Finished difference Result 244 states and 259 transitions. [2018-01-29 23:54:49,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-29 23:54:49,585 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 43 [2018-01-29 23:54:49,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:54:49,587 INFO L225 Difference]: With dead ends: 244 [2018-01-29 23:54:49,587 INFO L226 Difference]: Without dead ends: 169 [2018-01-29 23:54:49,588 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-01-29 23:54:49,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-01-29 23:54:49,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 165. [2018-01-29 23:54:49,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-01-29 23:54:49,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 174 transitions. [2018-01-29 23:54:49,602 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 174 transitions. Word has length 43 [2018-01-29 23:54:49,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:54:49,602 INFO L432 AbstractCegarLoop]: Abstraction has 165 states and 174 transitions. [2018-01-29 23:54:49,603 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-29 23:54:49,603 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 174 transitions. [2018-01-29 23:54:49,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-01-29 23:54:49,604 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:54:49,604 INFO L350 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-29 23:54:49,604 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_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-29 23:54:49,604 INFO L82 PathProgramCache]: Analyzing trace with hash -1507760222, now seen corresponding path program 1 times [2018-01-29 23:54:49,604 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:54:49,605 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:54:49,606 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:54:49,606 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:54:49,606 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:54:49,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:54:49,625 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:54:49,663 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-29 23:54:49,664 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:54:49,664 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-29 23:54:49,679 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:54:49,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:54:49,724 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:54:49,769 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-29 23:54:49,802 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:54:49,802 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-01-29 23:54:49,803 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-29 23:54:49,803 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-29 23:54:49,803 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-01-29 23:54:49,804 INFO L87 Difference]: Start difference. First operand 165 states and 174 transitions. Second operand 6 states. [2018-01-29 23:54:49,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:54:49,856 INFO L93 Difference]: Finished difference Result 284 states and 299 transitions. [2018-01-29 23:54:49,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-29 23:54:49,857 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 43 [2018-01-29 23:54:49,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:54:49,858 INFO L225 Difference]: With dead ends: 284 [2018-01-29 23:54:49,858 INFO L226 Difference]: Without dead ends: 172 [2018-01-29 23:54:49,859 INFO L553 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-29 23:54:49,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-01-29 23:54:49,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 169. [2018-01-29 23:54:49,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-01-29 23:54:49,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 178 transitions. [2018-01-29 23:54:49,873 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 178 transitions. Word has length 43 [2018-01-29 23:54:49,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:54:49,873 INFO L432 AbstractCegarLoop]: Abstraction has 169 states and 178 transitions. [2018-01-29 23:54:49,873 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-29 23:54:49,873 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 178 transitions. [2018-01-29 23:54:49,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-01-29 23:54:49,875 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:54:49,875 INFO L350 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] [2018-01-29 23:54:49,875 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_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-29 23:54:49,875 INFO L82 PathProgramCache]: Analyzing trace with hash -341758177, now seen corresponding path program 1 times [2018-01-29 23:54:49,876 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:54:49,876 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:54:49,877 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:54:49,877 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:54:49,878 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:54:49,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:54:49,891 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:54:49,945 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-29 23:54:49,945 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:54:49,945 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-29 23:54:49,946 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-29 23:54:49,946 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-29 23:54:49,946 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-29 23:54:49,947 INFO L87 Difference]: Start difference. First operand 169 states and 178 transitions. Second operand 3 states. [2018-01-29 23:54:50,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:54:50,104 INFO L93 Difference]: Finished difference Result 193 states and 204 transitions. [2018-01-29 23:54:50,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-29 23:54:50,104 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2018-01-29 23:54:50,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:54:50,105 INFO L225 Difference]: With dead ends: 193 [2018-01-29 23:54:50,105 INFO L226 Difference]: Without dead ends: 175 [2018-01-29 23:54:50,106 INFO L553 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-29 23:54:50,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-01-29 23:54:50,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 162. [2018-01-29 23:54:50,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-01-29 23:54:50,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 170 transitions. [2018-01-29 23:54:50,117 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 170 transitions. Word has length 43 [2018-01-29 23:54:50,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:54:50,118 INFO L432 AbstractCegarLoop]: Abstraction has 162 states and 170 transitions. [2018-01-29 23:54:50,118 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-29 23:54:50,118 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 170 transitions. [2018-01-29 23:54:50,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-01-29 23:54:50,118 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:54:50,119 INFO L350 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] [2018-01-29 23:54:50,119 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_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-29 23:54:50,119 INFO L82 PathProgramCache]: Analyzing trace with hash -366281494, now seen corresponding path program 1 times [2018-01-29 23:54:50,119 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:54:50,119 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:54:50,120 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:54:50,120 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:54:50,120 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:54:50,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:54:50,133 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:54:50,186 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-29 23:54:50,186 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:54:50,186 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-29 23:54:50,187 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-29 23:54:50,187 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-29 23:54:50,187 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-29 23:54:50,187 INFO L87 Difference]: Start difference. First operand 162 states and 170 transitions. Second operand 6 states. [2018-01-29 23:54:50,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:54:50,237 INFO L93 Difference]: Finished difference Result 166 states and 173 transitions. [2018-01-29 23:54:50,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-29 23:54:50,237 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 44 [2018-01-29 23:54:50,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:54:50,239 INFO L225 Difference]: With dead ends: 166 [2018-01-29 23:54:50,239 INFO L226 Difference]: Without dead ends: 147 [2018-01-29 23:54:50,239 INFO L553 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-29 23:54:50,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-01-29 23:54:50,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2018-01-29 23:54:50,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-01-29 23:54:50,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 153 transitions. [2018-01-29 23:54:50,250 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 153 transitions. Word has length 44 [2018-01-29 23:54:50,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:54:50,250 INFO L432 AbstractCegarLoop]: Abstraction has 147 states and 153 transitions. [2018-01-29 23:54:50,250 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-29 23:54:50,250 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 153 transitions. [2018-01-29 23:54:50,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-01-29 23:54:50,251 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:54:50,252 INFO L350 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-29 23:54:50,252 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_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-29 23:54:50,252 INFO L82 PathProgramCache]: Analyzing trace with hash -409384800, now seen corresponding path program 2 times [2018-01-29 23:54:50,252 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:54:50,252 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:54:50,253 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:54:50,254 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:54:50,254 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:54:50,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:54:50,270 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:54:50,330 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-29 23:54:50,330 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:54:50,330 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-29 23:54:50,341 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-29 23:54:50,363 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:54:50,370 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:54:50,375 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:54:50,401 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-29 23:54:50,403 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:54:50,423 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-29 23:54:50,423 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:54:50,437 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-29 23:54:50,437 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:36 [2018-01-29 23:54:51,278 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-29 23:54:51,301 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-29 23:54:51,302 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [6] total 19 [2018-01-29 23:54:51,302 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-29 23:54:51,302 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-29 23:54:51,303 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2018-01-29 23:54:51,303 INFO L87 Difference]: Start difference. First operand 147 states and 153 transitions. Second operand 19 states. [2018-01-29 23:54:53,518 WARN L143 SmtUtils]: Spent 2052ms on a formula simplification that was a NOOP. DAG size: 39 [2018-01-29 23:54:57,819 WARN L143 SmtUtils]: Spent 4042ms on a formula simplification that was a NOOP. DAG size: 32 [2018-01-29 23:54:58,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:54:58,503 INFO L93 Difference]: Finished difference Result 265 states and 278 transitions. [2018-01-29 23:54:58,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-01-29 23:54:58,504 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 47 [2018-01-29 23:54:58,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:54:58,506 INFO L225 Difference]: With dead ends: 265 [2018-01-29 23:54:58,506 INFO L226 Difference]: Without dead ends: 153 [2018-01-29 23:54:58,507 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=104, Invalid=652, Unknown=0, NotChecked=0, Total=756 [2018-01-29 23:54:58,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-01-29 23:54:58,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 150. [2018-01-29 23:54:58,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-01-29 23:54:58,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 156 transitions. [2018-01-29 23:54:58,525 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 156 transitions. Word has length 47 [2018-01-29 23:54:58,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:54:58,525 INFO L432 AbstractCegarLoop]: Abstraction has 150 states and 156 transitions. [2018-01-29 23:54:58,525 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-01-29 23:54:58,525 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 156 transitions. [2018-01-29 23:54:58,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-01-29 23:54:58,526 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:54:58,526 INFO L350 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-29 23:54:58,526 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_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-29 23:54:58,527 INFO L82 PathProgramCache]: Analyzing trace with hash -146998063, now seen corresponding path program 1 times [2018-01-29 23:54:58,527 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:54:58,527 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:54:58,528 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:54:58,528 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:54:58,528 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:54:58,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:54:58,545 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:54:58,715 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-29 23:54:58,716 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:54:58,716 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-01-29 23:54:58,716 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-29 23:54:58,716 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-29 23:54:58,716 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-01-29 23:54:58,717 INFO L87 Difference]: Start difference. First operand 150 states and 156 transitions. Second operand 12 states. [2018-01-29 23:54:59,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:54:59,060 INFO L93 Difference]: Finished difference Result 150 states and 156 transitions. [2018-01-29 23:54:59,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-29 23:54:59,077 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2018-01-29 23:54:59,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:54:59,078 INFO L225 Difference]: With dead ends: 150 [2018-01-29 23:54:59,078 INFO L226 Difference]: Without dead ends: 148 [2018-01-29 23:54:59,079 INFO L553 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-29 23:54:59,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-01-29 23:54:59,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2018-01-29 23:54:59,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-01-29 23:54:59,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 154 transitions. [2018-01-29 23:54:59,095 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 154 transitions. Word has length 56 [2018-01-29 23:54:59,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:54:59,095 INFO L432 AbstractCegarLoop]: Abstraction has 148 states and 154 transitions. [2018-01-29 23:54:59,095 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-29 23:54:59,095 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 154 transitions. [2018-01-29 23:54:59,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-01-29 23:54:59,096 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:54:59,096 INFO L350 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-29 23:54:59,096 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_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-29 23:54:59,097 INFO L82 PathProgramCache]: Analyzing trace with hash -146998062, now seen corresponding path program 1 times [2018-01-29 23:54:59,097 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:54:59,097 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:54:59,098 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:54:59,098 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:54:59,098 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:54:59,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:54:59,117 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:54:59,225 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-29 23:54:59,226 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:54:59,226 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-29 23:54:59,232 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:54:59,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:54:59,260 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:54:59,272 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-29 23:54:59,292 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:54:59,292 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-01-29 23:54:59,292 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-29 23:54:59,292 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-29 23:54:59,292 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-01-29 23:54:59,293 INFO L87 Difference]: Start difference. First operand 148 states and 154 transitions. Second operand 8 states. [2018-01-29 23:54:59,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:54:59,340 INFO L93 Difference]: Finished difference Result 264 states and 276 transitions. [2018-01-29 23:54:59,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-29 23:54:59,342 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 56 [2018-01-29 23:54:59,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:54:59,344 INFO L225 Difference]: With dead ends: 264 [2018-01-29 23:54:59,344 INFO L226 Difference]: Without dead ends: 155 [2018-01-29 23:54:59,345 INFO L553 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-29 23:54:59,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-01-29 23:54:59,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 152. [2018-01-29 23:54:59,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-01-29 23:54:59,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 158 transitions. [2018-01-29 23:54:59,362 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 158 transitions. Word has length 56 [2018-01-29 23:54:59,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:54:59,362 INFO L432 AbstractCegarLoop]: Abstraction has 152 states and 158 transitions. [2018-01-29 23:54:59,362 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-29 23:54:59,362 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 158 transitions. [2018-01-29 23:54:59,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-01-29 23:54:59,363 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:54:59,363 INFO L350 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-29 23:54:59,363 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_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-29 23:54:59,364 INFO L82 PathProgramCache]: Analyzing trace with hash 966731924, now seen corresponding path program 2 times [2018-01-29 23:54:59,364 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:54:59,364 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:54:59,365 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:54:59,365 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:54:59,365 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:54:59,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:54:59,382 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:54:59,463 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-29 23:54:59,463 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:54:59,463 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-29 23:54:59,475 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-29 23:54:59,497 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:54:59,501 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:54:59,506 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:54:59,515 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-29 23:54:59,515 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:54:59,555 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-29 23:54:59,556 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:54:59,596 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-29 23:54:59,596 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:36 [2018-01-29 23:55:01,740 WARN L143 SmtUtils]: Spent 2015ms on a formula simplification that was a NOOP. DAG size: 21 [2018-01-29 23:55:02,121 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-29 23:55:02,141 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-29 23:55:02,141 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [8] total 22 [2018-01-29 23:55:02,141 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-01-29 23:55:02,141 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-01-29 23:55:02,141 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=390, Unknown=0, NotChecked=0, Total=462 [2018-01-29 23:55:02,142 INFO L87 Difference]: Start difference. First operand 152 states and 158 transitions. Second operand 22 states. [2018-01-29 23:55:03,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:55:03,341 INFO L93 Difference]: Finished difference Result 266 states and 280 transitions. [2018-01-29 23:55:03,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-01-29 23:55:03,342 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 60 [2018-01-29 23:55:03,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:55:03,343 INFO L225 Difference]: With dead ends: 266 [2018-01-29 23:55:03,343 INFO L226 Difference]: Without dead ends: 157 [2018-01-29 23:55:03,344 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=152, Invalid=904, Unknown=0, NotChecked=0, Total=1056 [2018-01-29 23:55:03,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-01-29 23:55:03,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 154. [2018-01-29 23:55:03,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-01-29 23:55:03,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 160 transitions. [2018-01-29 23:55:03,362 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 160 transitions. Word has length 60 [2018-01-29 23:55:03,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:55:03,362 INFO L432 AbstractCegarLoop]: Abstraction has 154 states and 160 transitions. [2018-01-29 23:55:03,362 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-01-29 23:55:03,362 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 160 transitions. [2018-01-29 23:55:03,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-01-29 23:55:03,363 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:55:03,363 INFO L350 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-29 23:55:03,363 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_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-29 23:55:03,364 INFO L82 PathProgramCache]: Analyzing trace with hash 610719468, now seen corresponding path program 1 times [2018-01-29 23:55:03,364 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:55:03,364 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:55:03,365 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:55:03,365 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:55:03,365 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:55:03,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:55:03,379 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:55:03,465 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-29 23:55:03,465 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:55:03,465 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-29 23:55:03,466 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-29 23:55:03,466 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-29 23:55:03,466 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-29 23:55:03,466 INFO L87 Difference]: Start difference. First operand 154 states and 160 transitions. Second operand 8 states. [2018-01-29 23:55:03,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:55:03,579 INFO L93 Difference]: Finished difference Result 239 states and 248 transitions. [2018-01-29 23:55:03,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-29 23:55:03,579 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 77 [2018-01-29 23:55:03,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:55:03,580 INFO L225 Difference]: With dead ends: 239 [2018-01-29 23:55:03,580 INFO L226 Difference]: Without dead ends: 154 [2018-01-29 23:55:03,581 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-01-29 23:55:03,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-01-29 23:55:03,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2018-01-29 23:55:03,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-01-29 23:55:03,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 159 transitions. [2018-01-29 23:55:03,593 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 159 transitions. Word has length 77 [2018-01-29 23:55:03,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:55:03,593 INFO L432 AbstractCegarLoop]: Abstraction has 154 states and 159 transitions. [2018-01-29 23:55:03,593 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-29 23:55:03,594 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 159 transitions. [2018-01-29 23:55:03,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-01-29 23:55:03,594 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:55:03,594 INFO L350 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] [2018-01-29 23:55:03,594 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_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-29 23:55:03,595 INFO L82 PathProgramCache]: Analyzing trace with hash 311971301, now seen corresponding path program 1 times [2018-01-29 23:55:03,595 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:55:03,595 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:55:03,595 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:55:03,596 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:55:03,596 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:55:03,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:55:03,609 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:55:03,680 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-29 23:55:03,680 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:55:03,680 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-29 23:55:03,680 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-29 23:55:03,681 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-29 23:55:03,681 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-01-29 23:55:03,681 INFO L87 Difference]: Start difference. First operand 154 states and 159 transitions. Second operand 10 states. [2018-01-29 23:55:03,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:55:03,745 INFO L93 Difference]: Finished difference Result 241 states and 249 transitions. [2018-01-29 23:55:03,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-29 23:55:03,746 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 82 [2018-01-29 23:55:03,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:55:03,747 INFO L225 Difference]: With dead ends: 241 [2018-01-29 23:55:03,747 INFO L226 Difference]: Without dead ends: 154 [2018-01-29 23:55:03,748 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2018-01-29 23:55:03,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-01-29 23:55:03,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2018-01-29 23:55:03,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-01-29 23:55:03,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 158 transitions. [2018-01-29 23:55:03,767 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 158 transitions. Word has length 82 [2018-01-29 23:55:03,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:55:03,767 INFO L432 AbstractCegarLoop]: Abstraction has 154 states and 158 transitions. [2018-01-29 23:55:03,767 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-29 23:55:03,767 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 158 transitions. [2018-01-29 23:55:03,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-01-29 23:55:03,769 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:55:03,769 INFO L350 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, 1, 1, 1, 1, 1] [2018-01-29 23:55:03,769 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_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-29 23:55:03,769 INFO L82 PathProgramCache]: Analyzing trace with hash -101181527, now seen corresponding path program 1 times [2018-01-29 23:55:03,769 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:55:03,769 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:55:03,771 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:55:03,771 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:55:03,771 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:55:03,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:55:03,794 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:55:04,133 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-29 23:55:04,133 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:55:04,162 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2018-01-29 23:55:04,162 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-01-29 23:55:04,163 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-01-29 23:55:04,163 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=461, Unknown=0, NotChecked=0, Total=506 [2018-01-29 23:55:04,163 INFO L87 Difference]: Start difference. First operand 154 states and 158 transitions. Second operand 23 states. [2018-01-29 23:55:04,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:55:04,719 INFO L93 Difference]: Finished difference Result 195 states and 205 transitions. [2018-01-29 23:55:04,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-01-29 23:55:04,719 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 93 [2018-01-29 23:55:04,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:55:04,720 INFO L225 Difference]: With dead ends: 195 [2018-01-29 23:55:04,721 INFO L226 Difference]: Without dead ends: 193 [2018-01-29 23:55:04,721 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=81, Invalid=911, Unknown=0, NotChecked=0, Total=992 [2018-01-29 23:55:04,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-01-29 23:55:04,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 187. [2018-01-29 23:55:04,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-01-29 23:55:04,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 197 transitions. [2018-01-29 23:55:04,738 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 197 transitions. Word has length 93 [2018-01-29 23:55:04,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:55:04,738 INFO L432 AbstractCegarLoop]: Abstraction has 187 states and 197 transitions. [2018-01-29 23:55:04,738 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-01-29 23:55:04,738 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 197 transitions. [2018-01-29 23:55:04,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-01-29 23:55:04,739 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:55:04,739 INFO L350 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, 1, 1, 1, 1, 1] [2018-01-29 23:55:04,739 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_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-29 23:55:04,739 INFO L82 PathProgramCache]: Analyzing trace with hash -101181526, now seen corresponding path program 1 times [2018-01-29 23:55:04,739 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:55:04,739 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:55:04,740 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:55:04,740 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:55:04,740 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:55:04,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:55:04,758 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:55:04,929 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-29 23:55:04,929 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:55:04,929 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-29 23:55:04,935 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:55:04,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:55:04,979 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:55:05,001 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-29 23:55:05,022 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:55:05,022 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-01-29 23:55:05,023 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-29 23:55:05,023 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-29 23:55:05,023 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2018-01-29 23:55:05,023 INFO L87 Difference]: Start difference. First operand 187 states and 197 transitions. Second operand 10 states. [2018-01-29 23:55:05,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:55:05,088 INFO L93 Difference]: Finished difference Result 334 states and 354 transitions. [2018-01-29 23:55:05,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-29 23:55:05,091 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 93 [2018-01-29 23:55:05,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:55:05,093 INFO L225 Difference]: With dead ends: 334 [2018-01-29 23:55:05,093 INFO L226 Difference]: Without dead ends: 194 [2018-01-29 23:55:05,094 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2018-01-29 23:55:05,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-01-29 23:55:05,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 191. [2018-01-29 23:55:05,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-01-29 23:55:05,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 201 transitions. [2018-01-29 23:55:05,118 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 201 transitions. Word has length 93 [2018-01-29 23:55:05,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:55:05,119 INFO L432 AbstractCegarLoop]: Abstraction has 191 states and 201 transitions. [2018-01-29 23:55:05,119 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-29 23:55:05,119 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 201 transitions. [2018-01-29 23:55:05,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-01-29 23:55:05,120 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:55:05,120 INFO L350 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, 1, 1, 1, 1, 1] [2018-01-29 23:55:05,121 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_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-29 23:55:05,121 INFO L82 PathProgramCache]: Analyzing trace with hash -1916830424, now seen corresponding path program 2 times [2018-01-29 23:55:05,121 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:55:05,121 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:55:05,122 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:55:05,122 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:55:05,122 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:55:05,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:55:05,147 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:55:05,275 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-29 23:55:05,276 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:55:05,276 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-29 23:55:05,301 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-29 23:55:05,349 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:55:05,356 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:55:05,363 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:55:05,376 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-29 23:55:05,376 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:55:05,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 17 treesize of output 16 [2018-01-29 23:55:05,399 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:55:05,415 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-29 23:55:05,416 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:36 [2018-01-29 23:55:06,687 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-29 23:55:06,709 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-29 23:55:06,710 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [10] total 31 [2018-01-29 23:55:06,710 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-01-29 23:55:06,710 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-01-29 23:55:06,711 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=815, Unknown=0, NotChecked=0, Total=930 [2018-01-29 23:55:06,711 INFO L87 Difference]: Start difference. First operand 191 states and 201 transitions. Second operand 31 states. [2018-01-29 23:55:09,089 WARN L143 SmtUtils]: Spent 2024ms on a formula simplification that was a NOOP. DAG size: 31 [2018-01-29 23:55:11,208 WARN L143 SmtUtils]: Spent 2018ms on a formula simplification that was a NOOP. DAG size: 31 [2018-01-29 23:55:12,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:55:12,798 INFO L93 Difference]: Finished difference Result 336 states and 358 transitions. [2018-01-29 23:55:12,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-01-29 23:55:12,799 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 97 [2018-01-29 23:55:12,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:55:12,800 INFO L225 Difference]: With dead ends: 336 [2018-01-29 23:55:12,800 INFO L226 Difference]: Without dead ends: 196 [2018-01-29 23:55:12,801 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=252, Invalid=2004, Unknown=0, NotChecked=0, Total=2256 [2018-01-29 23:55:12,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-01-29 23:55:12,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 193. [2018-01-29 23:55:12,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-01-29 23:55:12,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 201 transitions. [2018-01-29 23:55:12,819 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 201 transitions. Word has length 97 [2018-01-29 23:55:12,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:55:12,819 INFO L432 AbstractCegarLoop]: Abstraction has 193 states and 201 transitions. [2018-01-29 23:55:12,820 INFO L433 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-01-29 23:55:12,820 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 201 transitions. [2018-01-29 23:55:12,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-01-29 23:55:12,821 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:55:12,821 INFO L350 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 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] [2018-01-29 23:55:12,821 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_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-29 23:55:12,821 INFO L82 PathProgramCache]: Analyzing trace with hash -1578756499, now seen corresponding path program 1 times [2018-01-29 23:55:12,821 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:55:12,822 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:55:12,823 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:55:12,823 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:55:12,823 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:55:12,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:55:12,842 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:55:13,002 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-01-29 23:55:13,002 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:55:13,002 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-29 23:55:13,010 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:55:13,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:55:13,050 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:55:13,163 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-29 23:55:13,185 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:55:13,185 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 22 [2018-01-29 23:55:13,185 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-01-29 23:55:13,186 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-01-29 23:55:13,186 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=393, Unknown=0, NotChecked=0, Total=462 [2018-01-29 23:55:13,186 INFO L87 Difference]: Start difference. First operand 193 states and 201 transitions. Second operand 22 states. [2018-01-29 23:55:13,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:55:13,457 INFO L93 Difference]: Finished difference Result 342 states and 358 transitions. [2018-01-29 23:55:13,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-01-29 23:55:13,457 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 101 [2018-01-29 23:55:13,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:55:13,458 INFO L225 Difference]: With dead ends: 342 [2018-01-29 23:55:13,458 INFO L226 Difference]: Without dead ends: 198 [2018-01-29 23:55:13,459 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=97, Invalid=715, Unknown=0, NotChecked=0, Total=812 [2018-01-29 23:55:13,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-01-29 23:55:13,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 195. [2018-01-29 23:55:13,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-01-29 23:55:13,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 201 transitions. [2018-01-29 23:55:13,486 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 201 transitions. Word has length 101 [2018-01-29 23:55:13,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:55:13,486 INFO L432 AbstractCegarLoop]: Abstraction has 195 states and 201 transitions. [2018-01-29 23:55:13,487 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-01-29 23:55:13,487 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 201 transitions. [2018-01-29 23:55:13,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-01-29 23:55:13,488 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:55:13,488 INFO L350 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] [2018-01-29 23:55:13,488 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_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-29 23:55:13,488 INFO L82 PathProgramCache]: Analyzing trace with hash 1204062251, now seen corresponding path program 1 times [2018-01-29 23:55:13,488 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:55:13,488 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:55:13,490 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:55:13,490 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:55:13,490 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:55:13,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:55:13,516 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:55:13,995 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-29 23:55:13,996 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:55:13,996 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2018-01-29 23:55:13,996 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-01-29 23:55:13,996 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-01-29 23:55:13,997 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=755, Unknown=0, NotChecked=0, Total=812 [2018-01-29 23:55:13,997 INFO L87 Difference]: Start difference. First operand 195 states and 201 transitions. Second operand 29 states. [2018-01-29 23:55:14,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:55:14,636 INFO L93 Difference]: Finished difference Result 211 states and 221 transitions. [2018-01-29 23:55:14,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-01-29 23:55:14,636 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 124 [2018-01-29 23:55:14,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:55:14,637 INFO L225 Difference]: With dead ends: 211 [2018-01-29 23:55:14,638 INFO L226 Difference]: Without dead ends: 209 [2018-01-29 23:55:14,638 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=115, Invalid=1607, Unknown=0, NotChecked=0, Total=1722 [2018-01-29 23:55:14,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-01-29 23:55:14,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 204. [2018-01-29 23:55:14,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-01-29 23:55:14,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 214 transitions. [2018-01-29 23:55:14,657 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 214 transitions. Word has length 124 [2018-01-29 23:55:14,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:55:14,657 INFO L432 AbstractCegarLoop]: Abstraction has 204 states and 214 transitions. [2018-01-29 23:55:14,657 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-01-29 23:55:14,658 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 214 transitions. [2018-01-29 23:55:14,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-01-29 23:55:14,658 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:55:14,658 INFO L350 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] [2018-01-29 23:55:14,658 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_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-29 23:55:14,658 INFO L82 PathProgramCache]: Analyzing trace with hash 1204062252, now seen corresponding path program 1 times [2018-01-29 23:55:14,659 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:55:14,659 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:55:14,659 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:55:14,659 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:55:14,659 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:55:14,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:55:14,678 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:55:14,872 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-29 23:55:14,873 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:55:14,873 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-29 23:55:14,878 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:55:14,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:55:14,930 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:55:14,953 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-29 23:55:14,974 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:55:14,974 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-01-29 23:55:14,974 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-29 23:55:14,975 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-29 23:55:14,975 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2018-01-29 23:55:14,975 INFO L87 Difference]: Start difference. First operand 204 states and 214 transitions. Second operand 13 states. [2018-01-29 23:55:15,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:55:15,052 INFO L93 Difference]: Finished difference Result 356 states and 376 transitions. [2018-01-29 23:55:15,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-29 23:55:15,052 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 124 [2018-01-29 23:55:15,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:55:15,053 INFO L225 Difference]: With dead ends: 356 [2018-01-29 23:55:15,053 INFO L226 Difference]: Without dead ends: 211 [2018-01-29 23:55:15,054 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=110, Unknown=0, NotChecked=0, Total=182 [2018-01-29 23:55:15,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-01-29 23:55:15,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 208. [2018-01-29 23:55:15,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-01-29 23:55:15,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 218 transitions. [2018-01-29 23:55:15,083 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 218 transitions. Word has length 124 [2018-01-29 23:55:15,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:55:15,083 INFO L432 AbstractCegarLoop]: Abstraction has 208 states and 218 transitions. [2018-01-29 23:55:15,083 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-29 23:55:15,083 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 218 transitions. [2018-01-29 23:55:15,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-01-29 23:55:15,084 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:55:15,085 INFO L350 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] [2018-01-29 23:55:15,085 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_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-29 23:55:15,085 INFO L82 PathProgramCache]: Analyzing trace with hash 202371822, now seen corresponding path program 2 times [2018-01-29 23:55:15,085 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:55:15,085 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:55:15,086 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:55:15,086 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:55:15,086 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:55:15,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:55:15,114 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:55:15,313 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:55:15,313 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:55:15,313 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-29 23:55:15,321 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-29 23:55:15,364 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:55:15,371 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:55:15,376 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:55:15,392 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-29 23:55:15,393 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:55:15,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-29 23:55:15,526 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:55:15,591 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-29 23:55:15,592 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:36 [2018-01-29 23:55:17,967 WARN L143 SmtUtils]: Spent 2011ms on a formula simplification that was a NOOP. DAG size: 21 [2018-01-29 23:55:19,228 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-29 23:55:19,249 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-29 23:55:19,249 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [28] imperfect sequences [13] total 40 [2018-01-29 23:55:19,250 INFO L409 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-01-29 23:55:19,250 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-01-29 23:55:19,250 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=1391, Unknown=0, NotChecked=0, Total=1560 [2018-01-29 23:55:19,251 INFO L87 Difference]: Start difference. First operand 208 states and 218 transitions. Second operand 40 states. [2018-01-29 23:55:23,912 WARN L143 SmtUtils]: Spent 4026ms on a formula simplification that was a NOOP. DAG size: 35 [2018-01-29 23:55:26,005 WARN L143 SmtUtils]: Spent 2022ms on a formula simplification that was a NOOP. DAG size: 35 [2018-01-29 23:55:33,758 WARN L143 SmtUtils]: Spent 7576ms on a formula simplification that was a NOOP. DAG size: 36 [2018-01-29 23:55:35,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:55:35,308 INFO L93 Difference]: Finished difference Result 358 states and 380 transitions. [2018-01-29 23:55:35,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-01-29 23:55:35,308 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 128 [2018-01-29 23:55:35,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:55:35,309 INFO L225 Difference]: With dead ends: 358 [2018-01-29 23:55:35,309 INFO L226 Difference]: Without dead ends: 213 [2018-01-29 23:55:35,310 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 99 SyntacticMatches, 3 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 901 ImplicationChecksByTransitivity, 18.2s TimeCoverageRelationStatistics Valid=399, Invalid=3633, Unknown=0, NotChecked=0, Total=4032 [2018-01-29 23:55:35,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2018-01-29 23:55:35,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 210. [2018-01-29 23:55:35,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-01-29 23:55:35,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 219 transitions. [2018-01-29 23:55:35,334 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 219 transitions. Word has length 128 [2018-01-29 23:55:35,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:55:35,334 INFO L432 AbstractCegarLoop]: Abstraction has 210 states and 219 transitions. [2018-01-29 23:55:35,334 INFO L433 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-01-29 23:55:35,334 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 219 transitions. [2018-01-29 23:55:35,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-01-29 23:55:35,335 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:55:35,335 INFO L350 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] [2018-01-29 23:55:35,335 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_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-29 23:55:35,335 INFO L82 PathProgramCache]: Analyzing trace with hash 465695045, now seen corresponding path program 1 times [2018-01-29 23:55:35,335 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:55:35,336 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:55:35,336 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:55:35,336 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:55:35,336 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:55:35,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:55:35,359 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:55:35,577 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-29 23:55:35,577 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:55:35,577 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-29 23:55:35,583 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:55:35,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:55:35,642 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:55:35,658 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-29 23:55:35,678 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:55:35,678 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2018-01-29 23:55:35,679 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-29 23:55:35,679 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-29 23:55:35,679 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=117, Unknown=0, NotChecked=0, Total=210 [2018-01-29 23:55:35,679 INFO L87 Difference]: Start difference. First operand 210 states and 219 transitions. Second operand 15 states. [2018-01-29 23:55:35,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:55:35,749 INFO L93 Difference]: Finished difference Result 360 states and 378 transitions. [2018-01-29 23:55:35,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-29 23:55:35,749 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 137 [2018-01-29 23:55:35,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:55:35,751 INFO L225 Difference]: With dead ends: 360 [2018-01-29 23:55:35,751 INFO L226 Difference]: Without dead ends: 217 [2018-01-29 23:55:35,751 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=97, Invalid=143, Unknown=0, NotChecked=0, Total=240 [2018-01-29 23:55:35,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-01-29 23:55:35,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 214. [2018-01-29 23:55:35,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2018-01-29 23:55:35,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 223 transitions. [2018-01-29 23:55:35,773 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 223 transitions. Word has length 137 [2018-01-29 23:55:35,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:55:35,774 INFO L432 AbstractCegarLoop]: Abstraction has 214 states and 223 transitions. [2018-01-29 23:55:35,774 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-29 23:55:35,774 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 223 transitions. [2018-01-29 23:55:35,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-01-29 23:55:35,775 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:55:35,775 INFO L350 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] [2018-01-29 23:55:35,775 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_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-29 23:55:35,775 INFO L82 PathProgramCache]: Analyzing trace with hash -387608125, now seen corresponding path program 2 times [2018-01-29 23:55:35,775 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:55:35,775 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:55:35,776 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:55:35,776 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:55:35,776 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:55:35,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:55:35,793 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:55:35,974 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-29 23:55:35,975 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:55:35,975 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-29 23:55:35,980 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-29 23:55:36,025 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:55:36,041 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:55:36,043 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:55:36,048 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:55:36,070 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-29 23:55:36,102 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:55:36,103 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2018-01-29 23:55:36,103 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-01-29 23:55:36,103 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-01-29 23:55:36,103 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=133, Unknown=0, NotChecked=0, Total=240 [2018-01-29 23:55:36,104 INFO L87 Difference]: Start difference. First operand 214 states and 223 transitions. Second operand 16 states. [2018-01-29 23:55:36,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:55:36,180 INFO L93 Difference]: Finished difference Result 364 states and 382 transitions. [2018-01-29 23:55:36,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-29 23:55:36,181 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 141 [2018-01-29 23:55:36,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:55:36,182 INFO L225 Difference]: With dead ends: 364 [2018-01-29 23:55:36,182 INFO L226 Difference]: Without dead ends: 221 [2018-01-29 23:55:36,183 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=111, Invalid=161, Unknown=0, NotChecked=0, Total=272 [2018-01-29 23:55:36,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-01-29 23:55:36,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 218. [2018-01-29 23:55:36,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-01-29 23:55:36,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 227 transitions. [2018-01-29 23:55:36,205 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 227 transitions. Word has length 141 [2018-01-29 23:55:36,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:55:36,205 INFO L432 AbstractCegarLoop]: Abstraction has 218 states and 227 transitions. [2018-01-29 23:55:36,205 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-01-29 23:55:36,206 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 227 transitions. [2018-01-29 23:55:36,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-01-29 23:55:36,207 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:55:36,207 INFO L350 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] [2018-01-29 23:55:36,208 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_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-29 23:55:36,208 INFO L82 PathProgramCache]: Analyzing trace with hash 1109967681, now seen corresponding path program 3 times [2018-01-29 23:55:36,208 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:55:36,208 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:55:36,209 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:55:36,209 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:55:36,209 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:55:36,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:55:36,234 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:55:36,523 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-29 23:55:36,523 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:55:36,523 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-29 23:55:36,533 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-29 23:55:36,584 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:55:36,601 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:55:36,635 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:55:36,698 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:55:36,797 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:55:37,006 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:55:37,106 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:55:37,211 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:55:37,250 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:55:37,951 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:55:38,092 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:55:38,568 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:55:39,228 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:55:39,230 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:55:39,238 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:55:39,260 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-29 23:55:39,282 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:55:39,282 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-01-29 23:55:39,282 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-29 23:55:39,283 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-29 23:55:39,283 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=150, Unknown=0, NotChecked=0, Total=272 [2018-01-29 23:55:39,283 INFO L87 Difference]: Start difference. First operand 218 states and 227 transitions. Second operand 17 states. [2018-01-29 23:55:39,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:55:39,361 INFO L93 Difference]: Finished difference Result 368 states and 386 transitions. [2018-01-29 23:55:39,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-29 23:55:39,362 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 145 [2018-01-29 23:55:39,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:55:39,363 INFO L225 Difference]: With dead ends: 368 [2018-01-29 23:55:39,363 INFO L226 Difference]: Without dead ends: 225 [2018-01-29 23:55:39,363 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 145 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-29 23:55:39,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-01-29 23:55:39,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 222. [2018-01-29 23:55:39,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2018-01-29 23:55:39,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 231 transitions. [2018-01-29 23:55:39,386 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 231 transitions. Word has length 145 [2018-01-29 23:55:39,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:55:39,386 INFO L432 AbstractCegarLoop]: Abstraction has 222 states and 231 transitions. [2018-01-29 23:55:39,386 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-29 23:55:39,386 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 231 transitions. [2018-01-29 23:55:39,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-01-29 23:55:39,387 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:55:39,387 INFO L350 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] [2018-01-29 23:55:39,387 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_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-29 23:55:39,388 INFO L82 PathProgramCache]: Analyzing trace with hash -77920833, now seen corresponding path program 4 times [2018-01-29 23:55:39,388 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:55:39,388 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:55:39,389 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:55:39,389 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:55:39,389 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:55:39,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:55:39,408 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:55:39,636 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-29 23:55:39,636 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:55:39,636 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-29 23:55:39,643 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-29 23:55:39,827 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:55:39,832 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:55:39,862 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-29 23:55:39,883 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:55:39,883 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2018-01-29 23:55:39,883 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-29 23:55:39,883 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-29 23:55:39,883 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=168, Unknown=0, NotChecked=0, Total=306 [2018-01-29 23:55:39,884 INFO L87 Difference]: Start difference. First operand 222 states and 231 transitions. Second operand 18 states. [2018-01-29 23:55:39,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:55:39,961 INFO L93 Difference]: Finished difference Result 372 states and 390 transitions. [2018-01-29 23:55:39,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-01-29 23:55:39,961 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 149 [2018-01-29 23:55:39,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:55:39,962 INFO L225 Difference]: With dead ends: 372 [2018-01-29 23:55:39,962 INFO L226 Difference]: Without dead ends: 229 [2018-01-29 23:55:39,963 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=142, Invalid=200, Unknown=0, NotChecked=0, Total=342 [2018-01-29 23:55:39,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-01-29 23:55:39,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 226. [2018-01-29 23:55:39,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2018-01-29 23:55:39,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 235 transitions. [2018-01-29 23:55:39,985 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 235 transitions. Word has length 149 [2018-01-29 23:55:39,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:55:39,985 INFO L432 AbstractCegarLoop]: Abstraction has 226 states and 235 transitions. [2018-01-29 23:55:39,985 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-29 23:55:39,985 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 235 transitions. [2018-01-29 23:55:39,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-01-29 23:55:39,986 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:55:39,986 INFO L350 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:55:39,986 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_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-29 23:55:39,986 INFO L82 PathProgramCache]: Analyzing trace with hash 1955322173, now seen corresponding path program 5 times [2018-01-29 23:55:39,986 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:55:39,986 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:55:39,987 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:55:39,987 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:55:39,987 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:55:40,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:55:40,003 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:55:40,226 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:55:40,226 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:55:40,226 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-29 23:55:40,232 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-29 23:55:40,250 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:55:40,255 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:55:40,257 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:55:40,260 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:55:40,266 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:55:40,285 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:55:40,303 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:55:40,335 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:55:40,348 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:55:40,410 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:55:40,431 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:55:40,483 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:55:40,609 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:55:40,655 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:55:40,832 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:55:40,837 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:55:40,842 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:55:40,871 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:55:40,892 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:55:40,892 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2018-01-29 23:55:40,892 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-29 23:55:40,892 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-29 23:55:40,893 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=187, Unknown=0, NotChecked=0, Total=342 [2018-01-29 23:55:40,893 INFO L87 Difference]: Start difference. First operand 226 states and 235 transitions. Second operand 19 states. [2018-01-29 23:55:40,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:55:40,988 INFO L93 Difference]: Finished difference Result 376 states and 394 transitions. [2018-01-29 23:55:40,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-29 23:55:40,989 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 153 [2018-01-29 23:55:40,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:55:40,990 INFO L225 Difference]: With dead ends: 376 [2018-01-29 23:55:40,990 INFO L226 Difference]: Without dead ends: 233 [2018-01-29 23:55:40,990 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=159, Invalid=221, Unknown=0, NotChecked=0, Total=380 [2018-01-29 23:55:40,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-01-29 23:55:41,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 230. [2018-01-29 23:55:41,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2018-01-29 23:55:41,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 239 transitions. [2018-01-29 23:55:41,013 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 239 transitions. Word has length 153 [2018-01-29 23:55:41,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:55:41,014 INFO L432 AbstractCegarLoop]: Abstraction has 230 states and 239 transitions. [2018-01-29 23:55:41,014 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-01-29 23:55:41,014 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 239 transitions. [2018-01-29 23:55:41,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-01-29 23:55:41,015 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:55:41,015 INFO L350 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:55:41,015 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_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-29 23:55:41,015 INFO L82 PathProgramCache]: Analyzing trace with hash 2047524283, now seen corresponding path program 6 times [2018-01-29 23:55:41,015 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:55:41,015 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:55:41,016 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:55:41,016 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:55:41,016 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:55:41,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:55:41,032 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:55:41,326 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:55:41,326 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:55:41,326 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-29 23:55:41,331 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-29 23:55:41,370 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:55:41,382 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:55:41,393 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:55:41,540 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:55:41,622 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:55:41,837 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:55:42,326 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:55:45,294 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:55:49,584 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:55:52,394 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:55:53,890 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:55:56,575 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:55:56,986 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:55:57,305 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:56:03,696 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:56:08,231 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:56:08,235 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:56:08,250 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:56:08,580 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:56:08,604 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:56:08,604 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 24] total 41 [2018-01-29 23:56:08,605 INFO L409 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-01-29 23:56:08,605 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-01-29 23:56:08,606 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=472, Invalid=1168, Unknown=0, NotChecked=0, Total=1640 [2018-01-29 23:56:08,606 INFO L87 Difference]: Start difference. First operand 230 states and 239 transitions. Second operand 41 states. [2018-01-29 23:56:08,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:56:08,812 INFO L93 Difference]: Finished difference Result 380 states and 398 transitions. [2018-01-29 23:56:08,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-01-29 23:56:08,846 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 157 [2018-01-29 23:56:08,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:56:08,847 INFO L225 Difference]: With dead ends: 380 [2018-01-29 23:56:08,847 INFO L226 Difference]: Without dead ends: 237 [2018-01-29 23:56:08,847 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 670 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=522, Invalid=1458, Unknown=0, NotChecked=0, Total=1980 [2018-01-29 23:56:08,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2018-01-29 23:56:08,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 234. [2018-01-29 23:56:08,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2018-01-29 23:56:08,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 243 transitions. [2018-01-29 23:56:08,885 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 243 transitions. Word has length 157 [2018-01-29 23:56:08,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:56:08,886 INFO L432 AbstractCegarLoop]: Abstraction has 234 states and 243 transitions. [2018-01-29 23:56:08,886 INFO L433 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-01-29 23:56:08,886 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 243 transitions. [2018-01-29 23:56:08,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-01-29 23:56:08,887 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:56:08,887 INFO L350 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:56:08,887 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_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-29 23:56:08,887 INFO L82 PathProgramCache]: Analyzing trace with hash 610743097, now seen corresponding path program 7 times [2018-01-29 23:56:08,888 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:56:08,888 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:56:08,888 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:56:08,889 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:56:08,889 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:56:08,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:56:08,973 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:56:13,743 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:56:13,743 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:56:13,743 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-29 23:56:13,748 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:56:13,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:56:13,820 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:56:13,985 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-29 23:56:13,987 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-29 23:56:13,987 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:56:13,989 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:56:13,993 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:56:13,993 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-01-29 23:56:14,135 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-29 23:56:14,138 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:14,140 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-29 23:56:14,141 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:56:14,146 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:56:14,151 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:56:14,151 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2018-01-29 23:56:14,308 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-29 23:56:14,310 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:14,311 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:14,312 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:14,312 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-29 23:56:14,313 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:56:14,321 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:56:14,330 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-29 23:56:14,331 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:43 [2018-01-29 23:56:14,520 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-29 23:56:14,524 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:14,525 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:14,526 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:14,527 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:14,528 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:14,529 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:14,530 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-29 23:56:14,530 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:56:14,544 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:56:14,557 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-29 23:56:14,557 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:63, output treesize:59 [2018-01-29 23:56:14,807 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-29 23:56:14,810 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:14,811 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:14,812 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:14,813 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:14,813 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:14,814 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:14,815 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:14,816 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:14,818 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:14,819 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:14,820 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-29 23:56:14,821 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:56:14,841 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:56:14,858 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-29 23:56:14,859 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:79, output treesize:75 [2018-01-29 23:56:15,447 WARN L143 SmtUtils]: Spent 456ms on a formula simplification that was a NOOP. DAG size: 38 [2018-01-29 23:56:15,568 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-29 23:56:15,573 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:15,574 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:15,575 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:15,576 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:15,576 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:15,577 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:15,578 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:15,579 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:15,580 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:15,580 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:15,581 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:15,582 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:15,583 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:15,584 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:15,585 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:15,585 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-29 23:56:15,586 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:56:15,622 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:56:15,641 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-29 23:56:15,641 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:95, output treesize:91 [2018-01-29 23:56:15,882 WARN L143 SmtUtils]: Spent 127ms on a formula simplification that was a NOOP. DAG size: 44 [2018-01-29 23:56:16,088 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-29 23:56:16,094 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:16,096 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:16,097 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:16,098 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:16,099 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:16,100 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:16,101 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:16,102 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:16,104 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:16,105 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:16,106 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:16,107 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:16,108 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:16,109 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:16,111 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:16,113 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:16,114 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:16,116 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:16,117 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:16,119 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:16,120 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:16,121 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-29 23:56:16,122 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:56:16,168 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:56:16,190 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-29 23:56:16,191 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:111, output treesize:107 [2018-01-29 23:56:17,140 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-29 23:56:17,144 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:17,145 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:17,146 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:17,147 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:17,148 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:17,149 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:17,150 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:17,151 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:17,152 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:17,153 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:17,154 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:17,155 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:17,156 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:17,157 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:17,157 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:17,158 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:17,159 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:17,160 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:17,162 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:17,163 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:17,164 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:17,165 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:17,166 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:17,167 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:17,168 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:17,169 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:17,170 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:17,170 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:17,172 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-29 23:56:17,172 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:56:17,235 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:56:17,262 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-29 23:56:17,262 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:127, output treesize:123 [2018-01-29 23:56:26,603 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-29 23:56:26,608 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:26,609 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:26,610 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:26,611 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:26,612 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:26,613 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:26,614 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:26,615 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:26,616 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:26,617 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:26,618 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:26,619 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:26,620 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:26,621 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:26,622 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:26,623 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:26,624 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:26,625 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:26,626 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:26,627 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:26,628 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:26,629 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:26,631 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:26,632 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:26,633 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:26,634 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:26,635 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:26,636 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:26,637 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:26,638 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:26,639 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:26,640 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:26,641 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:26,641 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:26,642 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:26,643 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:26,645 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-29 23:56:26,645 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:56:26,730 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:56:26,774 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-29 23:56:26,774 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:143, output treesize:139 [2018-01-29 23:56:34,030 WARN L143 SmtUtils]: Spent 227ms on a formula simplification that was a NOOP. DAG size: 62 [2018-01-29 23:56:55,538 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-29 23:56:55,544 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:55,546 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:55,547 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:55,548 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:55,550 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:55,551 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:55,553 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:55,555 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:55,557 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:55,558 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:55,559 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:55,560 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:55,562 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:55,563 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:55,565 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:55,567 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:55,568 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:55,569 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:55,571 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:55,573 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:55,574 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:55,575 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:55,577 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:55,578 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:55,580 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:55,581 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:55,583 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:55,584 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:55,585 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:55,587 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:55,589 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:55,590 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:55,592 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:55,593 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:55,595 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:55,596 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:55,598 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:55,599 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:55,600 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:55,601 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:55,602 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:55,603 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:55,604 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:55,605 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:55,606 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:55,608 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-29 23:56:55,609 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:56:55,725 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:56:55,762 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-29 23:56:55,763 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:159, output treesize:155 Received shutdown request... [2018-01-29 23:57:06,597 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-29 23:57:06,597 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-29 23:57:06,602 WARN L185 ceAbstractionStarter]: Timeout [2018-01-29 23:57:06,602 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.01 11:57:06 BoogieIcfgContainer [2018-01-29 23:57:06,602 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-29 23:57:06,603 INFO L168 Benchmark]: Toolchain (without parser) took 140217.48 ms. Allocated memory was 303.0 MB in the beginning and 965.7 MB in the end (delta: 662.7 MB). Free memory was 259.9 MB in the beginning and 814.1 MB in the end (delta: -554.2 MB). Peak memory consumption was 108.5 MB. Max. memory is 5.3 GB. [2018-01-29 23:57:06,604 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 303.0 MB. Free memory is still 268.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-29 23:57:06,604 INFO L168 Benchmark]: CACSL2BoogieTranslator took 232.27 ms. Allocated memory is still 303.0 MB. Free memory was 259.9 MB in the beginning and 245.7 MB in the end (delta: 14.2 MB). Peak memory consumption was 14.2 MB. Max. memory is 5.3 GB. [2018-01-29 23:57:06,604 INFO L168 Benchmark]: Boogie Preprocessor took 43.60 ms. Allocated memory is still 303.0 MB. Free memory was 245.7 MB in the beginning and 243.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 5.3 GB. [2018-01-29 23:57:06,604 INFO L168 Benchmark]: RCFGBuilder took 501.84 ms. Allocated memory is still 303.0 MB. Free memory was 243.7 MB in the beginning and 209.5 MB in the end (delta: 34.2 MB). Peak memory consumption was 34.2 MB. Max. memory is 5.3 GB. [2018-01-29 23:57:06,605 INFO L168 Benchmark]: TraceAbstraction took 139431.81 ms. Allocated memory was 303.0 MB in the beginning and 965.7 MB in the end (delta: 662.7 MB). Free memory was 208.5 MB in the beginning and 814.1 MB in the end (delta: -605.6 MB). Peak memory consumption was 57.1 MB. Max. memory is 5.3 GB. [2018-01-29 23:57:06,607 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 303.0 MB. Free memory is still 268.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 232.27 ms. Allocated memory is still 303.0 MB. Free memory was 259.9 MB in the beginning and 245.7 MB in the end (delta: 14.2 MB). Peak memory consumption was 14.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 43.60 ms. Allocated memory is still 303.0 MB. Free memory was 245.7 MB in the beginning and 243.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 5.3 GB. * RCFGBuilder took 501.84 ms. Allocated memory is still 303.0 MB. Free memory was 243.7 MB in the beginning and 209.5 MB in the end (delta: 34.2 MB). Peak memory consumption was 34.2 MB. Max. memory is 5.3 GB. * TraceAbstraction took 139431.81 ms. Allocated memory was 303.0 MB in the beginning and 965.7 MB in the end (delta: 662.7 MB). Free memory was 208.5 MB in the beginning and 814.1 MB in the end (delta: -605.6 MB). Peak memory consumption was 57.1 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 162 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 83 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 162 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 83 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 162 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 83 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 162 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 83 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 162 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 83 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 162 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 83 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 162 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 83 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 162 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 83 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1344). Cancelled while BasicCegarLoop was analyzing trace of length 162 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 83 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1340). Cancelled while BasicCegarLoop was analyzing trace of length 162 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 83 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1344). Cancelled while BasicCegarLoop was analyzing trace of length 162 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 83 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1340). Cancelled while BasicCegarLoop was analyzing trace of length 162 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 83 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 162 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 83 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 162 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 83 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 162 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 83 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 162 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 83 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 162 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 83 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 162 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 83 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 162 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 83 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 19 procedures, 151 locations, 19 error locations. TIMEOUT Result, 139.3s OverallTime, 29 OverallIterations, 16 TraceHistogramMax, 34.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3673 SDtfs, 1527 SDslu, 33710 SDs, 0 SdLazy, 9178 SolverSat, 251 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2066 GetRequests, 1558 SyntacticMatches, 5 SemanticMatches, 503 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2778 ImplicationChecksByTransitivity, 38.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=234occurred in iteration=28, 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.5s AutomataMinimizationTime, 28 MinimizatonAttempts, 86 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 31.0s SatisfiabilityAnalysisTime, 13.9s InterpolantComputationTime, 3970 NumberOfCodeBlocks, 3886 NumberOfCodeBlocksAsserted, 86 NumberOfCheckSat, 3927 ConstructedInterpolants, 268 QuantifiedInterpolants, 1620044 SizeOfPredicates, 84 NumberOfNonLiveVariables, 5505 ConjunctsInSsa, 438 ConjunctsInUnsatCore, 43 InterpolantComputations, 17 PerfectInterpolantSequences, 627/5006 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_5_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-29_23-57-06-614.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_5_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-29_23-57-06-614.csv Completed graceful shutdown