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.r234-tall-167856420000254.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 marciexred
Input is Kanban-PT-00020, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r234-tall-167856420000254
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 8.6K Feb 25 11:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 100K Feb 25 11:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 25 11:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 25 11:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Feb 25 16:19 LTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Feb 25 16:19 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:19 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:19 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 11:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K Feb 25 11:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 11:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 94K Feb 25 11:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:19 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:19 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 14K 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 Kanban-PT-00020-ReachabilityCardinality-00
FORMULA_NAME Kanban-PT-00020-ReachabilityCardinality-01
FORMULA_NAME Kanban-PT-00020-ReachabilityCardinality-02
FORMULA_NAME Kanban-PT-00020-ReachabilityCardinality-03
FORMULA_NAME Kanban-PT-00020-ReachabilityCardinality-04
FORMULA_NAME Kanban-PT-00020-ReachabilityCardinality-05
FORMULA_NAME Kanban-PT-00020-ReachabilityCardinality-06
FORMULA_NAME Kanban-PT-00020-ReachabilityCardinality-07
FORMULA_NAME Kanban-PT-00020-ReachabilityCardinality-08
FORMULA_NAME Kanban-PT-00020-ReachabilityCardinality-09
FORMULA_NAME Kanban-PT-00020-ReachabilityCardinality-10
FORMULA_NAME Kanban-PT-00020-ReachabilityCardinality-11
FORMULA_NAME Kanban-PT-00020-ReachabilityCardinality-12
FORMULA_NAME Kanban-PT-00020-ReachabilityCardinality-13
FORMULA_NAME Kanban-PT-00020-ReachabilityCardinality-14
FORMULA_NAME Kanban-PT-00020-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679466534877

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=marciexred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Kanban-PT-00020
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 06:28:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-22 06:28:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 06:28:56] [INFO ] Load time of PNML (sax parser for PT used): 20 ms
[2023-03-22 06:28:56] [INFO ] Transformed 16 places.
[2023-03-22 06:28:56] [INFO ] Transformed 16 transitions.
[2023-03-22 06:28:56] [INFO ] Parsed PT model containing 16 places and 16 transitions and 40 arcs in 74 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
FORMULA Kanban-PT-00020-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10003 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 15) seen :13
FORMULA Kanban-PT-00020-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Kanban-PT-00020-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Kanban-PT-00020-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Kanban-PT-00020-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Kanban-PT-00020-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Kanban-PT-00020-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Kanban-PT-00020-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Kanban-PT-00020-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Kanban-PT-00020-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Kanban-PT-00020-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Kanban-PT-00020-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Kanban-PT-00020-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Kanban-PT-00020-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 16 rows 16 cols
[2023-03-22 06:28:56] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-22 06:28:57] [INFO ] After 376ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 06:28:57] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2023-03-22 06:28:57] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-22 06:28:57] [INFO ] After 15ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-03-22 06:28:57] [INFO ] After 21ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-22 06:28:57] [INFO ] After 88ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
FORMULA Kanban-PT-00020-ReachabilityCardinality-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 184 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=92 )
FORMULA Kanban-PT-00020-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 3 ms.
All properties solved without resorting to model-checking.
Total runtime 808 ms.
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=ReachabilityCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Kanban_PT_00020
(NrP: 16 NrTr: 16 NrArc: 40)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec

net check time: 0m 0.000sec

init dd package: 0m 2.767sec


RS generation: 0m 0.011sec


-> reachability set: #nodes 696 (7.0e+02) #states 805,422,366,595 (11)



starting MCC model checker
--------------------------

checking: EF [18<=Pout1]
normalized: E [true U 18<=Pout1]

abstracting: (18<=Pout1)
states: 4,547,839,450 (9)
-> the formula is TRUE

FORMULA Kanban-PT-00020-ReachabilityCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.017sec

checking: AG [Pm3<=5]
normalized: ~ [E [true U ~ [Pm3<=5]]]

abstracting: (Pm3<=5)
states: 450,101,238,587 (11)
-> the formula is FALSE

FORMULA Kanban-PT-00020-ReachabilityCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.022sec

checking: EF [~ [Pm4<=Pm4]]
normalized: E [true U ~ [Pm4<=Pm4]]

abstracting: (Pm4<=Pm4)
states: 805,422,366,595 (11)
-> the formula is FALSE

FORMULA Kanban-PT-00020-ReachabilityCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [[20<=Pback4 | 17<=Pm2]]
normalized: E [true U [20<=Pback4 | 17<=Pm2]]

abstracting: (17<=Pm2)
states: 13,521,197,151 (10)
abstracting: (20<=Pback4)
states: 454,783,945 (8)
-> the formula is TRUE

FORMULA Kanban-PT-00020-ReachabilityCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.086sec

