Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r283-smll-165307355900129.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is UtilityControlRoom-PT-Z2T4N08, examination is Liveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r283-smll-165307355900129
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 27K Apr 29 18:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 148K Apr 29 18:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 20K Apr 29 17:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 100K Apr 29 17:59 CTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 9 09:20 LTLCardinality.txt
-rw-r--r-- 1 mcc users 43K May 9 09:20 LTLCardinality.xml
-rw-r--r-- 1 mcc users 12K May 9 09:20 LTLFireability.txt
-rw-r--r-- 1 mcc users 40K May 9 09:20 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K May 9 09:20 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.2K May 9 09:20 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 8 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 93K May 10 09:34 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME Liveness

=== Now, execution of the tool begins

BK_START 1653144631012

Running Version 202205111006
[2022-05-21 14:50:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, Liveness, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2022-05-21 14:50:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-21 14:50:33] [INFO ] Load time of PNML (sax parser for PT used): 166 ms
[2022-05-21 14:50:33] [INFO ] Transformed 140 places.
[2022-05-21 14:50:33] [INFO ] Transformed 216 transitions.
[2022-05-21 14:50:33] [INFO ] Parsed PT model containing 140 places and 216 transitions in 393 ms.
Discarding 64 transitions out of 216. Remains 152
Ensure Unique test removed 32 transitions
Reduce redundant transitions removed 32 transitions.
Built sparse matrix representations for Structural reductions in 12 ms.10861KB memory used
Starting structural reductions in DEADLOCKS mode, iteration 0 : 140/140 places, 184/184 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 140 transition count 168
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 16 rules in 57 ms. Remains 140 /140 variables (removed 0) and now considering 168/184 (removed 16) transitions.
Finished structural reductions, in 1 iterations. Remains : 140/140 places, 168/184 transitions.
Random walk for 1250000 steps, including 0 resets, run took 2002 ms (no deadlock found). (steps per millisecond=624 )
Random directed walk for 1250005 steps, including 0 resets, run took 1870 ms (no deadlock found). (steps per millisecond=668 )
// Phase 1: matrix 168 rows 140 cols
[2022-05-21 14:50:37] [INFO ] Computed 19 place invariants in 15 ms
[2022-05-21 14:50:37] [INFO ] [Real]Absence check using 19 positive place invariants in 12 ms returned unsat
Starting structural reductions in LIVENESS mode, iteration 0 : 140/140 places, 216/216 transitions.
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 140 transition count 152
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 112 place count 108 transition count 136
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 112 place count 108 transition count 120
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 144 place count 92 transition count 120
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 176 place count 76 transition count 104
Applied a total of 176 rules in 25 ms. Remains 76 /140 variables (removed 64) and now considering 104/216 (removed 112) transitions.
// Phase 1: matrix 104 rows 76 cols
[2022-05-21 14:50:37] [INFO ] Computed 19 place invariants in 5 ms
[2022-05-21 14:50:37] [INFO ] Implicit Places using invariants in 165 ms returned [42, 43]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 182 ms to find 2 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 74/140 places, 104/216 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 0 with 32 rules applied. Total rules applied 32 place count 58 transition count 88
Applied a total of 32 rules in 8 ms. Remains 58 /74 variables (removed 16) and now considering 88/104 (removed 16) transitions.
// Phase 1: matrix 88 rows 58 cols
[2022-05-21 14:50:37] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-21 14:50:38] [INFO ] Implicit Places using invariants in 86 ms returned []
// Phase 1: matrix 88 rows 58 cols
[2022-05-21 14:50:38] [INFO ] Computed 17 place invariants in 4 ms
[2022-05-21 14:50:38] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 228 ms to find 0 implicit places.
Starting structural reductions in LIVENESS mode, iteration 2 : 58/140 places, 88/216 transitions.
Finished structural reductions, in 2 iterations. Remains : 58/140 places, 88/216 transitions.
Discarding 16 transitions out of 88. Remains 72
Initial state reduction rules removed 8 formulas.
Finished random walk after 458 steps, including 0 resets, run visited all 64 properties in 80 ms. (steps per millisecond=5 )
Able to resolve query QuasiLiveness after proving 72 properties.
Starting structural reductions in LIVENESS mode, iteration 0 : 140/140 places, 216/216 transitions.
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 140 transition count 152
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 112 place count 108 transition count 136
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 112 place count 108 transition count 120
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 144 place count 92 transition count 120
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 176 place count 76 transition count 104
Applied a total of 176 rules in 17 ms. Remains 76 /140 variables (removed 64) and now considering 104/216 (removed 112) transitions.
// Phase 1: matrix 104 rows 76 cols
[2022-05-21 14:50:38] [INFO ] Computed 19 place invariants in 1 ms
[2022-05-21 14:50:38] [INFO ] Implicit Places using invariants in 136 ms returned [42, 43]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 138 ms to find 2 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 74/140 places, 104/216 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 0 with 32 rules applied. Total rules applied 32 place count 58 transition count 88
Applied a total of 32 rules in 17 ms. Remains 58 /74 variables (removed 16) and now considering 88/104 (removed 16) transitions.
// Phase 1: matrix 88 rows 58 cols
[2022-05-21 14:50:38] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-21 14:50:38] [INFO ] Implicit Places using invariants in 65 ms returned []
// Phase 1: matrix 88 rows 58 cols
[2022-05-21 14:50:38] [INFO ] Computed 17 place invariants in 3 ms
[2022-05-21 14:50:38] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
Starting structural reductions in LIVENESS mode, iteration 2 : 58/140 places, 88/216 transitions.
Finished structural reductions, in 2 iterations. Remains : 58/140 places, 88/216 transitions.
Discarding 16 transitions out of 88. Remains 72
[2022-05-21 14:50:38] [INFO ] Flatten gal took : 58 ms
[2022-05-21 14:50:38] [INFO ] Flatten gal took : 23 ms
[2022-05-21 14:50:38] [INFO ] Time to serialize gal into /tmp/CTLFireability1959507859899649281.gal : 13 ms
[2022-05-21 14:50:38] [INFO ] Time to serialize properties into /tmp/CTLFireability14035584325171469565.ctl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1959507859899649281.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14035584325171469565.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
No direction supplied, using forward translation only.
Parsed 72 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.31719e+07,0.04097,4976,2,274,5,1902,6,0,323,1107,0


