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

About the Execution of Marcie+red for TokenRing-PT-015

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
10160.995 3600000.00 3644130.00 15192.90 TTFTTFFF?T?F?FF? normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r490-tall-167912709000665.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 TokenRing-PT-015, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r490-tall-167912709000665
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 41M
-rw-r--r-- 1 mcc users 369K Feb 25 15:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 1.9M Feb 25 15:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.4M Feb 25 14:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 13M Feb 25 14:50 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 134K Feb 25 17:20 LTLCardinality.txt
-rw-r--r-- 1 mcc users 472K Feb 25 17:20 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.5M Feb 25 17:20 LTLFireability.txt
-rw-r--r-- 1 mcc users 4.2M Feb 25 17:20 LTLFireability.xml
-rw-r--r-- 1 mcc users 274K Feb 25 15:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 1.4M Feb 25 15:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.0M Feb 25 15:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 11M Feb 25 15:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 28K Feb 25 17:20 UpperBounds.txt
-rw-r--r-- 1 mcc users 71K Feb 25 17:20 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 1.7M Mar 5 18:23 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 TokenRing-PT-015-CTLCardinality-00
FORMULA_NAME TokenRing-PT-015-CTLCardinality-01
FORMULA_NAME TokenRing-PT-015-CTLCardinality-02
FORMULA_NAME TokenRing-PT-015-CTLCardinality-03
FORMULA_NAME TokenRing-PT-015-CTLCardinality-04
FORMULA_NAME TokenRing-PT-015-CTLCardinality-05
FORMULA_NAME TokenRing-PT-015-CTLCardinality-06
FORMULA_NAME TokenRing-PT-015-CTLCardinality-07
FORMULA_NAME TokenRing-PT-015-CTLCardinality-08
FORMULA_NAME TokenRing-PT-015-CTLCardinality-09
FORMULA_NAME TokenRing-PT-015-CTLCardinality-10
FORMULA_NAME TokenRing-PT-015-CTLCardinality-11
FORMULA_NAME TokenRing-PT-015-CTLCardinality-12
FORMULA_NAME TokenRing-PT-015-CTLCardinality-13
FORMULA_NAME TokenRing-PT-015-CTLCardinality-14
FORMULA_NAME TokenRing-PT-015-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679311927861

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=TokenRing-PT-015
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-20 11:32:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-20 11:32:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 11:32:09] [INFO ] Load time of PNML (sax parser for PT used): 144 ms
[2023-03-20 11:32:09] [INFO ] Transformed 256 places.
[2023-03-20 11:32:09] [INFO ] Transformed 3616 transitions.
[2023-03-20 11:32:09] [INFO ] Found NUPN structural information;
[2023-03-20 11:32:09] [INFO ] Completing missing partition info from NUPN : creating a component with [State_14_5, State_12_6, State_14_7, State_12_2, State_1_11, State_10_3, State_8_5, State_15_5, State_1_14, State_0_10, State_10_15, State_6_4, State_8_14, State_2_3, State_3_12, State_15_13, State_4_7, State_2_11, State_6_8, State_0_6, State_7_1, State_3_7, State_5_0, State_13_12, State_11_15, State_11_11, State_9_14, State_5_4, State_13_8, State_4_8, State_7_3, State_9_2, State_14_9, State_13_15, State_12_4, State_10_5, State_3_10, State_14_3, State_12_14, State_2_1, State_6_15, State_5_14, State_13_6, State_6_6, State_10_8, State_11_0, State_1_13, State_15_3, State_8_0, State_1_0, State_11_5, State_3_13, State_15_8, State_9_4, State_4_10, State_9_9, State_7_11, State_8_3, State_0_12, State_2_9, State_7_8, State_5_6, State_4_5, State_0_7]
[2023-03-20 11:32:09] [INFO ] Parsed PT model containing 256 places and 3616 transitions and 14464 arcs in 227 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 70 ms.
Initial state reduction rules removed 1 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA TokenRing-PT-015-CTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TokenRing-PT-015-CTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TokenRing-PT-015-CTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TokenRing-PT-015-CTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 51 out of 256 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 75 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
// Phase 1: matrix 3616 rows 256 cols
[2023-03-20 11:32:09] [INFO ] Computed 16 place invariants in 34 ms
[2023-03-20 11:32:10] [INFO ] Implicit Places using invariants in 466 ms returned []
[2023-03-20 11:32:10] [INFO ] Invariant cache hit.
[2023-03-20 11:32:10] [INFO ] State equation strengthened by 3390 read => feed constraints.
[2023-03-20 11:32:14] [INFO ] Implicit Places using invariants and state equation in 4409 ms returned []
Implicit Place search using SMT with State Equation took 4902 ms to find 0 implicit places.
[2023-03-20 11:32:14] [INFO ] Invariant cache hit.
[2023-03-20 11:32:15] [INFO ] Dead Transitions using invariants and state equation in 1007 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5988 ms. Remains : 256/256 places, 3616/3616 transitions.
Support contains 51 out of 256 places after structural reductions.
[2023-03-20 11:32:15] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2023-03-20 11:32:15] [INFO ] Flatten gal took : 181 ms
[2023-03-20 11:32:15] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA TokenRing-PT-015-CTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TokenRing-PT-015-CTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TokenRing-PT-015-CTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-20 11:32:16] [INFO ] Flatten gal took : 135 ms
[2023-03-20 11:32:16] [INFO ] Input system was already deterministic with 3616 transitions.
Support contains 50 out of 256 places (down from 51) after GAL structural reductions.
FORMULA TokenRing-PT-015-CTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 410 ms. (steps per millisecond=24 ) properties (out of 35) seen :30
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 180 ms. (steps per millisecond=55 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 189 ms. (steps per millisecond=52 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 175 ms. (steps per millisecond=57 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 180 ms. (steps per millisecond=55 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 174 ms. (steps per millisecond=57 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-20 11:32:17] [INFO ] Invariant cache hit.
[2023-03-20 11:32:17] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-20 11:32:18] [INFO ] After 854ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-20 11:32:18] [INFO ] [Nat]Absence check using 16 positive place invariants in 4 ms returned sat
[2023-03-20 11:32:19] [INFO ] After 700ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-20 11:32:19] [INFO ] State equation strengthened by 3390 read => feed constraints.
[2023-03-20 11:32:20] [INFO ] After 1156ms SMT Verify possible using 3390 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-20 11:32:21] [INFO ] After 1860ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 442 ms.
[2023-03-20 11:32:21] [INFO ] After 3211ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 101 ms.
Support contains 11 out of 256 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 238 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 239 ms. Remains : 256/256 places, 3616/3616 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 216 ms. (steps per millisecond=46 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 187 ms. (steps per millisecond=53 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 188 ms. (steps per millisecond=53 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 166 ms. (steps per millisecond=60 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 128512 steps, run timeout after 3001 ms. (steps per millisecond=42 ) properties seen :{}
Probabilistic random walk after 128512 steps, saw 25129 distinct states, run finished after 3002 ms. (steps per millisecond=42 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-20 11:32:26] [INFO ] Invariant cache hit.
[2023-03-20 11:32:26] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-20 11:32:27] [INFO ] After 850ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-20 11:32:27] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-20 11:32:27] [INFO ] After 704ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-20 11:32:27] [INFO ] State equation strengthened by 3390 read => feed constraints.
[2023-03-20 11:32:29] [INFO ] After 1173ms SMT Verify possible using 3390 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-20 11:32:29] [INFO ] After 1807ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 435 ms.
[2023-03-20 11:32:30] [INFO ] After 3073ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 74 ms.
Support contains 11 out of 256 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 67 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67 ms. Remains : 256/256 places, 3616/3616 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 75 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
[2023-03-20 11:32:30] [INFO ] Invariant cache hit.
[2023-03-20 11:32:30] [INFO ] Implicit Places using invariants in 253 ms returned []
[2023-03-20 11:32:30] [INFO ] Invariant cache hit.
[2023-03-20 11:32:31] [INFO ] State equation strengthened by 3390 read => feed constraints.
[2023-03-20 11:32:35] [INFO ] Implicit Places using invariants and state equation in 5171 ms returned []
Implicit Place search using SMT with State Equation took 5428 ms to find 0 implicit places.
[2023-03-20 11:32:36] [INFO ] Redundant transitions in 286 ms returned []
[2023-03-20 11:32:36] [INFO ] Invariant cache hit.
[2023-03-20 11:32:36] [INFO ] Dead Transitions using invariants and state equation in 944 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6747 ms. Remains : 256/256 places, 3616/3616 transitions.
Graph (trivial) has 3320 edges and 256 vertex of which 230 / 256 are part of one of the 15 SCC in 6 ms
Free SCC test removed 215 places
Drop transitions removed 3306 transitions
Ensure Unique test removed 268 transitions
Reduce isomorphic transitions removed 3574 transitions.
Graph (complete) has 42 edges and 41 vertex of which 33 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.0 ms
Discarding 8 places :
Also discarding 0 output transitions
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 14 place count 33 transition count 30
Reduce places removed 12 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 13 rules applied. Total rules applied 27 place count 21 transition count 29
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 28 place count 20 transition count 29
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 28 place count 20 transition count 28
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 30 place count 19 transition count 28
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 3 with 8 rules applied. Total rules applied 38 place count 19 transition count 20
Applied a total of 38 rules in 19 ms. Remains 19 /256 variables (removed 237) and now considering 20/3616 (removed 3596) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 20 rows 19 cols
[2023-03-20 11:32:37] [INFO ] Computed 8 place invariants in 0 ms
[2023-03-20 11:32:37] [INFO ] [Real]Absence check using 8 positive place invariants in 1 ms returned sat
[2023-03-20 11:32:37] [INFO ] After 11ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:3
[2023-03-20 11:32:37] [INFO ] After 16ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-20 11:32:37] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-20 11:32:37] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2023-03-20 11:32:37] [INFO ] After 10ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-20 11:32:37] [INFO ] After 19ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-20 11:32:37] [INFO ] After 51ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
[2023-03-20 11:32:37] [INFO ] Flatten gal took : 84 ms
[2023-03-20 11:32:37] [INFO ] Flatten gal took : 106 ms
[2023-03-20 11:32:37] [INFO ] Input system was already deterministic with 3616 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 22 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22 ms. Remains : 256/256 places, 3616/3616 transitions.
[2023-03-20 11:32:37] [INFO ] Flatten gal took : 74 ms
[2023-03-20 11:32:37] [INFO ] Flatten gal took : 81 ms
[2023-03-20 11:32:37] [INFO ] Input system was already deterministic with 3616 transitions.
Starting structural reductions in LTL mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 23 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25 ms. Remains : 256/256 places, 3616/3616 transitions.
[2023-03-20 11:32:38] [INFO ] Flatten gal took : 85 ms
[2023-03-20 11:32:38] [INFO ] Flatten gal took : 84 ms
[2023-03-20 11:32:38] [INFO ] Input system was already deterministic with 3616 transitions.
Starting structural reductions in LTL mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 25 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26 ms. Remains : 256/256 places, 3616/3616 transitions.
[2023-03-20 11:32:38] [INFO ] Flatten gal took : 75 ms
[2023-03-20 11:32:38] [INFO ] Flatten gal took : 85 ms
[2023-03-20 11:32:38] [INFO ] Input system was already deterministic with 3616 transitions.
Starting structural reductions in LTL mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 23 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24 ms. Remains : 256/256 places, 3616/3616 transitions.
[2023-03-20 11:32:38] [INFO ] Flatten gal took : 64 ms
[2023-03-20 11:32:38] [INFO ] Flatten gal took : 73 ms
[2023-03-20 11:32:38] [INFO ] Input system was already deterministic with 3616 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 82 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 82 ms. Remains : 256/256 places, 3616/3616 transitions.
[2023-03-20 11:32:39] [INFO ] Flatten gal took : 62 ms
[2023-03-20 11:32:39] [INFO ] Flatten gal took : 69 ms
[2023-03-20 11:32:39] [INFO ] Input system was already deterministic with 3616 transitions.
Starting structural reductions in LTL mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 18 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19 ms. Remains : 256/256 places, 3616/3616 transitions.
[2023-03-20 11:32:39] [INFO ] Flatten gal took : 58 ms
[2023-03-20 11:32:39] [INFO ] Flatten gal took : 66 ms
[2023-03-20 11:32:39] [INFO ] Input system was already deterministic with 3616 transitions.
Starting structural reductions in LTL mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 20 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20 ms. Remains : 256/256 places, 3616/3616 transitions.
[2023-03-20 11:32:39] [INFO ] Flatten gal took : 57 ms
[2023-03-20 11:32:39] [INFO ] Flatten gal took : 67 ms
[2023-03-20 11:32:39] [INFO ] Input system was already deterministic with 3616 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 60 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 62 ms. Remains : 256/256 places, 3616/3616 transitions.
[2023-03-20 11:32:40] [INFO ] Flatten gal took : 57 ms
[2023-03-20 11:32:40] [INFO ] Flatten gal took : 67 ms
[2023-03-20 11:32:40] [INFO ] Input system was already deterministic with 3616 transitions.
[2023-03-20 11:32:40] [INFO ] Flatten gal took : 67 ms
[2023-03-20 11:32:40] [INFO ] Flatten gal took : 64 ms
[2023-03-20 11:32:40] [INFO ] Export to MCC of 8 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2023-03-20 11:32:40] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 256 places, 3616 transitions and 14464 arcs took 18 ms.
Total runtime 31183 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: 256 NrTr: 3616 NrArc: 14464)

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