checking: EF [[[Pout3<=Pback1 & 20<=Pm3] | P2<=7]]
normalized: E [true U [[Pout3<=Pback1 & 20<=Pm3] | P2<=7]]

abstracting: (P2<=7)
states: 721,795,440,212 (11)
abstracting: (20<=Pm3)
states: 724,517,871 (8)
abstracting: (Pout3<=Pback1)
states: 402,700,653,817 (11)
-> the formula is TRUE

FORMULA Kanban-PT-00020-ReachabilityCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.015sec

checking: AG [[~ [[[[~ [[[Pm3<=Pout2 | Pm2<=Pout1] | [Pout1<=19 & 8<=Pm4]]] & P4<=8] | Pout1<=P1] & ~ [[[[~ [17<=P2] & ~ [Pout3<=10]] & ~ [[P1<=7 & P4<=8]]] | Pm3<=9]]]] | ~ [Pback1<=P2]]]
normalized: ~ [E [true U ~ [[~ [Pback1<=P2] | ~ [[~ [[[~ [[P1<=7 & P4<=8]] & [~ [Pout3<=10] & ~ [17<=P2]]] | Pm3<=9]] & [Pout1<=P1 | [~ [[[Pout1<=19 & 8<=Pm4] | [Pm3<=Pout2 | Pm2<=Pout1]]] & P4<=8]]]]]]]]

abstracting: (P4<=8)
states: 639,881,010,615 (11)
abstracting: (Pm2<=Pout1)
states: 402,700,653,817 (11)
abstracting: (Pm3<=Pout2)
states: 433,261,686,858 (11)
abstracting: (8<=Pm4)
states: 206,926,694,975 (11)
abstracting: (Pout1<=19)
states: 804,967,582,650 (11)
abstracting: (Pout1<=P1)
states: 430,225,611,970 (11)
abstracting: (Pm3<=9)
states: 641,267,317,537 (11)
abstracting: (17<=P2)
states: 457,920,386 (8)
abstracting: (Pout3<=10)
states: 676,147,677,898 (11)
abstracting: (P4<=8)
states: 639,881,010,615 (11)
abstracting: (P1<=7)
states: 598,495,671,620 (11)
abstracting: (Pback1<=P2)
states: 341,941,966,828 (11)
-> the formula is FALSE

FORMULA Kanban-PT-00020-ReachabilityCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.818sec

checking: EF [[[[13<=Pback2 | [Pm1<=18 & 13<=P1]] & ~ [[~ [11<=Pout1] | [19<=Pm2 & ~ [[P1<=Pout3 | ~ [[10<=P1 & P3<=8]]]]]]]] & [1<=Pout1 | [P1<=Pback1 | [~ [[[11<=Pback3 | Pm1<=13] & ~ [Pout1<=6]]] & ~ [[[3<=Pm3 | 19<=Pout4] | ~ [4<=Pm2]]]]]]]]
normalized: E [true U [[1<=Pout1 | [P1<=Pback1 | [~ [[[3<=Pm3 | 19<=Pout4] | ~ [4<=Pm2]]] & ~ [[~ [Pout1<=6] & [11<=Pback3 | Pm1<=13]]]]]] & [~ [[[19<=Pm2 & ~ [[P1<=Pout3 | ~ [[10<=P1 & P3<=8]]]]] | ~ [11<=Pout1]]] & [13<=Pback2 | [Pm1<=18 & 13<=P1]]]]]

abstracting: (13<=P1)
states: 54,574,073,400 (10)
abstracting: (Pm1<=18)
states: 803,603,230,815 (11)
abstracting: (13<=Pback2)
states: 73,900,822,842 (10)
abstracting: (11<=Pout1)
states: 100,052,467,900 (11)
abstracting: (P3<=8)
states: 747,768,308,133 (11)
abstracting: (10<=P1)
states: 130,068,208,270 (11)
abstracting: (P1<=Pout3)
states: 464,674,039,599 (11)
abstracting: (19<=Pm2)
states: 2,832,206,223 (9)
abstracting: (Pm1<=13)
states: 767,220,515,215 (11)
abstracting: (11<=Pback3)
states: 129,274,688,697 (11)
abstracting: (Pout1<=6)
states: 550,743,357,395 (11)
abstracting: (4<=Pm2)
states: 483,234,601,311 (11)
abstracting: (19<=Pout4)
states: 1,819,135,780 (9)
abstracting: (3<=Pm3)
states: 555,460,564,659 (11)
abstracting: (P1<=Pback1)
states: 430,225,611,970 (11)
abstracting: (1<=Pout1)
states: 700,367,275,300 (11)
-> the formula is TRUE

FORMULA Kanban-PT-00020-ReachabilityCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.035sec