Converting to forward existential form...Done !
original formula: AG(EF(((IdleTechs_0>=1)&&(OpenRequests_0_0>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((IdleTechs_0>=1)&&(OpenRequests_0_0>=1)))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.103525,7336,1,0,6,15045,14,0,1486,5655,5
Formula is TRUE !

***************************************

original formula: AG(EF(((IdleTechs_0>=1)&&(OpenRequests_0_1>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((IdleTechs_0>=1)&&(OpenRequests_0_1>=1)))))] = FALSE
(forward)formula 1,1,0.121788,7864,1,0,7,18314,15,0,1487,8150,8
Formula is TRUE !

***************************************

original formula: AG(EF(((IdleTechs_0>=1)&&(OpenRequests_1_0>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((IdleTechs_0>=1)&&(OpenRequests_1_0>=1)))))] = FALSE
(forward)formula 2,1,0.14736,8392,1,0,8,22235,16,0,1488,11200,11
Formula is TRUE !

***************************************

original formula: AG(EF(((IdleTechs_0>=1)&&(OpenRequests_1_1>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((IdleTechs_0>=1)&&(OpenRequests_1_1>=1)))))] = FALSE
(forward)formula 3,1,0.161092,8920,1,0,9,24611,17,0,1489,13000,14
Formula is TRUE !

***************************************

original formula: AG(EF(((IdleTechs_0>=1)&&(OpenRequests_2_0>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((IdleTechs_0>=1)&&(OpenRequests_2_0>=1)))))] = FALSE
(forward)formula 4,1,0.184539,9448,1,0,10,27931,18,0,1490,15219,17
Formula is TRUE !

***************************************

original formula: AG(EF(((IdleTechs_0>=1)&&(OpenRequests_2_1>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((IdleTechs_0>=1)&&(OpenRequests_2_1>=1)))))] = FALSE
(forward)formula 5,1,0.194655,9712,1,0,11,29897,19,0,1491,16413,20
Formula is TRUE !

***************************************

original formula: AG(EF(((IdleTechs_0>=1)&&(OpenRequests_3_0>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((IdleTechs_0>=1)&&(OpenRequests_3_0>=1)))))] = FALSE
(forward)formula 6,1,0.202533,9976,1,0,12,31192,20,0,1492,17292,23
Formula is TRUE !

***************************************

original formula: AG(EF(((IdleTechs_0>=1)&&(OpenRequests_3_1>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((IdleTechs_0>=1)&&(OpenRequests_3_1>=1)))))] = FALSE
(forward)formula 7,1,0.207738,10240,1,0,13,31978,21,0,1493,17688,26
Formula is TRUE !

***************************************

original formula: AG(EF(((IdleTechs_0>=1)&&(OpenRequests_4_0>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((IdleTechs_0>=1)&&(OpenRequests_4_0>=1)))))] = FALSE
(forward)formula 8,1,0.211003,10504,1,0,14,32148,22,0,1494,17801,29
Formula is TRUE !

***************************************

original formula: AG(EF(((IdleTechs_0>=1)&&(OpenRequests_4_1>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((IdleTechs_0>=1)&&(OpenRequests_4_1>=1)))))] = FALSE
(forward)formula 9,1,0.213226,10768,1,0,15,32275,23,0,1495,17833,32
Formula is TRUE !

***************************************

original formula: AG(EF(((IdleTechs_0>=1)&&(OpenRequests_5_0>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((IdleTechs_0>=1)&&(OpenRequests_5_0>=1)))))] = FALSE
(forward)formula 10,1,0.215419,10768,1,0,16,32417,24,0,1496,17896,35
Formula is TRUE !

***************************************

original formula: AG(EF(((IdleTechs_0>=1)&&(OpenRequests_5_1>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((IdleTechs_0>=1)&&(OpenRequests_5_1>=1)))))] = FALSE
(forward)formula 11,1,0.217276,10768,1,0,17,32519,25,0,1497,17928,38
Formula is TRUE !

***************************************

original formula: AG(EF(((IdleTechs_0>=1)&&(OpenRequests_6_0>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((IdleTechs_0>=1)&&(OpenRequests_6_0>=1)))))] = FALSE
(forward)formula 12,1,0.219614,10768,1,0,18,32677,26,0,1498,18030,41
Formula is TRUE !

***************************************

original formula: AG(EF(((IdleTechs_0>=1)&&(OpenRequests_6_1>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((IdleTechs_0>=1)&&(OpenRequests_6_1>=1)))))] = FALSE
(forward)formula 13,1,0.221722,11032,1,0,19,32794,27,0,1499,18099,44
Formula is TRUE !

***************************************

original formula: AG(EF(((IdleTechs_0>=1)&&(OpenRequests_7_0>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((IdleTechs_0>=1)&&(OpenRequests_7_0>=1)))))] = FALSE
(forward)formula 14,1,0.223828,11032,1,0,20,32915,28,0,1500,18170,47
Formula is TRUE !

***************************************

original formula: AG(EF(((IdleTechs_0>=1)&&(OpenRequests_7_1>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((IdleTechs_0>=1)&&(OpenRequests_7_1>=1)))))] = FALSE
(forward)formula 15,1,0.22528,11032,1,0,21,32943,29,0,1501,18189,50
Formula is TRUE !

***************************************

original formula: AG(EF(((IdleTechs_1>=1)&&(OpenRequests_0_0>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((IdleTechs_1>=1)&&(OpenRequests_0_0>=1)))))] = FALSE
(forward)formula 16,1,0.233402,11032,1,0,22,34238,30,0,1502,19298,53
Formula is TRUE !

***************************************

original formula: AG(EF(((IdleTechs_1>=1)&&(OpenRequests_0_1>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((IdleTechs_1>=1)&&(OpenRequests_0_1>=1)))))] = FALSE
(forward)formula 17,1,0.249174,11032,1,0,23,36528,31,0,1503,21322,56
Formula is TRUE !

***************************************

original formula: AG(EF(((IdleTechs_1>=1)&&(OpenRequests_1_0>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((IdleTechs_1>=1)&&(OpenRequests_1_0>=1)))))] = FALSE
(forward)formula 18,1,0.25561,11296,1,0,24,37150,32,0,1504,21962,59
Formula is TRUE !

***************************************

original formula: AG(EF(((IdleTechs_1>=1)&&(OpenRequests_1_1>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((IdleTechs_1>=1)&&(OpenRequests_1_1>=1)))))] = FALSE
(forward)formula 19,1,0.279919,11560,1,0,25,39142,33,0,1505,23748,62
Formula is TRUE !

***************************************

original formula: AG(EF(((IdleTechs_1>=1)&&(OpenRequests_2_0>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((IdleTechs_1>=1)&&(OpenRequests_2_0>=1)))))] = FALSE
(forward)formula 20,1,0.284983,11824,1,0,26,39688,34,0,1506,24170,65
Formula is TRUE !

***************************************

original formula: AG(EF(((IdleTechs_1>=1)&&(OpenRequests_2_1>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((IdleTechs_1>=1)&&(OpenRequests_2_1>=1)))))] = FALSE
(forward)formula 21,1,0.29649,12088,1,0,27,41450,35,0,1507,25555,68
Formula is TRUE !

***************************************

original formula: AG(EF(((IdleTechs_1>=1)&&(OpenRequests_3_0>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((IdleTechs_1>=1)&&(OpenRequests_3_0>=1)))))] = FALSE
(forward)formula 22,1,0.300757,12352,1,0,28,41776,36,0,1508,25775,71
Formula is TRUE !

***************************************

original formula: AG(EF(((IdleTechs_1>=1)&&(OpenRequests_3_1>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((IdleTechs_1>=1)&&(OpenRequests_3_1>=1)))))] = FALSE
(forward)formula 23,1,0.313781,12352,1,0,29,42656,37,0,1509,26336,74
Formula is TRUE !

***************************************

original formula: AG(EF(((IdleTechs_1>=1)&&(OpenRequests_4_0>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((IdleTechs_1>=1)&&(OpenRequests_4_0>=1)))))] = FALSE
(forward)formula 24,1,0.316898,12352,1,0,30,42759,38,0,1510,26366,77
Formula is TRUE !

***************************************

original formula: AG(EF(((IdleTechs_1>=1)&&(OpenRequests_4_1>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((IdleTechs_1>=1)&&(OpenRequests_4_1>=1)))))] = FALSE
(forward)formula 25,1,0.318878,12352,1,0,31,42844,39,0,1511,26366,80
Formula is TRUE !

***************************************

original formula: AG(EF(((IdleTechs_1>=1)&&(OpenRequests_5_0>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((IdleTechs_1>=1)&&(OpenRequests_5_0>=1)))))] = FALSE
(forward)formula 26,1,0.320864,12352,1,0,32,42906,40,0,1512,26366,83
Formula is TRUE !

***************************************

original formula: AG(EF(((IdleTechs_1>=1)&&(OpenRequests_5_1>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((IdleTechs_1>=1)&&(OpenRequests_5_1>=1)))))] = FALSE
(forward)formula 27,1,0.322458,12616,1,0,33,42966,41,0,1513,26366,86
Formula is TRUE !

***************************************

original formula: AG(EF(((IdleTechs_1>=1)&&(OpenRequests_6_0>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((IdleTechs_1>=1)&&(OpenRequests_6_0>=1)))))] = FALSE
(forward)formula 28,1,0.324345,12616,1,0,34,42992,42,0,1514,26366,89
Formula is TRUE !

***************************************

original formula: AG(EF(((IdleTechs_1>=1)&&(OpenRequests_6_1>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((IdleTechs_1>=1)&&(OpenRequests_6_1>=1)))))] = FALSE
(forward)formula 29,1,0.326032,12616,1,0,35,43017,43,0,1515,26366,92
Formula is TRUE !

***************************************

original formula: AG(EF(((IdleTechs_1>=1)&&(OpenRequests_7_0>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((IdleTechs_1>=1)&&(OpenRequests_7_0>=1)))))] = FALSE
(forward)formula 30,1,0.327745,12616,1,0,36,43027,44,0,1516,26366,95
Formula is TRUE !

***************************************

original formula: AG(EF(((IdleTechs_1>=1)&&(OpenRequests_7_1>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((IdleTechs_1>=1)&&(OpenRequests_7_1>=1)))))] = FALSE
(forward)formula 31,1,0.329292,12616,1,0,37,43031,45,0,1517,26366,98
Formula is TRUE !

***************************************

original formula: AG(EF((Clients_0>=1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (Clients_0>=1))))] = FALSE
(forward)formula 32,1,0.352153,12880,1,0,38,46646,46,0,1517,29480,101
Formula is TRUE !

***************************************

original formula: AG(EF((Clients_1>=1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (Clients_1>=1))))] = FALSE
(forward)formula 33,1,0.374836,13408,1,0,39,50198,47,0,1517,32436,104
Formula is TRUE !

***************************************

original formula: AG(EF((Clients_2>=1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (Clients_2>=1))))] = FALSE
(forward)formula 34,1,0.404457,13936,1,0,40,53259,48,0,1517,34468,107
Formula is TRUE !

