fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r521-tall-167987246500345
Last Updated
May 14, 2023

About the Execution of LTSMin+red for Murphy-PT-D2N100

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15911.331 3583702.00 14218876.00 2232.70 T??????????????? normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r521-tall-167987246500345.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is Murphy-PT-D2N100, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r521-tall-167987246500345
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 6.6K Mar 23 15:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Mar 23 15:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Mar 23 15:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Mar 23 15:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K Mar 23 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Mar 23 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 23 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 23 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 16K Mar 23 15:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 178K Mar 23 15:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Mar 23 15:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Mar 23 15:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 23 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.3K Mar 23 07:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 26 22:42 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 12K Mar 31 16:48 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 Murphy-PT-D2N100-CTLCardinality-00
FORMULA_NAME Murphy-PT-D2N100-CTLCardinality-01
FORMULA_NAME Murphy-PT-D2N100-CTLCardinality-02
FORMULA_NAME Murphy-PT-D2N100-CTLCardinality-03
FORMULA_NAME Murphy-PT-D2N100-CTLCardinality-04
FORMULA_NAME Murphy-PT-D2N100-CTLCardinality-05
FORMULA_NAME Murphy-PT-D2N100-CTLCardinality-06
FORMULA_NAME Murphy-PT-D2N100-CTLCardinality-07
FORMULA_NAME Murphy-PT-D2N100-CTLCardinality-08
FORMULA_NAME Murphy-PT-D2N100-CTLCardinality-09
FORMULA_NAME Murphy-PT-D2N100-CTLCardinality-10
FORMULA_NAME Murphy-PT-D2N100-CTLCardinality-11
FORMULA_NAME Murphy-PT-D2N100-CTLCardinality-12
FORMULA_NAME Murphy-PT-D2N100-CTLCardinality-13
FORMULA_NAME Murphy-PT-D2N100-CTLCardinality-14
FORMULA_NAME Murphy-PT-D2N100-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1680905436642

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Murphy-PT-D2N100
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202304061127
[2023-04-07 22:10:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-04-07 22:10:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 22:10:38] [INFO ] Load time of PNML (sax parser for PT used): 23 ms
[2023-04-07 22:10:38] [INFO ] Transformed 18 places.
[2023-04-07 22:10:38] [INFO ] Transformed 21 transitions.
[2023-04-07 22:10:38] [INFO ] Parsed PT model containing 18 places and 21 transitions and 81 arcs in 137 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 20 ms.
Initial state reduction rules removed 1 formulas.
FORMULA Murphy-PT-D2N100-CTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 18 out of 18 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 9 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
// Phase 1: matrix 21 rows 18 cols
[2023-04-07 22:10:38] [INFO ] Computed 4 invariants in 5 ms
[2023-04-07 22:10:39] [INFO ] Dead Transitions using invariants and state equation in 170 ms found 0 transitions.
[2023-04-07 22:10:39] [INFO ] Invariant cache hit.
[2023-04-07 22:10:39] [INFO ] Implicit Places using invariants in 34 ms returned []
[2023-04-07 22:10:39] [INFO ] Invariant cache hit.
[2023-04-07 22:10:39] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-07 22:10:39] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
[2023-04-07 22:10:39] [INFO ] Invariant cache hit.
[2023-04-07 22:10:39] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 358 ms. Remains : 18/18 places, 21/21 transitions.
Support contains 18 out of 18 places after structural reductions.
[2023-04-07 22:10:39] [INFO ] Flatten gal took : 16 ms
[2023-04-07 22:10:39] [INFO ] Flatten gal took : 9 ms
[2023-04-07 22:10:39] [INFO ] Input system was already deterministic with 21 transitions.
Incomplete random walk after 10035 steps, including 2 resets, run finished after 173 ms. (steps per millisecond=58 ) properties (out of 76) seen :48
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=27 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 28) seen :0
Running SMT prover for 28 properties.
[2023-04-07 22:10:39] [INFO ] Invariant cache hit.
[2023-04-07 22:10:40] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-07 22:10:40] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-04-07 22:10:40] [INFO ] After 412ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:28
[2023-04-07 22:10:40] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-07 22:10:40] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-04-07 22:10:40] [INFO ] After 142ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :28
[2023-04-07 22:10:40] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-07 22:10:40] [INFO ] After 62ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :28
[2023-04-07 22:10:41] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 4 ms to minimize.
[2023-04-07 22:10:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 29 ms
[2023-04-07 22:10:41] [INFO ] Deduced a trap composed of 2 places in 13 ms of which 1 ms to minimize.
[2023-04-07 22:10:41] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 2 ms to minimize.
[2023-04-07 22:10:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 50 ms
[2023-04-07 22:10:41] [INFO ] Deduced a trap composed of 2 places in 117 ms of which 23 ms to minimize.
[2023-04-07 22:10:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 143 ms
[2023-04-07 22:10:41] [INFO ] Deduced a trap composed of 3 places in 118 ms of which 20 ms to minimize.
[2023-04-07 22:10:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 123 ms
[2023-04-07 22:10:41] [INFO ] After 543ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :28
Attempting to minimize the solution found.
Minimization took 136 ms.
[2023-04-07 22:10:41] [INFO ] After 1193ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :28
Parikh walk visited 0 properties in 388 ms.
Support contains 15 out of 18 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 6 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-07 22:10:42] [INFO ] Invariant cache hit.
[2023-04-07 22:10:42] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 88 ms. Remains : 18/18 places, 21/21 transitions.
Incomplete random walk after 10014 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=244 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=1001 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 28) seen :0
Interrupted probabilistic random walk after 306217 steps, run timeout after 3001 ms. (steps per millisecond=102 ) properties seen :{}
Probabilistic random walk after 306217 steps, saw 199855 distinct states, run finished after 3002 ms. (steps per millisecond=102 ) properties seen :0
Running SMT prover for 28 properties.
[2023-04-07 22:10:45] [INFO ] Invariant cache hit.
[2023-04-07 22:10:45] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-07 22:10:45] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 3 ms returned sat
[2023-04-07 22:10:45] [INFO ] After 147ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:28
[2023-04-07 22:10:45] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-07 22:10:45] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-04-07 22:10:45] [INFO ] After 50ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :28
[2023-04-07 22:10:45] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-07 22:10:45] [INFO ] After 42ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :28
[2023-04-07 22:10:45] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 1 ms to minimize.
[2023-04-07 22:10:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 21 ms
[2023-04-07 22:10:45] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 0 ms to minimize.
[2023-04-07 22:10:45] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 0 ms to minimize.
[2023-04-07 22:10:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 36 ms
[2023-04-07 22:10:45] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 0 ms to minimize.
[2023-04-07 22:10:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 24 ms
[2023-04-07 22:10:45] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-04-07 22:10:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 32 ms
[2023-04-07 22:10:45] [INFO ] After 242ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :28
Attempting to minimize the solution found.
Minimization took 60 ms.
[2023-04-07 22:10:45] [INFO ] After 430ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :28
Parikh walk visited 0 properties in 141 ms.
Support contains 15 out of 18 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 18/18 places, 21/21 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-07 22:10:46] [INFO ] Invariant cache hit.
[2023-04-07 22:10:46] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-04-07 22:10:46] [INFO ] Invariant cache hit.
[2023-04-07 22:10:46] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-07 22:10:46] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2023-04-07 22:10:46] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 22:10:46] [INFO ] Invariant cache hit.
[2023-04-07 22:10:46] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 105 ms. Remains : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Running SMT prover for 28 properties.
[2023-04-07 22:10:46] [INFO ] Invariant cache hit.
[2023-04-07 22:10:46] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-07 22:10:46] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 11 ms returned sat
[2023-04-07 22:10:46] [INFO ] After 122ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:28
[2023-04-07 22:10:46] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-07 22:10:46] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-04-07 22:10:46] [INFO ] After 61ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :28
[2023-04-07 22:10:46] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-07 22:10:46] [INFO ] After 47ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :28
[2023-04-07 22:10:46] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 0 ms to minimize.
[2023-04-07 22:10:46] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2023-04-07 22:10:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 57 ms
[2023-04-07 22:10:46] [INFO ] Deduced a trap composed of 2 places in 13 ms of which 0 ms to minimize.
[2023-04-07 22:10:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 17 ms
[2023-04-07 22:10:46] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 0 ms to minimize.
[2023-04-07 22:10:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 21 ms
[2023-04-07 22:10:46] [INFO ] After 229ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :28
Attempting to minimize the solution found.
Minimization took 39 ms.
[2023-04-07 22:10:46] [INFO ] After 384ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :28
[2023-04-07 22:10:46] [INFO ] Flatten gal took : 3 ms
[2023-04-07 22:10:46] [INFO ] Flatten gal took : 3 ms
[2023-04-07 22:10:46] [INFO ] Input system was already deterministic with 21 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-07 22:10:46] [INFO ] Invariant cache hit.
[2023-04-07 22:10:46] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26 ms. Remains : 18/18 places, 21/21 transitions.
[2023-04-07 22:10:46] [INFO ] Flatten gal took : 3 ms
[2023-04-07 22:10:46] [INFO ] Flatten gal took : 2 ms
[2023-04-07 22:10:46] [INFO ] Input system was already deterministic with 21 transitions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-07 22:10:46] [INFO ] Invariant cache hit.
[2023-04-07 22:10:46] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25 ms. Remains : 18/18 places, 21/21 transitions.
[2023-04-07 22:10:46] [INFO ] Flatten gal took : 2 ms
[2023-04-07 22:10:46] [INFO ] Flatten gal took : 2 ms
[2023-04-07 22:10:46] [INFO ] Input system was already deterministic with 21 transitions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-07 22:10:46] [INFO ] Invariant cache hit.
[2023-04-07 22:10:46] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56 ms. Remains : 18/18 places, 21/21 transitions.
[2023-04-07 22:10:46] [INFO ] Flatten gal took : 2 ms
[2023-04-07 22:10:46] [INFO ] Flatten gal took : 1 ms
[2023-04-07 22:10:46] [INFO ] Input system was already deterministic with 21 transitions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-07 22:10:46] [INFO ] Invariant cache hit.
[2023-04-07 22:10:46] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36 ms. Remains : 18/18 places, 21/21 transitions.
[2023-04-07 22:10:46] [INFO ] Flatten gal took : 2 ms
[2023-04-07 22:10:46] [INFO ] Flatten gal took : 2 ms
[2023-04-07 22:10:46] [INFO ] Input system was already deterministic with 21 transitions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-07 22:10:46] [INFO ] Invariant cache hit.
[2023-04-07 22:10:46] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37 ms. Remains : 18/18 places, 21/21 transitions.
[2023-04-07 22:10:46] [INFO ] Flatten gal took : 1 ms
[2023-04-07 22:10:46] [INFO ] Flatten gal took : 1 ms
[2023-04-07 22:10:46] [INFO ] Input system was already deterministic with 21 transitions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-07 22:10:46] [INFO ] Invariant cache hit.
[2023-04-07 22:10:46] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32 ms. Remains : 18/18 places, 21/21 transitions.
[2023-04-07 22:10:46] [INFO ] Flatten gal took : 1 ms
[2023-04-07 22:10:46] [INFO ] Flatten gal took : 2 ms
[2023-04-07 22:10:46] [INFO ] Input system was already deterministic with 21 transitions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-07 22:10:46] [INFO ] Invariant cache hit.
[2023-04-07 22:10:47] [INFO ] Dead Transitions using invariants and state equation in 164 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 165 ms. Remains : 18/18 places, 21/21 transitions.
[2023-04-07 22:10:47] [INFO ] Flatten gal took : 2 ms
[2023-04-07 22:10:47] [INFO ] Flatten gal took : 1 ms
[2023-04-07 22:10:47] [INFO ] Input system was already deterministic with 21 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 2 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-07 22:10:47] [INFO ] Invariant cache hit.
[2023-04-07 22:10:47] [INFO ] Dead Transitions using invariants and state equation in 148 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 151 ms. Remains : 18/18 places, 21/21 transitions.
[2023-04-07 22:10:47] [INFO ] Flatten gal took : 6 ms
[2023-04-07 22:10:47] [INFO ] Flatten gal took : 2 ms
[2023-04-07 22:10:47] [INFO ] Input system was already deterministic with 21 transitions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-07 22:10:47] [INFO ] Invariant cache hit.
[2023-04-07 22:10:47] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36 ms. Remains : 18/18 places, 21/21 transitions.
[2023-04-07 22:10:47] [INFO ] Flatten gal took : 2 ms
[2023-04-07 22:10:47] [INFO ] Flatten gal took : 1 ms
[2023-04-07 22:10:47] [INFO ] Input system was already deterministic with 21 transitions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-07 22:10:47] [INFO ] Invariant cache hit.
[2023-04-07 22:10:47] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 75 ms. Remains : 18/18 places, 21/21 transitions.
[2023-04-07 22:10:47] [INFO ] Flatten gal took : 1 ms
[2023-04-07 22:10:47] [INFO ] Flatten gal took : 13 ms
[2023-04-07 22:10:47] [INFO ] Input system was already deterministic with 21 transitions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-07 22:10:47] [INFO ] Invariant cache hit.
[2023-04-07 22:10:47] [INFO ] Dead Transitions using invariants and state equation in 167 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 168 ms. Remains : 18/18 places, 21/21 transitions.
[2023-04-07 22:10:47] [INFO ] Flatten gal took : 2 ms
[2023-04-07 22:10:47] [INFO ] Flatten gal took : 2 ms
[2023-04-07 22:10:47] [INFO ] Input system was already deterministic with 21 transitions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-07 22:10:47] [INFO ] Invariant cache hit.
[2023-04-07 22:10:47] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50 ms. Remains : 18/18 places, 21/21 transitions.
[2023-04-07 22:10:47] [INFO ] Flatten gal took : 1 ms
[2023-04-07 22:10:47] [INFO ] Flatten gal took : 1 ms
[2023-04-07 22:10:47] [INFO ] Input system was already deterministic with 21 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-07 22:10:47] [INFO ] Invariant cache hit.
[2023-04-07 22:10:47] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 30 ms. Remains : 18/18 places, 21/21 transitions.
[2023-04-07 22:10:47] [INFO ] Flatten gal took : 2 ms
[2023-04-07 22:10:47] [INFO ] Flatten gal took : 1 ms
[2023-04-07 22:10:47] [INFO ] Input system was already deterministic with 21 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-07 22:10:47] [INFO ] Invariant cache hit.
[2023-04-07 22:10:47] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 32 ms. Remains : 18/18 places, 21/21 transitions.
[2023-04-07 22:10:47] [INFO ] Flatten gal took : 1 ms
[2023-04-07 22:10:47] [INFO ] Flatten gal took : 4 ms
[2023-04-07 22:10:47] [INFO ] Input system was already deterministic with 21 transitions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-07 22:10:47] [INFO ] Invariant cache hit.
[2023-04-07 22:10:47] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46 ms. Remains : 18/18 places, 21/21 transitions.
[2023-04-07 22:10:47] [INFO ] Flatten gal took : 1 ms
[2023-04-07 22:10:47] [INFO ] Flatten gal took : 1 ms
[2023-04-07 22:10:47] [INFO ] Input system was already deterministic with 21 transitions.
[2023-04-07 22:10:47] [INFO ] Flatten gal took : 2 ms
[2023-04-07 22:10:47] [INFO ] Flatten gal took : 1 ms
[2023-04-07 22:10:47] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2023-04-07 22:10:47] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 18 places, 21 transitions and 81 arcs took 0 ms.
Total runtime 9218 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --ctl=/tmp/608/ctl_0_ --ctl=/tmp/608/ctl_1_ --ctl=/tmp/608/ctl_2_ --ctl=/tmp/608/ctl_3_ --ctl=/tmp/608/ctl_4_ --ctl=/tmp/608/ctl_5_ --ctl=/tmp/608/ctl_6_ --ctl=/tmp/608/ctl_7_ --ctl=/tmp/608/ctl_8_ --ctl=/tmp/608/ctl_9_ --ctl=/tmp/608/ctl_10_ --ctl=/tmp/608/ctl_11_ --ctl=/tmp/608/ctl_12_ --ctl=/tmp/608/ctl_13_ --ctl=/tmp/608/ctl_14_ --mu-par --mu-opt
TIME LIMIT: Killed by timeout after 3570 seconds
MemTotal: 16393216 kB
MemFree: 340068 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16103676 kB
Could not compute solution for formula : Murphy-PT-D2N100-CTLCardinality-01
Could not compute solution for formula : Murphy-PT-D2N100-CTLCardinality-02
Could not compute solution for formula : Murphy-PT-D2N100-CTLCardinality-03
Could not compute solution for formula : Murphy-PT-D2N100-CTLCardinality-04
Could not compute solution for formula : Murphy-PT-D2N100-CTLCardinality-05
Could not compute solution for formula : Murphy-PT-D2N100-CTLCardinality-06
Could not compute solution for formula : Murphy-PT-D2N100-CTLCardinality-07
Could not compute solution for formula : Murphy-PT-D2N100-CTLCardinality-08
Could not compute solution for formula : Murphy-PT-D2N100-CTLCardinality-09
Could not compute solution for formula : Murphy-PT-D2N100-CTLCardinality-10
Could not compute solution for formula : Murphy-PT-D2N100-CTLCardinality-11
Could not compute solution for formula : Murphy-PT-D2N100-CTLCardinality-12
Could not compute solution for formula : Murphy-PT-D2N100-CTLCardinality-13
Could not compute solution for formula : Murphy-PT-D2N100-CTLCardinality-14
Could not compute solution for formula : Murphy-PT-D2N100-CTLCardinality-15