checking: EF [[[~ [[[Pm1<=P4 & [[[Pout2<=15 | Pout4<=12] | [Pout3<=8 | 16<=P2]] | [~ [P4<=16] | [9<=Pout3 & P2<=17]]]] & [~ [[[14<=Pout4 | Pout1<=Pout4] & [Pm2<=P2 | 15<=Pm2]]] | 9<=Pback1]]] & ~ [[[Pout3<=Pback1 | [Pout4<=19 | 1<=P1]] | [Pout1<=7 | Pout3<=4]]]] | 17<=Pm2]]
normalized: E [true U [17<=Pm2 | [~ [[[Pout1<=7 | Pout3<=4] | [Pout3<=Pback1 | [Pout4<=19 | 1<=P1]]]] & ~ [[[9<=Pback1 | ~ [[[Pm2<=P2 | 15<=Pm2] & [14<=Pout4 | Pout1<=Pout4]]]] & [Pm1<=P4 & [[[9<=Pout3 & P2<=17] | ~ [P4<=16]] | [[Pout3<=8 | 16<=P2] | [Pout2<=15 | Pout4<=12]]]]]]]]]

abstracting: (Pout4<=12)
states: 750,848,293,195 (11)
abstracting: (Pout2<=15)
states: 782,303,659,984 (11)
abstracting: (16<=P2)
states: 1,163,619,611 (9)
abstracting: (Pout3<=8)
states: 601,349,832,930 (11)
abstracting: (P4<=16)
states: 796,326,687,695 (11)
abstracting: (P2<=17)
states: 805,278,090,309 (11)
abstracting: (9<=Pout3)
states: 204,072,533,665 (11)
abstracting: (Pm1<=P4)
states: 435,683,019,310 (11)
abstracting: (Pout1<=Pout4)
states: 435,683,019,310 (11)
abstracting: (14<=Pout4)
states: 38,201,851,380 (10)
abstracting: (15<=Pm2)
states: 36,138,073,202 (10)
abstracting: (Pm2<=P2)
states: 318,339,352,177 (11)
abstracting: (9<=Pback1)
states: 165,541,355,980 (11)
abstracting: (1<=P1)
states: 700,367,275,300 (11)
abstracting: (Pout4<=19)
states: 804,967,582,650 (11)
abstracting: (Pout3<=Pback1)
states: 402,700,653,817 (11)
abstracting: (Pout3<=4)
states: 388,890,456,031 (11)
abstracting: (Pout1<=7)
states: 598,495,671,620 (11)
abstracting: (17<=Pm2)
states: 13,521,197,151 (10)
-> the formula is TRUE

FORMULA Kanban-PT-00020-ReachabilityCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.396sec

checking: EF [[[~ [[[[[[Pback4<=Pback2 | [P3<=17 | P2<=11]] | [[13<=Pout2 & P2<=9] | [Pback4<=Pm1 & 17<=Pback2]]] & 19<=Pm4] | [[[~ [8<=Pback2] & [Pout4<=Pout2 | Pout1<=2]] | ~ [[Pm2<=P4 | Pm3<=Pout2]]] | 7<=Pback3]] | ~ [P4<=Pout1]]] | Pback1<=Pm2] & P2<=1]]
normalized: E [true U [P2<=1 & [Pback1<=Pm2 | ~ [[~ [P4<=Pout1] | [[7<=Pback3 | [~ [[Pm2<=P4 | Pm3<=Pout2]] | [[Pout4<=Pout2 | Pout1<=2] & ~ [8<=Pback2]]]] | [19<=Pm4 & [[[Pback4<=Pm1 & 17<=Pback2] | [13<=Pout2 & P2<=9]] | [Pback4<=Pback2 | [P3<=17 | P2<=11]]]]]]]]]]

abstracting: (P2<=11)
states: 790,000,486,198 (11)
abstracting: (P3<=17)
states: 805,278,090,309 (11)
abstracting: (Pback4<=Pback2)
states: 464,674,039,599 (11)
abstracting: (P2<=9)
states: 766,850,415,177 (11)
abstracting: (13<=Pout2)
states: 73,900,822,842 (10)
abstracting: (17<=Pback2)
states: 13,521,197,151 (10)
abstracting: (Pback4<=Pm1)
states: 435,683,019,310 (11)
abstracting: (19<=Pm4)
states: 1,819,135,780 (9)
abstracting: (8<=Pback2)
states: 249,168,282,363 (11)
abstracting: (Pout1<=2)
states: 286,968,669,295 (11)
abstracting: (Pout4<=Pout2)
states: 464,674,039,599 (11)
abstracting: (Pm3<=Pout2)
states: 433,261,686,858 (11)
abstracting: (Pm2<=P4)
states: 402,700,653,817 (11)
abstracting: (7<=Pback3)
states: 299,555,207,028 (11)
abstracting: (P4<=Pout1)
states: 435,683,019,310 (11)
abstracting: (Pback1<=Pm2)
states: 464,674,039,599 (11)
abstracting: (P2<=1)
states: 305,680,676,301 (11)
-> the formula is TRUE

