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-165307356000154.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-Z4T4N02, examination is Liveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r283-smll-165307356000154
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 420K
-rw-r--r-- 1 mcc users 19K Apr 29 18:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 130K Apr 29 18:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 15K Apr 29 18:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 75K Apr 29 18:06 CTLFireability.xml
-rw-r--r-- 1 mcc users 7.2K May 9 09:20 LTLCardinality.txt
-rw-r--r-- 1 mcc users 35K May 9 09:20 LTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K May 9 09:21 LTLFireability.txt
-rw-r--r-- 1 mcc users 30K May 9 09:21 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.3K May 9 09:21 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.7K May 9 09:21 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 65K 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 1653145185348

Running Version 202205111006
[2022-05-21 14:59:47] [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:59:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-21 14:59:48] [INFO ] Load time of PNML (sax parser for PT used): 150 ms
[2022-05-21 14:59:48] [INFO ] Transformed 80 places.
[2022-05-21 14:59:48] [INFO ] Transformed 150 transitions.
[2022-05-21 14:59:48] [INFO ] Parsed PT model containing 80 places and 150 transitions in 381 ms.
Discarding 48 transitions out of 150. Remains 102
Ensure Unique test removed 32 transitions
Reduce redundant transitions removed 32 transitions.
Built sparse matrix representations for Structural reductions in 10 ms.8558KB memory used
Starting structural reductions in DEADLOCKS mode, iteration 0 : 80/80 places, 118/118 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 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 80 transition count 110
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 8 rules in 35 ms. Remains 80 /80 variables (removed 0) and now considering 110/118 (removed 8) transitions.
Finished structural reductions, in 1 iterations. Remains : 80/80 places, 110/118 transitions.
Random walk for 1250000 steps, including 0 resets, run took 1676 ms (no deadlock found). (steps per millisecond=745 )
Random directed walk for 1250000 steps, including 0 resets, run took 1169 ms (no deadlock found). (steps per millisecond=1069 )
// Phase 1: matrix 110 rows 80 cols
[2022-05-21 14:59:51] [INFO ] Computed 7 place invariants in 16 ms
[2022-05-21 14:59:51] [INFO ] [Real]Absence check using 7 positive place invariants in 11 ms returned unsat
Starting structural reductions in LIVENESS mode, iteration 0 : 80/80 places, 150/150 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 80 transition count 86
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 40 rules applied. Total rules applied 104 place count 48 transition count 78
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 104 place count 48 transition count 70
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 120 place count 40 transition count 70
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 128 place count 36 transition count 66
Applied a total of 128 rules in 20 ms. Remains 36 /80 variables (removed 44) and now considering 66/150 (removed 84) transitions.
// Phase 1: matrix 66 rows 36 cols
[2022-05-21 14:59:51] [INFO ] Computed 7 place invariants in 2 ms
[2022-05-21 14:59:51] [INFO ] Implicit Places using invariants in 141 ms returned [22, 23]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 144 ms to find 2 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 34/80 places, 66/150 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 26 transition count 58
Applied a total of 16 rules in 5 ms. Remains 26 /34 variables (removed 8) and now considering 58/66 (removed 8) transitions.
// Phase 1: matrix 58 rows 26 cols
[2022-05-21 14:59:51] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-21 14:59:51] [INFO ] Implicit Places using invariants in 85 ms returned []
// Phase 1: matrix 58 rows 26 cols
[2022-05-21 14:59:51] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-21 14:59:52] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 198 ms to find 0 implicit places.
Starting structural reductions in LIVENESS mode, iteration 2 : 26/80 places, 58/150 transitions.
Finished structural reductions, in 2 iterations. Remains : 26/80 places, 58/150 transitions.
Discarding 8 transitions out of 58. Remains 50
Initial state reduction rules removed 2 formulas.
Finished random walk after 147 steps, including 0 resets, run visited all 48 properties in 55 ms. (steps per millisecond=2 )
Able to resolve query QuasiLiveness after proving 50 properties.
Starting structural reductions in LIVENESS mode, iteration 0 : 80/80 places, 150/150 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 80 transition count 86
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 40 rules applied. Total rules applied 104 place count 48 transition count 78
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 104 place count 48 transition count 70
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 120 place count 40 transition count 70
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 128 place count 36 transition count 66
Applied a total of 128 rules in 14 ms. Remains 36 /80 variables (removed 44) and now considering 66/150 (removed 84) transitions.
// Phase 1: matrix 66 rows 36 cols
[2022-05-21 14:59:52] [INFO ] Computed 7 place invariants in 6 ms
[2022-05-21 14:59:52] [INFO ] Implicit Places using invariants in 150 ms returned [22, 23]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 152 ms to find 2 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 34/80 places, 66/150 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 26 transition count 58
Applied a total of 16 rules in 7 ms. Remains 26 /34 variables (removed 8) and now considering 58/66 (removed 8) transitions.
// Phase 1: matrix 58 rows 26 cols
[2022-05-21 14:59:52] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-21 14:59:52] [INFO ] Implicit Places using invariants in 77 ms returned []
// Phase 1: matrix 58 rows 26 cols
[2022-05-21 14:59:52] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-21 14:59:52] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 204 ms to find 0 implicit places.
Starting structural reductions in LIVENESS mode, iteration 2 : 26/80 places, 58/150 transitions.
Finished structural reductions, in 2 iterations. Remains : 26/80 places, 58/150 transitions.
Discarding 8 transitions out of 58. Remains 50
[2022-05-21 14:59:52] [INFO ] Flatten gal took : 66 ms
[2022-05-21 14:59:52] [INFO ] Flatten gal took : 25 ms
[2022-05-21 14:59:52] [INFO ] Time to serialize gal into /tmp/CTLFireability16141271255305640116.gal : 13 ms
[2022-05-21 14:59:52] [INFO ] Time to serialize properties into /tmp/CTLFireability17419356346244266524.ctl : 5 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/CTLFireability16141271255305640116.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17419356346244266524.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...276
No direction supplied, using forward translation only.
Parsed 50 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,6355,0.046986,4892,2,220,5,1941,6,0,165,1537,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.094042,5916,1,0,6,5677,14,0,791,3539,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.098331,6180,1,0,7,5847,15,0,792,3646,8
Formula is TRUE !

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

