fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r066-tajo-158922814200331
Last Updated
Jun 28, 2020

About the Execution of ITS-Tools for Dekker-PT-050

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15741.800 15347.00 32079.00 131.90 TTFFFFFFTFFFFFFF 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/mcc2020-input.r066-tajo-158922814200331.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is Dekker-PT-050, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r066-tajo-158922814200331
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.7M
-rw-r--r-- 1 mcc users 3.7K Apr 27 14:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Apr 27 14:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Apr 27 14:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 27 14:36 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 27 14:36 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Apr 27 14:36 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 27 14:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 27 14:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.8K Apr 27 14:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 13K Apr 27 14:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.7K Apr 27 14:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 27 14:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 27 14:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 27 14:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Apr 27 14:36 equiv_col
-rw-r--r-- 1 mcc users 4 Apr 27 14:36 instance
-rw-r--r-- 1 mcc users 6 Apr 27 14:36 iscolored
-rw-r--r-- 1 mcc users 1.5M Apr 27 14:36 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 Dekker-PT-050-CTLCardinality-00
FORMULA_NAME Dekker-PT-050-CTLCardinality-01
FORMULA_NAME Dekker-PT-050-CTLCardinality-02
FORMULA_NAME Dekker-PT-050-CTLCardinality-03
FORMULA_NAME Dekker-PT-050-CTLCardinality-04
FORMULA_NAME Dekker-PT-050-CTLCardinality-05
FORMULA_NAME Dekker-PT-050-CTLCardinality-06
FORMULA_NAME Dekker-PT-050-CTLCardinality-07
FORMULA_NAME Dekker-PT-050-CTLCardinality-08
FORMULA_NAME Dekker-PT-050-CTLCardinality-09
FORMULA_NAME Dekker-PT-050-CTLCardinality-10
FORMULA_NAME Dekker-PT-050-CTLCardinality-11
FORMULA_NAME Dekker-PT-050-CTLCardinality-12
FORMULA_NAME Dekker-PT-050-CTLCardinality-13
FORMULA_NAME Dekker-PT-050-CTLCardinality-14
FORMULA_NAME Dekker-PT-050-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1590111043520