net check time: 0m 0.007sec

init dd package: 0m 2.725sec


RS generation: 0m20.042sec


-> reachability set: #nodes 27252 (2.7e+04) #states 35,357,924 (7)



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

checking: EX [0<=0]
normalized: EX [0<=0]

abstracting: (0<=0)
states: 35,357,924 (7)
.-> the formula is TRUE

FORMULA TokenRing-PT-015-CTLCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m21.944sec

checking: EF [AG [[1<=p165 & p165<=1]]]
normalized: E [true U ~ [E [true U ~ [[1<=p165 & p165<=1]]]]]

abstracting: (p165<=1)
states: 35,357,924 (7)
abstracting: (1<=p165)
states: 39,616 (4)
-> the formula is FALSE

FORMULA TokenRing-PT-015-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m30.059sec

checking: [EF [~ [E [~ [AF [[0<=p64 & p64<=0]]] U [~ [[1<=p246 & p246<=1]] | ~ [[1<=p154 & p154<=1]]]]]] | EX [AG [[EF [[0<=p213 & p213<=0]] | AX [1<=0]]]]]
normalized: [EX [~ [E [true U ~ [[~ [EX [~ [1<=0]]] | E [true U [0<=p213 & p213<=0]]]]]]] | E [true U ~ [E [EG [~ [[0<=p64 & p64<=0]]] U [~ [[1<=p154 & p154<=1]] | ~ [[1<=p246 & p246<=1]]]]]]]