original formula: AG(EF(((IdleTechs_0>=1)&&(OpenRequests_0_2>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((IdleTechs_0>=1)&&(OpenRequests_0_2>=1)))))] = FALSE
(forward)formula 2,1,0.104696,6180,1,0,8,6319,16,0,793,3988,11
Formula is TRUE !

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

original formula: AG(EF(((IdleTechs_0>=1)&&(OpenRequests_0_3>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((IdleTechs_0>=1)&&(OpenRequests_0_3>=1)))))] = FALSE
(forward)formula 3,1,0.110735,6444,1,0,9,6626,17,0,794,4180,14
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 4,1,0.123114,6708,1,0,10,7769,18,0,795,5140,17
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 5,1,0.135863,6708,1,0,11,8505,19,0,796,5682,20
Formula is TRUE !

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

original formula: AG(EF(((IdleTechs_0>=1)&&(OpenRequests_1_2>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((IdleTechs_0>=1)&&(OpenRequests_1_2>=1)))))] = FALSE
(forward)formula 6,1,0.139776,6972,1,0,12,8585,20,0,797,5763,23
Formula is TRUE !

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

original formula: AG(EF(((IdleTechs_0>=1)&&(OpenRequests_1_3>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((IdleTechs_0>=1)&&(OpenRequests_1_3>=1)))))] = FALSE
(forward)formula 7,1,0.141863,6972,1,0,13,8587,21,0,798,5764,26
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 8,1,0.146014,6972,1,0,14,8743,22,0,799,5859,29
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 9,1,0.149005,6972,1,0,15,8851,23,0,800,5905,32
Formula is TRUE !

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

original formula: AG(EF(((IdleTechs_1>=1)&&(OpenRequests_0_2>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((IdleTechs_1>=1)&&(OpenRequests_0_2>=1)))))] = FALSE
(forward)formula 10,1,0.155562,6972,1,0,16,9308,24,0,801,6259,35
Formula is TRUE !

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

original formula: AG(EF(((IdleTechs_1>=1)&&(OpenRequests_0_3>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((IdleTechs_1>=1)&&(OpenRequests_0_3>=1)))))] = FALSE
(forward)formula 11,1,0.160124,6972,1,0,17,9552,25,0,802,6432,38
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 12,1,0.166678,6972,1,0,18,9785,26,0,803,6619,41
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 13,1,0.170573,7236,1,0,19,9949,27,0,804,6748,44
Formula is TRUE !

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

original formula: AG(EF(((IdleTechs_1>=1)&&(OpenRequests_1_2>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((IdleTechs_1>=1)&&(OpenRequests_1_2>=1)))))] = FALSE
(forward)formula 14,1,0.172766,7236,1,0,20,9969,28,0,805,6773,47
Formula is TRUE !

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

