fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r254-tall-162106746400714
Last Updated
Jun 28, 2021

About the Execution of ITS-Tools for SwimmingPool-PT-01

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
456.756 57686.00 41414.00 8870.60 FTFTFTTFTFTFTTTF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r254-tall-162106746400714.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is SwimmingPool-PT-01, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r254-tall-162106746400714
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 328K
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 104K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Mar 28 16:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 28 16:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 28 16:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 16:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 27 14:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 27 14:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.3K Mar 25 20:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 23K Mar 25 20:10 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 08:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 08:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:52 equiv_col
-rw-r--r-- 1 mcc users 3 May 5 16:52 instance
-rw-r--r-- 1 mcc users 6 May 5 16:52 iscolored
-rw-r--r-- 1 mcc users 3.9K May 5 16:52 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 SwimmingPool-PT-01-CTLFireability-00
FORMULA_NAME SwimmingPool-PT-01-CTLFireability-01
FORMULA_NAME SwimmingPool-PT-01-CTLFireability-02
FORMULA_NAME SwimmingPool-PT-01-CTLFireability-03
FORMULA_NAME SwimmingPool-PT-01-CTLFireability-04
FORMULA_NAME SwimmingPool-PT-01-CTLFireability-05
FORMULA_NAME SwimmingPool-PT-01-CTLFireability-06
FORMULA_NAME SwimmingPool-PT-01-CTLFireability-07
FORMULA_NAME SwimmingPool-PT-01-CTLFireability-08
FORMULA_NAME SwimmingPool-PT-01-CTLFireability-09
FORMULA_NAME SwimmingPool-PT-01-CTLFireability-10
FORMULA_NAME SwimmingPool-PT-01-CTLFireability-11
FORMULA_NAME SwimmingPool-PT-01-CTLFireability-12
FORMULA_NAME SwimmingPool-PT-01-CTLFireability-13
FORMULA_NAME SwimmingPool-PT-01-CTLFireability-14
FORMULA_NAME SwimmingPool-PT-01-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1621268164292

Running Version 0
[2021-05-17 16:16:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -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, 3600]
[2021-05-17 16:16:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 16:16:10] [INFO ] Load time of PNML (sax parser for PT used): 18 ms
[2021-05-17 16:16:10] [INFO ] Transformed 9 places.
[2021-05-17 16:16:10] [INFO ] Transformed 7 transitions.
[2021-05-17 16:16:10] [INFO ] Parsed PT model containing 9 places and 7 transitions in 55 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 12 ms.
Support contains 9 out of 9 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 7 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 16:16:11] [INFO ] Computed 3 place invariants in 3 ms
[2021-05-17 16:16:11] [INFO ] Implicit Places using invariants in 64 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 16:16:11] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-17 16:16:11] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 16:16:11] [INFO ] Computed 3 place invariants in 2 ms
[2021-05-17 16:16:11] [INFO ] Dead Transitions using invariants and state equation in 16 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 7/7 transitions.
[2021-05-17 16:16:11] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2021-05-17 16:16:11] [INFO ] Flatten gal took : 17 ms
FORMULA SwimmingPool-PT-01-CTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-17 16:16:11] [INFO ] Flatten gal took : 5 ms
[2021-05-17 16:16:11] [INFO ] Input system was already deterministic with 7 transitions.
Incomplete random walk after 100008 steps, including 2 resets, run finished after 165 ms. (steps per millisecond=606 ) properties (out of 40) seen :35
Running SMT prover for 5 properties.
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 16:16:11] [INFO ] Computed 3 place invariants in 2 ms
[2021-05-17 16:16:11] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned unsat
[2021-05-17 16:16:11] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned unsat
[2021-05-17 16:16:11] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned unsat
[2021-05-17 16:16:11] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned unsat
[2021-05-17 16:16:11] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned unsat
Successfully simplified 5 atomic propositions for a total of 15 simplifications.
Applied a total of 0 rules in 3 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
[2021-05-17 16:16:11] [INFO ] Flatten gal took : 2 ms
[2021-05-17 16:16:11] [INFO ] Flatten gal took : 2 ms
[2021-05-17 16:16:11] [INFO ] Input system was already deterministic with 7 transitions.
[2021-05-17 16:16:11] [INFO ] Flatten gal took : 1 ms
[2021-05-17 16:16:11] [INFO ] Flatten gal took : 1 ms
[2021-05-17 16:16:11] [INFO ] Time to serialize gal into /tmp/CTLFireability12793571872501012911.gal : 1 ms
[2021-05-17 16:16:11] [INFO ] Time to serialize properties into /tmp/CTLFireability668235491070324870.ctl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability12793571872501012911.gal, -t, CGAL, -ctl, /tmp/CTLFireability668235491070324870.ctl, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability12793571872501012911.gal -t CGAL -ctl /tmp/CTLFireability668235491070324870.ctl --gen-order FOLLOW
No direction supplied, using forward translation only.
Parsed 1 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,89621,0.419808,15348,2,2975,5,55084,6,0,46,62078,0


