fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r035-tajo-162038167700098
Last Updated
Jun 28, 2021

About the Execution of 2020-gold for BusinessProcesses-PT-09

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16247.611 3600000.00 3455453.00 151838.70 ??????????????F? normal

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.r035-tajo-162038167700098.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 gold2020
Input is BusinessProcesses-PT-09, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r035-tajo-162038167700098
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 480K
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 126K May 10 09:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.7K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 77K 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.6K Mar 28 15:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 28 15:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 15:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 15:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Mar 23 03:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 23 03:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 22 12:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K 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.7K 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 104K 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-09-CTLFireability-00
FORMULA_NAME BusinessProcesses-PT-09-CTLFireability-01
FORMULA_NAME BusinessProcesses-PT-09-CTLFireability-02
FORMULA_NAME BusinessProcesses-PT-09-CTLFireability-03
FORMULA_NAME BusinessProcesses-PT-09-CTLFireability-04
FORMULA_NAME BusinessProcesses-PT-09-CTLFireability-05
FORMULA_NAME BusinessProcesses-PT-09-CTLFireability-06
FORMULA_NAME BusinessProcesses-PT-09-CTLFireability-07
FORMULA_NAME BusinessProcesses-PT-09-CTLFireability-08
FORMULA_NAME BusinessProcesses-PT-09-CTLFireability-09
FORMULA_NAME BusinessProcesses-PT-09-CTLFireability-10
FORMULA_NAME BusinessProcesses-PT-09-CTLFireability-11
FORMULA_NAME BusinessProcesses-PT-09-CTLFireability-12
FORMULA_NAME BusinessProcesses-PT-09-CTLFireability-13
FORMULA_NAME BusinessProcesses-PT-09-CTLFireability-14
FORMULA_NAME BusinessProcesses-PT-09-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1620904510426