original formula: AG(EF(((IdleTechs_1>=1)&&(OpenRequests_1_3>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((IdleTechs_1>=1)&&(OpenRequests_1_3>=1)))))] = FALSE
(forward)formula 15,1,0.174227,7236,1,0,21,9969,29,0,806,6773,50
Formula is TRUE !

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

original formula: AG(EF(((IdleTechs_2>=1)&&(OpenRequests_0_0>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((IdleTechs_2>=1)&&(OpenRequests_0_0>=1)))))] = FALSE
(forward)formula 16,1,0.179873,7236,1,0,22,10296,30,0,807,7022,53
Formula is TRUE !

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

original formula: AG(EF(((IdleTechs_2>=1)&&(OpenRequests_0_1>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((IdleTechs_2>=1)&&(OpenRequests_0_1>=1)))))] = FALSE
(forward)formula 17,1,0.184025,7236,1,0,23,10493,31,0,808,7166,56
Formula is TRUE !

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

original formula: AG(EF(((IdleTechs_2>=1)&&(OpenRequests_0_2>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((IdleTechs_2>=1)&&(OpenRequests_0_2>=1)))))] = FALSE
(forward)formula 18,1,0.18854,7236,1,0,24,10752,32,0,809,7385,59
Formula is TRUE !

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

original formula: AG(EF(((IdleTechs_2>=1)&&(OpenRequests_0_3>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((IdleTechs_2>=1)&&(OpenRequests_0_3>=1)))))] = FALSE
(forward)formula 19,1,0.192812,7500,1,0,25,10938,33,0,810,7542,62
Formula is TRUE !

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

original formula: AG(EF(((IdleTechs_2>=1)&&(OpenRequests_1_0>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((IdleTechs_2>=1)&&(OpenRequests_1_0>=1)))))] = FALSE
(forward)formula 20,1,0.196948,7764,1,0,26,11037,34,0,811,7638,65
Formula is TRUE !

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

original formula: AG(EF(((IdleTechs_2>=1)&&(OpenRequests_1_1>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((IdleTechs_2>=1)&&(OpenRequests_1_1>=1)))))] = FALSE
(forward)formula 21,1,0.199531,7764,1,0,27,11093,35,0,812,7678,68
Formula is TRUE !

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

original formula: AG(EF(((IdleTechs_2>=1)&&(OpenRequests_1_2>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((IdleTechs_2>=1)&&(OpenRequests_1_2>=1)))))] = FALSE
(forward)formula 22,1,0.201376,7764,1,0,28,11099,36,0,813,7689,71
Formula is TRUE !

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

original formula: AG(EF(((IdleTechs_2>=1)&&(OpenRequests_1_3>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((IdleTechs_2>=1)&&(OpenRequests_1_3>=1)))))] = FALSE
(forward)formula 23,1,0.202892,7764,1,0,29,11099,37,0,814,7689,74
Formula is TRUE !

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

original formula: AG(EF(((IdleTechs_3>=1)&&(OpenRequests_0_0>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((IdleTechs_3>=1)&&(OpenRequests_0_0>=1)))))] = FALSE
(forward)formula 24,1,0.206901,7764,1,0,30,11284,38,0,815,7799,77
Formula is TRUE !

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

original formula: AG(EF(((IdleTechs_3>=1)&&(OpenRequests_0_1>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((IdleTechs_3>=1)&&(OpenRequests_0_1>=1)))))] = FALSE
(forward)formula 25,1,0.209354,7764,1,0,31,11340,39,0,816,7837,80
Formula is TRUE !

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

original formula: AG(EF(((IdleTechs_3>=1)&&(OpenRequests_0_2>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((IdleTechs_3>=1)&&(OpenRequests_0_2>=1)))))] = FALSE
(forward)formula 26,1,0.211817,7764,1,0,32,11398,40,0,817,7873,83
Formula is TRUE !

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

original formula: AG(EF(((IdleTechs_3>=1)&&(OpenRequests_0_3>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((IdleTechs_3>=1)&&(OpenRequests_0_3>=1)))))] = FALSE
(forward)formula 27,1,0.214823,7764,1,0,33,11482,41,0,818,7937,86
Formula is TRUE !

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

original formula: AG(EF(((IdleTechs_3>=1)&&(OpenRequests_1_0>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((IdleTechs_3>=1)&&(OpenRequests_1_0>=1)))))] = FALSE
(forward)formula 28,1,0.217581,7764,1,0,34,11609,42,0,819,8000,89
Formula is TRUE !

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