FORMULA Kanban-PT-00020-ReachabilityCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m11.980sec

checking: AG [~ [[[~ [Pout2<=20] | Pout2<=Pm3] & [[~ [P1<=Pout2] & [[~ [12<=Pout1] & [~ [Pm3<=P1] & [Pm1<=Pout3 & Pm3<=5]]] & [[~ [Pm3<=Pback2] | 8<=Pm4] & [Pback1<=3 & P1<=18]]]] & ~ [[[[Pout2<=Pm1 & [14<=Pout2 & P3<=0]] | [[6<=Pm3 & 15<=Pm4] & Pm3<=5]] | Pback2<=Pback1]]]]]]
normalized: ~ [E [true U [[[[[[8<=Pm4 | ~ [Pm3<=Pback2]] & [Pback1<=3 & P1<=18]] & [[[Pm1<=Pout3 & Pm3<=5] & ~ [Pm3<=P1]] & ~ [12<=Pout1]]] & ~ [P1<=Pout2]] & ~ [[Pback2<=Pback1 | [[Pout2<=Pm1 & [14<=Pout2 & P3<=0]] | [Pm3<=5 & [6<=Pm3 & 15<=Pm4]]]]]] & [Pout2<=Pm3 | ~ [Pout2<=20]]]]]

abstracting: (Pout2<=20)
states: 805,422,366,595 (11)
abstracting: (Pout2<=Pm3)
states: 433,261,686,858 (11)
abstracting: (15<=Pm4)
states: 25,467,900,920 (10)
abstracting: (6<=Pm3)
states: 355,321,128,008 (11)
abstracting: (Pm3<=5)
states: 450,101,238,587 (11)
abstracting: (P3<=0)
states: 167,363,628,201 (11)
abstracting: (14<=Pout2)
states: 52,955,669,844 (10)
abstracting: (Pout2<=Pm1)
states: 402,700,653,817 (11)
abstracting: (Pback2<=Pback1)
states: 402,700,653,817 (11)
abstracting: (P1<=Pout2)
states: 464,674,039,599 (11)
abstracting: (12<=Pout1)
states: 75,039,350,925 (10)
abstracting: (Pm3<=P1)
states: 402,700,653,817 (11)
abstracting: (Pm3<=5)
states: 450,101,238,587 (11)
abstracting: (Pm1<=Pout3)
states: 464,674,039,599 (11)
abstracting: (P1<=18)
states: 803,603,230,815 (11)
abstracting: (Pback1<=3)
states: 364,736,723,890 (11)
abstracting: (Pm3<=Pback2)
states: 433,261,686,858 (11)
abstracting: (8<=Pm4)
states: 206,926,694,975 (11)
-> the formula is FALSE

FORMULA Kanban-PT-00020-ReachabilityCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.845sec

checking: AG [~ [[~ [[~ [[Pm4<=Pm4 | 13<=Pback1]] | ~ [10<=Pm3]]] & [[[Pback2<=2 & Pback3<=18] & Pout1<=Pm2] | [[[Pback3<=13 | [[~ [Pm2<=8] & [P3<=Pback3 & 2<=Pback1]] | ~ [[Pm2<=Pout3 & Pback1<=0]]]] & Pback2<=Pback1] & [[12<=P4 | Pm3<=6] & [[~ [Pout2<=20] | [[17<=Pm3 | 1<=Pm3] | [13<=Pm2 & Pback4<=11]]] & Pout3<=10]]]]]]]
normalized: ~ [E [true U [[[[Pback2<=Pback1 & [Pback3<=13 | [~ [[Pm2<=Pout3 & Pback1<=0]] | [[P3<=Pback3 & 2<=Pback1] & ~ [Pm2<=8]]]]] & [[Pout3<=10 & [~ [Pout2<=20] | [[13<=Pm2 & Pback4<=11] | [17<=Pm3 | 1<=Pm3]]]] & [12<=P4 | Pm3<=6]]] | [Pout1<=Pm2 & [Pback2<=2 & Pback3<=18]]] & ~ [[~ [10<=Pm3] | ~ [[Pm4<=Pm4 | 13<=Pback1]]]]]]]

