About the Execution of LTSMin+red for GPUForwardProgress-PT-16b
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
359.743 | 16634.00 | 31267.00 | 412.80 | TFFTFTFFFFFFFFFF | normal |
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.r201-smll-167840347200059.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 ltsminxred
Input is GPUForwardProgress-PT-16b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r201-smll-167840347200059
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 6.5K Feb 25 14:13 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Feb 25 14:13 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Feb 25 14:13 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K Feb 25 14:13 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 16:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:11 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 25 14:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 139K Feb 25 14:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Feb 25 14:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K Feb 25 14:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 84K Mar 5 18:22 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 GPUForwardProgress-PT-16b-LTLCardinality-00
FORMULA_NAME GPUForwardProgress-PT-16b-LTLCardinality-01
FORMULA_NAME GPUForwardProgress-PT-16b-LTLCardinality-02
FORMULA_NAME GPUForwardProgress-PT-16b-LTLCardinality-03
FORMULA_NAME GPUForwardProgress-PT-16b-LTLCardinality-04
FORMULA_NAME GPUForwardProgress-PT-16b-LTLCardinality-05
FORMULA_NAME GPUForwardProgress-PT-16b-LTLCardinality-06
FORMULA_NAME GPUForwardProgress-PT-16b-LTLCardinality-07
FORMULA_NAME GPUForwardProgress-PT-16b-LTLCardinality-08
FORMULA_NAME GPUForwardProgress-PT-16b-LTLCardinality-09
FORMULA_NAME GPUForwardProgress-PT-16b-LTLCardinality-10
FORMULA_NAME GPUForwardProgress-PT-16b-LTLCardinality-11
FORMULA_NAME GPUForwardProgress-PT-16b-LTLCardinality-12
FORMULA_NAME GPUForwardProgress-PT-16b-LTLCardinality-13
FORMULA_NAME GPUForwardProgress-PT-16b-LTLCardinality-14
FORMULA_NAME GPUForwardProgress-PT-16b-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1678521047318
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=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=GPUForwardProgress-PT-16b
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-11 07:50:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-11 07:50:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 07:50:50] [INFO ] Load time of PNML (sax parser for PT used): 101 ms
[2023-03-11 07:50:50] [INFO ] Transformed 340 places.
[2023-03-11 07:50:50] [INFO ] Transformed 357 transitions.
[2023-03-11 07:50:50] [INFO ] Found NUPN structural information;
[2023-03-11 07:50:50] [INFO ] Parsed PT model containing 340 places and 357 transitions and 877 arcs in 221 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA GPUForwardProgress-PT-16b-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-16b-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-16b-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-16b-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-16b-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-16b-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-16b-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 24 out of 340 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 340/340 places, 357/357 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 339 transition count 357
Discarding 36 places :
Symmetric choice reduction at 1 with 36 rule applications. Total rules 37 place count 303 transition count 321
Iterating global reduction 1 with 36 rules applied. Total rules applied 73 place count 303 transition count 321
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 88 place count 288 transition count 306
Iterating global reduction 1 with 15 rules applied. Total rules applied 103 place count 288 transition count 306
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 115 place count 288 transition count 294
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 116 place count 287 transition count 293
Iterating global reduction 2 with 1 rules applied. Total rules applied 117 place count 287 transition count 293
Applied a total of 117 rules in 123 ms. Remains 287 /340 variables (removed 53) and now considering 293/357 (removed 64) transitions.
// Phase 1: matrix 293 rows 287 cols
[2023-03-11 07:50:50] [INFO ] Computed 17 place invariants in 27 ms
[2023-03-11 07:50:50] [INFO ] Implicit Places using invariants in 391 ms returned []
[2023-03-11 07:50:50] [INFO ] Invariant cache hit.
[2023-03-11 07:50:51] [INFO ] Implicit Places using invariants and state equation in 390 ms returned []
Implicit Place search using SMT with State Equation took 829 ms to find 0 implicit places.
[2023-03-11 07:50:51] [INFO ] Invariant cache hit.
[2023-03-11 07:50:51] [INFO ] Dead Transitions using invariants and state equation in 308 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 287/340 places, 293/357 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1266 ms. Remains : 287/340 places, 293/357 transitions.
Support contains 24 out of 287 places after structural reductions.
[2023-03-11 07:50:51] [INFO ] Flatten gal took : 74 ms
[2023-03-11 07:50:51] [INFO ] Flatten gal took : 29 ms
[2023-03-11 07:50:52] [INFO ] Input system was already deterministic with 293 transitions.
Incomplete random walk after 10000 steps, including 69 resets, run finished after 541 ms. (steps per millisecond=18 ) properties (out of 16) seen :12
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-11 07:50:52] [INFO ] Invariant cache hit.
[2023-03-11 07:50:52] [INFO ] [Real]Absence check using 0 positive and 17 generalized place invariants in 16 ms returned sat
[2023-03-11 07:50:53] [INFO ] After 168ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2023-03-11 07:50:53] [INFO ] After 227ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:2
Attempting to minimize the solution found.
Minimization took 36 ms.
[2023-03-11 07:50:53] [INFO ] After 420ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:2
[2023-03-11 07:50:53] [INFO ] [Nat]Absence check using 0 positive and 17 generalized place invariants in 13 ms returned sat
[2023-03-11 07:50:53] [INFO ] After 211ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-11 07:50:53] [INFO ] After 307ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 59 ms.
[2023-03-11 07:50:53] [INFO ] After 539ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 2 properties in 21 ms.
Support contains 1 out of 287 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 287/287 places, 293/293 transitions.
Graph (trivial) has 240 edges and 287 vertex of which 6 / 287 are part of one of the 1 SCC in 11 ms
Free SCC test removed 5 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 439 edges and 282 vertex of which 262 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.4 ms
Discarding 20 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 135 transitions
Trivial Post-agglo rules discarded 135 transitions
Performed 135 trivial Post agglomeration. Transition count delta: 135
Iterating post reduction 0 with 137 rules applied. Total rules applied 139 place count 262 transition count 146
Reduce places removed 135 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 139 rules applied. Total rules applied 278 place count 127 transition count 142
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 279 place count 126 transition count 142
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 35 Pre rules applied. Total rules applied 279 place count 126 transition count 107
Deduced a syphon composed of 35 places in 1 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 349 place count 91 transition count 107
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 366 place count 74 transition count 90
Iterating global reduction 3 with 17 rules applied. Total rules applied 383 place count 74 transition count 90
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 383 place count 74 transition count 89
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 385 place count 73 transition count 89
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 3 with 98 rules applied. Total rules applied 483 place count 24 transition count 40
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 62 edges and 24 vertex of which 23 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 3 with 2 rules applied. Total rules applied 485 place count 23 transition count 39
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 487 place count 23 transition count 37
Discarding 14 places :
Symmetric choice reduction at 5 with 14 rule applications. Total rules 501 place count 9 transition count 9
Iterating global reduction 5 with 14 rules applied. Total rules applied 515 place count 9 transition count 9
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 5 rules applied. Total rules applied 520 place count 6 transition count 7
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 8 edges and 6 vertex of which 5 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 5 with 2 rules applied. Total rules applied 522 place count 5 transition count 6
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 523 place count 5 transition count 5
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 524 place count 5 transition count 4
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 525 place count 4 transition count 3
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 526 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 526 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 528 place count 2 transition count 2
Applied a total of 528 rules in 89 ms. Remains 2 /287 variables (removed 285) and now considering 2/293 (removed 291) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 89 ms. Remains : 2/287 places, 2/293 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
FORMULA GPUForwardProgress-PT-16b-LTLCardinality-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 52 stabilizing places and 52 stable transitions
Graph (complete) has 446 edges and 287 vertex of which 267 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.9 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' '!(((p0 U (p1&&X(p1)))&&X(X((X((F(!p3)||G(!p4)))&&p2)))))'
Support contains 8 out of 287 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 287/287 places, 293/293 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 282 transition count 288
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 282 transition count 288
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 282 transition count 286
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 281 transition count 285
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 281 transition count 285
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 15 place count 281 transition count 284
Applied a total of 15 rules in 26 ms. Remains 281 /287 variables (removed 6) and now considering 284/293 (removed 9) transitions.
// Phase 1: matrix 284 rows 281 cols
[2023-03-11 07:50:54] [INFO ] Computed 17 place invariants in 4 ms
[2023-03-11 07:50:54] [INFO ] Implicit Places using invariants in 137 ms returned []
[2023-03-11 07:50:54] [INFO ] Invariant cache hit.
[2023-03-11 07:50:54] [INFO ] Implicit Places using invariants and state equation in 290 ms returned []
Implicit Place search using SMT with State Equation took 434 ms to find 0 implicit places.
[2023-03-11 07:50:54] [INFO ] Invariant cache hit.
[2023-03-11 07:50:54] [INFO ] Dead Transitions using invariants and state equation in 252 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 281/287 places, 284/293 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 735 ms. Remains : 281/287 places, 284/293 transitions.
Stuttering acceptance computed with spot in 614 ms :[(OR (NOT p1) (NOT p2) (AND p3 p4)), true, (NOT p1), (NOT p1), (OR (NOT p2) (AND p3 p4)), (NOT p1), (OR (NOT p2) (AND p3 p4)), (AND p3 p4), p3]
Running random walk in product with property : GPUForwardProgress-PT-16b-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 3}, { cond=(OR p1 p0), acceptance={} source=0 dest: 4}, { cond=(AND p1 p0), acceptance={} source=0 dest: 5}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}, { cond=(AND p1 p0), acceptance={0} source=3 dest: 5}], [{ cond=true, acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=5 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=5 dest: 3}], [{ cond=(NOT p2), acceptance={} source=6 dest: 1}, { cond=p2, acceptance={} source=6 dest: 7}], [{ cond=(AND p3 (NOT p4)), acceptance={} source=7 dest: 7}, { cond=(AND p3 p4), acceptance={} source=7 dest: 8}], [{ cond=p3, acceptance={0} source=8 dest: 8}]], initial=0, aps=[p1:(OR (EQ s131 0) (EQ s210 1)), p0:(OR (EQ s244 0) (EQ s116 1)), p2:(AND (NEQ s81 0) (NEQ s47 1)), p3:(OR (EQ s253 0) (EQ s248 1)), p4:(OR (EQ s81 0) (EQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 2 ms.
FORMULA GPUForwardProgress-PT-16b-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-16b-LTLCardinality-01 finished in 1463 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 287 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 287/287 places, 293/293 transitions.
Graph (trivial) has 238 edges and 287 vertex of which 6 / 287 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 440 edges and 282 vertex of which 262 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.2 ms
Discarding 20 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 133 transitions
Trivial Post-agglo rules discarded 133 transitions
Performed 133 trivial Post agglomeration. Transition count delta: 133
Iterating post reduction 0 with 133 rules applied. Total rules applied 135 place count 261 transition count 150
Reduce places removed 133 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 139 rules applied. Total rules applied 274 place count 128 transition count 144
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 277 place count 126 transition count 143
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 278 place count 125 transition count 143
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 34 Pre rules applied. Total rules applied 278 place count 125 transition count 109
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 4 with 68 rules applied. Total rules applied 346 place count 91 transition count 109
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 361 place count 76 transition count 94
Iterating global reduction 4 with 15 rules applied. Total rules applied 376 place count 76 transition count 94
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 4 with 100 rules applied. Total rules applied 476 place count 26 transition count 44
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 477 place count 26 transition count 43
Discarding 15 places :
Symmetric choice reduction at 5 with 15 rule applications. Total rules 492 place count 11 transition count 14
Iterating global reduction 5 with 15 rules applied. Total rules applied 507 place count 11 transition count 14
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 509 place count 10 transition count 13
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 510 place count 9 transition count 12
Applied a total of 510 rules in 30 ms. Remains 9 /287 variables (removed 278) and now considering 12/293 (removed 281) transitions.
// Phase 1: matrix 12 rows 9 cols
[2023-03-11 07:50:55] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-11 07:50:55] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-11 07:50:55] [INFO ] Invariant cache hit.
[2023-03-11 07:50:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 07:50:55] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2023-03-11 07:50:55] [INFO ] Redundant transitions in 12 ms returned []
[2023-03-11 07:50:55] [INFO ] Invariant cache hit.
[2023-03-11 07:50:55] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/287 places, 12/293 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 133 ms. Remains : 9/287 places, 12/293 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-16b-LTLCardinality-02 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 (NEQ s4 0) (NEQ s7 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 4 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-16b-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-16b-LTLCardinality-02 finished in 190 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(p0)))'
Support contains 1 out of 287 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 287/287 places, 293/293 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 282 transition count 288
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 282 transition count 288
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 282 transition count 286
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 14 place count 280 transition count 284
Iterating global reduction 1 with 2 rules applied. Total rules applied 16 place count 280 transition count 284
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 18 place count 280 transition count 282
Applied a total of 18 rules in 136 ms. Remains 280 /287 variables (removed 7) and now considering 282/293 (removed 11) transitions.
// Phase 1: matrix 282 rows 280 cols
[2023-03-11 07:50:55] [INFO ] Computed 17 place invariants in 3 ms
[2023-03-11 07:50:55] [INFO ] Implicit Places using invariants in 107 ms returned []
[2023-03-11 07:50:55] [INFO ] Invariant cache hit.
[2023-03-11 07:50:56] [INFO ] Implicit Places using invariants and state equation in 234 ms returned []
Implicit Place search using SMT with State Equation took 345 ms to find 0 implicit places.
[2023-03-11 07:50:56] [INFO ] Invariant cache hit.
[2023-03-11 07:50:56] [INFO ] Dead Transitions using invariants and state equation in 224 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 280/287 places, 282/293 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 706 ms. Remains : 280/287 places, 282/293 transitions.
Stuttering acceptance computed with spot in 94 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-16b-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s249 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-16b-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-16b-LTLCardinality-07 finished in 816 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((p0||X(((p1 U X(p0)) U (p0&&(p1 U X(p0))))))))'
Support contains 1 out of 287 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 : 287/287 places, 293/293 transitions.
Graph (trivial) has 237 edges and 287 vertex of which 6 / 287 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 440 edges and 282 vertex of which 262 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.2 ms
Discarding 20 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 131 transitions
Trivial Post-agglo rules discarded 131 transitions
Performed 131 trivial Post agglomeration. Transition count delta: 131
Iterating post reduction 0 with 131 rules applied. Total rules applied 133 place count 261 transition count 152
Reduce places removed 131 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 134 rules applied. Total rules applied 267 place count 130 transition count 149
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 268 place count 129 transition count 149
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 35 Pre rules applied. Total rules applied 268 place count 129 transition count 114
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 338 place count 94 transition count 114
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 353 place count 79 transition count 99
Iterating global reduction 3 with 15 rules applied. Total rules applied 368 place count 79 transition count 99
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 3 with 98 rules applied. Total rules applied 466 place count 30 transition count 50
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 467 place count 30 transition count 49
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 480 place count 17 transition count 24
Iterating global reduction 4 with 13 rules applied. Total rules applied 493 place count 17 transition count 24
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 499 place count 14 transition count 23
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 501 place count 14 transition count 23
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 502 place count 13 transition count 22
Applied a total of 502 rules in 31 ms. Remains 13 /287 variables (removed 274) and now considering 22/293 (removed 271) transitions.
[2023-03-11 07:50:56] [INFO ] Flow matrix only has 20 transitions (discarded 2 similar events)
// Phase 1: matrix 20 rows 13 cols
[2023-03-11 07:50:56] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-11 07:50:56] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-11 07:50:56] [INFO ] Flow matrix only has 20 transitions (discarded 2 similar events)
[2023-03-11 07:50:56] [INFO ] Invariant cache hit.
[2023-03-11 07:50:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 07:50:56] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
[2023-03-11 07:50:56] [INFO ] Redundant transitions in 13 ms returned []
[2023-03-11 07:50:56] [INFO ] Flow matrix only has 20 transitions (discarded 2 similar events)
[2023-03-11 07:50:56] [INFO ] Invariant cache hit.
[2023-03-11 07:50:56] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 13/287 places, 22/293 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 158 ms. Remains : 13/287 places, 22/293 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-16b-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s0 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 1 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-16b-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-16b-LTLCardinality-08 finished in 215 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((F(p0) U X(p1)))))'
Support contains 3 out of 287 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 287/287 places, 293/293 transitions.
Graph (trivial) has 238 edges and 287 vertex of which 6 / 287 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 440 edges and 282 vertex of which 262 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.1 ms
Discarding 20 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 131 transitions
Trivial Post-agglo rules discarded 131 transitions
Performed 131 trivial Post agglomeration. Transition count delta: 131
Iterating post reduction 0 with 131 rules applied. Total rules applied 133 place count 262 transition count 153
Reduce places removed 131 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 136 rules applied. Total rules applied 269 place count 131 transition count 148
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 271 place count 129 transition count 148
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 36 Pre rules applied. Total rules applied 271 place count 129 transition count 112
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 72 rules applied. Total rules applied 343 place count 93 transition count 112
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 358 place count 78 transition count 97
Iterating global reduction 3 with 15 rules applied. Total rules applied 373 place count 78 transition count 97
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 3 with 102 rules applied. Total rules applied 475 place count 27 transition count 46
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 476 place count 27 transition count 45
Discarding 14 places :
Symmetric choice reduction at 4 with 14 rule applications. Total rules 490 place count 13 transition count 17
Iterating global reduction 4 with 14 rules applied. Total rules applied 504 place count 13 transition count 17
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 506 place count 12 transition count 16
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 508 place count 11 transition count 16
Applied a total of 508 rules in 25 ms. Remains 11 /287 variables (removed 276) and now considering 16/293 (removed 277) transitions.
[2023-03-11 07:50:56] [INFO ] Flow matrix only has 15 transitions (discarded 1 similar events)
// Phase 1: matrix 15 rows 11 cols
[2023-03-11 07:50:56] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-11 07:50:56] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-11 07:50:56] [INFO ] Flow matrix only has 15 transitions (discarded 1 similar events)
[2023-03-11 07:50:56] [INFO ] Invariant cache hit.
[2023-03-11 07:50:56] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-11 07:50:56] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
[2023-03-11 07:50:56] [INFO ] Redundant transitions in 11 ms returned []
[2023-03-11 07:50:56] [INFO ] Flow matrix only has 15 transitions (discarded 1 similar events)
[2023-03-11 07:50:56] [INFO ] Invariant cache hit.
[2023-03-11 07:50:56] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/287 places, 16/293 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 134 ms. Remains : 11/287 places, 16/293 transitions.
Stuttering acceptance computed with spot in 166 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), false]
Running random walk in product with property : GPUForwardProgress-PT-16b-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s4 0) (EQ s7 1)), p1:(EQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-16b-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-16b-LTLCardinality-10 finished in 324 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 1 out of 287 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 287/287 places, 293/293 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 282 transition count 288
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 282 transition count 288
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 282 transition count 286
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 14 place count 280 transition count 284
Iterating global reduction 1 with 2 rules applied. Total rules applied 16 place count 280 transition count 284
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 18 place count 280 transition count 282
Applied a total of 18 rules in 17 ms. Remains 280 /287 variables (removed 7) and now considering 282/293 (removed 11) transitions.
// Phase 1: matrix 282 rows 280 cols
[2023-03-11 07:50:57] [INFO ] Computed 17 place invariants in 3 ms
[2023-03-11 07:50:57] [INFO ] Implicit Places using invariants in 154 ms returned []
[2023-03-11 07:50:57] [INFO ] Invariant cache hit.
[2023-03-11 07:50:57] [INFO ] Implicit Places using invariants and state equation in 285 ms returned []
Implicit Place search using SMT with State Equation took 441 ms to find 0 implicit places.
[2023-03-11 07:50:57] [INFO ] Invariant cache hit.
[2023-03-11 07:50:57] [INFO ] Dead Transitions using invariants and state equation in 207 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 280/287 places, 282/293 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 667 ms. Remains : 280/287 places, 282/293 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-16b-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s238 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 2395 reset in 380 ms.
Product exploration explored 100000 steps with 2433 reset in 334 ms.
Computed a total of 51 stabilizing places and 51 stable transitions
Graph (complete) has 435 edges and 280 vertex of which 260 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.7 ms
Computed a total of 51 stabilizing places and 51 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 143 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Finished random walk after 42 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=42 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 146 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
[2023-03-11 07:50:59] [INFO ] Invariant cache hit.
[2023-03-11 07:50:59] [INFO ] [Real]Absence check using 0 positive and 17 generalized place invariants in 10 ms returned sat
[2023-03-11 07:50:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 07:50:59] [INFO ] [Real]Absence check using state equation in 163 ms returned sat
[2023-03-11 07:50:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 07:50:59] [INFO ] [Nat]Absence check using 0 positive and 17 generalized place invariants in 10 ms returned sat
[2023-03-11 07:50:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 07:50:59] [INFO ] [Nat]Absence check using state equation in 167 ms returned sat
[2023-03-11 07:50:59] [INFO ] Computed and/alt/rep : 276/362/276 causal constraints (skipped 5 transitions) in 23 ms.
[2023-03-11 07:51:01] [INFO ] Added : 262 causal constraints over 53 iterations in 1313 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 280 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 280/280 places, 282/282 transitions.
Graph (trivial) has 229 edges and 280 vertex of which 6 / 280 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 429 edges and 275 vertex of which 255 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.2 ms
Discarding 20 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 127 transitions
Trivial Post-agglo rules discarded 127 transitions
Performed 127 trivial Post agglomeration. Transition count delta: 127
Iterating post reduction 0 with 127 rules applied. Total rules applied 129 place count 254 transition count 145
Reduce places removed 127 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 128 rules applied. Total rules applied 257 place count 127 transition count 144
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 258 place count 126 transition count 144
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 36 Pre rules applied. Total rules applied 258 place count 126 transition count 108
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 72 rules applied. Total rules applied 330 place count 90 transition count 108
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 345 place count 75 transition count 93
Iterating global reduction 3 with 15 rules applied. Total rules applied 360 place count 75 transition count 93
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 3 with 100 rules applied. Total rules applied 460 place count 25 transition count 43
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 461 place count 25 transition count 42
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 476 place count 10 transition count 13
Iterating global reduction 4 with 15 rules applied. Total rules applied 491 place count 10 transition count 13
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 493 place count 9 transition count 12
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 494 place count 8 transition count 11
Applied a total of 494 rules in 28 ms. Remains 8 /280 variables (removed 272) and now considering 11/282 (removed 271) transitions.
// Phase 1: matrix 11 rows 8 cols
[2023-03-11 07:51:01] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-11 07:51:01] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-11 07:51:01] [INFO ] Invariant cache hit.
[2023-03-11 07:51:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 07:51:01] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2023-03-11 07:51:01] [INFO ] Redundant transitions in 12 ms returned []
[2023-03-11 07:51:01] [INFO ] Invariant cache hit.
[2023-03-11 07:51:01] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/280 places, 11/282 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 125 ms. Remains : 8/280 places, 11/282 transitions.
Computed a total of 2 stabilizing places and 4 stable transitions
Computed a total of 2 stabilizing places and 4 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 144 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 136 ms :[(NOT p0)]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 171 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
[2023-03-11 07:51:01] [INFO ] Invariant cache hit.
[2023-03-11 07:51:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 07:51:01] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-03-11 07:51:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 07:51:01] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-11 07:51:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 07:51:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 07:51:01] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2023-03-11 07:51:01] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-11 07:51:01] [INFO ] Computed and/alt/rep : 7/15/7 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-11 07:51:01] [INFO ] Added : 0 causal constraints over 0 iterations in 5 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA GPUForwardProgress-PT-16b-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-16b-LTLCardinality-11 finished in 4761 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(p0)))'
Support contains 2 out of 287 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 287/287 places, 293/293 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 283 transition count 289
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 283 transition count 289
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 283 transition count 288
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 11 place count 281 transition count 286
Iterating global reduction 1 with 2 rules applied. Total rules applied 13 place count 281 transition count 286
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 15 place count 281 transition count 284
Applied a total of 15 rules in 18 ms. Remains 281 /287 variables (removed 6) and now considering 284/293 (removed 9) transitions.
// Phase 1: matrix 284 rows 281 cols
[2023-03-11 07:51:01] [INFO ] Computed 17 place invariants in 2 ms
[2023-03-11 07:51:01] [INFO ] Implicit Places using invariants in 114 ms returned []
[2023-03-11 07:51:01] [INFO ] Invariant cache hit.
[2023-03-11 07:51:02] [INFO ] Implicit Places using invariants and state equation in 270 ms returned []
Implicit Place search using SMT with State Equation took 386 ms to find 0 implicit places.
[2023-03-11 07:51:02] [INFO ] Invariant cache hit.
[2023-03-11 07:51:02] [INFO ] Dead Transitions using invariants and state equation in 229 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 281/287 places, 284/293 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 636 ms. Remains : 281/287 places, 284/293 transitions.
Stuttering acceptance computed with spot in 91 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-16b-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (NEQ s79 0) (NEQ s248 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA GPUForwardProgress-PT-16b-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-16b-LTLCardinality-14 finished in 743 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((G(F(p0)) U p1))))'
Support contains 3 out of 287 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 287/287 places, 293/293 transitions.
Graph (trivial) has 239 edges and 287 vertex of which 6 / 287 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 440 edges and 282 vertex of which 262 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.2 ms
Discarding 20 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 132 transitions
Trivial Post-agglo rules discarded 132 transitions
Performed 132 trivial Post agglomeration. Transition count delta: 132
Iterating post reduction 0 with 132 rules applied. Total rules applied 134 place count 261 transition count 151
Reduce places removed 132 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 138 rules applied. Total rules applied 272 place count 129 transition count 145
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 275 place count 127 transition count 144
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 276 place count 126 transition count 144
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 35 Pre rules applied. Total rules applied 276 place count 126 transition count 109
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 4 with 70 rules applied. Total rules applied 346 place count 91 transition count 109
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 361 place count 76 transition count 94
Iterating global reduction 4 with 15 rules applied. Total rules applied 376 place count 76 transition count 94
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 4 with 96 rules applied. Total rules applied 472 place count 28 transition count 46
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 473 place count 28 transition count 45
Discarding 14 places :
Symmetric choice reduction at 5 with 14 rule applications. Total rules 487 place count 14 transition count 18
Iterating global reduction 5 with 14 rules applied. Total rules applied 501 place count 14 transition count 18
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 503 place count 13 transition count 17
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 504 place count 12 transition count 16
Applied a total of 504 rules in 21 ms. Remains 12 /287 variables (removed 275) and now considering 16/293 (removed 277) transitions.
// Phase 1: matrix 16 rows 12 cols
[2023-03-11 07:51:02] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-11 07:51:02] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-11 07:51:02] [INFO ] Invariant cache hit.
[2023-03-11 07:51:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 07:51:02] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2023-03-11 07:51:02] [INFO ] Redundant transitions in 12 ms returned []
[2023-03-11 07:51:02] [INFO ] Invariant cache hit.
[2023-03-11 07:51:02] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 12/287 places, 16/293 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 120 ms. Remains : 12/287 places, 16/293 transitions.
Stuttering acceptance computed with spot in 172 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : GPUForwardProgress-PT-16b-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(OR (EQ s8 0) (EQ s1 1)), p0:(EQ s5 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 72 steps with 8 reset in 1 ms.
FORMULA GPUForwardProgress-PT-16b-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-16b-LTLCardinality-15 finished in 312 ms.
All properties solved by simple procedures.
Total runtime 12986 ms.
ITS solved all properties within timeout
BK_STOP 1678521063952
--------------------
content from stderr:
+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
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="GPUForwardProgress-PT-16b"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is GPUForwardProgress-PT-16b, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r201-smll-167840347200059"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/GPUForwardProgress-PT-16b.tgz
mv GPUForwardProgress-PT-16b execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;