Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r168-tall-165277016300148.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is PhaseVariation-PT-D20CS010, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r168-tall-165277016300148
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 13M
-rw-r--r-- 1 mcc users 8.8K Apr 29 12:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Apr 29 12:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 29 12:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K Apr 29 12:05 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.5K May 9 08:25 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 08:25 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.6K May 9 08:25 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 9 08:25 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 9 08:25 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 9 08:25 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 9 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 13M May 10 09:34 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME PhaseVariation-PT-D20CS010-LTLFireability-00
FORMULA_NAME PhaseVariation-PT-D20CS010-LTLFireability-01
FORMULA_NAME PhaseVariation-PT-D20CS010-LTLFireability-02
FORMULA_NAME PhaseVariation-PT-D20CS010-LTLFireability-03
FORMULA_NAME PhaseVariation-PT-D20CS010-LTLFireability-04
FORMULA_NAME PhaseVariation-PT-D20CS010-LTLFireability-05
FORMULA_NAME PhaseVariation-PT-D20CS010-LTLFireability-06
FORMULA_NAME PhaseVariation-PT-D20CS010-LTLFireability-07
FORMULA_NAME PhaseVariation-PT-D20CS010-LTLFireability-08
FORMULA_NAME PhaseVariation-PT-D20CS010-LTLFireability-09
FORMULA_NAME PhaseVariation-PT-D20CS010-LTLFireability-10
FORMULA_NAME PhaseVariation-PT-D20CS010-LTLFireability-11
FORMULA_NAME PhaseVariation-PT-D20CS010-LTLFireability-12
FORMULA_NAME PhaseVariation-PT-D20CS010-LTLFireability-13
FORMULA_NAME PhaseVariation-PT-D20CS010-LTLFireability-14
FORMULA_NAME PhaseVariation-PT-D20CS010-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652795433882