Converting to forward existential form...Done !
original formula: AG(AF((((((Undress>=1)||(Dress>=1))||((Entered>=1)&&(Cabins>=1)))||((InBath>=1)&&(Cabins>=1)))||((WaitBag>=1)&&(Bags>=1)))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!((((((Undress>=1)||(Dress>=1))||((Entered>=1)&&(Cabins>=1)))||((InBath>=1)&&(Cabins>=1)))||((WaitBag>=1)&&(Bags>=1)))))] = FALSE
Hit Full ! (commute/partial/dont) 0/12/7
(forward)formula 0,1,0.629287,15668,1,0,6,58292,20,0,357,62078,8
FORMULA SwimmingPool-PT-01-CTLFireability-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 9 transition count 6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 8 transition count 6
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 7 transition count 5
Applied a total of 4 rules in 3 ms. Remains 7 /9 variables (removed 2) and now considering 5/7 (removed 2) transitions.
[2021-05-17 16:16:12] [INFO ] Flatten gal took : 1 ms
[2021-05-17 16:16:12] [INFO ] Flatten gal took : 1 ms
[2021-05-17 16:16:12] [INFO ] Input system was already deterministic with 5 transitions.
[2021-05-17 16:16:12] [INFO ] Flatten gal took : 1 ms
[2021-05-17 16:16:12] [INFO ] Flatten gal took : 1 ms
[2021-05-17 16:16:12] [INFO ] Time to serialize gal into /tmp/CTLFireability2611781562646988263.gal : 1 ms
[2021-05-17 16:16:12] [INFO ] Time to serialize properties into /tmp/CTLFireability4169963916464386472.ctl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability2611781562646988263.gal, -t, CGAL, -ctl, /tmp/CTLFireability4169963916464386472.ctl, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability2611781562646988263.gal -t CGAL -ctl /tmp/CTLFireability4169963916464386472.ctl --gen-order FOLLOW
No direction supplied, using forward translation only.
Parsed 1 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,3076,0.046866,5584,2,533,5,7700,6,0,36,8501,0