abstracting: (13<=Pback1)
states: 54,574,073,400 (10)
abstracting: (Pm4<=Pm4)
states: 805,422,366,595 (11)
abstracting: (10<=Pm3)
states: 164,155,049,058 (11)
abstracting: (Pback3<=18)
states: 802,590,160,372 (11)
abstracting: (Pback2<=2)
states: 249,961,801,936 (11)
abstracting: (Pout1<=Pm2)
states: 464,674,039,599 (11)
abstracting: (Pm3<=6)
states: 505,867,159,567 (11)
abstracting: (12<=P4)
states: 75,039,350,925 (10)
abstracting: (1<=Pm3)
states: 716,548,174,419 (11)
abstracting: (17<=Pm3)
states: 13,521,197,151 (10)
abstracting: (Pback4<=11)
states: 730,383,015,670 (11)
abstracting: (13<=Pm2)
states: 73,900,822,842 (10)
abstracting: (Pout2<=20)
states: 805,422,366,595 (11)
abstracting: (Pout3<=10)
states: 676,147,677,898 (11)
abstracting: (Pm2<=8)
states: 601,349,832,930 (11)
abstracting: (2<=Pback1)
states: 604,862,646,850 (11)
abstracting: (P3<=Pback3)
states: 551,979,115,149 (11)
abstracting: (Pback1<=0)
states: 105,055,091,295 (11)
abstracting: (Pm2<=Pout3)
states: 433,261,686,858 (11)
abstracting: (Pback3<=13)
states: 752,466,696,751 (11)
abstracting: (Pback2<=Pback1)
states: 402,700,653,817 (11)
-> the formula is FALSE

FORMULA Kanban-PT-00020-ReachabilityCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.652sec

checking: EF [[~ [[Pback4<=13 | Pout2<=11]] & ~ [[~ [[[[[Pback3<=Pout4 | 4<=Pout2] | [11<=Pout2 & Pout4<=P4]] & P2<=4] | [[[Pback3<=P2 & Pm1<=Pout3] | [Pback3<=14 | 3<=Pout4]] & [[5<=Pback1 & 16<=Pback4] & 7<=Pout3]]]] & [Pback1<=Pback3 | [~ [[[3<=Pm2 & Pback2<=P4] & ~ [P4<=9]]] | ~ [[~ [P3<=2] & ~ [1<=Pback2]]]]]]]]]
normalized: E [true U [~ [[[Pback1<=Pback3 | [~ [[~ [1<=Pback2] & ~ [P3<=2]]] | ~ [[~ [P4<=9] & [3<=Pm2 & Pback2<=P4]]]]] & ~ [[[[7<=Pout3 & [5<=Pback1 & 16<=Pback4]] & [[Pback3<=14 | 3<=Pout4] | [Pback3<=P2 & Pm1<=Pout3]]] | [P2<=4 & [[11<=Pout2 & Pout4<=P4] | [Pback3<=Pout4 | 4<=Pout2]]]]]]] & ~ [[Pback4<=13 | Pout2<=11]]]]

abstracting: (Pout2<=11)
states: 706,163,418,268 (11)
abstracting: (Pback4<=13)
states: 767,220,515,215 (11)
abstracting: (4<=Pout2)
states: 483,234,601,311 (11)
abstracting: (Pback3<=Pout4)
states: 402,700,653,817 (11)
abstracting: (Pout4<=P4)
states: 430,225,611,970 (11)
abstracting: (11<=Pout2)
states: 129,274,688,697 (11)
abstracting: (P2<=4)
states: 584,039,815,051 (11)
abstracting: (Pm1<=Pout3)
states: 464,674,039,599 (11)
abstracting: (Pback3<=P2)
states: 318,339,352,177 (11)
abstracting: (3<=Pout4)
states: 518,453,697,300 (11)
abstracting: (Pback3<=14)
states: 769,284,293,393 (11)
abstracting: (16<=Pback4)
states: 15,917,438,075 (10)
abstracting: (5<=Pback1)
states: 371,103,699,120 (11)
abstracting: (7<=Pout3)
states: 299,555,207,028 (11)
abstracting: (Pback2<=P4)
states: 402,700,653,817 (11)
abstracting: (3<=Pm2)
states: 555,460,564,659 (11)
abstracting: (P4<=9)
states: 675,354,158,325 (11)
abstracting: (P3<=2)
states: 418,906,196,401 (11)
abstracting: (1<=Pback2)
states: 716,548,174,419 (11)
abstracting: (Pback1<=Pback3)
states: 464,674,039,599 (11)
-> the formula is TRUE

FORMULA Kanban-PT-00020-ReachabilityCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.178sec