***************************************

original formula: AG(EF((Clients_3>=1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (Clients_3>=1))))] = FALSE
(forward)formula 35,1,0.412092,14464,1,0,41,54405,49,0,1517,35167,110
Formula is TRUE !

***************************************

original formula: AG(EF((Clients_4>=1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (Clients_4>=1))))] = FALSE
(forward)formula 36,1,0.414518,14464,1,0,42,54614,50,0,1517,35322,113
Formula is TRUE !

***************************************

original formula: AG(EF((Clients_5>=1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (Clients_5>=1))))] = FALSE
(forward)formula 37,1,0.416168,14464,1,0,43,54712,51,0,1517,35399,116
Formula is TRUE !

***************************************

original formula: AG(EF((Clients_6>=1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (Clients_6>=1))))] = FALSE
(forward)formula 38,1,0.41724,14728,1,0,44,54730,52,0,1517,35415,119
Formula is TRUE !

***************************************

original formula: AG(EF((Clients_7>=1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (Clients_7>=1))))] = FALSE
(forward)formula 39,1,0.418028,14728,1,0,45,54735,53,0,1517,35419,122
Formula is TRUE !

***************************************

original formula: AG(EF(((Assigned_0_0>=1)&&(ClientsTimeout_0>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((Assigned_0_0>=1)&&(ClientsTimeout_0>=1)))))] = FALSE
(forward)formula 40,1,0.422983,14728,1,0,46,55355,54,0,1518,35825,125
Formula is TRUE !