abstracting: (p246<=1)
states: 35,357,924 (7)
abstracting: (1<=p246)
states: 135
abstracting: (p154<=1)
states: 35,357,924 (7)
abstracting: (1<=p154)
states: 16
abstracting: (p64<=0)
states: 35,052,673 (7)
abstracting: (0<=p64)
states: 35,357,924 (7)
...............................
EG iterations: 31
abstracting: (p213<=0)
states: 35,357,908 (7)
abstracting: (0<=p213)
states: 35,357,924 (7)
abstracting: (1<=0)
states: 0
..-> the formula is TRUE

FORMULA TokenRing-PT-015-CTLCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m 2.967sec

checking: [EX [[[AX [[0<=p53 & p53<=0]] | AG [[0<=p182 & p182<=0]]] & EG [EX [[p94<=0 & 0<=p94]]]]] | AG [EX [EG [EX [[[1<=p248 & p248<=1] & [0<=p209 & p209<=0]]]]]]]
normalized: [~ [E [true U ~ [EX [EG [EX [[[1<=p248 & p248<=1] & [0<=p209 & p209<=0]]]]]]]] | EX [[EG [EX [[p94<=0 & 0<=p94]]] & [~ [E [true U ~ [[0<=p182 & p182<=0]]]] | ~ [EX [~ [[0<=p53 & p53<=0]]]]]]]]

