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.r121-tall-162075407100514.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 Kanban-PT-00100, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r121-tall-162075407100514
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 396K
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 104K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 109K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Mar 28 16:18 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 28 16:18 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 28 16:18 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Mar 27 06:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 27 06:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 25 07:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 25 07:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 6 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 14K May 5 16:51 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 Kanban-PT-00100-CTLFireability-00
FORMULA_NAME Kanban-PT-00100-CTLFireability-01
FORMULA_NAME Kanban-PT-00100-CTLFireability-02
FORMULA_NAME Kanban-PT-00100-CTLFireability-03
FORMULA_NAME Kanban-PT-00100-CTLFireability-04
FORMULA_NAME Kanban-PT-00100-CTLFireability-05
FORMULA_NAME Kanban-PT-00100-CTLFireability-06
FORMULA_NAME Kanban-PT-00100-CTLFireability-07
FORMULA_NAME Kanban-PT-00100-CTLFireability-08
FORMULA_NAME Kanban-PT-00100-CTLFireability-09
FORMULA_NAME Kanban-PT-00100-CTLFireability-10
FORMULA_NAME Kanban-PT-00100-CTLFireability-11
FORMULA_NAME Kanban-PT-00100-CTLFireability-12
FORMULA_NAME Kanban-PT-00100-CTLFireability-13
FORMULA_NAME Kanban-PT-00100-CTLFireability-14
FORMULA_NAME Kanban-PT-00100-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1620858431102

Running Version 0
[2021-05-12 22:27:12] [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-12 22:27:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-12 22:27:12] [INFO ] Load time of PNML (sax parser for PT used): 22 ms
[2021-05-12 22:27:12] [INFO ] Transformed 16 places.
[2021-05-12 22:27:12] [INFO ] Transformed 16 transitions.
[2021-05-12 22:27:12] [INFO ] Parsed PT model containing 16 places and 16 transitions in 58 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 16 ms.
[2021-05-12 22:27:12] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-12 22:27:12] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-12 22:27:12] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-12 22:27:12] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-12 22:27:12] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-12 22:27:12] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-12 22:27:12] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-12 22:27:12] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-12 22:27:12] [INFO ] Reduced 2 identical enabling conditions.
[2021-05-12 22:27:12] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-12 22:27:12] [INFO ] Reduced 2 identical enabling conditions.
[2021-05-12 22:27:12] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-12 22:27:12] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-12 22:27:12] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-12 22:27:12] [INFO ] Reduced 2 identical enabling conditions.
[2021-05-12 22:27:12] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-12 22:27:12] [INFO ] Reduced 2 identical enabling conditions.
[2021-05-12 22:27:12] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-12 22:27:12] [INFO ] Reduced 2 identical enabling conditions.
[2021-05-12 22:27:12] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-12 22:27:12] [INFO ] Reduced 2 identical enabling conditions.
[2021-05-12 22:27:12] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-12 22:27:12] [INFO ] Reduced 3 identical enabling conditions.
[2021-05-12 22:27:12] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-12 22:27:12] [INFO ] Reduced 3 identical enabling conditions.
[2021-05-12 22:27:12] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-12 22:27:12] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-12 22:27:12] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-12 22:27:12] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-12 22:27:12] [INFO ] Reduced 2 identical enabling conditions.
[2021-05-12 22:27:12] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-12 22:27:12] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-12 22:27:12] [INFO ] Reduced 2 identical enabling conditions.
[2021-05-12 22:27:12] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-12 22:27:12] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-12 22:27:12] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-12 22:27:12] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-12 22:27:12] [INFO ] Reduced 3 identical enabling conditions.
[2021-05-12 22:27:12] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-12 22:27:12] [INFO ] Reduced 2 identical enabling conditions.
[2021-05-12 22:27:12] [INFO ] Reduced 2 identical enabling conditions.
[2021-05-12 22:27:12] [INFO ] Reduced 3 identical enabling conditions.
[2021-05-12 22:27:12] [INFO ] Reduced 2 identical enabling conditions.
[2021-05-12 22:27:12] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-12 22:27:12] [INFO ] Reduced 2 identical enabling conditions.
[2021-05-12 22:27:12] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-12 22:27:12] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-12 22:27:12] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-12 22:27:12] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-12 22:27:12] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-12 22:27:12] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-12 22:27:12] [INFO ] Reduced 2 identical enabling conditions.
[2021-05-12 22:27:12] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-12 22:27:12] [INFO ] Reduced 2 identical enabling conditions.
[2021-05-12 22:27:12] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-12 22:27:12] [INFO ] Reduced 1 identical enabling conditions.
Support contains 16 out of 16 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 16/16 places, 16/16 transitions.
Applied a total of 0 rules in 8 ms. Remains 16 /16 variables (removed 0) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 16 cols
[2021-05-12 22:27:12] [INFO ] Computed 5 place invariants in 4 ms
[2021-05-12 22:27:12] [INFO ] Implicit Places using invariants in 65 ms returned []
// Phase 1: matrix 16 rows 16 cols
[2021-05-12 22:27:12] [INFO ] Computed 5 place invariants in 2 ms
[2021-05-12 22:27:12] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
// Phase 1: matrix 16 rows 16 cols
[2021-05-12 22:27:12] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-12 22:27:12] [INFO ] Dead Transitions using invariants and state equation in 35 ms returned []
Finished structural reductions, in 1 iterations. Remains : 16/16 places, 16/16 transitions.
[2021-05-12 22:27:12] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2021-05-12 22:27:12] [INFO ] Flatten gal took : 23 ms
FORMULA Kanban-PT-00100-CTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Kanban-PT-00100-CTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-12 22:27:13] [INFO ] Flatten gal took : 7 ms
[2021-05-12 22:27:13] [INFO ] Input system was already deterministic with 16 transitions.
Incomplete random walk after 100092 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=1819 ) properties (out of 93) seen :91
Running SMT prover for 2 properties.
// Phase 1: matrix 16 rows 16 cols
[2021-05-12 22:27:13] [INFO ] Computed 5 place invariants in 1 ms
Successfully simplified 2 atomic propositions for a total of 14 simplifications.
Graph (trivial) has 5 edges and 16 vertex of which 4 / 16 are part of one of the 2 SCC in 2 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Ensure Unique test removed 1 places
Applied a total of 1 rules in 8 ms. Remains 13 /16 variables (removed 3) and now considering 14/16 (removed 2) transitions.
[2021-05-12 22:27:13] [INFO ] Flatten gal took : 1 ms
[2021-05-12 22:27:13] [INFO ] Flatten gal took : 1 ms
[2021-05-12 22:27:13] [INFO ] Input system was already deterministic with 14 transitions.
[2021-05-12 22:27:13] [INFO ] Flatten gal took : 1 ms
[2021-05-12 22:27:13] [INFO ] Flatten gal took : 2 ms
[2021-05-12 22:27:13] [INFO ] Time to serialize gal into /tmp/CTLFireability3584196455826459292.gal : 1 ms
[2021-05-12 22:27:13] [INFO ] Time to serialize properties into /tmp/CTLFireability12950933329198592867.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/CTLFireability3584196455826459292.gal, -t, CGAL, -ctl, /tmp/CTLFireability12950933329198592867.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/CTLFireability3584196455826459292.gal -t CGAL -ctl /tmp/CTLFireability12950933329198592867.ctl --gen-order FOLLOW
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2021-05-12 22:27:43] [INFO ] Flatten gal took : 2 ms
[2021-05-12 22:27:43] [INFO ] Applying decomposition
[2021-05-12 22:27:43] [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/graph35559933814052156.txt, -o, /tmp/graph35559933814052156.bin, -w, /tmp/graph35559933814052156.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/graph35559933814052156.bin, -l, -1, -v, -w, /tmp/graph35559933814052156.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-12 22:27:43] [INFO ] Decomposing Gal with order
[2021-05-12 22:27:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-12 22:27:43] [INFO ] Flatten gal took : 19 ms
[2021-05-12 22:27:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-12 22:27:43] [INFO ] Time to serialize gal into /tmp/CTLFireability17670484544444962339.gal : 1 ms
[2021-05-12 22:27:43] [INFO ] Time to serialize properties into /tmp/CTLFireability6892474598957522976.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/CTLFireability17670484544444962339.gal, -t, CGAL, -ctl, /tmp/CTLFireability6892474598957522976.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/CTLFireability17670484544444962339.gal -t CGAL -ctl /tmp/CTLFireability6892474598957522976.ctl
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,1.46448e+16,2.6597,52480,307,10705,2117,239853,39,6255,33,315798,0


