Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2021-input.r026-tajo-162038143700337.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/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 BusinessProcesses-PT-03, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r026-tajo-162038143700337
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 452K
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 141K May 10 09:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.2K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 81K May 10 09:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Mar 28 15:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 15:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 15:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 15:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Mar 23 03:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 23 03:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 22 12:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 22 12:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 63K 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 BusinessProcesses-PT-03-CTLCardinality-00
FORMULA_NAME BusinessProcesses-PT-03-CTLCardinality-01
FORMULA_NAME BusinessProcesses-PT-03-CTLCardinality-02
FORMULA_NAME BusinessProcesses-PT-03-CTLCardinality-03
FORMULA_NAME BusinessProcesses-PT-03-CTLCardinality-04
FORMULA_NAME BusinessProcesses-PT-03-CTLCardinality-05
FORMULA_NAME BusinessProcesses-PT-03-CTLCardinality-06
FORMULA_NAME BusinessProcesses-PT-03-CTLCardinality-07
FORMULA_NAME BusinessProcesses-PT-03-CTLCardinality-08
FORMULA_NAME BusinessProcesses-PT-03-CTLCardinality-09
FORMULA_NAME BusinessProcesses-PT-03-CTLCardinality-10
FORMULA_NAME BusinessProcesses-PT-03-CTLCardinality-11
FORMULA_NAME BusinessProcesses-PT-03-CTLCardinality-12
FORMULA_NAME BusinessProcesses-PT-03-CTLCardinality-13
FORMULA_NAME BusinessProcesses-PT-03-CTLCardinality-14
FORMULA_NAME BusinessProcesses-PT-03-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1620761880786