abstracting: (p53<=0)
states: 29,414,708 (7)
abstracting: (0<=p53)
states: 35,357,924 (7)
.abstracting: (p182<=0)
states: 30,561,358 (7)
abstracting: (0<=p182)
states: 35,357,924 (7)

before gc: list nodes free: 504108

after gc: idd nodes used:80649, unused:63919351; list nodes free:280681453
abstracting: (0<=p94)
states: 35,357,924 (7)
abstracting: (p94<=0)
states: 35,357,908 (7)
..............................................................................................................................................................................................................
before gc: list nodes free: 1275990

after gc: idd nodes used:255284, unused:63744716; list nodes free:294566776
....................
before gc: list nodes free: 25954371

after gc: idd nodes used:171672, unused:63828328; list nodes free:294970446
..............................................................................
EG iterations: 303
.abstracting: (p209<=0)
states: 35,357,908 (7)
abstracting: (0<=p209)
states: 35,357,924 (7)
abstracting: (p248<=1)
states: 35,357,924 (7)
abstracting: (1<=p248)
states: 232,576 (5)
................MC time: 11m33.002sec

checking: EG [[[[1<=p214 & p214<=1] | [0<=p251 & p251<=0]] & AF [[[AF [~ [[1<=p24 & p24<=1]]] | [~ [[p3<=0 & 0<=p3]] & ~ [[p222<=1 & 1<=p222]]]] & AF [[p233<=1 & 1<=p233]]]]]]
normalized: EG [[~ [EG [~ [[[[~ [[p222<=1 & 1<=p222]] & ~ [[p3<=0 & 0<=p3]]] | ~ [EG [[1<=p24 & p24<=1]]]] & ~ [EG [~ [[p233<=1 & 1<=p233]]]]]]]] & [[0<=p251 & p251<=0] | [1<=p214 & p214<=1]]]]