Converting to forward existential form...Done !
original formula: EG(!(AG(((((((((u0.Pm3>=1)||(((u0.Pout3>=1)&&(u2.P1>=1))&&(u3.Pout2>=1)))||(u1.P4>=1))||(u3.Pm2>=1))||(u3.Pback2>=1))||(u0.Pback3>=1))||(u2.Pout1>=1))||(u3.Pback2>=1)))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !(((((((((u0.Pm3>=1)||(((u0.Pout3>=1)&&(u2.P1>=1))&&(u3.Pout2>=1)))||(u1.P4>=1))||(u3.Pm2>=1))||(u3.Pback2>=1))||(u0.Pback3>=1))||(u2.Pout1>=1))||(u3.Pback2>=1)))))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
(forward)formula 0,1,10.2239,139136,1,0,7143,393814,195,72329,531,627498,12169
FORMULA Kanban-PT-00100-CTLFireability-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

[2021-05-12 22:27:53] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2021-05-12 22:27:53] [INFO ] Flatten gal took : 5 ms
FORMULA Kanban-PT-00100-CTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-12 22:27:53] [INFO ] Flatten gal took : 3 ms
[2021-05-12 22:27:53] [INFO ] Applying decomposition
[2021-05-12 22:27:53] [INFO ] Flatten gal took : 3 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/graph14870269197639753233.txt, -o, /tmp/graph14870269197639753233.bin, -w, /tmp/graph14870269197639753233.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/graph14870269197639753233.bin, -l, -1, -v, -w, /tmp/graph14870269197639753233.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-12 22:27:53] [INFO ] Decomposing Gal with order
[2021-05-12 22:27:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-12 22:27:53] [INFO ] Flatten gal took : 5 ms
[2021-05-12 22:27:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-12 22:27:53] [INFO ] Time to serialize gal into /tmp/CTLFireability1092488663549892224.gal : 1 ms
[2021-05-12 22:27:53] [INFO ] Time to serialize properties into /tmp/CTLFireability10487775466934124557.ctl : 6 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/CTLFireability1092488663549892224.gal, -t, CGAL, -ctl, /tmp/CTLFireability10487775466934124557.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/CTLFireability1092488663549892224.gal -t CGAL -ctl /tmp/CTLFireability10487775466934124557.ctl
No direction supplied, using forward translation only.
Parsed 12 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.7263e+19,12.1083,241748,410,10706,38267,422984,50,880403,31,1.85219e+06,0


