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.r137-smll-167819417100017.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 Dekker-PT-020, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r137-smll-167819417100017
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 680K
-rw-r--r-- 1 mcc users 6.3K Feb 26 01:42 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K Feb 26 01:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 26 01:41 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 26 01:41 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Feb 25 15:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 26 01:43 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 160K Feb 26 01:43 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 26 01:43 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 30K Feb 26 01:43 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:56 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 247K Mar 5 18:22 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-020-CTLCardinality-00
FORMULA_NAME Dekker-PT-020-CTLCardinality-01
FORMULA_NAME Dekker-PT-020-CTLCardinality-02
FORMULA_NAME Dekker-PT-020-CTLCardinality-03
FORMULA_NAME Dekker-PT-020-CTLCardinality-04
FORMULA_NAME Dekker-PT-020-CTLCardinality-05
FORMULA_NAME Dekker-PT-020-CTLCardinality-06
FORMULA_NAME Dekker-PT-020-CTLCardinality-07
FORMULA_NAME Dekker-PT-020-CTLCardinality-08
FORMULA_NAME Dekker-PT-020-CTLCardinality-09
FORMULA_NAME Dekker-PT-020-CTLCardinality-10
FORMULA_NAME Dekker-PT-020-CTLCardinality-11
FORMULA_NAME Dekker-PT-020-CTLCardinality-12
FORMULA_NAME Dekker-PT-020-CTLCardinality-13
FORMULA_NAME Dekker-PT-020-CTLCardinality-14
FORMULA_NAME Dekker-PT-020-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678518283071

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=Dekker-PT-020
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-11 07:04:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-11 07:04:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 07:04:46] [INFO ] Load time of PNML (sax parser for PT used): 141 ms
[2023-03-11 07:04:46] [INFO ] Transformed 100 places.
[2023-03-11 07:04:46] [INFO ] Transformed 440 transitions.
[2023-03-11 07:04:46] [INFO ] Found NUPN structural information;
[2023-03-11 07:04:46] [INFO ] Parsed PT model containing 100 places and 440 transitions and 3240 arcs in 250 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 16 ms.
Initial state reduction rules removed 3 formulas.
FORMULA Dekker-PT-020-CTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-020-CTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-020-CTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-020-CTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 57 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 440/440 transitions.
Applied a total of 0 rules in 29 ms. Remains 100 /100 variables (removed 0) and now considering 440/440 (removed 0) transitions.
[2023-03-11 07:04:46] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 100 cols
[2023-03-11 07:04:46] [INFO ] Computed 60 place invariants in 13 ms
[2023-03-11 07:04:46] [INFO ] Implicit Places using invariants in 496 ms returned [40, 52, 55, 67, 70, 73, 76, 79, 82, 97]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 543 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 90/100 places, 440/440 transitions.
Applied a total of 0 rules in 8 ms. Remains 90 /90 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 581 ms. Remains : 90/100 places, 440/440 transitions.
Support contains 57 out of 90 places after structural reductions.
[2023-03-11 07:04:47] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-11 07:04:47] [INFO ] Flatten gal took : 112 ms
[2023-03-11 07:04:47] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA Dekker-PT-020-CTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-020-CTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-11 07:04:47] [INFO ] Flatten gal took : 57 ms
[2023-03-11 07:04:47] [INFO ] Input system was already deterministic with 440 transitions.
Support contains 51 out of 90 places (down from 57) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 681 ms. (steps per millisecond=14 ) properties (out of 36) seen :31
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-11 07:04:48] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 90 cols
[2023-03-11 07:04:48] [INFO ] Computed 50 place invariants in 10 ms
[2023-03-11 07:04:48] [INFO ] [Real]Absence check using 40 positive place invariants in 12 ms returned sat
[2023-03-11 07:04:48] [INFO ] [Real]Absence check using 40 positive and 10 generalized place invariants in 3 ms returned sat
[2023-03-11 07:04:48] [INFO ] After 96ms SMT Verify possible using state equation in real domain returned unsat :0 sat :5
[2023-03-11 07:04:48] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-03-11 07:04:48] [INFO ] After 56ms SMT Verify possible using 20 Read/Feed constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-11 07:04:48] [INFO ] After 305ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-11 07:04:48] [INFO ] [Nat]Absence check using 40 positive place invariants in 16 ms returned sat
[2023-03-11 07:04:48] [INFO ] [Nat]Absence check using 40 positive and 10 generalized place invariants in 5 ms returned sat
[2023-03-11 07:04:48] [INFO ] After 101ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-11 07:04:48] [INFO ] After 45ms SMT Verify possible using 20 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-11 07:04:49] [INFO ] Deduced a trap composed of 4 places in 91 ms of which 9 ms to minimize.
[2023-03-11 07:04:49] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 1 ms to minimize.
[2023-03-11 07:04:49] [INFO ] Deduced a trap composed of 6 places in 65 ms of which 1 ms to minimize.
[2023-03-11 07:04:49] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 2 ms to minimize.
[2023-03-11 07:04:49] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 1 ms to minimize.
[2023-03-11 07:04:49] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 1 ms to minimize.
[2023-03-11 07:04:49] [INFO ] Deduced a trap composed of 6 places in 52 ms of which 1 ms to minimize.
[2023-03-11 07:04:49] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
[2023-03-11 07:04:49] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 1 ms to minimize.
[2023-03-11 07:04:49] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 1 ms to minimize.
[2023-03-11 07:04:49] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
[2023-03-11 07:04:49] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
[2023-03-11 07:04:49] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
[2023-03-11 07:04:49] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
[2023-03-11 07:04:49] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
[2023-03-11 07:04:49] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2023-03-11 07:04:50] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
[2023-03-11 07:04:50] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2023-03-11 07:04:50] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1032 ms
[2023-03-11 07:04:50] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 1033 ms
[2023-03-11 07:04:50] [INFO ] After 1157ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 38 ms.
[2023-03-11 07:04:50] [INFO ] After 1421ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 3 ms.
Support contains 7 out of 90 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 440/440 transitions.
Applied a total of 0 rules in 44 ms. Remains 90 /90 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 90/90 places, 440/440 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 232 ms. (steps per millisecond=43 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-11 07:04:50] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
[2023-03-11 07:04:50] [INFO ] Invariant cache hit.
[2023-03-11 07:04:50] [INFO ] [Real]Absence check using 40 positive place invariants in 13 ms returned sat
[2023-03-11 07:04:50] [INFO ] [Real]Absence check using 40 positive and 10 generalized place invariants in 4 ms returned sat
[2023-03-11 07:04:50] [INFO ] After 70ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3 real:1
[2023-03-11 07:04:50] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-03-11 07:04:50] [INFO ] After 27ms SMT Verify possible using 20 Read/Feed constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-11 07:04:50] [INFO ] After 181ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-11 07:04:50] [INFO ] [Nat]Absence check using 40 positive place invariants in 14 ms returned sat
[2023-03-11 07:04:50] [INFO ] [Nat]Absence check using 40 positive and 10 generalized place invariants in 3 ms returned sat
[2023-03-11 07:04:50] [INFO ] After 74ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-11 07:04:50] [INFO ] After 31ms SMT Verify possible using 20 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-11 07:04:50] [INFO ] Deduced a trap composed of 6 places in 44 ms of which 1 ms to minimize.
[2023-03-11 07:04:51] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 1 ms to minimize.
[2023-03-11 07:04:51] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 0 ms to minimize.
[2023-03-11 07:04:51] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 8 ms to minimize.
[2023-03-11 07:04:51] [INFO ] Deduced a trap composed of 6 places in 40 ms of which 1 ms to minimize.
[2023-03-11 07:04:51] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2023-03-11 07:04:51] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 1 ms to minimize.
[2023-03-11 07:04:51] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2023-03-11 07:04:51] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 1 ms to minimize.
[2023-03-11 07:04:51] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 0 ms to minimize.
[2023-03-11 07:04:51] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2023-03-11 07:04:51] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2023-03-11 07:04:51] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2023-03-11 07:04:51] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2023-03-11 07:04:51] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2023-03-11 07:04:51] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2023-03-11 07:04:51] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 639 ms
[2023-03-11 07:04:51] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2023-03-11 07:04:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 34 ms
[2023-03-11 07:04:51] [INFO ] After 741ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 28 ms.
[2023-03-11 07:04:51] [INFO ] After 926ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 6 out of 90 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 440/440 transitions.
Applied a total of 0 rules in 34 ms. Remains 90 /90 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 90/90 places, 440/440 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 262 ms. (steps per millisecond=38 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 230349 steps, run timeout after 3001 ms. (steps per millisecond=76 ) properties seen :{}
Probabilistic random walk after 230349 steps, saw 125706 distinct states, run finished after 3004 ms. (steps per millisecond=76 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-11 07:04:55] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
[2023-03-11 07:04:55] [INFO ] Invariant cache hit.
[2023-03-11 07:04:55] [INFO ] [Real]Absence check using 40 positive place invariants in 12 ms returned sat
[2023-03-11 07:04:55] [INFO ] [Real]Absence check using 40 positive and 10 generalized place invariants in 5 ms returned sat
[2023-03-11 07:04:55] [INFO ] After 83ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3 real:1
[2023-03-11 07:04:55] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-03-11 07:04:55] [INFO ] After 29ms SMT Verify possible using 20 Read/Feed constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-11 07:04:55] [INFO ] After 208ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-11 07:04:55] [INFO ] [Nat]Absence check using 40 positive place invariants in 11 ms returned sat
[2023-03-11 07:04:55] [INFO ] [Nat]Absence check using 40 positive and 10 generalized place invariants in 4 ms returned sat
[2023-03-11 07:04:55] [INFO ] After 67ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-11 07:04:55] [INFO ] After 32ms SMT Verify possible using 20 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-11 07:04:55] [INFO ] Deduced a trap composed of 6 places in 47 ms of which 1 ms to minimize.
[2023-03-11 07:04:55] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 1 ms to minimize.
[2023-03-11 07:04:55] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 0 ms to minimize.
[2023-03-11 07:04:55] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
[2023-03-11 07:04:55] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 1 ms to minimize.
[2023-03-11 07:04:55] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
[2023-03-11 07:04:55] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 1 ms to minimize.
[2023-03-11 07:04:55] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2023-03-11 07:04:55] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 1 ms to minimize.
[2023-03-11 07:04:55] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 1 ms to minimize.
[2023-03-11 07:04:55] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2023-03-11 07:04:55] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2023-03-11 07:04:55] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2023-03-11 07:04:55] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2023-03-11 07:04:56] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2023-03-11 07:04:56] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2023-03-11 07:04:56] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 618 ms
[2023-03-11 07:04:56] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2023-03-11 07:04:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 32 ms
[2023-03-11 07:04:56] [INFO ] After 718ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 27 ms.
[2023-03-11 07:04:56] [INFO ] After 896ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 6 out of 90 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 440/440 transitions.
Applied a total of 0 rules in 24 ms. Remains 90 /90 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 90/90 places, 440/440 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 440/440 transitions.
Applied a total of 0 rules in 28 ms. Remains 90 /90 variables (removed 0) and now considering 440/440 (removed 0) transitions.
[2023-03-11 07:04:56] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
[2023-03-11 07:04:56] [INFO ] Invariant cache hit.
[2023-03-11 07:04:56] [INFO ] Implicit Places using invariants in 208 ms returned [42, 45, 48, 55, 58, 61, 76, 79, 82, 85]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 210 ms to find 10 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 80/90 places, 440/440 transitions.
Applied a total of 0 rules in 16 ms. Remains 80 /80 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 255 ms. Remains : 80/90 places, 440/440 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 280 ms. (steps per millisecond=35 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 246498 steps, run timeout after 3001 ms. (steps per millisecond=82 ) properties seen :{}
Probabilistic random walk after 246498 steps, saw 138128 distinct states, run finished after 3001 ms. (steps per millisecond=82 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-11 07:04:59] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 80 cols
[2023-03-11 07:04:59] [INFO ] Computed 40 place invariants in 2 ms
[2023-03-11 07:04:59] [INFO ] [Real]Absence check using 40 positive place invariants in 11 ms returned sat
[2023-03-11 07:04:59] [INFO ] After 70ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:2
[2023-03-11 07:04:59] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-03-11 07:04:59] [INFO ] After 18ms SMT Verify possible using 20 Read/Feed constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-11 07:04:59] [INFO ] After 164ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-11 07:05:00] [INFO ] [Nat]Absence check using 40 positive place invariants in 12 ms returned sat
[2023-03-11 07:05:00] [INFO ] After 61ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-11 07:05:00] [INFO ] After 27ms SMT Verify possible using 20 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-11 07:05:00] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 1 ms to minimize.
[2023-03-11 07:05:00] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 3 ms to minimize.
[2023-03-11 07:05:00] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 3 ms to minimize.
[2023-03-11 07:05:00] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2023-03-11 07:05:00] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2023-03-11 07:05:00] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2023-03-11 07:05:00] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2023-03-11 07:05:00] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2023-03-11 07:05:00] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2023-03-11 07:05:00] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2023-03-11 07:05:00] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2023-03-11 07:05:00] [INFO ] Trap strengthening procedure interrupted after too many repetitions 434 ms
[2023-03-11 07:05:00] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 434 ms
[2023-03-11 07:05:00] [INFO ] After 504ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 30 ms.
[2023-03-11 07:05:00] [INFO ] After 669ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 6 out of 80 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 80/80 places, 440/440 transitions.
Applied a total of 0 rules in 15 ms. Remains 80 /80 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 80/80 places, 440/440 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 80/80 places, 440/440 transitions.
Applied a total of 0 rules in 12 ms. Remains 80 /80 variables (removed 0) and now considering 440/440 (removed 0) transitions.
[2023-03-11 07:05:00] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
[2023-03-11 07:05:00] [INFO ] Invariant cache hit.
[2023-03-11 07:05:00] [INFO ] Implicit Places using invariants in 165 ms returned []
[2023-03-11 07:05:00] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
[2023-03-11 07:05:00] [INFO ] Invariant cache hit.
[2023-03-11 07:05:00] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-03-11 07:05:01] [INFO ] Implicit Places using invariants and state equation in 223 ms returned []
Implicit Place search using SMT with State Equation took 395 ms to find 0 implicit places.
[2023-03-11 07:05:01] [INFO ] Redundant transitions in 34 ms returned []
[2023-03-11 07:05:01] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
[2023-03-11 07:05:01] [INFO ] Invariant cache hit.
[2023-03-11 07:05:01] [INFO ] Dead Transitions using invariants and state equation in 295 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 747 ms. Remains : 80/80 places, 440/440 transitions.
Graph (complete) has 120 edges and 80 vertex of which 20 are kept as prefixes of interest. Removing 60 places using SCC suffix rule.1 ms
Discarding 60 places :
Also discarding 330 output transitions
Drop transitions removed 330 transitions
Ensure Unique test removed 90 transitions
Reduce isomorphic transitions removed 90 transitions.
Iterating post reduction 0 with 90 rules applied. Total rules applied 91 place count 20 transition count 20
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 97 place count 16 transition count 18
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 99 place count 16 transition count 16
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 100 place count 16 transition count 15
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 103 place count 14 transition count 14
Applied a total of 103 rules in 12 ms. Remains 14 /80 variables (removed 66) and now considering 14/440 (removed 426) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 14 rows 14 cols
[2023-03-11 07:05:01] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-11 07:05:01] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2023-03-11 07:05:01] [INFO ] After 14ms SMT Verify possible using state equation in real domain returned unsat :0 sat :4
[2023-03-11 07:05:01] [INFO ] After 27ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:3
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-11 07:05:01] [INFO ] After 60ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-11 07:05:01] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2023-03-11 07:05:01] [INFO ] After 17ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-11 07:05:01] [INFO ] After 31ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 11 ms.
[2023-03-11 07:05:01] [INFO ] After 79ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
[2023-03-11 07:05:01] [INFO ] Flatten gal took : 38 ms
[2023-03-11 07:05:01] [INFO ] Flatten gal took : 39 ms
[2023-03-11 07:05:01] [INFO ] Input system was already deterministic with 440 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 90/90 places, 440/440 transitions.
Applied a total of 0 rules in 2 ms. Remains 90 /90 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 90/90 places, 440/440 transitions.
[2023-03-11 07:05:01] [INFO ] Flatten gal took : 30 ms
[2023-03-11 07:05:01] [INFO ] Flatten gal took : 25 ms
[2023-03-11 07:05:01] [INFO ] Input system was already deterministic with 440 transitions.
Starting structural reductions in LTL mode, iteration 0 : 90/90 places, 440/440 transitions.
Applied a total of 0 rules in 2 ms. Remains 90 /90 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 90/90 places, 440/440 transitions.
[2023-03-11 07:05:01] [INFO ] Flatten gal took : 22 ms
[2023-03-11 07:05:01] [INFO ] Flatten gal took : 24 ms
[2023-03-11 07:05:01] [INFO ] Input system was already deterministic with 440 transitions.
Starting structural reductions in LTL mode, iteration 0 : 90/90 places, 440/440 transitions.
Applied a total of 0 rules in 2 ms. Remains 90 /90 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 90/90 places, 440/440 transitions.
[2023-03-11 07:05:01] [INFO ] Flatten gal took : 21 ms
[2023-03-11 07:05:01] [INFO ] Flatten gal took : 24 ms
[2023-03-11 07:05:02] [INFO ] Input system was already deterministic with 440 transitions.
Starting structural reductions in LTL mode, iteration 0 : 90/90 places, 440/440 transitions.
Applied a total of 0 rules in 2 ms. Remains 90 /90 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 90/90 places, 440/440 transitions.
[2023-03-11 07:05:02] [INFO ] Flatten gal took : 21 ms
[2023-03-11 07:05:02] [INFO ] Flatten gal took : 22 ms
[2023-03-11 07:05:02] [INFO ] Input system was already deterministic with 440 transitions.
Starting structural reductions in LTL mode, iteration 0 : 90/90 places, 440/440 transitions.
Applied a total of 0 rules in 2 ms. Remains 90 /90 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 90/90 places, 440/440 transitions.
[2023-03-11 07:05:02] [INFO ] Flatten gal took : 31 ms
[2023-03-11 07:05:02] [INFO ] Flatten gal took : 20 ms
[2023-03-11 07:05:02] [INFO ] Input system was already deterministic with 440 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 90/90 places, 440/440 transitions.
Applied a total of 0 rules in 20 ms. Remains 90 /90 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 20 ms. Remains : 90/90 places, 440/440 transitions.
[2023-03-11 07:05:02] [INFO ] Flatten gal took : 18 ms
[2023-03-11 07:05:02] [INFO ] Flatten gal took : 19 ms
[2023-03-11 07:05:02] [INFO ] Input system was already deterministic with 440 transitions.
Starting structural reductions in LTL mode, iteration 0 : 90/90 places, 440/440 transitions.
Applied a total of 0 rules in 2 ms. Remains 90 /90 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 90/90 places, 440/440 transitions.
[2023-03-11 07:05:02] [INFO ] Flatten gal took : 27 ms
[2023-03-11 07:05:02] [INFO ] Flatten gal took : 20 ms
[2023-03-11 07:05:02] [INFO ] Input system was already deterministic with 440 transitions.
Starting structural reductions in LTL mode, iteration 0 : 90/90 places, 440/440 transitions.
Applied a total of 0 rules in 2 ms. Remains 90 /90 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 90/90 places, 440/440 transitions.
[2023-03-11 07:05:02] [INFO ] Flatten gal took : 32 ms
[2023-03-11 07:05:02] [INFO ] Flatten gal took : 22 ms
[2023-03-11 07:05:02] [INFO ] Input system was already deterministic with 440 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 90/90 places, 440/440 transitions.
Applied a total of 0 rules in 19 ms. Remains 90 /90 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 21 ms. Remains : 90/90 places, 440/440 transitions.
[2023-03-11 07:05:02] [INFO ] Flatten gal took : 34 ms
[2023-03-11 07:05:02] [INFO ] Flatten gal took : 22 ms
[2023-03-11 07:05:02] [INFO ] Input system was already deterministic with 440 transitions.
Starting structural reductions in LTL mode, iteration 0 : 90/90 places, 440/440 transitions.
Applied a total of 0 rules in 3 ms. Remains 90 /90 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 90/90 places, 440/440 transitions.
[2023-03-11 07:05:02] [INFO ] Flatten gal took : 17 ms
[2023-03-11 07:05:02] [INFO ] Flatten gal took : 36 ms
[2023-03-11 07:05:02] [INFO ] Input system was already deterministic with 440 transitions.
[2023-03-11 07:05:02] [INFO ] Flatten gal took : 19 ms
[2023-03-11 07:05:02] [INFO ] Flatten gal took : 20 ms
[2023-03-11 07:05:02] [INFO ] Export to MCC of 10 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2023-03-11 07:05:02] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 90 places, 440 transitions and 3030 arcs took 5 ms.
Total runtime 17080 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/702/ctl_0_ --ctl=/tmp/702/ctl_1_ --ctl=/tmp/702/ctl_2_ --ctl=/tmp/702/ctl_3_ --ctl=/tmp/702/ctl_4_ --ctl=/tmp/702/ctl_5_ --ctl=/tmp/702/ctl_6_ --ctl=/tmp/702/ctl_7_ --ctl=/tmp/702/ctl_8_ --ctl=/tmp/702/ctl_9_ --mu-par --mu-opt
TIME LIMIT: Killed by timeout after 3570 seconds
MemTotal: 16393216 kB
MemFree: 15271564 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16098256 kB
Could not compute solution for formula : Dekker-PT-020-CTLCardinality-00
Could not compute solution for formula : Dekker-PT-020-CTLCardinality-01
Could not compute solution for formula : Dekker-PT-020-CTLCardinality-02
Could not compute solution for formula : Dekker-PT-020-CTLCardinality-04
Could not compute solution for formula : Dekker-PT-020-CTLCardinality-05
Could not compute solution for formula : Dekker-PT-020-CTLCardinality-06
Could not compute solution for formula : Dekker-PT-020-CTLCardinality-08
Could not compute solution for formula : Dekker-PT-020-CTLCardinality-10
Could not compute solution for formula : Dekker-PT-020-CTLCardinality-11
Could not compute solution for formula : Dekker-PT-020-CTLCardinality-13