abstracting: (p214<=1)
states: 35,357,924 (7)
abstracting: (1<=p214)
states: 16
abstracting: (p251<=0)
states: 35,357,908 (7)
abstracting: (0<=p251)
states: 35,357,924 (7)
abstracting: (1<=p233)
states: 16
abstracting: (p233<=1)
states: 35,357,924 (7)

before gc: list nodes free: 25322992

after gc: idd nodes used:133847, unused:63866153; list nodes free:295108796
..............................................................................................................................................................................................................................
before gc: list nodes free: 1736882

after gc: idd nodes used:323573, unused:63676427; list nodes free:296356828
.....................
before gc: list nodes free: 28362910

after gc: idd nodes used:212902, unused:63787098; list nodes free:296877556
.MC time: 9m14.011sec

checking: AF [[[EX [[[AX [[0<=p102 & p102<=0]] | [0<=p91 & p91<=0]] | [0<=p183 & p183<=0]]] & AX [AG [[[1<=p253 & p253<=1] & [0<=p88 & p88<=0]]]]] | AF [[AG [[[1<=p175 & p175<=1] & [0<=p248 & p248<=0]]] | [1<=p236 & p236<=1]]]]]
normalized: ~ [EG [~ [[~ [EG [~ [[~ [E [true U ~ [[[0<=p248 & p248<=0] & [1<=p175 & p175<=1]]]]] | [1<=p236 & p236<=1]]]]] | [~ [EX [E [true U ~ [[[0<=p88 & p88<=0] & [1<=p253 & p253<=1]]]]]] & EX [[[0<=p183 & p183<=0] | [[0<=p91 & p91<=0] | ~ [EX [~ [[0<=p102 & p102<=0]]]]]]]]]]]]

