Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 624K
-rw-r--r-- 1 mcc users 7.3K Mar 23 15:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Mar 23 15:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Mar 23 15:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K Mar 23 15:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 23 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 23 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 23 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 23 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 11K Mar 23 15:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 96K Mar 23 15:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Mar 23 15:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 48K Mar 23 15:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 23 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 23 07:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 255K Mar 31 16:48 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 EisenbergMcGuire-PT-04-CTLFireability-00
FORMULA_NAME EisenbergMcGuire-PT-04-CTLFireability-01
FORMULA_NAME EisenbergMcGuire-PT-04-CTLFireability-02
FORMULA_NAME EisenbergMcGuire-PT-04-CTLFireability-03
FORMULA_NAME EisenbergMcGuire-PT-04-CTLFireability-04
FORMULA_NAME EisenbergMcGuire-PT-04-CTLFireability-05
FORMULA_NAME EisenbergMcGuire-PT-04-CTLFireability-06
FORMULA_NAME EisenbergMcGuire-PT-04-CTLFireability-07
FORMULA_NAME EisenbergMcGuire-PT-04-CTLFireability-08
FORMULA_NAME EisenbergMcGuire-PT-04-CTLFireability-09
FORMULA_NAME EisenbergMcGuire-PT-04-CTLFireability-10
FORMULA_NAME EisenbergMcGuire-PT-04-CTLFireability-11
FORMULA_NAME EisenbergMcGuire-PT-04-CTLFireability-12
FORMULA_NAME EisenbergMcGuire-PT-04-CTLFireability-13
FORMULA_NAME EisenbergMcGuire-PT-04-CTLFireability-14
FORMULA_NAME EisenbergMcGuire-PT-04-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1680836074256

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=EisenbergMcGuire-PT-04
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202304061127
[2023-04-07 02:54:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-04-07 02:54:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 02:54:39] [INFO ] Load time of PNML (sax parser for PT used): 207 ms
[2023-04-07 02:54:39] [INFO ] Transformed 196 places.
[2023-04-07 02:54:39] [INFO ] Transformed 448 transitions.
[2023-04-07 02:54:39] [INFO ] Found NUPN structural information;
[2023-04-07 02:54:39] [INFO ] Parsed PT model containing 196 places and 448 transitions and 1952 arcs in 400 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 9 ms.
Support contains 82 out of 196 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 448/448 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 193 transition count 436
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 193 transition count 436
Applied a total of 6 rules in 141 ms. Remains 193 /196 variables (removed 3) and now considering 436/448 (removed 12) transitions.
[2023-04-07 02:54:40] [INFO ] Flow matrix only has 272 transitions (discarded 164 similar events)
// Phase 1: matrix 272 rows 193 cols
[2023-04-07 02:54:40] [INFO ] Computed 13 invariants in 77 ms
[2023-04-07 02:54:41] [INFO ] Implicit Places using invariants in 1254 ms returned []
[2023-04-07 02:54:41] [INFO ] Flow matrix only has 272 transitions (discarded 164 similar events)
[2023-04-07 02:54:41] [INFO ] Invariant cache hit.
[2023-04-07 02:54:42] [INFO ] State equation strengthened by 103 read => feed constraints.
[2023-04-07 02:54:42] [INFO ] Implicit Places using invariants and state equation in 1111 ms returned []
Implicit Place search using SMT with State Equation took 2459 ms to find 0 implicit places.
[2023-04-07 02:54:42] [INFO ] Flow matrix only has 272 transitions (discarded 164 similar events)
[2023-04-07 02:54:42] [INFO ] Invariant cache hit.
[2023-04-07 02:54:44] [INFO ] Dead Transitions using invariants and state equation in 2231 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 193/196 places, 436/448 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4850 ms. Remains : 193/196 places, 436/448 transitions.
Support contains 82 out of 193 places after structural reductions.
[2023-04-07 02:54:45] [INFO ] Flatten gal took : 133 ms
[2023-04-07 02:54:45] [INFO ] Flatten gal took : 61 ms
[2023-04-07 02:54:45] [INFO ] Input system was already deterministic with 436 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 599 ms. (steps per millisecond=16 ) properties (out of 71) seen :22
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=29 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 49) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 47) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=19 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=28 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 45) seen :0
Running SMT prover for 45 properties.
[2023-04-07 02:54:47] [INFO ] Flow matrix only has 272 transitions (discarded 164 similar events)
[2023-04-07 02:54:47] [INFO ] Invariant cache hit.
[2023-04-07 02:54:47] [INFO ] [Real]Absence check using 9 positive place invariants in 5 ms returned sat
[2023-04-07 02:54:48] [INFO ] [Real]Absence check using 9 positive and 4 generalized place invariants in 3 ms returned sat
[2023-04-07 02:54:48] [INFO ] After 1303ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:45
[2023-04-07 02:54:48] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2023-04-07 02:54:48] [INFO ] [Nat]Absence check using 9 positive and 4 generalized place invariants in 2 ms returned sat
[2023-04-07 02:54:49] [INFO ] After 687ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :45
[2023-04-07 02:54:49] [INFO ] State equation strengthened by 103 read => feed constraints.
[2023-04-07 02:54:51] [INFO ] After 1772ms SMT Verify possible using 103 Read/Feed constraints in natural domain returned unsat :0 sat :45
[2023-04-07 02:54:51] [INFO ] Deduced a trap composed of 3 places in 330 ms of which 38 ms to minimize.
[2023-04-07 02:54:53] [INFO ] Deduced a trap composed of 3 places in 1405 ms of which 32 ms to minimize.
[2023-04-07 02:54:53] [INFO ] Deduced a trap composed of 3 places in 107 ms of which 0 ms to minimize.
[2023-04-07 02:54:53] [INFO ] Deduced a trap composed of 14 places in 152 ms of which 8 ms to minimize.
[2023-04-07 02:54:53] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2115 ms
[2023-04-07 02:54:53] [INFO ] Deduced a trap composed of 17 places in 178 ms of which 13 ms to minimize.
[2023-04-07 02:54:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 226 ms
[2023-04-07 02:54:54] [INFO ] Deduced a trap composed of 20 places in 847 ms of which 26 ms to minimize.
[2023-04-07 02:54:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 891 ms
[2023-04-07 02:54:54] [INFO ] Deduced a trap composed of 3 places in 157 ms of which 3 ms to minimize.
[2023-04-07 02:54:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 199 ms
[2023-04-07 02:54:55] [INFO ] Deduced a trap composed of 26 places in 169 ms of which 10 ms to minimize.
[2023-04-07 02:54:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 219 ms
[2023-04-07 02:54:55] [INFO ] Deduced a trap composed of 45 places in 163 ms of which 1 ms to minimize.
[2023-04-07 02:54:55] [INFO ] Deduced a trap composed of 55 places in 236 ms of which 0 ms to minimize.
[2023-04-07 02:54:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 506 ms
[2023-04-07 02:54:56] [INFO ] Deduced a trap composed of 23 places in 145 ms of which 1 ms to minimize.
[2023-04-07 02:54:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 178 ms
[2023-04-07 02:54:56] [INFO ] Deduced a trap composed of 20 places in 172 ms of which 0 ms to minimize.
[2023-04-07 02:54:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 195 ms
[2023-04-07 02:54:57] [INFO ] After 7916ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :44
Attempting to minimize the solution found.
Minimization took 1015 ms.
[2023-04-07 02:54:58] [INFO ] After 10113ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :44
Fused 45 Parikh solutions to 42 different solutions.
Parikh walk visited 1 properties in 562 ms.
Support contains 53 out of 193 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 436/436 transitions.
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 38 Pre rules applied. Total rules applied 0 place count 193 transition count 398
Deduced a syphon composed of 38 places in 1 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 0 with 76 rules applied. Total rules applied 76 place count 155 transition count 398
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 80 place count 151 transition count 382
Iterating global reduction 0 with 4 rules applied. Total rules applied 84 place count 151 transition count 382
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 108 place count 139 transition count 370
Applied a total of 108 rules in 97 ms. Remains 139 /193 variables (removed 54) and now considering 370/436 (removed 66) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 97 ms. Remains : 139/193 places, 370/436 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 287 ms. (steps per millisecond=34 ) properties (out of 43) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 42) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 41) seen :0
Interrupted probabilistic random walk after 255495 steps, run timeout after 3001 ms. (steps per millisecond=85 ) properties seen :{0=1, 1=1, 3=1, 4=1, 7=1, 9=1, 10=1, 11=1, 12=1, 13=1, 14=1, 15=1, 16=1, 17=1, 18=1, 19=1, 20=1, 21=1, 24=1, 27=1, 28=1, 29=1, 31=1, 32=1, 33=1, 34=1, 35=1, 37=1, 38=1, 39=1, 40=1}
Probabilistic random walk after 255495 steps, saw 57608 distinct states, run finished after 3001 ms. (steps per millisecond=85 ) properties seen :31
Running SMT prover for 10 properties.
[2023-04-07 02:55:02] [INFO ] Flow matrix only has 206 transitions (discarded 164 similar events)
// Phase 1: matrix 206 rows 139 cols
[2023-04-07 02:55:02] [INFO ] Computed 13 invariants in 14 ms
[2023-04-07 02:55:03] [INFO ] [Real]Absence check using 9 positive place invariants in 10 ms returned sat
[2023-04-07 02:55:03] [INFO ] [Real]Absence check using 9 positive and 4 generalized place invariants in 1 ms returned sat
[2023-04-07 02:55:03] [INFO ] After 259ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-04-07 02:55:03] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2023-04-07 02:55:03] [INFO ] [Nat]Absence check using 9 positive and 4 generalized place invariants in 2 ms returned sat
[2023-04-07 02:55:03] [INFO ] After 168ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-04-07 02:55:03] [INFO ] State equation strengthened by 91 read => feed constraints.
[2023-04-07 02:55:03] [INFO ] After 167ms SMT Verify possible using 91 Read/Feed constraints in natural domain returned unsat :0 sat :10
[2023-04-07 02:55:03] [INFO ] Deduced a trap composed of 7 places in 160 ms of which 0 ms to minimize.
[2023-04-07 02:55:04] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 0 ms to minimize.
[2023-04-07 02:55:04] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 0 ms to minimize.
[2023-04-07 02:55:04] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 345 ms
[2023-04-07 02:55:04] [INFO ] Deduced a trap composed of 21 places in 121 ms of which 0 ms to minimize.
[2023-04-07 02:55:04] [INFO ] Deduced a trap composed of 13 places in 113 ms of which 1 ms to minimize.
[2023-04-07 02:55:04] [INFO ] Deduced a trap composed of 3 places in 64 ms of which 0 ms to minimize.
[2023-04-07 02:55:04] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 338 ms
[2023-04-07 02:55:04] [INFO ] Deduced a trap composed of 38 places in 98 ms of which 1 ms to minimize.
[2023-04-07 02:55:04] [INFO ] Deduced a trap composed of 22 places in 129 ms of which 1 ms to minimize.
[2023-04-07 02:55:07] [INFO ] Deduced a trap composed of 37 places in 2693 ms of which 24 ms to minimize.
[2023-04-07 02:55:07] [INFO ] Deduced a trap composed of 37 places in 168 ms of which 0 ms to minimize.
[2023-04-07 02:55:07] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 3153 ms
[2023-04-07 02:55:07] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 1 ms to minimize.
[2023-04-07 02:55:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 65 ms
[2023-04-07 02:55:07] [INFO ] Deduced a trap composed of 16 places in 96 ms of which 1 ms to minimize.
[2023-04-07 02:55:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 114 ms
[2023-04-07 02:55:07] [INFO ] After 4397ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 406 ms.
[2023-04-07 02:55:08] [INFO ] After 5139ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Parikh walk visited 0 properties in 38 ms.
Support contains 23 out of 139 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 139/139 places, 370/370 transitions.
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 13 Pre rules applied. Total rules applied 0 place count 139 transition count 357
Deduced a syphon composed of 13 places in 12 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 0 with 26 rules applied. Total rules applied 26 place count 126 transition count 357
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 30 place count 122 transition count 341
Iterating global reduction 0 with 4 rules applied. Total rules applied 34 place count 122 transition count 341
Applied a total of 34 rules in 49 ms. Remains 122 /139 variables (removed 17) and now considering 341/370 (removed 29) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 122/139 places, 341/370 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 10) 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 10) seen :0
Interrupted probabilistic random walk after 529975 steps, run timeout after 3001 ms. (steps per millisecond=176 ) properties seen :{1=1, 4=1, 5=1, 6=1, 7=1, 8=1, 9=1}
Probabilistic random walk after 529975 steps, saw 107785 distinct states, run finished after 3016 ms. (steps per millisecond=175 ) properties seen :7
Running SMT prover for 3 properties.
[2023-04-07 02:55:11] [INFO ] Flow matrix only has 177 transitions (discarded 164 similar events)
// Phase 1: matrix 177 rows 122 cols
[2023-04-07 02:55:11] [INFO ] Computed 13 invariants in 3 ms
[2023-04-07 02:55:11] [INFO ] [Real]Absence check using 9 positive place invariants in 33 ms returned sat
[2023-04-07 02:55:12] [INFO ] [Real]Absence check using 9 positive and 4 generalized place invariants in 2 ms returned sat
[2023-04-07 02:55:12] [INFO ] After 199ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-04-07 02:55:12] [INFO ] [Nat]Absence check using 9 positive place invariants in 54 ms returned sat
[2023-04-07 02:55:12] [INFO ] [Nat]Absence check using 9 positive and 4 generalized place invariants in 6 ms returned sat
[2023-04-07 02:55:13] [INFO ] After 1123ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-04-07 02:55:13] [INFO ] State equation strengthened by 79 read => feed constraints.
[2023-04-07 02:55:13] [INFO ] After 158ms SMT Verify possible using 79 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-04-07 02:55:13] [INFO ] Deduced a trap composed of 3 places in 140 ms of which 0 ms to minimize.
[2023-04-07 02:55:14] [INFO ] Deduced a trap composed of 3 places in 87 ms of which 1 ms to minimize.
[2023-04-07 02:55:14] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2023-04-07 02:55:14] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 319 ms
[2023-04-07 02:55:14] [INFO ] Deduced a trap composed of 29 places in 77 ms of which 1 ms to minimize.
[2023-04-07 02:55:15] [INFO ] Deduced a trap composed of 18 places in 1194 ms of which 16 ms to minimize.
[2023-04-07 02:55:15] [INFO ] Deduced a trap composed of 3 places in 103 ms of which 0 ms to minimize.
[2023-04-07 02:55:15] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1440 ms
[2023-04-07 02:55:15] [INFO ] After 1998ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 48 ms.
[2023-04-07 02:55:15] [INFO ] After 3533ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 1 ms.
Support contains 11 out of 122 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 122/122 places, 341/341 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 122 transition count 338
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 119 transition count 338
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 118 transition count 334
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 118 transition count 334
Applied a total of 8 rules in 36 ms. Remains 118 /122 variables (removed 4) and now considering 334/341 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 118/122 places, 334/341 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 329625 steps, run timeout after 3001 ms. (steps per millisecond=109 ) properties seen :{}
Probabilistic random walk after 329625 steps, saw 67291 distinct states, run finished after 3017 ms. (steps per millisecond=109 ) properties seen :0
Running SMT prover for 3 properties.
[2023-04-07 02:55:18] [INFO ] Flow matrix only has 170 transitions (discarded 164 similar events)
// Phase 1: matrix 170 rows 118 cols
[2023-04-07 02:55:18] [INFO ] Computed 13 invariants in 2 ms
[2023-04-07 02:55:18] [INFO ] [Real]Absence check using 9 positive place invariants in 4 ms returned sat
[2023-04-07 02:55:18] [INFO ] [Real]Absence check using 9 positive and 4 generalized place invariants in 40 ms returned sat
[2023-04-07 02:55:19] [INFO ] After 275ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-04-07 02:55:19] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-04-07 02:55:19] [INFO ] [Nat]Absence check using 9 positive and 4 generalized place invariants in 1 ms returned sat
[2023-04-07 02:55:19] [INFO ] After 98ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-04-07 02:55:19] [INFO ] State equation strengthened by 76 read => feed constraints.
[2023-04-07 02:55:19] [INFO ] After 55ms SMT Verify possible using 76 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-04-07 02:55:20] [INFO ] Deduced a trap composed of 3 places in 1223 ms of which 30 ms to minimize.
[2023-04-07 02:55:20] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 9 ms to minimize.
[2023-04-07 02:55:20] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
[2023-04-07 02:55:20] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1352 ms
[2023-04-07 02:55:20] [INFO ] After 1509ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 32 ms.
[2023-04-07 02:55:20] [INFO ] After 1744ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 6 ms.
Support contains 11 out of 118 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 118/118 places, 334/334 transitions.
Applied a total of 0 rules in 21 ms. Remains 118 /118 variables (removed 0) and now considering 334/334 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 118/118 places, 334/334 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 118/118 places, 334/334 transitions.
Applied a total of 0 rules in 28 ms. Remains 118 /118 variables (removed 0) and now considering 334/334 (removed 0) transitions.
[2023-04-07 02:55:20] [INFO ] Flow matrix only has 170 transitions (discarded 164 similar events)
[2023-04-07 02:55:20] [INFO ] Invariant cache hit.
[2023-04-07 02:55:21] [INFO ] Implicit Places using invariants in 209 ms returned []
[2023-04-07 02:55:21] [INFO ] Flow matrix only has 170 transitions (discarded 164 similar events)
[2023-04-07 02:55:21] [INFO ] Invariant cache hit.
[2023-04-07 02:55:21] [INFO ] State equation strengthened by 76 read => feed constraints.
[2023-04-07 02:55:21] [INFO ] Implicit Places using invariants and state equation in 321 ms returned []
Implicit Place search using SMT with State Equation took 532 ms to find 0 implicit places.
[2023-04-07 02:55:21] [INFO ] Redundant transitions in 26 ms returned []
[2023-04-07 02:55:21] [INFO ] Flow matrix only has 170 transitions (discarded 164 similar events)
[2023-04-07 02:55:21] [INFO ] Invariant cache hit.
[2023-04-07 02:55:21] [INFO ] Dead Transitions using invariants and state equation in 250 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 876 ms. Remains : 118/118 places, 334/334 transitions.
Graph (trivial) has 261 edges and 118 vertex of which 16 / 118 are part of one of the 4 SCC in 3 ms
Free SCC test removed 12 places
Drop transitions removed 44 transitions
Ensure Unique test removed 156 transitions
Reduce isomorphic transitions removed 200 transitions.
Drop transitions removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 106 transition count 115
Reduce places removed 19 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 20 rules applied. Total rules applied 40 place count 87 transition count 114
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 41 place count 86 transition count 114
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 41 place count 86 transition count 105
Deduced a syphon composed of 9 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 63 place count 73 transition count 105
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 105 place count 52 transition count 84
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 113 place count 52 transition count 76
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -32
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 125 place count 46 transition count 108
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 127 place count 46 transition count 106
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 130 place count 46 transition count 103
Free-agglomeration rule applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 132 place count 46 transition count 101
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 134 place count 44 transition count 101
Partial Free-agglomeration rule applied 16 times.
Drop transitions removed 16 transitions
Iterating global reduction 6 with 16 rules applied. Total rules applied 150 place count 44 transition count 101
Applied a total of 150 rules in 51 ms. Remains 44 /118 variables (removed 74) and now considering 101/334 (removed 233) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 101 rows 44 cols
[2023-04-07 02:55:21] [INFO ] Computed 9 invariants in 1 ms
[2023-04-07 02:55:21] [INFO ] [Real]Absence check using 9 positive place invariants in 1 ms returned sat
[2023-04-07 02:55:21] [INFO ] After 88ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-04-07 02:55:21] [INFO ] [Nat]Absence check using 9 positive place invariants in 1 ms returned sat
[2023-04-07 02:55:21] [INFO ] After 55ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-04-07 02:55:21] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-04-07 02:55:21] [INFO ] After 16ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-04-07 02:55:22] [INFO ] Deduced a trap composed of 2 places in 205 ms of which 20 ms to minimize.
[2023-04-07 02:55:22] [INFO ] Deduced a trap composed of 2 places in 29 ms of which 1 ms to minimize.
[2023-04-07 02:55:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 261 ms
[2023-04-07 02:55:22] [INFO ] Deduced a trap composed of 3 places in 386 ms of which 1 ms to minimize.
[2023-04-07 02:55:22] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 0 ms to minimize.
[2023-04-07 02:55:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 451 ms
[2023-04-07 02:55:22] [INFO ] After 841ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 60 ms.
[2023-04-07 02:55:22] [INFO ] After 1023ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Successfully simplified 1 atomic propositions for a total of 16 simplifications.
[2023-04-07 02:55:23] [INFO ] Flatten gal took : 67 ms
[2023-04-07 02:55:23] [INFO ] Flatten gal took : 37 ms
[2023-04-07 02:55:23] [INFO ] Input system was already deterministic with 436 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 436/436 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 184 transition count 400
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 184 transition count 400
Applied a total of 18 rules in 6 ms. Remains 184 /193 variables (removed 9) and now considering 400/436 (removed 36) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15 ms. Remains : 184/193 places, 400/436 transitions.
[2023-04-07 02:55:23] [INFO ] Flatten gal took : 34 ms
[2023-04-07 02:55:23] [INFO ] Flatten gal took : 22 ms
[2023-04-07 02:55:23] [INFO ] Input system was already deterministic with 400 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 193/193 places, 436/436 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 193 transition count 432
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 189 transition count 432
Performed 52 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 52 Pre rules applied. Total rules applied 8 place count 189 transition count 380
Deduced a syphon composed of 52 places in 0 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 2 with 104 rules applied. Total rules applied 112 place count 137 transition count 380
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 121 place count 128 transition count 344
Iterating global reduction 2 with 9 rules applied. Total rules applied 130 place count 128 transition count 344
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 154 place count 116 transition count 332
Applied a total of 154 rules in 29 ms. Remains 116 /193 variables (removed 77) and now considering 332/436 (removed 104) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 30 ms. Remains : 116/193 places, 332/436 transitions.
[2023-04-07 02:55:23] [INFO ] Flatten gal took : 11 ms
[2023-04-07 02:55:23] [INFO ] Flatten gal took : 12 ms
[2023-04-07 02:55:23] [INFO ] Input system was already deterministic with 332 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Finished probabilistic random walk after 646138 steps, run visited all 1 properties in 1526 ms. (steps per millisecond=423 )
Probabilistic random walk after 646138 steps, saw 130507 distinct states, run finished after 1542 ms. (steps per millisecond=419 ) properties seen :1
FORMULA EisenbergMcGuire-PT-04-CTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Parikh walk visited 0 properties in 0 ms.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 436/436 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 186 transition count 408
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 186 transition count 408
Applied a total of 14 rules in 30 ms. Remains 186 /193 variables (removed 7) and now considering 408/436 (removed 28) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31 ms. Remains : 186/193 places, 408/436 transitions.
[2023-04-07 02:55:25] [INFO ] Flatten gal took : 48 ms
[2023-04-07 02:55:25] [INFO ] Flatten gal took : 63 ms
[2023-04-07 02:55:25] [INFO ] Input system was already deterministic with 408 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 193/193 places, 436/436 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 193 transition count 432
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 189 transition count 432
Performed 52 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 52 Pre rules applied. Total rules applied 8 place count 189 transition count 380
Deduced a syphon composed of 52 places in 1 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 2 with 104 rules applied. Total rules applied 112 place count 137 transition count 380
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 121 place count 128 transition count 344
Iterating global reduction 2 with 9 rules applied. Total rules applied 130 place count 128 transition count 344
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 154 place count 116 transition count 332
Applied a total of 154 rules in 62 ms. Remains 116 /193 variables (removed 77) and now considering 332/436 (removed 104) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 62 ms. Remains : 116/193 places, 332/436 transitions.
[2023-04-07 02:55:25] [INFO ] Flatten gal took : 14 ms
[2023-04-07 02:55:25] [INFO ] Flatten gal took : 31 ms
[2023-04-07 02:55:25] [INFO ] Input system was already deterministic with 332 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 36177 steps, run visited all 1 properties in 148 ms. (steps per millisecond=244 )
Probabilistic random walk after 36177 steps, saw 9626 distinct states, run finished after 161 ms. (steps per millisecond=224 ) properties seen :1
FORMULA EisenbergMcGuire-PT-04-CTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Parikh walk visited 0 properties in 0 ms.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 436/436 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 184 transition count 400
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 184 transition count 400
Applied a total of 18 rules in 17 ms. Remains 184 /193 variables (removed 9) and now considering 400/436 (removed 36) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17 ms. Remains : 184/193 places, 400/436 transitions.
[2023-04-07 02:55:25] [INFO ] Flatten gal took : 34 ms
[2023-04-07 02:55:25] [INFO ] Flatten gal took : 13 ms
[2023-04-07 02:55:25] [INFO ] Input system was already deterministic with 400 transitions.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 436/436 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 188 transition count 416
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 188 transition count 416
Applied a total of 10 rules in 3 ms. Remains 188 /193 variables (removed 5) and now considering 416/436 (removed 20) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13 ms. Remains : 188/193 places, 416/436 transitions.
[2023-04-07 02:55:25] [INFO ] Flatten gal took : 13 ms
[2023-04-07 02:55:25] [INFO ] Flatten gal took : 12 ms
[2023-04-07 02:55:25] [INFO ] Input system was already deterministic with 416 transitions.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 436/436 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 184 transition count 400
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 184 transition count 400
Applied a total of 18 rules in 4 ms. Remains 184 /193 variables (removed 9) and now considering 400/436 (removed 36) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 184/193 places, 400/436 transitions.
[2023-04-07 02:55:25] [INFO ] Flatten gal took : 21 ms
[2023-04-07 02:55:25] [INFO ] Flatten gal took : 12 ms
[2023-04-07 02:55:26] [INFO ] Input system was already deterministic with 400 transitions.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 436/436 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 187 transition count 412
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 187 transition count 412
Applied a total of 12 rules in 27 ms. Remains 187 /193 variables (removed 6) and now considering 412/436 (removed 24) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27 ms. Remains : 187/193 places, 412/436 transitions.
[2023-04-07 02:55:26] [INFO ] Flatten gal took : 28 ms
[2023-04-07 02:55:26] [INFO ] Flatten gal took : 25 ms
[2023-04-07 02:55:26] [INFO ] Input system was already deterministic with 412 transitions.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 436/436 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 184 transition count 400
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 184 transition count 400
Applied a total of 18 rules in 5 ms. Remains 184 /193 variables (removed 9) and now considering 400/436 (removed 36) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 184/193 places, 400/436 transitions.
[2023-04-07 02:55:26] [INFO ] Flatten gal took : 26 ms
[2023-04-07 02:55:26] [INFO ] Flatten gal took : 11 ms
[2023-04-07 02:55:26] [INFO ] Input system was already deterministic with 400 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 193/193 places, 436/436 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 193 transition count 432
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 189 transition count 432
Performed 52 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 52 Pre rules applied. Total rules applied 8 place count 189 transition count 380
Deduced a syphon composed of 52 places in 0 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 2 with 104 rules applied. Total rules applied 112 place count 137 transition count 380
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 121 place count 128 transition count 344
Iterating global reduction 2 with 9 rules applied. Total rules applied 130 place count 128 transition count 344
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 154 place count 116 transition count 332
Applied a total of 154 rules in 39 ms. Remains 116 /193 variables (removed 77) and now considering 332/436 (removed 104) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 39 ms. Remains : 116/193 places, 332/436 transitions.
[2023-04-07 02:55:26] [INFO ] Flatten gal took : 9 ms
[2023-04-07 02:55:26] [INFO ] Flatten gal took : 27 ms
[2023-04-07 02:55:26] [INFO ] Input system was already deterministic with 332 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Finished probabilistic random walk after 158193 steps, run visited all 1 properties in 593 ms. (steps per millisecond=266 )
Probabilistic random walk after 158193 steps, saw 34593 distinct states, run finished after 593 ms. (steps per millisecond=266 ) properties seen :1
FORMULA EisenbergMcGuire-PT-04-CTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Parikh walk visited 0 properties in 0 ms.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 436/436 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 184 transition count 400
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 184 transition count 400
Applied a total of 18 rules in 4 ms. Remains 184 /193 variables (removed 9) and now considering 400/436 (removed 36) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 184/193 places, 400/436 transitions.
[2023-04-07 02:55:27] [INFO ] Flatten gal took : 38 ms
[2023-04-07 02:55:27] [INFO ] Flatten gal took : 10 ms
[2023-04-07 02:55:27] [INFO ] Input system was already deterministic with 400 transitions.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 436/436 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 185 transition count 404
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 185 transition count 404
Applied a total of 16 rules in 4 ms. Remains 185 /193 variables (removed 8) and now considering 404/436 (removed 32) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 185/193 places, 404/436 transitions.
[2023-04-07 02:55:27] [INFO ] Flatten gal took : 23 ms
[2023-04-07 02:55:27] [INFO ] Flatten gal took : 32 ms
[2023-04-07 02:55:27] [INFO ] Input system was already deterministic with 404 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 193/193 places, 436/436 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 193 transition count 433
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 190 transition count 433
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 51 Pre rules applied. Total rules applied 6 place count 190 transition count 382
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 108 place count 139 transition count 382
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 117 place count 130 transition count 346
Iterating global reduction 2 with 9 rules applied. Total rules applied 126 place count 130 transition count 346
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
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 148 place count 119 transition count 335
Applied a total of 148 rules in 73 ms. Remains 119 /193 variables (removed 74) and now considering 335/436 (removed 101) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 74 ms. Remains : 119/193 places, 335/436 transitions.
[2023-04-07 02:55:27] [INFO ] Flatten gal took : 24 ms
[2023-04-07 02:55:27] [INFO ] Flatten gal took : 9 ms
[2023-04-07 02:55:27] [INFO ] Input system was already deterministic with 335 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 193/193 places, 436/436 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 193 transition count 432
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 189 transition count 432
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 49 Pre rules applied. Total rules applied 8 place count 189 transition count 383
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 2 with 98 rules applied. Total rules applied 106 place count 140 transition count 383
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 115 place count 131 transition count 347
Iterating global reduction 2 with 9 rules applied. Total rules applied 124 place count 131 transition count 347
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
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 146 place count 120 transition count 336
Applied a total of 146 rules in 16 ms. Remains 120 /193 variables (removed 73) and now considering 336/436 (removed 100) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 16 ms. Remains : 120/193 places, 336/436 transitions.
[2023-04-07 02:55:27] [INFO ] Flatten gal took : 8 ms
[2023-04-07 02:55:27] [INFO ] Flatten gal took : 9 ms
[2023-04-07 02:55:27] [INFO ] Input system was already deterministic with 336 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 193/193 places, 436/436 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 193 transition count 433
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 190 transition count 433
Performed 52 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 52 Pre rules applied. Total rules applied 6 place count 190 transition count 381
Deduced a syphon composed of 52 places in 0 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 2 with 104 rules applied. Total rules applied 110 place count 138 transition count 381
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 118 place count 130 transition count 349
Iterating global reduction 2 with 8 rules applied. Total rules applied 126 place count 130 transition count 349
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 13 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 150 place count 118 transition count 337
Applied a total of 150 rules in 28 ms. Remains 118 /193 variables (removed 75) and now considering 337/436 (removed 99) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 29 ms. Remains : 118/193 places, 337/436 transitions.
[2023-04-07 02:55:27] [INFO ] Flatten gal took : 9 ms
[2023-04-07 02:55:27] [INFO ] Flatten gal took : 26 ms
[2023-04-07 02:55:27] [INFO ] Input system was already deterministic with 337 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 193/193 places, 436/436 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 193 transition count 432
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 189 transition count 432
Performed 52 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 52 Pre rules applied. Total rules applied 8 place count 189 transition count 380
Deduced a syphon composed of 52 places in 0 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 2 with 104 rules applied. Total rules applied 112 place count 137 transition count 380
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 121 place count 128 transition count 344
Iterating global reduction 2 with 9 rules applied. Total rules applied 130 place count 128 transition count 344
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 154 place count 116 transition count 332
Applied a total of 154 rules in 31 ms. Remains 116 /193 variables (removed 77) and now considering 332/436 (removed 104) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 32 ms. Remains : 116/193 places, 332/436 transitions.
[2023-04-07 02:55:27] [INFO ] Flatten gal took : 8 ms
[2023-04-07 02:55:27] [INFO ] Flatten gal took : 21 ms
[2023-04-07 02:55:27] [INFO ] Input system was already deterministic with 332 transitions.
[2023-04-07 02:55:27] [INFO ] Flatten gal took : 24 ms
[2023-04-07 02:55:27] [INFO ] Flatten gal took : 25 ms
[2023-04-07 02:55:27] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2023-04-07 02:55:27] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 193 places, 436 transitions and 1904 arcs took 18 ms.
Total runtime 48437 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --ctl=/tmp/639/ctl_0_ --ctl=/tmp/639/ctl_1_ --ctl=/tmp/639/ctl_2_ --ctl=/tmp/639/ctl_3_ --ctl=/tmp/639/ctl_4_ --ctl=/tmp/639/ctl_5_ --ctl=/tmp/639/ctl_6_ --ctl=/tmp/639/ctl_7_ --ctl=/tmp/639/ctl_8_ --ctl=/tmp/639/ctl_9_ --ctl=/tmp/639/ctl_10_ --ctl=/tmp/639/ctl_11_ --ctl=/tmp/639/ctl_12_ --mu-par --mu-opt
FORMULA EisenbergMcGuire-PT-04-CTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA EisenbergMcGuire-PT-04-CTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA EisenbergMcGuire-PT-04-CTLFireability-04 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA EisenbergMcGuire-PT-04-CTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA EisenbergMcGuire-PT-04-CTLFireability-06 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA EisenbergMcGuire-PT-04-CTLFireability-07 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA EisenbergMcGuire-PT-04-CTLFireability-08 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA EisenbergMcGuire-PT-04-CTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA EisenbergMcGuire-PT-04-CTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA EisenbergMcGuire-PT-04-CTLFireability-12 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA EisenbergMcGuire-PT-04-CTLFireability-13 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA EisenbergMcGuire-PT-04-CTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA EisenbergMcGuire-PT-04-CTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN

BK_STOP 1680838310248

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
mcc2023
ctl formula name EisenbergMcGuire-PT-04-CTLFireability-00
ctl formula formula --ctl=/tmp/639/ctl_0_
ctl formula name EisenbergMcGuire-PT-04-CTLFireability-02
ctl formula formula --ctl=/tmp/639/ctl_1_
ctl formula name EisenbergMcGuire-PT-04-CTLFireability-04
ctl formula formula --ctl=/tmp/639/ctl_2_
ctl formula name EisenbergMcGuire-PT-04-CTLFireability-05
ctl formula formula --ctl=/tmp/639/ctl_3_
ctl formula name EisenbergMcGuire-PT-04-CTLFireability-06
ctl formula formula --ctl=/tmp/639/ctl_4_
ctl formula name EisenbergMcGuire-PT-04-CTLFireability-07
ctl formula formula --ctl=/tmp/639/ctl_5_
ctl formula name EisenbergMcGuire-PT-04-CTLFireability-08
ctl formula formula --ctl=/tmp/639/ctl_6_
ctl formula name EisenbergMcGuire-PT-04-CTLFireability-10
ctl formula formula --ctl=/tmp/639/ctl_7_
ctl formula name EisenbergMcGuire-PT-04-CTLFireability-11
ctl formula formula --ctl=/tmp/639/ctl_8_
ctl formula name EisenbergMcGuire-PT-04-CTLFireability-12
ctl formula formula --ctl=/tmp/639/ctl_9_
ctl formula name EisenbergMcGuire-PT-04-CTLFireability-13
ctl formula formula --ctl=/tmp/639/ctl_10_
ctl formula name EisenbergMcGuire-PT-04-CTLFireability-14
ctl formula formula --ctl=/tmp/639/ctl_11_
ctl formula name EisenbergMcGuire-PT-04-CTLFireability-15
ctl formula formula --ctl=/tmp/639/ctl_12_
pnml2lts-sym: Exploration order is bfs-prev
pnml2lts-sym: Saturation strategy is sat
pnml2lts-sym: Guided search strategy is unguided
pnml2lts-sym: Attractor strategy is default
pnml2lts-sym: opening model.pnml
pnml2lts-sym: Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-sym: Petri net has 193 places, 436 transitions and 1904 arcs
pnml2lts-sym: Petri net Petri analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-sym: Initializing regrouping layer
pnml2lts-sym: Regroup specification: bs,w2W,ru,hf
pnml2lts-sym: Regroup Boost's Sloan
pnml2lts-sym: Regroup over-approximate must-write to may-write
pnml2lts-sym: Regroup Row sUbsume
pnml2lts-sym: Reqroup Horizontal Flip
pnml2lts-sym: Regrouping: 436->432 groups
pnml2lts-sym: Regrouping took 0.160 real 0.130 user 0.000 sys
pnml2lts-sym: state vector length is 193; there are 432 groups
pnml2lts-sym: Creating a multi-core ListDD domain.
pnml2lts-sym: Sylvan allocates 15.000 GB virtual memory for nodes table and operation cache.
pnml2lts-sym: Initial nodes table and operation cache requires 60.00 MB.
pnml2lts-sym: Using GBgetTransitionsShortR2W as next-state function
pnml2lts-sym: got initial state
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: Exploration took 37989060 group checks and 0 next state calls
pnml2lts-sym: reachability took 798.870 real 3181.230 user 9.190 sys
pnml2lts-sym: counting visited states...
pnml2lts-sym: counting took 0.040 real 0.230 user 0.000 sys
pnml2lts-sym: state space has 1616316 states, 206687 nodes
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: Formula /tmp/639/ctl_0_ does not hold for the initial state
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: Formula /tmp/639/ctl_12_ does not hold for the initial state
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: Formula /tmp/639/ctl_3_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/639/ctl_4_ holds for the initial state
pnml2lts-sym: Formula /tmp/639/ctl_5_ holds for the initial state
pnml2lts-sym: Formula /tmp/639/ctl_2_ holds for the initial state
pnml2lts-sym: Formula /tmp/639/ctl_7_ does not hold for the initial state
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: Formula /tmp/639/ctl_1_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/639/ctl_11_ does not hold for the initial state
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: Formula /tmp/639/ctl_6_ holds for the initial state
pnml2lts-sym: Formula /tmp/639/ctl_8_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/639/ctl_9_ holds for the initial state
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: Formula /tmp/639/ctl_10_ holds for the initial state
pnml2lts-sym: group_next: 3288 nodes total
pnml2lts-sym: group_explored: 3409 nodes, 3216 short vectors total
pnml2lts-sym: max token count: 1

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="EisenbergMcGuire-PT-04"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is EisenbergMcGuire-PT-04, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r521-tall-167987246400226"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/EisenbergMcGuire-PT-04.tgz
mv EisenbergMcGuire-PT-04 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;