Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 652K
-rw-r--r-- 1 mcc users 9.3K Feb 26 17:17 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Feb 26 17:17 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Feb 26 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Feb 26 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.8K Feb 25 16:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Feb 25 16:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Feb 25 16:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 17:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 117K Feb 26 17:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Feb 26 17:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K Feb 26 17:18 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 16:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 2 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 174K Mar 5 18:23 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 ParamProductionCell-PT-4-LTLFireability-00
FORMULA_NAME ParamProductionCell-PT-4-LTLFireability-01
FORMULA_NAME ParamProductionCell-PT-4-LTLFireability-02
FORMULA_NAME ParamProductionCell-PT-4-LTLFireability-03
FORMULA_NAME ParamProductionCell-PT-4-LTLFireability-04
FORMULA_NAME ParamProductionCell-PT-4-LTLFireability-05
FORMULA_NAME ParamProductionCell-PT-4-LTLFireability-06
FORMULA_NAME ParamProductionCell-PT-4-LTLFireability-07
FORMULA_NAME ParamProductionCell-PT-4-LTLFireability-08
FORMULA_NAME ParamProductionCell-PT-4-LTLFireability-09
FORMULA_NAME ParamProductionCell-PT-4-LTLFireability-10
FORMULA_NAME ParamProductionCell-PT-4-LTLFireability-11
FORMULA_NAME ParamProductionCell-PT-4-LTLFireability-12
FORMULA_NAME ParamProductionCell-PT-4-LTLFireability-13
FORMULA_NAME ParamProductionCell-PT-4-LTLFireability-14
FORMULA_NAME ParamProductionCell-PT-4-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678919983468

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ParamProductionCell-PT-4
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-15 22:39:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-15 22:39:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 22:39:46] [INFO ] Load time of PNML (sax parser for PT used): 144 ms
[2023-03-15 22:39:46] [INFO ] Transformed 231 places.
[2023-03-15 22:39:46] [INFO ] Transformed 202 transitions.
[2023-03-15 22:39:46] [INFO ] Found NUPN structural information;
[2023-03-15 22:39:46] [INFO ] Parsed PT model containing 231 places and 202 transitions and 846 arcs in 291 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 9 formulas.
FORMULA ParamProductionCell-PT-4-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-4-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-4-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-4-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-4-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-4-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-4-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-4-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-4-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 27 out of 231 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 231/231 places, 202/202 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 227 transition count 198
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 227 transition count 198
Applied a total of 8 rules in 78 ms. Remains 227 /231 variables (removed 4) and now considering 198/202 (removed 4) transitions.
// Phase 1: matrix 198 rows 227 cols
[2023-03-15 22:39:47] [INFO ] Computed 59 place invariants in 41 ms
[2023-03-15 22:39:48] [INFO ] Implicit Places using invariants in 745 ms returned [15, 16, 18, 24, 31, 35, 36, 41, 42, 46, 47, 59, 64, 65, 73, 78, 79, 114, 115, 117, 119, 120, 161, 162, 166, 167, 192, 193, 196, 197, 202, 203, 207, 218]
Discarding 34 places :
Implicit Place search using SMT only with invariants took 814 ms to find 34 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 193/231 places, 198/202 transitions.
Applied a total of 0 rules in 14 ms. Remains 193 /193 variables (removed 0) and now considering 198/198 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 906 ms. Remains : 193/231 places, 198/202 transitions.
Support contains 27 out of 193 places after structural reductions.
[2023-03-15 22:39:48] [INFO ] Flatten gal took : 95 ms
[2023-03-15 22:39:48] [INFO ] Flatten gal took : 36 ms
[2023-03-15 22:39:48] [INFO ] Input system was already deterministic with 198 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 751 ms. (steps per millisecond=13 ) properties (out of 15) seen :12
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 160 ms. (steps per millisecond=62 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 198 rows 193 cols
[2023-03-15 22:39:49] [INFO ] Computed 25 place invariants in 7 ms
[2023-03-15 22:39:50] [INFO ] [Real]Absence check using 20 positive place invariants in 21 ms returned sat
[2023-03-15 22:39:50] [INFO ] [Real]Absence check using 20 positive and 5 generalized place invariants in 4 ms returned sat
[2023-03-15 22:39:50] [INFO ] After 404ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:2
[2023-03-15 22:39:50] [INFO ] [Nat]Absence check using 20 positive place invariants in 14 ms returned sat
[2023-03-15 22:39:50] [INFO ] [Nat]Absence check using 20 positive and 5 generalized place invariants in 4 ms returned sat
[2023-03-15 22:39:50] [INFO ] After 154ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2023-03-15 22:39:50] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-15 22:39:50] [INFO ] After 65ms SMT Verify possible using 68 Read/Feed constraints in natural domain returned unsat :1 sat :2
[2023-03-15 22:39:50] [INFO ] Deduced a trap composed of 7 places in 115 ms of which 10 ms to minimize.
[2023-03-15 22:39:50] [INFO ] Deduced a trap composed of 7 places in 143 ms of which 2 ms to minimize.
[2023-03-15 22:39:50] [INFO ] Deduced a trap composed of 7 places in 72 ms of which 1 ms to minimize.
[2023-03-15 22:39:51] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 440 ms
[2023-03-15 22:39:51] [INFO ] After 581ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 48 ms.
[2023-03-15 22:39:51] [INFO ] After 914ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 15 ms.
Support contains 5 out of 193 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 198/198 transitions.
Drop transitions removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 39 place count 193 transition count 159
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 1 with 39 rules applied. Total rules applied 78 place count 154 transition count 159
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 78 place count 154 transition count 149
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 98 place count 144 transition count 149
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 100 place count 142 transition count 147
Iterating global reduction 2 with 2 rules applied. Total rules applied 102 place count 142 transition count 147
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 162 place count 112 transition count 117
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 166 place count 110 transition count 115
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 2 with 5 rules applied. Total rules applied 171 place count 110 transition count 110
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 176 place count 105 transition count 110
Applied a total of 176 rules in 67 ms. Remains 105 /193 variables (removed 88) and now considering 110/198 (removed 88) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67 ms. Remains : 105/193 places, 110/198 transitions.
Finished random walk after 75 steps, including 0 resets, run visited all 2 properties in 4 ms. (steps per millisecond=18 )
Successfully simplified 1 atomic propositions for a total of 7 simplifications.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(G((!p0||(X(!p1) U ((X(!p1)&&G(!p0))||X(G(!p1)))))))) U (X(X(G((!p0||(X(!p1) U ((X(!p1)&&G(!p0))||X(G(!p1))))))))&&p2))))'
Support contains 5 out of 193 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 198/198 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 191 transition count 196
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 191 transition count 196
Applied a total of 4 rules in 8 ms. Remains 191 /193 variables (removed 2) and now considering 196/198 (removed 2) transitions.
// Phase 1: matrix 196 rows 191 cols
[2023-03-15 22:39:51] [INFO ] Computed 25 place invariants in 5 ms
[2023-03-15 22:39:51] [INFO ] Implicit Places using invariants in 168 ms returned [16, 81, 82, 138]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 170 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 187/193 places, 196/198 transitions.
Applied a total of 0 rules in 4 ms. Remains 187 /187 variables (removed 0) and now considering 196/196 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 182 ms. Remains : 187/193 places, 196/198 transitions.
Stuttering acceptance computed with spot in 734 ms :[(OR (NOT p2) (AND p0 p1)), (OR (NOT p2) (AND p0 p1)), (AND p0 p1), (AND p0 p1), p1, p1, true, (AND p1 p0), (AND p0 p1), (AND p0 (NOT p1))]
Running random walk in product with property : ParamProductionCell-PT-4-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={0, 1} source=1 dest: 1}, { cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=p0, acceptance={} source=3 dest: 4}, { cond=p0, acceptance={} source=3 dest: 5}], [{ cond=p1, acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={} source=5 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0} source=5 dest: 5}, { cond=(AND p0 p1), acceptance={0, 1} source=5 dest: 5}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 7}, { cond=(AND (NOT p0) p1), acceptance={1} source=5 dest: 7}], [{ cond=true, acceptance={0, 1} source=6 dest: 6}], [{ cond=p0, acceptance={} source=7 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0} source=7 dest: 5}, { cond=(AND p0 p1), acceptance={0, 1} source=7 dest: 5}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=7 dest: 7}, { cond=(AND (NOT p0) p1), acceptance={1} source=7 dest: 7}, { cond=(NOT p0), acceptance={} source=7 dest: 8}], [{ cond=(AND p0 p1), acceptance={} source=8 dest: 6}, { cond=(AND (NOT p0) p1), acceptance={} source=8 dest: 9}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=9 dest: 6}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=9 dest: 9}]], initial=0, aps=[p2:(AND (EQ s92 1) (EQ s115 1)), p0:(AND (EQ s92 1) (EQ s115 1)), p1:(AND (EQ s81 1) (EQ s84 1) (EQ s107 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 788 reset in 533 ms.
Product exploration explored 100000 steps with 798 reset in 273 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), true, (X (X (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 291 ms. Reduced automaton from 10 states, 24 edges and 3 AP (stutter sensitive) to 10 states, 24 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 566 ms :[(OR (NOT p2) (AND p0 p1)), (OR (NOT p2) (AND p0 p1)), (AND p0 p1), (AND p0 p1), p1, p1, true, (AND p1 p0), (AND p0 p1), (AND p0 (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 7) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 196 rows 187 cols
[2023-03-15 22:39:54] [INFO ] Computed 21 place invariants in 4 ms
[2023-03-15 22:39:54] [INFO ] [Real]Absence check using 18 positive place invariants in 12 ms returned sat
[2023-03-15 22:39:54] [INFO ] [Real]Absence check using 18 positive and 3 generalized place invariants in 9 ms returned sat
[2023-03-15 22:39:54] [INFO ] After 109ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), true, (X (X (NOT p2))), (G (NOT (AND p0 p1)))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (AND (NOT p0) p1)), (F (NOT (AND (NOT p0) (NOT p1)))), (F p2), (F p1), (F p0)]
Knowledge based reduction with 5 factoid took 710 ms. Reduced automaton from 10 states, 24 edges and 3 AP (stutter sensitive) to 10 states, 21 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 444 ms :[(OR (NOT p2) (AND p0 p1)), (OR (NOT p2) (AND p0 p1)), (AND p0 p1), (AND p0 p1), p1, p1, true, (AND p1 p0), (AND p1 p0), p0]
Stuttering acceptance computed with spot in 441 ms :[(OR (NOT p2) (AND p0 p1)), (OR (NOT p2) (AND p0 p1)), (AND p0 p1), (AND p0 p1), p1, p1, true, (AND p1 p0), (AND p1 p0), p0]
[2023-03-15 22:39:56] [INFO ] Invariant cache hit.
[2023-03-15 22:39:56] [INFO ] [Real]Absence check using 18 positive place invariants in 17 ms returned sat
[2023-03-15 22:39:56] [INFO ] [Real]Absence check using 18 positive and 3 generalized place invariants in 7 ms returned sat
[2023-03-15 22:39:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 22:39:56] [INFO ] [Real]Absence check using state equation in 357 ms returned sat
[2023-03-15 22:39:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 22:39:56] [INFO ] [Nat]Absence check using 18 positive place invariants in 17 ms returned sat
[2023-03-15 22:39:56] [INFO ] [Nat]Absence check using 18 positive and 3 generalized place invariants in 5 ms returned sat
[2023-03-15 22:39:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 22:39:57] [INFO ] [Nat]Absence check using state equation in 316 ms returned sat
[2023-03-15 22:39:57] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-15 22:39:57] [INFO ] [Nat]Added 68 Read/Feed constraints in 23 ms returned sat
[2023-03-15 22:39:57] [INFO ] Deduced a trap composed of 7 places in 115 ms of which 2 ms to minimize.
[2023-03-15 22:39:57] [INFO ] Deduced a trap composed of 7 places in 93 ms of which 2 ms to minimize.
[2023-03-15 22:39:57] [INFO ] Deduced a trap composed of 7 places in 117 ms of which 1 ms to minimize.
[2023-03-15 22:39:57] [INFO ] Deduced a trap composed of 7 places in 92 ms of which 1 ms to minimize.
[2023-03-15 22:39:57] [INFO ] Deduced a trap composed of 38 places in 74 ms of which 1 ms to minimize.
[2023-03-15 22:39:57] [INFO ] Deduced a trap composed of 39 places in 84 ms of which 1 ms to minimize.
[2023-03-15 22:39:58] [INFO ] Deduced a trap composed of 5 places in 55 ms of which 1 ms to minimize.
[2023-03-15 22:39:58] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2023-03-15 22:39:58] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 945 ms
[2023-03-15 22:39:58] [INFO ] Computed and/alt/rep : 185/325/185 causal constraints (skipped 7 transitions) in 20 ms.
[2023-03-15 22:39:59] [INFO ] Added : 179 causal constraints over 36 iterations in 1207 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 5 out of 187 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 187/187 places, 196/196 transitions.
Applied a total of 0 rules in 4 ms. Remains 187 /187 variables (removed 0) and now considering 196/196 (removed 0) transitions.
[2023-03-15 22:39:59] [INFO ] Invariant cache hit.
[2023-03-15 22:39:59] [INFO ] Implicit Places using invariants in 176 ms returned []
[2023-03-15 22:39:59] [INFO ] Invariant cache hit.
[2023-03-15 22:39:59] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-15 22:40:00] [INFO ] Implicit Places using invariants and state equation in 454 ms returned []
Implicit Place search using SMT with State Equation took 635 ms to find 0 implicit places.
[2023-03-15 22:40:00] [INFO ] Invariant cache hit.
[2023-03-15 22:40:00] [INFO ] Dead Transitions using invariants and state equation in 240 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 884 ms. Remains : 187/187 places, 196/196 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), true, (X (X (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 340 ms. Reduced automaton from 10 states, 21 edges and 3 AP (stutter sensitive) to 10 states, 21 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 502 ms :[(OR (NOT p2) (AND p0 p1)), (OR (NOT p2) (AND p0 p1)), (AND p0 p1), (AND p0 p1), p1, p1, true, (AND p1 p0), (AND p1 p0), p0]
Finished random walk after 4156 steps, including 1 resets, run visited all 4 properties in 14 ms. (steps per millisecond=296 )
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), true, (X (X (NOT p2)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F p2), (F p1), (F p0)]
Knowledge based reduction with 4 factoid took 429 ms. Reduced automaton from 10 states, 21 edges and 3 AP (stutter sensitive) to 10 states, 21 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 516 ms :[(OR (NOT p2) (AND p0 p1)), (OR (NOT p2) (AND p0 p1)), (AND p0 p1), (AND p0 p1), p1, p1, true, (AND p1 p0), (AND p1 p0), p0]
Stuttering acceptance computed with spot in 506 ms :[(OR (NOT p2) (AND p0 p1)), (OR (NOT p2) (AND p0 p1)), (AND p0 p1), (AND p0 p1), p1, p1, true, (AND p1 p0), (AND p1 p0), p0]
[2023-03-15 22:40:02] [INFO ] Invariant cache hit.
[2023-03-15 22:40:02] [INFO ] [Real]Absence check using 18 positive place invariants in 10 ms returned sat
[2023-03-15 22:40:02] [INFO ] [Real]Absence check using 18 positive and 3 generalized place invariants in 4 ms returned sat
[2023-03-15 22:40:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 22:40:02] [INFO ] [Real]Absence check using state equation in 189 ms returned sat
[2023-03-15 22:40:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 22:40:03] [INFO ] [Nat]Absence check using 18 positive place invariants in 16 ms returned sat
[2023-03-15 22:40:03] [INFO ] [Nat]Absence check using 18 positive and 3 generalized place invariants in 5 ms returned sat
[2023-03-15 22:40:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 22:40:03] [INFO ] [Nat]Absence check using state equation in 306 ms returned sat
[2023-03-15 22:40:03] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-15 22:40:03] [INFO ] [Nat]Added 68 Read/Feed constraints in 22 ms returned sat
[2023-03-15 22:40:03] [INFO ] Deduced a trap composed of 7 places in 95 ms of which 2 ms to minimize.
[2023-03-15 22:40:03] [INFO ] Deduced a trap composed of 7 places in 83 ms of which 0 ms to minimize.
[2023-03-15 22:40:03] [INFO ] Deduced a trap composed of 7 places in 88 ms of which 1 ms to minimize.
[2023-03-15 22:40:03] [INFO ] Deduced a trap composed of 7 places in 107 ms of which 0 ms to minimize.
[2023-03-15 22:40:04] [INFO ] Deduced a trap composed of 38 places in 83 ms of which 1 ms to minimize.
[2023-03-15 22:40:04] [INFO ] Deduced a trap composed of 39 places in 83 ms of which 1 ms to minimize.
[2023-03-15 22:40:04] [INFO ] Deduced a trap composed of 5 places in 55 ms of which 0 ms to minimize.
[2023-03-15 22:40:04] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2023-03-15 22:40:04] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 875 ms
[2023-03-15 22:40:04] [INFO ] Computed and/alt/rep : 185/325/185 causal constraints (skipped 7 transitions) in 18 ms.
[2023-03-15 22:40:05] [INFO ] Added : 179 causal constraints over 36 iterations in 1153 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 520 ms :[(OR (NOT p2) (AND p0 p1)), (OR (NOT p2) (AND p0 p1)), (AND p0 p1), (AND p0 p1), p1, p1, true, (AND p1 p0), (AND p1 p0), p0]
Product exploration explored 100000 steps with 1444 reset in 165 ms.
Product exploration explored 100000 steps with 1451 reset in 159 ms.
Applying partial POR strategy [false, false, false, false, true, false, true, false, false, true]
Stuttering acceptance computed with spot in 477 ms :[(OR (NOT p2) (AND p0 p1)), (OR (NOT p2) (AND p0 p1)), (AND p0 p1), (AND p0 p1), p1, p1, true, (AND p1 p0), (AND p1 p0), p0]
Support contains 5 out of 187 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 187/187 places, 196/196 transitions.
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 187 transition count 196
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 13 Pre rules applied. Total rules applied 36 place count 187 transition count 198
Deduced a syphon composed of 49 places in 1 ms
Iterating global reduction 1 with 13 rules applied. Total rules applied 49 place count 187 transition count 198
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 59 place count 177 transition count 187
Deduced a syphon composed of 39 places in 0 ms
Iterating global reduction 1 with 10 rules applied. Total rules applied 69 place count 177 transition count 187
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 74 places in 0 ms
Iterating global reduction 1 with 35 rules applied. Total rules applied 104 place count 177 transition count 187
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 128 place count 153 transition count 163
Deduced a syphon composed of 50 places in 0 ms
Iterating global reduction 1 with 24 rules applied. Total rules applied 152 place count 153 transition count 163
Deduced a syphon composed of 50 places in 1 ms
Applied a total of 152 rules in 33 ms. Remains 153 /187 variables (removed 34) and now considering 163/196 (removed 33) transitions.
[2023-03-15 22:40:07] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 163 rows 153 cols
[2023-03-15 22:40:07] [INFO ] Computed 21 place invariants in 3 ms
[2023-03-15 22:40:07] [INFO ] Dead Transitions using invariants and state equation in 164 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 153/187 places, 163/196 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 222 ms. Remains : 153/187 places, 163/196 transitions.
Built C files in :
/tmp/ltsmin1027644727680579978
[2023-03-15 22:40:07] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1027644727680579978
Running compilation step : cd /tmp/ltsmin1027644727680579978;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 985 ms.
Running link step : cd /tmp/ltsmin1027644727680579978;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 63 ms.
Running LTSmin : cd /tmp/ltsmin1027644727680579978;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1865549888394457712.hoa' '--buchi-type=spotba'
LTSmin run took 242 ms.
FORMULA ParamProductionCell-PT-4-LTLFireability-00 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ParamProductionCell-PT-4-LTLFireability-00 finished in 17289 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 3 out of 193 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 198/198 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 191 transition count 196
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 191 transition count 196
Applied a total of 4 rules in 8 ms. Remains 191 /193 variables (removed 2) and now considering 196/198 (removed 2) transitions.
// Phase 1: matrix 196 rows 191 cols
[2023-03-15 22:40:08] [INFO ] Computed 25 place invariants in 4 ms
[2023-03-15 22:40:09] [INFO ] Implicit Places using invariants in 330 ms returned [16, 81, 82, 138]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 335 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 187/193 places, 196/198 transitions.
Applied a total of 0 rules in 4 ms. Remains 187 /187 variables (removed 0) and now considering 196/196 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 349 ms. Remains : 187/193 places, 196/198 transitions.
Stuttering acceptance computed with spot in 190 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-4-LTLFireability-05 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 (EQ s79 1) (EQ s81 1) (EQ s106 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]]
Product exploration explored 100000 steps with 598 reset in 213 ms.
Stack based approach found an accepted trace after 292 steps with 1 reset with depth 230 and stack size 230 in 0 ms.
FORMULA ParamProductionCell-PT-4-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property ParamProductionCell-PT-4-LTLFireability-05 finished in 778 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 193 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 193/193 places, 198/198 transitions.
Drop transitions removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 38 place count 193 transition count 160
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 1 with 38 rules applied. Total rules applied 76 place count 155 transition count 160
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 76 place count 155 transition count 149
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 98 place count 144 transition count 149
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 100 place count 142 transition count 147
Iterating global reduction 2 with 2 rules applied. Total rules applied 102 place count 142 transition count 147
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 160 place count 113 transition count 118
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 164 place count 111 transition count 116
Applied a total of 164 rules in 37 ms. Remains 111 /193 variables (removed 82) and now considering 116/198 (removed 82) transitions.
// Phase 1: matrix 116 rows 111 cols
[2023-03-15 22:40:09] [INFO ] Computed 25 place invariants in 1 ms
[2023-03-15 22:40:09] [INFO ] Implicit Places using invariants in 167 ms returned [7, 40, 41, 43, 80]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 168 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 106/193 places, 116/198 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 106 transition count 115
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 105 transition count 115
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 4 place count 103 transition count 113
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 103 transition count 113
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 42 place count 85 transition count 95
Applied a total of 42 rules in 12 ms. Remains 85 /106 variables (removed 21) and now considering 95/116 (removed 21) transitions.
// Phase 1: matrix 95 rows 85 cols
[2023-03-15 22:40:09] [INFO ] Computed 20 place invariants in 0 ms
[2023-03-15 22:40:09] [INFO ] Implicit Places using invariants in 121 ms returned []
[2023-03-15 22:40:09] [INFO ] Invariant cache hit.
[2023-03-15 22:40:09] [INFO ] State equation strengthened by 66 read => feed constraints.
[2023-03-15 22:40:10] [INFO ] Implicit Places using invariants and state equation in 219 ms returned []
Implicit Place search using SMT with State Equation took 347 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 85/193 places, 95/198 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 571 ms. Remains : 85/193 places, 95/198 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-4-LTLFireability-06 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 (EQ s75 1) (EQ s79 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 0 reset in 242 ms.
Stack based approach found an accepted trace after 89 steps with 0 reset with depth 90 and stack size 90 in 1 ms.
FORMULA ParamProductionCell-PT-4-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property ParamProductionCell-PT-4-LTLFireability-06 finished in 881 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Support contains 5 out of 193 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 193/193 places, 198/198 transitions.
Drop transitions removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 37 rules applied. Total rules applied 37 place count 193 transition count 161
Reduce places removed 37 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 38 rules applied. Total rules applied 75 place count 156 transition count 160
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 76 place count 155 transition count 160
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 76 place count 155 transition count 149
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 98 place count 144 transition count 149
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 100 place count 142 transition count 147
Iterating global reduction 3 with 2 rules applied. Total rules applied 102 place count 142 transition count 147
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 160 place count 113 transition count 118
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 164 place count 111 transition count 116
Applied a total of 164 rules in 28 ms. Remains 111 /193 variables (removed 82) and now considering 116/198 (removed 82) transitions.
// Phase 1: matrix 116 rows 111 cols
[2023-03-15 22:40:10] [INFO ] Computed 25 place invariants in 1 ms
[2023-03-15 22:40:10] [INFO ] Implicit Places using invariants in 144 ms returned [42, 44, 81]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 146 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 108/193 places, 116/198 transitions.
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 0 with 28 rules applied. Total rules applied 28 place count 94 transition count 102
Applied a total of 28 rules in 6 ms. Remains 94 /108 variables (removed 14) and now considering 102/116 (removed 14) transitions.
// Phase 1: matrix 102 rows 94 cols
[2023-03-15 22:40:10] [INFO ] Computed 22 place invariants in 1 ms
[2023-03-15 22:40:10] [INFO ] Implicit Places using invariants in 98 ms returned []
[2023-03-15 22:40:10] [INFO ] Invariant cache hit.
[2023-03-15 22:40:10] [INFO ] State equation strengthened by 66 read => feed constraints.
[2023-03-15 22:40:10] [INFO ] Implicit Places using invariants and state equation in 209 ms returned []
Implicit Place search using SMT with State Equation took 309 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 94/193 places, 102/198 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 490 ms. Remains : 94/193 places, 102/198 transitions.
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ParamProductionCell-PT-4-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s7 1) (EQ s11 1)), p0:(AND (EQ s41 1) (EQ s45 1) (EQ s76 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 155 reset in 181 ms.
Stack based approach found an accepted trace after 184 steps with 1 reset with depth 129 and stack size 129 in 0 ms.
FORMULA ParamProductionCell-PT-4-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property ParamProductionCell-PT-4-LTLFireability-08 finished in 777 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G((F(p0)||X(G(p1))))))))'
Support contains 4 out of 193 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 198/198 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 192 transition count 197
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 192 transition count 197
Applied a total of 2 rules in 3 ms. Remains 192 /193 variables (removed 1) and now considering 197/198 (removed 1) transitions.
// Phase 1: matrix 197 rows 192 cols
[2023-03-15 22:40:11] [INFO ] Computed 25 place invariants in 3 ms
[2023-03-15 22:40:11] [INFO ] Implicit Places using invariants in 147 ms returned [16, 81, 139]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 148 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 189/193 places, 197/198 transitions.
Applied a total of 0 rules in 2 ms. Remains 189 /189 variables (removed 0) and now considering 197/197 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 155 ms. Remains : 189/193 places, 197/198 transitions.
Stuttering acceptance computed with spot in 274 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-4-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(AND (EQ s82 1) (EQ s131 1)), p1:(OR (EQ s80 0) (EQ s103 0))], 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][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 16683 reset in 298 ms.
Product exploration explored 100000 steps with 16710 reset in 298 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 99 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 410 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Finished random walk after 232 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=232 )
Knowledge obtained : [(AND (NOT p0) p1), true]
False Knowledge obtained : [(F p0), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 2 factoid took 192 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 290 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 275 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Support contains 4 out of 189 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 189/189 places, 197/197 transitions.
Applied a total of 0 rules in 2 ms. Remains 189 /189 variables (removed 0) and now considering 197/197 (removed 0) transitions.
// Phase 1: matrix 197 rows 189 cols
[2023-03-15 22:40:13] [INFO ] Computed 22 place invariants in 4 ms
[2023-03-15 22:40:13] [INFO ] Implicit Places using invariants in 136 ms returned []
[2023-03-15 22:40:13] [INFO ] Invariant cache hit.
[2023-03-15 22:40:13] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-15 22:40:14] [INFO ] Implicit Places using invariants and state equation in 388 ms returned []
Implicit Place search using SMT with State Equation took 526 ms to find 0 implicit places.
[2023-03-15 22:40:14] [INFO ] Invariant cache hit.
[2023-03-15 22:40:14] [INFO ] Dead Transitions using invariants and state equation in 207 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 736 ms. Remains : 189/189 places, 197/197 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 104 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 294 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Finished random walk after 8026 steps, including 2 resets, run visited all 2 properties in 12 ms. (steps per millisecond=668 )
Knowledge obtained : [(AND (NOT p0) p1), true]
False Knowledge obtained : [(F p0), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 2 factoid took 180 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 271 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 286 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 296 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Product exploration explored 100000 steps with 16618 reset in 152 ms.
Product exploration explored 100000 steps with 16648 reset in 172 ms.
Applying partial POR strategy [false, false, false, false, true, true]
Stuttering acceptance computed with spot in 330 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Support contains 4 out of 189 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 189/189 places, 197/197 transitions.
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 189 transition count 197
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 13 Pre rules applied. Total rules applied 34 place count 189 transition count 199
Deduced a syphon composed of 47 places in 0 ms
Iterating global reduction 1 with 13 rules applied. Total rules applied 47 place count 189 transition count 199
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 57 place count 179 transition count 188
Deduced a syphon composed of 37 places in 0 ms
Iterating global reduction 1 with 10 rules applied. Total rules applied 67 place count 179 transition count 188
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 69 places in 0 ms
Iterating global reduction 1 with 32 rules applied. Total rules applied 99 place count 179 transition count 188
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 122 place count 156 transition count 165
Deduced a syphon composed of 46 places in 0 ms
Iterating global reduction 1 with 23 rules applied. Total rules applied 145 place count 156 transition count 165
Deduced a syphon composed of 46 places in 0 ms
Applied a total of 145 rules in 42 ms. Remains 156 /189 variables (removed 33) and now considering 165/197 (removed 32) transitions.
[2023-03-15 22:40:16] [INFO ] Redundant transitions in 10 ms returned []
// Phase 1: matrix 165 rows 156 cols
[2023-03-15 22:40:16] [INFO ] Computed 22 place invariants in 3 ms
[2023-03-15 22:40:16] [INFO ] Dead Transitions using invariants and state equation in 365 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 156/189 places, 165/197 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 430 ms. Remains : 156/189 places, 165/197 transitions.
Built C files in :
/tmp/ltsmin7714539108858801360
[2023-03-15 22:40:17] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7714539108858801360
Running compilation step : cd /tmp/ltsmin7714539108858801360;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 660 ms.
Running link step : cd /tmp/ltsmin7714539108858801360;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin7714539108858801360;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7708158074405262358.hoa' '--buchi-type=spotba'
LTSmin run took 961 ms.
FORMULA ParamProductionCell-PT-4-LTLFireability-09 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ParamProductionCell-PT-4-LTLFireability-09 finished in 7468 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0||F(p1)))))'
Support contains 4 out of 193 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 198/198 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 192 transition count 197
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 192 transition count 197
Applied a total of 2 rules in 3 ms. Remains 192 /193 variables (removed 1) and now considering 197/198 (removed 1) transitions.
// Phase 1: matrix 197 rows 192 cols
[2023-03-15 22:40:18] [INFO ] Computed 25 place invariants in 1 ms
[2023-03-15 22:40:18] [INFO ] Implicit Places using invariants in 149 ms returned [16, 82, 84, 139]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 150 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 188/193 places, 197/198 transitions.
Applied a total of 0 rules in 2 ms. Remains 188 /188 variables (removed 0) and now considering 197/197 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 155 ms. Remains : 188/193 places, 197/198 transitions.
Stuttering acceptance computed with spot in 144 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ParamProductionCell-PT-4-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p1:(AND (EQ s80 1) (EQ s86 1)), p0:(AND (EQ s78 1) (EQ s124 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, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 18 reset in 110 ms.
Stack based approach found an accepted trace after 372 steps with 0 reset with depth 373 and stack size 373 in 1 ms.
FORMULA ParamProductionCell-PT-4-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property ParamProductionCell-PT-4-LTLFireability-13 finished in 424 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((F(p0)&&(p1 U p2)))))'
Support contains 6 out of 193 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 198/198 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 191 transition count 196
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 191 transition count 196
Applied a total of 4 rules in 4 ms. Remains 191 /193 variables (removed 2) and now considering 196/198 (removed 2) transitions.
// Phase 1: matrix 196 rows 191 cols
[2023-03-15 22:40:19] [INFO ] Computed 25 place invariants in 2 ms
[2023-03-15 22:40:19] [INFO ] Implicit Places using invariants in 178 ms returned [16, 81, 84, 138]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 179 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 187/193 places, 196/198 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 185 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 185 transition count 194
Applied a total of 4 rules in 3 ms. Remains 185 /187 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 185 cols
[2023-03-15 22:40:19] [INFO ] Computed 21 place invariants in 1 ms
[2023-03-15 22:40:19] [INFO ] Implicit Places using invariants in 161 ms returned []
[2023-03-15 22:40:19] [INFO ] Invariant cache hit.
[2023-03-15 22:40:19] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-15 22:40:19] [INFO ] Implicit Places using invariants and state equation in 488 ms returned []
Implicit Place search using SMT with State Equation took 653 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 185/193 places, 194/198 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 839 ms. Remains : 185/193 places, 194/198 transitions.
Stuttering acceptance computed with spot in 233 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), true, (NOT p0), (NOT p2)]
Running random walk in product with property : ParamProductionCell-PT-4-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR p2 p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p0) p1)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(AND (EQ s6 1) (EQ s115 1)), p1:(AND (EQ s80 1) (EQ s102 1)), p0:(AND (EQ s2 1) (EQ s157 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ParamProductionCell-PT-4-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-4-LTLFireability-14 finished in 1093 ms.
All properties solved by simple procedures.
Total runtime 33691 ms.

BK_STOP 1678920021082

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="ParamProductionCell-PT-4"
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-5348"
echo " Executing tool itstools"
echo " Input is ParamProductionCell-PT-4, 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 r261-smll-167863536300396"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ParamProductionCell-PT-4.tgz
mv ParamProductionCell-PT-4 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 ;