Running Version 0
[2021-05-11 19:38:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -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-11 19:38:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-11 19:38:02] [INFO ] Load time of PNML (sax parser for PT used): 49 ms
[2021-05-11 19:38:02] [INFO ] Transformed 274 places.
[2021-05-11 19:38:02] [INFO ] Transformed 237 transitions.
[2021-05-11 19:38:02] [INFO ] Found NUPN structural information;
[2021-05-11 19:38:02] [INFO ] Parsed PT model containing 274 places and 237 transitions in 86 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 16 ms.
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 1 transitions.
Support contains 269 out of 273 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 273/273 places, 236/236 transitions.
Applied a total of 0 rules in 11 ms. Remains 273 /273 variables (removed 0) and now considering 236/236 (removed 0) transitions.
// Phase 1: matrix 236 rows 273 cols
[2021-05-11 19:38:02] [INFO ] Computed 43 place invariants in 13 ms
[2021-05-11 19:38:02] [INFO ] Implicit Places using invariants in 179 ms returned []
// Phase 1: matrix 236 rows 273 cols
[2021-05-11 19:38:02] [INFO ] Computed 43 place invariants in 10 ms
[2021-05-11 19:38:03] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 339 ms to find 0 implicit places.
// Phase 1: matrix 236 rows 273 cols
[2021-05-11 19:38:03] [INFO ] Computed 43 place invariants in 5 ms
[2021-05-11 19:38:03] [INFO ] Dead Transitions using invariants and state equation in 141 ms returned []
Finished structural reductions, in 1 iterations. Remains : 273/273 places, 236/236 transitions.
[2021-05-11 19:38:03] [INFO ] Flatten gal took : 41 ms
[2021-05-11 19:38:03] [INFO ] Flatten gal took : 15 ms
[2021-05-11 19:38:03] [INFO ] Input system was already deterministic with 236 transitions.
Incomplete random walk after 100000 steps, including 1192 resets, run finished after 1371 ms. (steps per millisecond=72 ) properties (out of 98) seen :34
Running SMT prover for 64 properties.
// Phase 1: matrix 236 rows 273 cols
[2021-05-11 19:38:04] [INFO ] Computed 43 place invariants in 8 ms
[2021-05-11 19:38:05] [INFO ] SMT Verify possible in real domain returnedunsat :49 sat :0 real:15
[2021-05-11 19:38:05] [INFO ] [Nat]Absence check using 31 positive place invariants in 8 ms returned sat
[2021-05-11 19:38:05] [INFO ] [Nat]Absence check using 31 positive and 12 generalized place invariants in 4 ms returned sat
[2021-05-11 19:38:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 19:38:05] [INFO ] [Nat]Absence check using state equation in 132 ms returned unsat :9 sat :55
Attempting to minimize the solution found.
Minimization took 76 ms.
[2021-05-11 19:38:05] [INFO ] SMT Verify possible in nat domain returned unsat :9 sat :55
Successfully simplified 58 atomic propositions for a total of 16 simplifications.
[2021-05-11 19:38:05] [INFO ] Initial state test concluded for 1 properties.
FORMULA BusinessProcesses-PT-03-CTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Graph (complete) has 522 edges and 273 vertex of which 271 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Discarding 2 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 30 place count 270 transition count 206
Reduce places removed 29 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 35 rules applied. Total rules applied 65 place count 241 transition count 200
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 71 place count 235 transition count 200
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 38 Pre rules applied. Total rules applied 71 place count 235 transition count 162
Deduced a syphon composed of 38 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 3 with 79 rules applied. Total rules applied 150 place count 194 transition count 162
Discarding 27 places :
Symmetric choice reduction at 3 with 27 rule applications. Total rules 177 place count 167 transition count 135
Iterating global reduction 3 with 27 rules applied. Total rules applied 204 place count 167 transition count 135
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 206 place count 167 transition count 133
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 207 place count 166 transition count 133
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 207 place count 166 transition count 132
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 209 place count 165 transition count 132
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 5 with 72 rules applied. Total rules applied 281 place count 129 transition count 96
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 282 place count 129 transition count 95
Applied a total of 282 rules in 72 ms. Remains 129 /273 variables (removed 144) and now considering 95/236 (removed 141) transitions.
[2021-05-11 19:38:05] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2021-05-11 19:38:05] [INFO ] Flatten gal took : 10 ms
FORMULA BusinessProcesses-PT-03-CTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-11 19:38:05] [INFO ] Flatten gal took : 8 ms
[2021-05-11 19:38:05] [INFO ] Input system was already deterministic with 95 transitions.
Graph (trivial) has 152 edges and 273 vertex of which 8 / 273 are part of one of the 1 SCC in 2 ms
Free SCC test removed 7 places
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (complete) has 513 edges and 266 vertex of which 264 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 52 place count 263 transition count 176
Reduce places removed 50 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 58 rules applied. Total rules applied 110 place count 213 transition count 168
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 118 place count 205 transition count 168
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 31 Pre rules applied. Total rules applied 118 place count 205 transition count 137
Deduced a syphon composed of 31 places in 0 ms
Ensure Unique test removed 7 places
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 69 rules applied. Total rules applied 187 place count 167 transition count 137
Discarding 32 places :
Symmetric choice reduction at 3 with 32 rule applications. Total rules 219 place count 135 transition count 105
Iterating global reduction 3 with 32 rules applied. Total rules applied 251 place count 135 transition count 105
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 251 place count 135 transition count 104
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 253 place count 134 transition count 104
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 337 place count 92 transition count 62
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 3 with 2 rules applied. Total rules applied 339 place count 91 transition count 61
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 340 place count 90 transition count 60
Applied a total of 340 rules in 35 ms. Remains 90 /273 variables (removed 183) and now considering 60/236 (removed 176) transitions.
[2021-05-11 19:38:05] [INFO ] Flatten gal took : 4 ms
[2021-05-11 19:38:05] [INFO ] Flatten gal took : 4 ms
[2021-05-11 19:38:05] [INFO ] Input system was already deterministic with 60 transitions.
[2021-05-11 19:38:05] [INFO ] Flatten gal took : 4 ms
[2021-05-11 19:38:05] [INFO ] Flatten gal took : 4 ms
[2021-05-11 19:38:05] [INFO ] Time to serialize gal into /tmp/CTLCardinality819331232819292178.gal : 2 ms
[2021-05-11 19:38:05] [INFO ] Time to serialize properties into /tmp/CTLCardinality700937180250995377.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/CTLCardinality819331232819292178.gal, -t, CGAL, -ctl, /tmp/CTLCardinality700937180250995377.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/CTLCardinality819331232819292178.gal -t CGAL -ctl /tmp/CTLCardinality700937180250995377.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,3456,0.036447,5872,2,1397,5,4512,6,0,418,5364,0