checking: EF [[[~ [[8<=Pout1 | [~ [[[Pback1<=19 | 5<=Pout4] & ~ [3<=Pback4]]] & ~ [Pm3<=6]]]] | ~ [[~ [[~ [Pback2<=1] | Pback1<=12]] | 14<=Pout4]]] & ~ [[13<=Pout2 | [[Pback4<=14 & 13<=Pm2] | [[~ [[[17<=Pm1 | 17<=Pm4] | [19<=P4 | Pback4<=17]]] | P4<=15] | [[[[1<=Pback1 & Pm3<=20] & [6<=P2 | Pback3<=Pback1]] | [[Pback4<=6 | P1<=12] & [Pm4<=17 | 6<=Pout3]]] | ~ [[3<=Pout1 | 17<=P3]]]]]]]]]
normalized: E [true U [~ [[13<=Pout2 | [[[~ [[3<=Pout1 | 17<=P3]] | [[[Pm4<=17 | 6<=Pout3] & [Pback4<=6 | P1<=12]] | [[6<=P2 | Pback3<=Pback1] & [1<=Pback1 & Pm3<=20]]]] | [P4<=15 | ~ [[[19<=P4 | Pback4<=17] | [17<=Pm1 | 17<=Pm4]]]]] | [Pback4<=14 & 13<=Pm2]]]] & [~ [[14<=Pout4 | ~ [[Pback1<=12 | ~ [Pback2<=1]]]]] | ~ [[8<=Pout1 | [~ [Pm3<=6] & ~ [[~ [3<=Pback4] & [Pback1<=19 | 5<=Pout4]]]]]]]]]

abstracting: (5<=Pout4)
states: 371,103,699,120 (11)
abstracting: (Pback1<=19)
states: 804,967,582,650 (11)
abstracting: (3<=Pback4)
states: 518,453,697,300 (11)
abstracting: (Pm3<=6)
states: 505,867,159,567 (11)
abstracting: (8<=Pout1)
states: 206,926,694,975 (11)
abstracting: (Pback2<=1)
states: 172,193,747,341 (11)
abstracting: (Pback1<=12)
states: 750,848,293,195 (11)
abstracting: (14<=Pout4)
states: 38,201,851,380 (10)
abstracting: (13<=Pm2)
states: 73,900,822,842 (10)
abstracting: (Pback4<=14)
states: 779,954,465,675 (11)
abstracting: (17<=Pm4)
states: 9,095,678,900 (9)
abstracting: (17<=Pm1)
states: 9,095,678,900 (9)
abstracting: (Pback4<=17)
states: 800,874,527,145 (11)
abstracting: (19<=P4)
states: 1,819,135,780 (9)
abstracting: (P4<=15)
states: 789,504,928,520 (11)
abstracting: (Pm3<=20)
states: 805,422,366,595 (11)
abstracting: (1<=Pback1)
states: 700,367,275,300 (11)
abstracting: (Pback3<=Pback1)
states: 402,700,653,817 (11)
abstracting: (6<=P2)
states: 163,370,938,808 (11)
abstracting: (P1<=12)
states: 750,848,293,195 (11)
abstracting: (Pback4<=6)
states: 550,743,357,395 (11)
abstracting: (6<=Pout3)
states: 355,321,128,008 (11)
abstracting: (Pm4<=17)
states: 800,874,527,145 (11)
abstracting: (17<=P3)
states: 457,920,386 (8)
abstracting: (3<=Pout1)
states: 518,453,697,300 (11)
abstracting: (13<=Pout2)
states: 73,900,822,842 (10)
-> the formula is FALSE

FORMULA Kanban-PT-00020-ReachabilityCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.098sec

checking: EF [[P1<=Pback3 & ~ [[[~ [[[[[13<=P4 | 11<=Pback4] & 19<=Pback2] | [19<=Pout3 & [Pout3<=Pout4 | Pout2<=18]]] | Pback2<=P3]] & [[[[19<=Pm3 | ~ [P2<=9]] | [Pm1<=Pout2 | Pback3<=Pm2]] | ~ [[~ [P4<=P3] & [Pout4<=Pm1 & Pm1<=Pout1]]]] | ~ [[Pout3<=Pback1 & 2<=Pout1]]]] & 1<=Pback2]]]]
normalized: E [true U [P1<=Pback3 & ~ [[1<=Pback2 & [[~ [[Pout3<=Pback1 & 2<=Pout1]] | [~ [[[Pout4<=Pm1 & Pm1<=Pout1] & ~ [P4<=P3]]] | [[Pm1<=Pout2 | Pback3<=Pm2] | [19<=Pm3 | ~ [P2<=9]]]]] & ~ [[Pback2<=P3 | [[19<=Pout3 & [Pout3<=Pout4 | Pout2<=18]] | [19<=Pback2 & [13<=P4 | 11<=Pback4]]]]]]]]]]

