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-162038167700092.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-06, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r035-tajo-162038167700092
=====================================================================

--------------------
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 130K May 10 09:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.8K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 68K 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.2K Mar 28 15:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 28 15:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 28 15:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 15:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K 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.5K Mar 22 12:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K 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 85K 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-06-CTLFireability-00
FORMULA_NAME BusinessProcesses-PT-06-CTLFireability-01
FORMULA_NAME BusinessProcesses-PT-06-CTLFireability-02
FORMULA_NAME BusinessProcesses-PT-06-CTLFireability-03
FORMULA_NAME BusinessProcesses-PT-06-CTLFireability-04
FORMULA_NAME BusinessProcesses-PT-06-CTLFireability-05
FORMULA_NAME BusinessProcesses-PT-06-CTLFireability-06
FORMULA_NAME BusinessProcesses-PT-06-CTLFireability-07
FORMULA_NAME BusinessProcesses-PT-06-CTLFireability-08
FORMULA_NAME BusinessProcesses-PT-06-CTLFireability-09
FORMULA_NAME BusinessProcesses-PT-06-CTLFireability-10
FORMULA_NAME BusinessProcesses-PT-06-CTLFireability-11
FORMULA_NAME BusinessProcesses-PT-06-CTLFireability-12
FORMULA_NAME BusinessProcesses-PT-06-CTLFireability-13
FORMULA_NAME BusinessProcesses-PT-06-CTLFireability-14
FORMULA_NAME BusinessProcesses-PT-06-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1620904317637