BK_STOP 1678521875379

--------------------
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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -timeout 360 -rebuildPNML
mcc2023
ctl formula name Dekker-PT-020-CTLCardinality-00
ctl formula formula --ctl=/tmp/702/ctl_0_
ctl formula name Dekker-PT-020-CTLCardinality-01
ctl formula formula --ctl=/tmp/702/ctl_1_
ctl formula name Dekker-PT-020-CTLCardinality-02
ctl formula formula --ctl=/tmp/702/ctl_2_
ctl formula name Dekker-PT-020-CTLCardinality-04
ctl formula formula --ctl=/tmp/702/ctl_3_
ctl formula name Dekker-PT-020-CTLCardinality-05
ctl formula formula --ctl=/tmp/702/ctl_4_
ctl formula name Dekker-PT-020-CTLCardinality-06
ctl formula formula --ctl=/tmp/702/ctl_5_
ctl formula name Dekker-PT-020-CTLCardinality-08
ctl formula formula --ctl=/tmp/702/ctl_6_
ctl formula name Dekker-PT-020-CTLCardinality-10
ctl formula formula --ctl=/tmp/702/ctl_7_
ctl formula name Dekker-PT-020-CTLCardinality-11
ctl formula formula --ctl=/tmp/702/ctl_8_
ctl formula name Dekker-PT-020-CTLCardinality-13
ctl formula formula --ctl=/tmp/702/ctl_9_
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 90 places, 440 transitions and 3030 arcs
pnml2lts-sym: Petri net Petri analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.020 real 0.010 user 0.010 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: 440->420 groups
pnml2lts-sym: Regrouping took 0.140 real 0.150 user 0.000 sys
pnml2lts-sym: state vector length is 90; there are 420 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: 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) : 708
Killing (9) : 708

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-020"
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 Dekker-PT-020, 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 r137-smll-167819417100017"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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