Converting to forward existential form...Done !
original formula: !(E((((E((((((((((((u0.Pback3<1)&&(((u0.Pout3<1)||(i2.u3.P1<1))||(u4.Pout2<1)))&&(u1.P4<1))&&(u1.Pm4<1))&&(i2.u3.Pout1<1))&&(i2.u2.Pback1<1))&&(u4.Pm2<1))&&(((u0.P3<1)||(u1.Pout4<1))||(u4.P2<1)))&&(u4.Pback2<1))||(((((((u0.Pback3<1)&&(((u0.Pout3<1)||(i2.u3.P1<1))||(u4.Pout2<1)))&&(u1.P4<1))&&(i2.u2.Pm1<1))&&(u4.Pm2<1))&&(((u0.P3<1)||(u1.Pout4<1))||(u4.P2<1)))&&(u4.Pback2<1))) * !(EF((((((u0.Pm3>=1)||(((u0.Pout3>=1)&&(i2.u3.P1>=1))&&(u4.Pout2>=1)))||(i2.u3.Pout1>=1))||(i2.u2.Pback1>=1))||(u4.Pback2>=1))))) U EX((((u1.P4>=1)||(u1.Pm4>=1))&&(((((((u0.Pback3>=1)||(u1.P4>=1))||(u1.Pm4>=1))||(u1.Pback4>=1))||(i2.u2.Pback1>=1))||(u4.Pm2>=1))||(((u0.P3>=1)&&(u1.Pout4>=1))&&(u4.P2>=1)))))) * (u0.Pback3<1)) * (((u0.Pout3<1)||(i2.u3.P1<1))||(u4.Pout2<1))) * (i2.u2.Pm1<1)) U AG((((((((((!(A((((u0.Pm3>=1)||(u4.Pm2>=1))||(((u0.P3>=1)&&(u1.Pout4>=1))&&(u4.P2>=1))) U (((((u0.Pm3>=1)||(u0.Pback3>=1))||(((u0.Pout3>=1)&&(i2.u3.P1>=1))&&(u4.Pout2>=1)))||(u4.Pm2>=1))||(u4.Pback2>=1)))) + (((((u0.Pback3<1)&&(u1.P4<1))&&(u1.Pm4<1))&&(i2.u3.Pout1<1))&&(u0.Pm3<1))) + (u0.Pm3>=1)) + (u0.Pback3>=1)) + (u1.Pm4>=1)) + (u1.Pback4>=1)) + (i2.u2.Pm1>=1)) + (i2.u3.Pout1>=1)) + (i2.u2.Pback1>=1)) + (u4.Pback2>=1)))))
=> equivalent forward existential formula: [(FwdU(Init,(((E((((((((((((u0.Pback3<1)&&(((u0.Pout3<1)||(i2.u3.P1<1))||(u4.Pout2<1)))&&(u1.P4<1))&&(u1.Pm4<1))&&(i2.u3.Pout1<1))&&(i2.u2.Pback1<1))&&(u4.Pm2<1))&&(((u0.P3<1)||(u1.Pout4<1))||(u4.P2<1)))&&(u4.Pback2<1))||(((((((u0.Pback3<1)&&(((u0.Pout3<1)||(i2.u3.P1<1))||(u4.Pout2<1)))&&(u1.P4<1))&&(i2.u2.Pm1<1))&&(u4.Pm2<1))&&(((u0.P3<1)||(u1.Pout4<1))||(u4.P2<1)))&&(u4.Pback2<1))) * !(E(TRUE U (((((u0.Pm3>=1)||(((u0.Pout3>=1)&&(i2.u3.P1>=1))&&(u4.Pout2>=1)))||(i2.u3.Pout1>=1))||(i2.u2.Pback1>=1))||(u4.Pback2>=1))))) U EX((((u1.P4>=1)||(u1.Pm4>=1))&&(((((((u0.Pback3>=1)||(u1.P4>=1))||(u1.Pm4>=1))||(u1.Pback4>=1))||(i2.u2.Pback1>=1))||(u4.Pm2>=1))||(((u0.P3>=1)&&(u1.Pout4>=1))&&(u4.P2>=1)))))) * (u0.Pback3<1)) * (((u0.Pout3<1)||(i2.u3.P1<1))||(u4.Pout2<1))) * (i2.u2.Pm1<1))) * !(E(TRUE U !((((((((((!(!((E(!((((((u0.Pm3>=1)||(u0.Pback3>=1))||(((u0.Pout3>=1)&&(i2.u3.P1>=1))&&(u4.Pout2>=1)))||(u4.Pm2>=1))||(u4.Pback2>=1))) U (!((((u0.Pm3>=1)||(u4.Pm2>=1))||(((u0.P3>=1)&&(u1.Pout4>=1))&&(u4.P2>=1)))) * !((((((u0.Pm3>=1)||(u0.Pback3>=1))||(((u0.Pout3>=1)&&(i2.u3.P1>=1))&&(u4.Pout2>=1)))||(u4.Pm2>=1))||(u4.Pback2>=1))))) + EG(!((((((u0.Pm3>=1)||(u0.Pback3>=1))||(((u0.Pout3>=1)&&(i2.u3.P1>=1))&&(u4.Pout2>=1)))||(u4.Pm2>=1))||(u4.Pback2>=1))))))) + (((((u0.Pback3<1)&&(u1.P4<1))&&(u1.Pm4<1))&&(i2.u3.Pout1<1))&&(u0.Pm3<1))) + (u0.Pm3>=1)) + (u0.Pback3>=1)) + (u1.Pm4>=1)) + (u1.Pback4>=1)) + (i2.u2.Pm1>=1)) + (i2.u3.Pout1>=1)) + (i2.u2.Pback1>=1)) + (u4.Pback2>=1))))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
(forward)formula 0,1,45.5365,547980,1,0,38267,1.28191e+06,250,880403,516,3.21401e+06,16517
FORMULA Kanban-PT-00100-CTLFireability-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: E(((((u0.Pback3<1)&&(u4.Pback2<1))&&(((u0.Pout3<1)||(i2.u3.P1<1))||(u4.Pout2<1)))&&(((u0.P3<1)||(u1.Pout4<1))||(u4.P2<1))) U EG((A((((u0.Pm3>=1)||(u1.Pm4>=1))||(u4.Pback2>=1)) U ((((((((((((((u0.Pout3<1)||(i2.u3.P1<1))||(u4.Pout2<1))&&(u1.Pback4<1))&&(u4.Pm2<1))&&(u4.Pback2<1))&&(u0.Pm3<1))&&(u1.Pm4<1))&&(u1.Pback4<1))&&(i2.u2.Pm1<1))&&(i2.u3.Pout1<1))&&(i2.u2.Pback1<1))&&(((u0.P3<1)||(u1.Pout4<1))||(u4.P2<1)))&&(u4.Pback2<1))) * AF(AX(((((((u0.Pm3>=1)||(u0.Pback3>=1))||(i2.u2.Pm1>=1))||(i2.u2.Pback1>=1))||(u4.Pm2>=1))||(u4.Pback2>=1)))))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,((((u0.Pback3<1)&&(u4.Pback2<1))&&(((u0.Pout3<1)||(i2.u3.P1<1))||(u4.Pout2<1)))&&(((u0.P3<1)||(u1.Pout4<1))||(u4.P2<1)))),(!((E(!(((((((((((((((u0.Pout3<1)||(i2.u3.P1<1))||(u4.Pout2<1))&&(u1.Pback4<1))&&(u4.Pm2<1))&&(u4.Pback2<1))&&(u0.Pm3<1))&&(u1.Pm4<1))&&(u1.Pback4<1))&&(i2.u2.Pm1<1))&&(i2.u3.Pout1<1))&&(i2.u2.Pback1<1))&&(((u0.P3<1)||(u1.Pout4<1))||(u4.P2<1)))&&(u4.Pback2<1))) U (!((((u0.Pm3>=1)||(u1.Pm4>=1))||(u4.Pback2>=1))) * !(((((((((((((((u0.Pout3<1)||(i2.u3.P1<1))||(u4.Pout2<1))&&(u1.Pback4<1))&&(u4.Pm2<1))&&(u4.Pback2<1))&&(u0.Pm3<1))&&(u1.Pm4<1))&&(u1.Pback4<1))&&(i2.u2.Pm1<1))&&(i2.u3.Pout1<1))&&(i2.u2.Pback1<1))&&(((u0.P3<1)||(u1.Pout4<1))||(u4.P2<1)))&&(u4.Pback2<1))))) + EG(!(((((((((((((((u0.Pout3<1)||(i2.u3.P1<1))||(u4.Pout2<1))&&(u1.Pback4<1))&&(u4.Pm2<1))&&(u4.Pback2<1))&&(u0.Pm3<1))&&(u1.Pm4<1))&&(u1.Pback4<1))&&(i2.u2.Pm1<1))&&(i2.u3.Pout1<1))&&(i2.u2.Pback1<1))&&(((u0.P3<1)||(u1.Pout4<1))||(u4.P2<1)))&&(u4.Pback2<1)))))) * !(EG(!(!(EX(!(((((((u0.Pm3>=1)||(u0.Pback3>=1))||(i2.u2.Pm1>=1))||(i2.u2.Pback1>=1))||(u4.Pm2>=1))||(u4.Pback2>=1))))))))))] != FALSE
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Detected timeout of ITS tools.
[2021-05-12 22:48:06] [INFO ] Flatten gal took : 3 ms
[2021-05-12 22:48:06] [INFO ] Time to serialize gal into /tmp/CTLFireability7523826896139123481.gal : 1 ms
[2021-05-12 22:48:06] [INFO ] Time to serialize properties into /tmp/CTLFireability2026898869244236576.ctl : 3 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/CTLFireability7523826896139123481.gal, -t, CGAL, -ctl, /tmp/CTLFireability2026898869244236576.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/CTLFireability7523826896139123481.gal -t CGAL -ctl /tmp/CTLFireability2026898869244236576.ctl --gen-order FOLLOW
No direction supplied, using forward translation only.
Parsed 11 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.7263e+19,61.0491,1055868,2,1317,5,8.49235e+06,6,0,83,8.62428e+06,0


Converting to forward existential form...Done !
original formula: E(((((Pback3<1)&&(Pback2<1))&&(((Pout3<1)||(P1<1))||(Pout2<1)))&&(((P3<1)||(Pout4<1))||(P2<1))) U EG((A((((Pm3>=1)||(Pm4>=1))||(Pback2>=1)) U ((((((((((((((Pout3<1)||(P1<1))||(Pout2<1))&&(Pback4<1))&&(Pm2<1))&&(Pback2<1))&&(Pm3<1))&&(Pm4<1))&&(Pback4<1))&&(Pm1<1))&&(Pout1<1))&&(Pback1<1))&&(((P3<1)||(Pout4<1))||(P2<1)))&&(Pback2<1))) * AF(AX(((((((Pm3>=1)||(Pback3>=1))||(Pm1>=1))||(Pback1>=1))||(Pm2>=1))||(Pback2>=1)))))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,((((Pback3<1)&&(Pback2<1))&&(((Pout3<1)||(P1<1))||(Pout2<1)))&&(((P3<1)||(Pout4<1))||(P2<1)))),(!((E(!(((((((((((((((Pout3<1)||(P1<1))||(Pout2<1))&&(Pback4<1))&&(Pm2<1))&&(Pback2<1))&&(Pm3<1))&&(Pm4<1))&&(Pback4<1))&&(Pm1<1))&&(Pout1<1))&&(Pback1<1))&&(((P3<1)||(Pout4<1))||(P2<1)))&&(Pback2<1))) U (!((((Pm3>=1)||(Pm4>=1))||(Pback2>=1))) * !(((((((((((((((Pout3<1)||(P1<1))||(Pout2<1))&&(Pback4<1))&&(Pm2<1))&&(Pback2<1))&&(Pm3<1))&&(Pm4<1))&&(Pback4<1))&&(Pm1<1))&&(Pout1<1))&&(Pback1<1))&&(((P3<1)||(Pout4<1))||(P2<1)))&&(Pback2<1))))) + EG(!(((((((((((((((Pout3<1)||(P1<1))||(Pout2<1))&&(Pback4<1))&&(Pm2<1))&&(Pback2<1))&&(Pm3<1))&&(Pm4<1))&&(Pback4<1))&&(Pm1<1))&&(Pout1<1))&&(Pback1<1))&&(((P3<1)||(Pout4<1))||(P2<1)))&&(Pback2<1)))))) * !(EG(!(!(EX(!(((((((Pm3>=1)||(Pback3>=1))||(Pm1>=1))||(Pback1>=1))||(Pm2>=1))||(Pback2>=1))))))))))] != FALSE
Hit Full ! (commute/partial/dont) 6/21/10
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
Hit Full ! (commute/partial/dont) 0/0/16
(forward)formula 0,0,204.278,2261084,1,0,13,1.52412e+07,12,3,187,1.57035e+07,1
FORMULA Kanban-PT-00100-CTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: A(AG((((((((((Pm3>=1)||(Pback3>=1))||(Pm4>=1))||(Pm1>=1))||(Pout1>=1))||(Pm2>=1))||(Pback2>=1))||(((Pout3>=1)&&(P1>=1))&&(Pout2>=1)))||(((P3>=1)&&(Pout4>=1))&&(P2>=1)))) U (EX(AG(E(((((((((((Pout3>=1)&&(P1>=1))&&(Pout2>=1))||(P4>=1))||(Pm4>=1))||(Pm1>=1))||(Pout1>=1))||(Pback1>=1))||(Pm2>=1))||(((P3>=1)&&(Pout4>=1))&&(P2>=1))) U (((((Pm3>=1)||(((Pout3>=1)&&(P1>=1))&&(Pout2>=1)))||(Pback1>=1))||(Pm2>=1))||(Pback2>=1))))) * A(((E((((((((((Pm3>=1)||(Pback3>=1))||(Pm4>=1))||(Pback4>=1))||(Pm1>=1))||(Pout1>=1))||(Pback1>=1))||(Pm2>=1))||(Pback2>=1)) U (((Pback3>=1)||(Pm4>=1))||(Pm2>=1))) * AX(((((((Pout3>=1)&&(P1>=1))&&(Pout2>=1))||(Pm1>=1))||(Pm2>=1))||(((P3>=1)&&(Pout4>=1))&&(P2>=1))))) * ((((Pback3>=1)||(((Pout3>=1)&&(P1>=1))&&(Pout2>=1)))||(Pback4>=1))||(Pm2>=1))) U (!(EX((((((Pm3>=1)||(Pback3>=1))||(Pback1>=1))||(Pm2>=1))||(Pback2>=1)))) * !(AG((Pm2>=1)))))))
=> equivalent forward existential formula: [((Init * !(EG(!((EX(!(E(TRUE U !(E(((((((((((Pout3>=1)&&(P1>=1))&&(Pout2>=1))||(P4>=1))||(Pm4>=1))||(Pm1>=1))||(Pout1>=1))||(Pback1>=1))||(Pm2>=1))||(((P3>=1)&&(Pout4>=1))&&(P2>=1))) U (((((Pm3>=1)||(((Pout3>=1)&&(P1>=1))&&(Pout2>=1)))||(Pback1>=1))||(Pm2>=1))||(Pback2>=1))))))) * !((E(!((!(EX((((((Pm3>=1)||(Pback3>=1))||(Pback1>=1))||(Pm2>=1))||(Pback2>=1)))) * !(!(E(TRUE U !((Pm2>=1))))))) U (!(((E((((((((((Pm3>=1)||(Pback3>=1))||(Pm4>=1))||(Pback4>=1))||(Pm1>=1))||(Pout1>=1))||(Pback1>=1))||(Pm2>=1))||(Pback2>=1)) U (((Pback3>=1)||(Pm4>=1))||(Pm2>=1))) * !(EX(!(((((((Pout3>=1)&&(P1>=1))&&(Pout2>=1))||(Pm1>=1))||(Pm2>=1))||(((P3>=1)&&(Pout4>=1))&&(P2>=1))))))) * ((((Pback3>=1)||(((Pout3>=1)&&(P1>=1))&&(Pout2>=1)))||(Pback4>=1))||(Pm2>=1)))) * !((!(EX((((((Pm3>=1)||(Pback3>=1))||(Pback1>=1))||(Pm2>=1))||(Pback2>=1)))) * !(!(E(TRUE U !((Pm2>=1))))))))) + EG(!((!(EX((((((Pm3>=1)||(Pback3>=1))||(Pback1>=1))||(Pm2>=1))||(Pback2>=1)))) * !(!(E(TRUE U !((Pm2>=1))))))))))))))) * !(E(!((EX(!(E(TRUE U !(E(((((((((((Pout3>=1)&&(P1>=1))&&(Pout2>=1))||(P4>=1))||(Pm4>=1))||(Pm1>=1))||(Pout1>=1))||(Pback1>=1))||(Pm2>=1))||(((P3>=1)&&(Pout4>=1))&&(P2>=1))) U (((((Pm3>=1)||(((Pout3>=1)&&(P1>=1))&&(Pout2>=1)))||(Pback1>=1))||(Pm2>=1))||(Pback2>=1))))))) * !((E(!((!(EX((((((Pm3>=1)||(Pback3>=1))||(Pback1>=1))||(Pm2>=1))||(Pback2>=1)))) * !(!(E(TRUE U !((Pm2>=1))))))) U (!(((E((((((((((Pm3>=1)||(Pback3>=1))||(Pm4>=1))||(Pback4>=1))||(Pm1>=1))||(Pout1>=1))||(Pback1>=1))||(Pm2>=1))||(Pback2>=1)) U (((Pback3>=1)||(Pm4>=1))||(Pm2>=1))) * !(EX(!(((((((Pout3>=1)&&(P1>=1))&&(Pout2>=1))||(Pm1>=1))||(Pm2>=1))||(((P3>=1)&&(Pout4>=1))&&(P2>=1))))))) * ((((Pback3>=1)||(((Pout3>=1)&&(P1>=1))&&(Pout2>=1)))||(Pback4>=1))||(Pm2>=1)))) * !((!(EX((((((Pm3>=1)||(Pback3>=1))||(Pback1>=1))||(Pm2>=1))||(Pback2>=1)))) * !(!(E(TRUE U !((Pm2>=1))))))))) + EG(!((!(EX((((((Pm3>=1)||(Pback3>=1))||(Pback1>=1))||(Pm2>=1))||(Pback2>=1)))) * !(!(E(TRUE U !((Pm2>=1)))))))))))) U (!(!(E(TRUE U !((((((((((Pm3>=1)||(Pback3>=1))||(Pm4>=1))||(Pm1>=1))||(Pout1>=1))||(Pm2>=1))||(Pback2>=1))||(((Pout3>=1)&&(P1>=1))&&(Pout2>=1)))||(((P3>=1)&&(Pout4>=1))&&(P2>=1))))))) * !((EX(!(E(TRUE U !(E(((((((((((Pout3>=1)&&(P1>=1))&&(Pout2>=1))||(P4>=1))||(Pm4>=1))||(Pm1>=1))||(Pout1>=1))||(Pback1>=1))||(Pm2>=1))||(((P3>=1)&&(Pout4>=1))&&(P2>=1))) U (((((Pm3>=1)||(((Pout3>=1)&&(P1>=1))&&(Pout2>=1)))||(Pback1>=1))||(Pm2>=1))||(Pback2>=1))))))) * !((E(!((!(EX((((((Pm3>=1)||(Pback3>=1))||(Pback1>=1))||(Pm2>=1))||(Pback2>=1)))) * !(!(E(TRUE U !((Pm2>=1))))))) U (!(((E((((((((((Pm3>=1)||(Pback3>=1))||(Pm4>=1))||(Pback4>=1))||(Pm1>=1))||(Pout1>=1))||(Pback1>=1))||(Pm2>=1))||(Pback2>=1)) U (((Pback3>=1)||(Pm4>=1))||(Pm2>=1))) * !(EX(!(((((((Pout3>=1)&&(P1>=1))&&(Pout2>=1))||(Pm1>=1))||(Pm2>=1))||(((P3>=1)&&(Pout4>=1))&&(P2>=1))))))) * ((((Pback3>=1)||(((Pout3>=1)&&(P1>=1))&&(Pout2>=1)))||(Pback4>=1))||(Pm2>=1)))) * !((!(EX((((((Pm3>=1)||(Pback3>=1))||(Pback1>=1))||(Pm2>=1))||(Pback2>=1)))) * !(!(E(TRUE U !((Pm2>=1))))))))) + EG(!((!(EX((((((Pm3>=1)||(Pback3>=1))||(Pback1>=1))||(Pm2>=1))||(Pback2>=1)))) * !(!(E(TRUE U !((Pm2>=1))))))))))))))))] != FALSE
Hit Full ! (commute/partial/dont) 0/0/16
Detected timeout of ITS tools.
[2021-05-12 23:08:20] [INFO ] Flatten gal took : 3 ms
[2021-05-12 23:08:20] [INFO ] Input system was already deterministic with 16 transitions.
[2021-05-12 23:08:20] [INFO ] Transformed 16 places.
[2021-05-12 23:08:20] [INFO ] Transformed 16 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2021-05-12 23:08:20] [INFO ] Time to serialize gal into /tmp/CTLFireability2639843941462700249.gal : 0 ms
[2021-05-12 23:08:20] [INFO ] Time to serialize properties into /tmp/CTLFireability3066728160555025371.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/CTLFireability2639843941462700249.gal, -t, CGAL, -ctl, /tmp/CTLFireability3066728160555025371.ctl, --load-order, /home/mcc/execution/model.ord, --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/CTLFireability2639843941462700249.gal -t CGAL -ctl /tmp/CTLFireability3066728160555025371.ctl --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 10 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.7263e+19,78.9755,1414224,2,1.43057e+06,5,9.62585e+06,6,0,83,8.21368e+06,0