original formula: AG(EF(((IdleTechs_3>=1)&&(OpenRequests_1_1>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((IdleTechs_3>=1)&&(OpenRequests_1_1>=1)))))] = FALSE
(forward)formula 29,1,0.220202,7764,1,0,35,11679,43,0,820,8037,92
Formula is TRUE !

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

original formula: AG(EF(((IdleTechs_3>=1)&&(OpenRequests_1_2>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((IdleTechs_3>=1)&&(OpenRequests_1_2>=1)))))] = FALSE
(forward)formula 30,1,0.221853,7764,1,0,36,11681,44,0,821,8039,95
Formula is TRUE !

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

original formula: AG(EF(((IdleTechs_3>=1)&&(OpenRequests_1_3>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((IdleTechs_3>=1)&&(OpenRequests_1_3>=1)))))] = FALSE
(forward)formula 31,1,0.223206,7764,1,0,37,11681,45,0,822,8039,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.224394,7764,1,0,38,11688,46,0,822,8044,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.225205,7764,1,0,39,11688,47,0,822,8044,104
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 34,1,0.228985,7764,1,0,40,11852,48,0,823,8116,107
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 35,1,0.231934,7764,1,0,41,11941,49,0,824,8124,110
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 36,1,0.239311,8028,1,0,42,12266,50,0,825,8391,113
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 37,1,0.242231,8028,1,0,43,12357,51,0,826,8403,116
Formula is TRUE !

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

original formula: AG(EF(((Assigned_0_2>=1)&&(ClientsWaiting_0>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((Assigned_0_2>=1)&&(ClientsWaiting_0>=1)))))] = FALSE
(forward)formula 38,1,0.252503,8028,1,0,44,13079,52,0,827,9022,119
Formula is TRUE !

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

original formula: AG(EF(((Assigned_0_2>=1)&&(ClientsTimeout_0>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((Assigned_0_2>=1)&&(ClientsTimeout_0>=1)))))] = FALSE
(forward)formula 39,1,0.259247,8028,1,0,45,13137,53,0,828,9046,122
Formula is TRUE !

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

original formula: AG(EF(((Assigned_0_3>=1)&&(ClientsWaiting_0>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((Assigned_0_3>=1)&&(ClientsWaiting_0>=1)))))] = FALSE
(forward)formula 40,1,0.273975,8292,1,0,46,13533,54,0,829,9373,125
Formula is TRUE !

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

original formula: AG(EF(((Assigned_0_3>=1)&&(ClientsTimeout_0>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((Assigned_0_3>=1)&&(ClientsTimeout_0>=1)))))] = FALSE
(forward)formula 41,1,0.276181,8292,1,0,47,13581,55,0,830,9382,128
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 42,1,0.281421,8292,1,0,48,14123,56,0,831,9733,131
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 43,1,0.282924,8292,1,0,49,14130,57,0,832,9734,134
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 44,1,0.288378,8292,1,0,50,14672,58,0,833,10085,137
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 45,1,0.289839,8292,1,0,51,14678,59,0,834,10086,140
Formula is TRUE !

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

original formula: AG(EF(((Assigned_1_2>=1)&&(ClientsTimeout_1>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((Assigned_1_2>=1)&&(ClientsTimeout_1>=1)))))] = FALSE
(forward)formula 46,1,0.291406,8292,1,0,52,14693,60,0,835,10091,143
Formula is TRUE !

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

original formula: AG(EF(((Assigned_1_2>=1)&&(ClientsWaiting_1>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((Assigned_1_2>=1)&&(ClientsWaiting_1>=1)))))] = FALSE
(forward)formula 47,1,0.293231,8292,1,0,53,14744,61,0,836,10114,146
Formula is TRUE !

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

original formula: AG(EF(((Assigned_1_3>=1)&&(ClientsTimeout_1>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((Assigned_1_3>=1)&&(ClientsTimeout_1>=1)))))] = FALSE
(forward)formula 48,1,0.294792,8292,1,0,54,14757,62,0,837,10119,149
Formula is TRUE !

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

original formula: AG(EF(((Assigned_1_3>=1)&&(ClientsWaiting_1>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((Assigned_1_3>=1)&&(ClientsWaiting_1>=1)))))] = FALSE
(forward)formula 49,1,0.296671,8292,1,0,55,14803,63,0,838,10146,152
Formula is TRUE !

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

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

BK_STOP 1653145193394

--------------------
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-Z4T4N02"
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-Z4T4N02, 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-165307356000154"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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