Running Version 202205111006
[2022-05-17 13:50:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-17 13:50:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 13:50:35] [INFO ] Load time of PNML (sax parser for PT used): 717 ms
[2022-05-17 13:50:35] [INFO ] Transformed 1202 places.
[2022-05-17 13:50:35] [INFO ] Transformed 13457 transitions.
[2022-05-17 13:50:35] [INFO ] Parsed PT model containing 1202 places and 13457 transitions in 900 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 23 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 2 places in 31 ms
Reduce places removed 2 places and 52 transitions.
Reduce places removed 1 places and 0 transitions.
FORMULA PhaseVariation-PT-D20CS010-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhaseVariation-PT-D20CS010-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 60 out of 1199 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1199/1199 places, 13405/13405 transitions.
Drop transitions removed 256 transitions
Redundant transition composition rules discarded 256 transitions
Iterating global reduction 0 with 256 rules applied. Total rules applied 256 place count 1199 transition count 13149
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 262 place count 1193 transition count 13101
Iterating global reduction 0 with 6 rules applied. Total rules applied 268 place count 1193 transition count 13101
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 274 place count 1193 transition count 13095
Applied a total of 274 rules in 768 ms. Remains 1193 /1199 variables (removed 6) and now considering 13095/13405 (removed 310) transitions.
[2022-05-17 13:50:37] [INFO ] Flow matrix only has 793 transitions (discarded 12302 similar events)
// Phase 1: matrix 793 rows 1193 cols
[2022-05-17 13:50:37] [INFO ] Computed 400 place invariants in 40 ms
[2022-05-17 13:50:41] [INFO ] Dead Transitions using invariants and state equation in 4598 ms found 1564 transitions.
Found 1564 dead transitions using SMT.
Drop transitions removed 1564 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 1564 transitions.
[2022-05-17 13:50:41] [INFO ] Flow matrix only has 793 transitions (discarded 10738 similar events)
// Phase 1: matrix 793 rows 1193 cols
[2022-05-17 13:50:41] [INFO ] Computed 400 place invariants in 25 ms
[2022-05-17 13:50:42] [INFO ] Implicit Places using invariants in 1056 ms returned []
Implicit Place search using SMT only with invariants took 1057 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1193/1199 places, 11531/13405 transitions.
Discarding 363 places :
Symmetric choice reduction at 0 with 363 rule applications. Total rules 363 place count 830 transition count 6215
Iterating global reduction 0 with 363 rules applied. Total rules applied 726 place count 830 transition count 6215
Ensure Unique test removed 2887 transitions
Reduce isomorphic transitions removed 2887 transitions.
Iterating post reduction 0 with 2887 rules applied. Total rules applied 3613 place count 830 transition count 3328
Applied a total of 3613 rules in 180 ms. Remains 830 /1193 variables (removed 363) and now considering 3328/11531 (removed 8203) transitions.
[2022-05-17 13:50:42] [INFO ] Flow matrix only has 430 transitions (discarded 2898 similar events)
// Phase 1: matrix 430 rows 830 cols
[2022-05-17 13:50:42] [INFO ] Computed 400 place invariants in 6 ms
[2022-05-17 13:50:43] [INFO ] Implicit Places using invariants in 611 ms returned []
[2022-05-17 13:50:43] [INFO ] Flow matrix only has 430 transitions (discarded 2898 similar events)
// Phase 1: matrix 430 rows 830 cols
[2022-05-17 13:50:43] [INFO ] Computed 400 place invariants in 11 ms
[2022-05-17 13:50:44] [INFO ] State equation strengthened by 420 read => feed constraints.
[2022-05-17 13:50:45] [INFO ] Implicit Places using invariants and state equation in 2495 ms returned []
Implicit Place search using SMT with State Equation took 3125 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 830/1199 places, 3328/13405 transitions.
Finished structural reductions, in 2 iterations. Remains : 830/1199 places, 3328/13405 transitions.
Support contains 60 out of 830 places after structural reductions.
[2022-05-17 13:50:46] [INFO ] Flatten gal took : 286 ms
[2022-05-17 13:50:46] [INFO ] Flatten gal took : 165 ms
[2022-05-17 13:50:46] [INFO ] Input system was already deterministic with 3328 transitions.
Support contains 58 out of 830 places (down from 60) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 129 resets, run finished after 757 ms. (steps per millisecond=13 ) properties (out of 31) seen :26
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2022-05-17 13:50:48] [INFO ] Flow matrix only has 430 transitions (discarded 2898 similar events)
// Phase 1: matrix 430 rows 830 cols
[2022-05-17 13:50:48] [INFO ] Computed 400 place invariants in 6 ms
[2022-05-17 13:50:48] [INFO ] [Real]Absence check using 400 positive place invariants in 59 ms returned sat
[2022-05-17 13:50:48] [INFO ] After 236ms SMT Verify possible using state equation in real domain returned unsat :4 sat :1
[2022-05-17 13:50:48] [INFO ] State equation strengthened by 420 read => feed constraints.
[2022-05-17 13:50:48] [INFO ] After 156ms SMT Verify possible using 420 Read/Feed constraints in real domain returned unsat :4 sat :0 real:1
[2022-05-17 13:50:48] [INFO ] After 701ms SMT Verify possible using all constraints in real domain returned unsat :4 sat :0 real:1
[2022-05-17 13:50:48] [INFO ] [Nat]Absence check using 400 positive place invariants in 62 ms returned sat
[2022-05-17 13:50:49] [INFO ] After 211ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :1
[2022-05-17 13:50:49] [INFO ] After 151ms SMT Verify possible using 420 Read/Feed constraints in natural domain returned unsat :4 sat :1
[2022-05-17 13:50:49] [INFO ] After 202ms SMT Verify possible using trap constraints in natural domain returned unsat :4 sat :1
Attempting to minimize the solution found.
Minimization took 34 ms.
[2022-05-17 13:50:49] [INFO ] After 624ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :1
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 12 ms.
Support contains 3 out of 830 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 830/830 places, 3328/3328 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 801 transition count 3111
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 801 transition count 3111
Ensure Unique test removed 200 transitions
Reduce isomorphic transitions removed 200 transitions.
Iterating post reduction 0 with 200 rules applied. Total rules applied 258 place count 801 transition count 2911
Applied a total of 258 rules in 843 ms. Remains 801 /830 variables (removed 29) and now considering 2911/3328 (removed 417) transitions.
[2022-05-17 13:50:50] [INFO ] Flow matrix only has 401 transitions (discarded 2510 similar events)
// Phase 1: matrix 401 rows 801 cols
[2022-05-17 13:50:50] [INFO ] Computed 400 place invariants in 9 ms
[2022-05-17 13:50:51] [INFO ] Dead Transitions using invariants and state equation in 1007 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 801/830 places, 2911/3328 transitions.
Finished random walk after 2084 steps, including 14 resets, run visited all 1 properties in 48 ms. (steps per millisecond=43 )
Successfully simplified 4 atomic propositions for a total of 14 simplifications.
FORMULA PhaseVariation-PT-D20CS010-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhaseVariation-PT-D20CS010-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 830 stabilizing places and 3328 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 830 transition count 3328
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
FORMULA PhaseVariation-PT-D20CS010-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||G(p1)))'
Support contains 5 out of 830 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 830/830 places, 3328/3328 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 802 transition count 3122
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 802 transition count 3122
Ensure Unique test removed 189 transitions
Reduce isomorphic transitions removed 189 transitions.
Iterating post reduction 0 with 189 rules applied. Total rules applied 245 place count 802 transition count 2933
Applied a total of 245 rules in 1132 ms. Remains 802 /830 variables (removed 28) and now considering 2933/3328 (removed 395) transitions.
[2022-05-17 13:50:52] [INFO ] Flow matrix only has 402 transitions (discarded 2531 similar events)
// Phase 1: matrix 402 rows 802 cols
[2022-05-17 13:50:52] [INFO ] Computed 400 place invariants in 6 ms
[2022-05-17 13:50:53] [INFO ] Dead Transitions using invariants and state equation in 1047 ms found 0 transitions.
[2022-05-17 13:50:53] [INFO ] Flow matrix only has 402 transitions (discarded 2531 similar events)
// Phase 1: matrix 402 rows 802 cols
[2022-05-17 13:50:53] [INFO ] Computed 400 place invariants in 5 ms
[2022-05-17 13:50:54] [INFO ] Implicit Places using invariants in 607 ms returned []
[2022-05-17 13:50:54] [INFO ] Flow matrix only has 402 transitions (discarded 2531 similar events)
// Phase 1: matrix 402 rows 802 cols
[2022-05-17 13:50:54] [INFO ] Computed 400 place invariants in 4 ms
[2022-05-17 13:50:54] [INFO ] State equation strengthened by 394 read => feed constraints.
[2022-05-17 13:50:56] [INFO ] Implicit Places using invariants and state equation in 2197 ms returned []
Implicit Place search using SMT with State Equation took 2807 ms to find 0 implicit places.
[2022-05-17 13:50:56] [INFO ] Redundant transitions in 206 ms returned []
[2022-05-17 13:50:56] [INFO ] Flow matrix only has 402 transitions (discarded 2531 similar events)
// Phase 1: matrix 402 rows 802 cols
[2022-05-17 13:50:56] [INFO ] Computed 400 place invariants in 11 ms
[2022-05-17 13:50:57] [INFO ] Dead Transitions using invariants and state equation in 1032 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 802/830 places, 2933/3328 transitions.
Finished structural reductions, in 1 iterations. Remains : 802/830 places, 2933/3328 transitions.
Stuttering acceptance computed with spot in 357 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PhaseVariation-PT-D20CS010-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(AND (GEQ s145 1) (GEQ s564 1) (GEQ s800 1)), p1:(OR (LT s103 1) (LT s525 1) (LT s800 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 431 steps with 6 reset in 17 ms.
FORMULA PhaseVariation-PT-D20CS010-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhaseVariation-PT-D20CS010-LTLFireability-00 finished in 6662 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(G((X(p0) U !p0))))||X(p1)))'
Support contains 5 out of 830 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 830/830 places, 3328/3328 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 802 transition count 3122
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 802 transition count 3122
Ensure Unique test removed 189 transitions
Reduce isomorphic transitions removed 189 transitions.
Iterating post reduction 0 with 189 rules applied. Total rules applied 245 place count 802 transition count 2933
Applied a total of 245 rules in 88 ms. Remains 802 /830 variables (removed 28) and now considering 2933/3328 (removed 395) transitions.
[2022-05-17 13:50:58] [INFO ] Flow matrix only has 402 transitions (discarded 2531 similar events)
// Phase 1: matrix 402 rows 802 cols
[2022-05-17 13:50:58] [INFO ] Computed 400 place invariants in 10 ms
[2022-05-17 13:50:59] [INFO ] Dead Transitions using invariants and state equation in 1043 ms found 0 transitions.
[2022-05-17 13:50:59] [INFO ] Flow matrix only has 402 transitions (discarded 2531 similar events)
// Phase 1: matrix 402 rows 802 cols
[2022-05-17 13:50:59] [INFO ] Computed 400 place invariants in 9 ms
[2022-05-17 13:50:59] [INFO ] Implicit Places using invariants in 598 ms returned []
[2022-05-17 13:50:59] [INFO ] Flow matrix only has 402 transitions (discarded 2531 similar events)
// Phase 1: matrix 402 rows 802 cols
[2022-05-17 13:50:59] [INFO ] Computed 400 place invariants in 5 ms
[2022-05-17 13:51:00] [INFO ] State equation strengthened by 394 read => feed constraints.
[2022-05-17 13:51:02] [INFO ] Implicit Places using invariants and state equation in 2076 ms returned []
Implicit Place search using SMT with State Equation took 2677 ms to find 0 implicit places.
[2022-05-17 13:51:02] [INFO ] Flow matrix only has 402 transitions (discarded 2531 similar events)
// Phase 1: matrix 402 rows 802 cols
[2022-05-17 13:51:02] [INFO ] Computed 400 place invariants in 9 ms
[2022-05-17 13:51:03] [INFO ] Dead Transitions using invariants and state equation in 993 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 802/830 places, 2933/3328 transitions.
Finished structural reductions, in 1 iterations. Remains : 802/830 places, 2933/3328 transitions.
Stuttering acceptance computed with spot in 228 ms :[true, (AND (NOT p1) p0), (AND (NOT p1) p0), p0]
Running random walk in product with property : PhaseVariation-PT-D20CS010-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={} source=3 dest: 0}, { cond=(NOT p0), acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(AND (GEQ s135 1) (GEQ s517 1) (GEQ s800 1) (GEQ s318 1) (GEQ s719 1) (GEQ s800 1)), p0:(AND (GEQ s135 1) (GEQ s517 1) (GEQ s800 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 491 steps with 3 reset in 12 ms.
FORMULA PhaseVariation-PT-D20CS010-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhaseVariation-PT-D20CS010-LTLFireability-01 finished in 5071 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 3 out of 830 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 830/830 places, 3328/3328 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 801 transition count 3115
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 801 transition count 3115
Ensure Unique test removed 198 transitions
Reduce isomorphic transitions removed 198 transitions.
Iterating post reduction 0 with 198 rules applied. Total rules applied 256 place count 801 transition count 2917
Applied a total of 256 rules in 99 ms. Remains 801 /830 variables (removed 29) and now considering 2917/3328 (removed 411) transitions.
[2022-05-17 13:51:03] [INFO ] Flow matrix only has 401 transitions (discarded 2516 similar events)
// Phase 1: matrix 401 rows 801 cols
[2022-05-17 13:51:03] [INFO ] Computed 400 place invariants in 10 ms
[2022-05-17 13:51:04] [INFO ] Dead Transitions using invariants and state equation in 1068 ms found 0 transitions.
[2022-05-17 13:51:04] [INFO ] Flow matrix only has 401 transitions (discarded 2516 similar events)
// Phase 1: matrix 401 rows 801 cols
[2022-05-17 13:51:04] [INFO ] Computed 400 place invariants in 4 ms
[2022-05-17 13:51:05] [INFO ] Implicit Places using invariants in 607 ms returned []
[2022-05-17 13:51:05] [INFO ] Flow matrix only has 401 transitions (discarded 2516 similar events)
// Phase 1: matrix 401 rows 801 cols
[2022-05-17 13:51:05] [INFO ] Computed 400 place invariants in 8 ms
[2022-05-17 13:51:05] [INFO ] State equation strengthened by 393 read => feed constraints.
[2022-05-17 13:51:07] [INFO ] Implicit Places using invariants and state equation in 2168 ms returned []
Implicit Place search using SMT with State Equation took 2781 ms to find 0 implicit places.
[2022-05-17 13:51:07] [INFO ] Flow matrix only has 401 transitions (discarded 2516 similar events)
// Phase 1: matrix 401 rows 801 cols
[2022-05-17 13:51:07] [INFO ] Computed 400 place invariants in 4 ms
[2022-05-17 13:51:08] [INFO ] Dead Transitions using invariants and state equation in 1033 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 801/830 places, 2917/3328 transitions.
Finished structural reductions, in 1 iterations. Remains : 801/830 places, 2917/3328 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PhaseVariation-PT-D20CS010-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s65 1) (GEQ s485 1) (GEQ s799 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 27 steps with 0 reset in 1 ms.
FORMULA PhaseVariation-PT-D20CS010-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhaseVariation-PT-D20CS010-LTLFireability-02 finished in 5094 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(G(F(X((F(G(G(p1)))&&p0)))))))'
Support contains 5 out of 830 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 830/830 places, 3328/3328 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 802 transition count 3124
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 802 transition count 3124
Ensure Unique test removed 191 transitions
Reduce isomorphic transitions removed 191 transitions.
Iterating post reduction 0 with 191 rules applied. Total rules applied 247 place count 802 transition count 2933
Applied a total of 247 rules in 688 ms. Remains 802 /830 variables (removed 28) and now considering 2933/3328 (removed 395) transitions.
[2022-05-17 13:51:09] [INFO ] Flow matrix only has 402 transitions (discarded 2531 similar events)
// Phase 1: matrix 402 rows 802 cols
[2022-05-17 13:51:09] [INFO ] Computed 400 place invariants in 4 ms
[2022-05-17 13:51:10] [INFO ] Dead Transitions using invariants and state equation in 1047 ms found 0 transitions.
[2022-05-17 13:51:10] [INFO ] Flow matrix only has 402 transitions (discarded 2531 similar events)
// Phase 1: matrix 402 rows 802 cols
[2022-05-17 13:51:10] [INFO ] Computed 400 place invariants in 4 ms
[2022-05-17 13:51:10] [INFO ] Implicit Places using invariants in 600 ms returned []
[2022-05-17 13:51:10] [INFO ] Flow matrix only has 402 transitions (discarded 2531 similar events)
// Phase 1: matrix 402 rows 802 cols
[2022-05-17 13:51:10] [INFO ] Computed 400 place invariants in 3 ms
[2022-05-17 13:51:11] [INFO ] State equation strengthened by 394 read => feed constraints.
[2022-05-17 13:51:12] [INFO ] Implicit Places using invariants and state equation in 2183 ms returned []
Implicit Place search using SMT with State Equation took 2785 ms to find 0 implicit places.
[2022-05-17 13:51:13] [INFO ] Redundant transitions in 136 ms returned []
[2022-05-17 13:51:13] [INFO ] Flow matrix only has 402 transitions (discarded 2531 similar events)
// Phase 1: matrix 402 rows 802 cols
[2022-05-17 13:51:13] [INFO ] Computed 400 place invariants in 6 ms
[2022-05-17 13:51:14] [INFO ] Dead Transitions using invariants and state equation in 1050 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 802/830 places, 2933/3328 transitions.
Finished structural reductions, in 1 iterations. Remains : 802/830 places, 2933/3328 transitions.
Stuttering acceptance computed with spot in 178 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Running random walk in product with property : PhaseVariation-PT-D20CS010-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(OR (LT s394 1) (LT s795 1) (LT s800 1)), p0:(AND (GEQ s114 1) (GEQ s494 1) (GEQ s800 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 24 steps with 0 reset in 0 ms.
FORMULA PhaseVariation-PT-D20CS010-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhaseVariation-PT-D20CS010-LTLFireability-04 finished in 5924 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G((G(X(p0))||p1)))||G(F(G(X(p2)))))))'
Support contains 7 out of 830 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 830/830 places, 3328/3328 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 803 transition count 3126
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 803 transition count 3126
Ensure Unique test removed 189 transitions
Reduce isomorphic transitions removed 189 transitions.
Iterating post reduction 0 with 189 rules applied. Total rules applied 243 place count 803 transition count 2937
Applied a total of 243 rules in 674 ms. Remains 803 /830 variables (removed 27) and now considering 2937/3328 (removed 391) transitions.
[2022-05-17 13:51:15] [INFO ] Flow matrix only has 403 transitions (discarded 2534 similar events)
// Phase 1: matrix 403 rows 803 cols
[2022-05-17 13:51:15] [INFO ] Computed 400 place invariants in 11 ms
[2022-05-17 13:51:16] [INFO ] Dead Transitions using invariants and state equation in 1002 ms found 0 transitions.
[2022-05-17 13:51:16] [INFO ] Flow matrix only has 403 transitions (discarded 2534 similar events)
// Phase 1: matrix 403 rows 803 cols
[2022-05-17 13:51:16] [INFO ] Computed 400 place invariants in 6 ms
[2022-05-17 13:51:16] [INFO ] Implicit Places using invariants in 617 ms returned []
[2022-05-17 13:51:16] [INFO ] Flow matrix only has 403 transitions (discarded 2534 similar events)
// Phase 1: matrix 403 rows 803 cols
[2022-05-17 13:51:16] [INFO ] Computed 400 place invariants in 7 ms
[2022-05-17 13:51:16] [INFO ] State equation strengthened by 394 read => feed constraints.
[2022-05-17 13:51:18] [INFO ] Implicit Places using invariants and state equation in 2082 ms returned []
Implicit Place search using SMT with State Equation took 2701 ms to find 0 implicit places.
[2022-05-17 13:51:18] [INFO ] Redundant transitions in 101 ms returned []
[2022-05-17 13:51:18] [INFO ] Flow matrix only has 403 transitions (discarded 2534 similar events)
// Phase 1: matrix 403 rows 803 cols
[2022-05-17 13:51:18] [INFO ] Computed 400 place invariants in 9 ms
[2022-05-17 13:51:19] [INFO ] Dead Transitions using invariants and state equation in 1030 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 803/830 places, 2937/3328 transitions.
Finished structural reductions, in 1 iterations. Remains : 803/830 places, 2937/3328 transitions.
Stuttering acceptance computed with spot in 36 ms :[(AND (NOT p2) (NOT p0) (NOT p1))]
Running random walk in product with property : PhaseVariation-PT-D20CS010-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(AND p2 p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) p0 p1), acceptance={0} source=0 dest: 0}, { cond=(AND p2 (NOT p0) p1), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p2 p0 (NOT p1)), acceptance={2} source=0 dest: 0}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0, 2} source=0 dest: 0}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={1, 2} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0, 1, 2} source=0 dest: 0}]], initial=0, aps=[p2:(OR (LT s20 1) (LT s422 1) (LT s801 1)), p0:(AND (GEQ s38 1) (GEQ s417 1) (GEQ s801 1)), p1:(AND (GEQ s45 1) (GEQ s424 1) (GEQ s801 1))], nbAcceptance=3, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 1196 reset in 2133 ms.
Product exploration explored 100000 steps with 1159 reset in 2321 ms.
Computed a total of 803 stabilizing places and 2937 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 803 transition count 2937
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT (AND p2 (NOT p0) p1))), (X (NOT (AND p2 p0 p1))), (X (NOT (AND p2 p0 (NOT p1)))), (X (NOT (AND (NOT p2) p0 p1))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X (NOT (AND p2 p0 p1)))), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (F (G p2)), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (AND (NOT p2) (NOT p0) (NOT p1))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (AND p2 (NOT p0) (NOT p1))), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (X (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (AND p2 (NOT p0) (NOT p1)))), (X (X (NOT (AND p2 (NOT p0) (NOT p1)))))]
Property proved to be true thanks to knowledge :(F (G p2))
Knowledge based reduction with 16 factoid took 459 ms. Reduced automaton from 1 states, 8 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA PhaseVariation-PT-D20CS010-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PhaseVariation-PT-D20CS010-LTLFireability-06 finished in 11065 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(X((G(F(p0)) U X(X(p1))))) U (F(p3)&&p2))))'
Support contains 7 out of 830 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 830/830 places, 3328/3328 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 803 transition count 3126
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 803 transition count 3126
Ensure Unique test removed 184 transitions
Reduce isomorphic transitions removed 184 transitions.
Iterating post reduction 0 with 184 rules applied. Total rules applied 238 place count 803 transition count 2942
Applied a total of 238 rules in 94 ms. Remains 803 /830 variables (removed 27) and now considering 2942/3328 (removed 386) transitions.
[2022-05-17 13:51:25] [INFO ] Flow matrix only has 403 transitions (discarded 2539 similar events)
// Phase 1: matrix 403 rows 803 cols
[2022-05-17 13:51:25] [INFO ] Computed 400 place invariants in 10 ms
[2022-05-17 13:51:26] [INFO ] Dead Transitions using invariants and state equation in 1016 ms found 0 transitions.
[2022-05-17 13:51:26] [INFO ] Flow matrix only has 403 transitions (discarded 2539 similar events)
// Phase 1: matrix 403 rows 803 cols
[2022-05-17 13:51:26] [INFO ] Computed 400 place invariants in 8 ms
[2022-05-17 13:51:27] [INFO ] Implicit Places using invariants in 685 ms returned []
[2022-05-17 13:51:27] [INFO ] Flow matrix only has 403 transitions (discarded 2539 similar events)
// Phase 1: matrix 403 rows 803 cols
[2022-05-17 13:51:27] [INFO ] Computed 400 place invariants in 12 ms
[2022-05-17 13:51:27] [INFO ] State equation strengthened by 395 read => feed constraints.
[2022-05-17 13:51:29] [INFO ] Implicit Places using invariants and state equation in 2010 ms returned []
Implicit Place search using SMT with State Equation took 2719 ms to find 0 implicit places.
[2022-05-17 13:51:29] [INFO ] Flow matrix only has 403 transitions (discarded 2539 similar events)
// Phase 1: matrix 403 rows 803 cols
[2022-05-17 13:51:29] [INFO ] Computed 400 place invariants in 4 ms
[2022-05-17 13:51:30] [INFO ] Dead Transitions using invariants and state equation in 1055 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 803/830 places, 2942/3328 transitions.
Finished structural reductions, in 1 iterations. Remains : 803/830 places, 2942/3328 transitions.
Stuttering acceptance computed with spot in 378 ms :[(OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3)), (NOT p1), (NOT p3), (NOT p1), (NOT p1), (NOT p0), (NOT p0), (NOT p1)]
Running random walk in product with property : PhaseVariation-PT-D20CS010-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=(NOT p2), acceptance={0} source=1 dest: 2}, { cond=(AND p2 (NOT p3)), acceptance={0} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=(NOT p3), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 5}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 6}, { cond=(NOT p1), acceptance={} source=5 dest: 7}, { cond=(NOT p1), acceptance={} source=5 dest: 8}], [{ cond=(NOT p0), acceptance={0} source=6 dest: 6}], [{ cond=(NOT p0), acceptance={} source=7 dest: 6}, { cond=true, acceptance={} source=7 dest: 7}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=8 dest: 6}, { cond=(NOT p1), acceptance={0} source=8 dest: 7}, { cond=(NOT p1), acceptance={0} source=8 dest: 8}]], initial=0, aps=[p2:(AND (GEQ s379 1) (GEQ s799 1) (GEQ s801 1)), p3:(AND (GEQ s50 1) (GEQ s430 1) (GEQ s801 1)), p1:(AND (GEQ s379 1) (GEQ s799 1) (GEQ s801 1)), p0:(AND ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 20 steps with 0 reset in 2 ms.
FORMULA PhaseVariation-PT-D20CS010-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhaseVariation-PT-D20CS010-LTLFireability-07 finished in 5310 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(F(p0)))&&p1)))'
Support contains 5 out of 830 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 830/830 places, 3328/3328 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 802 transition count 3121
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 802 transition count 3121
Ensure Unique test removed 194 transitions
Reduce isomorphic transitions removed 194 transitions.
Iterating post reduction 0 with 194 rules applied. Total rules applied 250 place count 802 transition count 2927
Applied a total of 250 rules in 93 ms. Remains 802 /830 variables (removed 28) and now considering 2927/3328 (removed 401) transitions.
[2022-05-17 13:51:30] [INFO ] Flow matrix only has 402 transitions (discarded 2525 similar events)
// Phase 1: matrix 402 rows 802 cols
[2022-05-17 13:51:30] [INFO ] Computed 400 place invariants in 8 ms
[2022-05-17 13:51:31] [INFO ] Dead Transitions using invariants and state equation in 976 ms found 0 transitions.
[2022-05-17 13:51:31] [INFO ] Flow matrix only has 402 transitions (discarded 2525 similar events)
// Phase 1: matrix 402 rows 802 cols
[2022-05-17 13:51:31] [INFO ] Computed 400 place invariants in 3 ms
[2022-05-17 13:51:32] [INFO ] Implicit Places using invariants in 597 ms returned []
[2022-05-17 13:51:32] [INFO ] Flow matrix only has 402 transitions (discarded 2525 similar events)
// Phase 1: matrix 402 rows 802 cols
[2022-05-17 13:51:32] [INFO ] Computed 400 place invariants in 6 ms
[2022-05-17 13:51:32] [INFO ] State equation strengthened by 394 read => feed constraints.
[2022-05-17 13:51:34] [INFO ] Implicit Places using invariants and state equation in 2132 ms returned []
Implicit Place search using SMT with State Equation took 2744 ms to find 0 implicit places.
[2022-05-17 13:51:34] [INFO ] Flow matrix only has 402 transitions (discarded 2525 similar events)
// Phase 1: matrix 402 rows 802 cols
[2022-05-17 13:51:34] [INFO ] Computed 400 place invariants in 5 ms
[2022-05-17 13:51:35] [INFO ] Dead Transitions using invariants and state equation in 1017 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 802/830 places, 2927/3328 transitions.
Finished structural reductions, in 1 iterations. Remains : 802/830 places, 2927/3328 transitions.
Stuttering acceptance computed with spot in 1399 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (NOT p0), (NOT p0)]
Running random walk in product with property : PhaseVariation-PT-D20CS010-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 3}, { cond=p1, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(OR (LT s150 1) (LT s532 1) (LT s800 1)), p0:(OR (LT s128 1) (LT s508 1) (LT s800 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 1272 reset in 1964 ms.
Product exploration explored 100000 steps with 1181 reset in 2164 ms.
Computed a total of 802 stabilizing places and 2927 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 802 transition count 2927
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p0), (X p1), (X (NOT (AND p1 (NOT p0)))), true, (X (X p0)), (F (G p1)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 7 factoid took 177 ms. Reduced automaton from 5 states, 8 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA PhaseVariation-PT-D20CS010-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PhaseVariation-PT-D20CS010-LTLFireability-08 finished in 11083 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 830 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 830/830 places, 3328/3328 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 801 transition count 3115
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 801 transition count 3115
Ensure Unique test removed 198 transitions
Reduce isomorphic transitions removed 198 transitions.
Iterating post reduction 0 with 198 rules applied. Total rules applied 256 place count 801 transition count 2917
Applied a total of 256 rules in 795 ms. Remains 801 /830 variables (removed 29) and now considering 2917/3328 (removed 411) transitions.
[2022-05-17 13:51:42] [INFO ] Flow matrix only has 401 transitions (discarded 2516 similar events)
// Phase 1: matrix 401 rows 801 cols
[2022-05-17 13:51:42] [INFO ] Computed 400 place invariants in 10 ms
[2022-05-17 13:51:43] [INFO ] Dead Transitions using invariants and state equation in 980 ms found 0 transitions.
[2022-05-17 13:51:43] [INFO ] Flow matrix only has 401 transitions (discarded 2516 similar events)
// Phase 1: matrix 401 rows 801 cols
[2022-05-17 13:51:43] [INFO ] Computed 400 place invariants in 11 ms
[2022-05-17 13:51:44] [INFO ] Implicit Places using invariants in 607 ms returned []
[2022-05-17 13:51:44] [INFO ] Flow matrix only has 401 transitions (discarded 2516 similar events)
// Phase 1: matrix 401 rows 801 cols
[2022-05-17 13:51:44] [INFO ] Computed 400 place invariants in 12 ms
[2022-05-17 13:51:44] [INFO ] State equation strengthened by 393 read => feed constraints.
[2022-05-17 13:51:46] [INFO ] Implicit Places using invariants and state equation in 2163 ms returned []
Implicit Place search using SMT with State Equation took 2773 ms to find 0 implicit places.
[2022-05-17 13:51:46] [INFO ] Redundant transitions in 95 ms returned []
[2022-05-17 13:51:46] [INFO ] Flow matrix only has 401 transitions (discarded 2516 similar events)
// Phase 1: matrix 401 rows 801 cols
[2022-05-17 13:51:46] [INFO ] Computed 400 place invariants in 10 ms
[2022-05-17 13:51:47] [INFO ] Dead Transitions using invariants and state equation in 994 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 801/830 places, 2917/3328 transitions.
Finished structural reductions, in 1 iterations. Remains : 801/830 places, 2917/3328 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : PhaseVariation-PT-D20CS010-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s374 1) (LT s794 1) (LT s799 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 1167 reset in 1981 ms.
Product exploration explored 100000 steps with 1241 reset in 2129 ms.
Computed a total of 801 stabilizing places and 2917 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 801 transition count 2917
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 4 factoid took 99 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA PhaseVariation-PT-D20CS010-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PhaseVariation-PT-D20CS010-LTLFireability-09 finished in 10446 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(G((X(p0)&&F(p1))))))'
Support contains 5 out of 830 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 830/830 places, 3328/3328 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 802 transition count 3122
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 802 transition count 3122
Ensure Unique test removed 189 transitions
Reduce isomorphic transitions removed 189 transitions.
Iterating post reduction 0 with 189 rules applied. Total rules applied 245 place count 802 transition count 2933
Applied a total of 245 rules in 674 ms. Remains 802 /830 variables (removed 28) and now considering 2933/3328 (removed 395) transitions.
[2022-05-17 13:51:52] [INFO ] Flow matrix only has 402 transitions (discarded 2531 similar events)
// Phase 1: matrix 402 rows 802 cols
[2022-05-17 13:51:52] [INFO ] Computed 400 place invariants in 7 ms
[2022-05-17 13:51:53] [INFO ] Dead Transitions using invariants and state equation in 1056 ms found 0 transitions.
[2022-05-17 13:51:53] [INFO ] Flow matrix only has 402 transitions (discarded 2531 similar events)
// Phase 1: matrix 402 rows 802 cols
[2022-05-17 13:51:53] [INFO ] Computed 400 place invariants in 5 ms
[2022-05-17 13:51:54] [INFO ] Implicit Places using invariants in 604 ms returned []
[2022-05-17 13:51:54] [INFO ] Flow matrix only has 402 transitions (discarded 2531 similar events)
// Phase 1: matrix 402 rows 802 cols
[2022-05-17 13:51:54] [INFO ] Computed 400 place invariants in 6 ms
[2022-05-17 13:51:54] [INFO ] State equation strengthened by 394 read => feed constraints.
[2022-05-17 13:51:56] [INFO ] Implicit Places using invariants and state equation in 2167 ms returned []
Implicit Place search using SMT with State Equation took 2773 ms to find 0 implicit places.
[2022-05-17 13:51:56] [INFO ] Redundant transitions in 101 ms returned []
[2022-05-17 13:51:56] [INFO ] Flow matrix only has 402 transitions (discarded 2531 similar events)
// Phase 1: matrix 402 rows 802 cols
[2022-05-17 13:51:56] [INFO ] Computed 400 place invariants in 7 ms
[2022-05-17 13:51:57] [INFO ] Dead Transitions using invariants and state equation in 962 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 802/830 places, 2933/3328 transitions.
Finished structural reductions, in 1 iterations. Remains : 802/830 places, 2933/3328 transitions.
Stuttering acceptance computed with spot in 80 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : PhaseVariation-PT-D20CS010-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s321 1) (LT s759 1) (LT s800 1)), p1:(AND (GEQ s25 1) (GEQ s407 1) (GEQ s800 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 132 steps with 0 reset in 4 ms.
FORMULA PhaseVariation-PT-D20CS010-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhaseVariation-PT-D20CS010-LTLFireability-13 finished in 5679 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((!X((p0 U p1)) U p2)))'
Support contains 3 out of 830 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 830/830 places, 3328/3328 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 803 transition count 3133
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 803 transition count 3133
Ensure Unique test removed 184 transitions
Reduce isomorphic transitions removed 184 transitions.
Iterating post reduction 0 with 184 rules applied. Total rules applied 238 place count 803 transition count 2949
Applied a total of 238 rules in 670 ms. Remains 803 /830 variables (removed 27) and now considering 2949/3328 (removed 379) transitions.
[2022-05-17 13:51:58] [INFO ] Flow matrix only has 403 transitions (discarded 2546 similar events)
// Phase 1: matrix 403 rows 803 cols
[2022-05-17 13:51:58] [INFO ] Computed 400 place invariants in 8 ms
[2022-05-17 13:51:59] [INFO ] Dead Transitions using invariants and state equation in 981 ms found 0 transitions.
[2022-05-17 13:51:59] [INFO ] Flow matrix only has 403 transitions (discarded 2546 similar events)
// Phase 1: matrix 403 rows 803 cols
[2022-05-17 13:51:59] [INFO ] Computed 400 place invariants in 8 ms
[2022-05-17 13:52:00] [INFO ] Implicit Places using invariants in 582 ms returned []
[2022-05-17 13:52:00] [INFO ] Flow matrix only has 403 transitions (discarded 2546 similar events)
// Phase 1: matrix 403 rows 803 cols
[2022-05-17 13:52:00] [INFO ] Computed 400 place invariants in 5 ms
[2022-05-17 13:52:00] [INFO ] State equation strengthened by 395 read => feed constraints.
[2022-05-17 13:52:02] [INFO ] Implicit Places using invariants and state equation in 2006 ms returned []
Implicit Place search using SMT with State Equation took 2590 ms to find 0 implicit places.
[2022-05-17 13:52:02] [INFO ] Redundant transitions in 99 ms returned []
[2022-05-17 13:52:02] [INFO ] Flow matrix only has 403 transitions (discarded 2546 similar events)
// Phase 1: matrix 403 rows 803 cols
[2022-05-17 13:52:02] [INFO ] Computed 400 place invariants in 9 ms
[2022-05-17 13:52:03] [INFO ] Dead Transitions using invariants and state equation in 1046 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 803/830 places, 2949/3328 transitions.
Finished structural reductions, in 1 iterations. Remains : 803/830 places, 2949/3328 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p2)]
Running random walk in product with property : PhaseVariation-PT-D20CS010-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p2:(AND (GEQ s94 1) (GEQ s495 1) (GEQ s801 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 93 steps with 0 reset in 4 ms.
FORMULA PhaseVariation-PT-D20CS010-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhaseVariation-PT-D20CS010-LTLFireability-14 finished in 5451 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(X(G(p0)))||(false U false))))'
Support contains 3 out of 830 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 830/830 places, 3328/3328 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 801 transition count 3111
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 801 transition count 3111
Ensure Unique test removed 200 transitions
Reduce isomorphic transitions removed 200 transitions.
Iterating post reduction 0 with 200 rules applied. Total rules applied 258 place count 801 transition count 2911
Applied a total of 258 rules in 670 ms. Remains 801 /830 variables (removed 29) and now considering 2911/3328 (removed 417) transitions.
[2022-05-17 13:52:04] [INFO ] Flow matrix only has 401 transitions (discarded 2510 similar events)
// Phase 1: matrix 401 rows 801 cols
[2022-05-17 13:52:04] [INFO ] Computed 400 place invariants in 11 ms
[2022-05-17 13:52:05] [INFO ] Dead Transitions using invariants and state equation in 984 ms found 0 transitions.
[2022-05-17 13:52:05] [INFO ] Flow matrix only has 401 transitions (discarded 2510 similar events)
// Phase 1: matrix 401 rows 801 cols
[2022-05-17 13:52:05] [INFO ] Computed 400 place invariants in 10 ms
[2022-05-17 13:52:05] [INFO ] Implicit Places using invariants in 625 ms returned []
[2022-05-17 13:52:05] [INFO ] Flow matrix only has 401 transitions (discarded 2510 similar events)
// Phase 1: matrix 401 rows 801 cols
[2022-05-17 13:52:05] [INFO ] Computed 400 place invariants in 8 ms
[2022-05-17 13:52:05] [INFO ] State equation strengthened by 393 read => feed constraints.
[2022-05-17 13:52:07] [INFO ] Implicit Places using invariants and state equation in 2179 ms returned []
Implicit Place search using SMT with State Equation took 2809 ms to find 0 implicit places.
[2022-05-17 13:52:07] [INFO ] Redundant transitions in 92 ms returned []
[2022-05-17 13:52:07] [INFO ] Flow matrix only has 401 transitions (discarded 2510 similar events)
// Phase 1: matrix 401 rows 801 cols
[2022-05-17 13:52:07] [INFO ] Computed 400 place invariants in 9 ms
[2022-05-17 13:52:08] [INFO ] Dead Transitions using invariants and state equation in 1052 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 801/830 places, 2911/3328 transitions.
Finished structural reductions, in 1 iterations. Remains : 801/830 places, 2911/3328 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : PhaseVariation-PT-D20CS010-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s213 1) (GEQ s611 1) (GEQ s799 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 41 steps with 0 reset in 1 ms.
FORMULA PhaseVariation-PT-D20CS010-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhaseVariation-PT-D20CS010-LTLFireability-15 finished in 5677 ms.
All properties solved by simple procedures.
Total runtime 94037 ms.

BK_STOP 1652795529415

--------------------
content from stderr:

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PhaseVariation-PT-D20CS010"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is PhaseVariation-PT-D20CS010, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r168-tall-165277016300148"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PhaseVariation-PT-D20CS010.tgz
mv PhaseVariation-PT-D20CS010 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;