***************************************

original formula: AG(EF(((Assigned_0_0>=1)&&(ClientsWaiting_0>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((Assigned_0_0>=1)&&(ClientsWaiting_0>=1)))))] = FALSE
(forward)formula 41,1,0.435652,14992,1,0,47,57768,55,0,1519,37415,128
Formula is TRUE !

***************************************

original formula: AG(EF(((Assigned_0_1>=1)&&(ClientsWaiting_0>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((Assigned_0_1>=1)&&(ClientsWaiting_0>=1)))))] = FALSE
(forward)formula 42,1,0.470362,16048,1,0,48,64118,56,0,1520,42059,131
Formula is TRUE !

***************************************

original formula: AG(EF(((Assigned_0_1>=1)&&(ClientsTimeout_0>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((Assigned_0_1>=1)&&(ClientsTimeout_0>=1)))))] = FALSE
(forward)formula 43,1,0.484479,16348,1,0,49,66118,57,0,1521,43716,134
Formula is TRUE !

***************************************

original formula: AG(EF(((Assigned_1_0>=1)&&(ClientsWaiting_1>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((Assigned_1_0>=1)&&(ClientsWaiting_1>=1)))))] = FALSE
(forward)formula 44,1,0.49728,16872,1,0,50,68348,58,0,1522,45206,137
Formula is TRUE !