[2021-05-13 11:11:59] [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:11:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 11:11:59] [INFO ] Load time of PNML (sax parser for PT used): 57 ms
[2021-05-13 11:11:59] [INFO ] Transformed 376 places.
[2021-05-13 11:11:59] [INFO ] Transformed 297 transitions.
[2021-05-13 11:11:59] [INFO ] Found NUPN structural information;
[2021-05-13 11:11:59] [INFO ] Parsed PT model containing 376 places and 297 transitions in 98 ms.
[2021-05-13 11:11:59] [INFO ] Reduced 1 identical enabling conditions.
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 1 transitions.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 29 ms.
Incomplete random walk after 100000 steps, including 1032 resets, run finished after 288 ms. (steps per millisecond=347 ) properties seen :[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, 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, 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, 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]
// Phase 1: matrix 296 rows 375 cols
[2021-05-13 11:11:59] [INFO ] Computed 81 place invariants in 17 ms
[2021-05-13 11:11:59] [INFO ] [Real]Absence check using 42 positive place invariants in 48 ms returned sat
[2021-05-13 11:11:59] [INFO ] [Real]Absence check using 42 positive and 39 generalized place invariants in 21 ms returned sat
[2021-05-13 11:11:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:12:00] [INFO ] [Real]Absence check using state equation in 304 ms returned sat
[2021-05-13 11:12:00] [INFO ] Deduced a trap composed of 76 places in 169 ms
[2021-05-13 11:12:00] [INFO ] Deduced a trap composed of 11 places in 127 ms
[2021-05-13 11:12:00] [INFO ] Deduced a trap composed of 10 places in 130 ms
[2021-05-13 11:12:00] [INFO ] Deduced a trap composed of 8 places in 112 ms
[2021-05-13 11:12:01] [INFO ] Deduced a trap composed of 29 places in 117 ms
[2021-05-13 11:12:01] [INFO ] Deduced a trap composed of 15 places in 110 ms
[2021-05-13 11:12:01] [INFO ] Deduced a trap composed of 17 places in 112 ms
[2021-05-13 11:12:01] [INFO ] Deduced a trap composed of 14 places in 128 ms
[2021-05-13 11:12:01] [INFO ] Deduced a trap composed of 17 places in 108 ms
[2021-05-13 11:12:01] [INFO ] Deduced a trap composed of 17 places in 118 ms
[2021-05-13 11:12:01] [INFO ] Deduced a trap composed of 16 places in 106 ms
[2021-05-13 11:12:01] [INFO ] Deduced a trap composed of 18 places in 155 ms
[2021-05-13 11:12:02] [INFO ] Deduced a trap composed of 23 places in 136 ms
[2021-05-13 11:12:02] [INFO ] Deduced a trap composed of 15 places in 100 ms
[2021-05-13 11:12:02] [INFO ] Deduced a trap composed of 18 places in 104 ms
[2021-05-13 11:12:02] [INFO ] Deduced a trap composed of 77 places in 97 ms
[2021-05-13 11:12:02] [INFO ] Deduced a trap composed of 19 places in 102 ms
[2021-05-13 11:12:02] [INFO ] Deduced a trap composed of 19 places in 136 ms
[2021-05-13 11:12:02] [INFO ] Deduced a trap composed of 20 places in 130 ms
[2021-05-13 11:12:03] [INFO ] Deduced a trap composed of 76 places in 107 ms
[2021-05-13 11:12:03] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 2782 ms
[2021-05-13 11:12:03] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 11:12:03] [INFO ] [Nat]Absence check using 42 positive place invariants in 51 ms returned sat
[2021-05-13 11:12:03] [INFO ] [Nat]Absence check using 42 positive and 39 generalized place invariants in 23 ms returned sat
[2021-05-13 11:12:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 11:12:03] [INFO ] [Nat]Absence check using state equation in 391 ms returned sat
[2021-05-13 11:12:03] [INFO ] Deduced a trap composed of 22 places in 153 ms
[2021-05-13 11:12:03] [INFO ] Deduced a trap composed of 11 places in 136 ms
[2021-05-13 11:12:04] [INFO ] Deduced a trap composed of 17 places in 135 ms
[2021-05-13 11:12:04] [INFO ] Deduced a trap composed of 10 places in 100 ms
[2021-05-13 11:12:04] [INFO ] Deduced a trap composed of 8 places in 97 ms
[2021-05-13 11:12:04] [INFO ] Deduced a trap composed of 14 places in 98 ms
[2021-05-13 11:12:04] [INFO ] Deduced a trap composed of 17 places in 128 ms
[2021-05-13 11:12:04] [INFO ] Deduced a trap composed of 16 places in 142 ms
[2021-05-13 11:12:04] [INFO ] Deduced a trap composed of 15 places in 152 ms
[2021-05-13 11:12:05] [INFO ] Deduced a trap composed of 23 places in 138 ms
[2021-05-13 11:12:05] [INFO ] Deduced a trap composed of 17 places in 115 ms
[2021-05-13 11:12:05] [INFO ] Deduced a trap composed of 76 places in 113 ms
[2021-05-13 11:12:05] [INFO ] Deduced a trap composed of 23 places in 112 ms
[2021-05-13 11:12:05] [INFO ] Deduced a trap composed of 16 places in 110 ms
[2021-05-13 11:12:05] [INFO ] Deduced a trap composed of 17 places in 98 ms
[2021-05-13 11:12:05] [INFO ] Deduced a trap composed of 21 places in 97 ms
[2021-05-13 11:12:05] [INFO ] Deduced a trap composed of 79 places in 97 ms
[2021-05-13 11:12:05] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 2344 ms
[2021-05-13 11:12:05] [INFO ] Computed and/alt/rep : 295/981/295 causal constraints in 16 ms.
[2021-05-13 11:12:07] [INFO ] Added : 286 causal constraints over 58 iterations in 1729 ms. Result :sat
[2021-05-13 11:12:07] [INFO ] [Real]Absence check using 42 positive place invariants in 40 ms returned sat
[2021-05-13 11:12:07] [INFO ] [Real]Absence check using 42 positive and 39 generalized place invariants in 41 ms returned sat
[2021-05-13 11:12:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:12:08] [INFO ] [Real]Absence check using state equation in 663 ms returned sat
[2021-05-13 11:12:08] [INFO ] Deduced a trap composed of 17 places in 139 ms
[2021-05-13 11:12:08] [INFO ] Deduced a trap composed of 16 places in 130 ms
[2021-05-13 11:12:09] [INFO ] Deduced a trap composed of 8 places in 169 ms
[2021-05-13 11:12:09] [INFO ] Deduced a trap composed of 8 places in 149 ms
[2021-05-13 11:12:09] [INFO ] Deduced a trap composed of 16 places in 128 ms
[2021-05-13 11:12:09] [INFO ] Deduced a trap composed of 11 places in 135 ms
[2021-05-13 11:12:09] [INFO ] Deduced a trap composed of 19 places in 123 ms
[2021-05-13 11:12:09] [INFO ] Deduced a trap composed of 27 places in 144 ms
[2021-05-13 11:12:09] [INFO ] Deduced a trap composed of 20 places in 134 ms
[2021-05-13 11:12:10] [INFO ] Deduced a trap composed of 23 places in 145 ms
[2021-05-13 11:12:10] [INFO ] Deduced a trap composed of 18 places in 110 ms
[2021-05-13 11:12:10] [INFO ] Deduced a trap composed of 15 places in 121 ms
[2021-05-13 11:12:10] [INFO ] Deduced a trap composed of 16 places in 129 ms
[2021-05-13 11:12:10] [INFO ] Deduced a trap composed of 11 places in 151 ms
[2021-05-13 11:12:10] [INFO ] Deduced a trap composed of 18 places in 95 ms
[2021-05-13 11:12:10] [INFO ] Deduced a trap composed of 24 places in 91 ms
[2021-05-13 11:12:11] [INFO ] Deduced a trap composed of 24 places in 118 ms
[2021-05-13 11:12:11] [INFO ] Deduced a trap composed of 24 places in 149 ms
[2021-05-13 11:12:11] [INFO ] Deduced a trap composed of 76 places in 155 ms
[2021-05-13 11:12:11] [INFO ] Deduced a trap composed of 18 places in 40 ms
[2021-05-13 11:12:11] [INFO ] Deduced a trap composed of 22 places in 48 ms
[2021-05-13 11:12:11] [INFO ] Deduced a trap composed of 20 places in 53 ms
[2021-05-13 11:12:11] [INFO ] Deduced a trap composed of 24 places in 37 ms
[2021-05-13 11:12:11] [INFO ] Deduced a trap composed of 22 places in 29 ms
[2021-05-13 11:12:11] [INFO ] Deduced a trap composed of 23 places in 20 ms
[2021-05-13 11:12:11] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 3399 ms
[2021-05-13 11:12:11] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 11:12:12] [INFO ] [Nat]Absence check using 42 positive place invariants in 45 ms returned sat
[2021-05-13 11:12:12] [INFO ] [Nat]Absence check using 42 positive and 39 generalized place invariants in 39 ms returned sat
[2021-05-13 11:12:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 11:12:12] [INFO ] [Nat]Absence check using state equation in 668 ms returned sat
[2021-05-13 11:12:12] [INFO ] Deduced a trap composed of 8 places in 129 ms
[2021-05-13 11:12:13] [INFO ] Deduced a trap composed of 8 places in 98 ms
[2021-05-13 11:12:13] [INFO ] Deduced a trap composed of 15 places in 99 ms
[2021-05-13 11:12:13] [INFO ] Deduced a trap composed of 29 places in 71 ms
[2021-05-13 11:12:13] [INFO ] Deduced a trap composed of 11 places in 68 ms
[2021-05-13 11:12:13] [INFO ] Deduced a trap composed of 19 places in 67 ms
[2021-05-13 11:12:13] [INFO ] Deduced a trap composed of 15 places in 53 ms
[2021-05-13 11:12:13] [INFO ] Deduced a trap composed of 21 places in 45 ms
[2021-05-13 11:12:13] [INFO ] Deduced a trap composed of 25 places in 43 ms
[2021-05-13 11:12:13] [INFO ] Deduced a trap composed of 21 places in 33 ms
[2021-05-13 11:12:13] [INFO ] Deduced a trap composed of 17 places in 27 ms
[2021-05-13 11:12:13] [INFO ] Deduced a trap composed of 23 places in 26 ms
[2021-05-13 11:12:13] [INFO ] Deduced a trap composed of 19 places in 18 ms
[2021-05-13 11:12:13] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1039 ms
[2021-05-13 11:12:13] [INFO ] Computed and/alt/rep : 295/981/295 causal constraints in 16 ms.
[2021-05-13 11:12:15] [INFO ] Added : 285 causal constraints over 57 iterations in 1744 ms. Result :sat
[2021-05-13 11:12:15] [INFO ] [Real]Absence check using 42 positive place invariants in 35 ms returned sat
[2021-05-13 11:12:15] [INFO ] [Real]Absence check using 42 positive and 39 generalized place invariants in 24 ms returned sat
[2021-05-13 11:12:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:12:16] [INFO ] [Real]Absence check using state equation in 389 ms returned sat
[2021-05-13 11:12:16] [INFO ] Deduced a trap composed of 10 places in 142 ms
[2021-05-13 11:12:16] [INFO ] Deduced a trap composed of 12 places in 67 ms
[2021-05-13 11:12:16] [INFO ] Deduced a trap composed of 16 places in 102 ms
[2021-05-13 11:12:16] [INFO ] Deduced a trap composed of 14 places in 65 ms
[2021-05-13 11:12:16] [INFO ] Deduced a trap composed of 23 places in 62 ms
[2021-05-13 11:12:16] [INFO ] Deduced a trap composed of 25 places in 50 ms
[2021-05-13 11:12:16] [INFO ] Deduced a trap composed of 19 places in 60 ms
[2021-05-13 11:12:16] [INFO ] Deduced a trap composed of 21 places in 53 ms
[2021-05-13 11:12:16] [INFO ] Deduced a trap composed of 20 places in 41 ms
[2021-05-13 11:12:16] [INFO ] Deduced a trap composed of 16 places in 55 ms
[2021-05-13 11:12:17] [INFO ] Deduced a trap composed of 19 places in 46 ms
[2021-05-13 11:12:17] [INFO ] Deduced a trap composed of 23 places in 39 ms
[2021-05-13 11:12:17] [INFO ] Deduced a trap composed of 20 places in 32 ms
[2021-05-13 11:12:17] [INFO ] Deduced a trap composed of 24 places in 32 ms
[2021-05-13 11:12:17] [INFO ] Deduced a trap composed of 24 places in 38 ms
[2021-05-13 11:12:17] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 1174 ms
[2021-05-13 11:12:17] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 11:12:17] [INFO ] [Nat]Absence check using 42 positive place invariants in 29 ms returned sat
[2021-05-13 11:12:17] [INFO ] [Nat]Absence check using 42 positive and 39 generalized place invariants in 17 ms returned sat
[2021-05-13 11:12:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 11:12:17] [INFO ] [Nat]Absence check using state equation in 318 ms returned sat
[2021-05-13 11:12:17] [INFO ] Deduced a trap composed of 10 places in 171 ms
[2021-05-13 11:12:17] [INFO ] Deduced a trap composed of 12 places in 76 ms
[2021-05-13 11:12:18] [INFO ] Deduced a trap composed of 16 places in 106 ms
[2021-05-13 11:12:18] [INFO ] Deduced a trap composed of 14 places in 103 ms
[2021-05-13 11:12:18] [INFO ] Deduced a trap composed of 23 places in 67 ms
[2021-05-13 11:12:18] [INFO ] Deduced a trap composed of 21 places in 100 ms
[2021-05-13 11:12:18] [INFO ] Deduced a trap composed of 17 places in 73 ms
[2021-05-13 11:12:18] [INFO ] Deduced a trap composed of 25 places in 52 ms
[2021-05-13 11:12:18] [INFO ] Deduced a trap composed of 21 places in 80 ms
[2021-05-13 11:12:18] [INFO ] Deduced a trap composed of 18 places in 72 ms
[2021-05-13 11:12:18] [INFO ] Deduced a trap composed of 24 places in 52 ms
[2021-05-13 11:12:18] [INFO ] Deduced a trap composed of 21 places in 39 ms
[2021-05-13 11:12:18] [INFO ] Deduced a trap composed of 19 places in 53 ms
[2021-05-13 11:12:19] [INFO ] Deduced a trap composed of 26 places in 48 ms
[2021-05-13 11:12:19] [INFO ] Deduced a trap composed of 15 places in 47 ms
[2021-05-13 11:12:19] [INFO ] Deduced a trap composed of 13 places in 39 ms
[2021-05-13 11:12:19] [INFO ] Deduced a trap composed of 23 places in 34 ms
[2021-05-13 11:12:19] [INFO ] Deduced a trap composed of 19 places in 32 ms
[2021-05-13 11:12:19] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 1589 ms
[2021-05-13 11:12:19] [INFO ] Computed and/alt/rep : 295/981/295 causal constraints in 21 ms.
[2021-05-13 11:12:20] [INFO ] Added : 282 causal constraints over 57 iterations in 1478 ms. Result :sat
[2021-05-13 11:12:21] [INFO ] Flatten gal took : 71 ms
[2021-05-13 11:12:21] [INFO ] Flatten gal took : 28 ms
[2021-05-13 11:12:21] [INFO ] Applying decomposition
[2021-05-13 11:12:21] [INFO ] Flatten gal took : 23 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/graph3916995880366606322.txt, -o, /tmp/graph3916995880366606322.bin, -w, /tmp/graph3916995880366606322.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/graph3916995880366606322.bin, -l, -1, -v, -w, /tmp/graph3916995880366606322.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-13 11:12:21] [INFO ] Decomposing Gal with order
[2021-05-13 11:12:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-13 11:12:21] [INFO ] Removed a total of 42 redundant transitions.
[2021-05-13 11:12:21] [INFO ] Flatten gal took : 78 ms
[2021-05-13 11:12:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2021-05-13 11:12:21] [INFO ] Time to serialize gal into /home/mcc/execution/CTLFireability.pnml.gal : 11 ms
[2021-05-13 11:12:21] [INFO ] Time to serialize properties into /home/mcc/execution/CTLFireability.ctl : 5 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 16 CTL formulae.
built 56 ordering constraints for composite.
built 8 ordering constraints for composite.
built 6 ordering constraints for composite.
built 4 ordering constraints for composite.
built 6 ordering constraints for composite.
built 14 ordering constraints for composite.
built 16 ordering constraints for composite.
built 17 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 10 ordering constraints for composite.
built 7 ordering constraints for composite.
built 4 ordering constraints for composite.
built 16 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 4 ordering constraints for composite.
built 6 ordering constraints for composite.
built 18 ordering constraints for composite.
built 9 ordering constraints for composite.
built 4 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 47 ordering constraints for composite.
built 24 ordering constraints for composite.
built 8 ordering constraints for composite.
built 11 ordering constraints for composite.
built 11 ordering constraints for composite.
built 17 ordering constraints for composite.
built 13 ordering constraints for composite.
built 9 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 12 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 19 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 9 ordering constraints for composite.
built 6 ordering constraints for composite.
built 14 ordering constraints for composite.
built 9 ordering constraints for composite.
built 9 ordering constraints for composite.
built 21 ordering constraints for composite.
built 7 ordering constraints for composite.
built 4 ordering constraints for composite.
built 6 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 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,2.91565e+18,8.23324,288620,30028,29,688960,386,823,1.12159e+06,45,917,0