[2021-05-13 11:15:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-13 11:15:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 11:15:12] [INFO ] Load time of PNML (sax parser for PT used): 68 ms
[2021-05-13 11:15:12] [INFO ] Transformed 403 places.
[2021-05-13 11:15:12] [INFO ] Transformed 374 transitions.
[2021-05-13 11:15:12] [INFO ] Found NUPN structural information;
[2021-05-13 11:15:12] [INFO ] Parsed PT model containing 403 places and 374 transitions in 131 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 54 ms.
Incomplete random walk after 100000 steps, including 1045 resets, run finished after 323 ms. (steps per millisecond=309 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 374 rows 403 cols
[2021-05-13 11:15:12] [INFO ] Computed 65 place invariants in 22 ms
[2021-05-13 11:15:12] [INFO ] [Real]Absence check using 36 positive place invariants in 39 ms returned sat
[2021-05-13 11:15:12] [INFO ] [Real]Absence check using 36 positive and 29 generalized place invariants in 24 ms returned sat
[2021-05-13 11:15:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:15:13] [INFO ] [Real]Absence check using state equation in 381 ms returned sat
[2021-05-13 11:15:13] [INFO ] Deduced a trap composed of 13 places in 256 ms
[2021-05-13 11:15:13] [INFO ] Deduced a trap composed of 11 places in 170 ms
[2021-05-13 11:15:14] [INFO ] Deduced a trap composed of 11 places in 141 ms
[2021-05-13 11:15:14] [INFO ] Deduced a trap composed of 8 places in 82 ms
[2021-05-13 11:15:14] [INFO ] Deduced a trap composed of 12 places in 76 ms
[2021-05-13 11:15:14] [INFO ] Deduced a trap composed of 14 places in 78 ms
[2021-05-13 11:15:14] [INFO ] Deduced a trap composed of 17 places in 76 ms
[2021-05-13 11:15:14] [INFO ] Deduced a trap composed of 19 places in 76 ms
[2021-05-13 11:15:14] [INFO ] Deduced a trap composed of 27 places in 58 ms
[2021-05-13 11:15:14] [INFO ] Deduced a trap composed of 26 places in 54 ms
[2021-05-13 11:15:14] [INFO ] Deduced a trap composed of 27 places in 49 ms
[2021-05-13 11:15:14] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1373 ms
[2021-05-13 11:15:14] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 11:15:14] [INFO ] [Nat]Absence check using 36 positive place invariants in 42 ms returned sat
[2021-05-13 11:15:14] [INFO ] [Nat]Absence check using 36 positive and 29 generalized place invariants in 15 ms returned sat
[2021-05-13 11:15:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 11:15:15] [INFO ] [Nat]Absence check using state equation in 490 ms returned sat
[2021-05-13 11:15:15] [INFO ] Deduced a trap composed of 17 places in 100 ms
[2021-05-13 11:15:15] [INFO ] Deduced a trap composed of 10 places in 102 ms
[2021-05-13 11:15:15] [INFO ] Deduced a trap composed of 12 places in 78 ms
[2021-05-13 11:15:15] [INFO ] Deduced a trap composed of 8 places in 62 ms
[2021-05-13 11:15:15] [INFO ] Deduced a trap composed of 12 places in 58 ms
[2021-05-13 11:15:15] [INFO ] Deduced a trap composed of 28 places in 44 ms
[2021-05-13 11:15:16] [INFO ] Deduced a trap composed of 27 places in 56 ms
[2021-05-13 11:15:16] [INFO ] Deduced a trap composed of 14 places in 61 ms
[2021-05-13 11:15:16] [INFO ] Deduced a trap composed of 19 places in 49 ms
[2021-05-13 11:15:16] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 793 ms
[2021-05-13 11:15:16] [INFO ] Computed and/alt/rep : 373/1354/373 causal constraints in 34 ms.
[2021-05-13 11:15:17] [INFO ] Added : 215 causal constraints over 43 iterations in 1339 ms. Result :sat
[2021-05-13 11:15:17] [INFO ] [Real]Absence check using 36 positive place invariants in 28 ms returned sat
[2021-05-13 11:15:17] [INFO ] [Real]Absence check using 36 positive and 29 generalized place invariants in 12 ms returned sat
[2021-05-13 11:15:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:15:17] [INFO ] [Real]Absence check using state equation in 274 ms returned unsat
[2021-05-13 11:15:18] [INFO ] [Real]Absence check using 36 positive place invariants in 32 ms returned sat
[2021-05-13 11:15:18] [INFO ] [Real]Absence check using 36 positive and 29 generalized place invariants in 17 ms returned sat
[2021-05-13 11:15:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:15:18] [INFO ] [Real]Absence check using state equation in 449 ms returned unsat
[2021-05-13 11:15:18] [INFO ] [Real]Absence check using 36 positive place invariants in 29 ms returned sat
[2021-05-13 11:15:18] [INFO ] [Real]Absence check using 36 positive and 29 generalized place invariants in 17 ms returned sat
[2021-05-13 11:15:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:15:19] [INFO ] [Real]Absence check using state equation in 382 ms returned unsat
[2021-05-13 11:15:19] [INFO ] [Real]Absence check using 36 positive place invariants in 34 ms returned sat
[2021-05-13 11:15:19] [INFO ] [Real]Absence check using 36 positive and 29 generalized place invariants in 16 ms returned sat
[2021-05-13 11:15:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:15:19] [INFO ] [Real]Absence check using state equation in 436 ms returned unsat
[2021-05-13 11:15:19] [INFO ] [Real]Absence check using 36 positive place invariants in 21 ms returned sat
[2021-05-13 11:15:19] [INFO ] [Real]Absence check using 36 positive and 29 generalized place invariants in 12 ms returned sat
[2021-05-13 11:15:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:15:20] [INFO ] [Real]Absence check using state equation in 332 ms returned unsat
[2021-05-13 11:15:20] [INFO ] [Real]Absence check using 36 positive place invariants in 34 ms returned sat
[2021-05-13 11:15:20] [INFO ] [Real]Absence check using 36 positive and 29 generalized place invariants in 20 ms returned sat
[2021-05-13 11:15:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:15:20] [INFO ] [Real]Absence check using state equation in 502 ms returned unsat
[2021-05-13 11:15:20] [INFO ] [Real]Absence check using 36 positive place invariants in 22 ms returned sat
[2021-05-13 11:15:20] [INFO ] [Real]Absence check using 36 positive and 29 generalized place invariants in 15 ms returned sat
[2021-05-13 11:15:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:15:21] [INFO ] [Real]Absence check using state equation in 719 ms returned sat
[2021-05-13 11:15:21] [INFO ] Deduced a trap composed of 17 places in 205 ms
[2021-05-13 11:15:21] [INFO ] Deduced a trap composed of 15 places in 122 ms
[2021-05-13 11:15:21] [INFO ] Deduced a trap composed of 17 places in 79 ms
[2021-05-13 11:15:22] [INFO ] Deduced a trap composed of 36 places in 66 ms
[2021-05-13 11:15:22] [INFO ] Deduced a trap composed of 24 places in 52 ms
[2021-05-13 11:15:22] [INFO ] Deduced a trap composed of 39 places in 55 ms
[2021-05-13 11:15:22] [INFO ] Deduced a trap composed of 28 places in 44 ms
[2021-05-13 11:15:22] [INFO ] Deduced a trap composed of 20 places in 58 ms
[2021-05-13 11:15:22] [INFO ] Deduced a trap composed of 19 places in 33 ms
[2021-05-13 11:15:22] [INFO ] Deduced a trap composed of 28 places in 41 ms
[2021-05-13 11:15:22] [INFO ] Deduced a trap composed of 27 places in 36 ms
[2021-05-13 11:15:22] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1022 ms
[2021-05-13 11:15:22] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 11:15:22] [INFO ] [Nat]Absence check using 36 positive place invariants in 42 ms returned sat
[2021-05-13 11:15:22] [INFO ] [Nat]Absence check using 36 positive and 29 generalized place invariants in 25 ms returned sat
[2021-05-13 11:15:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 11:15:23] [INFO ] [Nat]Absence check using state equation in 596 ms returned sat
[2021-05-13 11:15:23] [INFO ] Deduced a trap composed of 20 places in 45 ms
[2021-05-13 11:15:23] [INFO ] Deduced a trap composed of 17 places in 30 ms
[2021-05-13 11:15:23] [INFO ] Deduced a trap composed of 16 places in 23 ms
[2021-05-13 11:15:23] [INFO ] Deduced a trap composed of 23 places in 29 ms
[2021-05-13 11:15:23] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 191 ms
[2021-05-13 11:15:23] [INFO ] Computed and/alt/rep : 373/1354/373 causal constraints in 15 ms.
[2021-05-13 11:15:25] [INFO ] Added : 263 causal constraints over 53 iterations in 1819 ms. Result :sat
Successfully simplified 6 atomic propositions for a total of 6 simplifications.
[2021-05-13 11:15:25] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2021-05-13 11:15:25] [INFO ] Flatten gal took : 81 ms
[2021-05-13 11:15:25] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2021-05-13 11:15:25] [INFO ] Flatten gal took : 34 ms
FORMULA BusinessProcesses-PT-09-CTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-13 11:15:25] [INFO ] Applying decomposition
[2021-05-13 11:15:25] [INFO ] Flatten gal took : 31 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/convert-linux64, -i, /tmp/graph199311101251058699.txt, -o, /tmp/graph199311101251058699.bin, -w, /tmp/graph199311101251058699.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph199311101251058699.bin, -l, -1, -v, -w, /tmp/graph199311101251058699.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-13 11:15:25] [INFO ] Decomposing Gal with order
[2021-05-13 11:15:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-13 11:15:26] [INFO ] Removed a total of 235 redundant transitions.
[2021-05-13 11:15:26] [INFO ] Flatten gal took : 89 ms
[2021-05-13 11:15:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 7 ms.
[2021-05-13 11:15:26] [INFO ] Time to serialize gal into /home/mcc/execution/CTLFireability.pnml.gal : 12 ms
[2021-05-13 11:15:26] [INFO ] Time to serialize properties into /home/mcc/execution/CTLFireability.ctl : 7 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /home/mcc/execution/CTLFireability.pnml.gal, -t, CGAL, -ctl, /home/mcc/execution/CTLFireability.ctl], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /home/mcc/execution/CTLFireability.pnml.gal -t CGAL -ctl /home/mcc/execution/CTLFireability.ctl
No direction supplied, using forward translation only.
Parsed 15 CTL formulae.
built 54 ordering constraints for composite.
built 12 ordering constraints for composite.
built 7 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 20 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 4 ordering constraints for composite.
built 18 ordering constraints for composite.
built 7 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 6 ordering constraints for composite.
built 4 ordering constraints for composite.
built 20 ordering constraints for composite.
built 15 ordering constraints for composite.
built 7 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 13 ordering constraints for composite.
built 12 ordering constraints for composite.
built 8 ordering constraints for composite.
built 48 ordering constraints for composite.
built 11 ordering constraints for composite.
built 4 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 22 ordering constraints for composite.
built 18 ordering constraints for composite.
built 7 ordering constraints for composite.
built 16 ordering constraints for composite.
built 16 ordering constraints for composite.
built 6 ordering constraints for composite.
built 9 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 43 ordering constraints for composite.
built 31 ordering constraints for composite.
built 25 ordering constraints for composite.
built 19 ordering constraints for composite.
built 7 ordering constraints for composite.
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,7.52257e+18,39.0334,756984,8022,68,1.03308e+06,693,1036,2.75262e+06,73,2051,0