***************************************

original formula: AG(EF(((Assigned_1_0>=1)&&(ClientsTimeout_1>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((Assigned_1_0>=1)&&(ClientsTimeout_1>=1)))))] = FALSE
(forward)formula 45,1,0.502382,17136,1,0,51,68965,59,0,1523,45612,140
Formula is TRUE !

***************************************

original formula: AG(EF(((Assigned_1_1>=1)&&(ClientsWaiting_1>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((Assigned_1_1>=1)&&(ClientsWaiting_1>=1)))))] = FALSE
(forward)formula 46,1,0.539045,17928,1,0,52,75039,60,0,1524,49997,143
Formula is TRUE !

***************************************

original formula: AG(EF(((Assigned_1_1>=1)&&(ClientsTimeout_1>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((Assigned_1_1>=1)&&(ClientsTimeout_1>=1)))))] = FALSE
(forward)formula 47,1,0.574408,18456,1,0,53,77015,61,0,1525,51622,146
Formula is TRUE !

***************************************

original formula: AG(EF(((Assigned_2_0>=1)&&(ClientsWaiting_2>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((Assigned_2_0>=1)&&(ClientsWaiting_2>=1)))))] = FALSE
(forward)formula 48,1,0.596077,18720,1,0,54,78775,62,0,1526,52567,149
Formula is TRUE !