abstracting: (p102<=0)
states: 29,669,368 (7)
abstracting: (0<=p102)
states: 35,357,924 (7)
.abstracting: (p91<=0)
states: 35,330,980 (7)
abstracting: (0<=p91)
states: 35,357,924 (7)
abstracting: (p183<=0)
states: 35,227,008 (7)
abstracting: (0<=p183)
states: 35,357,924 (7)
.abstracting: (p253<=1)
states: 35,357,924 (7)
abstracting: (1<=p253)
states: 16
abstracting: (p88<=0)
states: 35,212,048 (7)
abstracting: (0<=p88)
states: 35,357,924 (7)
.abstracting: (p236<=1)
states: 35,357,924 (7)
abstracting: (1<=p236)
states: 245,173 (5)
abstracting: (p175<=1)
states: 35,357,924 (7)
abstracting: (1<=p175)
states: 16
abstracting: (p248<=0)
states: 35,125,348 (7)
abstracting: (0<=p248)
states: 35,357,924 (7)
.......................................................................................................................................................
before gc: list nodes free: 13569645

after gc: idd nodes used:202638, unused:63797362; list nodes free:296921098
...............MC time: 7m24.001sec

checking: AX [E [AF [~ [[[[1<=p214 & p214<=1] | [0<=p46 & p46<=0]] & [[1<=p147 & p147<=1] | [0<=p123 & p123<=0]]]]] U [[[AG [[[1<=p1 & p1<=1] | [0<=p66 & p66<=0]]] | EX [[1<=p187 & p187<=1]]] & EX [[1<=p215 & p215<=1]]] & ~ [EG [[[1<=p101 & p101<=1] & [1<=p20 & p20<=1]]]]]]]
normalized: ~ [EX [~ [E [~ [EG [[[[0<=p123 & p123<=0] | [1<=p147 & p147<=1]] & [[0<=p46 & p46<=0] | [1<=p214 & p214<=1]]]]] U [~ [EG [[[1<=p20 & p20<=1] & [1<=p101 & p101<=1]]]] & [EX [[1<=p215 & p215<=1]] & [EX [[1<=p187 & p187<=1]] | ~ [E [true U ~ [[[0<=p66 & p66<=0] | [1<=p1 & p1<=1]]]]]]]]]]]]

abstracting: (p1<=1)
states: 35,357,924 (7)
abstracting: (1<=p1)
states: 6,537,536 (6)
abstracting: (p66<=0)
states: 34,799,764 (7)
abstracting: (0<=p66)
states: 35,357,924 (7)

before gc: list nodes free: 27536578

after gc: idd nodes used:129655, unused:63870345; list nodes free:297254620
abstracting: (p187<=1)
states: 35,357,924 (7)
abstracting: (1<=p187)
states: 9,657,716 (6)
.abstracting: (p215<=1)
states: 35,357,924 (7)
abstracting: (1<=p215)
states: 16
.abstracting: (p101<=1)
states: 35,357,924 (7)
abstracting: (1<=p101)
states: 16
abstracting: (p20<=1)
states: 35,357,924 (7)
abstracting: (1<=p20)
states: 95,947 (4)
.
EG iterations: 1
abstracting: (p214<=1)
states: 35,357,924 (7)
abstracting: (1<=p214)
states: 16
abstracting: (p46<=0)
states: 32,445,740 (7)
abstracting: (0<=p46)
states: 35,357,924 (7)
abstracting: (p147<=1)
states: 35,357,924 (7)
abstracting: (1<=p147)
states: 6,540,766 (6)
abstracting: (p123<=0)
states: 35,357,908 (7)
abstracting: (0<=p123)
states: 35,357,924 (7)
.............................................................................................................................................................................................................
before gc: list nodes free: 1174752

after gc: idd nodes used:190703, unused:63809297; list nodes free:301182559
............MC time: 5m55.000sec