Converting to forward existential form...Done !
original formula: EF(AG((((Undress<1)&&(Dress<1))&&((WaitBag<1)||(Bags<1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((((Undress<1)&&(Dress<1))&&((WaitBag<1)||(Bags<1)))))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.068313,5968,1,0,6,7700,15,0,246,8501,5
FORMULA SwimmingPool-PT-01-CTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
[2021-05-17 16:16:12] [INFO ] Flatten gal took : 1 ms
[2021-05-17 16:16:12] [INFO ] Flatten gal took : 1 ms
[2021-05-17 16:16:12] [INFO ] Input system was already deterministic with 7 transitions.
[2021-05-17 16:16:12] [INFO ] Flatten gal took : 1 ms
[2021-05-17 16:16:12] [INFO ] Flatten gal took : 1 ms
[2021-05-17 16:16:12] [INFO ] Time to serialize gal into /tmp/CTLFireability4231402833351015055.gal : 0 ms
[2021-05-17 16:16:12] [INFO ] Time to serialize properties into /tmp/CTLFireability8948687599375594829.ctl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability4231402833351015055.gal, -t, CGAL, -ctl, /tmp/CTLFireability8948687599375594829.ctl, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability4231402833351015055.gal -t CGAL -ctl /tmp/CTLFireability8948687599375594829.ctl --gen-order FOLLOW
No direction supplied, using forward translation only.
Parsed 1 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,89621,0.450416,15408,2,2975,5,55084,6,0,46,62078,0


Converting to forward existential form...Done !
original formula: EF(!(AF(((((((Undress>=1)||((Entered>=1)&&(Cabins>=1)))||(Dress>=1))||(Dressed>=1))||((InBath>=1)&&(Cabins>=1)))||((WaitBag>=1)&&(Bags>=1))))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(((((((Undress>=1)||((Entered>=1)&&(Cabins>=1)))||(Dress>=1))||(Dressed>=1))||((InBath>=1)&&(Cabins>=1)))||((WaitBag>=1)&&(Bags>=1)))))] != FALSE
Hit Full ! (commute/partial/dont) 0/17/7
(forward)formula 0,0,0.660943,15792,1,0,5,55084,20,0,363,62078,8
FORMULA SwimmingPool-PT-01-CTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 9 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 8 transition count 6
Applied a total of 2 rules in 17 ms. Remains 8 /9 variables (removed 1) and now considering 6/7 (removed 1) transitions.
[2021-05-17 16:16:13] [INFO ] Flatten gal took : 4 ms
[2021-05-17 16:16:13] [INFO ] Flatten gal took : 0 ms
[2021-05-17 16:16:13] [INFO ] Input system was already deterministic with 6 transitions.
[2021-05-17 16:16:13] [INFO ] Flatten gal took : 0 ms
[2021-05-17 16:16:13] [INFO ] Flatten gal took : 0 ms
[2021-05-17 16:16:13] [INFO ] Time to serialize gal into /tmp/CTLFireability11628450375747273545.gal : 0 ms
[2021-05-17 16:16:13] [INFO ] Time to serialize properties into /tmp/CTLFireability495883155562116606.ctl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability11628450375747273545.gal, -t, CGAL, -ctl, /tmp/CTLFireability495883155562116606.ctl, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability11628450375747273545.gal -t CGAL -ctl /tmp/CTLFireability495883155562116606.ctl --gen-order FOLLOW
No direction supplied, using forward translation only.
Parsed 1 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,28085,0.037586,5400,2,674,5,6332,6,0,41,6400,0


Converting to forward existential form...Done !
original formula: EF(EG(AG(((Dressed>=1)||(Out>=1)))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(E(TRUE U !(((Dressed>=1)||(Out>=1))))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.217656,9680,1,0,6,27602,21,0,293,31812,7
FORMULA SwimmingPool-PT-01-CTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
[2021-05-17 16:16:13] [INFO ] Flatten gal took : 1 ms
[2021-05-17 16:16:13] [INFO ] Flatten gal took : 0 ms
[2021-05-17 16:16:13] [INFO ] Input system was already deterministic with 7 transitions.
Finished random walk after 232 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=116 )
FORMULA SwimmingPool-PT-01-CTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Applied a total of 0 rules in 5 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
[2021-05-17 16:16:13] [INFO ] Flatten gal took : 0 ms
[2021-05-17 16:16:13] [INFO ] Flatten gal took : 1 ms
[2021-05-17 16:16:13] [INFO ] Input system was already deterministic with 7 transitions.
[2021-05-17 16:16:13] [INFO ] Flatten gal took : 3 ms
[2021-05-17 16:16:13] [INFO ] Flatten gal took : 1 ms
[2021-05-17 16:16:13] [INFO ] Time to serialize gal into /tmp/CTLFireability17229153577649726555.gal : 30 ms
[2021-05-17 16:16:13] [INFO ] Time to serialize properties into /tmp/CTLFireability18147180883152573853.ctl : 27 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability17229153577649726555.gal, -t, CGAL, -ctl, /tmp/CTLFireability18147180883152573853.ctl, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability17229153577649726555.gal -t CGAL -ctl /tmp/CTLFireability18147180883152573853.ctl --gen-order FOLLOW
No direction supplied, using forward translation only.
Parsed 1 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,89621,0.501269,15480,2,2975,5,55084,6,0,46,62078,0


Converting to forward existential form...Done !
original formula: A(A((A(EF(((((((Entered>=1)&&(Cabins>=1))||((InBath>=1)&&(Cabins>=1)))||(Dressed>=1))||(Out>=1))||((WaitBag>=1)&&(Bags>=1)))) U (((((((((Undress>=1)||((InBath>=1)&&(Cabins>=1)))||((WaitBag>=1)&&(Bags>=1)))||((Entered>=1)&&(Cabins>=1)))||((InBath>=1)&&(Cabins>=1)))||(Dressed>=1))||((WaitBag>=1)&&(Bags>=1)))||((Entered>=1)&&(Cabins>=1)))||((InBath>=1)&&(Cabins>=1)))) + (Dress>=1)) U ((InBath<1)||(Cabins<1))) U AG((((Dress<1)&&(Dressed<1))&&((InBath<1)||(Cabins<1)))))
=> equivalent forward existential formula: [((Init * !(EG(!(!(E(TRUE U !((((Dress<1)&&(Dressed<1))&&((InBath<1)||(Cabins<1)))))))))) * !(E(!(!(E(TRUE U !((((Dress<1)&&(Dressed<1))&&((InBath<1)||(Cabins<1))))))) U (!(!((E(!(((InBath<1)||(Cabins<1))) U (!((!((E(!((((((((((Undress>=1)||((InBath>=1)&&(Cabins>=1)))||((WaitBag>=1)&&(Bags>=1)))||((Entered>=1)&&(Cabins>=1)))||((InBath>=1)&&(Cabins>=1)))||(Dressed>=1))||((WaitBag>=1)&&(Bags>=1)))||((Entered>=1)&&(Cabins>=1)))||((InBath>=1)&&(Cabins>=1)))) U (!(E(TRUE U ((((((Entered>=1)&&(Cabins>=1))||((InBath>=1)&&(Cabins>=1)))||(Dressed>=1))||(Out>=1))||((WaitBag>=1)&&(Bags>=1))))) * !((((((((((Undress>=1)||((InBath>=1)&&(Cabins>=1)))||((WaitBag>=1)&&(Bags>=1)))||((Entered>=1)&&(Cabins>=1)))||((InBath>=1)&&(Cabins>=1)))||(Dressed>=1))||((WaitBag>=1)&&(Bags>=1)))||((Entered>=1)&&(Cabins>=1)))||((InBath>=1)&&(Cabins>=1)))))) + EG(!((((((((((Undress>=1)||((InBath>=1)&&(Cabins>=1)))||((WaitBag>=1)&&(Bags>=1)))||((Entered>=1)&&(Cabins>=1)))||((InBath>=1)&&(Cabins>=1)))||(Dressed>=1))||((WaitBag>=1)&&(Bags>=1)))||((Entered>=1)&&(Cabins>=1)))||((InBath>=1)&&(Cabins>=1))))))) + (Dress>=1))) * !(((InBath<1)||(Cabins<1))))) + EG(!(((InBath<1)||(Cabins<1))))))) * !(!(E(TRUE U !((((Dress<1)&&(Dressed<1))&&((InBath<1)||(Cabins<1)))))))))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,1.02415,21140,1,0,12,83118,35,4,353,99670,18
FORMULA SwimmingPool-PT-01-CTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

[2021-05-17 16:16:14] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2021-05-17 16:16:14] [INFO ] Flatten gal took : 3 ms
FORMULA SwimmingPool-PT-01-CTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SwimmingPool-PT-01-CTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-17 16:16:14] [INFO ] Flatten gal took : 1 ms
[2021-05-17 16:16:14] [INFO ] Applying decomposition
[2021-05-17 16:16:14] [INFO ] Flatten gal took : 2 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph3776628242730639715.txt, -o, /tmp/graph3776628242730639715.bin, -w, /tmp/graph3776628242730639715.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph3776628242730639715.bin, -l, -1, -v, -w, /tmp/graph3776628242730639715.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 16:16:19] [INFO ] Decomposing Gal with order
[2021-05-17 16:16:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 16:16:19] [INFO ] Flatten gal took : 33 ms
[2021-05-17 16:16:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-17 16:16:19] [INFO ] Time to serialize gal into /tmp/CTLFireability16706691445199935305.gal : 0 ms
[2021-05-17 16:16:19] [INFO ] Time to serialize properties into /tmp/CTLFireability9679468848650506078.ctl : 2 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability16706691445199935305.gal, -t, CGAL, -ctl, /tmp/CTLFireability9679468848650506078.ctl], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability16706691445199935305.gal -t CGAL -ctl /tmp/CTLFireability9679468848650506078.ctl
No direction supplied, using forward translation only.
Parsed 7 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,89621,1.51344,24716,1700,1069,34085,1688,33,77787,17,80779,0


Converting to forward existential form...Done !
original formula: AX(E(((!(EX(((((u1.Dress>=1)||(u1.Dressed>=1))||((u0.InBath>=1)&&(u1.Cabins>=1)))||((u2.WaitBag>=1)&&(u0.Bags>=1))))) + (((((u0.Undress<1)&&(u1.Dress<1))&&(u1.Dressed<1))&&(u2.Out<1))&&((u2.Entered<1)||(u1.Cabins<1)))) + (((((((u0.Undress<1)&&(u1.Dress<1))&&(u1.Dressed<1))&&(u2.Out<1))&&((u2.Entered<1)||(u1.Cabins<1)))&&((u0.InBath<1)||(u1.Cabins<1)))&&((u2.WaitBag<1)||(u0.Bags<1)))) U EG(EX(AG((((((u1.Dressed>=1)||(u2.Out>=1))||((u2.Entered>=1)&&(u1.Cabins>=1)))||((u0.InBath>=1)&&(u1.Cabins>=1)))||((u2.WaitBag>=1)&&(u0.Bags>=1))))))))
=> equivalent forward existential formula: [(EY(Init) * !(E(((!(EX(((((u1.Dress>=1)||(u1.Dressed>=1))||((u0.InBath>=1)&&(u1.Cabins>=1)))||((u2.WaitBag>=1)&&(u0.Bags>=1))))) + (((((u0.Undress<1)&&(u1.Dress<1))&&(u1.Dressed<1))&&(u2.Out<1))&&((u2.Entered<1)||(u1.Cabins<1)))) + (((((((u0.Undress<1)&&(u1.Dress<1))&&(u1.Dressed<1))&&(u2.Out<1))&&((u2.Entered<1)||(u1.Cabins<1)))&&((u0.InBath<1)||(u1.Cabins<1)))&&((u2.WaitBag<1)||(u0.Bags<1)))) U EG(EX(!(E(TRUE U !((((((u1.Dressed>=1)||(u2.Out>=1))||((u2.Entered>=1)&&(u1.Cabins>=1)))||((u0.InBath>=1)&&(u1.Cabins>=1)))||((u2.WaitBag>=1)&&(u0.Bags>=1)))))))))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,14.3188,105884,1,0,69482,22984,178,199098,147,207843,59382
FORMULA SwimmingPool-PT-01-CTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AF(((EX(EF(AG((u0.Undress>=1)))) + EG(AX(EX((((u1.Dress>=1)||((u0.InBath>=1)&&(u1.Cabins>=1)))||(u1.Dressed>=1)))))) + ((A(!(EF(((((u2.Entered>=1)&&(u1.Cabins>=1))||((u0.InBath>=1)&&(u1.Cabins>=1)))||((u2.WaitBag>=1)&&(u0.Bags>=1))))) U (((((((((u0.Undress>=1)||(u2.Out>=1))||((u2.WaitBag>=1)&&(u0.Bags>=1)))&&(((u0.Undress>=1)||((u0.InBath>=1)&&(u1.Cabins>=1)))||((u2.WaitBag>=1)&&(u0.Bags>=1))))&&(u1.Dress<1))&&((u0.InBath<1)||(u1.Cabins<1)))&&(u1.Dressed<1))&&(u2.Out<1))&&((u2.WaitBag<1)||(u0.Bags<1)))) * !(E(EG(((u0.Undress>=1)||(u2.Out>=1))) U (u1.Dressed>=1)))) * ((u0.Undress>=1)||(u1.Dressed>=1)))))
=> equivalent forward existential formula: [FwdG(Init,!(((EX(E(TRUE U !(E(TRUE U !((u0.Undress>=1)))))) + EG(!(EX(!(EX((((u1.Dress>=1)||((u0.InBath>=1)&&(u1.Cabins>=1)))||(u1.Dressed>=1)))))))) + ((!((E(!((((((((((u0.Undress>=1)||(u2.Out>=1))||((u2.WaitBag>=1)&&(u0.Bags>=1)))&&(((u0.Undress>=1)||((u0.InBath>=1)&&(u1.Cabins>=1)))||((u2.WaitBag>=1)&&(u0.Bags>=1))))&&(u1.Dress<1))&&((u0.InBath<1)||(u1.Cabins<1)))&&(u1.Dressed<1))&&(u2.Out<1))&&((u2.WaitBag<1)||(u0.Bags<1)))) U (!(!(E(TRUE U ((((u2.Entered>=1)&&(u1.Cabins>=1))||((u0.InBath>=1)&&(u1.Cabins>=1)))||((u2.WaitBag>=1)&&(u0.Bags>=1)))))) * !((((((((((u0.Undress>=1)||(u2.Out>=1))||((u2.WaitBag>=1)&&(u0.Bags>=1)))&&(((u0.Undress>=1)||((u0.InBath>=1)&&(u1.Cabins>=1)))||((u2.WaitBag>=1)&&(u0.Bags>=1))))&&(u1.Dress<1))&&((u0.InBath<1)||(u1.Cabins<1)))&&(u1.Dressed<1))&&(u2.Out<1))&&((u2.WaitBag<1)||(u0.Bags<1)))))) + EG(!((((((((((u0.Undress>=1)||(u2.Out>=1))||((u2.WaitBag>=1)&&(u0.Bags>=1)))&&(((u0.Undress>=1)||((u0.InBath>=1)&&(u1.Cabins>=1)))||((u2.WaitBag>=1)&&(u0.Bags>=1))))&&(u1.Dress<1))&&((u0.InBath<1)||(u1.Cabins<1)))&&(u1.Dressed<1))&&(u2.Out<1))&&((u2.WaitBag<1)||(u0.Bags<1))))))) * !(E(EG(((u0.Undress>=1)||(u2.Out>=1))) U (u1.Dressed>=1)))) * ((u0.Undress>=1)||(u1.Dressed>=1))))))] = FALSE
(forward)formula 1,1,28.0036,201716,1,0,97395,31493,223,476149,149,483191,104828
FORMULA SwimmingPool-PT-01-CTLFireability-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: E(((((((u0.Undress>=1)||(u1.Dress>=1))||(u2.Out>=1))||((u2.Entered>=1)&&(u1.Cabins>=1)))||((u0.InBath>=1)&&(u1.Cabins>=1)))||((u2.WaitBag>=1)&&(u0.Bags>=1))) U AG((((((!(EX((((((u0.Undress<1)&&((u2.Entered<1)||(u1.Cabins<1)))&&((u0.InBath<1)||(u1.Cabins<1)))&&(u2.Out<1))&&((u2.WaitBag<1)||(u0.Bags<1))))) * (u1.Dress<1)) * (u1.Dressed<1)) * ((u2.Entered<1)||(u1.Cabins<1))) * ((u0.InBath<1)||(u1.Cabins<1))) * ((u2.WaitBag<1)||(u0.Bags<1)))))
=> equivalent forward existential formula: [(FwdU(Init,((((((u0.Undress>=1)||(u1.Dress>=1))||(u2.Out>=1))||((u2.Entered>=1)&&(u1.Cabins>=1)))||((u0.InBath>=1)&&(u1.Cabins>=1)))||((u2.WaitBag>=1)&&(u0.Bags>=1)))) * !(E(TRUE U !((((((!(EX((((((u0.Undress<1)&&((u2.Entered<1)||(u1.Cabins<1)))&&((u0.InBath<1)||(u1.Cabins<1)))&&(u2.Out<1))&&((u2.WaitBag<1)||(u0.Bags<1))))) * (u1.Dress<1)) * (u1.Dressed<1)) * ((u2.Entered<1)||(u1.Cabins<1))) * ((u0.InBath<1)||(u1.Cabins<1))) * ((u2.WaitBag<1)||(u0.Bags<1)))))))] != FALSE
(forward)formula 2,0,28.3557,206996,1,0,98244,31567,232,513121,149,519485,107609
FORMULA SwimmingPool-PT-01-CTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: (AG(EF(((((E(EG(((u1.Dressed>=1)||((u0.InBath>=1)&&(u1.Cabins>=1)))) U (((((u2.Entered>=1)&&(u1.Cabins>=1))||(u1.Dressed>=1))||((u2.WaitBag>=1)&&(u0.Bags>=1)))&&(((u0.Undress>=1)||(u1.Dressed>=1))||((u2.WaitBag>=1)&&(u0.Bags>=1))))) * (u0.Undress<1)) * (u1.Dressed<1)) * ((u0.InBath<1)||(u1.Cabins<1))) * (u2.Out<1)))) + (AX(AX(((u0.Undress>=1)||(u1.Dress>=1)))) * EF(((((((((u0.InBath<1)||(u1.Cabins<1))&&(u1.Dressed<1))&&((u2.Entered<1)||(u1.Cabins<1)))&&(u0.Undress<1))&&(u1.Dress<1))&&(u1.Dressed<1))&&(u2.Out<1)))))
=> equivalent forward existential formula: ([(EY(EY((Init * !(!(E(TRUE U !(E(TRUE U ((((E(EG(((u1.Dressed>=1)||((u0.InBath>=1)&&(u1.Cabins>=1)))) U (((((u2.Entered>=1)&&(u1.Cabins>=1))||(u1.Dressed>=1))||((u2.WaitBag>=1)&&(u0.Bags>=1)))&&(((u0.Undress>=1)||(u1.Dressed>=1))||((u2.WaitBag>=1)&&(u0.Bags>=1))))) * (u0.Undress<1)) * (u1.Dressed<1)) * ((u0.InBath<1)||(u1.Cabins<1))) * (u2.Out<1)))))))))) * !(((u0.Undress>=1)||(u1.Dress>=1))))] = FALSE * [((Init * !(!(E(TRUE U !(E(TRUE U ((((E(EG(((u1.Dressed>=1)||((u0.InBath>=1)&&(u1.Cabins>=1)))) U (((((u2.Entered>=1)&&(u1.Cabins>=1))||(u1.Dressed>=1))||((u2.WaitBag>=1)&&(u0.Bags>=1)))&&(((u0.Undress>=1)||(u1.Dressed>=1))||((u2.WaitBag>=1)&&(u0.Bags>=1))))) * (u0.Undress<1)) * (u1.Dressed<1)) * ((u0.InBath<1)||(u1.Cabins<1))) * (u2.Out<1)))))))) * !(E(TRUE U ((((((((u0.InBath<1)||(u1.Cabins<1))&&(u1.Dressed<1))&&((u2.Entered<1)||(u1.Cabins<1)))&&(u0.Undress<1))&&(u1.Dress<1))&&(u1.Dressed<1))&&(u2.Out<1)))))] = FALSE)
(forward)formula 3,1,32.3972,223364,1,0,107707,36666,273,540766,153,547984,119102
FORMULA SwimmingPool-PT-01-CTLFireability-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: ((!(AX(((u1.Dressed>=1)||((u2.WaitBag>=1)&&(u0.Bags>=1))))) * AF(((u0.InBath>=1)&&(u1.Cabins>=1)))) * !(EG((((AG((((u0.Undress>=1)||(u1.Dress>=1))||((u0.InBath>=1)&&(u1.Cabins>=1)))) * (u0.Undress<1)) * ((u0.InBath<1)||(u1.Cabins<1))) * ((u2.WaitBag<1)||(u0.Bags<1))))))
=> equivalent forward existential formula: (([(Init * !(EX(!(((u1.Dressed>=1)||((u2.WaitBag>=1)&&(u0.Bags>=1)))))))] = FALSE * [FwdG(Init,!(((u0.InBath>=1)&&(u1.Cabins>=1))))] = FALSE) * [FwdG(Init,(((!(E(TRUE U !((((u0.Undress>=1)||(u1.Dress>=1))||((u0.InBath>=1)&&(u1.Cabins>=1)))))) * (u0.Undress<1)) * ((u0.InBath<1)||(u1.Cabins<1))) * ((u2.WaitBag<1)||(u0.Bags<1))))] = FALSE)
(forward)formula 4,1,34.1672,253460,1,0,121992,44711,295,715585,154,732130,129817
FORMULA SwimmingPool-PT-01-CTLFireability-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: !(EF(((((AF(!(EX(((((((u0.Undress>=1)||(u1.Dress>=1))||((u0.InBath>=1)&&(u1.Cabins>=1)))||(u1.Dressed>=1))||(u2.Out>=1))||((u2.WaitBag>=1)&&(u0.Bags>=1)))))) * ((((((((((((u0.Undress>=1)||((u2.Entered>=1)&&(u1.Cabins>=1)))||(u1.Dress>=1))||(u1.Dressed>=1))||((u0.InBath>=1)&&(u1.Cabins>=1)))||(u2.Out>=1))||((u2.WaitBag>=1)&&(u0.Bags>=1)))||((u2.Entered>=1)&&(u1.Cabins>=1)))||(u1.Dress>=1))||(u1.Dressed>=1))||(u2.Out>=1))||((((((u2.Entered<1)||(u1.Cabins<1))&&(u1.Dress<1))&&(u1.Dressed<1))&&((u0.InBath<1)||(u1.Cabins<1)))&&(u2.Out<1)))) * ((((u2.Entered>=1)&&(u1.Cabins>=1))||((u0.InBath>=1)&&(u1.Cabins>=1)))||((u2.WaitBag>=1)&&(u0.Bags>=1)))) * (((((((u2.Entered>=1)&&(u1.Cabins>=1))||(u1.Dress>=1))||((u0.InBath>=1)&&(u1.Cabins>=1)))||(u1.Dressed>=1))||(u2.Out>=1))||((u2.WaitBag>=1)&&(u0.Bags>=1)))) * ((((((((((((((((((((((u2.Entered>=1)&&(u1.Cabins>=1))||(u1.Dressed>=1))||(u2.Out>=1))||((u2.Entered>=1)&&(u1.Cabins>=1)))||((u0.InBath>=1)&&(u1.Cabins>=1)))||(u2.Out>=1))||((u2.WaitBag>=1)&&(u0.Bags>=1)))&&((u2.Entered<1)||(u1.Cabins<1)))&&(u0.Undress<1))&&(u1.Dress<1))&&(u1.Dressed<1))&&((u0.InBath<1)||(u1.Cabins<1)))&&((u2.WaitBag<1)||(u0.Bags<1)))&&(((((u2.Entered>=1)&&(u1.Cabins>=1))||(u1.Dress>=1))||(u2.Out>=1))||((u2.WaitBag>=1)&&(u0.Bags>=1))))||(u0.Undress>=1))||((u2.Entered>=1)&&(u1.Cabins>=1)))||(u1.Dress>=1))||(u1.Dressed>=1))||((u0.InBath>=1)&&(u1.Cabins>=1)))||(u2.Out>=1))||((u2.WaitBag>=1)&&(u0.Bags>=1))))))
=> equivalent forward existential formula: [(((((FwdU(Init,TRUE) * ((((((((((((((((((((((u2.Entered>=1)&&(u1.Cabins>=1))||(u1.Dressed>=1))||(u2.Out>=1))||((u2.Entered>=1)&&(u1.Cabins>=1)))||((u0.InBath>=1)&&(u1.Cabins>=1)))||(u2.Out>=1))||((u2.WaitBag>=1)&&(u0.Bags>=1)))&&((u2.Entered<1)||(u1.Cabins<1)))&&(u0.Undress<1))&&(u1.Dress<1))&&(u1.Dressed<1))&&((u0.InBath<1)||(u1.Cabins<1)))&&((u2.WaitBag<1)||(u0.Bags<1)))&&(((((u2.Entered>=1)&&(u1.Cabins>=1))||(u1.Dress>=1))||(u2.Out>=1))||((u2.WaitBag>=1)&&(u0.Bags>=1))))||(u0.Undress>=1))||((u2.Entered>=1)&&(u1.Cabins>=1)))||(u1.Dress>=1))||(u1.Dressed>=1))||((u0.InBath>=1)&&(u1.Cabins>=1)))||(u2.Out>=1))||((u2.WaitBag>=1)&&(u0.Bags>=1)))) * (((((((u2.Entered>=1)&&(u1.Cabins>=1))||(u1.Dress>=1))||((u0.InBath>=1)&&(u1.Cabins>=1)))||(u1.Dressed>=1))||(u2.Out>=1))||((u2.WaitBag>=1)&&(u0.Bags>=1)))) * ((((u2.Entered>=1)&&(u1.Cabins>=1))||((u0.InBath>=1)&&(u1.Cabins>=1)))||((u2.WaitBag>=1)&&(u0.Bags>=1)))) * ((((((((((((u0.Undress>=1)||((u2.Entered>=1)&&(u1.Cabins>=1)))||(u1.Dress>=1))||(u1.Dressed>=1))||((u0.InBath>=1)&&(u1.Cabins>=1)))||(u2.Out>=1))||((u2.WaitBag>=1)&&(u0.Bags>=1)))||((u2.Entered>=1)&&(u1.Cabins>=1)))||(u1.Dress>=1))||(u1.Dressed>=1))||(u2.Out>=1))||((((((u2.Entered<1)||(u1.Cabins<1))&&(u1.Dress<1))&&(u1.Dressed<1))&&((u0.InBath<1)||(u1.Cabins<1)))&&(u2.Out<1)))) * !(EG(!(!(EX(((((((u0.Undress>=1)||(u1.Dress>=1))||((u0.InBath>=1)&&(u1.Cabins>=1)))||(u1.Dressed>=1))||(u2.Out>=1))||((u2.WaitBag>=1)&&(u0.Bags>=1)))))))))] = FALSE
(forward)formula 5,1,34.3449,253724,1,0,121995,44711,299,716123,154,732530,130006
FORMULA SwimmingPool-PT-01-CTLFireability-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: !(AX(AG(AX(((((((u0.Undress>=1)||((u2.Entered>=1)&&(u1.Cabins>=1)))||(u1.Dress>=1))||(u1.Dressed>=1))||(u2.Out>=1))||((u2.WaitBag>=1)&&(u0.Bags>=1)))))))
=> equivalent forward existential formula: [(EY(FwdU(EY(Init),TRUE)) * !(((((((u0.Undress>=1)||((u2.Entered>=1)&&(u1.Cabins>=1)))||(u1.Dress>=1))||(u1.Dressed>=1))||(u2.Out>=1))||((u2.WaitBag>=1)&&(u0.Bags>=1)))))] != FALSE
(forward)formula 6,1,34.8473,255308,1,0,122670,44893,320,717231,154,733320,132191
FORMULA SwimmingPool-PT-01-CTLFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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


BK_STOP 1621268221978

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination CTLFireability -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 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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="SwimmingPool-PT-01"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="itstools"
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-4028"
echo " Executing tool itstools"
echo " Input is SwimmingPool-PT-01, 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 r254-tall-162106746400714"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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