***************************************

original formula: AG(EF(((Assigned_2_0>=1)&&(ClientsTimeout_2>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((Assigned_2_0>=1)&&(ClientsTimeout_2>=1)))))] = FALSE
(forward)formula 49,1,0.600123,18984,1,0,55,79325,63,0,1527,52850,152
Formula is TRUE !

***************************************

original formula: AG(EF(((Assigned_2_1>=1)&&(ClientsTimeout_2>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((Assigned_2_1>=1)&&(ClientsTimeout_2>=1)))))] = FALSE
(forward)formula 50,1,0.609835,18984,1,0,56,80979,64,0,1528,53932,155
Formula is TRUE !

***************************************

original formula: AG(EF(((Assigned_2_1>=1)&&(ClientsWaiting_2>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((Assigned_2_1>=1)&&(ClientsWaiting_2>=1)))))] = FALSE
(forward)formula 51,1,0.634115,19512,1,0,57,85966,65,0,1529,56854,158
Formula is TRUE !

***************************************

original formula: AG(EF(((Assigned_3_0>=1)&&(ClientsTimeout_3>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((Assigned_3_0>=1)&&(ClientsTimeout_3>=1)))))] = FALSE
(forward)formula 52,1,0.63701,19776,1,0,58,86235,66,0,1530,56936,161
Formula is TRUE !

***************************************

original formula: AG(EF(((Assigned_3_0>=1)&&(ClientsWaiting_3>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((Assigned_3_0>=1)&&(ClientsWaiting_3>=1)))))] = FALSE
(forward)formula 53,1,0.641158,20040,1,0,59,86765,67,0,1531,57157,164
Formula is TRUE !

***************************************

original formula: AG(EF(((Assigned_3_1>=1)&&(ClientsTimeout_3>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((Assigned_3_1>=1)&&(ClientsTimeout_3>=1)))))] = FALSE
(forward)formula 54,1,0.64569,20040,1,0,60,87290,68,0,1532,57420,167
Formula is TRUE !

***************************************

original formula: AG(EF(((Assigned_3_1>=1)&&(ClientsWaiting_3>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((Assigned_3_1>=1)&&(ClientsWaiting_3>=1)))))] = FALSE
(forward)formula 55,1,0.654838,20040,1,0,61,88827,69,0,1533,58221,170
Formula is TRUE !

***************************************

original formula: AG(EF(((Assigned_4_0>=1)&&(ClientsTimeout_4>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((Assigned_4_0>=1)&&(ClientsTimeout_4>=1)))))] = FALSE
(forward)formula 56,1,0.65741,20304,1,0,62,88957,70,0,1534,58254,173
Formula is TRUE !

***************************************

original formula: AG(EF(((Assigned_4_0>=1)&&(ClientsWaiting_4>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((Assigned_4_0>=1)&&(ClientsWaiting_4>=1)))))] = FALSE
(forward)formula 57,1,0.659164,20304,1,0,63,89040,71,0,1535,58256,176
Formula is TRUE !

***************************************

original formula: AG(EF(((Assigned_4_1>=1)&&(ClientsWaiting_4>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((Assigned_4_1>=1)&&(ClientsWaiting_4>=1)))))] = FALSE
(forward)formula 58,1,0.661332,20304,1,0,64,89159,72,0,1536,58277,179
Formula is TRUE !

***************************************

original formula: AG(EF(((Assigned_4_1>=1)&&(ClientsTimeout_4>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((Assigned_4_1>=1)&&(ClientsTimeout_4>=1)))))] = FALSE
(forward)formula 59,1,0.662994,20304,1,0,65,89252,73,0,1537,58293,182
Formula is TRUE !

***************************************

original formula: AG(EF(((Assigned_5_0>=1)&&(ClientsWaiting_5>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((Assigned_5_0>=1)&&(ClientsWaiting_5>=1)))))] = FALSE
(forward)formula 60,1,0.665066,20304,1,0,66,89347,74,0,1538,58310,185
Formula is TRUE !

