java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test22_3_false-valid-deref.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-5f7ec6e [2018-01-31 08:57:59,424 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-31 08:57:59,425 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-31 08:57:59,442 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-31 08:57:59,442 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-31 08:57:59,443 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-31 08:57:59,444 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-31 08:57:59,446 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-31 08:57:59,448 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-31 08:57:59,449 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-31 08:57:59,450 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-31 08:57:59,450 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-31 08:57:59,451 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-31 08:57:59,455 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-31 08:57:59,456 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-31 08:57:59,469 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-31 08:57:59,471 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-31 08:57:59,472 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-31 08:57:59,474 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-31 08:57:59,475 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-31 08:57:59,479 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-31 08:57:59,479 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-31 08:57:59,479 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-31 08:57:59,480 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-31 08:57:59,481 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-31 08:57:59,483 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-31 08:57:59,483 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-31 08:57:59,483 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-31 08:57:59,484 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-31 08:57:59,484 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-31 08:57:59,484 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-31 08:57:59,485 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-31 08:57:59,495 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-31 08:57:59,495 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-31 08:57:59,496 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-31 08:57:59,496 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-31 08:57:59,496 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-31 08:57:59,497 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-31 08:57:59,497 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-31 08:57:59,497 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-31 08:57:59,497 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-31 08:57:59,498 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-31 08:57:59,498 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-31 08:57:59,498 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-31 08:57:59,498 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-31 08:57:59,498 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-31 08:57:59,499 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-31 08:57:59,499 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-31 08:57:59,499 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-31 08:57:59,499 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-31 08:57:59,499 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-31 08:57:59,500 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-31 08:57:59,500 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-31 08:57:59,500 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-31 08:57:59,500 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-31 08:57:59,500 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-31 08:57:59,500 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-31 08:57:59,501 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-31 08:57:59,501 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-31 08:57:59,501 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-31 08:57:59,501 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-31 08:57:59,501 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-31 08:57:59,502 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-31 08:57:59,502 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-31 08:57:59,502 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-31 08:57:59,503 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-31 08:57:59,557 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-31 08:57:59,571 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-31 08:57:59,576 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-31 08:57:59,578 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-31 08:57:59,578 INFO L276 PluginConnector]: CDTParser initialized [2018-01-31 08:57:59,579 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test22_3_false-valid-deref.i [2018-01-31 08:57:59,804 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-31 08:57:59,813 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-31 08:57:59,816 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-31 08:57:59,816 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-31 08:57:59,823 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-31 08:57:59,824 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 08:57:59" (1/1) ... [2018-01-31 08:57:59,828 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ad862a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:57:59, skipping insertion in model container [2018-01-31 08:57:59,828 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 08:57:59" (1/1) ... [2018-01-31 08:57:59,848 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-31 08:57:59,932 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-31 08:58:00,122 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-31 08:58:00,173 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-31 08:58:00,189 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:58:00 WrapperNode [2018-01-31 08:58:00,189 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-31 08:58:00,190 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-31 08:58:00,190 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-31 08:58:00,194 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-31 08:58:00,209 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:58:00" (1/1) ... [2018-01-31 08:58:00,209 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:58:00" (1/1) ... [2018-01-31 08:58:00,221 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:58:00" (1/1) ... [2018-01-31 08:58:00,221 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:58:00" (1/1) ... [2018-01-31 08:58:00,238 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:58:00" (1/1) ... [2018-01-31 08:58:00,242 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:58:00" (1/1) ... [2018-01-31 08:58:00,244 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:58:00" (1/1) ... [2018-01-31 08:58:00,247 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-31 08:58:00,248 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-31 08:58:00,248 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-31 08:58:00,248 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-31 08:58:00,249 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:58:00" (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-31 08:58:00,319 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-31 08:58:00,319 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-31 08:58:00,319 INFO L136 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2018-01-31 08:58:00,319 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-31 08:58:00,319 INFO L136 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2018-01-31 08:58:00,319 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_atomic_sub_return [2018-01-31 08:58:00,320 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_sub [2018-01-31 08:58:00,320 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_init [2018-01-31 08:58:00,320 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_put [2018-01-31 08:58:00,320 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_cleanup [2018-01-31 08:58:00,320 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_release [2018-01-31 08:58:00,320 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2018-01-31 08:58:00,320 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init_internal [2018-01-31 08:58:00,320 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init [2018-01-31 08:58:00,321 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_create [2018-01-31 08:58:00,321 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-31 08:58:00,321 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-31 08:58:00,321 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-31 08:58:00,321 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-31 08:58:00,321 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-31 08:58:00,322 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-31 08:58:00,322 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-31 08:58:00,322 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-31 08:58:00,322 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-31 08:58:00,322 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2018-01-31 08:58:00,322 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2018-01-31 08:58:00,323 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-31 08:58:00,323 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-31 08:58:00,323 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-31 08:58:00,323 INFO L128 BoogieDeclarations]: Found specification of procedure memset [2018-01-31 08:58:00,323 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-31 08:58:00,323 INFO L128 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2018-01-31 08:58:00,323 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_atomic_sub_return [2018-01-31 08:58:00,324 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_sub [2018-01-31 08:58:00,324 INFO L128 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2018-01-31 08:58:00,324 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_init [2018-01-31 08:58:00,324 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_put [2018-01-31 08:58:00,324 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_cleanup [2018-01-31 08:58:00,324 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_release [2018-01-31 08:58:00,324 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2018-01-31 08:58:00,324 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_init_internal [2018-01-31 08:58:00,324 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_init [2018-01-31 08:58:00,324 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_create [2018-01-31 08:58:00,324 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-31 08:58:00,324 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-31 08:58:00,325 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-31 08:58:00,325 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-31 08:58:00,816 WARN L455 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-01-31 08:58:01,119 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-31 08:58:01,119 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 08:58:01 BoogieIcfgContainer [2018-01-31 08:58:01,119 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-31 08:58:01,120 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-31 08:58:01,120 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-31 08:58:01,125 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-31 08:58:01,125 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 08:57:59" (1/3) ... [2018-01-31 08:58:01,126 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45c4943c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 08:58:01, skipping insertion in model container [2018-01-31 08:58:01,126 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:58:00" (2/3) ... [2018-01-31 08:58:01,126 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45c4943c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 08:58:01, skipping insertion in model container [2018-01-31 08:58:01,126 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 08:58:01" (3/3) ... [2018-01-31 08:58:01,128 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test22_3_false-valid-deref.i [2018-01-31 08:58:01,138 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-31 08:58:01,147 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 19 error locations. [2018-01-31 08:58:01,205 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-31 08:58:01,205 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-31 08:58:01,205 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-31 08:58:01,206 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-31 08:58:01,206 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-31 08:58:01,206 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-31 08:58:01,206 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-31 08:58:01,206 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-31 08:58:01,207 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-31 08:58:01,230 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states. [2018-01-31 08:58:01,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-31 08:58:01,238 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:58:01,239 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:58:01,239 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-31 08:58:01,242 INFO L82 PathProgramCache]: Analyzing trace with hash -970088742, now seen corresponding path program 1 times [2018-01-31 08:58:01,244 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:58:01,244 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:58:01,308 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:58:01,308 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:58:01,309 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:58:01,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:58:01,387 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:58:01,733 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-31 08:58:01,738 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:58:01,738 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-31 08:58:01,740 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-31 08:58:01,854 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-31 08:58:01,854 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-31 08:58:01,857 INFO L87 Difference]: Start difference. First operand 147 states. Second operand 5 states. [2018-01-31 08:58:02,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:58:02,044 INFO L93 Difference]: Finished difference Result 276 states and 291 transitions. [2018-01-31 08:58:02,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-31 08:58:02,048 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-01-31 08:58:02,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:58:02,069 INFO L225 Difference]: With dead ends: 276 [2018-01-31 08:58:02,069 INFO L226 Difference]: Without dead ends: 151 [2018-01-31 08:58:02,074 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-31 08:58:02,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-01-31 08:58:02,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 149. [2018-01-31 08:58:02,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-01-31 08:58:02,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 157 transitions. [2018-01-31 08:58:02,125 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 157 transitions. Word has length 22 [2018-01-31 08:58:02,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:58:02,126 INFO L432 AbstractCegarLoop]: Abstraction has 149 states and 157 transitions. [2018-01-31 08:58:02,126 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-31 08:58:02,126 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 157 transitions. [2018-01-31 08:58:02,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-31 08:58:02,127 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:58:02,127 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:58:02,127 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-31 08:58:02,127 INFO L82 PathProgramCache]: Analyzing trace with hash 1498971100, now seen corresponding path program 1 times [2018-01-31 08:58:02,127 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:58:02,127 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:58:02,129 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:58:02,129 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:58:02,129 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:58:02,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:58:02,159 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:58:02,294 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-31 08:58:02,294 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:58:02,294 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-31 08:58:02,296 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 08:58:02,297 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 08:58:02,297 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-31 08:58:02,297 INFO L87 Difference]: Start difference. First operand 149 states and 157 transitions. Second operand 6 states. [2018-01-31 08:58:02,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:58:02,545 INFO L93 Difference]: Finished difference Result 152 states and 160 transitions. [2018-01-31 08:58:02,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-31 08:58:02,570 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-01-31 08:58:02,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:58:02,573 INFO L225 Difference]: With dead ends: 152 [2018-01-31 08:58:02,573 INFO L226 Difference]: Without dead ends: 151 [2018-01-31 08:58:02,574 INFO L554 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-31 08:58:02,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-01-31 08:58:02,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 148. [2018-01-31 08:58:02,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-01-31 08:58:02,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 156 transitions. [2018-01-31 08:58:02,588 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 156 transitions. Word has length 23 [2018-01-31 08:58:02,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:58:02,589 INFO L432 AbstractCegarLoop]: Abstraction has 148 states and 156 transitions. [2018-01-31 08:58:02,589 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 08:58:02,589 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 156 transitions. [2018-01-31 08:58:02,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-31 08:58:02,590 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:58:02,590 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:58:02,590 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-31 08:58:02,590 INFO L82 PathProgramCache]: Analyzing trace with hash 1498971101, now seen corresponding path program 1 times [2018-01-31 08:58:02,590 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:58:02,591 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:58:02,593 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:58:02,593 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:58:02,593 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:58:02,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:58:02,616 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:58:02,992 WARN L146 SmtUtils]: Spent 225ms on a formula simplification. DAG size of input: 19 DAG size of output 17 [2018-01-31 08:58:03,175 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-31 08:58:03,175 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:58:03,175 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-31 08:58:03,175 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-31 08:58:03,176 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-31 08:58:03,176 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-31 08:58:03,178 INFO L87 Difference]: Start difference. First operand 148 states and 156 transitions. Second operand 7 states. [2018-01-31 08:58:03,523 WARN L143 SmtUtils]: Spent 257ms on a formula simplification that was a NOOP. DAG size: 28 [2018-01-31 08:58:03,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:58:03,905 INFO L93 Difference]: Finished difference Result 151 states and 159 transitions. [2018-01-31 08:58:03,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-31 08:58:03,906 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2018-01-31 08:58:03,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:58:03,909 INFO L225 Difference]: With dead ends: 151 [2018-01-31 08:58:03,909 INFO L226 Difference]: Without dead ends: 150 [2018-01-31 08:58:03,909 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-01-31 08:58:03,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-01-31 08:58:03,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 147. [2018-01-31 08:58:03,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-01-31 08:58:03,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 155 transitions. [2018-01-31 08:58:03,923 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 155 transitions. Word has length 23 [2018-01-31 08:58:03,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:58:03,923 INFO L432 AbstractCegarLoop]: Abstraction has 147 states and 155 transitions. [2018-01-31 08:58:03,923 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-31 08:58:03,923 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 155 transitions. [2018-01-31 08:58:03,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-01-31 08:58:03,925 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:58:03,925 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:58:03,925 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-31 08:58:03,926 INFO L82 PathProgramCache]: Analyzing trace with hash -1204324785, now seen corresponding path program 1 times [2018-01-31 08:58:03,926 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:58:03,926 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:58:03,927 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:58:03,928 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:58:03,928 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:58:03,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:58:03,955 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:58:04,179 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-31 08:58:04,180 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:58:04,180 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-31 08:58:04,180 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-31 08:58:04,181 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-31 08:58:04,181 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-01-31 08:58:04,181 INFO L87 Difference]: Start difference. First operand 147 states and 155 transitions. Second operand 10 states. [2018-01-31 08:58:04,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:58:04,697 INFO L93 Difference]: Finished difference Result 149 states and 157 transitions. [2018-01-31 08:58:04,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-31 08:58:04,698 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 39 [2018-01-31 08:58:04,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:58:04,700 INFO L225 Difference]: With dead ends: 149 [2018-01-31 08:58:04,700 INFO L226 Difference]: Without dead ends: 148 [2018-01-31 08:58:04,700 INFO L554 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-31 08:58:04,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-01-31 08:58:04,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 146. [2018-01-31 08:58:04,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-01-31 08:58:04,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 154 transitions. [2018-01-31 08:58:04,726 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 154 transitions. Word has length 39 [2018-01-31 08:58:04,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:58:04,726 INFO L432 AbstractCegarLoop]: Abstraction has 146 states and 154 transitions. [2018-01-31 08:58:04,726 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-31 08:58:04,726 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 154 transitions. [2018-01-31 08:58:04,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-01-31 08:58:04,728 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:58:04,728 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:58:04,728 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-31 08:58:04,728 INFO L82 PathProgramCache]: Analyzing trace with hash -1204324784, now seen corresponding path program 1 times [2018-01-31 08:58:04,729 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:58:04,729 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:58:04,731 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:58:04,731 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:58:04,731 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:58:04,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:58:04,750 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:58:04,803 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-31 08:58:04,803 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:58:04,803 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-31 08:58:04,803 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-31 08:58:04,803 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-31 08:58:04,803 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-31 08:58:04,804 INFO L87 Difference]: Start difference. First operand 146 states and 154 transitions. Second operand 4 states. [2018-01-31 08:58:04,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:58:04,840 INFO L93 Difference]: Finished difference Result 258 states and 272 transitions. [2018-01-31 08:58:04,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-31 08:58:04,840 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2018-01-31 08:58:04,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:58:04,842 INFO L225 Difference]: With dead ends: 258 [2018-01-31 08:58:04,842 INFO L226 Difference]: Without dead ends: 150 [2018-01-31 08:58:04,843 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-31 08:58:04,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-01-31 08:58:04,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 147. [2018-01-31 08:58:04,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-01-31 08:58:04,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 155 transitions. [2018-01-31 08:58:04,860 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 155 transitions. Word has length 39 [2018-01-31 08:58:04,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:58:04,861 INFO L432 AbstractCegarLoop]: Abstraction has 147 states and 155 transitions. [2018-01-31 08:58:04,861 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-31 08:58:04,861 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 155 transitions. [2018-01-31 08:58:04,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-01-31 08:58:04,862 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:58:04,863 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:58:04,863 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-31 08:58:04,863 INFO L82 PathProgramCache]: Analyzing trace with hash 734700400, now seen corresponding path program 1 times [2018-01-31 08:58:04,863 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:58:04,863 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:58:04,865 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:58:04,865 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:58:04,865 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:58:04,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:58:04,897 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:58:05,067 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-31 08:58:05,067 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:58:05,068 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-31 08:58:05,068 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-31 08:58:05,068 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-31 08:58:05,068 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-31 08:58:05,069 INFO L87 Difference]: Start difference. First operand 147 states and 155 transitions. Second operand 7 states. [2018-01-31 08:58:05,227 WARN L143 SmtUtils]: Spent 109ms on a formula simplification that was a NOOP. DAG size: 10 [2018-01-31 08:58:05,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:58:05,314 INFO L93 Difference]: Finished difference Result 234 states and 249 transitions. [2018-01-31 08:58:05,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-31 08:58:05,315 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2018-01-31 08:58:05,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:58:05,316 INFO L225 Difference]: With dead ends: 234 [2018-01-31 08:58:05,316 INFO L226 Difference]: Without dead ends: 161 [2018-01-31 08:58:05,317 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-01-31 08:58:05,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-01-31 08:58:05,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 157. [2018-01-31 08:58:05,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-01-31 08:58:05,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 166 transitions. [2018-01-31 08:58:05,338 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 166 transitions. Word has length 41 [2018-01-31 08:58:05,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:58:05,339 INFO L432 AbstractCegarLoop]: Abstraction has 157 states and 166 transitions. [2018-01-31 08:58:05,339 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-31 08:58:05,339 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 166 transitions. [2018-01-31 08:58:05,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-01-31 08:58:05,340 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:58:05,340 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:58:05,341 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-31 08:58:05,341 INFO L82 PathProgramCache]: Analyzing trace with hash 547481290, now seen corresponding path program 1 times [2018-01-31 08:58:05,341 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:58:05,341 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:58:05,342 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:58:05,342 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:58:05,343 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:58:05,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:58:05,353 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:58:05,433 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-31 08:58:05,434 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:58:05,434 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-31 08:58:05,434 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-31 08:58:05,434 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-31 08:58:05,435 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-31 08:58:05,435 INFO L87 Difference]: Start difference. First operand 157 states and 166 transitions. Second operand 3 states. [2018-01-31 08:58:05,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:58:05,569 INFO L93 Difference]: Finished difference Result 179 states and 190 transitions. [2018-01-31 08:58:05,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-31 08:58:05,569 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2018-01-31 08:58:05,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:58:05,571 INFO L225 Difference]: With dead ends: 179 [2018-01-31 08:58:05,571 INFO L226 Difference]: Without dead ends: 161 [2018-01-31 08:58:05,572 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-31 08:58:05,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-01-31 08:58:05,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 150. [2018-01-31 08:58:05,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-01-31 08:58:05,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 158 transitions. [2018-01-31 08:58:05,584 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 158 transitions. Word has length 39 [2018-01-31 08:58:05,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:58:05,585 INFO L432 AbstractCegarLoop]: Abstraction has 150 states and 158 transitions. [2018-01-31 08:58:05,585 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-31 08:58:05,585 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 158 transitions. [2018-01-31 08:58:05,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-01-31 08:58:05,586 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:58:05,586 INFO L351 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] [2018-01-31 08:58:05,587 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-31 08:58:05,587 INFO L82 PathProgramCache]: Analyzing trace with hash -2146406904, now seen corresponding path program 1 times [2018-01-31 08:58:05,587 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:58:05,587 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:58:05,588 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:58:05,588 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:58:05,588 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:58:05,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:58:05,602 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:58:05,783 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-31 08:58:05,784 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:58:05,784 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-31 08:58:05,784 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 08:58:05,784 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 08:58:05,785 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-31 08:58:05,785 INFO L87 Difference]: Start difference. First operand 150 states and 158 transitions. Second operand 6 states. [2018-01-31 08:58:05,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:58:05,863 INFO L93 Difference]: Finished difference Result 154 states and 161 transitions. [2018-01-31 08:58:05,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-31 08:58:05,864 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2018-01-31 08:58:05,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:58:05,865 INFO L225 Difference]: With dead ends: 154 [2018-01-31 08:58:05,865 INFO L226 Difference]: Without dead ends: 139 [2018-01-31 08:58:05,866 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-31 08:58:05,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-01-31 08:58:05,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2018-01-31 08:58:05,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-01-31 08:58:05,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 145 transitions. [2018-01-31 08:58:05,876 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 145 transitions. Word has length 40 [2018-01-31 08:58:05,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:58:05,877 INFO L432 AbstractCegarLoop]: Abstraction has 139 states and 145 transitions. [2018-01-31 08:58:05,877 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 08:58:05,877 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 145 transitions. [2018-01-31 08:58:05,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-01-31 08:58:05,878 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:58:05,879 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:58:05,879 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-31 08:58:05,879 INFO L82 PathProgramCache]: Analyzing trace with hash -1583567538, now seen corresponding path program 1 times [2018-01-31 08:58:05,879 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:58:05,879 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:58:05,881 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:58:05,881 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:58:05,881 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:58:05,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:58:05,898 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:58:06,011 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-31 08:58:06,011 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:58:06,011 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-31 08:58:06,026 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:58:06,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:58:06,085 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:58:06,139 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-31 08:58:06,167 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:58:06,167 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-01-31 08:58:06,167 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 08:58:06,168 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 08:58:06,168 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-01-31 08:58:06,168 INFO L87 Difference]: Start difference. First operand 139 states and 145 transitions. Second operand 6 states. [2018-01-31 08:58:06,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:58:06,225 INFO L93 Difference]: Finished difference Result 254 states and 266 transitions. [2018-01-31 08:58:06,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-31 08:58:06,228 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 43 [2018-01-31 08:58:06,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:58:06,230 INFO L225 Difference]: With dead ends: 254 [2018-01-31 08:58:06,230 INFO L226 Difference]: Without dead ends: 146 [2018-01-31 08:58:06,231 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-01-31 08:58:06,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-01-31 08:58:06,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 143. [2018-01-31 08:58:06,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-01-31 08:58:06,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 149 transitions. [2018-01-31 08:58:06,249 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 149 transitions. Word has length 43 [2018-01-31 08:58:06,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:58:06,250 INFO L432 AbstractCegarLoop]: Abstraction has 143 states and 149 transitions. [2018-01-31 08:58:06,250 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 08:58:06,250 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 149 transitions. [2018-01-31 08:58:06,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-01-31 08:58:06,251 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:58:06,251 INFO L351 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-31 08:58:06,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-31 08:58:06,252 INFO L82 PathProgramCache]: Analyzing trace with hash 1467102540, now seen corresponding path program 2 times [2018-01-31 08:58:06,252 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:58:06,252 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:58:06,253 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:58:06,254 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:58:06,254 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:58:06,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:58:06,273 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:58:06,611 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-31 08:58:06,611 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:58:06,611 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-31 08:58:06,624 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-31 08:58:06,656 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:58:06,662 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:58:06,669 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:58:06,718 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-31 08:58:06,720 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:58:06,960 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-31 08:58:06,961 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:58:07,025 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-31 08:58:07,025 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:36 [2018-01-31 08:58:08,143 WARN L146 SmtUtils]: Spent 438ms on a formula simplification. DAG size of input: 45 DAG size of output 17 [2018-01-31 08:58:08,814 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-31 08:58:08,838 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-31 08:58:08,838 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [6] total 19 [2018-01-31 08:58:08,838 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-31 08:58:08,838 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-31 08:58:08,839 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2018-01-31 08:58:08,839 INFO L87 Difference]: Start difference. First operand 143 states and 149 transitions. Second operand 19 states. [2018-01-31 08:58:11,009 WARN L143 SmtUtils]: Spent 1962ms on a formula simplification that was a NOOP. DAG size: 39 [2018-01-31 08:58:12,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:58:12,490 INFO L93 Difference]: Finished difference Result 257 states and 270 transitions. [2018-01-31 08:58:12,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-01-31 08:58:12,491 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 47 [2018-01-31 08:58:12,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:58:12,492 INFO L225 Difference]: With dead ends: 257 [2018-01-31 08:58:12,492 INFO L226 Difference]: Without dead ends: 149 [2018-01-31 08:58:12,493 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=104, Invalid=652, Unknown=0, NotChecked=0, Total=756 [2018-01-31 08:58:12,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-01-31 08:58:12,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 146. [2018-01-31 08:58:12,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-01-31 08:58:12,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 152 transitions. [2018-01-31 08:58:12,509 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 152 transitions. Word has length 47 [2018-01-31 08:58:12,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:58:12,510 INFO L432 AbstractCegarLoop]: Abstraction has 146 states and 152 transitions. [2018-01-31 08:58:12,512 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-01-31 08:58:12,512 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 152 transitions. [2018-01-31 08:58:12,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-01-31 08:58:12,513 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:58:12,513 INFO L351 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-31 08:58:12,513 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-31 08:58:12,513 INFO L82 PathProgramCache]: Analyzing trace with hash -1733956539, now seen corresponding path program 1 times [2018-01-31 08:58:12,513 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:58:12,514 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:58:12,515 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:58:12,518 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:58:12,518 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:58:12,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:58:12,537 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:58:12,802 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-31 08:58:12,802 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:58:12,802 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-01-31 08:58:12,802 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-31 08:58:12,802 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-31 08:58:12,802 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-01-31 08:58:12,803 INFO L87 Difference]: Start difference. First operand 146 states and 152 transitions. Second operand 12 states. [2018-01-31 08:58:13,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:58:13,168 INFO L93 Difference]: Finished difference Result 146 states and 152 transitions. [2018-01-31 08:58:13,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-31 08:58:13,188 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2018-01-31 08:58:13,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:58:13,189 INFO L225 Difference]: With dead ends: 146 [2018-01-31 08:58:13,189 INFO L226 Difference]: Without dead ends: 144 [2018-01-31 08:58:13,190 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2018-01-31 08:58:13,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-01-31 08:58:13,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2018-01-31 08:58:13,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-01-31 08:58:13,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 150 transitions. [2018-01-31 08:58:13,208 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 150 transitions. Word has length 56 [2018-01-31 08:58:13,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:58:13,209 INFO L432 AbstractCegarLoop]: Abstraction has 144 states and 150 transitions. [2018-01-31 08:58:13,209 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-31 08:58:13,209 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 150 transitions. [2018-01-31 08:58:13,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-01-31 08:58:13,210 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:58:13,210 INFO L351 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-31 08:58:13,211 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-31 08:58:13,211 INFO L82 PathProgramCache]: Analyzing trace with hash -1733956538, now seen corresponding path program 1 times [2018-01-31 08:58:13,211 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:58:13,211 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:58:13,213 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:58:13,213 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:58:13,213 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:58:13,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:58:13,244 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:58:13,707 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-31 08:58:13,707 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:58:13,708 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-31 08:58:13,721 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:58:13,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:58:13,768 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:58:13,865 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-31 08:58:13,887 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:58:13,887 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-01-31 08:58:13,887 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-31 08:58:13,887 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-31 08:58:13,887 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-01-31 08:58:13,888 INFO L87 Difference]: Start difference. First operand 144 states and 150 transitions. Second operand 8 states. [2018-01-31 08:58:14,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:58:14,033 INFO L93 Difference]: Finished difference Result 256 states and 268 transitions. [2018-01-31 08:58:14,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-31 08:58:14,034 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 56 [2018-01-31 08:58:14,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:58:14,035 INFO L225 Difference]: With dead ends: 256 [2018-01-31 08:58:14,035 INFO L226 Difference]: Without dead ends: 151 [2018-01-31 08:58:14,036 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-01-31 08:58:14,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-01-31 08:58:14,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 148. [2018-01-31 08:58:14,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-01-31 08:58:14,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 154 transitions. [2018-01-31 08:58:14,052 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 154 transitions. Word has length 56 [2018-01-31 08:58:14,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:58:14,053 INFO L432 AbstractCegarLoop]: Abstraction has 148 states and 154 transitions. [2018-01-31 08:58:14,054 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-31 08:58:14,054 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 154 transitions. [2018-01-31 08:58:14,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-01-31 08:58:14,055 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:58:14,055 INFO L351 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-31 08:58:14,055 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-31 08:58:14,055 INFO L82 PathProgramCache]: Analyzing trace with hash -732835576, now seen corresponding path program 2 times [2018-01-31 08:58:14,056 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:58:14,056 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:58:14,057 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:58:14,057 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:58:14,057 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:58:14,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:58:14,089 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:58:14,292 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-31 08:58:14,292 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:58:14,292 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-31 08:58:14,297 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-31 08:58:14,329 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:58:14,331 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:58:14,336 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:58:14,362 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-31 08:58:14,362 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:58:14,444 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-31 08:58:14,445 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:58:14,456 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-31 08:58:14,456 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:36 [2018-01-31 08:58:15,197 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-31 08:58:15,217 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-31 08:58:15,217 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [8] total 22 [2018-01-31 08:58:15,217 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-01-31 08:58:15,218 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-01-31 08:58:15,218 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=390, Unknown=0, NotChecked=0, Total=462 [2018-01-31 08:58:15,218 INFO L87 Difference]: Start difference. First operand 148 states and 154 transitions. Second operand 22 states. [2018-01-31 08:58:17,789 WARN L143 SmtUtils]: Spent 2030ms on a formula simplification that was a NOOP. DAG size: 32 [2018-01-31 08:58:18,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:58:18,713 INFO L93 Difference]: Finished difference Result 258 states and 272 transitions. [2018-01-31 08:58:18,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-01-31 08:58:18,744 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 60 [2018-01-31 08:58:18,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:58:18,744 INFO L225 Difference]: With dead ends: 258 [2018-01-31 08:58:18,745 INFO L226 Difference]: Without dead ends: 153 [2018-01-31 08:58:18,745 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=152, Invalid=904, Unknown=0, NotChecked=0, Total=1056 [2018-01-31 08:58:18,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-01-31 08:58:18,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 150. [2018-01-31 08:58:18,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-01-31 08:58:18,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 156 transitions. [2018-01-31 08:58:18,764 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 156 transitions. Word has length 60 [2018-01-31 08:58:18,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:58:18,764 INFO L432 AbstractCegarLoop]: Abstraction has 150 states and 156 transitions. [2018-01-31 08:58:18,764 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-01-31 08:58:18,765 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 156 transitions. [2018-01-31 08:58:18,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-01-31 08:58:18,765 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:58:18,766 INFO L351 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] [2018-01-31 08:58:18,766 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-31 08:58:18,766 INFO L82 PathProgramCache]: Analyzing trace with hash -1348894730, now seen corresponding path program 1 times [2018-01-31 08:58:18,766 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:58:18,766 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:58:18,768 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:58:18,768 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:58:18,768 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:58:18,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:58:18,788 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:58:18,857 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-31 08:58:18,857 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:58:18,857 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-31 08:58:18,857 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-31 08:58:18,858 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-31 08:58:18,858 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-31 08:58:18,858 INFO L87 Difference]: Start difference. First operand 150 states and 156 transitions. Second operand 8 states. [2018-01-31 08:58:18,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:58:18,926 INFO L93 Difference]: Finished difference Result 231 states and 240 transitions. [2018-01-31 08:58:18,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-31 08:58:18,929 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 75 [2018-01-31 08:58:18,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:58:18,931 INFO L225 Difference]: With dead ends: 231 [2018-01-31 08:58:18,931 INFO L226 Difference]: Without dead ends: 150 [2018-01-31 08:58:18,931 INFO L554 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-31 08:58:18,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-01-31 08:58:18,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2018-01-31 08:58:18,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-01-31 08:58:18,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 155 transitions. [2018-01-31 08:58:18,949 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 155 transitions. Word has length 75 [2018-01-31 08:58:18,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:58:18,949 INFO L432 AbstractCegarLoop]: Abstraction has 150 states and 155 transitions. [2018-01-31 08:58:18,949 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-31 08:58:18,949 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 155 transitions. [2018-01-31 08:58:18,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-01-31 08:58:18,950 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:58:18,950 INFO L351 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] [2018-01-31 08:58:18,951 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-31 08:58:18,951 INFO L82 PathProgramCache]: Analyzing trace with hash -1029372655, now seen corresponding path program 1 times [2018-01-31 08:58:18,951 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:58:18,951 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:58:18,952 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:58:18,952 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:58:18,952 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:58:18,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:58:18,979 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:58:19,128 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-31 08:58:19,129 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:58:19,129 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-31 08:58:19,129 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-31 08:58:19,129 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-31 08:58:19,129 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-01-31 08:58:19,129 INFO L87 Difference]: Start difference. First operand 150 states and 155 transitions. Second operand 10 states. [2018-01-31 08:58:19,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:58:19,204 INFO L93 Difference]: Finished difference Result 233 states and 241 transitions. [2018-01-31 08:58:19,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-31 08:58:19,206 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 80 [2018-01-31 08:58:19,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:58:19,207 INFO L225 Difference]: With dead ends: 233 [2018-01-31 08:58:19,208 INFO L226 Difference]: Without dead ends: 150 [2018-01-31 08:58:19,208 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2018-01-31 08:58:19,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-01-31 08:58:19,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2018-01-31 08:58:19,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-01-31 08:58:19,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 154 transitions. [2018-01-31 08:58:19,230 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 154 transitions. Word has length 80 [2018-01-31 08:58:19,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:58:19,231 INFO L432 AbstractCegarLoop]: Abstraction has 150 states and 154 transitions. [2018-01-31 08:58:19,231 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-31 08:58:19,231 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 154 transitions. [2018-01-31 08:58:19,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-01-31 08:58:19,232 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:58:19,232 INFO L351 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] [2018-01-31 08:58:19,232 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-31 08:58:19,232 INFO L82 PathProgramCache]: Analyzing trace with hash -1148809107, now seen corresponding path program 1 times [2018-01-31 08:58:19,232 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:58:19,233 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:58:19,233 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:58:19,234 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:58:19,234 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:58:19,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:58:19,256 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:58:19,538 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-31 08:58:19,538 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:58:19,538 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2018-01-31 08:58:19,538 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-31 08:58:19,539 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-31 08:58:19,539 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=379, Unknown=0, NotChecked=0, Total=420 [2018-01-31 08:58:19,539 INFO L87 Difference]: Start difference. First operand 150 states and 154 transitions. Second operand 21 states. [2018-01-31 08:58:20,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:58:20,184 INFO L93 Difference]: Finished difference Result 192 states and 204 transitions. [2018-01-31 08:58:20,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-01-31 08:58:20,184 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 91 [2018-01-31 08:58:20,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:58:20,186 INFO L225 Difference]: With dead ends: 192 [2018-01-31 08:58:20,186 INFO L226 Difference]: Without dead ends: 190 [2018-01-31 08:58:20,186 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=739, Unknown=0, NotChecked=0, Total=812 [2018-01-31 08:58:20,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-01-31 08:58:20,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 184. [2018-01-31 08:58:20,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-01-31 08:58:20,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 196 transitions. [2018-01-31 08:58:20,210 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 196 transitions. Word has length 91 [2018-01-31 08:58:20,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:58:20,211 INFO L432 AbstractCegarLoop]: Abstraction has 184 states and 196 transitions. [2018-01-31 08:58:20,211 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-31 08:58:20,211 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 196 transitions. [2018-01-31 08:58:20,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-01-31 08:58:20,212 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:58:20,212 INFO L351 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] [2018-01-31 08:58:20,212 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-31 08:58:20,212 INFO L82 PathProgramCache]: Analyzing trace with hash -1148809106, now seen corresponding path program 1 times [2018-01-31 08:58:20,213 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:58:20,213 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:58:20,214 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:58:20,214 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:58:20,214 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:58:20,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:58:20,241 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:58:20,486 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-31 08:58:20,486 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:58:20,487 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-31 08:58:20,492 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:58:20,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:58:20,533 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:58:20,561 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-31 08:58:20,595 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:58:20,596 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-01-31 08:58:20,596 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-31 08:58:20,596 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-31 08:58:20,596 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2018-01-31 08:58:20,597 INFO L87 Difference]: Start difference. First operand 184 states and 196 transitions. Second operand 10 states. [2018-01-31 08:58:20,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:58:20,760 INFO L93 Difference]: Finished difference Result 328 states and 352 transitions. [2018-01-31 08:58:20,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-31 08:58:20,767 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 91 [2018-01-31 08:58:20,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:58:20,769 INFO L225 Difference]: With dead ends: 328 [2018-01-31 08:58:20,769 INFO L226 Difference]: Without dead ends: 191 [2018-01-31 08:58:20,769 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2018-01-31 08:58:20,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-01-31 08:58:20,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 188. [2018-01-31 08:58:20,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-01-31 08:58:20,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 200 transitions. [2018-01-31 08:58:20,793 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 200 transitions. Word has length 91 [2018-01-31 08:58:20,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:58:20,794 INFO L432 AbstractCegarLoop]: Abstraction has 188 states and 200 transitions. [2018-01-31 08:58:20,794 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-31 08:58:20,794 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 200 transitions. [2018-01-31 08:58:20,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-01-31 08:58:20,795 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:58:20,795 INFO L351 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] [2018-01-31 08:58:20,795 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-31 08:58:20,796 INFO L82 PathProgramCache]: Analyzing trace with hash -1374100372, now seen corresponding path program 2 times [2018-01-31 08:58:20,796 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:58:20,796 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:58:20,797 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:58:20,797 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:58:20,797 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:58:20,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:58:20,820 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:58:21,213 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-31 08:58:21,214 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:58:21,214 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-31 08:58:21,228 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-31 08:58:21,270 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:58:21,273 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:58:21,278 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:58:21,301 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-31 08:58:21,302 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:58:21,379 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-31 08:58:21,379 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:58:21,390 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-31 08:58:21,390 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:36 [2018-01-31 08:58:23,227 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-31 08:58:23,246 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-31 08:58:23,246 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [10] total 29 [2018-01-31 08:58:23,247 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-01-31 08:58:23,247 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-01-31 08:58:23,247 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=705, Unknown=0, NotChecked=0, Total=812 [2018-01-31 08:58:23,248 INFO L87 Difference]: Start difference. First operand 188 states and 200 transitions. Second operand 29 states. [2018-01-31 08:58:23,927 WARN L143 SmtUtils]: Spent 220ms on a formula simplification that was a NOOP. DAG size: 31 [2018-01-31 08:58:25,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:58:25,546 INFO L93 Difference]: Finished difference Result 330 states and 356 transitions. [2018-01-31 08:58:25,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-01-31 08:58:25,547 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 95 [2018-01-31 08:58:25,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:58:25,548 INFO L225 Difference]: With dead ends: 330 [2018-01-31 08:58:25,549 INFO L226 Difference]: Without dead ends: 193 [2018-01-31 08:58:25,550 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 410 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=238, Invalid=1742, Unknown=0, NotChecked=0, Total=1980 [2018-01-31 08:58:25,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-01-31 08:58:25,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 190. [2018-01-31 08:58:25,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-01-31 08:58:25,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 200 transitions. [2018-01-31 08:58:25,579 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 200 transitions. Word has length 95 [2018-01-31 08:58:25,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:58:25,579 INFO L432 AbstractCegarLoop]: Abstraction has 190 states and 200 transitions. [2018-01-31 08:58:25,579 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-01-31 08:58:25,580 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 200 transitions. [2018-01-31 08:58:25,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-01-31 08:58:25,581 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:58:25,581 INFO L351 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] [2018-01-31 08:58:25,581 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-31 08:58:25,582 INFO L82 PathProgramCache]: Analyzing trace with hash 1296004867, now seen corresponding path program 1 times [2018-01-31 08:58:25,582 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:58:25,582 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:58:25,583 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:58:25,583 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:58:25,583 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:58:25,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:58:25,606 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:58:26,061 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-31 08:58:26,061 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:58:26,061 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-31 08:58:26,067 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:58:26,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:58:26,103 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:58:26,200 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-31 08:58:26,223 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:58:26,223 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2018-01-31 08:58:26,223 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-01-31 08:58:26,224 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-01-31 08:58:26,224 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2018-01-31 08:58:26,224 INFO L87 Difference]: Start difference. First operand 190 states and 200 transitions. Second operand 20 states. [2018-01-31 08:58:26,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:58:26,454 INFO L93 Difference]: Finished difference Result 333 states and 351 transitions. [2018-01-31 08:58:26,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-01-31 08:58:26,454 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 97 [2018-01-31 08:58:26,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:58:26,455 INFO L225 Difference]: With dead ends: 333 [2018-01-31 08:58:26,455 INFO L226 Difference]: Without dead ends: 194 [2018-01-31 08:58:26,456 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=89, Invalid=561, Unknown=0, NotChecked=0, Total=650 [2018-01-31 08:58:26,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-01-31 08:58:26,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 191. [2018-01-31 08:58:26,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-01-31 08:58:26,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 197 transitions. [2018-01-31 08:58:26,487 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 197 transitions. Word has length 97 [2018-01-31 08:58:26,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:58:26,487 INFO L432 AbstractCegarLoop]: Abstraction has 191 states and 197 transitions. [2018-01-31 08:58:26,488 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-01-31 08:58:26,488 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 197 transitions. [2018-01-31 08:58:26,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-01-31 08:58:26,489 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:58:26,489 INFO L351 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] [2018-01-31 08:58:26,489 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-31 08:58:26,490 INFO L82 PathProgramCache]: Analyzing trace with hash -1377544229, now seen corresponding path program 1 times [2018-01-31 08:58:26,490 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:58:26,490 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:58:26,492 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:58:26,493 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:58:26,493 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:58:26,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:58:26,521 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:58:27,201 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-31 08:58:27,201 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:58:27,201 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2018-01-31 08:58:27,201 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-01-31 08:58:27,202 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-01-31 08:58:27,202 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=649, Unknown=0, NotChecked=0, Total=702 [2018-01-31 08:58:27,202 INFO L87 Difference]: Start difference. First operand 191 states and 197 transitions. Second operand 27 states. [2018-01-31 08:58:28,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:58:28,207 INFO L93 Difference]: Finished difference Result 207 states and 217 transitions. [2018-01-31 08:58:28,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-01-31 08:58:28,208 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 122 [2018-01-31 08:58:28,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:58:28,209 INFO L225 Difference]: With dead ends: 207 [2018-01-31 08:58:28,209 INFO L226 Difference]: Without dead ends: 205 [2018-01-31 08:58:28,210 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=107, Invalid=1375, Unknown=0, NotChecked=0, Total=1482 [2018-01-31 08:58:28,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-01-31 08:58:28,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 200. [2018-01-31 08:58:28,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-01-31 08:58:28,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 210 transitions. [2018-01-31 08:58:28,231 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 210 transitions. Word has length 122 [2018-01-31 08:58:28,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:58:28,232 INFO L432 AbstractCegarLoop]: Abstraction has 200 states and 210 transitions. [2018-01-31 08:58:28,232 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-01-31 08:58:28,232 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 210 transitions. [2018-01-31 08:58:28,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-01-31 08:58:28,233 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:58:28,233 INFO L351 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] [2018-01-31 08:58:28,234 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-31 08:58:28,234 INFO L82 PathProgramCache]: Analyzing trace with hash -1377544228, now seen corresponding path program 1 times [2018-01-31 08:58:28,234 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:58:28,234 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:58:28,235 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:58:28,235 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:58:28,236 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:58:28,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:58:28,271 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:58:29,427 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-31 08:58:29,427 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:58:29,427 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-31 08:58:29,433 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:58:29,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:58:29,505 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:58:29,580 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-31 08:58:29,599 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:58:29,600 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-01-31 08:58:29,600 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-31 08:58:29,600 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-31 08:58:29,600 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2018-01-31 08:58:29,600 INFO L87 Difference]: Start difference. First operand 200 states and 210 transitions. Second operand 13 states. [2018-01-31 08:58:29,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:58:29,673 INFO L93 Difference]: Finished difference Result 348 states and 368 transitions. [2018-01-31 08:58:29,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-31 08:58:29,676 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 122 [2018-01-31 08:58:29,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:58:29,678 INFO L225 Difference]: With dead ends: 348 [2018-01-31 08:58:29,678 INFO L226 Difference]: Without dead ends: 207 [2018-01-31 08:58:29,679 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=72, Invalid=110, Unknown=0, NotChecked=0, Total=182 [2018-01-31 08:58:29,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-01-31 08:58:29,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 204. [2018-01-31 08:58:29,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-01-31 08:58:29,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 214 transitions. [2018-01-31 08:58:29,708 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 214 transitions. Word has length 122 [2018-01-31 08:58:29,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:58:29,709 INFO L432 AbstractCegarLoop]: Abstraction has 204 states and 214 transitions. [2018-01-31 08:58:29,709 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-31 08:58:29,709 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 214 transitions. [2018-01-31 08:58:29,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-01-31 08:58:29,710 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:58:29,710 INFO L351 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] [2018-01-31 08:58:29,710 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-31 08:58:29,710 INFO L82 PathProgramCache]: Analyzing trace with hash -1381563362, now seen corresponding path program 2 times [2018-01-31 08:58:29,711 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:58:29,711 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:58:29,711 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:58:29,712 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:58:29,712 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:58:29,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:58:29,740 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:58:30,862 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-31 08:58:30,862 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:58:30,893 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-31 08:58:30,898 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-31 08:58:30,942 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:58:30,947 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:58:30,952 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:58:30,956 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-31 08:58:30,956 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:58:30,968 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-31 08:58:30,969 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:58:30,980 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-31 08:58:30,980 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:36 [2018-01-31 08:58:32,519 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-31 08:58:32,538 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-31 08:58:32,539 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [13] total 38 [2018-01-31 08:58:32,539 INFO L409 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-01-31 08:58:32,539 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-01-31 08:58:32,540 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=1245, Unknown=0, NotChecked=0, Total=1406 [2018-01-31 08:58:32,540 INFO L87 Difference]: Start difference. First operand 204 states and 214 transitions. Second operand 38 states. [2018-01-31 08:58:33,240 WARN L143 SmtUtils]: Spent 192ms on a formula simplification that was a NOOP. DAG size: 35 [2018-01-31 08:58:34,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:58:34,938 INFO L93 Difference]: Finished difference Result 350 states and 372 transitions. [2018-01-31 08:58:34,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-01-31 08:58:34,939 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 126 [2018-01-31 08:58:34,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:58:34,940 INFO L225 Difference]: With dead ends: 350 [2018-01-31 08:58:34,940 INFO L226 Difference]: Without dead ends: 209 [2018-01-31 08:58:34,942 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 99 SyntacticMatches, 3 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 825 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=385, Invalid=3275, Unknown=0, NotChecked=0, Total=3660 [2018-01-31 08:58:34,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-01-31 08:58:34,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 206. [2018-01-31 08:58:34,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-01-31 08:58:34,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 215 transitions. [2018-01-31 08:58:34,965 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 215 transitions. Word has length 126 [2018-01-31 08:58:34,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:58:34,966 INFO L432 AbstractCegarLoop]: Abstraction has 206 states and 215 transitions. [2018-01-31 08:58:34,966 INFO L433 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-01-31 08:58:34,966 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 215 transitions. [2018-01-31 08:58:34,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-01-31 08:58:34,967 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:58:34,967 INFO L351 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] [2018-01-31 08:58:34,967 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-31 08:58:34,968 INFO L82 PathProgramCache]: Analyzing trace with hash -1179612011, now seen corresponding path program 1 times [2018-01-31 08:58:34,968 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:58:34,968 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:58:34,969 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:58:34,969 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:58:34,969 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:58:34,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:58:34,996 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:58:35,894 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-31 08:58:35,895 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:58:35,916 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-31 08:58:35,921 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:58:35,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:58:35,974 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:58:35,990 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-31 08:58:36,010 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:58:36,010 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2018-01-31 08:58:36,011 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-31 08:58:36,011 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-31 08:58:36,011 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=117, Unknown=0, NotChecked=0, Total=210 [2018-01-31 08:58:36,011 INFO L87 Difference]: Start difference. First operand 206 states and 215 transitions. Second operand 15 states. [2018-01-31 08:58:36,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:58:36,097 INFO L93 Difference]: Finished difference Result 352 states and 370 transitions. [2018-01-31 08:58:36,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-31 08:58:36,098 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 135 [2018-01-31 08:58:36,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:58:36,099 INFO L225 Difference]: With dead ends: 352 [2018-01-31 08:58:36,099 INFO L226 Difference]: Without dead ends: 213 [2018-01-31 08:58:36,100 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=97, Invalid=143, Unknown=0, NotChecked=0, Total=240 [2018-01-31 08:58:36,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2018-01-31 08:58:36,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 210. [2018-01-31 08:58:36,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-01-31 08:58:36,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 219 transitions. [2018-01-31 08:58:36,138 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 219 transitions. Word has length 135 [2018-01-31 08:58:36,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:58:36,138 INFO L432 AbstractCegarLoop]: Abstraction has 210 states and 219 transitions. [2018-01-31 08:58:36,138 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-31 08:58:36,138 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 219 transitions. [2018-01-31 08:58:36,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-01-31 08:58:36,140 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:58:36,140 INFO L351 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] [2018-01-31 08:58:36,140 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-31 08:58:36,140 INFO L82 PathProgramCache]: Analyzing trace with hash 601054099, now seen corresponding path program 2 times [2018-01-31 08:58:36,140 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:58:36,140 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:58:36,143 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:58:36,143 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:58:36,143 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:58:36,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:58:36,171 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:58:36,928 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-31 08:58:36,928 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:58:36,928 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-31 08:58:36,934 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-31 08:58:36,979 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:58:36,996 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:58:36,998 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:58:37,002 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:58:37,027 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-31 08:58:37,056 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:58:37,056 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2018-01-31 08:58:37,056 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-01-31 08:58:37,056 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-01-31 08:58:37,056 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=133, Unknown=0, NotChecked=0, Total=240 [2018-01-31 08:58:37,057 INFO L87 Difference]: Start difference. First operand 210 states and 219 transitions. Second operand 16 states. [2018-01-31 08:58:37,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:58:37,179 INFO L93 Difference]: Finished difference Result 356 states and 374 transitions. [2018-01-31 08:58:37,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-31 08:58:37,182 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 139 [2018-01-31 08:58:37,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:58:37,184 INFO L225 Difference]: With dead ends: 356 [2018-01-31 08:58:37,184 INFO L226 Difference]: Without dead ends: 217 [2018-01-31 08:58:37,185 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=111, Invalid=161, Unknown=0, NotChecked=0, Total=272 [2018-01-31 08:58:37,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-01-31 08:58:37,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 214. [2018-01-31 08:58:37,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2018-01-31 08:58:37,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 223 transitions. [2018-01-31 08:58:37,224 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 223 transitions. Word has length 139 [2018-01-31 08:58:37,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:58:37,224 INFO L432 AbstractCegarLoop]: Abstraction has 214 states and 223 transitions. [2018-01-31 08:58:37,224 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-01-31 08:58:37,225 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 223 transitions. [2018-01-31 08:58:37,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-01-31 08:58:37,228 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:58:37,228 INFO L351 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] [2018-01-31 08:58:37,228 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-31 08:58:37,228 INFO L82 PathProgramCache]: Analyzing trace with hash 299531153, now seen corresponding path program 3 times [2018-01-31 08:58:37,228 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:58:37,228 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:58:37,229 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:58:37,229 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:58:37,229 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:58:37,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:58:37,258 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:58:37,897 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-31 08:58:37,898 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:58:37,898 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-31 08:58:37,903 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-31 08:58:37,943 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:58:37,954 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:58:37,969 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:58:37,988 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:58:38,050 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:58:38,237 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:58:38,320 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:58:38,553 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:58:38,645 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:58:39,110 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:58:39,336 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:58:39,697 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:58:40,146 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:58:40,148 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:58:40,154 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:58:40,184 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-31 08:58:40,218 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:58:40,218 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-01-31 08:58:40,219 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-31 08:58:40,219 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-31 08:58:40,219 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=150, Unknown=0, NotChecked=0, Total=272 [2018-01-31 08:58:40,219 INFO L87 Difference]: Start difference. First operand 214 states and 223 transitions. Second operand 17 states. [2018-01-31 08:58:40,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:58:40,298 INFO L93 Difference]: Finished difference Result 360 states and 378 transitions. [2018-01-31 08:58:40,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-31 08:58:40,299 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 143 [2018-01-31 08:58:40,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:58:40,300 INFO L225 Difference]: With dead ends: 360 [2018-01-31 08:58:40,300 INFO L226 Difference]: Without dead ends: 221 [2018-01-31 08:58:40,301 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=126, Invalid=180, Unknown=0, NotChecked=0, Total=306 [2018-01-31 08:58:40,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-01-31 08:58:40,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 218. [2018-01-31 08:58:40,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-01-31 08:58:40,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 227 transitions. [2018-01-31 08:58:40,349 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 227 transitions. Word has length 143 [2018-01-31 08:58:40,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:58:40,349 INFO L432 AbstractCegarLoop]: Abstraction has 218 states and 227 transitions. [2018-01-31 08:58:40,349 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-31 08:58:40,349 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 227 transitions. [2018-01-31 08:58:40,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-01-31 08:58:40,350 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:58:40,350 INFO L351 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] [2018-01-31 08:58:40,350 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-31 08:58:40,351 INFO L82 PathProgramCache]: Analyzing trace with hash 1731554447, now seen corresponding path program 4 times [2018-01-31 08:58:40,351 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:58:40,351 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:58:40,351 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:58:40,351 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:58:40,352 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:58:40,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:58:40,381 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:58:40,630 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-31 08:58:40,630 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:58:40,630 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-31 08:58:40,636 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-31 08:58:40,749 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:58:40,753 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:58:40,771 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-31 08:58:40,791 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:58:40,792 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2018-01-31 08:58:40,792 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-31 08:58:40,792 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-31 08:58:40,792 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=168, Unknown=0, NotChecked=0, Total=306 [2018-01-31 08:58:40,792 INFO L87 Difference]: Start difference. First operand 218 states and 227 transitions. Second operand 18 states. [2018-01-31 08:58:40,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:58:40,884 INFO L93 Difference]: Finished difference Result 364 states and 382 transitions. [2018-01-31 08:58:40,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-01-31 08:58:40,884 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 147 [2018-01-31 08:58:40,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:58:40,885 INFO L225 Difference]: With dead ends: 364 [2018-01-31 08:58:40,885 INFO L226 Difference]: Without dead ends: 225 [2018-01-31 08:58:40,886 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 147 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-31 08:58:40,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-01-31 08:58:40,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 222. [2018-01-31 08:58:40,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2018-01-31 08:58:40,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 231 transitions. [2018-01-31 08:58:40,956 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 231 transitions. Word has length 147 [2018-01-31 08:58:40,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:58:40,957 INFO L432 AbstractCegarLoop]: Abstraction has 222 states and 231 transitions. [2018-01-31 08:58:40,957 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-31 08:58:40,957 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 231 transitions. [2018-01-31 08:58:40,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-01-31 08:58:40,958 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:58:40,958 INFO L351 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] [2018-01-31 08:58:40,958 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-31 08:58:40,958 INFO L82 PathProgramCache]: Analyzing trace with hash -1013731699, now seen corresponding path program 5 times [2018-01-31 08:58:40,958 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:58:40,959 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:58:40,960 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:58:40,960 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:58:40,960 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:58:40,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:58:40,987 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:58:41,301 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-31 08:58:41,301 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:58:41,301 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-31 08:58:41,307 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-31 08:58:41,346 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:58:41,358 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:58:41,372 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:58:41,382 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:58:41,397 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:58:41,414 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:58:41,431 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:58:41,460 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:58:41,472 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:58:41,527 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:58:41,544 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:58:41,571 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:58:41,695 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:58:41,739 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:58:41,924 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:58:41,929 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:58:41,934 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:58:41,958 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-31 08:58:41,979 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:58:41,979 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2018-01-31 08:58:41,980 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-31 08:58:41,980 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-31 08:58:41,980 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=187, Unknown=0, NotChecked=0, Total=342 [2018-01-31 08:58:41,980 INFO L87 Difference]: Start difference. First operand 222 states and 231 transitions. Second operand 19 states. [2018-01-31 08:58:42,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:58:42,075 INFO L93 Difference]: Finished difference Result 368 states and 386 transitions. [2018-01-31 08:58:42,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-31 08:58:42,076 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 151 [2018-01-31 08:58:42,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:58:42,078 INFO L225 Difference]: With dead ends: 368 [2018-01-31 08:58:42,078 INFO L226 Difference]: Without dead ends: 229 [2018-01-31 08:58:42,079 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=159, Invalid=221, Unknown=0, NotChecked=0, Total=380 [2018-01-31 08:58:42,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-01-31 08:58:42,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 226. [2018-01-31 08:58:42,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2018-01-31 08:58:42,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 235 transitions. [2018-01-31 08:58:42,121 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 235 transitions. Word has length 151 [2018-01-31 08:58:42,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:58:42,122 INFO L432 AbstractCegarLoop]: Abstraction has 226 states and 235 transitions. [2018-01-31 08:58:42,122 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-01-31 08:58:42,122 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 235 transitions. [2018-01-31 08:58:42,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-01-31 08:58:42,123 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:58:42,123 INFO L351 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] [2018-01-31 08:58:42,123 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-31 08:58:42,124 INFO L82 PathProgramCache]: Analyzing trace with hash 1659158923, now seen corresponding path program 6 times [2018-01-31 08:58:42,124 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:58:42,124 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:58:42,125 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:58:42,125 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:58:42,125 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:58:42,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:58:42,153 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:58:42,495 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-31 08:58:42,495 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:58:42,495 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-31 08:58:42,501 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-31 08:58:42,550 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 08:58:42,560 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 08:58:42,570 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 08:58:42,675 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 08:58:42,860 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 08:58:42,980 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 08:58:43,083 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 08:58:44,641 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 08:58:45,936 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 08:58:48,188 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 08:58:50,171 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 08:58:50,825 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 08:58:52,999 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 08:58:54,605 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 08:58:58,141 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 08:59:01,607 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 08:59:01,611 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:59:01,624 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:59:01,649 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-31 08:59:01,674 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:59:01,675 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2018-01-31 08:59:01,675 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-01-31 08:59:01,675 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-01-31 08:59:01,675 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=207, Unknown=0, NotChecked=0, Total=380 [2018-01-31 08:59:01,676 INFO L87 Difference]: Start difference. First operand 226 states and 235 transitions. Second operand 20 states. [2018-01-31 08:59:01,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:59:01,826 INFO L93 Difference]: Finished difference Result 372 states and 390 transitions. [2018-01-31 08:59:01,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-01-31 08:59:01,826 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 155 [2018-01-31 08:59:01,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:59:01,827 INFO L225 Difference]: With dead ends: 372 [2018-01-31 08:59:01,827 INFO L226 Difference]: Without dead ends: 233 [2018-01-31 08:59:01,828 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=177, Invalid=243, Unknown=0, NotChecked=0, Total=420 [2018-01-31 08:59:01,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-01-31 08:59:01,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 230. [2018-01-31 08:59:01,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2018-01-31 08:59:01,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 239 transitions. [2018-01-31 08:59:01,866 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 239 transitions. Word has length 155 [2018-01-31 08:59:01,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:59:01,867 INFO L432 AbstractCegarLoop]: Abstraction has 230 states and 239 transitions. [2018-01-31 08:59:01,867 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-01-31 08:59:01,867 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 239 transitions. [2018-01-31 08:59:01,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-01-31 08:59:01,868 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:59:01,868 INFO L351 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] [2018-01-31 08:59:01,869 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-31 08:59:01,870 INFO L82 PathProgramCache]: Analyzing trace with hash -44554871, now seen corresponding path program 7 times [2018-01-31 08:59:01,870 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:59:01,870 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:59:01,871 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:59:01,871 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:59:01,871 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:59:01,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:59:01,978 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:59:04,773 WARN L146 SmtUtils]: Spent 130ms on a formula simplification. DAG size of input: 13 DAG size of output 7 [2018-01-31 08:59:06,145 WARN L146 SmtUtils]: Spent 114ms on a formula simplification. DAG size of input: 62 DAG size of output 24 [2018-01-31 08:59:09,060 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-31 08:59:09,061 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:59:09,061 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-31 08:59:09,066 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:59:09,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:59:09,136 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:59:09,229 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-31 08:59:09,231 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-31 08:59:09,231 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:59:09,232 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:59:09,236 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:59:09,237 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-01-31 08:59:09,347 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-31 08:59:09,349 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:59:09,352 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-31 08:59:09,352 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:59:09,361 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:59:09,367 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:59:09,367 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2018-01-31 08:59:09,518 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-31 08:59:09,520 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:59:09,521 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:59:09,521 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:59:09,522 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-31 08:59:09,522 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:59:09,531 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:59:09,556 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-31 08:59:09,556 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:43 [2018-01-31 08:59:09,787 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-31 08:59:09,793 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:59:09,794 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:59:09,795 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:59:09,795 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:59:09,796 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:59:09,797 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:59:09,798 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-31 08:59:09,798 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:59:09,817 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:59:09,829 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-31 08:59:09,830 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:63, output treesize:59 [2018-01-31 08:59:10,072 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-31 08:59:10,105 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:59:10,127 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:59:10,130 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:59:10,131 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:59:10,132 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:59:10,133 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:59:10,134 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:59:10,134 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:59:10,135 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:59:10,136 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:59:10,137 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-31 08:59:10,137 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:59:10,159 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:59:10,175 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-31 08:59:10,175 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:79, output treesize:75 [2018-01-31 08:59:10,771 WARN L143 SmtUtils]: Spent 493ms on a formula simplification that was a NOOP. DAG size: 38 [2018-01-31 08:59:11,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 69 treesize of output 56 [2018-01-31 08:59:11,578 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:59:11,599 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:59:11,601 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:59:11,602 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:59:11,603 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:59:11,604 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:59:11,605 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:59:11,605 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:59:11,606 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:59:11,607 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:59:11,615 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:59:11,616 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:59:11,617 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:59:11,618 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:59:11,619 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:59:11,620 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-31 08:59:11,620 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:59:11,656 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:59:11,676 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-31 08:59:11,677 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:95, output treesize:91 [2018-01-31 08:59:12,016 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-31 08:59:12,060 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:59:12,071 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:59:12,073 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:59:12,074 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:59:12,075 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:59:12,076 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:59:12,077 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:59:12,078 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:59:12,079 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:59:12,080 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:59:12,081 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:59:12,081 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:59:12,082 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:59:12,083 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:59:12,084 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:59:12,085 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:59:12,086 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:59:12,087 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:59:12,088 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:59:12,089 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:59:12,090 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:59:12,091 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-31 08:59:12,092 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:59:12,143 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:59:12,168 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-31 08:59:12,168 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:111, output treesize:107 [2018-01-31 08:59:13,133 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-31 08:59:13,137 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:59:13,138 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:59:13,140 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:59:13,141 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:59:13,142 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:59:13,143 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:59:13,144 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:59:13,145 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:59:13,146 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:59:13,147 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:59:13,148 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:59:13,149 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:59:13,150 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:59:13,151 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:59:13,152 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:59:13,153 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:59:13,154 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:59:13,155 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:59:13,156 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:59:13,157 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:59:13,158 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:59:13,159 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:59:13,160 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:59:13,161 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:59:13,162 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:59:13,163 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:59:13,164 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:59:13,165 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:59:13,166 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-31 08:59:13,167 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:59:13,237 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:59:13,267 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-31 08:59:13,267 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:127, output treesize:123 [2018-01-31 08:59:22,699 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-31 08:59:22,739 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:59:22,741 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:59:22,742 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:59:22,743 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:59:22,745 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:59:22,746 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:59:22,747 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:59:22,748 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:59:22,749 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:59:22,751 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:59:22,752 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:59:22,753 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:59:22,754 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:59:22,755 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:59:22,756 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:59:22,757 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:59:22,758 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:59:22,760 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:59:22,761 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:59:22,762 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:59:22,763 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:59:22,765 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:59:22,767 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:59:22,768 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:59:22,769 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:59:22,770 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:59:22,771 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:59:22,772 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:59:22,773 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:59:22,774 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:59:22,775 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:59:22,776 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:59:22,777 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:59:22,778 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:59:22,780 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:59:22,781 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:59:22,782 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-31 08:59:22,783 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:59:22,879 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:59:22,940 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-31 08:59:22,940 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:143, output treesize:139 [2018-01-31 08:59:51,381 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-31 08:59:51,386 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:59:51,388 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:59:51,389 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:59:51,390 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:59:51,391 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:59:51,392 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:59:51,393 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:59:51,395 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:59:51,396 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:59:51,397 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:59:51,398 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:59:51,399 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:59:51,400 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:59:51,401 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:59:51,402 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:59:51,404 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:59:51,405 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:59:51,406 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:59:51,407 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:59:51,408 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:59:51,409 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:59:51,410 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:59:51,412 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:59:51,413 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:59:51,414 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:59:51,415 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:59:51,416 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:59:51,417 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:59:51,418 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:59:51,419 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:59:51,421 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:59:51,422 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:59:51,423 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:59:51,424 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:59:51,425 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:59:51,426 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:59:51,427 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:59:51,428 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:59:51,429 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:59:51,430 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:59:51,431 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:59:51,432 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:59:51,434 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:59:51,435 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:59:51,436 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:59:51,438 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-31 08:59:51,439 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:59:51,564 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:59:51,605 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-31 08:59:51,605 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:159, output treesize:155 [2018-01-31 09:00:10,227 WARN L143 SmtUtils]: Spent 224ms on a formula simplification that was a NOOP. DAG size: 68 Received shutdown request... [2018-01-31 09:00:25,683 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-31 09:00:25,684 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-31 09:00:25,688 WARN L185 ceAbstractionStarter]: Timeout [2018-01-31 09:00:25,688 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 09:00:25 BoogieIcfgContainer [2018-01-31 09:00:25,688 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-31 09:00:25,690 INFO L168 Benchmark]: Toolchain (without parser) took 145885.27 ms. Allocated memory was 302.5 MB in the beginning and 980.4 MB in the end (delta: 677.9 MB). Free memory was 261.4 MB in the beginning and 305.8 MB in the end (delta: -44.4 MB). Peak memory consumption was 633.5 MB. Max. memory is 5.3 GB. [2018-01-31 09:00:25,691 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 302.5 MB. Free memory is still 267.4 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-31 09:00:25,692 INFO L168 Benchmark]: CACSL2BoogieTranslator took 372.91 ms. Allocated memory is still 302.5 MB. Free memory was 261.4 MB in the beginning and 247.4 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 5.3 GB. [2018-01-31 09:00:25,692 INFO L168 Benchmark]: Boogie Preprocessor took 57.46 ms. Allocated memory is still 302.5 MB. Free memory was 247.4 MB in the beginning and 245.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-31 09:00:25,692 INFO L168 Benchmark]: RCFGBuilder took 871.94 ms. Allocated memory is still 302.5 MB. Free memory was 245.5 MB in the beginning and 210.4 MB in the end (delta: 35.0 MB). Peak memory consumption was 35.0 MB. Max. memory is 5.3 GB. [2018-01-31 09:00:25,693 INFO L168 Benchmark]: TraceAbstraction took 144567.99 ms. Allocated memory was 302.5 MB in the beginning and 980.4 MB in the end (delta: 677.9 MB). Free memory was 210.4 MB in the beginning and 305.8 MB in the end (delta: -95.3 MB). Peak memory consumption was 582.6 MB. Max. memory is 5.3 GB. [2018-01-31 09:00:25,697 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 302.5 MB. Free memory is still 267.4 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 372.91 ms. Allocated memory is still 302.5 MB. Free memory was 261.4 MB in the beginning and 247.4 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 57.46 ms. Allocated memory is still 302.5 MB. Free memory was 247.4 MB in the beginning and 245.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 871.94 ms. Allocated memory is still 302.5 MB. Free memory was 245.5 MB in the beginning and 210.4 MB in the end (delta: 35.0 MB). Peak memory consumption was 35.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 144567.99 ms. Allocated memory was 302.5 MB in the beginning and 980.4 MB in the end (delta: 677.9 MB). Free memory was 210.4 MB in the beginning and 305.8 MB in the end (delta: -95.3 MB). Peak memory consumption was 582.6 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 160 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 160 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 160 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 160 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 160 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 160 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 160 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 160 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 160 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 160 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 160 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 160 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 160 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 160 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: 1443]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 1443). Cancelled while BasicCegarLoop was analyzing trace of length 160 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 160 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 160 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 160 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 160 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 18 procedures, 147 locations, 19 error locations. TIMEOUT Result, 144.5s OverallTime, 29 OverallIterations, 16 TraceHistogramMax, 17.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3576 SDtfs, 1461 SDslu, 31179 SDs, 0 SdLazy, 8120 SolverSat, 231 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2023 GetRequests, 1557 SyntacticMatches, 5 SemanticMatches, 461 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1983 ImplicationChecksByTransitivity, 22.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=230occurred 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.7s AutomataMinimizationTime, 28 MinimizatonAttempts, 84 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 22.9s SatisfiabilityAnalysisTime, 17.9s InterpolantComputationTime, 3904 NumberOfCodeBlocks, 3820 NumberOfCodeBlocksAsserted, 86 NumberOfCheckSat, 3861 ConstructedInterpolants, 264 QuantifiedInterpolants, 1534188 SizeOfPredicates, 78 NumberOfNonLiveVariables, 5327 ConjunctsInSsa, 377 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_3_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-31_09-00-25-704.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_3_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-31_09-00-25-704.csv Completed graceful shutdown