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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 16K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 157K May 10 09:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.6K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 87K 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:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K 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 17K Mar 28 15:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 23 03:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 23 03:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.0K 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 79K 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-04-CTLCardinality-00
FORMULA_NAME BusinessProcesses-PT-04-CTLCardinality-01
FORMULA_NAME BusinessProcesses-PT-04-CTLCardinality-02
FORMULA_NAME BusinessProcesses-PT-04-CTLCardinality-03
FORMULA_NAME BusinessProcesses-PT-04-CTLCardinality-04
FORMULA_NAME BusinessProcesses-PT-04-CTLCardinality-05
FORMULA_NAME BusinessProcesses-PT-04-CTLCardinality-06
FORMULA_NAME BusinessProcesses-PT-04-CTLCardinality-07
FORMULA_NAME BusinessProcesses-PT-04-CTLCardinality-08
FORMULA_NAME BusinessProcesses-PT-04-CTLCardinality-09
FORMULA_NAME BusinessProcesses-PT-04-CTLCardinality-10
FORMULA_NAME BusinessProcesses-PT-04-CTLCardinality-11
FORMULA_NAME BusinessProcesses-PT-04-CTLCardinality-12
FORMULA_NAME BusinessProcesses-PT-04-CTLCardinality-13
FORMULA_NAME BusinessProcesses-PT-04-CTLCardinality-14
FORMULA_NAME BusinessProcesses-PT-04-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1620904316589

