About the Execution of LTSMin+red for DES-PT-40a
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
465.096 | 3597494.00 | 14320222.00 | 315.10 | ?F????????FT??T? | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r105-tall-167814481200457.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is DES-PT-40a, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r105-tall-167814481200457
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 6.4K Feb 26 15:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Feb 26 15:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 26 15:41 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 26 15:41 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 15:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 15:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 123K Feb 26 15:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 26 15:45 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 26 15:45 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Feb 25 15:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 83K 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 DES-PT-40a-CTLCardinality-00
FORMULA_NAME DES-PT-40a-CTLCardinality-01
FORMULA_NAME DES-PT-40a-CTLCardinality-02
FORMULA_NAME DES-PT-40a-CTLCardinality-03
FORMULA_NAME DES-PT-40a-CTLCardinality-04
FORMULA_NAME DES-PT-40a-CTLCardinality-05
FORMULA_NAME DES-PT-40a-CTLCardinality-06
FORMULA_NAME DES-PT-40a-CTLCardinality-07
FORMULA_NAME DES-PT-40a-CTLCardinality-08
FORMULA_NAME DES-PT-40a-CTLCardinality-09
FORMULA_NAME DES-PT-40a-CTLCardinality-10
FORMULA_NAME DES-PT-40a-CTLCardinality-11
FORMULA_NAME DES-PT-40a-CTLCardinality-12
FORMULA_NAME DES-PT-40a-CTLCardinality-13
FORMULA_NAME DES-PT-40a-CTLCardinality-14
FORMULA_NAME DES-PT-40a-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1678303481981
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-40a
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-08 19:24:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-08 19:24:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 19:24:43] [INFO ] Load time of PNML (sax parser for PT used): 57 ms
[2023-03-08 19:24:43] [INFO ] Transformed 274 places.
[2023-03-08 19:24:43] [INFO ] Transformed 231 transitions.
[2023-03-08 19:24:43] [INFO ] Found NUPN structural information;
[2023-03-08 19:24:43] [INFO ] Parsed PT model containing 274 places and 231 transitions and 1116 arcs in 120 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 11 ms.
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
Support contains 101 out of 274 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 274/274 places, 217/217 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 273 transition count 216
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 273 transition count 216
Applied a total of 2 rules in 38 ms. Remains 273 /274 variables (removed 1) and now considering 216/217 (removed 1) transitions.
// Phase 1: matrix 216 rows 273 cols
[2023-03-08 19:24:43] [INFO ] Computed 59 place invariants in 27 ms
[2023-03-08 19:24:44] [INFO ] Implicit Places using invariants in 491 ms returned []
[2023-03-08 19:24:44] [INFO ] Invariant cache hit.
[2023-03-08 19:24:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-08 19:24:44] [INFO ] Implicit Places using invariants and state equation in 370 ms returned []
Implicit Place search using SMT with State Equation took 891 ms to find 0 implicit places.
[2023-03-08 19:24:44] [INFO ] Invariant cache hit.
[2023-03-08 19:24:44] [INFO ] Dead Transitions using invariants and state equation in 142 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 273/274 places, 216/217 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1072 ms. Remains : 273/274 places, 216/217 transitions.
Support contains 101 out of 273 places after structural reductions.
[2023-03-08 19:24:44] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-08 19:24:44] [INFO ] Flatten gal took : 56 ms
[2023-03-08 19:24:44] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA DES-PT-40a-CTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-40a-CTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-08 19:24:44] [INFO ] Flatten gal took : 23 ms
[2023-03-08 19:24:44] [INFO ] Input system was already deterministic with 216 transitions.
Support contains 72 out of 273 places (down from 101) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 220 resets, run finished after 576 ms. (steps per millisecond=17 ) properties (out of 40) seen :21
Incomplete Best-First random walk after 1000 steps, including 6 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 19) 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 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 19) seen :0
Running SMT prover for 19 properties.
[2023-03-08 19:24:45] [INFO ] Invariant cache hit.
[2023-03-08 19:24:45] [INFO ] [Real]Absence check using 34 positive place invariants in 5 ms returned sat
[2023-03-08 19:24:45] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 17 ms returned sat
[2023-03-08 19:24:45] [INFO ] After 185ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:19
[2023-03-08 19:24:46] [INFO ] [Nat]Absence check using 34 positive place invariants in 6 ms returned sat
[2023-03-08 19:24:46] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 124 ms returned sat
[2023-03-08 19:24:46] [INFO ] After 503ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :18
[2023-03-08 19:24:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-08 19:24:47] [INFO ] After 398ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :1 sat :18
[2023-03-08 19:24:47] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 4 ms to minimize.
[2023-03-08 19:24:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 94 ms
[2023-03-08 19:24:47] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 0 ms to minimize.
[2023-03-08 19:24:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 60 ms
[2023-03-08 19:24:47] [INFO ] Deduced a trap composed of 12 places in 71 ms of which 1 ms to minimize.
[2023-03-08 19:24:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 89 ms
[2023-03-08 19:24:48] [INFO ] After 1130ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :18
Attempting to minimize the solution found.
Minimization took 387 ms.
[2023-03-08 19:24:48] [INFO ] After 2489ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :18
Fused 19 Parikh solutions to 18 different solutions.
Parikh walk visited 4 properties in 906 ms.
Support contains 17 out of 273 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 273/273 places, 216/216 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 273 transition count 214
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 8 place count 273 transition count 214
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 272 transition count 213
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 10 place count 271 transition count 213
Applied a total of 10 rules in 64 ms. Remains 271 /273 variables (removed 2) and now considering 213/216 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 271/273 places, 213/216 transitions.
Incomplete random walk after 10000 steps, including 135 resets, run finished after 281 ms. (steps per millisecond=35 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 22 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 22 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 14) seen :0
Interrupted probabilistic random walk after 603897 steps, run timeout after 3001 ms. (steps per millisecond=201 ) properties seen :{}
Probabilistic random walk after 603897 steps, saw 86858 distinct states, run finished after 3003 ms. (steps per millisecond=201 ) properties seen :0
Running SMT prover for 14 properties.
// Phase 1: matrix 213 rows 271 cols
[2023-03-08 19:24:53] [INFO ] Computed 60 place invariants in 7 ms
[2023-03-08 19:24:53] [INFO ] [Real]Absence check using 35 positive place invariants in 13 ms returned sat
[2023-03-08 19:24:53] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 15 ms returned sat
[2023-03-08 19:24:53] [INFO ] After 147ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2023-03-08 19:24:53] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 19:24:53] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 30 ms returned sat
[2023-03-08 19:24:54] [INFO ] After 769ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :14
[2023-03-08 19:24:54] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 19:24:54] [INFO ] After 267ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :14
[2023-03-08 19:24:54] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 2 ms to minimize.
[2023-03-08 19:24:54] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 0 ms to minimize.
[2023-03-08 19:24:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 164 ms
[2023-03-08 19:24:55] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 1 ms to minimize.
[2023-03-08 19:24:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 81 ms
[2023-03-08 19:24:55] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 1 ms to minimize.
[2023-03-08 19:24:55] [INFO ] Deduced a trap composed of 6 places in 52 ms of which 0 ms to minimize.
[2023-03-08 19:24:55] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 1 ms to minimize.
[2023-03-08 19:24:55] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 191 ms
[2023-03-08 19:24:55] [INFO ] After 1042ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :14
Attempting to minimize the solution found.
Minimization took 296 ms.
[2023-03-08 19:24:55] [INFO ] After 2402ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :14
Parikh walk visited 0 properties in 619 ms.
Support contains 17 out of 271 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 271/271 places, 213/213 transitions.
Applied a total of 0 rules in 11 ms. Remains 271 /271 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 271/271 places, 213/213 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 271/271 places, 213/213 transitions.
Applied a total of 0 rules in 10 ms. Remains 271 /271 variables (removed 0) and now considering 213/213 (removed 0) transitions.
[2023-03-08 19:24:56] [INFO ] Invariant cache hit.
[2023-03-08 19:24:56] [INFO ] Implicit Places using invariants in 148 ms returned []
[2023-03-08 19:24:56] [INFO ] Invariant cache hit.
[2023-03-08 19:24:56] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 19:24:56] [INFO ] Implicit Places using invariants and state equation in 364 ms returned []
Implicit Place search using SMT with State Equation took 515 ms to find 0 implicit places.
[2023-03-08 19:24:56] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-08 19:24:56] [INFO ] Invariant cache hit.
[2023-03-08 19:24:57] [INFO ] Dead Transitions using invariants and state equation in 118 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 655 ms. Remains : 271/271 places, 213/213 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 271 transition count 213
Applied a total of 1 rules in 19 ms. Remains 271 /271 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Running SMT prover for 14 properties.
// Phase 1: matrix 213 rows 271 cols
[2023-03-08 19:24:57] [INFO ] Computed 60 place invariants in 8 ms
[2023-03-08 19:24:57] [INFO ] [Real]Absence check using 35 positive place invariants in 7 ms returned sat
[2023-03-08 19:24:57] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 14 ms returned sat
[2023-03-08 19:24:57] [INFO ] After 138ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2023-03-08 19:24:57] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 19:24:57] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 29 ms returned sat
[2023-03-08 19:24:58] [INFO ] After 512ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :14
[2023-03-08 19:24:58] [INFO ] Deduced a trap composed of 57 places in 43 ms of which 1 ms to minimize.
[2023-03-08 19:24:58] [INFO ] Deduced a trap composed of 53 places in 47 ms of which 0 ms to minimize.
[2023-03-08 19:24:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 127 ms
[2023-03-08 19:24:58] [INFO ] After 1032ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :14
Attempting to minimize the solution found.
Minimization took 273 ms.
[2023-03-08 19:24:58] [INFO ] After 1580ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :14
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
[2023-03-08 19:24:58] [INFO ] Flatten gal took : 24 ms
[2023-03-08 19:24:58] [INFO ] Flatten gal took : 19 ms
[2023-03-08 19:24:58] [INFO ] Input system was already deterministic with 216 transitions.
Computed a total of 176 stabilizing places and 170 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 273/273 places, 216/216 transitions.
Applied a total of 0 rules in 3 ms. Remains 273 /273 variables (removed 0) and now considering 216/216 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 273/273 places, 216/216 transitions.
[2023-03-08 19:24:59] [INFO ] Flatten gal took : 31 ms
[2023-03-08 19:24:59] [INFO ] Flatten gal took : 16 ms
[2023-03-08 19:24:59] [INFO ] Input system was already deterministic with 216 transitions.
Starting structural reductions in LTL mode, iteration 0 : 273/273 places, 216/216 transitions.
Applied a total of 0 rules in 2 ms. Remains 273 /273 variables (removed 0) and now considering 216/216 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 273/273 places, 216/216 transitions.
[2023-03-08 19:24:59] [INFO ] Flatten gal took : 26 ms
[2023-03-08 19:24:59] [INFO ] Flatten gal took : 15 ms
[2023-03-08 19:24:59] [INFO ] Input system was already deterministic with 216 transitions.
Starting structural reductions in LTL mode, iteration 0 : 273/273 places, 216/216 transitions.
Applied a total of 0 rules in 3 ms. Remains 273 /273 variables (removed 0) and now considering 216/216 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17 ms. Remains : 273/273 places, 216/216 transitions.
[2023-03-08 19:24:59] [INFO ] Flatten gal took : 21 ms
[2023-03-08 19:24:59] [INFO ] Flatten gal took : 15 ms
[2023-03-08 19:24:59] [INFO ] Input system was already deterministic with 216 transitions.
Starting structural reductions in LTL mode, iteration 0 : 273/273 places, 216/216 transitions.
Applied a total of 0 rules in 3 ms. Remains 273 /273 variables (removed 0) and now considering 216/216 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 273/273 places, 216/216 transitions.
[2023-03-08 19:24:59] [INFO ] Flatten gal took : 16 ms
[2023-03-08 19:24:59] [INFO ] Flatten gal took : 13 ms
[2023-03-08 19:24:59] [INFO ] Input system was already deterministic with 216 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 273/273 places, 216/216 transitions.
Applied a total of 0 rules in 12 ms. Remains 273 /273 variables (removed 0) and now considering 216/216 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 12 ms. Remains : 273/273 places, 216/216 transitions.
[2023-03-08 19:24:59] [INFO ] Flatten gal took : 20 ms
[2023-03-08 19:24:59] [INFO ] Flatten gal took : 23 ms
[2023-03-08 19:24:59] [INFO ] Input system was already deterministic with 216 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 273/273 places, 216/216 transitions.
Applied a total of 0 rules in 11 ms. Remains 273 /273 variables (removed 0) and now considering 216/216 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 11 ms. Remains : 273/273 places, 216/216 transitions.
[2023-03-08 19:24:59] [INFO ] Flatten gal took : 10 ms
[2023-03-08 19:24:59] [INFO ] Flatten gal took : 11 ms
[2023-03-08 19:24:59] [INFO ] Input system was already deterministic with 216 transitions.
Starting structural reductions in LTL mode, iteration 0 : 273/273 places, 216/216 transitions.
Applied a total of 0 rules in 2 ms. Remains 273 /273 variables (removed 0) and now considering 216/216 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 273/273 places, 216/216 transitions.
[2023-03-08 19:24:59] [INFO ] Flatten gal took : 10 ms
[2023-03-08 19:24:59] [INFO ] Flatten gal took : 10 ms
[2023-03-08 19:24:59] [INFO ] Input system was already deterministic with 216 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 273/273 places, 216/216 transitions.
Applied a total of 0 rules in 10 ms. Remains 273 /273 variables (removed 0) and now considering 216/216 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 10 ms. Remains : 273/273 places, 216/216 transitions.
[2023-03-08 19:24:59] [INFO ] Flatten gal took : 10 ms
[2023-03-08 19:24:59] [INFO ] Flatten gal took : 10 ms
[2023-03-08 19:24:59] [INFO ] Input system was already deterministic with 216 transitions.
Starting structural reductions in LTL mode, iteration 0 : 273/273 places, 216/216 transitions.
Applied a total of 0 rules in 3 ms. Remains 273 /273 variables (removed 0) and now considering 216/216 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 273/273 places, 216/216 transitions.
[2023-03-08 19:24:59] [INFO ] Flatten gal took : 9 ms
[2023-03-08 19:24:59] [INFO ] Flatten gal took : 10 ms
[2023-03-08 19:24:59] [INFO ] Input system was already deterministic with 216 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 273/273 places, 216/216 transitions.
Applied a total of 0 rules in 14 ms. Remains 273 /273 variables (removed 0) and now considering 216/216 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 14 ms. Remains : 273/273 places, 216/216 transitions.
[2023-03-08 19:24:59] [INFO ] Flatten gal took : 9 ms
[2023-03-08 19:24:59] [INFO ] Flatten gal took : 10 ms
[2023-03-08 19:24:59] [INFO ] Input system was already deterministic with 216 transitions.
Incomplete random walk after 10000 steps, including 230 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1437987 steps, run timeout after 3001 ms. (steps per millisecond=479 ) properties seen :{}
Probabilistic random walk after 1437987 steps, saw 201421 distinct states, run finished after 3001 ms. (steps per millisecond=479 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 216 rows 273 cols
[2023-03-08 19:25:02] [INFO ] Computed 59 place invariants in 9 ms
[2023-03-08 19:25:02] [INFO ] After 78ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 19:25:02] [INFO ] [Nat]Absence check using 34 positive place invariants in 5 ms returned sat
[2023-03-08 19:25:02] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 24 ms returned sat
[2023-03-08 19:25:03] [INFO ] After 229ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 19:25:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-08 19:25:03] [INFO ] After 73ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 19:25:03] [INFO ] After 141ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 70 ms.
[2023-03-08 19:25:03] [INFO ] After 576ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 14120 steps, including 212 resets, run visited all 1 properties in 40 ms. (steps per millisecond=353 )
FORMULA DES-PT-40a-CTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 39 ms.
Starting structural reductions in LTL mode, iteration 0 : 273/273 places, 216/216 transitions.
Applied a total of 0 rules in 3 ms. Remains 273 /273 variables (removed 0) and now considering 216/216 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 273/273 places, 216/216 transitions.
[2023-03-08 19:25:03] [INFO ] Flatten gal took : 9 ms
[2023-03-08 19:25:03] [INFO ] Flatten gal took : 12 ms
[2023-03-08 19:25:03] [INFO ] Input system was already deterministic with 216 transitions.
Starting structural reductions in LTL mode, iteration 0 : 273/273 places, 216/216 transitions.
Applied a total of 0 rules in 3 ms. Remains 273 /273 variables (removed 0) and now considering 216/216 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 273/273 places, 216/216 transitions.
[2023-03-08 19:25:03] [INFO ] Flatten gal took : 8 ms
[2023-03-08 19:25:03] [INFO ] Flatten gal took : 9 ms
[2023-03-08 19:25:03] [INFO ] Input system was already deterministic with 216 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 273/273 places, 216/216 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 271 transition count 215
Applied a total of 1 rules in 10 ms. Remains 271 /273 variables (removed 2) and now considering 215/216 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 11 ms. Remains : 271/273 places, 215/216 transitions.
[2023-03-08 19:25:03] [INFO ] Flatten gal took : 10 ms
[2023-03-08 19:25:03] [INFO ] Flatten gal took : 9 ms
[2023-03-08 19:25:03] [INFO ] Input system was already deterministic with 215 transitions.
Incomplete random walk after 10000 steps, including 228 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1493161 steps, run timeout after 3001 ms. (steps per millisecond=497 ) properties seen :{}
Probabilistic random walk after 1493161 steps, saw 208280 distinct states, run finished after 3001 ms. (steps per millisecond=497 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 215 rows 271 cols
[2023-03-08 19:25:06] [INFO ] Computed 58 place invariants in 12 ms
[2023-03-08 19:25:06] [INFO ] [Real]Absence check using 33 positive place invariants in 4 ms returned sat
[2023-03-08 19:25:06] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 14 ms returned sat
[2023-03-08 19:25:06] [INFO ] After 71ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 19:25:06] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2023-03-08 19:25:06] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 40 ms returned sat
[2023-03-08 19:25:07] [INFO ] After 158ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 19:25:07] [INFO ] After 174ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-08 19:25:07] [INFO ] After 306ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 1748 steps, including 2 resets, run visited all 1 properties in 6 ms. (steps per millisecond=291 )
FORMULA DES-PT-40a-CTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 5 ms.
Starting structural reductions in SI_CTL mode, iteration 0 : 273/273 places, 216/216 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 271 transition count 215
Applied a total of 1 rules in 12 ms. Remains 271 /273 variables (removed 2) and now considering 215/216 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 12 ms. Remains : 271/273 places, 215/216 transitions.
[2023-03-08 19:25:07] [INFO ] Flatten gal took : 9 ms
[2023-03-08 19:25:07] [INFO ] Flatten gal took : 9 ms
[2023-03-08 19:25:07] [INFO ] Input system was already deterministic with 215 transitions.
[2023-03-08 19:25:07] [INFO ] Flatten gal took : 10 ms
[2023-03-08 19:25:07] [INFO ] Flatten gal took : 9 ms
[2023-03-08 19:25:07] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2023-03-08 19:25:07] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 273 places, 216 transitions and 1048 arcs took 1 ms.
Total runtime 23718 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --ctl=/tmp/554/ctl_0_ --ctl=/tmp/554/ctl_1_ --ctl=/tmp/554/ctl_2_ --ctl=/tmp/554/ctl_3_ --ctl=/tmp/554/ctl_4_ --ctl=/tmp/554/ctl_5_ --ctl=/tmp/554/ctl_6_ --ctl=/tmp/554/ctl_7_ --ctl=/tmp/554/ctl_8_ --ctl=/tmp/554/ctl_9_ --ctl=/tmp/554/ctl_10_ --ctl=/tmp/554/ctl_11_ --mu-par --mu-opt
TIME LIMIT: Killed by timeout after 3570 seconds
MemTotal: 16393216 kB
MemFree: 15963484 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16097728 kB
Could not compute solution for formula : DES-PT-40a-CTLCardinality-00
Could not compute solution for formula : DES-PT-40a-CTLCardinality-02
Could not compute solution for formula : DES-PT-40a-CTLCardinality-03
Could not compute solution for formula : DES-PT-40a-CTLCardinality-04
Could not compute solution for formula : DES-PT-40a-CTLCardinality-05
Could not compute solution for formula : DES-PT-40a-CTLCardinality-06
Could not compute solution for formula : DES-PT-40a-CTLCardinality-07
Could not compute solution for formula : DES-PT-40a-CTLCardinality-08
Could not compute solution for formula : DES-PT-40a-CTLCardinality-09
Could not compute solution for formula : DES-PT-40a-CTLCardinality-12
Could not compute solution for formula : DES-PT-40a-CTLCardinality-13
Could not compute solution for formula : DES-PT-40a-CTLCardinality-15
BK_STOP 1678307079475
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -timeout 360 -rebuildPNML
mcc2023
ctl formula name DES-PT-40a-CTLCardinality-00
ctl formula formula --ctl=/tmp/554/ctl_0_
ctl formula name DES-PT-40a-CTLCardinality-02
ctl formula formula --ctl=/tmp/554/ctl_1_
ctl formula name DES-PT-40a-CTLCardinality-03
ctl formula formula --ctl=/tmp/554/ctl_2_
ctl formula name DES-PT-40a-CTLCardinality-04
ctl formula formula --ctl=/tmp/554/ctl_3_
ctl formula name DES-PT-40a-CTLCardinality-05
ctl formula formula --ctl=/tmp/554/ctl_4_
ctl formula name DES-PT-40a-CTLCardinality-06
ctl formula formula --ctl=/tmp/554/ctl_5_
ctl formula name DES-PT-40a-CTLCardinality-07
ctl formula formula --ctl=/tmp/554/ctl_6_
ctl formula name DES-PT-40a-CTLCardinality-08
ctl formula formula --ctl=/tmp/554/ctl_7_
ctl formula name DES-PT-40a-CTLCardinality-09
ctl formula formula --ctl=/tmp/554/ctl_8_
ctl formula name DES-PT-40a-CTLCardinality-12
ctl formula formula --ctl=/tmp/554/ctl_9_
ctl formula name DES-PT-40a-CTLCardinality-13
ctl formula formula --ctl=/tmp/554/ctl_10_
ctl formula name DES-PT-40a-CTLCardinality-15
ctl formula formula --ctl=/tmp/554/ctl_11_
pnml2lts-sym: Exploration order is bfs-prev
pnml2lts-sym: Saturation strategy is sat
pnml2lts-sym: Guided search strategy is unguided
pnml2lts-sym: Attractor strategy is default
pnml2lts-sym: opening model.pnml
pnml2lts-sym: Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-sym: Petri net has 273 places, 216 transitions and 1048 arcs
pnml2lts-sym: Petri net Petri analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-sym: Initializing regrouping layer
pnml2lts-sym: Regroup specification: bs,w2W,ru,hf
pnml2lts-sym: Regroup Boost's Sloan
pnml2lts-sym: Regroup over-approximate must-write to may-write
pnml2lts-sym: Regroup Row sUbsume
pnml2lts-sym: Reqroup Horizontal Flip
pnml2lts-sym: Regrouping: 216->208 groups
pnml2lts-sym: Regrouping took 0.040 real 0.040 user 0.000 sys
pnml2lts-sym: state vector length is 273; there are 208 groups
pnml2lts-sym: Creating a multi-core ListDD domain.
pnml2lts-sym: Sylvan allocates 15.000 GB virtual memory for nodes table and operation cache.
pnml2lts-sym: Initial nodes table and operation cache requires 60.00 MB.
pnml2lts-sym: Using GBgetTransitionsShortR2W as next-state function
pnml2lts-sym: got initial state
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
Killing (15) : 560
Killing (9) : 560
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="DES-PT-40a"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is DES-PT-40a, 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 r105-tall-167814481200457"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-40a.tgz
mv DES-PT-40a 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 '
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 ;