Converting to forward existential form...Done !
original formula: EF(AG(EF((((((((((p52+p144)+p84)+p83)+p242)+p241)+p32)+p193)<=(p214+p95))||((((p225+p101)+p7)+p181)<=(((((((p221+p75)+p266)+p210)+p162)+p159)+p182)+p91))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(E(TRUE U (((((((((p52+p144)+p84)+p83)+p242)+p241)+p32)+p193)<=(p214+p95))||((((p225+p101)+p7)+p181)<=(((((((p221+p75)+p266)+p210)+p162)+p159)+p182)+p91))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t2, t5, t7, t9, t10, t12, t24, t25, t27, t28, t29, t30, t31, t34, t39, t44, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/44/16/60
(forward)formula 0,1,0.298292,18400,1,0,123,60134,140,66,2865,57792,137
FORMULA BusinessProcesses-PT-03-CTLCardinality-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Graph (trivial) has 127 edges and 273 vertex of which 8 / 273 are part of one of the 1 SCC in 1 ms
Free SCC test removed 7 places
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (complete) has 513 edges and 266 vertex of which 264 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 42 place count 264 transition count 187
Reduce places removed 40 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 1 with 49 rules applied. Total rules applied 91 place count 224 transition count 178
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 100 place count 215 transition count 178
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 24 Pre rules applied. Total rules applied 100 place count 215 transition count 154
Deduced a syphon composed of 24 places in 1 ms
Ensure Unique test removed 4 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 52 rules applied. Total rules applied 152 place count 187 transition count 154
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 176 place count 163 transition count 130
Iterating global reduction 3 with 24 rules applied. Total rules applied 200 place count 163 transition count 130
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 200 place count 163 transition count 129
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 202 place count 162 transition count 129
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 282 place count 122 transition count 89
Applied a total of 282 rules in 44 ms. Remains 122 /273 variables (removed 151) and now considering 89/236 (removed 147) transitions.
[2021-05-11 19:38:06] [INFO ] Flatten gal took : 10 ms
[2021-05-11 19:38:06] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA BusinessProcesses-PT-03-CTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-11 19:38:06] [INFO ] Flatten gal took : 9 ms
[2021-05-11 19:38:06] [INFO ] Input system was already deterministic with 89 transitions.
[2021-05-11 19:38:06] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2021-05-11 19:38:06] [INFO ] Flatten gal took : 17 ms
[2021-05-11 19:38:06] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA BusinessProcesses-PT-03-CTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-03-CTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-03-CTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-03-CTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-11 19:38:06] [INFO ] Flatten gal took : 15 ms
[2021-05-11 19:38:06] [INFO ] Applying decomposition
[2021-05-11 19:38:06] [INFO ] Flatten gal took : 14 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/graph12006850499426127294.txt, -o, /tmp/graph12006850499426127294.bin, -w, /tmp/graph12006850499426127294.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/graph12006850499426127294.bin, -l, -1, -v, -w, /tmp/graph12006850499426127294.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-11 19:38:06] [INFO ] Decomposing Gal with order
[2021-05-11 19:38:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-11 19:38:06] [INFO ] Removed a total of 55 redundant transitions.
[2021-05-11 19:38:06] [INFO ] Flatten gal took : 65 ms
[2021-05-11 19:38:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 12 ms.
[2021-05-11 19:38:06] [INFO ] Time to serialize gal into /tmp/CTLCardinality3891724507692351657.gal : 11 ms
[2021-05-11 19:38:06] [INFO ] Time to serialize properties into /tmp/CTLCardinality1779588683474183801.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/CTLCardinality3891724507692351657.gal, -t, CGAL, -ctl, /tmp/CTLCardinality1779588683474183801.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/CTLCardinality3891724507692351657.gal -t CGAL -ctl /tmp/CTLCardinality1779588683474183801.ctl --gen-order FOLLOW
No direction supplied, using forward translation only.
Parsed 8 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.4794e+13,1.00599,41684,2,27705,5,94842,6,0,1322,172933,0


Converting to forward existential form...Done !
original formula: (AG(EX(EF(((((((((((gi4.gu30.p238+gi4.gu25.p154)+gi7.gu35.p255)+gi3.gu49.p209)+gi2.gu50.p26)+gi4.gu30.p13)+gi4.gu30.p98)+gi4.gu30.p115)+gi4.gu30.p119)+gi4.gu30.p217)<=1)))) * EF(AX(FALSE)))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(EX(E(TRUE U ((((((((((gi4.gu30.p238+gi4.gu25.p154)+gi7.gu35.p255)+gi3.gu49.p209)+gi2.gu50.p26)+gi4.gu30.p13)+gi4.gu30.p98)+gi4.gu30.p115)+gi4.gu30.p119)+gi4.gu30.p217)<=1)))))] = FALSE * [(Init * !(E(TRUE U !(EX(!(FALSE))))))] = FALSE)
Reverse transition relation is NOT exact ! Due to transitions gi0.gu2.t194, gi0.gu3.t177, gi0.gu37.t114, gi0.gu45.t95, gi0.t94, gi1.gu60.t129, gi1.gu60.t130, gi2.gu47.t90, gi2.t171, gi3.gu9.t135, gi4.gu15.t151, gi6.gu20.t143, gi6.gu44.t98, gi6.gu44.t99, gi6.gu51.t75, gi6.gu52.t70, gi6.gu40.t107, gi6.gu46.t192, gi6.gu57.t44, gi6.t106, gi6.t74, gi6.t71, gi6.t38, gi7.t165, gi8.gi0.gi1.gu36.t119, gi8.gi0.gi1.t118, gi8.gi1.gi0.gu6.t181, gi8.gi1.gi0.gu7.t179, gi8.gi1.gi0.t185, gi8.gi1.gi1.gu12.t161, gi8.gi1.gi2.gu18.t147, gi8.gi1.gi3.gu22.t139, gi8.gi1.gi4.gu32.t123, gi8.gi1.gi4.t122, gi8.gi1.gi5.gu42.t103, gi8.gi1.gi5.t102, gi8.gi1.gi6.gu31.t126, gi8.gi1.gi6.gu31.t127, gi8.gi1.gi6.gu48.t83, gi8.gi1.gi6.gu53.t1, gi8.gi1.gi6.gu53.t18, gi8.gi1.gi6.gu53.t47, gi8.gi1.gi6.gu56.t49, gi8.gi1.gi6.t55, gi8.gi1.gi6.t51, gi8.gi1.gi6.t33, gi8.gi1.gi6.t21, gi8.gi1.gi6.t12, gi8.gi1.gi6.t3, t6, t9, t23, t31, t36, t42, t53, t60, t66, t78, t79, t82, t86, t87, t91, t110, t111, t115, t136, t140, t155, t156, t159, t162, t167, t168, t173, t178, t183, t186, t189, t190, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/150/81/231
(forward)formula 0,0,74.2017,1865624,1,0,649,7.83454e+06,483,294,7124,1.00839e+07,622
FORMULA BusinessProcesses-PT-03-CTLCardinality-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EG(E(((!(E(((((((gi6.gu43.p191+gi6.gu4.p173)+gi6.gu43.p157)+gi3.gu9.p263)+gi6.gu43.p108)+gi1.gu60.p225)<=((gi6.gu14.p193+gi4.gu25.p205)+gi6.gu43.p157)) U ((((gi3.gu9.p5+gi6.gu46.p49)+gi7.gu35.p44)+gi6.gu46.p169)<=((((gi0.gu3.p235+gi6.gu4.p162)+gi6.gu46.p100)+gi4.gu25.p176)+gi6.gu46.p18)))) * !(EG(((((((((gi1.gu60.p182+gi1.gu60.p225)+gi1.gu60.p22)+gi1.gu60.p32)+gi1.gu60.p242)+gi2.gu50.p185)+gi1.gu60.p64)+gi0.gu3.p206)<=((((gi1.gu60.p257+gi1.gu60.p120)+gi1.gu60.p117)+gi1.gu60.p201)+gi1.gu60.p68))))) * !(EX((((((((((gi7.gu35.p50+gi7.gu35.p241)+gi7.gu35.p65)+gi7.gu35.p252)+gi7.gu35.p255)+gi7.gu35.p198)+gi7.gu35.p101)+gi2.gu50.p43)+gi7.gu35.p265)<=(gi7.gu35.p44+gi7.gu35.p134))))) U AG(EX(((gi3.gu9.p263+gi2.gu50.p270)<=(((((gi2.gu50.p138+gi2.gu50.p27)+gi7.gu35.p252)+gi2.gu50.p2)+gi2.gu50.p199)+gi2.gu50.p185))))))
=> equivalent forward existential formula: [FwdG(Init,E(((!(E(((((((gi6.gu43.p191+gi6.gu4.p173)+gi6.gu43.p157)+gi3.gu9.p263)+gi6.gu43.p108)+gi1.gu60.p225)<=((gi6.gu14.p193+gi4.gu25.p205)+gi6.gu43.p157)) U ((((gi3.gu9.p5+gi6.gu46.p49)+gi7.gu35.p44)+gi6.gu46.p169)<=((((gi0.gu3.p235+gi6.gu4.p162)+gi6.gu46.p100)+gi4.gu25.p176)+gi6.gu46.p18)))) * !(EG(((((((((gi1.gu60.p182+gi1.gu60.p225)+gi1.gu60.p22)+gi1.gu60.p32)+gi1.gu60.p242)+gi2.gu50.p185)+gi1.gu60.p64)+gi0.gu3.p206)<=((((gi1.gu60.p257+gi1.gu60.p120)+gi1.gu60.p117)+gi1.gu60.p201)+gi1.gu60.p68))))) * !(EX((((((((((gi7.gu35.p50+gi7.gu35.p241)+gi7.gu35.p65)+gi7.gu35.p252)+gi7.gu35.p255)+gi7.gu35.p198)+gi7.gu35.p101)+gi2.gu50.p43)+gi7.gu35.p265)<=(gi7.gu35.p44+gi7.gu35.p134))))) U !(E(TRUE U !(EX(((gi3.gu9.p263+gi2.gu50.p270)<=(((((gi2.gu50.p138+gi2.gu50.p27)+gi7.gu35.p252)+gi2.gu50.p2)+gi2.gu50.p199)+gi2.gu50.p185))))))))] != FALSE
(forward)formula 1,0,222.433,2556480,1,0,745,1.1721e+07,21,309,4314,1.75942e+07,100
FORMULA BusinessProcesses-PT-03-CTLCardinality-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AX(!(EX(TRUE)))
=> equivalent forward existential formula: [(EY(EY(Init)) * TRUE)] = FALSE
(forward)formula 2,0,222.448,2556480,1,0,745,1.1721e+07,21,309,4549,1.75942e+07,102
FORMULA BusinessProcesses-PT-03-CTLCardinality-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AX(FALSE)
=> equivalent forward existential formula: [(EY(Init) * !(FALSE))] = FALSE
(forward)formula 3,0,222.449,2556480,1,0,745,1.1721e+07,21,309,4549,1.75942e+07,102
FORMULA BusinessProcesses-PT-03-CTLCardinality-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AG(EF(EX(TRUE)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U EX(TRUE))))] = FALSE
(forward)formula 4,0,223.307,2556480,1,0,745,1.1721e+07,21,309,4674,1.75942e+07,110
FORMULA BusinessProcesses-PT-03-CTLCardinality-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: (!(EF(AX(FALSE))) + (EG((EF((((((((((gi0.gu3.p17+gi0.gu3.p67)+gi0.gu3.p38)+gi0.gu3.p206)+gi0.gu3.p9)+gi0.gu3.p222)+gi0.gu3.p235)+gi0.gu3.p137)+gi0.gu3.p19)<=(((((gi0.gu3.p268+gi0.gu3.p186)+gi0.gu3.p109)+gi0.gu3.p223)+gi0.gu3.p102)+gi0.gu3.p166))) + ((((((((((gi4.gu25.p99+gi4.gu25.p3)+gi4.gu25.p85)+gi2.gu50.p41)+gi4.gu25.p205)+gi7.gu35.p265)+gi4.gu25.p124)+gi4.gu25.p154)+gi4.gu25.p139)+gi4.gu25.p176)>=1))) * !(EF((((((((((((gi2.gu50.p167+gi2.gu50.p129)+gi2.gu50.p41)+gi2.gu50.p254)+gi2.gu50.p2)+gi2.gu50.p1)+gi2.gu50.p144)+gi2.gu50.p23)+gi2.gu50.p224)+gi2.gu50.p149)>(((((gi2.gu50.p202+gi2.gu50.p26)+gi2.gu50.p185)+gi2.gu50.p43)+gi2.gu50.p60)+gi2.gu50.p243))&&(((gi4.gu25.p139+gi1.gu60.p22)+gi0.gu3.p206)>((((gi1.gu39.p73+gi1.gu39.p231)+gi1.gu39.p143)+gi2.gu50.p202)+gi3.gu9.p262)))))))
=> equivalent forward existential formula: ([((Init * !(!(E(TRUE U !(EX(!(FALSE))))))) * !(EG((E(TRUE U (((((((((gi0.gu3.p17+gi0.gu3.p67)+gi0.gu3.p38)+gi0.gu3.p206)+gi0.gu3.p9)+gi0.gu3.p222)+gi0.gu3.p235)+gi0.gu3.p137)+gi0.gu3.p19)<=(((((gi0.gu3.p268+gi0.gu3.p186)+gi0.gu3.p109)+gi0.gu3.p223)+gi0.gu3.p102)+gi0.gu3.p166))) + ((((((((((gi4.gu25.p99+gi4.gu25.p3)+gi4.gu25.p85)+gi2.gu50.p41)+gi4.gu25.p205)+gi7.gu35.p265)+gi4.gu25.p124)+gi4.gu25.p154)+gi4.gu25.p139)+gi4.gu25.p176)>=1)))))] = FALSE * [(FwdU((Init * !(!(E(TRUE U !(EX(!(FALSE))))))),TRUE) * (((((((((((gi2.gu50.p167+gi2.gu50.p129)+gi2.gu50.p41)+gi2.gu50.p254)+gi2.gu50.p2)+gi2.gu50.p1)+gi2.gu50.p144)+gi2.gu50.p23)+gi2.gu50.p224)+gi2.gu50.p149)>(((((gi2.gu50.p202+gi2.gu50.p26)+gi2.gu50.p185)+gi2.gu50.p43)+gi2.gu50.p60)+gi2.gu50.p243))&&(((gi4.gu25.p139+gi1.gu60.p22)+gi0.gu3.p206)>((((gi1.gu39.p73+gi1.gu39.p231)+gi1.gu39.p143)+gi2.gu50.p202)+gi3.gu9.p262))))] = FALSE)
(forward)formula 5,0,224.236,2556480,1,0,745,1.1721e+07,26,309,5464,1.75942e+07,113
FORMULA BusinessProcesses-PT-03-CTLCardinality-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EF((AF((((((((gi3.gu59.p175+gi2.gu50.p254)+gi3.gu9.p147)+gi3.gu59.p239)+gi7.gu35.p241)+gi1.gu60.p225)+gi3.gu9.p262)>gi3.gu59.p8)) * EG(!(AX((((((((gi3.gu9.p21+gi0.gu3.p67)+gi3.gu9.p51)+gi3.gu49.p168)+gi3.gu49.p194)+gi2.gu50.p1)+gi3.gu49.p122)<=(((((((((gi3.gu49.p187+gi0.gu3.p235)+gi3.gu49.p209)+gi3.gu49.p145)+gi7.gu35.p65)+gi0.gu3.p206)+gi3.gu49.p184)+gi3.gu9.p263)+gi3.gu49.p236)+gi3.gu9.p51)))))))
=> equivalent forward existential formula: [FwdG((FwdU(Init,TRUE) * !(EG(!((((((((gi3.gu59.p175+gi2.gu50.p254)+gi3.gu9.p147)+gi3.gu59.p239)+gi7.gu35.p241)+gi1.gu60.p225)+gi3.gu9.p262)>gi3.gu59.p8))))),!(!(EX(!((((((((gi3.gu9.p21+gi0.gu3.p67)+gi3.gu9.p51)+gi3.gu49.p168)+gi3.gu49.p194)+gi2.gu50.p1)+gi3.gu49.p122)<=(((((((((gi3.gu49.p187+gi0.gu3.p235)+gi3.gu49.p209)+gi3.gu49.p145)+gi7.gu35.p65)+gi0.gu3.p206)+gi3.gu49.p184)+gi3.gu9.p263)+gi3.gu49.p236)+gi3.gu9.p51)))))))] != FALSE
(forward)formula 6,1,247.206,2556480,1,0,752,1.1721e+07,37,362,5650,1.75942e+07,830
FORMULA BusinessProcesses-PT-03-CTLCardinality-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AG(((!(AX(FALSE)) + ((((((gi4.gu16.p172+gi4.gu16.p72)+gi4.gu16.p218)+gi4.gu16.p245)+gi2.gu50.p254)+gi4.gu25.p205)<=2)) + (((((((((((gi6.gu4.p151+gi6.gu4.p162)+gi1.gu60.p22)+gi6.gu4.p25)+gi6.gu4.p267)+gi6.gu4.p227)+gi6.gu4.p110)+gi6.gu4.p173)+gi6.gu4.p219)>=5)&&((((gi6.gu14.p193+gi6.gu14.p249)+gi6.gu14.p229)+gi6.gu14.p69)<=31))&&((((((((gi3.gu9.p95+gi3.gu9.p40)+gi3.gu9.p147)+gi3.gu9.p181)+gi3.gu9.p31)+gi3.gu9.p263)+gi0.gu3.p166)+gi3.gu9.p183)>((((((gi0.gu3.p186+gi3.gu9.p51)+gi0.gu3.p9)+gi3.gu9.p262)+gi3.gu9.p5)+gi3.gu9.p52)+gi3.gu9.p21)))))
=> equivalent forward existential formula: [(((FwdU(Init,TRUE) * !((((((((((((gi6.gu4.p151+gi6.gu4.p162)+gi1.gu60.p22)+gi6.gu4.p25)+gi6.gu4.p267)+gi6.gu4.p227)+gi6.gu4.p110)+gi6.gu4.p173)+gi6.gu4.p219)>=5)&&((((gi6.gu14.p193+gi6.gu14.p249)+gi6.gu14.p229)+gi6.gu14.p69)<=31))&&((((((((gi3.gu9.p95+gi3.gu9.p40)+gi3.gu9.p147)+gi3.gu9.p181)+gi3.gu9.p31)+gi3.gu9.p263)+gi0.gu3.p166)+gi3.gu9.p183)>((((((gi0.gu3.p186+gi3.gu9.p51)+gi0.gu3.p9)+gi3.gu9.p262)+gi3.gu9.p5)+gi3.gu9.p52)+gi3.gu9.p21))))) * !(((((((gi4.gu16.p172+gi4.gu16.p72)+gi4.gu16.p218)+gi4.gu16.p245)+gi2.gu50.p254)+gi4.gu25.p205)<=2))) * !(EX(!(FALSE))))] = FALSE
(forward)formula 7,1,247.257,2556480,1,0,752,1.1721e+07,39,362,5663,1.75942e+07,831
FORMULA BusinessProcesses-PT-03-CTLCardinality-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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


BK_STOP 1620762134879

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution CTLCardinality -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 CTLCardinality -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="BusinessProcesses-PT-03"
export BK_EXAMINATION="CTLCardinality"
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 BusinessProcesses-PT-03, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r026-tajo-162038143700337"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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