Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r042-tajo-167813695500257.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is BridgeAndVehicles-PT-V50P50N20, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r042-tajo-167813695500257
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.6M
-rw-r--r-- 1 mcc users 18K Feb 25 12:28 CTLCardinality.txt
-rw-r--r-- 1 mcc users 110K Feb 25 12:28 CTLCardinality.xml
-rw-r--r-- 1 mcc users 343K Feb 25 12:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.4M Feb 25 12:25 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 12K Feb 25 15:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 45K Feb 25 15:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 198K Feb 25 15:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 579K Feb 25 15:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 24K Feb 25 12:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 128K Feb 25 12:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 398K Feb 25 12:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.5M Feb 25 12:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.3K Feb 25 15:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.3K Feb 25 15:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 10 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 2.0M 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 BridgeAndVehicles-PT-V50P50N20-CTLCardinality-00
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-CTLCardinality-01
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-CTLCardinality-02
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-CTLCardinality-03
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-CTLCardinality-04
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-CTLCardinality-05
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-CTLCardinality-06
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-CTLCardinality-07
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-CTLCardinality-08
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-CTLCardinality-09
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-CTLCardinality-10
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-CTLCardinality-11
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-CTLCardinality-12
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-CTLCardinality-13
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-CTLCardinality-14
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678704258884

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=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-PT-V50P50N20
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 10:44:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-13 10:44:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 10:44:21] [INFO ] Load time of PNML (sax parser for PT used): 170 ms
[2023-03-13 10:44:21] [INFO ] Transformed 138 places.
[2023-03-13 10:44:21] [INFO ] Transformed 2348 transitions.
[2023-03-13 10:44:21] [INFO ] Parsed PT model containing 138 places and 2348 transitions and 18090 arcs in 285 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 16 ms.
Initial state reduction rules removed 1 formulas.
FORMULA BridgeAndVehicles-PT-V50P50N20-CTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V50P50N20-CTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 63 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 2348/2348 transitions.
Applied a total of 0 rules in 69 ms. Remains 138 /138 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
[2023-03-13 10:44:21] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 138 cols
[2023-03-13 10:44:21] [INFO ] Computed 7 place invariants in 24 ms
[2023-03-13 10:44:22] [INFO ] Dead Transitions using invariants and state equation in 1090 ms found 0 transitions.
[2023-03-13 10:44:22] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2023-03-13 10:44:22] [INFO ] Invariant cache hit.
[2023-03-13 10:44:22] [INFO ] Implicit Places using invariants in 176 ms returned []
[2023-03-13 10:44:22] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2023-03-13 10:44:22] [INFO ] Invariant cache hit.
[2023-03-13 10:44:22] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-13 10:44:23] [INFO ] Implicit Places using invariants and state equation in 589 ms returned []
Implicit Place search using SMT with State Equation took 771 ms to find 0 implicit places.
[2023-03-13 10:44:23] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2023-03-13 10:44:23] [INFO ] Invariant cache hit.
[2023-03-13 10:44:23] [INFO ] Dead Transitions using invariants and state equation in 668 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2634 ms. Remains : 138/138 places, 2348/2348 transitions.
Support contains 63 out of 138 places after structural reductions.
[2023-03-13 10:44:24] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-13 10:44:24] [INFO ] Flatten gal took : 211 ms
FORMULA BridgeAndVehicles-PT-V50P50N20-CTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-13 10:44:24] [INFO ] Flatten gal took : 126 ms
[2023-03-13 10:44:24] [INFO ] Input system was already deterministic with 2348 transitions.
Support contains 61 out of 138 places (down from 63) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 23 resets, run finished after 550 ms. (steps per millisecond=18 ) properties (out of 64) seen :33
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 31) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 30) seen :0
Running SMT prover for 30 properties.
[2023-03-13 10:44:25] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2023-03-13 10:44:25] [INFO ] Invariant cache hit.
[2023-03-13 10:44:25] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2023-03-13 10:44:25] [INFO ] After 247ms SMT Verify possible using all constraints in real domain returned unsat :11 sat :0 real:19
[2023-03-13 10:44:26] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2023-03-13 10:44:26] [INFO ] After 107ms SMT Verify possible using state equation in natural domain returned unsat :27 sat :3
[2023-03-13 10:44:26] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-13 10:44:26] [INFO ] After 71ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :27 sat :3
[2023-03-13 10:44:26] [INFO ] After 237ms SMT Verify possible using trap constraints in natural domain returned unsat :27 sat :3
Attempting to minimize the solution found.
Minimization took 76 ms.
[2023-03-13 10:44:26] [INFO ] After 1078ms SMT Verify possible using all constraints in natural domain returned unsat :27 sat :3
Fused 30 Parikh solutions to 3 different solutions.
Parikh walk visited 1 properties in 22 ms.
Support contains 1 out of 138 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 138/138 places, 2348/2348 transitions.
Graph (complete) has 1302 edges and 138 vertex of which 136 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.7 ms
Discarding 2 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 135 transition count 2347
Applied a total of 3 rules in 390 ms. Remains 135 /138 variables (removed 3) and now considering 2347/2348 (removed 1) transitions.
[2023-03-13 10:44:27] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 135 cols
[2023-03-13 10:44:27] [INFO ] Computed 5 place invariants in 7 ms
[2023-03-13 10:44:28] [INFO ] Dead Transitions using invariants and state equation in 842 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1234 ms. Remains : 135/138 places, 2347/2348 transitions.
Incomplete random walk after 10000 steps, including 26 resets, run finished after 238 ms. (steps per millisecond=42 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 235263 steps, run timeout after 3001 ms. (steps per millisecond=78 ) properties seen :{}
Probabilistic random walk after 235263 steps, saw 67702 distinct states, run finished after 3002 ms. (steps per millisecond=78 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-13 10:44:31] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-13 10:44:31] [INFO ] Invariant cache hit.
[2023-03-13 10:44:31] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-13 10:44:31] [INFO ] After 167ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-13 10:44:31] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-13 10:44:31] [INFO ] After 100ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-13 10:44:31] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-13 10:44:32] [INFO ] After 149ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-13 10:44:32] [INFO ] After 398ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 52 ms.
[2023-03-13 10:44:32] [INFO ] After 632ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 17 ms.
Support contains 1 out of 135 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 135/135 places, 2347/2347 transitions.
Applied a total of 0 rules in 264 ms. Remains 135 /135 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 266 ms. Remains : 135/135 places, 2347/2347 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 135/135 places, 2347/2347 transitions.
Applied a total of 0 rules in 338 ms. Remains 135 /135 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
[2023-03-13 10:44:33] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-13 10:44:33] [INFO ] Invariant cache hit.
[2023-03-13 10:44:33] [INFO ] Implicit Places using invariants in 382 ms returned []
[2023-03-13 10:44:33] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-13 10:44:33] [INFO ] Invariant cache hit.
[2023-03-13 10:44:33] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-13 10:44:34] [INFO ] Implicit Places using invariants and state equation in 938 ms returned [52, 107]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1331 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 133/135 places, 2347/2347 transitions.
Applied a total of 0 rules in 244 ms. Remains 133 /133 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1914 ms. Remains : 133/135 places, 2347/2347 transitions.
Incomplete random walk after 10002 steps, including 26 resets, run finished after 181 ms. (steps per millisecond=55 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 248151 steps, run timeout after 3001 ms. (steps per millisecond=82 ) properties seen :{}
Probabilistic random walk after 248151 steps, saw 71321 distinct states, run finished after 3001 ms. (steps per millisecond=82 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-13 10:44:37] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 133 cols
[2023-03-13 10:44:37] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-13 10:44:37] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-13 10:44:38] [INFO ] After 158ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-13 10:44:38] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-13 10:44:38] [INFO ] After 87ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-13 10:44:38] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-13 10:44:38] [INFO ] After 184ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-13 10:44:38] [INFO ] After 261ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 34 ms.
[2023-03-13 10:44:38] [INFO ] After 453ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 13 ms.
Support contains 1 out of 133 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 2347/2347 transitions.
Applied a total of 0 rules in 235 ms. Remains 133 /133 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 236 ms. Remains : 133/133 places, 2347/2347 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 2347/2347 transitions.
Applied a total of 0 rules in 230 ms. Remains 133 /133 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
[2023-03-13 10:44:39] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-13 10:44:39] [INFO ] Invariant cache hit.
[2023-03-13 10:44:39] [INFO ] Implicit Places using invariants in 294 ms returned []
[2023-03-13 10:44:39] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-13 10:44:39] [INFO ] Invariant cache hit.
[2023-03-13 10:44:39] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-13 10:44:40] [INFO ] Implicit Places using invariants and state equation in 945 ms returned []
Implicit Place search using SMT with State Equation took 1242 ms to find 0 implicit places.
[2023-03-13 10:44:40] [INFO ] Redundant transitions in 158 ms returned []
[2023-03-13 10:44:40] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-13 10:44:40] [INFO ] Invariant cache hit.
[2023-03-13 10:44:41] [INFO ] Dead Transitions using invariants and state equation in 872 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2517 ms. Remains : 133/133 places, 2347/2347 transitions.
Ensure Unique test removed 2058 transitions
Reduce isomorphic transitions removed 2058 transitions.
Iterating post reduction 0 with 2058 rules applied. Total rules applied 2058 place count 133 transition count 289
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 2062 place count 131 transition count 287
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 2064 place count 131 transition count 285
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 2066 place count 129 transition count 285
Applied a total of 2066 rules in 17 ms. Remains 129 /133 variables (removed 4) and now considering 285/2347 (removed 2062) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 285 rows 129 cols
[2023-03-13 10:44:41] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-13 10:44:41] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-13 10:44:41] [INFO ] After 137ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-13 10:44:41] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-13 10:44:41] [INFO ] After 72ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-13 10:44:41] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-13 10:44:41] [INFO ] After 16ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-13 10:44:41] [INFO ] After 41ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-03-13 10:44:41] [INFO ] After 167ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Successfully simplified 27 atomic propositions for a total of 13 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA BridgeAndVehicles-PT-V50P50N20-CTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V50P50N20-CTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V50P50N20-CTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-13 10:44:41] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-13 10:44:41] [INFO ] Flatten gal took : 60 ms
FORMULA BridgeAndVehicles-PT-V50P50N20-CTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-13 10:44:41] [INFO ] Flatten gal took : 66 ms
[2023-03-13 10:44:41] [INFO ] Input system was already deterministic with 2348 transitions.
Support contains 36 out of 138 places (down from 37) after GAL structural reductions.
Computed a total of 111 stabilizing places and 204 stable transitions
Graph (complete) has 3850 edges and 138 vertex of which 136 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.12 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 138/138 places, 2348/2348 transitions.
Graph (complete) has 3850 edges and 138 vertex of which 136 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.6 ms
Discarding 2 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 135 transition count 2347
Applied a total of 3 rules in 329 ms. Remains 135 /138 variables (removed 3) and now considering 2347/2348 (removed 1) transitions.
[2023-03-13 10:44:42] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 135 cols
[2023-03-13 10:44:42] [INFO ] Computed 5 place invariants in 4 ms
[2023-03-13 10:44:43] [INFO ] Dead Transitions using invariants and state equation in 809 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1141 ms. Remains : 135/138 places, 2347/2348 transitions.
[2023-03-13 10:44:43] [INFO ] Flatten gal took : 53 ms
[2023-03-13 10:44:43] [INFO ] Flatten gal took : 59 ms
[2023-03-13 10:44:43] [INFO ] Input system was already deterministic with 2347 transitions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 2348/2348 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 137 transition count 2348
Applied a total of 1 rules in 12 ms. Remains 137 /138 variables (removed 1) and now considering 2348/2348 (removed 0) transitions.
[2023-03-13 10:44:43] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 137 cols
[2023-03-13 10:44:43] [INFO ] Computed 6 place invariants in 5 ms
[2023-03-13 10:44:44] [INFO ] Dead Transitions using invariants and state equation in 705 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 719 ms. Remains : 137/138 places, 2348/2348 transitions.
[2023-03-13 10:44:44] [INFO ] Flatten gal took : 46 ms
[2023-03-13 10:44:44] [INFO ] Flatten gal took : 56 ms
[2023-03-13 10:44:44] [INFO ] Input system was already deterministic with 2348 transitions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 2348/2348 transitions.
Applied a total of 0 rules in 9 ms. Remains 138 /138 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
[2023-03-13 10:44:44] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 138 cols
[2023-03-13 10:44:44] [INFO ] Computed 7 place invariants in 9 ms
[2023-03-13 10:44:45] [INFO ] Dead Transitions using invariants and state equation in 767 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 778 ms. Remains : 138/138 places, 2348/2348 transitions.
[2023-03-13 10:44:45] [INFO ] Flatten gal took : 50 ms
[2023-03-13 10:44:45] [INFO ] Flatten gal took : 59 ms
[2023-03-13 10:44:45] [INFO ] Input system was already deterministic with 2348 transitions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 2348/2348 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 136 transition count 2348
Applied a total of 2 rules in 11 ms. Remains 136 /138 variables (removed 2) and now considering 2348/2348 (removed 0) transitions.
[2023-03-13 10:44:45] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 136 cols
[2023-03-13 10:44:45] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-13 10:44:46] [INFO ] Dead Transitions using invariants and state equation in 773 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 786 ms. Remains : 136/138 places, 2348/2348 transitions.
[2023-03-13 10:44:46] [INFO ] Flatten gal took : 52 ms
[2023-03-13 10:44:46] [INFO ] Flatten gal took : 59 ms
[2023-03-13 10:44:46] [INFO ] Input system was already deterministic with 2348 transitions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 2348/2348 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 137 transition count 2348
Applied a total of 1 rules in 11 ms. Remains 137 /138 variables (removed 1) and now considering 2348/2348 (removed 0) transitions.
[2023-03-13 10:44:46] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 137 cols
[2023-03-13 10:44:46] [INFO ] Computed 6 place invariants in 6 ms
[2023-03-13 10:44:47] [INFO ] Dead Transitions using invariants and state equation in 769 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 782 ms. Remains : 137/138 places, 2348/2348 transitions.
[2023-03-13 10:44:47] [INFO ] Flatten gal took : 50 ms
[2023-03-13 10:44:47] [INFO ] Flatten gal took : 58 ms
[2023-03-13 10:44:47] [INFO ] Input system was already deterministic with 2348 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 138/138 places, 2348/2348 transitions.
Graph (complete) has 3850 edges and 138 vertex of which 136 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.7 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 135 transition count 2347
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 135 transition count 2347
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 133 transition count 2346
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 10 place count 131 transition count 2344
Applied a total of 10 rules in 367 ms. Remains 131 /138 variables (removed 7) and now considering 2344/2348 (removed 4) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 368 ms. Remains : 131/138 places, 2344/2348 transitions.
[2023-03-13 10:44:48] [INFO ] Flatten gal took : 49 ms
[2023-03-13 10:44:48] [INFO ] Flatten gal took : 55 ms
[2023-03-13 10:44:48] [INFO ] Input system was already deterministic with 2344 transitions.
Finished random walk after 28 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=28 )
FORMULA BridgeAndVehicles-PT-V50P50N20-CTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 2348/2348 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 136 transition count 2348
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 135 transition count 2347
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 135 transition count 2347
Applied a total of 4 rules in 20 ms. Remains 135 /138 variables (removed 3) and now considering 2347/2348 (removed 1) transitions.
[2023-03-13 10:44:48] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 135 cols
[2023-03-13 10:44:48] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-13 10:44:49] [INFO ] Dead Transitions using invariants and state equation in 638 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 662 ms. Remains : 135/138 places, 2347/2348 transitions.
[2023-03-13 10:44:49] [INFO ] Flatten gal took : 49 ms
[2023-03-13 10:44:49] [INFO ] Flatten gal took : 58 ms
[2023-03-13 10:44:49] [INFO ] Input system was already deterministic with 2347 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 138/138 places, 2348/2348 transitions.
Graph (complete) has 3850 edges and 138 vertex of which 136 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 135 transition count 2347
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 135 transition count 2347
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 133 transition count 2346
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 10 place count 131 transition count 2344
Applied a total of 10 rules in 248 ms. Remains 131 /138 variables (removed 7) and now considering 2344/2348 (removed 4) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 250 ms. Remains : 131/138 places, 2344/2348 transitions.
[2023-03-13 10:44:49] [INFO ] Flatten gal took : 49 ms
[2023-03-13 10:44:49] [INFO ] Flatten gal took : 78 ms
[2023-03-13 10:44:49] [INFO ] Input system was already deterministic with 2344 transitions.
Incomplete random walk after 10000 steps, including 32 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 10 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 307617 steps, run timeout after 3001 ms. (steps per millisecond=102 ) properties seen :{}
Probabilistic random walk after 307617 steps, saw 96761 distinct states, run finished after 3002 ms. (steps per millisecond=102 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-13 10:44:53] [INFO ] Flow matrix only has 286 transitions (discarded 2058 similar events)
// Phase 1: matrix 286 rows 131 cols
[2023-03-13 10:44:53] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-13 10:44:53] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 10:44:53] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-13 10:44:53] [INFO ] After 88ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 10:44:53] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-13 10:44:53] [INFO ] After 167ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-13 10:44:53] [INFO ] After 216ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 29 ms.
[2023-03-13 10:44:53] [INFO ] After 410ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 40 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=20 )
FORMULA BridgeAndVehicles-PT-V50P50N20-CTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 1 ms.
Starting structural reductions in SI_CTL mode, iteration 0 : 138/138 places, 2348/2348 transitions.
Graph (complete) has 3850 edges and 138 vertex of which 136 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 135 transition count 2347
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 135 transition count 2347
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 133 transition count 2346
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 10 place count 131 transition count 2344
Applied a total of 10 rules in 252 ms. Remains 131 /138 variables (removed 7) and now considering 2344/2348 (removed 4) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 252 ms. Remains : 131/138 places, 2344/2348 transitions.
[2023-03-13 10:44:53] [INFO ] Flatten gal took : 43 ms
[2023-03-13 10:44:53] [INFO ] Flatten gal took : 47 ms
[2023-03-13 10:44:53] [INFO ] Input system was already deterministic with 2344 transitions.
[2023-03-13 10:44:54] [INFO ] Flatten gal took : 62 ms
[2023-03-13 10:44:54] [INFO ] Flatten gal took : 50 ms
[2023-03-13 10:44:54] [INFO ] Export to MCC of 7 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 1 ms.
[2023-03-13 10:44:54] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 138 places, 2348 transitions and 18090 arcs took 18 ms.
Total runtime 33383 ms.
There are residual formulas that ITS could not solve within timeout
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=CTLCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Petri
(NrP: 138 NrTr: 2348 NrArc: 18090)

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

net check time: 0m 0.001sec

init dd package: 0m 3.173sec


before gc: list nodes free: 209322

after gc: idd nodes used:12338695, unused:51661305; list nodes free:348560118

before gc: list nodes free: 346610

after gc: idd nodes used:13249594, unused:50750406; list nodes free:541290098
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 430860 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16089420 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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
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.003sec

424787 1489515 2486457 2525465 3132280 5255890 6878739 6996185 10046233 10410703 11176600 11309602 11309956 11588457 11586778 11766438 11796365 11936887 12015055 12106273 12162480 12258441 12384312 12393884 12557903 12568055 12624267 12683120 12722432 12778525 12809907 12929092 12946152 12960080 13039666 13026438 13083235 13150047 13149351 13197955 13190128 13247896 13305807 13265738 13202666 13222179 13165630 13177001 13129012 13128986 13075102 13029976 13033918 12983034 12980691 12938240 12931981 12888748 12845234 12840404 12802261 12792837 12795166 12788875

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="BridgeAndVehicles-PT-V50P50N20"
export BK_EXAMINATION="CTLCardinality"
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 BridgeAndVehicles-PT-V50P50N20, 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 r042-tajo-167813695500257"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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