***************************************

original formula: AG(EF(((Assigned_5_0>=1)&&(ClientsTimeout_5>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((Assigned_5_0>=1)&&(ClientsTimeout_5>=1)))))] = FALSE
(forward)formula 61,1,0.66649,20304,1,0,67,89415,75,0,1539,58328,188
Formula is TRUE !

***************************************

original formula: AG(EF(((Assigned_5_1>=1)&&(ClientsWaiting_5>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((Assigned_5_1>=1)&&(ClientsWaiting_5>=1)))))] = FALSE
(forward)formula 62,1,0.668549,20304,1,0,68,89509,76,0,1540,58349,191
Formula is TRUE !

***************************************

original formula: AG(EF(((Assigned_5_1>=1)&&(ClientsTimeout_5>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((Assigned_5_1>=1)&&(ClientsTimeout_5>=1)))))] = FALSE
(forward)formula 63,1,0.670468,20304,1,0,69,89577,77,0,1541,58365,194
Formula is TRUE !

***************************************

original formula: AG(EF(((Assigned_6_0>=1)&&(ClientsWaiting_6>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((Assigned_6_0>=1)&&(ClientsWaiting_6>=1)))))] = FALSE
(forward)formula 64,1,0.672569,20568,1,0,70,89673,78,0,1542,58406,197
Formula is TRUE !

***************************************

original formula: AG(EF(((Assigned_6_0>=1)&&(ClientsTimeout_6>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((Assigned_6_0>=1)&&(ClientsTimeout_6>=1)))))] = FALSE
(forward)formula 65,1,0.674285,20568,1,0,71,89702,79,0,1543,58436,200
Formula is TRUE !

***************************************

original formula: AG(EF(((Assigned_6_1>=1)&&(ClientsTimeout_6>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((Assigned_6_1>=1)&&(ClientsTimeout_6>=1)))))] = FALSE
(forward)formula 66,1,0.676485,20568,1,0,72,89815,80,0,1544,58507,203
Formula is TRUE !

***************************************

original formula: AG(EF(((Assigned_6_1>=1)&&(ClientsWaiting_6>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((Assigned_6_1>=1)&&(ClientsWaiting_6>=1)))))] = FALSE
(forward)formula 67,1,0.677757,20568,1,0,73,89826,81,0,1545,58509,206
Formula is TRUE !

***************************************

original formula: AG(EF(((Assigned_7_0>=1)&&(ClientsTimeout_7>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((Assigned_7_0>=1)&&(ClientsTimeout_7>=1)))))] = FALSE
(forward)formula 68,1,0.67954,20568,1,0,74,89883,82,0,1546,58539,209
Formula is TRUE !

***************************************

original formula: AG(EF(((Assigned_7_0>=1)&&(ClientsWaiting_7>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((Assigned_7_0>=1)&&(ClientsWaiting_7>=1)))))] = FALSE
(forward)formula 69,1,0.681167,20568,1,0,75,89886,83,0,1547,58540,212
Formula is TRUE !

***************************************

original formula: AG(EF(((Assigned_7_1>=1)&&(ClientsTimeout_7>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((Assigned_7_1>=1)&&(ClientsTimeout_7>=1)))))] = FALSE
(forward)formula 70,1,0.68318,20568,1,0,76,89941,84,0,1548,58567,215
Formula is TRUE !

***************************************

original formula: AG(EF(((Assigned_7_1>=1)&&(ClientsWaiting_7>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((Assigned_7_1>=1)&&(ClientsWaiting_7>=1)))))] = FALSE
(forward)formula 71,1,0.685235,20568,1,0,77,89943,85,0,1549,58568,218
Formula is TRUE !

***************************************

Able to resolve query Liveness after proving 72 properties.
FORMULA Liveness TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Total runtime 6804 ms.

BK_STOP 1653144639874

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ Liveness = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution Liveness -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination Liveness -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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="UtilityControlRoom-PT-Z2T4N08"
export BK_EXAMINATION="Liveness"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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-4028"
echo " Executing tool itstools"
echo " Input is UtilityControlRoom-PT-Z2T4N08, examination is Liveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r283-smll-165307355900129"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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