checking: [AG [[[A [EG [[[[1<=p144 & p144<=1] | [p27<=0 & 0<=p27]] | [p247<=0 & 0<=p247]]] U [[[p79<=1 & 1<=p79] | [p125<=0 & 0<=p125]] | EX [[p162<=1 & 1<=p162]]]] | [A [~ [[[1<=p11 & p11<=1] | [0<=p119 & p119<=0]]] U ~ [[p164<=0 & 0<=p164]]] & [[1<=p62 & p62<=1] | [0<=p131 & p131<=0]]]] | [E [[[1<=p88 & p88<=1] | [0<=p11 & p11<=0]] U [0<=p127 & p127<=0]] | A [[[1<=p69 & p69<=1] & [1<=p73 & p73<=1]] U [[1<=p39 & p39<=1] | [0<=p226 & p226<=0]]]]]] & [EX [0<=0] | EF [[[[1<=p11 & p11<=1] & [p214<=0 & 0<=p214]] | ~ [E [[[[0<=p4 & p4<=0] | [1<=p213 & p213<=1]] | [0<=p144 & p144<=0]] U [p18<=1 & 1<=p18]]]]]]]
normalized: [[E [true U [~ [E [[[0<=p144 & p144<=0] | [[1<=p213 & p213<=1] | [0<=p4 & p4<=0]]] U [p18<=1 & 1<=p18]]] | [[p214<=0 & 0<=p214] & [1<=p11 & p11<=1]]]] | EX [0<=0]] & ~ [E [true U ~ [[[[~ [EG [~ [[[0<=p226 & p226<=0] | [1<=p39 & p39<=1]]]]] & ~ [E [~ [[[0<=p226 & p226<=0] | [1<=p39 & p39<=1]]] U [~ [[[1<=p73 & p73<=1] & [1<=p69 & p69<=1]]] & ~ [[[0<=p226 & p226<=0] | [1<=p39 & p39<=1]]]]]]] | E [[[0<=p11 & p11<=0] | [1<=p88 & p88<=1]] U [0<=p127 & p127<=0]]] | [[[[0<=p131 & p131<=0] | [1<=p62 & p62<=1]] & [~ [EG [[p164<=0 & 0<=p164]]] & ~ [E [[p164<=0 & 0<=p164] U [[[0<=p119 & p119<=0] | [1<=p11 & p11<=1]] & [p164<=0 & 0<=p164]]]]]] | [~ [EG [~ [[EX [[p162<=1 & 1<=p162]] | [[p125<=0 & 0<=p125] | [p79<=1 & 1<=p79]]]]]] & ~ [E [~ [[EX [[p162<=1 & 1<=p162]] | [[p125<=0 & 0<=p125] | [p79<=1 & 1<=p79]]]] U [~ [EG [[[p247<=0 & 0<=p247] | [[p27<=0 & 0<=p27] | [1<=p144 & p144<=1]]]]] & ~ [[EX [[p162<=1 & 1<=p162]] | [[p125<=0 & 0<=p125] | [p79<=1 & 1<=p79]]]]]]]]]]]]]]

abstracting: (1<=p79)
states: 3,432,214 (6)
abstracting: (p79<=1)
states: 35,357,924 (7)
abstracting: (0<=p125)
states: 35,357,924 (7)
abstracting: (p125<=0)
states: 31,776,484 (7)
abstracting: (1<=p162)
states: 16
abstracting: (p162<=1)
states: 35,357,924 (7)
.abstracting: (p144<=1)
states: 35,357,924 (7)
abstracting: (1<=p144)
states: 16
abstracting: (0<=p27)
states: 35,357,924 (7)
abstracting: (p27<=0)
states: 30,369,496 (7)
abstracting: (0<=p247)
states: 35,357,924 (7)
abstracting: (p247<=0)
states: 35,357,908 (7)

EG iterations: 0
abstracting: (1<=p79)
states: 3,432,214 (6)
abstracting: (p79<=1)
states: 35,357,924 (7)
abstracting: (0<=p125)
states: 35,357,924 (7)
abstracting: (p125<=0)
states: 31,776,484 (7)
abstracting: (1<=p162)
states: 16
abstracting: (p162<=1)
states: 35,357,924 (7)
.abstracting: (1<=p79)
states: 3,432,214 (6)
abstracting: (p79<=1)
states: 35,357,924 (7)
abstracting: (0<=p125)
states: 35,357,924 (7)
abstracting: (p125<=0)
states: 31,776,484 (7)
abstracting: (1<=p162)
states: 16
abstracting: (p162<=1)
states: 35,357,924 (7)
......................................
before gc: list nodes free: 30806998