Converting to forward existential form...Done !
original formula: (AF(AG((((((((i8.i2.u99.p244!=1)&&(i16.u88.p210!=1))&&(i18.u144.p343!=1))&&(i2.u18.p50!=1))&&(i12.u77.p185!=1))&&(i9.i3.u34.p90!=1))&&(i1.u5.p12!=1)))) + (AX(((((((((((((((!(EX(((i10.i1.u70.p170==1)||(i1.u124.p303==1)))) * (i9.i0.u67.p162!=1)) * (i16.u88.p210!=1)) * (((i2.u18.p48!=1)||(i9.i3.u93.p228!=1))||(i2.u126.p306!=1))) * (i0.u56.p139!=1)) * (i4.i1.u41.p104!=1)) * (((i4.i0.u42.p107!=1)||(i19.u78.p193!=1))||(i20.i1.u146.p352!=1))) * (i18.u132.p319!=1)) * (i19.u78.p191!=1)) * (i12.u77.p189!=1)) + (i0.u143.p342==1)) + (i18.u117.p289==1)) + (i11.u75.p181==1)) + (i20.i1.u149.p350==1)) + (i1.u6.p14==1))) * !(AX(!(E((((((((i6.i1.u58.p144!=1)&&(((i13.i0.u9.p21!=1)||(i13.i2.u80.p197!=1))||(i18.u131.p345!=1)))&&(i17.i1.u97.p235!=1))&&(i13.i3.u69.p168!=1))&&(i18.u132.p318!=1))&&(i18.u129.p313!=1))&&(i20.i0.u154.p347!=1)) U AF(((((i13.i3.u69.p167==1)||(i1.u15.p41==1))||(i17.i0.u21.p58==1))||(i2.u17.p46==1)))))))))
=> equivalent forward existential formula: (((((((((([(EY((((((EY((Init * !(!(EG(!(!(E(TRUE U !((((((((i8.i2.u99.p244!=1)&&(i16.u88.p210!=1))&&(i18.u144.p343!=1))&&(i2.u18.p50!=1))&&(i12.u77.p185!=1))&&(i9.i3.u34.p90!=1))&&(i1.u5.p12!=1))))))))))) * !((i1.u6.p14==1))) * !((i20.i1.u149.p350==1))) * !((i11.u75.p181==1))) * !((i18.u117.p289==1))) * !((i0.u143.p342==1)))) * ((i10.i1.u70.p170==1)||(i1.u124.p303==1)))] = FALSE * [((((((EY((Init * !(!(EG(!(!(E(TRUE U !((((((((i8.i2.u99.p244!=1)&&(i16.u88.p210!=1))&&(i18.u144.p343!=1))&&(i2.u18.p50!=1))&&(i12.u77.p185!=1))&&(i9.i3.u34.p90!=1))&&(i1.u5.p12!=1))))))))))) * !((i1.u6.p14==1))) * !((i20.i1.u149.p350==1))) * !((i11.u75.p181==1))) * !((i18.u117.p289==1))) * !((i0.u143.p342==1))) * !((i9.i0.u67.p162!=1)))] = FALSE) * [((((((EY((Init * !(!(EG(!(!(E(TRUE U !((((((((i8.i2.u99.p244!=1)&&(i16.u88.p210!=1))&&(i18.u144.p343!=1))&&(i2.u18.p50!=1))&&(i12.u77.p185!=1))&&(i9.i3.u34.p90!=1))&&(i1.u5.p12!=1))))))))))) * !((i1.u6.p14==1))) * !((i20.i1.u149.p350==1))) * !((i11.u75.p181==1))) * !((i18.u117.p289==1))) * !((i0.u143.p342==1))) * !((i16.u88.p210!=1)))] = FALSE) * [((((((EY((Init * !(!(EG(!(!(E(TRUE U !((((((((i8.i2.u99.p244!=1)&&(i16.u88.p210!=1))&&(i18.u144.p343!=1))&&(i2.u18.p50!=1))&&(i12.u77.p185!=1))&&(i9.i3.u34.p90!=1))&&(i1.u5.p12!=1))))))))))) * !((i1.u6.p14==1))) * !((i20.i1.u149.p350==1))) * !((i11.u75.p181==1))) * !((i18.u117.p289==1))) * !((i0.u143.p342==1))) * !((((i2.u18.p48!=1)||(i9.i3.u93.p228!=1))||(i2.u126.p306!=1))))] = FALSE) * [((((((EY((Init * !(!(EG(!(!(E(TRUE U !((((((((i8.i2.u99.p244!=1)&&(i16.u88.p210!=1))&&(i18.u144.p343!=1))&&(i2.u18.p50!=1))&&(i12.u77.p185!=1))&&(i9.i3.u34.p90!=1))&&(i1.u5.p12!=1))))))))))) * !((i1.u6.p14==1))) * !((i20.i1.u149.p350==1))) * !((i11.u75.p181==1))) * !((i18.u117.p289==1))) * !((i0.u143.p342==1))) * !((i0.u56.p139!=1)))] = FALSE) * [((((((EY((Init * !(!(EG(!(!(E(TRUE U !((((((((i8.i2.u99.p244!=1)&&(i16.u88.p210!=1))&&(i18.u144.p343!=1))&&(i2.u18.p50!=1))&&(i12.u77.p185!=1))&&(i9.i3.u34.p90!=1))&&(i1.u5.p12!=1))))))))))) * !((i1.u6.p14==1))) * !((i20.i1.u149.p350==1))) * !((i11.u75.p181==1))) * !((i18.u117.p289==1))) * !((i0.u143.p342==1))) * !((i4.i1.u41.p104!=1)))] = FALSE) * [((((((EY((Init * !(!(EG(!(!(E(TRUE U !((((((((i8.i2.u99.p244!=1)&&(i16.u88.p210!=1))&&(i18.u144.p343!=1))&&(i2.u18.p50!=1))&&(i12.u77.p185!=1))&&(i9.i3.u34.p90!=1))&&(i1.u5.p12!=1))))))))))) * !((i1.u6.p14==1))) * !((i20.i1.u149.p350==1))) * !((i11.u75.p181==1))) * !((i18.u117.p289==1))) * !((i0.u143.p342==1))) * !((((i4.i0.u42.p107!=1)||(i19.u78.p193!=1))||(i20.i1.u146.p352!=1))))] = FALSE) * [((((((EY((Init * !(!(EG(!(!(E(TRUE U !((((((((i8.i2.u99.p244!=1)&&(i16.u88.p210!=1))&&(i18.u144.p343!=1))&&(i2.u18.p50!=1))&&(i12.u77.p185!=1))&&(i9.i3.u34.p90!=1))&&(i1.u5.p12!=1))))))))))) * !((i1.u6.p14==1))) * !((i20.i1.u149.p350==1))) * !((i11.u75.p181==1))) * !((i18.u117.p289==1))) * !((i0.u143.p342==1))) * !((i18.u132.p319!=1)))] = FALSE) * [((((((EY((Init * !(!(EG(!(!(E(TRUE U !((((((((i8.i2.u99.p244!=1)&&(i16.u88.p210!=1))&&(i18.u144.p343!=1))&&(i2.u18.p50!=1))&&(i12.u77.p185!=1))&&(i9.i3.u34.p90!=1))&&(i1.u5.p12!=1))))))))))) * !((i1.u6.p14==1))) * !((i20.i1.u149.p350==1))) * !((i11.u75.p181==1))) * !((i18.u117.p289==1))) * !((i0.u143.p342==1))) * !((i19.u78.p191!=1)))] = FALSE) * [((((((EY((Init * !(!(EG(!(!(E(TRUE U !((((((((i8.i2.u99.p244!=1)&&(i16.u88.p210!=1))&&(i18.u144.p343!=1))&&(i2.u18.p50!=1))&&(i12.u77.p185!=1))&&(i9.i3.u34.p90!=1))&&(i1.u5.p12!=1))))))))))) * !((i1.u6.p14==1))) * !((i20.i1.u149.p350==1))) * !((i11.u75.p181==1))) * !((i18.u117.p289==1))) * !((i0.u143.p342==1))) * !((i12.u77.p189!=1)))] = FALSE) * [((Init * !(!(EG(!(!(E(TRUE U !((((((((i8.i2.u99.p244!=1)&&(i16.u88.p210!=1))&&(i18.u144.p343!=1))&&(i2.u18.p50!=1))&&(i12.u77.p185!=1))&&(i9.i3.u34.p90!=1))&&(i1.u5.p12!=1)))))))))) * !(EX(!(!(E((((((((i6.i1.u58.p144!=1)&&(((i13.i0.u9.p21!=1)||(i13.i2.u80.p197!=1))||(i18.u131.p345!=1)))&&(i17.i1.u97.p235!=1))&&(i13.i3.u69.p168!=1))&&(i18.u132.p318!=1))&&(i18.u129.p313!=1))&&(i20.i0.u154.p347!=1)) U !(EG(!(((((i13.i3.u69.p167==1)||(i1.u15.p41==1))||(i17.i0.u21.p58==1))||(i2.u17.p46==1)))))))))))] = FALSE)
Reverse transition relation is NOT exact ! Due to transitions t214, t222, t238, i0.t178, i0.t170, i0.u38.t195, i0.u54.t177, i0.u56.t173, i1.t234, i1.t230, i1.t226, i1.u11.t237, i1.u13.t233, i1.u15.t229, i2.t218, i2.u17.t225, i2.u19.t221, i3.i0.u23.t213, i5.i1.t96, i5.i1.u106.t97, i6.i1.u58.t169, i7.i1.t100, i7.i1.u104.t101, i7.i2.t92, i7.i2.u107.t93, i7.i3.t88, i7.i3.u109.t89, i8.i1.t116, i8.i1.u95.t117, i8.i2.t108, i8.i2.u100.t109, i8.i3.t104, i8.i3.u102.t105, i9.i1.t128, i9.i1.u90.t129, i9.i2.t124, i9.i2.u92.t125, i9.i3.t120, i9.i3.u93.t121, i10.i0.u7.t244, i10.i1.t163, i10.i1.u71.t164, i11.t156, i11.u75.t157, i12.t152, i12.u76.t153, i13.i0.u9.t241, i13.i1.t160, i13.i1.u73.t161, i13.i2.t144, i13.i2.u80.t145, i14.t140, i14.u83.t141, i15.t136, i15.u86.t137, i16.t132, i16.u87.t133, i17.i0.u21.t217, i17.i1.t112, i17.i1.u98.t113, i18.t82, i18.t71, i18.t69, i18.t66, i18.t63, i18.t60, i18.t57, i18.t54, i18.t51, i18.t48, i18.t43, i18.t41, i18.t39, i18.t37, i18.t35, i18.t33, i18.t31, i18.t12, i18.t9, i18.t6, i18.u131.t4, i18.u131.t29, i18.u131.t45, i19.t148, i19.u78.t149, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/211/85/296
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
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 an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found a local SCC at level 8
Fast SCC detection found an 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
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
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 an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found a local SCC at level 8
Fast SCC detection found an 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
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
(forward)formula 0,1,695.018,3525352,1,0,6.88372e+06,386,3051,1.19405e+07,134,917,10835113
FORMULA BusinessProcesses-PT-06-CTLFireability-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: E(EF(AX(AX(AX(((((((((i13.i1.u73.p176==1)||(i10.i0.u8.p19==1))||(i5.i0.u51.p101==1))||(i9.i1.u89.p219==1))||(i20.i2.u151.p349==1))||(i0.u3.p8==1))||(i20.i1.u146.p351==1))||(((i0.u54.p131==1)&&(i9.i1.u90.p217==1))&&(i18.u131.p345==1))))))) U (((i7.i2.u107.p261==1)||(i3.i2.u25.p70==1))||(i9.i2.u16.p44==1)))
=> equivalent forward existential formula: [(FwdU(Init,E(TRUE U !(EX(!(!(EX(!(!(EX(!(((((((((i13.i1.u73.p176==1)||(i10.i0.u8.p19==1))||(i5.i0.u51.p101==1))||(i9.i1.u89.p219==1))||(i20.i2.u151.p349==1))||(i0.u3.p8==1))||(i20.i1.u146.p351==1))||(((i0.u54.p131==1)&&(i9.i1.u90.p217==1))&&(i18.u131.p345==1)))))))))))))) * (((i7.i2.u107.p261==1)||(i3.i2.u25.p70==1))||(i9.i2.u16.p44==1)))] != FALSE
(forward)formula 1,1,818.995,3788752,1,0,7.43378e+06,386,3468,1.19405e+07,143,1023,9140154
FORMULA BusinessProcesses-PT-06-CTLFireability-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EF(EX(EG((((i17.i1.u97.p235==1)||(i9.i3.u34.p90==1))||(i0.u141.p338==1)))))
=> equivalent forward existential formula: [FwdG(EY(FwdU(Init,TRUE)),(((i17.i1.u97.p235==1)||(i9.i3.u34.p90==1))||(i0.u141.p338==1)))] != FALSE
(forward)formula 2,1,940.833,3794160,1,0,7.43378e+06,386,3619,1.19405e+07,146,1049,12799162
FORMULA BusinessProcesses-PT-06-CTLFireability-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: A((((i18.u127.p309==1)||(i9.i2.u91.p224==1))||(i8.i0.u64.p155==1)) U (!(EF(EG(((((i16.u55.p134==1)&&(i16.u87.p213==1))&&(i0.u141.p337==1))||(i13.i3.u69.p169==1))))) * (!(AF((A(((i3.i2.u32.p69==1)||(i7.i2.u108.p264==1)) U ((((((i18.u127.p309==1)||(i0.u38.p98==1))||(i11.u75.p181==1))||(i0.u3.p8==1))||(i18.u131.p316==1))||(i7.i1.u103.p250==1))) * EX((((((((((i5.i0.u157.p372==1)||(i9.i1.u89.p215==1))||(i18.u111.p272==1))||(((i1.u13.p33==1)&&(i15.u86.p207==1))&&(i18.u131.p345==1)))||(((i4.i0.u42.p110==1)&&(i13.i2.u80.p198==1))&&(i20.i1.u146.p355==1)))||(i1.u15.p40==1))||(i10.i1.u71.p171==1))||(i1.u5.p11==1))||(i18.u129.p313==1)))))) + (((((((!(AX(EF((i9.i0.u82.p163==1)))) * (i18.u119.p292!=1)) * (i18.u144.p343!=1)) * (i0.u143.p342!=1)) * (i18.u140.p335!=1)) * (i7.i0.u63.p153!=1)) * (i7.i2.u108.p264!=1)) * (i14.u150.p360!=1)))))
Detected timeout of ITS tools.
=> equivalent forward existential formula: [((Init * !(EG(!((!(E(TRUE U EG(((((i16.u55.p134==1)&&(i16.u87.p213==1))&&(i0.u141.p337==1))||(i13.i3.u69.p169==1))))) * (!(!(EG(!((!((E(!(((((((i18.u127.p309==1)||(i0.u38.p98==1))||(i11.u75.p181==1))||(i0.u3.p8==1))||(i18.u131.p316==1))||(i7.i1.u103.p250==1))) U (!(((i3.i2.u32.p69==1)||(i7.i2.u108.p264==1))) * !(((((((i18.u127.p309==1)||(i0.u38.p98==1))||(i11.u75.p181==1))||(i0.u3.p8==1))||(i18.u131.p316==1))||(i7.i1.u103.p250==1))))) + EG(!(((((((i18.u127.p309==1)||(i0.u38.p98==1))||(i11.u75.p181==1))||(i0.u3.p8==1))||(i18.u131.p316==1))||(i7.i1.u103.p250==1)))))) * EX((((((((((i5.i0.u157.p372==1)||(i9.i1.u89.p215==1))||(i18.u111.p272==1))||(((i1.u13.p33==1)&&(i15.u86.p207==1))&&(i18.u131.p345==1)))||(((i4.i0.u42.p110==1)&&(i13.i2.u80.p198==1))&&(i20.i1.u146.p355==1)))||(i1.u15.p40==1))||(i10.i1.u71.p171==1))||(i1.u5.p11==1))||(i18.u129.p313==1)))))))) + (((((((!(!(EX(!(E(TRUE U (i9.i0.u82.p163==1)))))) * (i18.u119.p292!=1)) * (i18.u144.p343!=1)) * (i0.u143.p342!=1)) * (i18.u140.p335!=1)) * (i7.i0.u63.p153!=1)) * (i7.i2.u108.p264!=1)) * (i14.u150.p360!=1)))))))) * !(E(!((!(E(TRUE U EG(((((i16.u55.p134==1)&&(i16.u87.p213==1))&&(i0.u141.p337==1))||(i13.i3.u69.p169==1))))) * (!(!(EG(!((!((E(!(((((((i18.u127.p309==1)||(i0.u38.p98==1))||(i11.u75.p181==1))||(i0.u3.p8==1))||(i18.u131.p316==1))||(i7.i1.u103.p250==1))) U (!(((i3.i2.u32.p69==1)||(i7.i2.u108.p264==1))) * !(((((((i18.u127.p309==1)||(i0.u38.p98==1))||(i11.u75.p181==1))||(i0.u3.p8==1))||(i18.u131.p316==1))||(i7.i1.u103.p250==1))))) + EG(!(((((((i18.u127.p309==1)||(i0.u38.p98==1))||(i11.u75.p181==1))||(i0.u3.p8==1))||(i18.u131.p316==1))||(i7.i1.u103.p250==1)))))) * EX((((((((((i5.i0.u157.p372==1)||(i9.i1.u89.p215==1))||(i18.u111.p272==1))||(((i1.u13.p33==1)&&(i15.u86.p207==1))&&(i18.u131.p345==1)))||(((i4.i0.u42.p110==1)&&(i13.i2.u80.p198==1))&&(i20.i1.u146.p355==1)))||(i1.u15.p40==1))||(i10.i1.u71.p171==1))||(i1.u5.p11==1))||(i18.u129.p313==1)))))))) + (((((((!(!(EX(!(E(TRUE U (i9.i0.u82.p163==1)))))) * (i18.u119.p292!=1)) * (i18.u144.p343!=1)) * (i0.u143.p342!=1)) * (i18.u140.p335!=1)) * (i7.i0.u63.p153!=1)) * (i7.i2.u108.p264!=1)) * (i14.u150.p360!=1))))) U (!((((i18.u127.p309==1)||(i9.i2.u91.p224==1))||(i8.i0.u64.p155==1))) * !((!(E(TRUE U EG(((((i16.u55.p134==1)&&(i16.u87.p213==1))&&(i0.u141.p337==1))||(i13.i3.u69.p169==1))))) * (!(!(EG(!((!((E(!(((((((i18.u127.p309==1)||(i0.u38.p98==1))||(i11.u75.p181==1))||(i0.u3.p8==1))||(i18.u131.p316==1))||(i7.i1.u103.p250==1))) U (!(((i3.i2.u32.p69==1)||(i7.i2.u108.p264==1))) * !(((((((i18.u127.p309==1)||(i0.u38.p98==1))||(i11.u75.p181==1))||(i0.u3.p8==1))||(i18.u131.p316==1))||(i7.i1.u103.p250==1))))) + EG(!(((((((i18.u127.p309==1)||(i0.u38.p98==1))||(i11.u75.p181==1))||(i0.u3.p8==1))||(i18.u131.p316==1))||(i7.i1.u103.p250==1)))))) * EX((((((((((i5.i0.u157.p372==1)||(i9.i1.u89.p215==1))||(i18.u111.p272==1))||(((i1.u13.p33==1)&&(i15.u86.p207==1))&&(i18.u131.p345==1)))||(((i4.i0.u42.p110==1)&&(i13.i2.u80.p198==1))&&(i20.i1.u146.p355==1)))||(i1.u15.p40==1))||(i10.i1.u71.p171==1))||(i1.u5.p11==1))||(i18.u129.p313==1)))))))) + (((((((!(!(EX(!(E(TRUE U (i9.i0.u82.p163==1)))))) * (i18.u119.p292!=1)) * (i18.
java.io.IOException: Stream closed
at java.base/java.io.BufferedInputStream.getBufIfOpen(BufferedInputStream.java:176)
at java.base/java.io.BufferedInputStream.read(BufferedInputStream.java:342)
at java.base/sun.nio.cs.StreamDecoder.readBytes(StreamDecoder.java:284)
at java.base/sun.nio.cs.StreamDecoder.implRead(StreamDecoder.java:326)
at java.base/sun.nio.cs.StreamDecoder.read(StreamDecoder.java:178)
at java.base/java.io.InputStreamReader.read(InputStreamReader.java:185)
at java.base/java.io.BufferedReader.fill(BufferedReader.java:161)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:326)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:392)
at fr.lip6.move.gal.application.ITSRunner$ITSInterpreter.run(ITSRunner.java:180)
at java.base/java.lang.Thread.run(Thread.java:834)
[2021-05-13 11:32:28] [INFO ] Applying decomposition
[2021-05-13 11:32:28] [INFO ] Flatten gal took : 15 ms
[2021-05-13 11:32:28] [INFO ] Decomposing Gal with order
[2021-05-13 11:32:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-13 11:32:28] [INFO ] Flatten gal took : 46 ms
[2021-05-13 11:32:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2021-05-13 11:32:29] [INFO ] Time to serialize gal into /home/mcc/execution/CTLFireability.pnml.gal : 9 ms
[2021-05-13 11:32:29] [INFO ] Time to serialize properties into /home/mcc/execution/CTLFireability.ctl : 5 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 13 CTL formulae.
built 2 ordering constraints for composite.
built 82 ordering constraints for composite.
built 42 ordering constraints for composite.
built 41 ordering constraints for composite.
built 40 ordering constraints for composite.
built 38 ordering constraints for composite.
built 36 ordering constraints for composite.
built 27 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 11 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 11 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 42 ordering constraints for composite.
built 40 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 42 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.
Detected timeout of ITS tools.
[2021-05-13 11:52:38] [INFO ] Flatten gal took : 397 ms
[2021-05-13 11:52:39] [INFO ] Input system was already deterministic with 296 transitions.
[2021-05-13 11:52:39] [INFO ] Transformed 375 places.
[2021-05-13 11:52:39] [INFO ] Transformed 296 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:53:09] [INFO ] Time to serialize gal into /home/mcc/execution/CTLFireability.pnml.gal : 17 ms
[2021-05-13 11:53:09] [INFO ] Time to serialize properties into /home/mcc/execution/CTLFireability.ctl : 14 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 13 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-06"
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-06, 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-162038167700092"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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