[2020-05-22 01:30:45] [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]
[2020-05-22 01:30:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-22 01:30:45] [INFO ] Load time of PNML (sax parser for PT used): 169 ms
[2020-05-22 01:30:45] [INFO ] Transformed 250 places.
[2020-05-22 01:30:45] [INFO ] Transformed 2600 transitions.
[2020-05-22 01:30:45] [INFO ] Found NUPN structural information;
[2020-05-22 01:30:45] [INFO ] Parsed PT model containing 250 places and 2600 transitions in 230 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 26 ms.
Incomplete random walk after 100000 steps, including 0 resets, run finished after 750 ms. (steps per millisecond=133 ) properties seen :[0, 1, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0]
[2020-05-22 01:30:46] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 250 cols
[2020-05-22 01:30:46] [INFO ] Computed 150 place invariants in 10 ms
[2020-05-22 01:30:46] [INFO ] [Real]Absence check using 100 positive place invariants in 117 ms returned sat
[2020-05-22 01:30:46] [INFO ] [Real]Absence check using 100 positive and 50 generalized place invariants in 21 ms returned sat
[2020-05-22 01:30:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 01:30:46] [INFO ] [Real]Absence check using state equation in 200 ms returned sat
[2020-05-22 01:30:46] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 01:30:47] [INFO ] [Nat]Absence check using 100 positive place invariants in 44 ms returned sat
[2020-05-22 01:30:47] [INFO ] [Nat]Absence check using 100 positive and 50 generalized place invariants in 20 ms returned sat
[2020-05-22 01:30:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 01:30:47] [INFO ] [Nat]Absence check using state equation in 176 ms returned sat
[2020-05-22 01:30:47] [INFO ] State equation strengthened by 50 read => feed constraints.
[2020-05-22 01:30:47] [INFO ] [Nat]Added 50 Read/Feed constraints in 16 ms returned sat
[2020-05-22 01:30:47] [INFO ] Deduced a trap composed of 4 places in 75 ms
[2020-05-22 01:30:47] [INFO ] Deduced a trap composed of 6 places in 34 ms
[2020-05-22 01:30:47] [INFO ] Deduced a trap composed of 4 places in 29 ms
[2020-05-22 01:30:47] [INFO ] Deduced a trap composed of 4 places in 28 ms
[2020-05-22 01:30:47] [INFO ] Deduced a trap composed of 6 places in 21 ms
[2020-05-22 01:30:47] [INFO ] Deduced a trap composed of 6 places in 24 ms
[2020-05-22 01:30:47] [INFO ] Deduced a trap composed of 4 places in 17 ms
[2020-05-22 01:30:47] [INFO ] Deduced a trap composed of 6 places in 21 ms
[2020-05-22 01:30:47] [INFO ] Deduced a trap composed of 4 places in 24 ms
[2020-05-22 01:30:47] [INFO ] Deduced a trap composed of 6 places in 27 ms
[2020-05-22 01:30:47] [INFO ] Deduced a trap composed of 4 places in 23 ms
[2020-05-22 01:30:47] [INFO ] Deduced a trap composed of 4 places in 17 ms
[2020-05-22 01:30:47] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 486 ms
[2020-05-22 01:30:47] [INFO ] Computed and/alt/rep : 2550/7500/150 causal constraints in 65 ms.
[2020-05-22 01:30:48] [INFO ] Added : 51 causal constraints over 11 iterations in 416 ms. Result :sat
[2020-05-22 01:30:48] [INFO ] [Real]Absence check using 100 positive place invariants in 52 ms returned sat
[2020-05-22 01:30:48] [INFO ] [Real]Absence check using 100 positive and 50 generalized place invariants in 32 ms returned sat
[2020-05-22 01:30:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 01:30:48] [INFO ] [Real]Absence check using state equation in 194 ms returned sat
[2020-05-22 01:30:48] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 01:30:48] [INFO ] [Nat]Absence check using 100 positive place invariants in 37 ms returned sat
[2020-05-22 01:30:48] [INFO ] [Nat]Absence check using 100 positive and 50 generalized place invariants in 16 ms returned sat
[2020-05-22 01:30:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 01:30:48] [INFO ] [Nat]Absence check using state equation in 169 ms returned sat
[2020-05-22 01:30:48] [INFO ] [Nat]Added 50 Read/Feed constraints in 11 ms returned sat
[2020-05-22 01:30:48] [INFO ] Deduced a trap composed of 6 places in 46 ms
[2020-05-22 01:30:48] [INFO ] Deduced a trap composed of 4 places in 47 ms
[2020-05-22 01:30:48] [INFO ] Deduced a trap composed of 5 places in 37 ms
[2020-05-22 01:30:49] [INFO ] Deduced a trap composed of 4 places in 30 ms
[2020-05-22 01:30:49] [INFO ] Deduced a trap composed of 5 places in 25 ms
[2020-05-22 01:30:49] [INFO ] Deduced a trap composed of 4 places in 24 ms
[2020-05-22 01:30:49] [INFO ] Deduced a trap composed of 6 places in 18 ms
[2020-05-22 01:30:49] [INFO ] Deduced a trap composed of 5 places in 23 ms
[2020-05-22 01:30:49] [INFO ] Deduced a trap composed of 4 places in 20 ms
[2020-05-22 01:30:49] [INFO ] Deduced a trap composed of 6 places in 19 ms
[2020-05-22 01:30:49] [INFO ] Deduced a trap composed of 4 places in 14 ms
[2020-05-22 01:30:49] [INFO ] Deduced a trap composed of 5 places in 30 ms
[2020-05-22 01:30:49] [INFO ] Deduced a trap composed of 4 places in 26 ms
[2020-05-22 01:30:49] [INFO ] Deduced a trap composed of 6 places in 23 ms
[2020-05-22 01:30:49] [INFO ] Deduced a trap composed of 4 places in 22 ms
[2020-05-22 01:30:49] [INFO ] Deduced a trap composed of 6 places in 19 ms
[2020-05-22 01:30:49] [INFO ] Deduced a trap composed of 6 places in 16 ms
[2020-05-22 01:30:49] [INFO ] Deduced a trap composed of 4 places in 15 ms
[2020-05-22 01:30:49] [INFO ] Deduced a trap composed of 5 places in 20 ms
[2020-05-22 01:30:49] [INFO ] Deduced a trap composed of 4 places in 18 ms
[2020-05-22 01:30:49] [INFO ] Deduced a trap composed of 6 places in 18 ms
[2020-05-22 01:30:49] [INFO ] Deduced a trap composed of 4 places in 13 ms
[2020-05-22 01:30:49] [INFO ] Deduced a trap composed of 5 places in 19 ms
[2020-05-22 01:30:49] [INFO ] Deduced a trap composed of 4 places in 20 ms
[2020-05-22 01:30:49] [INFO ] Deduced a trap composed of 6 places in 17 ms
[2020-05-22 01:30:49] [INFO ] Deduced a trap composed of 4 places in 14 ms
[2020-05-22 01:30:49] [INFO ] Deduced a trap composed of 5 places in 23 ms
[2020-05-22 01:30:49] [INFO ] Deduced a trap composed of 4 places in 20 ms
[2020-05-22 01:30:49] [INFO ] Deduced a trap composed of 6 places in 16 ms
[2020-05-22 01:30:49] [INFO ] Deduced a trap composed of 4 places in 14 ms
[2020-05-22 01:30:49] [INFO ] Deduced a trap composed of 6 places in 20 ms
[2020-05-22 01:30:49] [INFO ] Deduced a trap composed of 4 places in 14 ms
[2020-05-22 01:30:49] [INFO ] Deduced a trap composed of 4 places in 12 ms
[2020-05-22 01:30:49] [INFO ] Trap strengthening (SAT) tested/added 34/33 trap constraints in 1018 ms
[2020-05-22 01:30:49] [INFO ] Computed and/alt/rep : 2550/7500/150 causal constraints in 58 ms.
[2020-05-22 01:30:50] [INFO ] Added : 51 causal constraints over 11 iterations in 425 ms. Result :sat
[2020-05-22 01:30:50] [INFO ] [Real]Absence check using 100 positive place invariants in 37 ms returned sat
[2020-05-22 01:30:50] [INFO ] [Real]Absence check using 100 positive and 50 generalized place invariants in 17 ms returned sat
[2020-05-22 01:30:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 01:30:50] [INFO ] [Real]Absence check using state equation in 202 ms returned sat
[2020-05-22 01:30:50] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 01:30:50] [INFO ] [Nat]Absence check using 100 positive place invariants in 30 ms returned sat
[2020-05-22 01:30:50] [INFO ] [Nat]Absence check using 100 positive and 50 generalized place invariants in 15 ms returned sat
[2020-05-22 01:30:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 01:30:50] [INFO ] [Nat]Absence check using state equation in 165 ms returned sat
[2020-05-22 01:30:50] [INFO ] [Nat]Added 50 Read/Feed constraints in 10 ms returned sat
[2020-05-22 01:30:50] [INFO ] Deduced a trap composed of 4 places in 34 ms
[2020-05-22 01:30:50] [INFO ] Deduced a trap composed of 5 places in 30 ms
[2020-05-22 01:30:50] [INFO ] Deduced a trap composed of 5 places in 25 ms
[2020-05-22 01:30:50] [INFO ] Deduced a trap composed of 4 places in 24 ms
[2020-05-22 01:30:51] [INFO ] Deduced a trap composed of 4 places in 23 ms
[2020-05-22 01:30:51] [INFO ] Deduced a trap composed of 5 places in 34 ms
[2020-05-22 01:30:51] [INFO ] Deduced a trap composed of 4 places in 26 ms
[2020-05-22 01:30:51] [INFO ] Deduced a trap composed of 4 places in 21 ms
[2020-05-22 01:30:51] [INFO ] Deduced a trap composed of 4 places in 19 ms
[2020-05-22 01:30:51] [INFO ] Deduced a trap composed of 6 places in 16 ms
[2020-05-22 01:30:51] [INFO ] Deduced a trap composed of 4 places in 13 ms
[2020-05-22 01:30:51] [INFO ] Deduced a trap composed of 4 places in 20 ms
[2020-05-22 01:30:51] [INFO ] Deduced a trap composed of 6 places in 18 ms
[2020-05-22 01:30:51] [INFO ] Deduced a trap composed of 4 places in 13 ms
[2020-05-22 01:30:51] [INFO ] Deduced a trap composed of 4 places in 14 ms
[2020-05-22 01:30:51] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 466 ms
[2020-05-22 01:30:51] [INFO ] Computed and/alt/rep : 2550/7500/150 causal constraints in 45 ms.
[2020-05-22 01:30:51] [INFO ] Added : 51 causal constraints over 11 iterations in 368 ms. Result :sat
[2020-05-22 01:30:51] [INFO ] [Real]Absence check using 100 positive place invariants in 24 ms returned sat
[2020-05-22 01:30:51] [INFO ] [Real]Absence check using 100 positive and 50 generalized place invariants in 12 ms returned sat
[2020-05-22 01:30:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 01:30:51] [INFO ] [Real]Absence check using state equation in 161 ms returned sat
[2020-05-22 01:30:51] [INFO ] [Real]Added 50 Read/Feed constraints in 11 ms returned sat
[2020-05-22 01:30:51] [INFO ] Deduced a trap composed of 6 places in 39 ms
[2020-05-22 01:30:52] [INFO ] Deduced a trap composed of 4 places in 30 ms
[2020-05-22 01:30:52] [INFO ] Deduced a trap composed of 5 places in 32 ms
[2020-05-22 01:30:52] [INFO ] Deduced a trap composed of 4 places in 24 ms
[2020-05-22 01:30:52] [INFO ] Deduced a trap composed of 5 places in 16 ms
[2020-05-22 01:30:52] [INFO ] Deduced a trap composed of 5 places in 16 ms
[2020-05-22 01:30:52] [INFO ] Deduced a trap composed of 4 places in 14 ms
[2020-05-22 01:30:52] [INFO ] Deduced a trap composed of 5 places in 18 ms
[2020-05-22 01:30:52] [INFO ] Deduced a trap composed of 4 places in 14 ms
[2020-05-22 01:30:52] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 295 ms
[2020-05-22 01:30:52] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 01:30:52] [INFO ] [Nat]Absence check using 100 positive place invariants in 28 ms returned sat
[2020-05-22 01:30:52] [INFO ] [Nat]Absence check using 100 positive and 50 generalized place invariants in 14 ms returned sat
[2020-05-22 01:30:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 01:30:52] [INFO ] [Nat]Absence check using state equation in 165 ms returned sat
[2020-05-22 01:30:52] [INFO ] [Nat]Added 50 Read/Feed constraints in 11 ms returned sat
[2020-05-22 01:30:52] [INFO ] Deduced a trap composed of 6 places in 28 ms
[2020-05-22 01:30:52] [INFO ] Deduced a trap composed of 4 places in 26 ms
[2020-05-22 01:30:52] [INFO ] Deduced a trap composed of 5 places in 24 ms
[2020-05-22 01:30:52] [INFO ] Deduced a trap composed of 4 places in 20 ms
[2020-05-22 01:30:52] [INFO ] Deduced a trap composed of 5 places in 16 ms
[2020-05-22 01:30:52] [INFO ] Deduced a trap composed of 5 places in 17 ms
[2020-05-22 01:30:52] [INFO ] Deduced a trap composed of 4 places in 13 ms
[2020-05-22 01:30:52] [INFO ] Deduced a trap composed of 5 places in 16 ms
[2020-05-22 01:30:52] [INFO ] Deduced a trap composed of 4 places in 13 ms
[2020-05-22 01:30:52] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 250 ms
[2020-05-22 01:30:52] [INFO ] Computed and/alt/rep : 2550/7500/150 causal constraints in 54 ms.
[2020-05-22 01:30:53] [INFO ] Added : 51 causal constraints over 11 iterations in 407 ms. Result :sat
[2020-05-22 01:30:53] [INFO ] [Real]Absence check using 100 positive place invariants in 30 ms returned sat
[2020-05-22 01:30:53] [INFO ] [Real]Absence check using 100 positive and 50 generalized place invariants in 15 ms returned sat
[2020-05-22 01:30:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 01:30:53] [INFO ] [Real]Absence check using state equation in 160 ms returned sat
[2020-05-22 01:30:53] [INFO ] [Real]Added 50 Read/Feed constraints in 11 ms returned sat
[2020-05-22 01:30:53] [INFO ] Deduced a trap composed of 4 places in 38 ms
[2020-05-22 01:30:53] [INFO ] Deduced a trap composed of 4 places in 26 ms
[2020-05-22 01:30:53] [INFO ] Deduced a trap composed of 5 places in 33 ms
[2020-05-22 01:30:53] [INFO ] Deduced a trap composed of 4 places in 24 ms
[2020-05-22 01:30:53] [INFO ] Deduced a trap composed of 4 places in 19 ms
[2020-05-22 01:30:53] [INFO ] Deduced a trap composed of 6 places in 16 ms
[2020-05-22 01:30:53] [INFO ] Deduced a trap composed of 4 places in 13 ms
[2020-05-22 01:30:53] [INFO ] Deduced a trap composed of 4 places in 13 ms
[2020-05-22 01:30:53] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 262 ms
[2020-05-22 01:30:53] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 01:30:53] [INFO ] [Nat]Absence check using 100 positive place invariants in 29 ms returned sat
[2020-05-22 01:30:53] [INFO ] [Nat]Absence check using 100 positive and 50 generalized place invariants in 15 ms returned sat
[2020-05-22 01:30:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 01:30:53] [INFO ] [Nat]Absence check using state equation in 166 ms returned sat
[2020-05-22 01:30:53] [INFO ] [Nat]Added 50 Read/Feed constraints in 10 ms returned sat
[2020-05-22 01:30:53] [INFO ] Deduced a trap composed of 6 places in 44 ms
[2020-05-22 01:30:54] [INFO ] Deduced a trap composed of 4 places in 28 ms
[2020-05-22 01:30:54] [INFO ] Deduced a trap composed of 5 places in 22 ms
[2020-05-22 01:30:54] [INFO ] Deduced a trap composed of 4 places in 19 ms
[2020-05-22 01:30:54] [INFO ] Deduced a trap composed of 5 places in 17 ms
[2020-05-22 01:30:54] [INFO ] Deduced a trap composed of 5 places in 16 ms
[2020-05-22 01:30:54] [INFO ] Deduced a trap composed of 4 places in 12 ms
[2020-05-22 01:30:54] [INFO ] Deduced a trap composed of 5 places in 16 ms
[2020-05-22 01:30:54] [INFO ] Deduced a trap composed of 4 places in 13 ms
[2020-05-22 01:30:54] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 269 ms
[2020-05-22 01:30:54] [INFO ] Computed and/alt/rep : 2550/7500/150 causal constraints in 41 ms.
[2020-05-22 01:30:54] [INFO ] Added : 51 causal constraints over 11 iterations in 358 ms. Result :sat
[2020-05-22 01:30:54] [INFO ] Initial state reduction rules for CTL removed 14 formulas.
[2020-05-22 01:30:54] [INFO ] Flatten gal took : 235 ms
[2020-05-22 01:30:55] [INFO ] Initial state reduction rules for CTL removed 14 formulas.
[2020-05-22 01:30:55] [INFO ] Flatten gal took : 127 ms
FORMULA Dekker-PT-050-CTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-050-CTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-050-CTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-050-CTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-050-CTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-050-CTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-050-CTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-050-CTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-050-CTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-050-CTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-050-CTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-050-CTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-050-CTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-050-CTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-22 01:30:55] [INFO ] Applying decomposition
[2020-05-22 01:30:55] [INFO ] Flatten gal took : 120 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/graph6120581406326962669.txt, -o, /tmp/graph6120581406326962669.bin, -w, /tmp/graph6120581406326962669.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/graph6120581406326962669.bin, -l, -1, -v, -w, /tmp/graph6120581406326962669.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-22 01:30:55] [INFO ] Decomposing Gal with order
[2020-05-22 01:30:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-22 01:30:56] [INFO ] Removed a total of 8376 redundant transitions.
[2020-05-22 01:30:56] [INFO ] Flatten gal took : 351 ms
[2020-05-22 01:30:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 53 ms.
[2020-05-22 01:30:56] [INFO ] Time to serialize gal into /home/mcc/execution/CTLCardinality.pnml.gal : 30 ms
[2020-05-22 01:30:56] [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], 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
No direction supplied, using forward translation only.
Parsed 2 CTL formulae.
built 1226 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 6 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 6 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 6 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 6 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.
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.92734e+16,0.375119,13572,117,15,1649,1361,2849,1349,40,2029,0


Converting to forward existential form...Done !
original formula: AG((((((u33.p1_38==0)||(u23.flag_1_25==1))||(i8.u50.p3_10==0))||(i37.u51.p3_12==1))||((u63.flag_1_32!=0)&&(u10.p3_11!=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !((((((u33.p1_38==0)||(u23.flag_1_25==1))||(i8.u50.p3_10==0))||(i37.u51.p3_12==1))||((u63.flag_1_32!=0)&&(u10.p3_11!=1)))))] = FALSE
(forward)formula 0,0,0.376794,13572,1,0,1649,1361,2872,1349,52,2029,199
FORMULA Dekker-PT-050-CTLCardinality-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AF(AG(((i34.u43.p3_48==0)||(u39.p0_44==1))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !(((i34.u43.p3_48==0)||(u39.p0_44==1)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions u0.exit_0, u1.exit_1, u2.exit_2, u5.exit_5, u7.exit_7, u10.exit_11, u15.exit_17, u17.exit_19, u19.exit_21, u20.exit_22, u21.exit_23, u23.exit_25, u24.exit_26, u29.exit_33, u31.exit_35, u32.exit_37, u33.exit_38, u39.exit_44, u40.exit_45, u42.exit_47, u48.exit_8, u53.exit_15, u54.exit_16, u59.exit_28, u63.exit_32, u65.exit_36, i3.exit_3, i4.exit_4, i6.exit_6, i8.exit_10, i10.exit_13, i11.exit_14, i14.exit_20, i18.exit_24, i21.exit_30, i22.exit_31, i24.exit_34, i28.exit_39, i29.exit_41, i30.exit_42, i34.exit_48, i36.exit_9, i37.exit_12, i40.exit_18, i41.exit_27, i43.exit_29, i46.exit_40, i47.exit_43, i48.exit_46, i49.exit_49, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/2550/50/2600
Using saturation style SCC detection
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an 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
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Fast SCC detection found an SCC at level 32
Fast SCC detection found an SCC at level 33
Fast SCC detection found an SCC at level 34
Fast SCC detection found an SCC at level 35
Fast SCC detection found an SCC at level 36
Fast SCC detection found an SCC at level 37
Fast SCC detection found an SCC at level 38
Fast SCC detection found an SCC at level 39
Fast SCC detection found an SCC at level 40
Fast SCC detection found an SCC at level 41
Fast SCC detection found an SCC at level 42
Fast SCC detection found an SCC at level 43
Fast SCC detection found an SCC at level 44
Fast SCC detection found an SCC at level 45
Fast SCC detection found an SCC at level 46
Fast SCC detection found an SCC at level 47
Fast SCC detection found an SCC at level 48
Fast SCC detection found an SCC at level 49
(forward)formula 1,0,1.71727,61596,1,0,158406,1361,21960,76124,386,2029,205824
FORMULA Dekker-PT-050-CTLCardinality-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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


BK_STOP 1590111058867

--------------------
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="Dekker-PT-050"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is Dekker-PT-050, 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 r066-tajo-158922814200331"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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