[2021-05-13 11:11:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -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:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 11:11:58] [INFO ] Load time of PNML (sax parser for PT used): 63 ms
[2021-05-13 11:11:58] [INFO ] Transformed 288 places.
[2021-05-13 11:11:58] [INFO ] Transformed 283 transitions.
[2021-05-13 11:11:58] [INFO ] Found NUPN structural information;
[2021-05-13 11:11:58] [INFO ] Parsed PT model containing 288 places and 283 transitions in 105 ms.
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 2 transitions.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 42 ms.
Incomplete random walk after 100000 steps, including 1101 resets, run finished after 1482 ms. (steps per millisecond=67 ) properties seen :[0, 1, 0, 0, 1, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 1, 0, 1, 0, 0, 1, 1, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 1, 0, 0]
// Phase 1: matrix 281 rows 286 cols
[2021-05-13 11:11:59] [INFO ] Computed 44 place invariants in 17 ms
[2021-05-13 11:12:00] [INFO ] [Real]Absence check using 21 positive place invariants in 40 ms returned unsat
[2021-05-13 11:12:00] [INFO ] [Real]Absence check using 21 positive place invariants in 12 ms returned unsat
[2021-05-13 11:12:00] [INFO ] [Real]Absence check using 21 positive place invariants in 14 ms returned unsat
[2021-05-13 11:12:00] [INFO ] [Real]Absence check using 21 positive place invariants in 11 ms returned unsat
[2021-05-13 11:12:00] [INFO ] [Real]Absence check using 21 positive place invariants in 10 ms returned unsat
[2021-05-13 11:12:00] [INFO ] [Real]Absence check using 21 positive place invariants in 13 ms returned unsat
[2021-05-13 11:12:00] [INFO ] [Real]Absence check using 21 positive place invariants in 12 ms returned unsat
[2021-05-13 11:12:00] [INFO ] [Real]Absence check using 21 positive place invariants in 12 ms returned unsat
[2021-05-13 11:12:00] [INFO ] [Real]Absence check using 21 positive place invariants in 17 ms returned unsat
[2021-05-13 11:12:00] [INFO ] [Real]Absence check using 21 positive place invariants in 13 ms returned unsat
[2021-05-13 11:12:00] [INFO ] [Real]Absence check using 21 positive place invariants in 13 ms returned unsat
[2021-05-13 11:12:00] [INFO ] [Real]Absence check using 21 positive place invariants in 12 ms returned unsat
[2021-05-13 11:12:00] [INFO ] [Real]Absence check using 21 positive place invariants in 12 ms returned unsat
[2021-05-13 11:12:01] [INFO ] [Real]Absence check using 21 positive place invariants in 13 ms returned unsat
[2021-05-13 11:12:01] [INFO ] [Real]Absence check using 21 positive place invariants in 10 ms returned unsat
[2021-05-13 11:12:01] [INFO ] [Real]Absence check using 21 positive place invariants in 21 ms returned sat
[2021-05-13 11:12:01] [INFO ] [Real]Absence check using 21 positive and 23 generalized place invariants in 20 ms returned sat
[2021-05-13 11:12:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:12:01] [INFO ] [Real]Absence check using state equation in 272 ms returned sat
[2021-05-13 11:12:01] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 11:12:01] [INFO ] [Nat]Absence check using 21 positive place invariants in 51 ms returned sat
[2021-05-13 11:12:01] [INFO ] [Nat]Absence check using 21 positive and 23 generalized place invariants in 7 ms returned sat
[2021-05-13 11:12:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 11:12:01] [INFO ] [Nat]Absence check using state equation in 223 ms returned sat
[2021-05-13 11:12:01] [INFO ] Deduced a trap composed of 9 places in 124 ms
[2021-05-13 11:12:02] [INFO ] Deduced a trap composed of 11 places in 104 ms
[2021-05-13 11:12:02] [INFO ] Deduced a trap composed of 8 places in 116 ms
[2021-05-13 11:12:02] [INFO ] Deduced a trap composed of 47 places in 115 ms
[2021-05-13 11:12:02] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 540 ms
[2021-05-13 11:12:02] [INFO ] Computed and/alt/rep : 280/922/280 causal constraints in 22 ms.
[2021-05-13 11:12:03] [INFO ] Added : 124 causal constraints over 26 iterations in 788 ms. Result :sat
[2021-05-13 11:12:03] [INFO ] Deduced a trap composed of 89 places in 141 ms
[2021-05-13 11:12:03] [INFO ] Deduced a trap composed of 82 places in 115 ms
[2021-05-13 11:12:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 336 ms
[2021-05-13 11:12:03] [INFO ] [Real]Absence check using 21 positive place invariants in 14 ms returned unsat
[2021-05-13 11:12:03] [INFO ] [Real]Absence check using 21 positive place invariants in 18 ms returned unsat
[2021-05-13 11:12:03] [INFO ] [Real]Absence check using 21 positive place invariants in 11 ms returned unsat
[2021-05-13 11:12:03] [INFO ] [Real]Absence check using 21 positive place invariants in 10 ms returned unsat
[2021-05-13 11:12:03] [INFO ] [Real]Absence check using 21 positive place invariants in 13 ms returned unsat
[2021-05-13 11:12:03] [INFO ] [Real]Absence check using 21 positive place invariants in 13 ms returned unsat
[2021-05-13 11:12:03] [INFO ] [Real]Absence check using 21 positive place invariants in 13 ms returned unsat
[2021-05-13 11:12:04] [INFO ] [Real]Absence check using 21 positive place invariants in 14 ms returned unsat
[2021-05-13 11:12:04] [INFO ] [Real]Absence check using 21 positive place invariants in 17 ms returned unsat
[2021-05-13 11:12:04] [INFO ] [Real]Absence check using 21 positive place invariants in 21 ms returned sat
[2021-05-13 11:12:04] [INFO ] [Real]Absence check using 21 positive and 23 generalized place invariants in 11 ms returned sat
[2021-05-13 11:12:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:12:04] [INFO ] [Real]Absence check using state equation in 263 ms returned sat
[2021-05-13 11:12:04] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 11:12:04] [INFO ] [Nat]Absence check using 21 positive place invariants in 18 ms returned unsat
[2021-05-13 11:12:04] [INFO ] [Real]Absence check using 21 positive place invariants in 15 ms returned unsat
[2021-05-13 11:12:04] [INFO ] [Real]Absence check using 21 positive place invariants in 22 ms returned sat
[2021-05-13 11:12:04] [INFO ] [Real]Absence check using 21 positive and 23 generalized place invariants in 12 ms returned sat
[2021-05-13 11:12:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:12:04] [INFO ] [Real]Absence check using state equation in 292 ms returned sat
[2021-05-13 11:12:04] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 11:12:05] [INFO ] [Nat]Absence check using 21 positive place invariants in 18 ms returned unsat
[2021-05-13 11:12:05] [INFO ] [Real]Absence check using 21 positive place invariants in 12 ms returned unsat
[2021-05-13 11:12:05] [INFO ] [Real]Absence check using 21 positive place invariants in 18 ms returned unsat
[2021-05-13 11:12:05] [INFO ] [Real]Absence check using 21 positive place invariants in 14 ms returned unsat
[2021-05-13 11:12:05] [INFO ] [Real]Absence check using 21 positive place invariants in 17 ms returned unsat
[2021-05-13 11:12:05] [INFO ] [Real]Absence check using 21 positive place invariants in 17 ms returned unsat
[2021-05-13 11:12:05] [INFO ] [Real]Absence check using 21 positive place invariants in 16 ms returned unsat
[2021-05-13 11:12:05] [INFO ] [Real]Absence check using 21 positive place invariants in 18 ms returned unsat
[2021-05-13 11:12:05] [INFO ] [Real]Absence check using 21 positive place invariants in 14 ms returned unsat
[2021-05-13 11:12:05] [INFO ] [Real]Absence check using 21 positive place invariants in 21 ms returned unsat
[2021-05-13 11:12:05] [INFO ] [Real]Absence check using 21 positive place invariants in 17 ms returned unsat
[2021-05-13 11:12:05] [INFO ] [Real]Absence check using 21 positive place invariants in 18 ms returned unsat
[2021-05-13 11:12:05] [INFO ] [Real]Absence check using 21 positive place invariants in 20 ms returned sat
[2021-05-13 11:12:05] [INFO ] [Real]Absence check using 21 positive and 23 generalized place invariants in 14 ms returned sat
[2021-05-13 11:12:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:12:06] [INFO ] [Real]Absence check using state equation in 255 ms returned sat
[2021-05-13 11:12:06] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 11:12:06] [INFO ] [Nat]Absence check using 21 positive place invariants in 17 ms returned unsat
[2021-05-13 11:12:06] [INFO ] [Real]Absence check using 21 positive place invariants in 24 ms returned sat
[2021-05-13 11:12:06] [INFO ] [Real]Absence check using 21 positive and 23 generalized place invariants in 14 ms returned sat
[2021-05-13 11:12:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:12:06] [INFO ] [Real]Absence check using state equation in 269 ms returned sat
[2021-05-13 11:12:06] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 11:12:06] [INFO ] [Nat]Absence check using 21 positive place invariants in 18 ms returned unsat
[2021-05-13 11:12:06] [INFO ] [Real]Absence check using 21 positive place invariants in 13 ms returned unsat
[2021-05-13 11:12:06] [INFO ] [Real]Absence check using 21 positive place invariants in 15 ms returned unsat
[2021-05-13 11:12:06] [INFO ] [Real]Absence check using 21 positive place invariants in 13 ms returned unsat
[2021-05-13 11:12:06] [INFO ] [Real]Absence check using 21 positive place invariants in 16 ms returned unsat
[2021-05-13 11:12:07] [INFO ] [Real]Absence check using 21 positive place invariants in 15 ms returned unsat
[2021-05-13 11:12:07] [INFO ] [Real]Absence check using 21 positive place invariants in 16 ms returned unsat
[2021-05-13 11:12:07] [INFO ] [Real]Absence check using 21 positive place invariants in 14 ms returned unsat
[2021-05-13 11:12:07] [INFO ] [Real]Absence check using 21 positive place invariants in 22 ms returned unsat
[2021-05-13 11:12:07] [INFO ] [Real]Absence check using 21 positive place invariants in 16 ms returned unsat
[2021-05-13 11:12:07] [INFO ] [Real]Absence check using 21 positive place invariants in 17 ms returned unsat
[2021-05-13 11:12:07] [INFO ] [Real]Absence check using 21 positive place invariants in 16 ms returned unsat
[2021-05-13 11:12:07] [INFO ] [Real]Absence check using 21 positive place invariants in 16 ms returned unsat
[2021-05-13 11:12:07] [INFO ] [Real]Absence check using 21 positive place invariants in 16 ms returned unsat
[2021-05-13 11:12:07] [INFO ] [Real]Absence check using 21 positive place invariants in 16 ms returned unsat
[2021-05-13 11:12:07] [INFO ] [Real]Absence check using 21 positive place invariants in 13 ms returned unsat
[2021-05-13 11:12:07] [INFO ] [Real]Absence check using 21 positive place invariants in 11 ms returned unsat
[2021-05-13 11:12:07] [INFO ] [Real]Absence check using 21 positive place invariants in 10 ms returned unsat
[2021-05-13 11:12:08] [INFO ] [Real]Absence check using 21 positive place invariants in 25 ms returned unsat
[2021-05-13 11:12:08] [INFO ] [Real]Absence check using 21 positive place invariants in 20 ms returned unsat
[2021-05-13 11:12:08] [INFO ] [Real]Absence check using 21 positive place invariants in 17 ms returned sat
[2021-05-13 11:12:08] [INFO ] [Real]Absence check using 21 positive and 23 generalized place invariants in 11 ms returned unsat
[2021-05-13 11:12:08] [INFO ] [Real]Absence check using 21 positive place invariants in 13 ms returned unsat
[2021-05-13 11:12:08] [INFO ] [Real]Absence check using 21 positive place invariants in 11 ms returned unsat
[2021-05-13 11:12:08] [INFO ] [Real]Absence check using 21 positive place invariants in 13 ms returned unsat
[2021-05-13 11:12:08] [INFO ] [Real]Absence check using 21 positive place invariants in 12 ms returned unsat
[2021-05-13 11:12:08] [INFO ] [Real]Absence check using 21 positive place invariants in 16 ms returned unsat
[2021-05-13 11:12:08] [INFO ] [Real]Absence check using 21 positive place invariants in 13 ms returned unsat
[2021-05-13 11:12:08] [INFO ] [Real]Absence check using 21 positive place invariants in 13 ms returned unsat
[2021-05-13 11:12:08] [INFO ] [Real]Absence check using 21 positive place invariants in 42 ms returned unsat
[2021-05-13 11:12:09] [INFO ] [Real]Absence check using 21 positive place invariants in 16 ms returned unsat
[2021-05-13 11:12:09] [INFO ] [Real]Absence check using 21 positive place invariants in 16 ms returned unsat
[2021-05-13 11:12:09] [INFO ] [Real]Absence check using 21 positive place invariants in 15 ms returned unsat
[2021-05-13 11:12:09] [INFO ] [Real]Absence check using 21 positive place invariants in 12 ms returned unsat
[2021-05-13 11:12:09] [INFO ] [Real]Absence check using 21 positive place invariants in 12 ms returned unsat
[2021-05-13 11:12:09] [INFO ] [Real]Absence check using 21 positive place invariants in 11 ms returned unsat
[2021-05-13 11:12:09] [INFO ] [Real]Absence check using 21 positive place invariants in 13 ms returned unsat
[2021-05-13 11:12:09] [INFO ] [Real]Absence check using 21 positive place invariants in 18 ms returned sat
[2021-05-13 11:12:09] [INFO ] [Real]Absence check using 21 positive and 23 generalized place invariants in 12 ms returned sat
[2021-05-13 11:12:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:12:09] [INFO ] [Real]Absence check using state equation in 277 ms returned sat
[2021-05-13 11:12:09] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 11:12:09] [INFO ] [Nat]Absence check using 21 positive place invariants in 183 ms returned sat
[2021-05-13 11:12:09] [INFO ] [Nat]Absence check using 21 positive and 23 generalized place invariants in 13 ms returned sat
[2021-05-13 11:12:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 11:12:10] [INFO ] [Nat]Absence check using state equation in 292 ms returned sat
[2021-05-13 11:12:10] [INFO ] Deduced a trap composed of 33 places in 125 ms
[2021-05-13 11:12:10] [INFO ] Deduced a trap composed of 12 places in 119 ms
[2021-05-13 11:12:10] [INFO ] Deduced a trap composed of 31 places in 61 ms
[2021-05-13 11:12:10] [INFO ] Deduced a trap composed of 24 places in 56 ms
[2021-05-13 11:12:10] [INFO ] Deduced a trap composed of 24 places in 51 ms
[2021-05-13 11:12:10] [INFO ] Deduced a trap composed of 36 places in 56 ms
[2021-05-13 11:12:10] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 582 ms
[2021-05-13 11:12:10] [INFO ] Computed and/alt/rep : 280/922/280 causal constraints in 17 ms.
[2021-05-13 11:12:11] [INFO ] Added : 124 causal constraints over 25 iterations in 623 ms. Result :sat
Successfully simplified 75 atomic propositions for a total of 75 simplifications.
[2021-05-13 11:12:11] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2021-05-13 11:12:11] [INFO ] Flatten gal took : 71 ms
[2021-05-13 11:12:11] [INFO ] Initial state reduction rules for CTL removed 8 formulas.
[2021-05-13 11:12:11] [INFO ] Flatten gal took : 28 ms
FORMULA BusinessProcesses-PT-04-CTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-04-CTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-04-CTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-04-CTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-04-CTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-04-CTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-04-CTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-04-CTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-13 11:12:11] [INFO ] Applying decomposition
[2021-05-13 11:12:11] [INFO ] Flatten gal took : 24 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/graph15892380158370042986.txt, -o, /tmp/graph15892380158370042986.bin, -w, /tmp/graph15892380158370042986.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/graph15892380158370042986.bin, -l, -1, -v, -w, /tmp/graph15892380158370042986.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-13 11:12:12] [INFO ] Decomposing Gal with order
[2021-05-13 11:12:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-13 11:12:12] [INFO ] Removed a total of 215 redundant transitions.
[2021-05-13 11:12:12] [INFO ] Flatten gal took : 101 ms
[2021-05-13 11:12:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 22 labels/synchronizations in 16 ms.
[2021-05-13 11:12:12] [INFO ] Time to serialize gal into /home/mcc/execution/CTLCardinality.pnml.gal : 12 ms
[2021-05-13 11:12:12] [INFO ] Time to serialize properties into /home/mcc/execution/CTLCardinality.ctl : 1 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/CTLCardinality.pnml.gal, -t, CGAL, -ctl, /home/mcc/execution/CTLCardinality.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.202005100927/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /home/mcc/execution/CTLCardinality.pnml.gal -t CGAL -ctl /home/mcc/execution/CTLCardinality.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,2.19702e+11,2.98188,99328,2,63894,5,336126,6,0,1416,374116,0


Converting to forward existential form...Done !
original formula: AG((!(AF((((gi4.gu31.p185+gi4.gu31.p123)<=(((((((gi4.gu31.p51+gi4.gu31.p253)+gi4.gu31.p27)+gi4.gu31.p200)+gi4.gu31.p112)+gi4.gu31.p28)+gi4.gu31.p217)+gi4.gu31.p104))||(((((((((gi1.gu1.p84+gi5.gu57.p106)+gi1.gu1.p108)+gi4.gu31.p125)+gi4.gu31.p28)+gi4.gu31.p112)+gi5.gu47.p174)+gi4.gu31.p69)+gi4.gu31.p226)>=7)))) + EF((((((((((((gi1.gu1.p193+gi1.gu1.p84)+gi1.gu1.p119)+gi1.gu1.p3)+gi1.gu1.p161)+gi5.gu57.p11)+gi1.gu1.p108)+gi1.gu1.p191)+gi1.gu1.p53)+gi1.gu1.p148)<=(((((((gi1.gu1.p85+gi5.gu57.p203)+gi1.gu1.p32)+gi1.gu1.p238)+gi1.gu1.p108)+gi1.gu1.p264)+gi1.gu1.p273)+gi1.gu1.p2))||(((gi7.gu4.p68+gi7.gu13.p46)+gi7.gu13.p201)<=(gi7.gu13.p39+gi7.gu4.p17))))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !(E(TRUE U (((((((((((gi1.gu1.p193+gi1.gu1.p84)+gi1.gu1.p119)+gi1.gu1.p3)+gi1.gu1.p161)+gi5.gu57.p11)+gi1.gu1.p108)+gi1.gu1.p191)+gi1.gu1.p53)+gi1.gu1.p148)<=(((((((gi1.gu1.p85+gi5.gu57.p203)+gi1.gu1.p32)+gi1.gu1.p238)+gi1.gu1.p108)+gi1.gu1.p264)+gi1.gu1.p273)+gi1.gu1.p2))||(((gi7.gu4.p68+gi7.gu13.p46)+gi7.gu13.p201)<=(gi7.gu13.p39+gi7.gu4.p17)))))) * !(EG(!((((gi4.gu31.p185+gi4.gu31.p123)<=(((((((gi4.gu31.p51+gi4.gu31.p253)+gi4.gu31.p27)+gi4.gu31.p200)+gi4.gu31.p112)+gi4.gu31.p28)+gi4.gu31.p217)+gi4.gu31.p104))||(((((((((gi1.gu1.p84+gi5.gu57.p106)+gi1.gu1.p108)+gi4.gu31.p125)+gi4.gu31.p28)+gi4.gu31.p112)+gi5.gu47.p174)+gi4.gu31.p69)+gi4.gu31.p226)>=7))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions gi0.gi0.gi0.gu30.t131, gi0.gi0.gi1.gu10.t185, gi0.gi0.gi1.gu35.t115, gi0.gi0.gi1.t187, gi0.gi0.gi2.gu36.t110, gi0.gi0.gi2.gu36.t111, gi0.gi1.gi1.gu18.t139, gi0.gi1.gi1.gu18.t141, gi0.gi1.gi1.gu18.t147, gi0.gi1.gi1.gu18.t151, gi0.gi1.gi1.gu18.t155, gi0.gi1.gi1.t90, gi0.t136, gi1.gu1.t103, gi1.t102, gi2.gu14.t175, gi2.gu39.t98, gi2.gu39.t99, gi2.t173, gi3.gu23.t95, gi3.t94, gi4.gu17.t165, gi4.gu31.t11, gi4.gu31.t30, gi4.gu31.t34, gi4.gu31.t38, gi4.gu31.t60, gi4.gu31.t63, gi4.gu31.t65, gi4.gu31.t135, gi4.gu44.t83, gi4.t82, gi4.t70, gi4.t49, gi4.t13, gi6.gu50.t168, gi6.t181, gi7.gu37.t106, gi7.gu37.t107, gi8.gu15.t87, gi8.t86, t16, t22, t24, t47, t56, t91, t114, t127, t143, t161, t170, t177, t182, t191, t194, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :40/178/56/274
(forward)formula 0,1,139.753,2218036,1,0,966,1.19873e+07,17,421,5001,8.31735e+06,186
FORMULA BusinessProcesses-PT-04-CTLCardinality-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EF(EX(TRUE))
=> equivalent forward existential formula: [(EY(FwdU(Init,TRUE)) * TRUE)] != FALSE
(forward)formula 1,1,141.549,2218036,1,0,966,1.19873e+07,17,421,5503,8.31735e+06,187
FORMULA BusinessProcesses-PT-04-CTLCardinality-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AX(FALSE)
=> equivalent forward existential formula: [(EY(Init) * !(FALSE))] = FALSE
(forward)formula 2,0,141.563,2218036,1,0,966,1.19873e+07,17,421,5503,8.31735e+06,188
FORMULA BusinessProcesses-PT-04-CTLCardinality-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: (EF((EG(E(((gi8.gu6.p247+gi8.gu6.p13)<=((((((gi8.gu6.p153+gi8.gu6.p26)+gi8.gu15.p133)+gi8.gu6.p114)+gi8.gu6.p281)+gi8.gu15.p141)+gi8.gu6.p160)) U ((((((((((gi7.gu4.p68+gi7.gu4.p17)+gi7.gu4.p224)+gi7.gu4.p10)+gi7.gu4.p243)+gi1.gu1.p108)+gi7.gu4.p121)+gi7.gu4.p155)+gi7.gu4.p220)+gi7.gu4.p205)>=3))) * ((((gi7.gu4.p155==0)||(gi7.gu4.p155==1))&&((((((gi3.gu23.p87+gi3.gu23.p171)+gi8.gu15.p131)+gi3.gu27.p254)+gi5.gu57.p241)>=32)||(((gi0.gi1.gi0.gu26.p92+gi0.gi1.gi0.gu26.p234)+gi0.gi1.gi0.gu26.p115)<=25)))&&((((((gi4.gu28.p98+gi4.gu28.p282)+gi4.gu28.p211)+gi4.gu28.p218)+gi4.gu31.p51)+gi4.gu28.p261)>gi4.gu28.p225)))) + AX(AX(E(AF((((((gi3.gu27.p38+gi5.gu57.p203)+gi7.gu4.p17)+gi3.gu27.p56)+gi3.gu27.p254)<=(((((((((gi3.gu27.p99+gi5.gu57.p71)+gi3.gu27.p140)+gi3.gu27.p279)+gi1.gu1.p53)+gi3.gu27.p33)+gi3.gu27.p31)+gi3.gu27.p96)+gi3.gu27.p56)+gi3.gu27.p147))) U ((((((((((gi5.gu57.p106+gi5.gu57.p270)+gi5.gu57.p262)+gi5.gu57.p24)+gi5.gu57.p241)+gi5.gu57.p203)+gi5.gu57.p11)+gi5.gu57.p82)+gi5.gu57.p240)+gi5.gu57.p71)>(((((((gi5.gu57.p95+gi5.gu57.p163)+gi5.gu57.p63)+gi5.gu57.p209)+gi5.gu57.p207)+gi5.gu57.p116)+gi5.gu57.p199)+gi5.gu57.p267))))))
=> equivalent forward existential formula: [(EY(EY((Init * !(E(TRUE U (EG(E(((gi8.gu6.p247+gi8.gu6.p13)<=((((((gi8.gu6.p153+gi8.gu6.p26)+gi8.gu15.p133)+gi8.gu6.p114)+gi8.gu6.p281)+gi8.gu15.p141)+gi8.gu6.p160)) U ((((((((((gi7.gu4.p68+gi7.gu4.p17)+gi7.gu4.p224)+gi7.gu4.p10)+gi7.gu4.p243)+gi1.gu1.p108)+gi7.gu4.p121)+gi7.gu4.p155)+gi7.gu4.p220)+gi7.gu4.p205)>=3))) * ((((gi7.gu4.p155==0)||(gi7.gu4.p155==1))&&((((((gi3.gu23.p87+gi3.gu23.p171)+gi8.gu15.p131)+gi3.gu27.p254)+gi5.gu57.p241)>=32)||(((gi0.gi1.gi0.gu26.p92+gi0.gi1.gi0.gu26.p234)+gi0.gi1.gi0.gu26.p115)<=25)))&&((((((gi4.gu28.p98+gi4.gu28.p282)+gi4.gu28.p211)+gi4.gu28.p218)+gi4.gu31.p51)+gi4.gu28.p261)>gi4.gu28.p225)))))))) * !(E(!(EG(!((((((gi3.gu27.p38+gi5.gu57.p203)+gi7.gu4.p17)+gi3.gu27.p56)+gi3.gu27.p254)<=(((((((((gi3.gu27.p99+gi5.gu57.p71)+gi3.gu27.p140)+gi3.gu27.p279)+gi1.gu1.p53)+gi3.gu27.p33)+gi3.gu27.p31)+gi3.gu27.p96)+gi3.gu27.p56)+gi3.gu27.p147))))) U ((((((((((gi5.gu57.p106+gi5.gu57.p270)+gi5.gu57.p262)+gi5.gu57.p24)+gi5.gu57.p241)+gi5.gu57.p203)+gi5.gu57.p11)+gi5.gu57.p82)+gi5.gu57.p240)+gi5.gu57.p71)>(((((((gi5.gu57.p95+gi5.gu57.p163)+gi5.gu57.p63)+gi5.gu57.p209)+gi5.gu57.p207)+gi5.gu57.p116)+gi5.gu57.p199)+gi5.gu57.p267)))))] = FALSE
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 3,1,848.083,4207768,1,0,966,3.00535e+07,13,421,4578,2.36696e+07,36
FORMULA BusinessProcesses-PT-04-CTLCardinality-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EX(EF(AG(EF(((((((gi6.gu50.p76+gi6.gu5.p23)+gi6.gu50.p213)+gi1.gu1.p161)+gi6.gu50.p245)+gi6.gu50.p219)<=((gi6.gu50.p235+gi8.gu6.p281)+gi6.gu50.p47))))))
=> equivalent forward existential formula: [(FwdU(EY(Init),TRUE) * !(E(TRUE U !(E(TRUE U ((((((gi6.gu50.p76+gi6.gu5.p23)+gi6.gu50.p213)+gi1.gu1.p161)+gi6.gu50.p245)+gi6.gu50.p219)<=((gi6.gu50.p235+gi8.gu6.p281)+gi6.gu50.p47)))))))] != FALSE
(forward)formula 4,1,900.983,4207768,1,0,966,3.00535e+07,18,421,5541,2.36696e+07,121
FORMULA BusinessProcesses-PT-04-CTLCardinality-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EF(!(AF(EG(TRUE))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(EG(TRUE)))] != FALSE
(forward)formula 5,0,1039.61,4713672,1,0,966,3.38149e+07,19,421,4764,2.36696e+07,215
FORMULA BusinessProcesses-PT-04-CTLCardinality-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: ((AF(EG(TRUE)) * !(EX((AX(FALSE) * ((gi6.gu5.p23+gi6.gu5.p232)<=(((((((gi6.gu5.p208+gi6.gu5.p143)+gi5.gu57.p24)+gi6.gu5.p77)+gi6.gu5.p12)+gi6.gu5.p222)+gi6.gu5.p216)+gi6.gu5.p232)))))) * !(AX(AX(((gi5.gu47.p274+gi1.gu1.p238)<=((((((((gi5.gu57.p207+gi5.gu57.p209)+gi5.gu47.p196)+gi5.gu57.p82)+gi5.gu47.p239)+gi5.gu47.p174)+gi5.gu47.p118)+gi5.gu47.p127)+gi5.gu47.p86))))))
=> equivalent forward existential formula: (([FwdG(Init,!(EG(TRUE)))] = FALSE * [((EY(Init) * ((gi6.gu5.p23+gi6.gu5.p232)<=(((((((gi6.gu5.p208+gi6.gu5.p143)+gi5.gu57.p24)+gi6.gu5.p77)+gi6.gu5.p12)+gi6.gu5.p222)+gi6.gu5.p216)+gi6.gu5.p232))) * !(EX(!(FALSE))))] = FALSE) * [(Init * !(EX(!(!(EX(!(((gi5.gu47.p274+gi1.gu1.p238)<=((((((((gi5.gu57.p207+gi5.gu57.p209)+gi5.gu47.p196)+gi5.gu57.p82)+gi5.gu47.p239)+gi5.gu47.p174)+gi5.gu47.p118)+gi5.gu47.p127)+gi5.gu47.p86)))))))))] = FALSE)
(forward)formula 6,0,1040.07,4713672,1,0,966,3.38149e+07,21,421,4823,2.36696e+07,224
FORMULA BusinessProcesses-PT-04-CTLCardinality-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EF(AG(EF(!(EF((gi8.gu15.p52<=((((((gi8.gu15.p64+gi8.gu15.p180)+gi8.gu15.p126)+gi8.gu15.p141)+gi8.gu15.p131)+gi8.gu15.p41)+gi8.gu15.p133)))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(E(TRUE U !(E(TRUE U (gi8.gu15.p52<=((((((gi8.gu15.p64+gi8.gu15.p180)+gi8.gu15.p126)+gi8.gu15.p141)+gi8.gu15.p131)+gi8.gu15.p41)+gi8.gu15.p133)))))))))] != FALSE
(forward)formula 7,0,1040.39,4713672,1,0,966,3.38149e+07,22,421,4863,2.36696e+07,228
FORMULA BusinessProcesses-PT-04-CTLCardinality-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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


BK_STOP 1620905375766

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution CTLCardinality -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 CTLCardinality -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-04"
export BK_EXAMINATION="CTLCardinality"
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-04, 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 r035-tajo-162038167700087"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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