after gc: idd nodes used:175699, unused:63824301; list nodes free:301254568
.....................
EG iterations: 58
abstracting: (0<=p164)
states: 35,357,924 (7)
abstracting: (p164<=0)
states: 35,357,908 (7)
abstracting: (p11<=1)
states: 35,357,924 (7)
abstracting: (1<=p11)
states: 13,037,911 (7)
abstracting: (p119<=0)
states: 33,170,725 (7)
abstracting: (0<=p119)
states: 35,357,924 (7)
abstracting: (0<=p164)
states: 35,357,924 (7)
abstracting: (p164<=0)
states: 35,357,908 (7)
abstracting: (0<=p164)
states: 35,357,924 (7)
abstracting: (p164<=0)
states: 35,357,908 (7)
..........................................................MC time: 4m44.003sec

checking: [EX [[[AX [[0<=p53 & p53<=0]] | AG [[0<=p182 & p182<=0]]] & EG [EX [[p94<=0 & 0<=p94]]]]] | AG [EX [EG [EX [[[1<=p248 & p248<=1] & [0<=p209 & p209<=0]]]]]]]
normalized: [~ [E [true U ~ [EX [EG [EX [[[0<=p209 & p209<=0] & [1<=p248 & p248<=1]]]]]]]] | EX [[EG [EX [[p94<=0 & 0<=p94]]] & [~ [E [true U ~ [[0<=p182 & p182<=0]]]] | ~ [EX [~ [[0<=p53 & p53<=0]]]]]]]]

abstracting: (p53<=0)
states: 29,414,708 (7)
abstracting: (0<=p53)
states: 35,357,924 (7)

before gc: list nodes free: 13474818

after gc: idd nodes used:307954, unused:63692046; list nodes free:300651820
.abstracting: (p182<=0)
states: 30,561,358 (7)
abstracting: (0<=p182)
states: 35,357,924 (7)
abstracting: (0<=p94)
states: 35,357,924 (7)
abstracting: (p94<=0)
states: 35,357,908 (7)
.......................................................................................................................................................................................................
before gc: list nodes free: 89740

after gc: idd nodes used:330422, unused:63669578; list nodes free:300545726
......................
before gc: list nodes free: 31476284

after gc: idd nodes used:241774, unused:63758226; list nodes free:300981554
...................................................................................
EG iterations: 303
.abstracting: (p248<=1)
states: 35,357,924 (7)
abstracting: (1<=p248)
states: 232,576 (5)
abstracting: (p209<=0)
states: 35,357,908 (7)
abstracting: (0<=p209)
states: 35,357,924 (7)

before gc: list nodes free: 32998707

after gc: idd nodes used:190652, unused:63809348; list nodes free:301182256
....................................................................
EG iterations: 67
.-> the formula is FALSE

FORMULA TokenRing-PT-015-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 5940160 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16052340 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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ 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.036sec

1416 2234 2571 6562 16890 19318 18416 23696
iterations count:862239 (238), effective:830 (0)

initing FirstDep: 0m 0.037sec

27623
iterations count:122087 (33), effective:71 (0)

iterations count:3616 (1), effective:0 (0)

iterations count:7171 (1), effective:16 (0)
20224 27785 30715
iterations count:321908 (89), effective:364 (0)

net_ddint.h:600: Timeout: after 692 sec


net_ddint.h:600: Timeout: after 553 sec


iterations count:9339 (2), effective:16 (0)

iterations count:5227 (1), effective:16 (0)

net_ddint.h:600: Timeout: after 443 sec

22007 27448 31485
iterations count:329243 (91), effective:379 (0)

net_ddint.h:600: Timeout: after 354 sec

24420
iterations count:184076 (50), effective:118 (0)

net_ddint.h:600: Timeout: after 283 sec

20224 27785 30715
iterations count:321908 (89), effective:364 (0)

iterations count:3616 (1), effective:0 (0)

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="TokenRing-PT-015"
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 TokenRing-PT-015, 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 r490-tall-167912709000665"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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