BK_STOP 1680909020344

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -timeout 360 -rebuildPNML
mcc2023
ctl formula name Murphy-PT-D2N100-CTLCardinality-01
ctl formula formula --ctl=/tmp/608/ctl_0_
ctl formula name Murphy-PT-D2N100-CTLCardinality-02
ctl formula formula --ctl=/tmp/608/ctl_1_
ctl formula name Murphy-PT-D2N100-CTLCardinality-03
ctl formula formula --ctl=/tmp/608/ctl_2_
ctl formula name Murphy-PT-D2N100-CTLCardinality-04
ctl formula formula --ctl=/tmp/608/ctl_3_
ctl formula name Murphy-PT-D2N100-CTLCardinality-05
ctl formula formula --ctl=/tmp/608/ctl_4_
ctl formula name Murphy-PT-D2N100-CTLCardinality-06
ctl formula formula --ctl=/tmp/608/ctl_5_
ctl formula name Murphy-PT-D2N100-CTLCardinality-07
ctl formula formula --ctl=/tmp/608/ctl_6_
ctl formula name Murphy-PT-D2N100-CTLCardinality-08
ctl formula formula --ctl=/tmp/608/ctl_7_
ctl formula name Murphy-PT-D2N100-CTLCardinality-09
ctl formula formula --ctl=/tmp/608/ctl_8_
ctl formula name Murphy-PT-D2N100-CTLCardinality-10
ctl formula formula --ctl=/tmp/608/ctl_9_
ctl formula name Murphy-PT-D2N100-CTLCardinality-11
ctl formula formula --ctl=/tmp/608/ctl_10_
ctl formula name Murphy-PT-D2N100-CTLCardinality-12
ctl formula formula --ctl=/tmp/608/ctl_11_
ctl formula name Murphy-PT-D2N100-CTLCardinality-13
ctl formula formula --ctl=/tmp/608/ctl_12_
ctl formula name Murphy-PT-D2N100-CTLCardinality-14
ctl formula formula --ctl=/tmp/608/ctl_13_
ctl formula name Murphy-PT-D2N100-CTLCardinality-15
ctl formula formula --ctl=/tmp/608/ctl_14_
pnml2lts-sym: Exploration order is bfs-prev
pnml2lts-sym: Saturation strategy is sat
pnml2lts-sym: Guided search strategy is unguided
pnml2lts-sym: Attractor strategy is default
pnml2lts-sym: opening model.pnml
pnml2lts-sym: Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-sym: Petri net has 18 places, 21 transitions and 81 arcs
pnml2lts-sym: Petri net Petri analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-sym: Initializing regrouping layer
pnml2lts-sym: Regroup specification: bs,w2W,ru,hf
pnml2lts-sym: Regroup Boost's Sloan
pnml2lts-sym: Regroup over-approximate must-write to may-write
pnml2lts-sym: Regroup Row sUbsume
pnml2lts-sym: Reqroup Horizontal Flip
pnml2lts-sym: Regrouping: 21->9 groups
pnml2lts-sym: Regrouping took 0.010 real 0.000 user 0.000 sys
pnml2lts-sym: state vector length is 18; there are 9 groups
pnml2lts-sym: Creating a multi-core ListDD domain.
pnml2lts-sym: Sylvan allocates 15.000 GB virtual memory for nodes table and operation cache.
pnml2lts-sym: Initial nodes table and operation cache requires 60.00 MB.
pnml2lts-sym: Using GBgetTransitionsShortR2W as next-state function
pnml2lts-sym: got initial state
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
Killing (15) : 614
Killing (9) : 614

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="Murphy-PT-D2N100"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="ltsminxred"
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-5348"
echo " Executing tool ltsminxred"
echo " Input is Murphy-PT-D2N100, 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 r521-tall-167987246500345"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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