abstracting: (11<=Pback4)
states: 100,052,467,900 (11)
abstracting: (13<=P4)
states: 54,574,073,400 (10)
abstracting: (19<=Pback2)
states: 2,832,206,223 (9)
abstracting: (Pout2<=18)
states: 802,590,160,372 (11)
abstracting: (Pout3<=Pout4)
states: 402,700,653,817 (11)
abstracting: (19<=Pout3)
states: 2,832,206,223 (9)
abstracting: (Pback2<=P3)
states: 318,339,352,177 (11)
abstracting: (P2<=9)
states: 766,850,415,177 (11)
abstracting: (19<=Pm3)
states: 2,832,206,223 (9)
abstracting: (Pback3<=Pm2)
states: 433,261,686,858 (11)
abstracting: (Pm1<=Pout2)
states: 464,674,039,599 (11)
abstracting: (P4<=P3)
states: 341,941,966,828 (11)
abstracting: (Pm1<=Pout1)
states: 430,225,611,970 (11)
abstracting: (Pout4<=Pm1)
states: 435,683,019,310 (11)
abstracting: (2<=Pout1)
states: 604,862,646,850 (11)
abstracting: (Pout3<=Pback1)
states: 402,700,653,817 (11)
abstracting: (1<=Pback2)
states: 716,548,174,419 (11)
abstracting: (P1<=Pback3)
states: 464,674,039,599 (11)
-> the formula is TRUE

FORMULA Kanban-PT-00020-ReachabilityCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 5m14.562sec

checking: EF [[~ [[[[[14<=P1 & [Pback2<=Pback4 & Pback1<=Pout3]] & [~ [Pback3<=12] | [~ [P2<=6] | [Pout3<=Pm4 & 12<=P2]]]] | P3<=11] | [[Pback4<=Pback3 | 8<=Pm2] | [[[~ [P3<=Pout4] & [P2<=5 | 4<=P4]] | [[Pback4<=P3 & Pm1<=Pback1] & [P1<=P3 | 20<=Pout4]]] | ~ [Pout2<=Pm1]]]]] & Pback2<=Pback2]]
normalized: E [true U [Pback2<=Pback2 & ~ [[[[Pback4<=Pback3 | 8<=Pm2] | [~ [Pout2<=Pm1] | [[[P1<=P3 | 20<=Pout4] & [Pback4<=P3 & Pm1<=Pback1]] | [[P2<=5 | 4<=P4] & ~ [P3<=Pout4]]]]] | [P3<=11 | [[[[Pout3<=Pm4 & 12<=P2] | ~ [P2<=6]] | ~ [Pback3<=12]] & [14<=P1 & [Pback2<=Pback4 & Pback1<=Pout3]]]]]]]]

abstracting: (Pback1<=Pout3)
states: 464,674,039,599 (11)
abstracting: (Pback2<=Pback4)
states: 402,700,653,817 (11)
abstracting: (14<=P1)
states: 38,201,851,380 (10)
abstracting: (Pback3<=12)
states: 731,521,543,753 (11)
abstracting: (P2<=6)
states: 687,216,178,187 (11)
abstracting: (12<=P2)
states: 15,421,880,397 (10)
abstracting: (Pout3<=Pm4)
states: 402,700,653,817 (11)
abstracting: (P3<=11)
states: 790,000,486,198 (11)
abstracting: (P3<=Pout4)
states: 541,908,899,224 (11)
abstracting: (4<=P4)
states: 440,685,642,705 (11)
abstracting: (P2<=5)
states: 642,051,427,787 (11)
abstracting: (Pm1<=Pback1)
states: 430,225,611,970 (11)
abstracting: (Pback4<=P3)
states: 341,941,966,828 (11)
abstracting: (20<=Pout4)
states: 454,783,945 (8)
abstracting: (P1<=P3)
states: 341,941,966,828 (11)
abstracting: (Pout2<=Pm1)
states: 402,700,653,817 (11)
abstracting: (8<=Pm2)
states: 249,168,282,363 (11)
abstracting: (Pback4<=Pback3)
states: 464,674,039,599 (11)
abstracting: (Pback2<=Pback2)
states: 805,422,366,595 (11)
-> the formula is TRUE

FORMULA Kanban-PT-00020-ReachabilityCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 4.799sec

