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.r373-tall-171683788300018.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 ShieldIIPs-PT-002B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r373-tall-171683788300018
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 66K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 16:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 23 07:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 23 07:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 11 14:25 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 183K Apr 11 14:25 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Apr 11 14:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Apr 11 14:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:51 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 33K May 18 16:43 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 ShieldIIPs-PT-002B-LTLFireability-00
FORMULA_NAME ShieldIIPs-PT-002B-LTLFireability-01
FORMULA_NAME ShieldIIPs-PT-002B-LTLFireability-02
FORMULA_NAME ShieldIIPs-PT-002B-LTLFireability-03
FORMULA_NAME ShieldIIPs-PT-002B-LTLFireability-04
FORMULA_NAME ShieldIIPs-PT-002B-LTLFireability-05
FORMULA_NAME ShieldIIPs-PT-002B-LTLFireability-06
FORMULA_NAME ShieldIIPs-PT-002B-LTLFireability-07
FORMULA_NAME ShieldIIPs-PT-002B-LTLFireability-08
FORMULA_NAME ShieldIIPs-PT-002B-LTLFireability-09
FORMULA_NAME ShieldIIPs-PT-002B-LTLFireability-10
FORMULA_NAME ShieldIIPs-PT-002B-LTLFireability-11
FORMULA_NAME ShieldIIPs-PT-002B-LTLFireability-12
FORMULA_NAME ShieldIIPs-PT-002B-LTLFireability-13
FORMULA_NAME ShieldIIPs-PT-002B-LTLFireability-14
FORMULA_NAME ShieldIIPs-PT-002B-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716927234331

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=ShieldIIPs-PT-002B
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-28 20:13:56] [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-28 20:13:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 20:13:56] [INFO ] Load time of PNML (sax parser for PT used): 48 ms
[2024-05-28 20:13:56] [INFO ] Transformed 123 places.
[2024-05-28 20:13:56] [INFO ] Transformed 121 transitions.
[2024-05-28 20:13:56] [INFO ] Found NUPN structural information;
[2024-05-28 20:13:56] [INFO ] Parsed PT model containing 123 places and 121 transitions and 362 arcs in 118 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA ShieldIIPs-PT-002B-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-002B-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 34 out of 123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 121/121 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 113 transition count 111
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 113 transition count 111
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 112 transition count 110
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 112 transition count 110
Applied a total of 22 rules in 30 ms. Remains 112 /123 variables (removed 11) and now considering 110/121 (removed 11) transitions.
// Phase 1: matrix 110 rows 112 cols
[2024-05-28 20:13:56] [INFO ] Computed 19 invariants in 14 ms
[2024-05-28 20:13:57] [INFO ] Implicit Places using invariants in 192 ms returned []
[2024-05-28 20:13:57] [INFO ] Invariant cache hit.
[2024-05-28 20:13:57] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 331 ms to find 0 implicit places.
[2024-05-28 20:13:57] [INFO ] Invariant cache hit.
[2024-05-28 20:13:57] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 112/123 places, 110/121 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 449 ms. Remains : 112/123 places, 110/121 transitions.
Support contains 34 out of 112 places after structural reductions.
[2024-05-28 20:13:57] [INFO ] Flatten gal took : 29 ms
[2024-05-28 20:13:57] [INFO ] Flatten gal took : 17 ms
[2024-05-28 20:13:57] [INFO ] Input system was already deterministic with 110 transitions.
Incomplete random walk after 10000 steps, including 27 resets, run finished after 362 ms. (steps per millisecond=27 ) properties (out of 24) seen :21
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-28 20:13:57] [INFO ] Invariant cache hit.
[2024-05-28 20:13:58] [INFO ] [Real]Absence check using 19 positive place invariants in 10 ms returned sat
[2024-05-28 20:13:58] [INFO ] After 70ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2024-05-28 20:13:58] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 4 ms to minimize.
[2024-05-28 20:13:58] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 1 ms to minimize.
[2024-05-28 20:13:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 89 ms
[2024-05-28 20:13:58] [INFO ] After 171ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-28 20:13:58] [INFO ] After 266ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-28 20:13:58] [INFO ] [Nat]Absence check using 19 positive place invariants in 5 ms returned sat
[2024-05-28 20:13:58] [INFO ] After 46ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-28 20:13:58] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-05-28 20:13:58] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 1 ms to minimize.
[2024-05-28 20:13:58] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-05-28 20:13:58] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 0 ms to minimize.
[2024-05-28 20:13:58] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
[2024-05-28 20:13:58] [INFO ] Deduced a trap composed of 32 places in 32 ms of which 0 ms to minimize.
[2024-05-28 20:13:58] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 1 ms to minimize.
[2024-05-28 20:13:58] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 284 ms
[2024-05-28 20:13:58] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 1 ms to minimize.
[2024-05-28 20:13:58] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
[2024-05-28 20:13:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 105 ms
[2024-05-28 20:13:58] [INFO ] After 461ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 20 ms.
[2024-05-28 20:13:58] [INFO ] After 526ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 11 ms.
Support contains 6 out of 112 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 112/112 places, 110/110 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 112 transition count 101
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 103 transition count 101
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 18 place count 103 transition count 90
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 40 place count 92 transition count 90
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 43 place count 89 transition count 87
Iterating global reduction 2 with 3 rules applied. Total rules applied 46 place count 89 transition count 87
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 46 place count 89 transition count 86
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 48 place count 88 transition count 86
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 1 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 110 place count 57 transition count 55
Partial Free-agglomeration rule applied 14 times.
Drop transitions removed 14 transitions
Iterating global reduction 2 with 14 rules applied. Total rules applied 124 place count 57 transition count 55
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 125 place count 56 transition count 54
Applied a total of 125 rules in 33 ms. Remains 56 /112 variables (removed 56) and now considering 54/110 (removed 56) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 56/112 places, 54/110 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 164 ms. (steps per millisecond=60 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1132523 steps, run timeout after 3001 ms. (steps per millisecond=377 ) properties seen :{}
Probabilistic random walk after 1132523 steps, saw 235540 distinct states, run finished after 3002 ms. (steps per millisecond=377 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 54 rows 56 cols
[2024-05-28 20:14:02] [INFO ] Computed 19 invariants in 2 ms
[2024-05-28 20:14:02] [INFO ] [Real]Absence check using 18 positive place invariants in 3 ms returned sat
[2024-05-28 20:14:02] [INFO ] [Real]Absence check using 18 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-28 20:14:02] [INFO ] After 23ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2024-05-28 20:14:02] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-28 20:14:02] [INFO ] After 4ms SMT Verify possible using 4 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-28 20:14:02] [INFO ] After 76ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-28 20:14:02] [INFO ] [Nat]Absence check using 18 positive place invariants in 4 ms returned sat
[2024-05-28 20:14:02] [INFO ] [Nat]Absence check using 18 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-28 20:14:02] [INFO ] After 26ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-28 20:14:02] [INFO ] After 14ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-28 20:14:02] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 0 ms to minimize.
[2024-05-28 20:14:02] [INFO ] Deduced a trap composed of 7 places in 15 ms of which 0 ms to minimize.
[2024-05-28 20:14:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 54 ms
[2024-05-28 20:14:02] [INFO ] After 81ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 7 ms.
[2024-05-28 20:14:02] [INFO ] After 156ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 2 ms.
Support contains 6 out of 56 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 56/56 places, 54/54 transitions.
Applied a total of 0 rules in 2 ms. Remains 56 /56 variables (removed 0) and now considering 54/54 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 56/56 places, 54/54 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 56/56 places, 54/54 transitions.
Applied a total of 0 rules in 3 ms. Remains 56 /56 variables (removed 0) and now considering 54/54 (removed 0) transitions.
[2024-05-28 20:14:02] [INFO ] Invariant cache hit.
[2024-05-28 20:14:02] [INFO ] Implicit Places using invariants in 51 ms returned [38]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 53 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 55/56 places, 54/54 transitions.
Applied a total of 0 rules in 3 ms. Remains 55 /55 variables (removed 0) and now considering 54/54 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 59 ms. Remains : 55/56 places, 54/54 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1247708 steps, run timeout after 3001 ms. (steps per millisecond=415 ) properties seen :{}
Probabilistic random walk after 1247708 steps, saw 261142 distinct states, run finished after 3001 ms. (steps per millisecond=415 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 54 rows 55 cols
[2024-05-28 20:14:05] [INFO ] Computed 18 invariants in 7 ms
[2024-05-28 20:14:05] [INFO ] [Real]Absence check using 17 positive place invariants in 3 ms returned sat
[2024-05-28 20:14:05] [INFO ] [Real]Absence check using 17 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-28 20:14:05] [INFO ] After 22ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2024-05-28 20:14:05] [INFO ] Deduced a trap composed of 7 places in 18 ms of which 1 ms to minimize.
[2024-05-28 20:14:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 25 ms
[2024-05-28 20:14:05] [INFO ] After 52ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-28 20:14:05] [INFO ] After 97ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-28 20:14:05] [INFO ] [Nat]Absence check using 17 positive place invariants in 3 ms returned sat
[2024-05-28 20:14:05] [INFO ] [Nat]Absence check using 17 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-28 20:14:05] [INFO ] After 25ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-28 20:14:05] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 1 ms to minimize.
[2024-05-28 20:14:05] [INFO ] Deduced a trap composed of 7 places in 18 ms of which 0 ms to minimize.
[2024-05-28 20:14:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 61 ms
[2024-05-28 20:14:05] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 1 ms to minimize.
[2024-05-28 20:14:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 35 ms
[2024-05-28 20:14:05] [INFO ] After 133ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 9 ms.
[2024-05-28 20:14:05] [INFO ] After 178ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 3 ms.
Support contains 6 out of 55 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 55/55 places, 54/54 transitions.
Applied a total of 0 rules in 3 ms. Remains 55 /55 variables (removed 0) and now considering 54/54 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 55/55 places, 54/54 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 55/55 places, 54/54 transitions.
Applied a total of 0 rules in 3 ms. Remains 55 /55 variables (removed 0) and now considering 54/54 (removed 0) transitions.
[2024-05-28 20:14:05] [INFO ] Invariant cache hit.
[2024-05-28 20:14:05] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-28 20:14:05] [INFO ] Invariant cache hit.
[2024-05-28 20:14:06] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
[2024-05-28 20:14:06] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-28 20:14:06] [INFO ] Invariant cache hit.
[2024-05-28 20:14:06] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 161 ms. Remains : 55/55 places, 54/54 transitions.
Applied a total of 0 rules in 2 ms. Remains 55 /55 variables (removed 0) and now considering 54/54 (removed 0) transitions.
Running SMT prover for 2 properties.
[2024-05-28 20:14:06] [INFO ] Invariant cache hit.
[2024-05-28 20:14:06] [INFO ] [Real]Absence check using 17 positive place invariants in 4 ms returned sat
[2024-05-28 20:14:06] [INFO ] [Real]Absence check using 17 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-28 20:14:06] [INFO ] After 19ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2024-05-28 20:14:06] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-05-28 20:14:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 37 ms
[2024-05-28 20:14:06] [INFO ] After 63ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-28 20:14:06] [INFO ] After 92ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-28 20:14:06] [INFO ] [Nat]Absence check using 17 positive place invariants in 2 ms returned sat
[2024-05-28 20:14:06] [INFO ] [Nat]Absence check using 17 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-28 20:14:06] [INFO ] After 21ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-28 20:14:06] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 1 ms to minimize.
[2024-05-28 20:14:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 30 ms
[2024-05-28 20:14:06] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 0 ms to minimize.
[2024-05-28 20:14:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 30 ms
[2024-05-28 20:14:06] [INFO ] After 95ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 14 ms.
[2024-05-28 20:14:06] [INFO ] After 140ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
FORMULA ShieldIIPs-PT-002B-LTLFireability-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 26 stabilizing places and 26 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' '!(G((F(G(p0))&&F(p1))))'
Support contains 4 out of 112 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 112/112 places, 110/110 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 111 transition count 98
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 22 place count 100 transition count 98
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 22 place count 100 transition count 88
Deduced a syphon composed of 10 places in 3 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 42 place count 90 transition count 88
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 46 place count 86 transition count 84
Iterating global reduction 2 with 4 rules applied. Total rules applied 50 place count 86 transition count 84
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 50 place count 86 transition count 82
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 54 place count 84 transition count 82
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 112 place count 55 transition count 53
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 114 place count 53 transition count 51
Applied a total of 114 rules in 21 ms. Remains 53 /112 variables (removed 59) and now considering 51/110 (removed 59) transitions.
// Phase 1: matrix 51 rows 53 cols
[2024-05-28 20:14:06] [INFO ] Computed 19 invariants in 0 ms
[2024-05-28 20:14:06] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-28 20:14:06] [INFO ] Invariant cache hit.
[2024-05-28 20:14:06] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
[2024-05-28 20:14:06] [INFO ] Redundant transitions in 19 ms returned []
[2024-05-28 20:14:06] [INFO ] Invariant cache hit.
[2024-05-28 20:14:06] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 53/112 places, 51/110 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 195 ms. Remains : 53/112 places, 51/110 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 268 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldIIPs-PT-002B-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s10 0), p1:(AND (EQ s38 1) (EQ s48 1) (EQ s51 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 201 steps with 1 reset in 8 ms.
FORMULA ShieldIIPs-PT-002B-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-002B-LTLFireability-00 finished in 534 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(p0))||(G(p1)&&F(p2))))'
Support contains 3 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 110/110 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 109 transition count 107
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 109 transition count 107
Applied a total of 6 rules in 8 ms. Remains 109 /112 variables (removed 3) and now considering 107/110 (removed 3) transitions.
// Phase 1: matrix 107 rows 109 cols
[2024-05-28 20:14:07] [INFO ] Computed 19 invariants in 2 ms
[2024-05-28 20:14:07] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-05-28 20:14:07] [INFO ] Invariant cache hit.
[2024-05-28 20:14:07] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 159 ms to find 0 implicit places.
[2024-05-28 20:14:07] [INFO ] Invariant cache hit.
[2024-05-28 20:14:07] [INFO ] Dead Transitions using invariants and state equation in 73 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 109/112 places, 107/110 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 241 ms. Remains : 109/112 places, 107/110 transitions.
Stuttering acceptance computed with spot in 147 ms :[(AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-002B-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=(AND p1 p2), acceptance={} source=1 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(AND p1 p2 (NOT p0)), acceptance={0} source=2 dest: 0}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p1:(EQ s100 1), p0:(EQ s24 0), p2:(EQ s61 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 260 ms.
Product exploration explored 100000 steps with 50000 reset in 189 ms.
Computed a total of 24 stabilizing places and 24 stable transitions
Computed a total of 24 stabilizing places and 24 stable transitions
Detected a total of 24/109 stabilizing places and 24/107 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND p1 p2 (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 12 factoid took 23 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPs-PT-002B-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPs-PT-002B-LTLFireability-01 finished in 887 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(X((p0&&G(p1))))))'
Support contains 4 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 110/110 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 108 transition count 106
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 108 transition count 106
Applied a total of 8 rules in 5 ms. Remains 108 /112 variables (removed 4) and now considering 106/110 (removed 4) transitions.
// Phase 1: matrix 106 rows 108 cols
[2024-05-28 20:14:07] [INFO ] Computed 19 invariants in 1 ms
[2024-05-28 20:14:08] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-28 20:14:08] [INFO ] Invariant cache hit.
[2024-05-28 20:14:08] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 130 ms to find 0 implicit places.
[2024-05-28 20:14:08] [INFO ] Invariant cache hit.
[2024-05-28 20:14:08] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 108/112 places, 106/110 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 214 ms. Remains : 108/112 places, 106/110 transitions.
Stuttering acceptance computed with spot in 320 ms :[true, (NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPs-PT-002B-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 3}]], initial=4, aps=[p1:(AND (EQ s25 1) (EQ s33 1) (EQ s54 1)), p0:(EQ s9 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA ShieldIIPs-PT-002B-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-002B-LTLFireability-03 finished in 547 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(X(G((X(G(p1))&&p0))))))'
Support contains 3 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 110/110 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 109 transition count 107
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 109 transition count 107
Applied a total of 6 rules in 5 ms. Remains 109 /112 variables (removed 3) and now considering 107/110 (removed 3) transitions.
// Phase 1: matrix 107 rows 109 cols
[2024-05-28 20:14:08] [INFO ] Computed 19 invariants in 1 ms
[2024-05-28 20:14:08] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-28 20:14:08] [INFO ] Invariant cache hit.
[2024-05-28 20:14:08] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
[2024-05-28 20:14:08] [INFO ] Invariant cache hit.
[2024-05-28 20:14:08] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 109/112 places, 107/110 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 189 ms. Remains : 109/112 places, 107/110 transitions.
Stuttering acceptance computed with spot in 205 ms :[true, (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPs-PT-002B-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}]], initial=5, aps=[p0:(AND (EQ s33 0) (EQ s83 0)), p1:(EQ s47 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 18 steps with 0 reset in 1 ms.
FORMULA ShieldIIPs-PT-002B-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-002B-LTLFireability-05 finished in 409 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(p0)||X(p1)))'
Support contains 4 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 110/110 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 108 transition count 106
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 108 transition count 106
Applied a total of 8 rules in 5 ms. Remains 108 /112 variables (removed 4) and now considering 106/110 (removed 4) transitions.
// Phase 1: matrix 106 rows 108 cols
[2024-05-28 20:14:08] [INFO ] Computed 19 invariants in 1 ms
[2024-05-28 20:14:08] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-28 20:14:08] [INFO ] Invariant cache hit.
[2024-05-28 20:14:09] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 146 ms to find 0 implicit places.
[2024-05-28 20:14:09] [INFO ] Invariant cache hit.
[2024-05-28 20:14:09] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 108/112 places, 106/110 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 221 ms. Remains : 108/112 places, 106/110 transitions.
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-002B-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s51 1), p1:(OR (EQ s28 0) (EQ s44 0) (EQ s53 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][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 149 ms.
Product exploration explored 100000 steps with 50000 reset in 191 ms.
Computed a total of 23 stabilizing places and 23 stable transitions
Computed a total of 23 stabilizing places and 23 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 16 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPs-PT-002B-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPs-PT-002B-LTLFireability-06 finished in 714 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((G(p1)||p0))))'
Support contains 7 out of 112 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 112/112 places, 110/110 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 111 transition count 100
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 102 transition count 100
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 18 place count 102 transition count 89
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 40 place count 91 transition count 89
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 44 place count 87 transition count 85
Iterating global reduction 2 with 4 rules applied. Total rules applied 48 place count 87 transition count 85
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 48 place count 87 transition count 82
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 54 place count 84 transition count 82
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 114 place count 54 transition count 52
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 116 place count 52 transition count 50
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 117 place count 51 transition count 50
Applied a total of 117 rules in 20 ms. Remains 51 /112 variables (removed 61) and now considering 50/110 (removed 60) transitions.
// Phase 1: matrix 50 rows 51 cols
[2024-05-28 20:14:09] [INFO ] Computed 18 invariants in 0 ms
[2024-05-28 20:14:09] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-28 20:14:09] [INFO ] Invariant cache hit.
[2024-05-28 20:14:09] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
[2024-05-28 20:14:09] [INFO ] Redundant transitions in 14 ms returned [49]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 49 rows 51 cols
[2024-05-28 20:14:09] [INFO ] Computed 18 invariants in 0 ms
[2024-05-28 20:14:09] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 51/112 places, 49/110 transitions.
Applied a total of 0 rules in 1 ms. Remains 51 /51 variables (removed 0) and now considering 49/49 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 172 ms. Remains : 51/112 places, 49/110 transitions.
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPs-PT-002B-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s37 1) (EQ s39 1) (EQ s50 1)), p0:(OR (EQ s5 1) (AND (EQ s11 1) (EQ s18 1) (EQ s28 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 51308 steps with 1484 reset in 86 ms.
FORMULA ShieldIIPs-PT-002B-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-002B-LTLFireability-07 finished in 350 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(p0)))'
Support contains 5 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 110/110 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 108 transition count 106
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 108 transition count 106
Applied a total of 8 rules in 3 ms. Remains 108 /112 variables (removed 4) and now considering 106/110 (removed 4) transitions.
// Phase 1: matrix 106 rows 108 cols
[2024-05-28 20:14:09] [INFO ] Computed 19 invariants in 1 ms
[2024-05-28 20:14:10] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-28 20:14:10] [INFO ] Invariant cache hit.
[2024-05-28 20:14:10] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 151 ms to find 0 implicit places.
[2024-05-28 20:14:10] [INFO ] Invariant cache hit.
[2024-05-28 20:14:10] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 108/112 places, 106/110 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 233 ms. Remains : 108/112 places, 106/110 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-002B-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (NEQ s25 1) (NEQ s33 1) (NEQ s54 1) (NEQ s71 1) (NEQ s85 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 50000 reset in 138 ms.
Product exploration explored 100000 steps with 50000 reset in 141 ms.
Computed a total of 23 stabilizing places and 23 stable transitions
Computed a total of 23 stabilizing places and 23 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 17 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPs-PT-002B-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPs-PT-002B-LTLFireability-08 finished in 630 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(p0)))'
Support contains 2 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 110/110 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 108 transition count 106
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 108 transition count 106
Applied a total of 8 rules in 4 ms. Remains 108 /112 variables (removed 4) and now considering 106/110 (removed 4) transitions.
[2024-05-28 20:14:10] [INFO ] Invariant cache hit.
[2024-05-28 20:14:10] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-28 20:14:10] [INFO ] Invariant cache hit.
[2024-05-28 20:14:10] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 139 ms to find 0 implicit places.
[2024-05-28 20:14:10] [INFO ] Invariant cache hit.
[2024-05-28 20:14:10] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 108/112 places, 106/110 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 214 ms. Remains : 108/112 places, 106/110 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-002B-LTLFireability-09 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 s76 0) (EQ s104 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][false, false]]
Product exploration explored 100000 steps with 50000 reset in 143 ms.
Product exploration explored 100000 steps with 50000 reset in 144 ms.
Computed a total of 23 stabilizing places and 23 stable transitions
Computed a total of 23 stabilizing places and 23 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 19 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPs-PT-002B-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPs-PT-002B-LTLFireability-09 finished in 610 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((F(G(p1))&&p0)))'
Support contains 2 out of 112 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 112/112 places, 110/110 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 111 transition count 99
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 101 transition count 99
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 20 place count 101 transition count 88
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 42 place count 90 transition count 88
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 45 place count 87 transition count 85
Iterating global reduction 2 with 3 rules applied. Total rules applied 48 place count 87 transition count 85
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 48 place count 87 transition count 83
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 52 place count 85 transition count 83
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 112 place count 55 transition count 53
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 114 place count 53 transition count 51
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 115 place count 52 transition count 51
Applied a total of 115 rules in 20 ms. Remains 52 /112 variables (removed 60) and now considering 51/110 (removed 59) transitions.
// Phase 1: matrix 51 rows 52 cols
[2024-05-28 20:14:11] [INFO ] Computed 18 invariants in 0 ms
[2024-05-28 20:14:11] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-28 20:14:11] [INFO ] Invariant cache hit.
[2024-05-28 20:14:11] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
[2024-05-28 20:14:11] [INFO ] Redundant transitions in 17 ms returned [50]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 50 rows 52 cols
[2024-05-28 20:14:11] [INFO ] Computed 18 invariants in 2 ms
[2024-05-28 20:14:11] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 52/112 places, 50/110 transitions.
Applied a total of 0 rules in 1 ms. Remains 52 /52 variables (removed 0) and now considering 50/50 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 185 ms. Remains : 52/112 places, 50/110 transitions.
Stuttering acceptance computed with spot in 123 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-002B-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s10 1) (EQ s47 1)), p1:(EQ s47 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 324 steps with 1 reset in 2 ms.
FORMULA ShieldIIPs-PT-002B-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-002B-LTLFireability-10 finished in 325 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 1 out of 112 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 112/112 places, 110/110 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 111 transition count 99
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 101 transition count 99
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 20 place count 101 transition count 88
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 42 place count 90 transition count 88
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 45 place count 87 transition count 85
Iterating global reduction 2 with 3 rules applied. Total rules applied 48 place count 87 transition count 85
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 48 place count 87 transition count 83
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 52 place count 85 transition count 83
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 114 place count 54 transition count 52
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 116 place count 52 transition count 50
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 117 place count 51 transition count 50
Applied a total of 117 rules in 17 ms. Remains 51 /112 variables (removed 61) and now considering 50/110 (removed 60) transitions.
// Phase 1: matrix 50 rows 51 cols
[2024-05-28 20:14:11] [INFO ] Computed 18 invariants in 1 ms
[2024-05-28 20:14:11] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-28 20:14:11] [INFO ] Invariant cache hit.
[2024-05-28 20:14:11] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
[2024-05-28 20:14:11] [INFO ] Redundant transitions in 21 ms returned [49]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 49 rows 51 cols
[2024-05-28 20:14:11] [INFO ] Computed 18 invariants in 1 ms
[2024-05-28 20:14:11] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 51/112 places, 49/110 transitions.
Applied a total of 0 rules in 2 ms. Remains 51 /51 variables (removed 0) and now considering 49/49 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 185 ms. Remains : 51/112 places, 49/110 transitions.
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-002B-LTLFireability-12 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:(EQ s28 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]]
Stuttering criterion allowed to conclude after 148 steps with 0 reset in 0 ms.
FORMULA ShieldIIPs-PT-002B-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-002B-LTLFireability-12 finished in 269 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)&&F(p1))))'
Support contains 4 out of 112 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 112/112 places, 110/110 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 111 transition count 100
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 102 transition count 100
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 18 place count 102 transition count 89
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 40 place count 91 transition count 89
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 43 place count 88 transition count 86
Iterating global reduction 2 with 3 rules applied. Total rules applied 46 place count 88 transition count 86
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 46 place count 88 transition count 84
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 50 place count 86 transition count 84
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 112 place count 55 transition count 53
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 114 place count 53 transition count 51
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 115 place count 52 transition count 51
Applied a total of 115 rules in 16 ms. Remains 52 /112 variables (removed 60) and now considering 51/110 (removed 59) transitions.
// Phase 1: matrix 51 rows 52 cols
[2024-05-28 20:14:11] [INFO ] Computed 18 invariants in 1 ms
[2024-05-28 20:14:11] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-28 20:14:11] [INFO ] Invariant cache hit.
[2024-05-28 20:14:11] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
[2024-05-28 20:14:11] [INFO ] Redundant transitions in 16 ms returned [50]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 50 rows 52 cols
[2024-05-28 20:14:11] [INFO ] Computed 18 invariants in 2 ms
[2024-05-28 20:14:11] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 52/112 places, 50/110 transitions.
Applied a total of 0 rules in 1 ms. Remains 52 /52 variables (removed 0) and now considering 50/50 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 179 ms. Remains : 52/112 places, 50/110 transitions.
Stuttering acceptance computed with spot in 112 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldIIPs-PT-002B-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s28 1), p1:(OR (NEQ s37 1) (NEQ s41 1) (NEQ s51 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 131 steps with 0 reset in 1 ms.
FORMULA ShieldIIPs-PT-002B-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-002B-LTLFireability-13 finished in 311 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)||G(p1))))'
Support contains 2 out of 112 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 112/112 places, 110/110 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 111 transition count 98
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 22 place count 100 transition count 98
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 22 place count 100 transition count 87
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 44 place count 89 transition count 87
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 48 place count 85 transition count 83
Iterating global reduction 2 with 4 rules applied. Total rules applied 52 place count 85 transition count 83
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 52 place count 85 transition count 80
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 58 place count 82 transition count 80
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 116 place count 53 transition count 51
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 118 place count 51 transition count 49
Applied a total of 118 rules in 18 ms. Remains 51 /112 variables (removed 61) and now considering 49/110 (removed 61) transitions.
// Phase 1: matrix 49 rows 51 cols
[2024-05-28 20:14:12] [INFO ] Computed 19 invariants in 1 ms
[2024-05-28 20:14:12] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-28 20:14:12] [INFO ] Invariant cache hit.
[2024-05-28 20:14:12] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
[2024-05-28 20:14:12] [INFO ] Redundant transitions in 16 ms returned []
[2024-05-28 20:14:12] [INFO ] Invariant cache hit.
[2024-05-28 20:14:12] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 51/112 places, 49/110 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 177 ms. Remains : 51/112 places, 49/110 transitions.
Stuttering acceptance computed with spot in 40 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPs-PT-002B-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s40 0), p1:(EQ s37 0)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 733 reset in 239 ms.
Stack based approach found an accepted trace after 31033 steps with 225 reset with depth 45 and stack size 45 in 74 ms.
FORMULA ShieldIIPs-PT-002B-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPs-PT-002B-LTLFireability-14 finished in 548 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(p0)&&G(p1)))'
Support contains 5 out of 112 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 112/112 places, 110/110 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 111 transition count 100
Reduce places removed 9 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 10 rules applied. Total rules applied 19 place count 102 transition count 99
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 20 place count 101 transition count 99
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 20 place count 101 transition count 88
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 42 place count 90 transition count 88
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 45 place count 87 transition count 85
Iterating global reduction 3 with 3 rules applied. Total rules applied 48 place count 87 transition count 85
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 48 place count 87 transition count 84
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 50 place count 86 transition count 84
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 108 place count 57 transition count 55
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 110 place count 55 transition count 53
Applied a total of 110 rules in 12 ms. Remains 55 /112 variables (removed 57) and now considering 53/110 (removed 57) transitions.
// Phase 1: matrix 53 rows 55 cols
[2024-05-28 20:14:12] [INFO ] Computed 19 invariants in 2 ms
[2024-05-28 20:14:12] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-28 20:14:12] [INFO ] Invariant cache hit.
[2024-05-28 20:14:12] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-28 20:14:12] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
[2024-05-28 20:14:12] [INFO ] Redundant transitions in 24 ms returned [52]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 52 rows 55 cols
[2024-05-28 20:14:12] [INFO ] Computed 19 invariants in 1 ms
[2024-05-28 20:14:12] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 55/112 places, 52/110 transitions.
Applied a total of 0 rules in 2 ms. Remains 55 /55 variables (removed 0) and now considering 52/52 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 196 ms. Remains : 55/112 places, 52/110 transitions.
Stuttering acceptance computed with spot in 90 ms :[(NOT p1), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPs-PT-002B-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 p1), acceptance={0} source=2 dest: 0}, { cond=(NOT p1), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}]], initial=2, aps=[p1:(OR (NEQ s45 1) (NEQ s37 1) (NEQ s42 1) (NEQ s54 1)), p0:(EQ s28 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 649 reset in 157 ms.
Product exploration explored 100000 steps with 658 reset in 255 ms.
Computed a total of 4 stabilizing places and 3 stable transitions
Computed a total of 4 stabilizing places and 3 stable transitions
Detected a total of 4/55 stabilizing places and 3/52 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X p1), true, (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1))))]
Knowledge based reduction with 5 factoid took 388 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[true, (NOT p1)]
Incomplete random walk after 10000 steps, including 66 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2214400 steps, run timeout after 3001 ms. (steps per millisecond=737 ) properties seen :{}
Probabilistic random walk after 2214400 steps, saw 360613 distinct states, run finished after 3001 ms. (steps per millisecond=737 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-28 20:14:16] [INFO ] Invariant cache hit.
[2024-05-28 20:14:16] [INFO ] [Real]Absence check using 19 positive place invariants in 3 ms returned sat
[2024-05-28 20:14:16] [INFO ] After 58ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 20:14:16] [INFO ] [Nat]Absence check using 19 positive place invariants in 2 ms returned sat
[2024-05-28 20:14:16] [INFO ] After 20ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-28 20:14:16] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-28 20:14:16] [INFO ] After 6ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-28 20:14:16] [INFO ] After 19ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2024-05-28 20:14:17] [INFO ] After 72ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 55 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 55/55 places, 52/52 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 54 transition count 51
Partial Free-agglomeration rule applied 13 times.
Drop transitions removed 13 transitions
Iterating global reduction 0 with 13 rules applied. Total rules applied 15 place count 54 transition count 51
Applied a total of 15 rules in 5 ms. Remains 54 /55 variables (removed 1) and now considering 51/52 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 54/55 places, 51/52 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2275385 steps, run timeout after 3001 ms. (steps per millisecond=758 ) properties seen :{}
Probabilistic random walk after 2275385 steps, saw 462794 distinct states, run finished after 3003 ms. (steps per millisecond=757 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 51 rows 54 cols
[2024-05-28 20:14:20] [INFO ] Computed 19 invariants in 4 ms
[2024-05-28 20:14:20] [INFO ] [Real]Absence check using 18 positive place invariants in 3 ms returned sat
[2024-05-28 20:14:20] [INFO ] [Real]Absence check using 18 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-28 20:14:20] [INFO ] After 66ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 20:14:20] [INFO ] [Nat]Absence check using 18 positive place invariants in 3 ms returned sat
[2024-05-28 20:14:20] [INFO ] [Nat]Absence check using 18 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-28 20:14:20] [INFO ] After 26ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-28 20:14:20] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-28 20:14:20] [INFO ] After 6ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-28 20:14:20] [INFO ] After 18ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2024-05-28 20:14:20] [INFO ] After 78ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 54 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 54/54 places, 51/51 transitions.
Applied a total of 0 rules in 1 ms. Remains 54 /54 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 54/54 places, 51/51 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 54/54 places, 51/51 transitions.
Applied a total of 0 rules in 1 ms. Remains 54 /54 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2024-05-28 20:14:20] [INFO ] Invariant cache hit.
[2024-05-28 20:14:20] [INFO ] Implicit Places using invariants in 49 ms returned [37]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 50 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 53/54 places, 51/51 transitions.
Applied a total of 0 rules in 1 ms. Remains 53 /53 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 52 ms. Remains : 53/54 places, 51/51 transitions.
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 10000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2209553 steps, run timeout after 3001 ms. (steps per millisecond=736 ) properties seen :{}
Probabilistic random walk after 2209553 steps, saw 458932 distinct states, run finished after 3001 ms. (steps per millisecond=736 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 51 rows 53 cols
[2024-05-28 20:14:23] [INFO ] Computed 18 invariants in 4 ms
[2024-05-28 20:14:23] [INFO ] [Real]Absence check using 17 positive place invariants in 3 ms returned sat
[2024-05-28 20:14:23] [INFO ] [Real]Absence check using 17 positive and 1 generalized place invariants in 3 ms returned sat
[2024-05-28 20:14:23] [INFO ] After 71ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 20:14:23] [INFO ] [Nat]Absence check using 17 positive place invariants in 4 ms returned sat
[2024-05-28 20:14:23] [INFO ] [Nat]Absence check using 17 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-28 20:14:23] [INFO ] After 21ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-28 20:14:23] [INFO ] After 27ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2024-05-28 20:14:23] [INFO ] After 61ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 53 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 53/53 places, 51/51 transitions.
Applied a total of 0 rules in 1 ms. Remains 53 /53 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 53/53 places, 51/51 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 53/53 places, 51/51 transitions.
Applied a total of 0 rules in 1 ms. Remains 53 /53 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2024-05-28 20:14:23] [INFO ] Invariant cache hit.
[2024-05-28 20:14:23] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-28 20:14:23] [INFO ] Invariant cache hit.
[2024-05-28 20:14:23] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
[2024-05-28 20:14:23] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-28 20:14:23] [INFO ] Invariant cache hit.
[2024-05-28 20:14:23] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 152 ms. Remains : 53/53 places, 51/51 transitions.
Applied a total of 0 rules in 1 ms. Remains 53 /53 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-05-28 20:14:23] [INFO ] Invariant cache hit.
[2024-05-28 20:14:23] [INFO ] [Real]Absence check using 17 positive place invariants in 3 ms returned sat
[2024-05-28 20:14:23] [INFO ] [Real]Absence check using 17 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-28 20:14:23] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 20:14:23] [INFO ] [Nat]Absence check using 17 positive place invariants in 3 ms returned sat
[2024-05-28 20:14:23] [INFO ] [Nat]Absence check using 17 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-28 20:14:23] [INFO ] After 18ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-28 20:14:23] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 1 ms to minimize.
[2024-05-28 20:14:23] [INFO ] Deduced a trap composed of 8 places in 19 ms of which 1 ms to minimize.
[2024-05-28 20:14:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 50 ms
[2024-05-28 20:14:23] [INFO ] After 73ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2024-05-28 20:14:23] [INFO ] After 103ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p1 p0), (X p1), true, (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1))))]
Knowledge based reduction with 5 factoid took 554 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 45 ms :[true, (NOT p1)]
Stuttering acceptance computed with spot in 41 ms :[true, (NOT p1)]
Support contains 4 out of 55 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 55/55 places, 52/52 transitions.
Applied a total of 0 rules in 2 ms. Remains 55 /55 variables (removed 0) and now considering 52/52 (removed 0) transitions.
// Phase 1: matrix 52 rows 55 cols
[2024-05-28 20:14:24] [INFO ] Computed 19 invariants in 0 ms
[2024-05-28 20:14:24] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-28 20:14:24] [INFO ] Invariant cache hit.
[2024-05-28 20:14:24] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-28 20:14:24] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
[2024-05-28 20:14:24] [INFO ] Redundant transitions in 13 ms returned []
[2024-05-28 20:14:24] [INFO ] Invariant cache hit.
[2024-05-28 20:14:24] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 149 ms. Remains : 55/55 places, 52/52 transitions.
Computed a total of 4 stabilizing places and 3 stable transitions
Computed a total of 4 stabilizing places and 3 stable transitions
Knowledge obtained : [p1, (X p1), true, (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 71 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 45 ms :[true, (NOT p1)]
Incomplete random walk after 10000 steps, including 65 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2571273 steps, run timeout after 3001 ms. (steps per millisecond=856 ) properties seen :{}
Probabilistic random walk after 2571273 steps, saw 424826 distinct states, run finished after 3002 ms. (steps per millisecond=856 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-28 20:14:27] [INFO ] Invariant cache hit.
[2024-05-28 20:14:27] [INFO ] [Real]Absence check using 19 positive place invariants in 3 ms returned sat
[2024-05-28 20:14:27] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 20:14:27] [INFO ] [Nat]Absence check using 19 positive place invariants in 3 ms returned sat
[2024-05-28 20:14:27] [INFO ] After 19ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-28 20:14:27] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-28 20:14:27] [INFO ] After 5ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-28 20:14:27] [INFO ] After 12ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2024-05-28 20:14:27] [INFO ] After 64ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 55 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 55/55 places, 52/52 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 54 transition count 51
Partial Free-agglomeration rule applied 13 times.
Drop transitions removed 13 transitions
Iterating global reduction 0 with 13 rules applied. Total rules applied 15 place count 54 transition count 51
Applied a total of 15 rules in 5 ms. Remains 54 /55 variables (removed 1) and now considering 51/52 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 54/55 places, 51/52 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2204571 steps, run timeout after 3001 ms. (steps per millisecond=734 ) properties seen :{}
Probabilistic random walk after 2204571 steps, saw 458717 distinct states, run finished after 3001 ms. (steps per millisecond=734 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 51 rows 54 cols
[2024-05-28 20:14:30] [INFO ] Computed 19 invariants in 2 ms
[2024-05-28 20:14:30] [INFO ] [Real]Absence check using 18 positive place invariants in 3 ms returned sat
[2024-05-28 20:14:30] [INFO ] [Real]Absence check using 18 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-28 20:14:31] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 20:14:31] [INFO ] [Nat]Absence check using 18 positive place invariants in 3 ms returned sat
[2024-05-28 20:14:31] [INFO ] [Nat]Absence check using 18 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-28 20:14:31] [INFO ] After 24ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-28 20:14:31] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-28 20:14:31] [INFO ] After 5ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-28 20:14:31] [INFO ] After 11ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2024-05-28 20:14:31] [INFO ] After 73ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 54 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 54/54 places, 51/51 transitions.
Applied a total of 0 rules in 1 ms. Remains 54 /54 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 54/54 places, 51/51 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 54/54 places, 51/51 transitions.
Applied a total of 0 rules in 2 ms. Remains 54 /54 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2024-05-28 20:14:31] [INFO ] Invariant cache hit.
[2024-05-28 20:14:31] [INFO ] Implicit Places using invariants in 49 ms returned [37]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 60 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 53/54 places, 51/51 transitions.
Applied a total of 0 rules in 1 ms. Remains 53 /53 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 64 ms. Remains : 53/54 places, 51/51 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2443919 steps, run timeout after 3001 ms. (steps per millisecond=814 ) properties seen :{}
Probabilistic random walk after 2443919 steps, saw 502504 distinct states, run finished after 3001 ms. (steps per millisecond=814 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 51 rows 53 cols
[2024-05-28 20:14:34] [INFO ] Computed 18 invariants in 2 ms
[2024-05-28 20:14:34] [INFO ] [Real]Absence check using 17 positive place invariants in 3 ms returned sat
[2024-05-28 20:14:34] [INFO ] [Real]Absence check using 17 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-28 20:14:34] [INFO ] After 60ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 20:14:34] [INFO ] [Nat]Absence check using 17 positive place invariants in 2 ms returned sat
[2024-05-28 20:14:34] [INFO ] [Nat]Absence check using 17 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-28 20:14:34] [INFO ] After 17ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-28 20:14:34] [INFO ] After 23ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2024-05-28 20:14:34] [INFO ] After 53ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 53 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 53/53 places, 51/51 transitions.
Applied a total of 0 rules in 2 ms. Remains 53 /53 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 53/53 places, 51/51 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 53/53 places, 51/51 transitions.
Applied a total of 0 rules in 4 ms. Remains 53 /53 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2024-05-28 20:14:34] [INFO ] Invariant cache hit.
[2024-05-28 20:14:34] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-28 20:14:34] [INFO ] Invariant cache hit.
[2024-05-28 20:14:34] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
[2024-05-28 20:14:34] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-28 20:14:34] [INFO ] Invariant cache hit.
[2024-05-28 20:14:34] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 156 ms. Remains : 53/53 places, 51/51 transitions.
Applied a total of 0 rules in 1 ms. Remains 53 /53 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-05-28 20:14:34] [INFO ] Invariant cache hit.
[2024-05-28 20:14:34] [INFO ] [Real]Absence check using 17 positive place invariants in 3 ms returned sat
[2024-05-28 20:14:34] [INFO ] [Real]Absence check using 17 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-28 20:14:34] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 20:14:34] [INFO ] [Nat]Absence check using 17 positive place invariants in 3 ms returned sat
[2024-05-28 20:14:34] [INFO ] [Nat]Absence check using 17 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-28 20:14:34] [INFO ] After 18ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-28 20:14:34] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 1 ms to minimize.
[2024-05-28 20:14:34] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 5 ms to minimize.
[2024-05-28 20:14:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 50 ms
[2024-05-28 20:14:34] [INFO ] After 74ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2024-05-28 20:14:34] [INFO ] After 107ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p1, (X p1), true, (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 91 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 41 ms :[true, (NOT p1)]
Stuttering acceptance computed with spot in 50 ms :[true, (NOT p1)]
Stuttering acceptance computed with spot in 44 ms :[true, (NOT p1)]
Product exploration explored 100000 steps with 652 reset in 150 ms.
Product exploration explored 100000 steps with 661 reset in 169 ms.
Built C files in :
/tmp/ltsmin18346948105683322577
[2024-05-28 20:14:35] [INFO ] Computing symmetric may disable matrix : 52 transitions.
[2024-05-28 20:14:35] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 20:14:35] [INFO ] Computing symmetric may enable matrix : 52 transitions.
[2024-05-28 20:14:35] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 20:14:35] [INFO ] Computing Do-Not-Accords matrix : 52 transitions.
[2024-05-28 20:14:35] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 20:14:35] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18346948105683322577
Running compilation step : cd /tmp/ltsmin18346948105683322577;'/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 262 ms.
Running link step : cd /tmp/ltsmin18346948105683322577;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin18346948105683322577;'/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/stateBased5383918157290418836.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 55 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 55/55 places, 52/52 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 54 transition count 51
Applied a total of 2 rules in 7 ms. Remains 54 /55 variables (removed 1) and now considering 51/52 (removed 1) transitions.
// Phase 1: matrix 51 rows 54 cols
[2024-05-28 20:14:50] [INFO ] Computed 19 invariants in 1 ms
[2024-05-28 20:14:50] [INFO ] Implicit Places using invariants in 54 ms returned [37]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 55 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 53/55 places, 51/52 transitions.
Applied a total of 0 rules in 2 ms. Remains 53 /53 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 64 ms. Remains : 53/55 places, 51/52 transitions.
Built C files in :
/tmp/ltsmin1963551443817282915
[2024-05-28 20:14:50] [INFO ] Computing symmetric may disable matrix : 51 transitions.
[2024-05-28 20:14:50] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 20:14:50] [INFO ] Computing symmetric may enable matrix : 51 transitions.
[2024-05-28 20:14:50] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 20:14:50] [INFO ] Computing Do-Not-Accords matrix : 51 transitions.
[2024-05-28 20:14:50] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 20:14:50] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1963551443817282915
Running compilation step : cd /tmp/ltsmin1963551443817282915;'/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 139 ms.
Running link step : cd /tmp/ltsmin1963551443817282915;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin1963551443817282915;'/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/stateBased4282718207206628565.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-28 20:15:05] [INFO ] Flatten gal took : 5 ms
[2024-05-28 20:15:05] [INFO ] Flatten gal took : 4 ms
[2024-05-28 20:15:05] [INFO ] Time to serialize gal into /tmp/LTL13898356746410083161.gal : 2 ms
[2024-05-28 20:15:05] [INFO ] Time to serialize properties into /tmp/LTL6297456896723959519.prop : 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/LTL13898356746410083161.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9959115441431234630.hoa' '-atoms' '/tmp/LTL6297456896723959519.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/LTL6297456896723959519.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9959115441431234630.hoa
Reverse transition relation is NOT exact ! Due to transitions t0.t72, t2, t3, t5, t6, t8, t9, t10.t46, t12, t14, t16, t17, t19, t20, t30.t31, t97.t1, t51.t...466
Computing Next relation with stutter on 22 deadlock states
Detected timeout of ITS tools.
[2024-05-28 20:15:20] [INFO ] Flatten gal took : 4 ms
[2024-05-28 20:15:20] [INFO ] Flatten gal took : 4 ms
[2024-05-28 20:15:20] [INFO ] Time to serialize gal into /tmp/LTL4657343571300974503.gal : 1 ms
[2024-05-28 20:15:20] [INFO ] Time to serialize properties into /tmp/LTL12730095712630478662.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/LTL4657343571300974503.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12730095712630478662.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 : !(((F("(p67==0)"))&&(G("(((p102!=1)||(p84!=1))||((p95!=1)||(p120!=1)))"))))
Formula 0 simplified : G!"(p67==0)" | F!"(((p102!=1)||(p84!=1))||((p95!=1)||(p120!=1)))"
Reverse transition relation is NOT exact ! Due to transitions t0.t72, t2, t3, t5, t6, t8, t9, t10.t46, t12, t14, t16, t17, t19, t20, t30.t31, t97.t1, t51.t...487
Computing Next relation with stutter on 22 deadlock states
Detected timeout of ITS tools.
[2024-05-28 20:15:35] [INFO ] Flatten gal took : 5 ms
[2024-05-28 20:15:35] [INFO ] Applying decomposition
[2024-05-28 20:15:35] [INFO ] Flatten gal took : 4 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/graph10179847588366465637.txt' '-o' '/tmp/graph10179847588366465637.bin' '-w' '/tmp/graph10179847588366465637.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph10179847588366465637.bin' '-l' '-1' '-v' '-w' '/tmp/graph10179847588366465637.weights' '-q' '0' '-e' '0.001'
[2024-05-28 20:15:35] [INFO ] Decomposing Gal with order
[2024-05-28 20:15:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 20:15:35] [INFO ] Removed a total of 32 redundant transitions.
[2024-05-28 20:15:35] [INFO ] Flatten gal took : 35 ms
[2024-05-28 20:15:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 26 labels/synchronizations in 4 ms.
[2024-05-28 20:15:35] [INFO ] Time to serialize gal into /tmp/LTL15026382397254625646.gal : 2 ms
[2024-05-28 20:15:35] [INFO ] Time to serialize properties into /tmp/LTL5575326732196705651.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/LTL15026382397254625646.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5575326732196705651.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 : !(((F("(i6.u16.p67==0)"))&&(G("(((i6.u18.p102!=1)||(i7.u13.p84!=1))||((i4.u14.p95!=1)||(i7.u19.p120!=1)))"))))
Formula 0 simplified : G!"(i6.u16.p67==0)" | F!"(((i6.u18.p102!=1)||(i7.u13.p84!=1))||((i4.u14.p95!=1)||(i7.u19.p120!=1)))"
Reverse transition relation is NOT exact ! Due to transitions t0_t72, t10_t46, t107_t69_t1_t7, t103_t67_t4_t7, t34_t36_t40_t42_t44, t75_t94_t41_t15, t32_t7...480
Computing Next relation with stutter on 22 deadlock states
43 unique states visited
0 strongly connected components in search stack
43 transitions explored
43 items max in DFS search stack
74 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,0.765756,41788,1,0,57529,194,740,75449,157,544,71443
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA ShieldIIPs-PT-002B-LTLFireability-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property ShieldIIPs-PT-002B-LTLFireability-15 finished in 84078 ms.
All properties solved by simple procedures.
Total runtime 100281 ms.

BK_STOP 1716927337694

--------------------
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="ShieldIIPs-PT-002B"
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 ShieldIIPs-PT-002B, 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 r373-tall-171683788300018"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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