fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r078-tall-171620515600387
Last Updated
July 7, 2024

About the Execution of GreatSPN+red for CloudDeployment-PT-7a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1524.808 186311.00 243780.00 509.30 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/mcc2024-input.r078-tall-171620515600387.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is CloudDeployment-PT-7a, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r078-tall-171620515600387
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 808K
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 15:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.8K Apr 11 17:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 77K Apr 11 17:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Apr 11 17:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K Apr 11 17:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:34 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:34 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 420K May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME QuasiLiveness

=== Now, execution of the tool begins

BK_START 1716273717166

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=CloudDeployment-PT-7a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 06:41:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2024-05-21 06:41:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 06:41:58] [INFO ] Load time of PNML (sax parser for PT used): 120 ms
[2024-05-21 06:41:58] [INFO ] Transformed 264 places.
[2024-05-21 06:41:58] [INFO ] Transformed 1174 transitions.
[2024-05-21 06:41:58] [INFO ] Found NUPN structural information;
[2024-05-21 06:41:58] [INFO ] Parsed PT model containing 264 places and 1174 transitions and 7331 arcs in 233 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 264/264 places, 1174/1174 transitions.
Graph (trivial) has 309 edges and 264 vertex of which 70 / 264 are part of one of the 21 SCC in 4 ms
Free SCC test removed 49 places
Ensure Unique test removed 301 transitions
Reduce isomorphic transitions removed 301 transitions.
Ensure Unique test removed 14 places
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 201 transition count 873
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: -91
Deduced a syphon composed of 21 places in 3 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 1 with 42 rules applied. Total rules applied 57 place count 180 transition count 964
Applied a total of 57 rules in 72 ms. Remains 180 /264 variables (removed 84) and now considering 964/1174 (removed 210) transitions.
[2024-05-21 06:41:58] [INFO ] Flow matrix only has 412 transitions (discarded 552 similar events)
// Phase 1: matrix 412 rows 180 cols
[2024-05-21 06:41:58] [INFO ] Computed 28 invariants in 18 ms
[2024-05-21 06:41:59] [INFO ] Implicit Places using invariants in 332 ms returned []
[2024-05-21 06:41:59] [INFO ] Flow matrix only has 412 transitions (discarded 552 similar events)
[2024-05-21 06:41:59] [INFO ] Invariant cache hit.
[2024-05-21 06:41:59] [INFO ] State equation strengthened by 282 read => feed constraints.
[2024-05-21 06:41:59] [INFO ] Implicit Places using invariants and state equation in 627 ms returned []
Implicit Place search using SMT with State Equation took 984 ms to find 0 implicit places.
Running 963 sub problems to find dead transitions.
[2024-05-21 06:41:59] [INFO ] Flow matrix only has 412 transitions (discarded 552 similar events)
[2024-05-21 06:41:59] [INFO ] Invariant cache hit.
[2024-05-21 06:41:59] [INFO ] State equation strengthened by 282 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 179/179 constraints. Problems are: Problem set: 0 solved, 963 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/179 variables, 28/207 constraints. Problems are: Problem set: 0 solved, 963 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 963 unsolved
At refinement iteration 3 (OVERLAPS) 411/590 variables, 179/386 constraints. Problems are: Problem set: 0 solved, 963 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/590 variables, 281/667 constraints. Problems are: Problem set: 0 solved, 963 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/590 variables, 0/667 constraints. Problems are: Problem set: 0 solved, 963 unsolved
SMT process timed out in 31525ms, After SMT, problems are : Problem set: 0 solved, 963 unsolved
Search for dead transitions found 0 dead transitions in 31553ms
Starting structural reductions in LIVENESS mode, iteration 1 : 180/264 places, 964/1174 transitions.
Finished structural reductions in LIVENESS mode , in 1 iterations and 32647 ms. Remains : 180/264 places, 964/1174 transitions.
Discarding 736 transitions out of 964. Remains 228
Initial state reduction rules removed 1 formulas.
RANDOM walk for 40000 steps (723 resets) in 2558 ms. (15 steps per ms) remains 17/227 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 17/17 properties
[2024-05-21 06:42:32] [INFO ] Flow matrix only has 412 transitions (discarded 552 similar events)
[2024-05-21 06:42:32] [INFO ] Invariant cache hit.
[2024-05-21 06:42:32] [INFO ] State equation strengthened by 282 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 14/62 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 131/179 variables, 14/76 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 131/207 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/179 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 411/590 variables, 179/386 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/590 variables, 281/667 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/590 variables, 0/667 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (OVERLAPS) 1/591 variables, 1/668 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/591 variables, 1/669 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/591 variables, 0/669 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 12 (OVERLAPS) 1/592 variables, 1/670 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/592 variables, 0/670 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 14 (OVERLAPS) 0/592 variables, 0/670 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 592/592 variables, and 670 constraints, problems are : Problem set: 0 solved, 17 unsolved in 2233 ms.
Refiners :[Domain max(s): 180/180 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 180/180 constraints, ReadFeed: 282/282 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 14/62 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 131/179 variables, 14/76 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 131/207 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/179 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 411/590 variables, 179/386 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/590 variables, 281/667 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/590 variables, 17/684 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/590 variables, 0/684 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (OVERLAPS) 1/591 variables, 1/685 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/591 variables, 1/686 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/591 variables, 0/686 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 13 (OVERLAPS) 1/592 variables, 1/687 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/592 variables, 0/687 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 15 (OVERLAPS) 0/592 variables, 0/687 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 592/592 variables, and 687 constraints, problems are : Problem set: 0 solved, 17 unsolved in 3195 ms.
Refiners :[Domain max(s): 180/180 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 180/180 constraints, ReadFeed: 282/282 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
After SMT, in 5502ms problems are : Problem set: 0 solved, 17 unsolved
Parikh walk visited 16 properties in 1367 ms.
Support contains 8 out of 180 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 180/180 places, 964/964 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 161 transitions
Reduce isomorphic transitions removed 161 transitions.
Iterating post reduction 0 with 161 rules applied. Total rules applied 161 place count 180 transition count 803
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 173 place count 168 transition count 742
Iterating global reduction 1 with 12 rules applied. Total rules applied 185 place count 168 transition count 742
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 189 place count 164 transition count 738
Iterating global reduction 1 with 4 rules applied. Total rules applied 193 place count 164 transition count 738
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 196 place count 161 transition count 735
Iterating global reduction 1 with 3 rules applied. Total rules applied 199 place count 161 transition count 735
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 201 place count 159 transition count 733
Iterating global reduction 1 with 2 rules applied. Total rules applied 203 place count 159 transition count 733
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 204 place count 158 transition count 732
Iterating global reduction 1 with 1 rules applied. Total rules applied 205 place count 158 transition count 732
Drop transitions (Redundant composition of simpler transitions.) removed 140 transitions
Redundant transition composition rules discarded 140 transitions
Iterating global reduction 1 with 140 rules applied. Total rules applied 345 place count 158 transition count 592
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 346 place count 158 transition count 592
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 347 place count 157 transition count 591
Applied a total of 347 rules in 147 ms. Remains 157 /180 variables (removed 23) and now considering 591/964 (removed 373) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 147 ms. Remains : 157/180 places, 591/964 transitions.
RANDOM walk for 4000000 steps (48192 resets) in 10136 ms. (394 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000003 steps (6869 resets) in 3173 ms. (1260 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2418183 steps, run timeout after 9001 ms. (steps per millisecond=268 ) properties seen :0 out of 1
Probabilistic random walk after 2418183 steps, saw 403937 distinct states, run finished after 9005 ms. (steps per millisecond=268 ) properties seen :0
[2024-05-21 06:42:51] [INFO ] Flow matrix only has 248 transitions (discarded 343 similar events)
// Phase 1: matrix 248 rows 157 cols
[2024-05-21 06:42:51] [INFO ] Computed 28 invariants in 2 ms
[2024-05-21 06:42:51] [INFO ] State equation strengthened by 9 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 86/94 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 63/157 variables, 21/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 248/405 variables, 157/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/405 variables, 9/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/405 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/405 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 405/405 variables, and 194 constraints, problems are : Problem set: 0 solved, 1 unsolved in 180 ms.
Refiners :[Generalized P Invariants (flows): 28/28 constraints, State Equation: 157/157 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 86/94 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 63/157 variables, 21/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 248/405 variables, 157/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/405 variables, 9/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/405 variables, 1/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/405 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/405 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 405/405 variables, and 195 constraints, problems are : Problem set: 0 solved, 1 unsolved in 142 ms.
Refiners :[Generalized P Invariants (flows): 28/28 constraints, State Equation: 157/157 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 334ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 20 ms.
Support contains 8 out of 157 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 157/157 places, 591/591 transitions.
Applied a total of 0 rules in 25 ms. Remains 157 /157 variables (removed 0) and now considering 591/591 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 157/157 places, 591/591 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 157/157 places, 591/591 transitions.
Applied a total of 0 rules in 15 ms. Remains 157 /157 variables (removed 0) and now considering 591/591 (removed 0) transitions.
[2024-05-21 06:42:52] [INFO ] Flow matrix only has 248 transitions (discarded 343 similar events)
[2024-05-21 06:42:52] [INFO ] Invariant cache hit.
[2024-05-21 06:42:52] [INFO ] Implicit Places using invariants in 186 ms returned []
[2024-05-21 06:42:52] [INFO ] Flow matrix only has 248 transitions (discarded 343 similar events)
[2024-05-21 06:42:52] [INFO ] Invariant cache hit.
[2024-05-21 06:42:52] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-21 06:42:52] [INFO ] Implicit Places using invariants and state equation in 232 ms returned []
Implicit Place search using SMT with State Equation took 420 ms to find 0 implicit places.
[2024-05-21 06:42:52] [INFO ] Redundant transitions in 35 ms returned []
Running 542 sub problems to find dead transitions.
[2024-05-21 06:42:52] [INFO ] Flow matrix only has 248 transitions (discarded 343 similar events)
[2024-05-21 06:42:52] [INFO ] Invariant cache hit.
[2024-05-21 06:42:52] [INFO ] State equation strengthened by 9 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 542 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 542 unsolved
At refinement iteration 2 (OVERLAPS) 7/157 variables, 7/28 constraints. Problems are: Problem set: 0 solved, 542 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 542 unsolved
At refinement iteration 4 (OVERLAPS) 248/405 variables, 157/185 constraints. Problems are: Problem set: 0 solved, 542 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/405 variables, 9/194 constraints. Problems are: Problem set: 0 solved, 542 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/405 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 542 unsolved
At refinement iteration 7 (OVERLAPS) 0/405 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 542 unsolved
No progress, stopping.
After SMT solving in domain Real declared 405/405 variables, and 194 constraints, problems are : Problem set: 0 solved, 542 unsolved in 17836 ms.
Refiners :[Generalized P Invariants (flows): 28/28 constraints, State Equation: 157/157 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 542/542 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 542 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 542 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 542 unsolved
At refinement iteration 2 (OVERLAPS) 7/157 variables, 7/28 constraints. Problems are: Problem set: 0 solved, 542 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 542 unsolved
At refinement iteration 4 (OVERLAPS) 248/405 variables, 157/185 constraints. Problems are: Problem set: 0 solved, 542 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/405 variables, 9/194 constraints. Problems are: Problem set: 0 solved, 542 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/405 variables, 542/736 constraints. Problems are: Problem set: 0 solved, 542 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/405 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 542 unsolved
At refinement iteration 8 (OVERLAPS) 0/405 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 542 unsolved
No progress, stopping.
After SMT solving in domain Int declared 405/405 variables, and 736 constraints, problems are : Problem set: 0 solved, 542 unsolved in 30012 ms.
Refiners :[Generalized P Invariants (flows): 28/28 constraints, State Equation: 157/157 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 542/542 constraints, Known Traps: 0/0 constraints]
After SMT, in 48654ms problems are : Problem set: 0 solved, 542 unsolved
Search for dead transitions found 0 dead transitions in 48660ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49136 ms. Remains : 157/157 places, 591/591 transitions.
RANDOM walk for 4000000 steps (48222 resets) in 11968 ms. (334 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000004 steps (6863 resets) in 3237 ms. (1235 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 3289057 steps, run timeout after 12001 ms. (steps per millisecond=274 ) properties seen :0 out of 1
Probabilistic random walk after 3289057 steps, saw 552512 distinct states, run finished after 12001 ms. (steps per millisecond=274 ) properties seen :0
[2024-05-21 06:43:57] [INFO ] Flow matrix only has 248 transitions (discarded 343 similar events)
[2024-05-21 06:43:57] [INFO ] Invariant cache hit.
[2024-05-21 06:43:57] [INFO ] State equation strengthened by 9 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 86/94 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 63/157 variables, 21/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 248/405 variables, 157/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/405 variables, 9/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/405 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/405 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 405/405 variables, and 194 constraints, problems are : Problem set: 0 solved, 1 unsolved in 120 ms.
Refiners :[Generalized P Invariants (flows): 28/28 constraints, State Equation: 157/157 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 86/94 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 63/157 variables, 21/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 248/405 variables, 157/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/405 variables, 9/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/405 variables, 1/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/405 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/405 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 405/405 variables, and 195 constraints, problems are : Problem set: 0 solved, 1 unsolved in 151 ms.
Refiners :[Generalized P Invariants (flows): 28/28 constraints, State Equation: 157/157 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 282ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 22 ms.
Support contains 8 out of 157 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 157/157 places, 591/591 transitions.
Applied a total of 0 rules in 11 ms. Remains 157 /157 variables (removed 0) and now considering 591/591 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 157/157 places, 591/591 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 157/157 places, 591/591 transitions.
Applied a total of 0 rules in 12 ms. Remains 157 /157 variables (removed 0) and now considering 591/591 (removed 0) transitions.
[2024-05-21 06:43:58] [INFO ] Flow matrix only has 248 transitions (discarded 343 similar events)
[2024-05-21 06:43:58] [INFO ] Invariant cache hit.
[2024-05-21 06:43:58] [INFO ] Implicit Places using invariants in 116 ms returned []
[2024-05-21 06:43:58] [INFO ] Flow matrix only has 248 transitions (discarded 343 similar events)
[2024-05-21 06:43:58] [INFO ] Invariant cache hit.
[2024-05-21 06:43:58] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-21 06:43:58] [INFO ] Implicit Places using invariants and state equation in 214 ms returned []
Implicit Place search using SMT with State Equation took 332 ms to find 0 implicit places.
[2024-05-21 06:43:58] [INFO ] Redundant transitions in 16 ms returned []
Running 542 sub problems to find dead transitions.
[2024-05-21 06:43:58] [INFO ] Flow matrix only has 248 transitions (discarded 343 similar events)
[2024-05-21 06:43:58] [INFO ] Invariant cache hit.
[2024-05-21 06:43:58] [INFO ] State equation strengthened by 9 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 542 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 542 unsolved
At refinement iteration 2 (OVERLAPS) 7/157 variables, 7/28 constraints. Problems are: Problem set: 0 solved, 542 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 542 unsolved
At refinement iteration 4 (OVERLAPS) 248/405 variables, 157/185 constraints. Problems are: Problem set: 0 solved, 542 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/405 variables, 9/194 constraints. Problems are: Problem set: 0 solved, 542 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/405 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 542 unsolved
At refinement iteration 7 (OVERLAPS) 0/405 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 542 unsolved
No progress, stopping.
After SMT solving in domain Real declared 405/405 variables, and 194 constraints, problems are : Problem set: 0 solved, 542 unsolved in 17303 ms.
Refiners :[Generalized P Invariants (flows): 28/28 constraints, State Equation: 157/157 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 542/542 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 542 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 542 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 542 unsolved
At refinement iteration 2 (OVERLAPS) 7/157 variables, 7/28 constraints. Problems are: Problem set: 0 solved, 542 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 542 unsolved
At refinement iteration 4 (OVERLAPS) 248/405 variables, 157/185 constraints. Problems are: Problem set: 0 solved, 542 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/405 variables, 9/194 constraints. Problems are: Problem set: 0 solved, 542 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/405 variables, 542/736 constraints. Problems are: Problem set: 0 solved, 542 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/405 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 542 unsolved
At refinement iteration 8 (OVERLAPS) 0/405 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 542 unsolved
No progress, stopping.
After SMT solving in domain Int declared 405/405 variables, and 736 constraints, problems are : Problem set: 0 solved, 542 unsolved in 30010 ms.
Refiners :[Generalized P Invariants (flows): 28/28 constraints, State Equation: 157/157 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 542/542 constraints, Known Traps: 0/0 constraints]
After SMT, in 48107ms problems are : Problem set: 0 solved, 542 unsolved
Search for dead transitions found 0 dead transitions in 48112ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48477 ms. Remains : 157/157 places, 591/591 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 111 edges and 157 vertex of which 49 / 157 are part of one of the 7 SCC in 0 ms
Free SCC test removed 42 places
Drop transitions (Empty/Sink Transition effects.) removed 56 transitions
Ensure Unique test removed 343 transitions
Reduce isomorphic transitions removed 399 transitions.
Ensure Unique test removed 13 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 42 rules applied. Total rules applied 43 place count 102 transition count 163
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 1 with 29 rules applied. Total rules applied 72 place count 73 transition count 163
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 72 place count 73 transition count 151
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 96 place count 61 transition count 151
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 102 place count 55 transition count 145
Iterating global reduction 2 with 6 rules applied. Total rules applied 108 place count 55 transition count 145
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 114 place count 49 transition count 103
Iterating global reduction 2 with 6 rules applied. Total rules applied 120 place count 49 transition count 103
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 126 place count 49 transition count 97
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 128 place count 48 transition count 96
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 3 with 14 rules applied. Total rules applied 142 place count 48 transition count 82
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 142 place count 48 transition count 75
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 156 place count 41 transition count 75
Applied a total of 156 rules in 17 ms. Remains 41 /157 variables (removed 116) and now considering 75/591 (removed 516) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 75 rows 41 cols
[2024-05-21 06:44:46] [INFO ] Computed 15 invariants in 1 ms
[2024-05-21 06:44:46] [INFO ] [Real]Absence check using 0 positive and 15 generalized place invariants in 2 ms returned sat
[2024-05-21 06:44:46] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 06:44:46] [INFO ] [Nat]Absence check using 0 positive and 15 generalized place invariants in 2 ms returned sat
[2024-05-21 06:44:46] [INFO ] After 17ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-21 06:44:46] [INFO ] After 23ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-21 06:44:46] [INFO ] After 46ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 122 ms.
Unable to solve all queries for examination QuasiLiveness. Remains :1 assertions to prove.
No /home/mcc/execution/QuasiLiveness.xml examination file found. Proceeding without properties.
Parsed 1 properties from file /home/mcc/execution/QuasiLiveness.xml in 1 ms.
Working with output stream class java.io.PrintStream
Total runtime 168358 ms.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running CloudDeployment-PT-7a

IS_COLORED=
IS_NUPN=1

LOADING model.pnml ...
MODEL CLASS: P/T NET WITH NUPN EXTENSION
PLACES: 264
TRANSITIONS: 1174
CONSTANTS: 0
TEMPLATE VARS: 0
ARCS: 7331
NUPN UNITS: 31
LOADING TIME: 0.554

SAVING AS /home/mcc/execution/model.(net/def) ...
exportGspn useExt=true
SAVING TIME: 0.048
SAVING NAME MAP FILE /home/mcc/execution/model.id2name ...
SAVING NUPN UNITS AS FILE /home/mcc/execution/model.nu ...
TOTAL TIME: 0.89
OK.
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 610
MODEL NAME: /home/mcc/execution/model
264 places, 1174 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA QuasiLiveness TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716273903477

--------------------
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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination QuasiLiveness -timeout 180 -rebuildPNML

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="CloudDeployment-PT-7a"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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-5568"
echo " Executing tool greatspnxred"
echo " Input is CloudDeployment-PT-7a, examination is QuasiLiveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r078-tall-171620515600387"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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