Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 920K
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 19 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 19 17:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 15:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 131K Apr 12 15:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 12 15:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K Apr 12 15:40 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:27 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 461K May 18 16:42 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 Anderson-PT-07-LTLFireability-00
FORMULA_NAME Anderson-PT-07-LTLFireability-01
FORMULA_NAME Anderson-PT-07-LTLFireability-02
FORMULA_NAME Anderson-PT-07-LTLFireability-03
FORMULA_NAME Anderson-PT-07-LTLFireability-04
FORMULA_NAME Anderson-PT-07-LTLFireability-05
FORMULA_NAME Anderson-PT-07-LTLFireability-06
FORMULA_NAME Anderson-PT-07-LTLFireability-07
FORMULA_NAME Anderson-PT-07-LTLFireability-08
FORMULA_NAME Anderson-PT-07-LTLFireability-09
FORMULA_NAME Anderson-PT-07-LTLFireability-10
FORMULA_NAME Anderson-PT-07-LTLFireability-11
FORMULA_NAME Anderson-PT-07-LTLFireability-12
FORMULA_NAME Anderson-PT-07-LTLFireability-13
FORMULA_NAME Anderson-PT-07-LTLFireability-14
FORMULA_NAME Anderson-PT-07-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716517417048

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=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Anderson-PT-07
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-24 02:23:40] [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]
[2024-05-24 02:23:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 02:23:41] [INFO ] Load time of PNML (sax parser for PT used): 237 ms
[2024-05-24 02:23:41] [INFO ] Transformed 309 places.
[2024-05-24 02:23:41] [INFO ] Transformed 917 transitions.
[2024-05-24 02:23:41] [INFO ] Found NUPN structural information;
[2024-05-24 02:23:41] [INFO ] Parsed PT model containing 309 places and 917 transitions and 3500 arcs in 415 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 7 formulas.
FORMULA Anderson-PT-07-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-07-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-07-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-07-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-07-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-07-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-07-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 23 out of 309 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 309/309 places, 917/917 transitions.
Discarding 72 places :
Symmetric choice reduction at 0 with 72 rule applications. Total rules 72 place count 237 transition count 461
Iterating global reduction 0 with 72 rules applied. Total rules applied 144 place count 237 transition count 461
Applied a total of 144 rules in 123 ms. Remains 237 /309 variables (removed 72) and now considering 461/917 (removed 456) transitions.
// Phase 1: matrix 461 rows 237 cols
[2024-05-24 02:23:41] [INFO ] Computed 17 invariants in 54 ms
[2024-05-24 02:23:42] [INFO ] Implicit Places using invariants in 896 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 962 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 236/309 places, 461/917 transitions.
Applied a total of 0 rules in 13 ms. Remains 236 /236 variables (removed 0) and now considering 461/461 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1108 ms. Remains : 236/309 places, 461/917 transitions.
Support contains 23 out of 236 places after structural reductions.
[2024-05-24 02:23:42] [INFO ] Flatten gal took : 155 ms
[2024-05-24 02:23:43] [INFO ] Flatten gal took : 73 ms
[2024-05-24 02:23:43] [INFO ] Input system was already deterministic with 461 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 909 ms. (steps per millisecond=11 ) properties (out of 16) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 8) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 461 rows 236 cols
[2024-05-24 02:23:44] [INFO ] Computed 16 invariants in 17 ms
[2024-05-24 02:23:45] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2024-05-24 02:23:45] [INFO ] [Real]Absence check using 8 positive and 8 generalized place invariants in 11 ms returned sat
[2024-05-24 02:23:45] [INFO ] After 505ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-24 02:23:45] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2024-05-24 02:23:45] [INFO ] [Nat]Absence check using 8 positive and 8 generalized place invariants in 17 ms returned sat
[2024-05-24 02:23:45] [INFO ] After 424ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-24 02:23:45] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-24 02:23:46] [INFO ] After 250ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-24 02:23:46] [INFO ] After 592ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 218 ms.
[2024-05-24 02:23:46] [INFO ] After 1425ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 52 ms.
Support contains 6 out of 236 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 461/461 transitions.
Drop transitions removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 45 place count 236 transition count 416
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 1 with 45 rules applied. Total rules applied 90 place count 191 transition count 416
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 42 Pre rules applied. Total rules applied 90 place count 191 transition count 374
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 174 place count 149 transition count 374
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 182 place count 141 transition count 294
Iterating global reduction 2 with 8 rules applied. Total rules applied 190 place count 141 transition count 294
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 2 with 4 rules applied. Total rules applied 194 place count 141 transition count 290
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 198 place count 137 transition count 290
Applied a total of 198 rules in 85 ms. Remains 137 /236 variables (removed 99) and now considering 290/461 (removed 171) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 85 ms. Remains : 137/236 places, 290/461 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 275 ms. (steps per millisecond=36 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 290 rows 137 cols
[2024-05-24 02:23:47] [INFO ] Computed 16 invariants in 8 ms
[2024-05-24 02:23:47] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-24 02:23:47] [INFO ] [Nat]Absence check using 9 positive place invariants in 7 ms returned sat
[2024-05-24 02:23:47] [INFO ] [Nat]Absence check using 9 positive and 7 generalized place invariants in 9 ms returned sat
[2024-05-24 02:23:47] [INFO ] After 154ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-24 02:23:47] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-24 02:23:47] [INFO ] After 69ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-24 02:23:47] [INFO ] After 131ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 45 ms.
[2024-05-24 02:23:47] [INFO ] After 420ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 137 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 137/137 places, 290/290 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 135 transition count 264
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 135 transition count 264
Applied a total of 4 rules in 20 ms. Remains 135 /137 variables (removed 2) and now considering 264/290 (removed 26) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 135/137 places, 264/290 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 221 ms. (steps per millisecond=45 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 2) seen :0
Finished probabilistic random walk after 20026 steps, run visited all 2 properties in 235 ms. (steps per millisecond=85 )
Probabilistic random walk after 20026 steps, saw 13275 distinct states, run finished after 235 ms. (steps per millisecond=85 ) properties seen :2
Parikh walk visited 0 properties in 0 ms.
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.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 236 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 236/236 places, 461/461 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 224 transition count 329
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 224 transition count 329
Applied a total of 24 rules in 9 ms. Remains 224 /236 variables (removed 12) and now considering 329/461 (removed 132) transitions.
// Phase 1: matrix 329 rows 224 cols
[2024-05-24 02:23:48] [INFO ] Computed 16 invariants in 3 ms
[2024-05-24 02:23:48] [INFO ] Implicit Places using invariants in 248 ms returned []
[2024-05-24 02:23:48] [INFO ] Invariant cache hit.
[2024-05-24 02:23:49] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-24 02:23:49] [INFO ] Implicit Places using invariants and state equation in 925 ms returned []
Implicit Place search using SMT with State Equation took 1180 ms to find 0 implicit places.
[2024-05-24 02:23:49] [INFO ] Invariant cache hit.
[2024-05-24 02:23:50] [INFO ] Dead Transitions using invariants and state equation in 540 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 224/236 places, 329/461 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1736 ms. Remains : 224/236 places, 329/461 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 348 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Anderson-PT-07-LTLFireability-01 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 s5 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 83 reset in 534 ms.
Stack based approach found an accepted trace after 81 steps with 0 reset with depth 82 and stack size 82 in 2 ms.
FORMULA Anderson-PT-07-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-07-LTLFireability-01 finished in 2692 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(p0)&&G(p1)))))'
Support contains 4 out of 236 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 236/236 places, 461/461 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 227 transition count 356
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 227 transition count 356
Applied a total of 18 rules in 14 ms. Remains 227 /236 variables (removed 9) and now considering 356/461 (removed 105) transitions.
// Phase 1: matrix 356 rows 227 cols
[2024-05-24 02:23:51] [INFO ] Computed 16 invariants in 5 ms
[2024-05-24 02:23:51] [INFO ] Implicit Places using invariants in 281 ms returned []
[2024-05-24 02:23:51] [INFO ] Invariant cache hit.
[2024-05-24 02:23:51] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-24 02:23:52] [INFO ] Implicit Places using invariants and state equation in 994 ms returned []
Implicit Place search using SMT with State Equation took 1279 ms to find 0 implicit places.
[2024-05-24 02:23:52] [INFO ] Invariant cache hit.
[2024-05-24 02:23:53] [INFO ] Dead Transitions using invariants and state equation in 458 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 227/236 places, 356/461 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1754 ms. Remains : 227/236 places, 356/461 transitions.
Stuttering acceptance computed with spot in 214 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : Anderson-PT-07-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=p1, acceptance={0} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 1}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s10 1) (EQ s22 1)), p0:(AND (EQ s65 1) (EQ s10 1) (EQ s23 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 218 ms.
Stack based approach found an accepted trace after 77 steps with 0 reset with depth 78 and stack size 78 in 0 ms.
FORMULA Anderson-PT-07-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-07-LTLFireability-02 finished in 2229 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0||X(X(p1))||(G(p2)&&F(p0))))))'
Support contains 3 out of 236 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 236/236 places, 461/461 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 226 transition count 343
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 226 transition count 343
Applied a total of 20 rules in 7 ms. Remains 226 /236 variables (removed 10) and now considering 343/461 (removed 118) transitions.
// Phase 1: matrix 343 rows 226 cols
[2024-05-24 02:23:53] [INFO ] Computed 16 invariants in 3 ms
[2024-05-24 02:23:53] [INFO ] Implicit Places using invariants in 277 ms returned []
[2024-05-24 02:23:53] [INFO ] Invariant cache hit.
[2024-05-24 02:23:54] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-24 02:23:54] [INFO ] Implicit Places using invariants and state equation in 938 ms returned []
Implicit Place search using SMT with State Equation took 1220 ms to find 0 implicit places.
[2024-05-24 02:23:54] [INFO ] Invariant cache hit.
[2024-05-24 02:23:55] [INFO ] Dead Transitions using invariants and state equation in 564 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 226/236 places, 343/461 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1794 ms. Remains : 226/236 places, 343/461 transitions.
Stuttering acceptance computed with spot in 610 ms :[(AND (NOT p0) (NOT p1)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p1)), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (NOT p0)), true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : Anderson-PT-07-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 5}, { cond=(AND (NOT p0) p2), acceptance={} source=0 dest: 6}], [{ cond=(AND p0 p2 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=1 dest: 7}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 8}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 8}], [{ cond=p2, acceptance={} source=3 dest: 3}, { cond=(NOT p2), acceptance={} source=3 dest: 8}], [{ cond=true, acceptance={} source=4 dest: 0}], [{ cond=true, acceptance={} source=5 dest: 10}], [{ cond=(AND (NOT p0) p2), acceptance={} source=6 dest: 1}, { cond=(AND p0 p2), acceptance={} source=6 dest: 2}, { cond=(NOT p2), acceptance={} source=6 dest: 10}], [{ cond=(AND p0 p2), acceptance={0} source=7 dest: 3}, { cond=(AND (NOT p0) p2), acceptance={0} source=7 dest: 7}, { cond=(NOT p2), acceptance={0} source=7 dest: 8}], [{ cond=true, acceptance={0} source=8 dest: 8}], [{ cond=true, acceptance={} source=9 dest: 4}], [{ cond=(NOT p1), acceptance={} source=10 dest: 8}]], initial=9, aps=[p0:(EQ s54 1), p2:(AND (EQ s18 1) (EQ s25 1)), p1:(EQ s54 0)], 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, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 20000 reset in 513 ms.
Product exploration explored 100000 steps with 20000 reset in 395 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) (NOT p2) p1), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) p2))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 99 ms. Reduced automaton from 11 states, 20 edges and 3 AP (stutter sensitive) to 6 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 203 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Finished random walk after 2702 steps, including 0 resets, run visited all 1 properties in 13 ms. (steps per millisecond=207 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) p2))))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 118 ms. Reduced automaton from 6 states, 6 edges and 1 AP (stutter sensitive) to 6 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 308 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Stuttering acceptance computed with spot in 281 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Support contains 1 out of 226 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 226/226 places, 343/343 transitions.
Applied a total of 0 rules in 8 ms. Remains 226 /226 variables (removed 0) and now considering 343/343 (removed 0) transitions.
[2024-05-24 02:23:57] [INFO ] Invariant cache hit.
[2024-05-24 02:23:58] [INFO ] Implicit Places using invariants in 337 ms returned []
[2024-05-24 02:23:58] [INFO ] Invariant cache hit.
[2024-05-24 02:23:58] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-24 02:23:59] [INFO ] Implicit Places using invariants and state equation in 1059 ms returned []
Implicit Place search using SMT with State Equation took 1398 ms to find 0 implicit places.
[2024-05-24 02:23:59] [INFO ] Invariant cache hit.
[2024-05-24 02:23:59] [INFO ] Dead Transitions using invariants and state equation in 557 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1968 ms. Remains : 226/226 places, 343/343 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 : [p1, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 107 ms. Reduced automaton from 6 states, 6 edges and 1 AP (stutter sensitive) to 6 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 266 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Finished random walk after 3376 steps, including 1 resets, run visited all 1 properties in 12 ms. (steps per millisecond=281 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p1, true]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 2 factoid took 102 ms. Reduced automaton from 6 states, 6 edges and 1 AP (stutter sensitive) to 6 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 216 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Stuttering acceptance computed with spot in 199 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Stuttering acceptance computed with spot in 256 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Product exploration explored 100000 steps with 20000 reset in 249 ms.
Product exploration explored 100000 steps with 20000 reset in 257 ms.
Applying partial POR strategy [true, false, false, false, true, false]
Stuttering acceptance computed with spot in 273 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Support contains 1 out of 226 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 226/226 places, 343/343 transitions.
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 49 rules applied. Total rules applied 49 place count 226 transition count 343
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 41 Pre rules applied. Total rules applied 49 place count 226 transition count 343
Deduced a syphon composed of 90 places in 0 ms
Iterating global reduction 1 with 41 rules applied. Total rules applied 90 place count 226 transition count 343
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 91 place count 225 transition count 330
Deduced a syphon composed of 90 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 92 place count 225 transition count 330
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 91 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 93 place count 225 transition count 330
Deduced a syphon composed of 91 places in 0 ms
Applied a total of 93 rules in 89 ms. Remains 225 /226 variables (removed 1) and now considering 330/343 (removed 13) transitions.
[2024-05-24 02:24:02] [INFO ] Redundant transitions in 42 ms returned []
// Phase 1: matrix 330 rows 225 cols
[2024-05-24 02:24:02] [INFO ] Computed 16 invariants in 5 ms
[2024-05-24 02:24:02] [INFO ] Dead Transitions using invariants and state equation in 471 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 225/226 places, 330/343 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 618 ms. Remains : 225/226 places, 330/343 transitions.
Built C files in :
/tmp/ltsmin1111335062910831943
[2024-05-24 02:24:02] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1111335062910831943
Running compilation step : cd /tmp/ltsmin1111335062910831943;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1320 ms.
Running link step : cd /tmp/ltsmin1111335062910831943;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin1111335062910831943;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15838485061984490549.hoa' '--buchi-type=spotba'
LTSmin run took 355 ms.
FORMULA Anderson-PT-07-LTLFireability-04 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property Anderson-PT-07-LTLFireability-04 finished in 10980 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 236 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 236/236 places, 461/461 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 48 place count 236 transition count 413
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 96 place count 188 transition count 413
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 42 Pre rules applied. Total rules applied 96 place count 188 transition count 371
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 180 place count 146 transition count 371
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 191 place count 135 transition count 252
Iterating global reduction 2 with 11 rules applied. Total rules applied 202 place count 135 transition count 252
Applied a total of 202 rules in 43 ms. Remains 135 /236 variables (removed 101) and now considering 252/461 (removed 209) transitions.
// Phase 1: matrix 252 rows 135 cols
[2024-05-24 02:24:04] [INFO ] Computed 16 invariants in 3 ms
[2024-05-24 02:24:04] [INFO ] Implicit Places using invariants in 278 ms returned []
[2024-05-24 02:24:04] [INFO ] Invariant cache hit.
[2024-05-24 02:24:05] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-24 02:24:05] [INFO ] Implicit Places using invariants and state equation in 633 ms returned []
Implicit Place search using SMT with State Equation took 915 ms to find 0 implicit places.
[2024-05-24 02:24:05] [INFO ] Redundant transitions in 6 ms returned []
[2024-05-24 02:24:05] [INFO ] Invariant cache hit.
[2024-05-24 02:24:05] [INFO ] Dead Transitions using invariants and state equation in 388 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 135/236 places, 252/461 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1363 ms. Remains : 135/236 places, 252/461 transitions.
Stuttering acceptance computed with spot in 191 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Anderson-PT-07-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s12 0) (EQ s22 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 12 reset in 246 ms.
Product exploration explored 100000 steps with 13 reset in 270 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 110 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0)]
Finished random walk after 863 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=287 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 151 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 135 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 135/135 places, 252/252 transitions.
Applied a total of 0 rules in 12 ms. Remains 135 /135 variables (removed 0) and now considering 252/252 (removed 0) transitions.
[2024-05-24 02:24:07] [INFO ] Invariant cache hit.
[2024-05-24 02:24:07] [INFO ] Implicit Places using invariants in 266 ms returned []
[2024-05-24 02:24:07] [INFO ] Invariant cache hit.
[2024-05-24 02:24:07] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-24 02:24:08] [INFO ] Implicit Places using invariants and state equation in 619 ms returned []
Implicit Place search using SMT with State Equation took 888 ms to find 0 implicit places.
[2024-05-24 02:24:08] [INFO ] Redundant transitions in 8 ms returned []
[2024-05-24 02:24:08] [INFO ] Invariant cache hit.
[2024-05-24 02:24:08] [INFO ] Dead Transitions using invariants and state equation in 366 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1288 ms. Remains : 135/135 places, 252/252 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 114 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1693 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=338 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 126 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 20 reset in 158 ms.
Product exploration explored 100000 steps with 19 reset in 168 ms.
Built C files in :
/tmp/ltsmin12638512506116198738
[2024-05-24 02:24:09] [INFO ] Computing symmetric may disable matrix : 252 transitions.
[2024-05-24 02:24:09] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 02:24:09] [INFO ] Computing symmetric may enable matrix : 252 transitions.
[2024-05-24 02:24:09] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 02:24:09] [INFO ] Computing Do-Not-Accords matrix : 252 transitions.
[2024-05-24 02:24:09] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 02:24:09] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12638512506116198738
Running compilation step : cd /tmp/ltsmin12638512506116198738;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 717 ms.
Running link step : cd /tmp/ltsmin12638512506116198738;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin12638512506116198738;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased301501038187684883.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 135 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 135/135 places, 252/252 transitions.
Applied a total of 0 rules in 7 ms. Remains 135 /135 variables (removed 0) and now considering 252/252 (removed 0) transitions.
[2024-05-24 02:24:24] [INFO ] Invariant cache hit.
[2024-05-24 02:24:24] [INFO ] Implicit Places using invariants in 195 ms returned []
[2024-05-24 02:24:24] [INFO ] Invariant cache hit.
[2024-05-24 02:24:24] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-24 02:24:25] [INFO ] Implicit Places using invariants and state equation in 437 ms returned []
Implicit Place search using SMT with State Equation took 634 ms to find 0 implicit places.
[2024-05-24 02:24:25] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-24 02:24:25] [INFO ] Invariant cache hit.
[2024-05-24 02:24:25] [INFO ] Dead Transitions using invariants and state equation in 252 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 903 ms. Remains : 135/135 places, 252/252 transitions.
Built C files in :
/tmp/ltsmin16112961654216632840
[2024-05-24 02:24:25] [INFO ] Computing symmetric may disable matrix : 252 transitions.
[2024-05-24 02:24:25] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 02:24:25] [INFO ] Computing symmetric may enable matrix : 252 transitions.
[2024-05-24 02:24:25] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 02:24:25] [INFO ] Computing Do-Not-Accords matrix : 252 transitions.
[2024-05-24 02:24:25] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 02:24:25] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16112961654216632840
Running compilation step : cd /tmp/ltsmin16112961654216632840;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 731 ms.
Running link step : cd /tmp/ltsmin16112961654216632840;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin16112961654216632840;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15265188774992228164.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-24 02:24:40] [INFO ] Flatten gal took : 23 ms
[2024-05-24 02:24:40] [INFO ] Flatten gal took : 22 ms
[2024-05-24 02:24:40] [INFO ] Time to serialize gal into /tmp/LTL9133778335524431578.gal : 5 ms
[2024-05-24 02:24:40] [INFO ] Time to serialize properties into /tmp/LTL11206330730383510566.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9133778335524431578.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3927460449020020293.hoa' '-atoms' '/tmp/LTL11206330730383510566.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL11206330730383510566.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3927460449020020293.hoa
Detected timeout of ITS tools.
[2024-05-24 02:24:55] [INFO ] Flatten gal took : 19 ms
[2024-05-24 02:24:55] [INFO ] Flatten gal took : 19 ms
[2024-05-24 02:24:55] [INFO ] Time to serialize gal into /tmp/LTL7386078885391251749.gal : 5 ms
[2024-05-24 02:24:55] [INFO ] Time to serialize properties into /tmp/LTL11610616598978852161.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7386078885391251749.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11610616598978852161.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F("((next_5==0)||(ncs_0_3==0))"))))
Formula 0 simplified : FG!"((next_5==0)||(ncs_0_3==0))"
Detected timeout of ITS tools.
[2024-05-24 02:25:10] [INFO ] Flatten gal took : 18 ms
[2024-05-24 02:25:10] [INFO ] Applying decomposition
[2024-05-24 02:25:11] [INFO ] Flatten gal took : 16 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph11343196435254405024.txt' '-o' '/tmp/graph11343196435254405024.bin' '-w' '/tmp/graph11343196435254405024.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph11343196435254405024.bin' '-l' '-1' '-v' '-w' '/tmp/graph11343196435254405024.weights' '-q' '0' '-e' '0.001'
[2024-05-24 02:25:11] [INFO ] Decomposing Gal with order
[2024-05-24 02:25:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 02:25:11] [INFO ] Removed a total of 423 redundant transitions.
[2024-05-24 02:25:11] [INFO ] Flatten gal took : 93 ms
[2024-05-24 02:25:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 9 labels/synchronizations in 12 ms.
[2024-05-24 02:25:11] [INFO ] Time to serialize gal into /tmp/LTL3096315749121622807.gal : 7 ms
[2024-05-24 02:25:11] [INFO ] Time to serialize properties into /tmp/LTL15461244090926906247.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3096315749121622807.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15461244090926906247.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(F("((i3.u4.next_5==0)||(i4.u25.ncs_0_3==0))"))))
Formula 0 simplified : FG!"((i3.u4.next_5==0)||(i4.u25.ncs_0_3==0))"
Reverse transition relation is NOT exact ! Due to transitions t363_t412, t364_t413, t365_t414, t368_t417, t369_t418, t370_t419, t371_t420, t372_t421, t373_...700
2 unique states visited
0 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
669 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,6.72756,185376,1,0,269464,3579,3102,262193,345,45448,1609751
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA Anderson-PT-07-LTLFireability-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property Anderson-PT-07-LTLFireability-06 finished in 74101 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||(F(p1)&&G(p2)))))'
Support contains 4 out of 236 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 236/236 places, 461/461 transitions.
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 236 transition count 427
Reduce places removed 34 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 41 rules applied. Total rules applied 75 place count 202 transition count 420
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 82 place count 195 transition count 420
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 42 Pre rules applied. Total rules applied 82 place count 195 transition count 378
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 166 place count 153 transition count 378
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 177 place count 142 transition count 259
Iterating global reduction 3 with 11 rules applied. Total rules applied 188 place count 142 transition count 259
Applied a total of 188 rules in 24 ms. Remains 142 /236 variables (removed 94) and now considering 259/461 (removed 202) transitions.
// Phase 1: matrix 259 rows 142 cols
[2024-05-24 02:25:18] [INFO ] Computed 16 invariants in 2 ms
[2024-05-24 02:25:18] [INFO ] Implicit Places using invariants in 208 ms returned []
[2024-05-24 02:25:18] [INFO ] Invariant cache hit.
[2024-05-24 02:25:19] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-24 02:25:19] [INFO ] Implicit Places using invariants and state equation in 396 ms returned []
Implicit Place search using SMT with State Equation took 607 ms to find 0 implicit places.
[2024-05-24 02:25:19] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-24 02:25:19] [INFO ] Invariant cache hit.
[2024-05-24 02:25:19] [INFO ] Dead Transitions using invariants and state equation in 267 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 142/236 places, 259/461 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 915 ms. Remains : 142/236 places, 259/461 transitions.
Stuttering acceptance computed with spot in 121 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : Anderson-PT-07-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 1}, { cond=(AND p0 p2), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={1} source=0 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=1 dest: 1}], [{ cond=(AND p0 (NOT p2)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=2 dest: 0}, { cond=(AND p0 p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={1} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s8 1) (EQ s26 1)), p2:(AND (EQ s4 1) (EQ s115 1)), p1:(OR (EQ s4 0) (EQ s115 0))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 112 reset in 198 ms.
Stack based approach found an accepted trace after 28 steps with 0 reset with depth 29 and stack size 29 in 0 ms.
FORMULA Anderson-PT-07-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-07-LTLFireability-07 finished in 1254 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 236 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 236/236 places, 461/461 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 48 place count 236 transition count 413
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 96 place count 188 transition count 413
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 42 Pre rules applied. Total rules applied 96 place count 188 transition count 371
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 180 place count 146 transition count 371
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 191 place count 135 transition count 252
Iterating global reduction 2 with 11 rules applied. Total rules applied 202 place count 135 transition count 252
Applied a total of 202 rules in 17 ms. Remains 135 /236 variables (removed 101) and now considering 252/461 (removed 209) transitions.
// Phase 1: matrix 252 rows 135 cols
[2024-05-24 02:25:19] [INFO ] Computed 16 invariants in 2 ms
[2024-05-24 02:25:20] [INFO ] Implicit Places using invariants in 151 ms returned []
[2024-05-24 02:25:20] [INFO ] Invariant cache hit.
[2024-05-24 02:25:20] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-24 02:25:20] [INFO ] Implicit Places using invariants and state equation in 385 ms returned []
Implicit Place search using SMT with State Equation took 539 ms to find 0 implicit places.
[2024-05-24 02:25:20] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-24 02:25:20] [INFO ] Invariant cache hit.
[2024-05-24 02:25:20] [INFO ] Dead Transitions using invariants and state equation in 278 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 135/236 places, 252/461 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 854 ms. Remains : 135/236 places, 252/461 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Anderson-PT-07-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s7 1) (EQ s27 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 139 ms.
Stack based approach found an accepted trace after 48 steps with 0 reset with depth 49 and stack size 49 in 0 ms.
FORMULA Anderson-PT-07-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-07-LTLFireability-11 finished in 1090 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(p1))||p0)))'
Support contains 4 out of 236 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 236/236 places, 461/461 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 226 transition count 355
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 226 transition count 355
Applied a total of 20 rules in 5 ms. Remains 226 /236 variables (removed 10) and now considering 355/461 (removed 106) transitions.
// Phase 1: matrix 355 rows 226 cols
[2024-05-24 02:25:21] [INFO ] Computed 16 invariants in 2 ms
[2024-05-24 02:25:21] [INFO ] Implicit Places using invariants in 219 ms returned []
[2024-05-24 02:25:21] [INFO ] Invariant cache hit.
[2024-05-24 02:25:21] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-24 02:25:21] [INFO ] Implicit Places using invariants and state equation in 679 ms returned []
Implicit Place search using SMT with State Equation took 904 ms to find 0 implicit places.
[2024-05-24 02:25:21] [INFO ] Invariant cache hit.
[2024-05-24 02:25:22] [INFO ] Dead Transitions using invariants and state equation in 390 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 226/236 places, 355/461 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1306 ms. Remains : 226/236 places, 355/461 transitions.
Stuttering acceptance computed with spot in 150 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : Anderson-PT-07-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s19 0) (EQ s24 0)), p1:(AND (EQ s18 1) (EQ s22 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][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 359 ms.
Product exploration explored 100000 steps with 50000 reset in 365 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 p0 (NOT p1)), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 15 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Anderson-PT-07-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Anderson-PT-07-LTLFireability-12 finished in 2221 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 236 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 236/236 places, 461/461 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 48 place count 236 transition count 413
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 96 place count 188 transition count 413
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 42 Pre rules applied. Total rules applied 96 place count 188 transition count 371
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 180 place count 146 transition count 371
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 191 place count 135 transition count 252
Iterating global reduction 2 with 11 rules applied. Total rules applied 202 place count 135 transition count 252
Applied a total of 202 rules in 19 ms. Remains 135 /236 variables (removed 101) and now considering 252/461 (removed 209) transitions.
// Phase 1: matrix 252 rows 135 cols
[2024-05-24 02:25:23] [INFO ] Computed 16 invariants in 2 ms
[2024-05-24 02:25:23] [INFO ] Implicit Places using invariants in 178 ms returned []
[2024-05-24 02:25:23] [INFO ] Invariant cache hit.
[2024-05-24 02:25:23] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-24 02:25:23] [INFO ] Implicit Places using invariants and state equation in 372 ms returned []
Implicit Place search using SMT with State Equation took 553 ms to find 0 implicit places.
[2024-05-24 02:25:23] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-24 02:25:23] [INFO ] Invariant cache hit.
[2024-05-24 02:25:24] [INFO ] Dead Transitions using invariants and state equation in 256 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 135/236 places, 252/461 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 837 ms. Remains : 135/236 places, 252/461 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Anderson-PT-07-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s18 0) (EQ s23 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 137 ms.
Product exploration explored 100000 steps with 0 reset in 228 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 77 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 18486 steps, run visited all 1 properties in 57 ms. (steps per millisecond=324 )
Probabilistic random walk after 18486 steps, saw 12512 distinct states, run finished after 57 ms. (steps per millisecond=324 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 97 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 135 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 135/135 places, 252/252 transitions.
Applied a total of 0 rules in 5 ms. Remains 135 /135 variables (removed 0) and now considering 252/252 (removed 0) transitions.
[2024-05-24 02:25:25] [INFO ] Invariant cache hit.
[2024-05-24 02:25:25] [INFO ] Implicit Places using invariants in 186 ms returned []
[2024-05-24 02:25:25] [INFO ] Invariant cache hit.
[2024-05-24 02:25:25] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-24 02:25:25] [INFO ] Implicit Places using invariants and state equation in 343 ms returned []
Implicit Place search using SMT with State Equation took 532 ms to find 0 implicit places.
[2024-05-24 02:25:25] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-24 02:25:25] [INFO ] Invariant cache hit.
[2024-05-24 02:25:25] [INFO ] Dead Transitions using invariants and state equation in 255 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 800 ms. Remains : 135/135 places, 252/252 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 76 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Finished probabilistic random walk after 18486 steps, run visited all 1 properties in 53 ms. (steps per millisecond=348 )
Probabilistic random walk after 18486 steps, saw 12512 distinct states, run finished after 54 ms. (steps per millisecond=342 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 201 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 140 ms.
Product exploration explored 100000 steps with 0 reset in 269 ms.
Built C files in :
/tmp/ltsmin4406082170203657095
[2024-05-24 02:25:26] [INFO ] Computing symmetric may disable matrix : 252 transitions.
[2024-05-24 02:25:26] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 02:25:26] [INFO ] Computing symmetric may enable matrix : 252 transitions.
[2024-05-24 02:25:26] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 02:25:26] [INFO ] Computing Do-Not-Accords matrix : 252 transitions.
[2024-05-24 02:25:26] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 02:25:26] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4406082170203657095
Running compilation step : cd /tmp/ltsmin4406082170203657095;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 791 ms.
Running link step : cd /tmp/ltsmin4406082170203657095;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin4406082170203657095;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased9289668060583864403.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 135 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 135/135 places, 252/252 transitions.
Applied a total of 0 rules in 6 ms. Remains 135 /135 variables (removed 0) and now considering 252/252 (removed 0) transitions.
[2024-05-24 02:25:42] [INFO ] Invariant cache hit.
[2024-05-24 02:25:42] [INFO ] Implicit Places using invariants in 217 ms returned []
[2024-05-24 02:25:42] [INFO ] Invariant cache hit.
[2024-05-24 02:25:42] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-24 02:25:42] [INFO ] Implicit Places using invariants and state equation in 389 ms returned []
Implicit Place search using SMT with State Equation took 608 ms to find 0 implicit places.
[2024-05-24 02:25:42] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-24 02:25:42] [INFO ] Invariant cache hit.
[2024-05-24 02:25:42] [INFO ] Dead Transitions using invariants and state equation in 282 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 903 ms. Remains : 135/135 places, 252/252 transitions.
Built C files in :
/tmp/ltsmin15560197712883651204
[2024-05-24 02:25:43] [INFO ] Computing symmetric may disable matrix : 252 transitions.
[2024-05-24 02:25:43] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 02:25:43] [INFO ] Computing symmetric may enable matrix : 252 transitions.
[2024-05-24 02:25:43] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 02:25:43] [INFO ] Computing Do-Not-Accords matrix : 252 transitions.
[2024-05-24 02:25:43] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 02:25:43] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15560197712883651204
Running compilation step : cd /tmp/ltsmin15560197712883651204;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 732 ms.
Running link step : cd /tmp/ltsmin15560197712883651204;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin15560197712883651204;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4982673226375447102.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-24 02:25:58] [INFO ] Flatten gal took : 18 ms
[2024-05-24 02:25:58] [INFO ] Flatten gal took : 18 ms
[2024-05-24 02:25:58] [INFO ] Time to serialize gal into /tmp/LTL5131440926662281731.gal : 3 ms
[2024-05-24 02:25:58] [INFO ] Time to serialize properties into /tmp/LTL12871197154945419183.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5131440926662281731.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8413927209574556072.hoa' '-atoms' '/tmp/LTL12871197154945419183.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL12871197154945419183.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8413927209574556072.hoa
Detected timeout of ITS tools.
[2024-05-24 02:26:13] [INFO ] Flatten gal took : 17 ms
[2024-05-24 02:26:13] [INFO ] Flatten gal took : 25 ms
[2024-05-24 02:26:13] [INFO ] Time to serialize gal into /tmp/LTL10504193453440784165.gal : 3 ms
[2024-05-24 02:26:13] [INFO ] Time to serialize properties into /tmp/LTL12798469984773588431.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10504193453440784165.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12798469984773588431.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G(F("((next_11==0)||(ncs_1_1==0))"))))
Formula 0 simplified : FG!"((next_11==0)||(ncs_1_1==0))"
Detected timeout of ITS tools.
[2024-05-24 02:26:28] [INFO ] Flatten gal took : 15 ms
[2024-05-24 02:26:28] [INFO ] Applying decomposition
[2024-05-24 02:26:28] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph843598332718481033.txt' '-o' '/tmp/graph843598332718481033.bin' '-w' '/tmp/graph843598332718481033.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph843598332718481033.bin' '-l' '-1' '-v' '-w' '/tmp/graph843598332718481033.weights' '-q' '0' '-e' '0.001'
[2024-05-24 02:26:28] [INFO ] Decomposing Gal with order
[2024-05-24 02:26:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 02:26:28] [INFO ] Removed a total of 401 redundant transitions.
[2024-05-24 02:26:28] [INFO ] Flatten gal took : 33 ms
[2024-05-24 02:26:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 60 labels/synchronizations in 12 ms.
[2024-05-24 02:26:28] [INFO ] Time to serialize gal into /tmp/LTL1338856945314323446.gal : 4 ms
[2024-05-24 02:26:28] [INFO ] Time to serialize properties into /tmp/LTL3080303938732625751.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1338856945314323446.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3080303938732625751.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((G(F("((i2.u6.next_11==0)||(i3.u8.ncs_1_1==0))"))))
Formula 0 simplified : FG!"((i2.u6.next_11==0)||(i3.u8.ncs_1_1==0))"
Reverse transition relation is NOT exact ! Due to transitions t369_t418, t374_t423, t375_t424, t376_t425, t377_t426, t378_t427, t379_t428, t380_t429, t381_...711
2 unique states visited
0 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
831 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,8.34859,170520,1,0,247252,4206,2828,420093,361,58622,1180956
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA Anderson-PT-07-LTLFireability-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property Anderson-PT-07-LTLFireability-13 finished in 74388 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((F(G(p1))&&p0))))'
Support contains 4 out of 236 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 236/236 places, 461/461 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 226 transition count 355
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 226 transition count 355
Applied a total of 20 rules in 6 ms. Remains 226 /236 variables (removed 10) and now considering 355/461 (removed 106) transitions.
// Phase 1: matrix 355 rows 226 cols
[2024-05-24 02:26:37] [INFO ] Computed 16 invariants in 3 ms
[2024-05-24 02:26:37] [INFO ] Implicit Places using invariants in 219 ms returned []
[2024-05-24 02:26:37] [INFO ] Invariant cache hit.
[2024-05-24 02:26:38] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-24 02:26:38] [INFO ] Implicit Places using invariants and state equation in 816 ms returned []
Implicit Place search using SMT with State Equation took 1037 ms to find 0 implicit places.
[2024-05-24 02:26:38] [INFO ] Invariant cache hit.
[2024-05-24 02:26:39] [INFO ] Dead Transitions using invariants and state equation in 413 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 226/236 places, 355/461 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1457 ms. Remains : 226/236 places, 355/461 transitions.
Stuttering acceptance computed with spot in 142 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : Anderson-PT-07-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s10 1) (EQ s24 1)), p1:(OR (EQ s9 0) (EQ s27 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Anderson-PT-07-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Anderson-PT-07-LTLFireability-14 finished in 1619 ms.
All properties solved by simple procedures.
Total runtime 178596 ms.

BK_STOP 1716517600307

--------------------
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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /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="Anderson-PT-07"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is Anderson-PT-07, 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 r021-smll-171620128200213"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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