checking: EF [[[[Pm4<=Pout4 & [[Pout1<=P2 & P4<=5] & [[~ [Pback4<=11] & [[[Pm1<=Pback2 & Pm3<=0] | ~ [Pout4<=Pm3]] | [[8<=Pm1 & Pback4<=14] | P2<=Pback2]]] | ~ [[11<=Pm2 & ~ [5<=Pback3]]]]]] & ~ [[15<=Pout4 & [8<=Pout1 | Pback3<=4]]]] & ~ [[[[[[Pm3<=6 & 16<=P3] | ~ [P4<=Pback4]] & ~ [14<=Pback1]] & ~ [[9<=Pm2 | ~ [Pout3<=P3]]]] | ~ [[[P4<=Pout2 | ~ [P4<=18]] & P3<=18]]]]]]
normalized: E [true U [~ [[[[~ [14<=Pback1] & [~ [P4<=Pback4] | [Pm3<=6 & 16<=P3]]] & ~ [[9<=Pm2 | ~ [Pout3<=P3]]]] | ~ [[P3<=18 & [P4<=Pout2 | ~ [P4<=18]]]]]] & [~ [[15<=Pout4 & [8<=Pout1 | Pback3<=4]]] & [Pm4<=Pout4 & [[~ [[11<=Pm2 & ~ [5<=Pback3]]] | [[[P2<=Pback2 | [8<=Pm1 & Pback4<=14]] | [~ [Pout4<=Pm3] | [Pm1<=Pback2 & Pm3<=0]]] & ~ [Pback4<=11]]] & [Pout1<=P2 & P4<=5]]]]]]

abstracting: (P4<=5)
states: 496,169,283,995 (11)
abstracting: (Pout1<=P2)
states: 341,941,966,828 (11)
abstracting: (Pback4<=11)
states: 730,383,015,670 (11)
abstracting: (Pm3<=0)
states: 88,874,192,176 (10)
abstracting: (Pm1<=Pback2)
states: 464,674,039,599 (11)
abstracting: (Pout4<=Pm3)
states: 464,674,039,599 (11)
abstracting: (Pback4<=14)
states: 779,954,465,675 (11)
abstracting: (8<=Pm1)
states: 206,926,694,975 (11)
abstracting: (P2<=Pback2)
states: 551,979,115,149 (11)
abstracting: (5<=Pback3)
states: 416,531,910,564 (11)
abstracting: (11<=Pm2)
states: 129,274,688,697 (11)
abstracting: (Pm4<=Pout4)
states: 430,225,611,970 (11)
abstracting: (Pback3<=4)
states: 388,890,456,031 (11)
abstracting: (8<=Pout1)
states: 206,926,694,975 (11)
abstracting: (15<=Pout4)
states: 25,467,900,920 (10)
abstracting: (P4<=18)
states: 803,603,230,815 (11)
abstracting: (P4<=Pout2)
states: 464,674,039,599 (11)
abstracting: (P3<=18)
states: 805,391,002,185 (11)
abstracting: (Pout3<=P3)
states: 318,339,352,177 (11)
abstracting: (9<=Pm2)
states: 204,072,533,665 (11)
abstracting: (16<=P3)
states: 1,163,619,611 (9)
abstracting: (Pm3<=6)
states: 505,867,159,567 (11)
abstracting: (P4<=Pback4)
states: 430,225,611,970 (11)
abstracting: (14<=Pback1)
states: 38,201,851,380 (10)
-> the formula is TRUE

FORMULA Kanban-PT-00020-ReachabilityCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 6.870sec

totally nodes used: 5029996 (5.0e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 74511006 10849109 85360115
used/not used/entry size/cache size: 12824060 54284804 16 1024MB
basic ops cache: hits/miss/sum: 30297107 6917176 37214283
used/not used/entry size/cache size: 7418415 9358801 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 8 128MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 12 192MB
state nr cache: hits/miss/sum: 284401 104003 388404
used/not used/entry size/cache size: 103456 8285152 32 256MB
max state cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 63601271
1 3238947
2 176506
3 34382
4 12740
5 9257
6 7700
7 4425
8 3746
9 2973
>= 10 16917

Total processing time: 5m46.965sec


BK_STOP 1679466885810

--------------------
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 ReachabilityCardinality -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.000sec


iterations count:1436 (89), effective:440 (27)

initing FirstDep: 0m 0.000sec


iterations count:736 (46), effective:198 (12)

iterations count:434 (27), effective:117 (7)

iterations count:700 (43), effective:224 (14)

iterations count:211 (13), effective:52 (3)

iterations count:1314 (82), effective:396 (24)

iterations count:859 (53), effective:254 (15)

iterations count:1020 (63), effective:324 (20)

iterations count:1000 (62), effective:321 (20)

iterations count:1287 (80), effective:400 (25)

iterations count:965 (60), effective:281 (17)

iterations count:1165 (72), effective:340 (21)

iterations count:1312 (82), effective:400 (25)

iterations count:1268 (79), effective:395 (24)

iterations count:501 (31), effective:172 (10)

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="Kanban-PT-00020"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="marciexred"
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 marciexred"
echo " Input is Kanban-PT-00020, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r234-tall-167856420000254"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Kanban-PT-00020.tgz
mv Kanban-PT-00020 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;