Converting to forward existential form...Done !
original formula: A(AG((((((((((Pm3>=1)||(Pback3>=1))||(Pm4>=1))||(Pm1>=1))||(Pout1>=1))||(Pm2>=1))||(Pback2>=1))||(((Pout3>=1)&&(P1>=1))&&(Pout2>=1)))||(((P3>=1)&&(Pout4>=1))&&(P2>=1)))) U (EX(AG(E(((((((((((Pout3>=1)&&(P1>=1))&&(Pout2>=1))||(P4>=1))||(Pm4>=1))||(Pm1>=1))||(Pout1>=1))||(Pback1>=1))||(Pm2>=1))||(((P3>=1)&&(Pout4>=1))&&(P2>=1))) U (((((Pm3>=1)||(((Pout3>=1)&&(P1>=1))&&(Pout2>=1)))||(Pback1>=1))||(Pm2>=1))||(Pback2>=1))))) * A(((E((((((((((Pm3>=1)||(Pback3>=1))||(Pm4>=1))||(Pback4>=1))||(Pm1>=1))||(Pout1>=1))||(Pback1>=1))||(Pm2>=1))||(Pback2>=1)) U (((Pback3>=1)||(Pm4>=1))||(Pm2>=1))) * AX(((((((Pout3>=1)&&(P1>=1))&&(Pout2>=1))||(Pm1>=1))||(Pm2>=1))||(((P3>=1)&&(Pout4>=1))&&(P2>=1))))) * ((((Pback3>=1)||(((Pout3>=1)&&(P1>=1))&&(Pout2>=1)))||(Pback4>=1))||(Pm2>=1))) U (!(EX((((((Pm3>=1)||(Pback3>=1))||(Pback1>=1))||(Pm2>=1))||(Pback2>=1)))) * !(AG((Pm2>=1)))))))
=> equivalent forward existential formula: [((Init * !(EG(!((EX(!(E(TRUE U !(E(((((((((((Pout3>=1)&&(P1>=1))&&(Pout2>=1))||(P4>=1))||(Pm4>=1))||(Pm1>=1))||(Pout1>=1))||(Pback1>=1))||(Pm2>=1))||(((P3>=1)&&(Pout4>=1))&&(P2>=1))) U (((((Pm3>=1)||(((Pout3>=1)&&(P1>=1))&&(Pout2>=1)))||(Pback1>=1))||(Pm2>=1))||(Pback2>=1))))))) * !((E(!((!(EX((((((Pm3>=1)||(Pback3>=1))||(Pback1>=1))||(Pm2>=1))||(Pback2>=1)))) * !(!(E(TRUE U !((Pm2>=1))))))) U (!(((E((((((((((Pm3>=1)||(Pback3>=1))||(Pm4>=1))||(Pback4>=1))||(Pm1>=1))||(Pout1>=1))||(Pback1>=1))||(Pm2>=1))||(Pback2>=1)) U (((Pback3>=1)||(Pm4>=1))||(Pm2>=1))) * !(EX(!(((((((Pout3>=1)&&(P1>=1))&&(Pout2>=1))||(Pm1>=1))||(Pm2>=1))||(((P3>=1)&&(Pout4>=1))&&(P2>=1))))))) * ((((Pback3>=1)||(((Pout3>=1)&&(P1>=1))&&(Pout2>=1)))||(Pback4>=1))||(Pm2>=1)))) * !((!(EX((((((Pm3>=1)||(Pback3>=1))||(Pback1>=1))||(Pm2>=1))||(Pback2>=1)))) * !(!(E(TRUE U !((Pm2>=1))))))))) + EG(!((!(EX((((((Pm3>=1)||(Pback3>=1))||(Pback1>=1))||(Pm2>=1))||(Pback2>=1)))) * !(!(E(TRUE U !((Pm2>=1))))))))))))))) * !(E(!((EX(!(E(TRUE U !(E(((((((((((Pout3>=1)&&(P1>=1))&&(Pout2>=1))||(P4>=1))||(Pm4>=1))||(Pm1>=1))||(Pout1>=1))||(Pback1>=1))||(Pm2>=1))||(((P3>=1)&&(Pout4>=1))&&(P2>=1))) U (((((Pm3>=1)||(((Pout3>=1)&&(P1>=1))&&(Pout2>=1)))||(Pback1>=1))||(Pm2>=1))||(Pback2>=1))))))) * !((E(!((!(EX((((((Pm3>=1)||(Pback3>=1))||(Pback1>=1))||(Pm2>=1))||(Pback2>=1)))) * !(!(E(TRUE U !((Pm2>=1))))))) U (!(((E((((((((((Pm3>=1)||(Pback3>=1))||(Pm4>=1))||(Pback4>=1))||(Pm1>=1))||(Pout1>=1))||(Pback1>=1))||(Pm2>=1))||(Pback2>=1)) U (((Pback3>=1)||(Pm4>=1))||(Pm2>=1))) * !(EX(!(((((((Pout3>=1)&&(P1>=1))&&(Pout2>=1))||(Pm1>=1))||(Pm2>=1))||(((P3>=1)&&(Pout4>=1))&&(P2>=1))))))) * ((((Pback3>=1)||(((Pout3>=1)&&(P1>=1))&&(Pout2>=1)))||(Pback4>=1))||(Pm2>=1)))) * !((!(EX((((((Pm3>=1)||(Pback3>=1))||(Pback1>=1))||(Pm2>=1))||(Pback2>=1)))) * !(!(E(TRUE U !((Pm2>=1))))))))) + EG(!((!(EX((((((Pm3>=1)||(Pback3>=1))||(Pback1>=1))||(Pm2>=1))||(Pback2>=1)))) * !(!(E(TRUE U !((Pm2>=1)))))))))))) U (!(!(E(TRUE U !((((((((((Pm3>=1)||(Pback3>=1))||(Pm4>=1))||(Pm1>=1))||(Pout1>=1))||(Pm2>=1))||(Pback2>=1))||(((Pout3>=1)&&(P1>=1))&&(Pout2>=1)))||(((P3>=1)&&(Pout4>=1))&&(P2>=1))))))) * !((EX(!(E(TRUE U !(E(((((((((((Pout3>=1)&&(P1>=1))&&(Pout2>=1))||(P4>=1))||(Pm4>=1))||(Pm1>=1))||(Pout1>=1))||(Pback1>=1))||(Pm2>=1))||(((P3>=1)&&(Pout4>=1))&&(P2>=1))) U (((((Pm3>=1)||(((Pout3>=1)&&(P1>=1))&&(Pout2>=1)))||(Pback1>=1))||(Pm2>=1))||(Pback2>=1))))))) * !((E(!((!(EX((((((Pm3>=1)||(Pback3>=1))||(Pback1>=1))||(Pm2>=1))||(Pback2>=1)))) * !(!(E(TRUE U !((Pm2>=1))))))) U (!(((E((((((((((Pm3>=1)||(Pback3>=1))||(Pm4>=1))||(Pback4>=1))||(Pm1>=1))||(Pout1>=1))||(Pback1>=1))||(Pm2>=1))||(Pback2>=1)) U (((Pback3>=1)||(Pm4>=1))||(Pm2>=1))) * !(EX(!(((((((Pout3>=1)&&(P1>=1))&&(Pout2>=1))||(Pm1>=1))||(Pm2>=1))||(((P3>=1)&&(Pout4>=1))&&(P2>=1))))))) * ((((Pback3>=1)||(((Pout3>=1)&&(P1>=1))&&(Pout2>=1)))||(Pback4>=1))||(Pm2>=1)))) * !((!(EX((((((Pm3>=1)||(Pback3>=1))||(Pback1>=1))||(Pm2>=1))||(Pback2>=1)))) * !(!(E(TRUE U !((Pm2>=1))))))))) + EG(!((!(EX((((((Pm3>=1)||(Pback3>=1))||(Pback1>=1))||(Pm2>=1))||(Pback2>=1)))) * !(!(E(TRUE U !((Pm2>=1))))))))))))))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 0/0/16

BK_TIME_CONFINEMENT_REACHED

--------------------
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="Kanban-PT-00100"
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 Kanban-PT-00100, 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 r121-tall-162075407100514"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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