Converting to forward existential form...Done !
original formula: (AF(AG((((((((i11.i0.u19.p49!=1)&&((i12.u38.p96!=1)||(i12.u132.p340!=1)))&&(i0.u116.p296!=1))&&(i16.u37.p94!=1))||(((((((((i1.i0.u10.p23!=1)||(i8.i1.u79.p199!=1))||(i15.u146.p368!=1))&&(i15.u141.p358!=1))&&(i2.i0.u14.p36!=1))&&(i13.i2.u100.p256!=1))&&(((i12.u32.p105!=1)||(i16.u104.p265!=1))||(i16.u131.p339!=1)))&&(((i3.i0.u29.p73!=1)||(i13.i1.u98.p249!=1))||(i15.u146.p368!=1)))&&(i0.u12.p31!=1)))||(((i3.i1.u24.p64!=1)&&(i15.u123.p311!=1))&&(i4.i0.u3.p8!=1))) + !(EG((((((((i7.i2.u108.p276==1)||(i4.i1.u52.p133==1))||(i15.u113.p284==1))||(((i1.i0.u11.p28==1)&&(i1.i1.u77.p195==1))&&(i1.i2.u117.p301==1)))||(i15.u112.p285==1))||(i1.i2.u117.p298==1))||(i11.i4.u93.p236==1))))))) + (AF((i15.u112.p286==1)) * !(AF((i1.i1.u77.p193==1)))))
=> equivalent forward existential formula: ([FwdG((Init * !(!(EG(!(!(E(TRUE U !((((((((i11.i0.u19.p49!=1)&&((i12.u38.p96!=1)||(i12.u132.p340!=1)))&&(i0.u116.p296!=1))&&(i16.u37.p94!=1))||(((((((((i1.i0.u10.p23!=1)||(i8.i1.u79.p199!=1))||(i15.u146.p368!=1))&&(i15.u141.p358!=1))&&(i2.i0.u14.p36!=1))&&(i13.i2.u100.p256!=1))&&(((i12.u32.p105!=1)||(i16.u104.p265!=1))||(i16.u131.p339!=1)))&&(((i3.i0.u29.p73!=1)||(i13.i1.u98.p249!=1))||(i15.u146.p368!=1)))&&(i0.u12.p31!=1)))||(((i3.i1.u24.p64!=1)&&(i15.u123.p311!=1))&&(i4.i0.u3.p8!=1))) + !(EG((((((((i7.i2.u108.p276==1)||(i4.i1.u52.p133==1))||(i15.u113.p284==1))||(((i1.i0.u11.p28==1)&&(i1.i1.u77.p195==1))&&(i1.i2.u117.p301==1)))||(i15.u112.p285==1))||(i1.i2.u117.p298==1))||(i11.i4.u93.p236==1))))))))))))),!((i15.u112.p286==1)))] = FALSE * [((Init * !(!(EG(!(!(E(TRUE U !((((((((i11.i0.u19.p49!=1)&&((i12.u38.p96!=1)||(i12.u132.p340!=1)))&&(i0.u116.p296!=1))&&(i16.u37.p94!=1))||(((((((((i1.i0.u10.p23!=1)||(i8.i1.u79.p199!=1))||(i15.u146.p368!=1))&&(i15.u141.p358!=1))&&(i2.i0.u14.p36!=1))&&(i13.i2.u100.p256!=1))&&(((i12.u32.p105!=1)||(i16.u104.p265!=1))||(i16.u131.p339!=1)))&&(((i3.i0.u29.p73!=1)||(i13.i1.u98.p249!=1))||(i15.u146.p368!=1)))&&(i0.u12.p31!=1)))||(((i3.i1.u24.p64!=1)&&(i15.u123.p311!=1))&&(i4.i0.u3.p8!=1))) + !(EG((((((((i7.i2.u108.p276==1)||(i4.i1.u52.p133==1))||(i15.u113.p284==1))||(((i1.i0.u11.p28==1)&&(i1.i1.u77.p195==1))&&(i1.i2.u117.p301==1)))||(i15.u112.p285==1))||(i1.i2.u117.p298==1))||(i11.i4.u93.p236==1))))))))))))) * !(EG(!((i1.i1.u77.p193==1)))))] = FALSE)
Reverse transition relation is NOT exact ! Due to transitions t35, t37, t39, t203, t208, t210, t249, t255, t265, i0.t261, i0.t245, i0.u7.t273, i0.u12.t264, i0.u22.t248, i1.i0.t270, i1.i0.u10.t268, i1.i0.u11.t266, i1.i1.t169, i1.i1.u77.t170, i1.i2.t78, i1.i2.u117.t82, i2.i0.t260, i3.t233, i3.i0.t236, i3.i0.t238, i3.i0.t240, i3.i1.t231, i3.i1.t244, i4.i0.u50.t202, i4.i0.u54.t194, i4.i0.u56.t190, i4.i1.u52.t198, i5.t179, i5.u58.t186, i5.u61.t182, i6.t172, i6.u74.t173, i7.i0.u63.t178, i7.i2.t105, i7.i2.u109.t106, i8.i1.t165, i8.i1.u79.t166, i8.i2.t157, i8.i2.u82.t158, i8.i3.t153, i8.i3.u85.t154, i8.i4.t133, i8.i4.u94.t134, i9.t161, i9.u80.t162, i10.t149, i10.u87.t150, i11.i0.u18.t254, i11.i2.t145, i11.i2.u89.t146, i11.i3.t141, i11.i3.u91.t142, i11.i4.t137, i11.i4.u92.t138, i12.t129, i12.u97.t130, i13.i1.t125, i13.i1.u98.t126, i13.i2.t121, i13.i2.u101.t122, i13.i3.t109, i13.i3.u107.t110, i14.i0.t117, i14.i0.u102.t118, i15.t99, i15.t92, i15.t87, i15.t85, i15.t80, i15.t76, i15.t73, i15.t71, i15.t64, i15.t61, i15.t59, i15.t32, i15.t29, i15.t26, i15.t23, i15.t20, i15.t17, i15.t14, i15.u146.t12, i15.u146.t43, i15.u146.t47, i15.u146.t51, i15.u146.t57, i15.u146.t69, i16.t206, i16.t113, i16.u33.t214, i16.u33.t218, i16.u33.t222, i16.u33.t228, i16.u104.t114, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :36/238/100/374
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found a local SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Detected timeout of ITS tools.
[2021-05-13 11:35:30] [INFO ] Applying decomposition
[2021-05-13 11:35:30] [INFO ] Flatten gal took : 17 ms
[2021-05-13 11:35:30] [INFO ] Decomposing Gal with order
[2021-05-13 11:35:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-13 11:35:30] [INFO ] Removed a total of 117 redundant transitions.
[2021-05-13 11:35:30] [INFO ] Flatten gal took : 28 ms
[2021-05-13 11:35:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 72 labels/synchronizations in 59 ms.
[2021-05-13 11:35:30] [INFO ] Time to serialize gal into /home/mcc/execution/CTLFireability.pnml.gal : 6 ms
[2021-05-13 11:35:30] [INFO ] Time to serialize properties into /home/mcc/execution/CTLFireability.ctl : 15 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /home/mcc/execution/CTLFireability.pnml.gal, -t, CGAL, -ctl, /home/mcc/execution/CTLFireability.ctl], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /home/mcc/execution/CTLFireability.pnml.gal -t CGAL -ctl /home/mcc/execution/CTLFireability.ctl
No direction supplied, using forward translation only.
Parsed 15 CTL formulae.
built 2 ordering constraints for composite.
built 88 ordering constraints for composite.
built 52 ordering constraints for composite.
built 51 ordering constraints for composite.
built 50 ordering constraints for composite.
built 48 ordering constraints for composite.
built 46 ordering constraints for composite.
built 44 ordering constraints for composite.
built 42 ordering constraints for composite.
built 40 ordering constraints for composite.
built 38 ordering constraints for composite.
built 21 ordering constraints for composite.
built 17 ordering constraints for composite.
built 15 ordering constraints for composite.
built 12 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 25 ordering constraints for composite.
built 6 ordering constraints for composite.
built 38 ordering constraints for composite.
built 36 ordering constraints for composite.
built 34 ordering constraints for composite.
built 32 ordering constraints for composite.
built 30 ordering constraints for composite.
built 28 ordering constraints for composite.
built 26 ordering constraints for composite.
built 24 ordering constraints for composite.
built 22 ordering constraints for composite.
built 20 ordering constraints for composite.
built 18 ordering constraints for composite.
built 16 ordering constraints for composite.
built 14 ordering constraints for composite.
built 12 ordering constraints for composite.
built 10 ordering constraints for composite.
built 8 ordering constraints for composite.
built 6 ordering constraints for composite.
built 59 ordering constraints for composite.
built 6 ordering constraints for composite.
Detected timeout of ITS tools.
[2021-05-13 11:55:36] [INFO ] Flatten gal took : 568 ms
[2021-05-13 11:55:37] [INFO ] Input system was already deterministic with 374 transitions.
[2021-05-13 11:55:37] [INFO ] Transformed 403 places.
[2021-05-13 11:55:37] [INFO ] Transformed 374 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit//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-13 11:56:07] [INFO ] Time to serialize gal into /home/mcc/execution/CTLFireability.pnml.gal : 5 ms
[2021-05-13 11:56:07] [INFO ] Time to serialize properties into /home/mcc/execution/CTLFireability.ctl : 4 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /home/mcc/execution/CTLFireability.pnml.gal, -t, CGAL, -ctl, /home/mcc/execution/CTLFireability.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.202005100927/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /home/mcc/execution/CTLFireability.pnml.gal -t CGAL -ctl /home/mcc/execution/CTLFireability.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 15 CTL formulae.

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination CTLFireability -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6

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-09"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="gold2020"
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 gold2020"
echo " Input is BusinessProcesses-PT-09, 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 r035-tajo-162038167700098"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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