About the Execution of GreatSPN+red for CANInsertWithFailure-PT-050
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
10712.827 | 998467.00 | 2780500.00 | 1276.20 | ??????T????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.r069-tall-171620503900129.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 CANInsertWithFailure-PT-050, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r069-tall-171620503900129
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 9.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.8K May 19 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 15:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Apr 22 14:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 22 14:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 84K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K May 19 15:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 16M 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
here is the order used to build the result vector(from text file)
FORMULA_NAME CANInsertWithFailure-PT-050-CTLCardinality-2024-00
FORMULA_NAME CANInsertWithFailure-PT-050-CTLCardinality-2024-01
FORMULA_NAME CANInsertWithFailure-PT-050-CTLCardinality-2024-02
FORMULA_NAME CANInsertWithFailure-PT-050-CTLCardinality-2024-03
FORMULA_NAME CANInsertWithFailure-PT-050-CTLCardinality-2024-04
FORMULA_NAME CANInsertWithFailure-PT-050-CTLCardinality-2024-05
FORMULA_NAME CANInsertWithFailure-PT-050-CTLCardinality-2024-06
FORMULA_NAME CANInsertWithFailure-PT-050-CTLCardinality-2024-07
FORMULA_NAME CANInsertWithFailure-PT-050-CTLCardinality-2024-08
FORMULA_NAME CANInsertWithFailure-PT-050-CTLCardinality-2024-09
FORMULA_NAME CANInsertWithFailure-PT-050-CTLCardinality-2024-10
FORMULA_NAME CANInsertWithFailure-PT-050-CTLCardinality-2024-11
FORMULA_NAME CANInsertWithFailure-PT-050-CTLCardinality-2023-12
FORMULA_NAME CANInsertWithFailure-PT-050-CTLCardinality-2023-13
FORMULA_NAME CANInsertWithFailure-PT-050-CTLCardinality-2023-14
FORMULA_NAME CANInsertWithFailure-PT-050-CTLCardinality-2023-15
=== Now, execution of the tool begins
BK_START 1716397153248
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANInsertWithFailure-PT-050
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 16:59:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-22 16:59:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 16:59:14] [INFO ] Load time of PNML (sax parser for PT used): 439 ms
[2024-05-22 16:59:14] [INFO ] Transformed 5604 places.
[2024-05-22 16:59:14] [INFO ] Transformed 15300 transitions.
[2024-05-22 16:59:14] [INFO ] Parsed PT model containing 5604 places and 15300 transitions and 41000 arcs in 624 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 16 ms.
Support contains 163 out of 5604 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5604/5604 places, 15300/15300 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 5603 transition count 15300
Applied a total of 1 rules in 1108 ms. Remains 5603 /5604 variables (removed 1) and now considering 15300/15300 (removed 0) transitions.
// Phase 1: matrix 15300 rows 5603 cols
[2024-05-22 16:59:17] [INFO ] Computed 52 invariants in 1402 ms
[2024-05-22 16:59:22] [INFO ] Implicit Places using invariants in 6125 ms returned []
Implicit Place search using SMT only with invariants took 6164 ms to find 0 implicit places.
Running 15250 sub problems to find dead transitions.
[2024-05-22 16:59:22] [INFO ] Invariant cache hit.
[2024-05-22 16:59:22] [INFO ] State equation strengthened by 4950 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5602 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 15250 unsolved
SMT process timed out in 53336ms, After SMT, problems are : Problem set: 0 solved, 15250 unsolved
Search for dead transitions found 0 dead transitions in 53537ms
Starting structural reductions in LTL mode, iteration 1 : 5603/5604 places, 15300/15300 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60921 ms. Remains : 5603/5604 places, 15300/15300 transitions.
Support contains 163 out of 5603 places after structural reductions.
[2024-05-22 17:00:16] [INFO ] Flatten gal took : 535 ms
[2024-05-22 17:00:17] [INFO ] Flatten gal took : 375 ms
[2024-05-22 17:00:17] [INFO ] Input system was already deterministic with 15300 transitions.
Support contains 162 out of 5603 places (down from 163) after GAL structural reductions.
RANDOM walk for 40000 steps (31 resets) in 2262 ms. (17 steps per ms) remains 42/97 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 41/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 40/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 533 ms. (7 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 40/40 properties
[2024-05-22 17:00:19] [INFO ] Invariant cache hit.
[2024-05-22 17:00:19] [INFO ] State equation strengthened by 4950 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 40 unsolved
Problem AtomicPropp58 is UNSAT
At refinement iteration 1 (OVERLAPS) 5443/5509 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 39 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5509 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 39 unsolved
At refinement iteration 3 (OVERLAPS) 90/5599 variables, 45/50 constraints. Problems are: Problem set: 1 solved, 39 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 5599/20903 variables, and 50 constraints, problems are : Problem set: 1 solved, 39 unsolved in 5013 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, Generalized P Invariants (flows): 0/2 constraints, State Equation: 0/5603 constraints, ReadFeed: 0/4950 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 39 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 39 unsolved
At refinement iteration 1 (OVERLAPS) 5443/5507 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 39 unsolved
[2024-05-22 17:00:25] [INFO ] Deduced a trap composed of 5 places in 213 ms of which 19 ms to minimize.
[2024-05-22 17:00:25] [INFO ] Deduced a trap composed of 5 places in 189 ms of which 3 ms to minimize.
[2024-05-22 17:00:26] [INFO ] Deduced a trap composed of 5 places in 166 ms of which 2 ms to minimize.
[2024-05-22 17:00:26] [INFO ] Deduced a trap composed of 5 places in 157 ms of which 2 ms to minimize.
[2024-05-22 17:00:26] [INFO ] Deduced a trap composed of 5 places in 151 ms of which 2 ms to minimize.
[2024-05-22 17:00:26] [INFO ] Deduced a trap composed of 5 places in 155 ms of which 2 ms to minimize.
[2024-05-22 17:00:26] [INFO ] Deduced a trap composed of 5 places in 165 ms of which 2 ms to minimize.
[2024-05-22 17:00:27] [INFO ] Deduced a trap composed of 5 places in 171 ms of which 2 ms to minimize.
[2024-05-22 17:00:27] [INFO ] Deduced a trap composed of 5 places in 142 ms of which 2 ms to minimize.
[2024-05-22 17:00:27] [INFO ] Deduced a trap composed of 5 places in 165 ms of which 2 ms to minimize.
[2024-05-22 17:00:27] [INFO ] Deduced a trap composed of 5 places in 147 ms of which 1 ms to minimize.
[2024-05-22 17:00:28] [INFO ] Deduced a trap composed of 5 places in 141 ms of which 1 ms to minimize.
[2024-05-22 17:00:28] [INFO ] Deduced a trap composed of 5 places in 142 ms of which 2 ms to minimize.
[2024-05-22 17:00:28] [INFO ] Deduced a trap composed of 5 places in 145 ms of which 2 ms to minimize.
[2024-05-22 17:00:28] [INFO ] Deduced a trap composed of 5 places in 141 ms of which 2 ms to minimize.
[2024-05-22 17:00:28] [INFO ] Deduced a trap composed of 5 places in 152 ms of which 2 ms to minimize.
[2024-05-22 17:00:29] [INFO ] Deduced a trap composed of 5 places in 150 ms of which 2 ms to minimize.
[2024-05-22 17:00:29] [INFO ] Deduced a trap composed of 5 places in 146 ms of which 1 ms to minimize.
[2024-05-22 17:00:29] [INFO ] Deduced a trap composed of 5 places in 154 ms of which 2 ms to minimize.
SMT process timed out in 10253ms, After SMT, problems are : Problem set: 1 solved, 39 unsolved
Fused 39 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 64 out of 5603 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 344 transitions
Trivial Post-agglo rules discarded 344 transitions
Performed 344 trivial Post agglomeration. Transition count delta: 344
Iterating post reduction 0 with 344 rules applied. Total rules applied 344 place count 5603 transition count 14956
Reduce places removed 344 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 345 rules applied. Total rules applied 689 place count 5259 transition count 14955
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 690 place count 5258 transition count 14955
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 690 place count 5258 transition count 14953
Deduced a syphon composed of 2 places in 13 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 694 place count 5256 transition count 14953
Performed 2362 Post agglomeration using F-continuation condition.Transition count delta: 2362
Deduced a syphon composed of 2362 places in 11 ms
Reduce places removed 2362 places and 0 transitions.
Iterating global reduction 3 with 4724 rules applied. Total rules applied 5418 place count 2894 transition count 12591
Drop transitions (Redundant composition of simpler transitions.) removed 2269 transitions
Redundant transition composition rules discarded 2269 transitions
Iterating global reduction 3 with 2269 rules applied. Total rules applied 7687 place count 2894 transition count 10322
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 7688 place count 2894 transition count 10321
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 7689 place count 2893 transition count 10321
Partial Free-agglomeration rule applied 2628 times.
Drop transitions (Partial Free agglomeration) removed 2628 transitions
Iterating global reduction 4 with 2628 rules applied. Total rules applied 10317 place count 2893 transition count 10321
Partial Free-agglomeration rule applied 153 times.
Drop transitions (Partial Free agglomeration) removed 153 transitions
Iterating global reduction 4 with 153 rules applied. Total rules applied 10470 place count 2893 transition count 10321
Applied a total of 10470 rules in 3774 ms. Remains 2893 /5603 variables (removed 2710) and now considering 10321/15300 (removed 4979) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3776 ms. Remains : 2893/5603 places, 10321/15300 transitions.
RANDOM walk for 40000 steps (161 resets) in 1132 ms. (35 steps per ms) remains 20/39 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 20/20 properties
// Phase 1: matrix 10321 rows 2893 cols
[2024-05-22 17:00:34] [INFO ] Computed 52 invariants in 400 ms
[2024-05-22 17:00:34] [INFO ] State equation strengthened by 9829 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 2758/2793 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2793 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 96/2889 variables, 48/50 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2889 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 2/2891 variables, 2/52 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2891 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (OVERLAPS) 10321/13212 variables, 2891/2943 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/13212 variables, 9829/12772 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/13212 variables, 0/12772 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 10 (OVERLAPS) 2/13214 variables, 2/12774 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/13214 variables, 0/12774 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 12 (OVERLAPS) 0/13214 variables, 0/12774 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13214/13214 variables, and 12774 constraints, problems are : Problem set: 0 solved, 20 unsolved in 35775 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 2893/2893 constraints, ReadFeed: 9829/9829 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 2758/2793 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-05-22 17:01:10] [INFO ] Deduced a trap composed of 2 places in 77 ms of which 1 ms to minimize.
[2024-05-22 17:01:10] [INFO ] Deduced a trap composed of 2 places in 74 ms of which 0 ms to minimize.
[2024-05-22 17:01:10] [INFO ] Deduced a trap composed of 2 places in 70 ms of which 1 ms to minimize.
[2024-05-22 17:01:10] [INFO ] Deduced a trap composed of 2 places in 69 ms of which 1 ms to minimize.
[2024-05-22 17:01:11] [INFO ] Deduced a trap composed of 2 places in 81 ms of which 2 ms to minimize.
[2024-05-22 17:01:11] [INFO ] Deduced a trap composed of 2 places in 83 ms of which 1 ms to minimize.
[2024-05-22 17:01:11] [INFO ] Deduced a trap composed of 2 places in 63 ms of which 0 ms to minimize.
[2024-05-22 17:01:11] [INFO ] Deduced a trap composed of 2 places in 69 ms of which 1 ms to minimize.
[2024-05-22 17:01:11] [INFO ] Deduced a trap composed of 2 places in 68 ms of which 1 ms to minimize.
[2024-05-22 17:01:11] [INFO ] Deduced a trap composed of 2 places in 69 ms of which 1 ms to minimize.
[2024-05-22 17:01:11] [INFO ] Deduced a trap composed of 2 places in 68 ms of which 1 ms to minimize.
[2024-05-22 17:01:11] [INFO ] Deduced a trap composed of 2 places in 72 ms of which 1 ms to minimize.
[2024-05-22 17:01:11] [INFO ] Deduced a trap composed of 2 places in 69 ms of which 0 ms to minimize.
[2024-05-22 17:01:11] [INFO ] Deduced a trap composed of 2 places in 61 ms of which 1 ms to minimize.
[2024-05-22 17:01:12] [INFO ] Deduced a trap composed of 2 places in 74 ms of which 0 ms to minimize.
[2024-05-22 17:01:12] [INFO ] Deduced a trap composed of 2 places in 73 ms of which 1 ms to minimize.
[2024-05-22 17:01:12] [INFO ] Deduced a trap composed of 2 places in 67 ms of which 1 ms to minimize.
[2024-05-22 17:01:12] [INFO ] Deduced a trap composed of 2 places in 68 ms of which 0 ms to minimize.
[2024-05-22 17:01:12] [INFO ] Deduced a trap composed of 2 places in 71 ms of which 0 ms to minimize.
[2024-05-22 17:01:12] [INFO ] Deduced a trap composed of 2 places in 67 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/2793 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-05-22 17:01:12] [INFO ] Deduced a trap composed of 2 places in 69 ms of which 1 ms to minimize.
[2024-05-22 17:01:12] [INFO ] Deduced a trap composed of 2 places in 68 ms of which 1 ms to minimize.
[2024-05-22 17:01:12] [INFO ] Deduced a trap composed of 2 places in 69 ms of which 1 ms to minimize.
[2024-05-22 17:01:12] [INFO ] Deduced a trap composed of 2 places in 71 ms of which 1 ms to minimize.
[2024-05-22 17:01:13] [INFO ] Deduced a trap composed of 2 places in 68 ms of which 1 ms to minimize.
[2024-05-22 17:01:13] [INFO ] Deduced a trap composed of 2 places in 73 ms of which 1 ms to minimize.
[2024-05-22 17:01:13] [INFO ] Deduced a trap composed of 2 places in 71 ms of which 0 ms to minimize.
[2024-05-22 17:01:13] [INFO ] Deduced a trap composed of 2 places in 72 ms of which 1 ms to minimize.
[2024-05-22 17:01:13] [INFO ] Deduced a trap composed of 2 places in 71 ms of which 0 ms to minimize.
[2024-05-22 17:01:13] [INFO ] Deduced a trap composed of 2 places in 71 ms of which 1 ms to minimize.
[2024-05-22 17:01:13] [INFO ] Deduced a trap composed of 2 places in 64 ms of which 0 ms to minimize.
[2024-05-22 17:01:13] [INFO ] Deduced a trap composed of 2 places in 66 ms of which 1 ms to minimize.
[2024-05-22 17:01:13] [INFO ] Deduced a trap composed of 2 places in 65 ms of which 1 ms to minimize.
[2024-05-22 17:01:13] [INFO ] Deduced a trap composed of 2 places in 66 ms of which 1 ms to minimize.
[2024-05-22 17:01:14] [INFO ] Deduced a trap composed of 2 places in 66 ms of which 0 ms to minimize.
[2024-05-22 17:01:14] [INFO ] Deduced a trap composed of 2 places in 65 ms of which 1 ms to minimize.
[2024-05-22 17:01:14] [INFO ] Deduced a trap composed of 2 places in 69 ms of which 0 ms to minimize.
[2024-05-22 17:01:14] [INFO ] Deduced a trap composed of 2 places in 74 ms of which 4 ms to minimize.
[2024-05-22 17:01:14] [INFO ] Deduced a trap composed of 2 places in 65 ms of which 0 ms to minimize.
[2024-05-22 17:01:14] [INFO ] Deduced a trap composed of 2 places in 72 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/2793 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-05-22 17:01:14] [INFO ] Deduced a trap composed of 2 places in 65 ms of which 0 ms to minimize.
[2024-05-22 17:01:14] [INFO ] Deduced a trap composed of 2 places in 57 ms of which 1 ms to minimize.
[2024-05-22 17:01:14] [INFO ] Deduced a trap composed of 2 places in 59 ms of which 0 ms to minimize.
[2024-05-22 17:01:14] [INFO ] Deduced a trap composed of 2 places in 60 ms of which 1 ms to minimize.
[2024-05-22 17:01:15] [INFO ] Deduced a trap composed of 2 places in 65 ms of which 1 ms to minimize.
[2024-05-22 17:01:15] [INFO ] Deduced a trap composed of 2 places in 64 ms of which 1 ms to minimize.
[2024-05-22 17:01:15] [INFO ] Deduced a trap composed of 2 places in 63 ms of which 1 ms to minimize.
[2024-05-22 17:01:15] [INFO ] Deduced a trap composed of 2 places in 58 ms of which 0 ms to minimize.
[2024-05-22 17:01:15] [INFO ] Deduced a trap composed of 2 places in 59 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/2793 variables, 9/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2793 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 96/2889 variables, 48/99 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2889 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 2/2891 variables, 2/101 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-05-22 17:01:21] [INFO ] Deduced a trap composed of 55 places in 2890 ms of which 19 ms to minimize.
[2024-05-22 17:01:24] [INFO ] Deduced a trap composed of 56 places in 2774 ms of which 18 ms to minimize.
[2024-05-22 17:01:24] [INFO ] Deduced a trap composed of 55 places in 88 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/2891 variables, 3/104 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2891 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 11 (OVERLAPS) 10321/13212 variables, 2891/2995 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/13212 variables, 9829/12824 constraints. Problems are: Problem set: 0 solved, 20 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 13212/13214 variables, and 12844 constraints, problems are : Problem set: 0 solved, 20 unsolved in 45058 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 2891/2893 constraints, ReadFeed: 9829/9829 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 52/52 constraints]
After SMT, in 81395ms problems are : Problem set: 0 solved, 20 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 35 out of 2893 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2893/2893 places, 10321/10321 transitions.
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 2 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 0 with 44 rules applied. Total rules applied 44 place count 2871 transition count 10299
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 0 with 9 rules applied. Total rules applied 53 place count 2871 transition count 10299
Applied a total of 53 rules in 1083 ms. Remains 2871 /2893 variables (removed 22) and now considering 10299/10321 (removed 22) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1083 ms. Remains : 2871/2893 places, 10299/10321 transitions.
RANDOM walk for 40000 steps (163 resets) in 1282 ms. (31 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 20/20 properties
Interrupted probabilistic random walk after 65667 steps, run timeout after 3001 ms. (steps per millisecond=21 ) properties seen :0 out of 20
Probabilistic random walk after 65667 steps, saw 29589 distinct states, run finished after 3005 ms. (steps per millisecond=21 ) properties seen :0
// Phase 1: matrix 10299 rows 2871 cols
[2024-05-22 17:02:00] [INFO ] Computed 52 invariants in 435 ms
[2024-05-22 17:02:00] [INFO ] State equation strengthened by 9978 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 2736/2771 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2771 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 96/2867 variables, 48/50 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2867 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 2/2869 variables, 2/52 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2869 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (OVERLAPS) 10299/13168 variables, 2869/2921 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/13168 variables, 9978/12899 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/13168 variables, 0/12899 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 10 (OVERLAPS) 2/13170 variables, 2/12901 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/13170 variables, 0/12901 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 12 (OVERLAPS) 0/13170 variables, 0/12901 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13170/13170 variables, and 12901 constraints, problems are : Problem set: 0 solved, 20 unsolved in 36816 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 2871/2871 constraints, ReadFeed: 9978/9978 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 2736/2771 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-05-22 17:02:37] [INFO ] Deduced a trap composed of 2 places in 74 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/2771 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2771 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 96/2867 variables, 48/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2867 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 2/2869 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-05-22 17:02:43] [INFO ] Deduced a trap composed of 64 places in 2674 ms of which 16 ms to minimize.
[2024-05-22 17:02:46] [INFO ] Deduced a trap composed of 70 places in 2684 ms of which 16 ms to minimize.
[2024-05-22 17:02:48] [INFO ] Deduced a trap composed of 67 places in 2667 ms of which 17 ms to minimize.
[2024-05-22 17:02:51] [INFO ] Deduced a trap composed of 68 places in 2673 ms of which 17 ms to minimize.
[2024-05-22 17:02:54] [INFO ] Deduced a trap composed of 68 places in 2731 ms of which 17 ms to minimize.
[2024-05-22 17:02:57] [INFO ] Deduced a trap composed of 66 places in 2667 ms of which 17 ms to minimize.
[2024-05-22 17:02:59] [INFO ] Deduced a trap composed of 67 places in 2668 ms of which 16 ms to minimize.
[2024-05-22 17:03:02] [INFO ] Deduced a trap composed of 72 places in 2567 ms of which 16 ms to minimize.
[2024-05-22 17:03:05] [INFO ] Deduced a trap composed of 55 places in 2490 ms of which 16 ms to minimize.
[2024-05-22 17:03:07] [INFO ] Deduced a trap composed of 55 places in 2390 ms of which 16 ms to minimize.
[2024-05-22 17:03:09] [INFO ] Deduced a trap composed of 69 places in 2320 ms of which 16 ms to minimize.
[2024-05-22 17:03:12] [INFO ] Deduced a trap composed of 55 places in 2329 ms of which 15 ms to minimize.
[2024-05-22 17:03:14] [INFO ] Deduced a trap composed of 81 places in 2472 ms of which 15 ms to minimize.
[2024-05-22 17:03:17] [INFO ] Deduced a trap composed of 89 places in 2394 ms of which 15 ms to minimize.
[2024-05-22 17:03:19] [INFO ] Deduced a trap composed of 55 places in 2223 ms of which 15 ms to minimize.
[2024-05-22 17:03:21] [INFO ] Deduced a trap composed of 83 places in 2048 ms of which 15 ms to minimize.
[2024-05-22 17:03:23] [INFO ] Deduced a trap composed of 55 places in 1981 ms of which 13 ms to minimize.
[2024-05-22 17:03:25] [INFO ] Deduced a trap composed of 74 places in 1965 ms of which 12 ms to minimize.
[2024-05-22 17:03:27] [INFO ] Deduced a trap composed of 82 places in 2015 ms of which 13 ms to minimize.
[2024-05-22 17:03:29] [INFO ] Deduced a trap composed of 55 places in 1943 ms of which 13 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/2869 variables, 20/73 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-05-22 17:03:31] [INFO ] Deduced a trap composed of 73 places in 1813 ms of which 12 ms to minimize.
[2024-05-22 17:03:33] [INFO ] Deduced a trap composed of 71 places in 1996 ms of which 14 ms to minimize.
[2024-05-22 17:03:35] [INFO ] Deduced a trap composed of 71 places in 1970 ms of which 14 ms to minimize.
[2024-05-22 17:03:37] [INFO ] Deduced a trap composed of 78 places in 2088 ms of which 15 ms to minimize.
[2024-05-22 17:03:39] [INFO ] Deduced a trap composed of 55 places in 1849 ms of which 13 ms to minimize.
[2024-05-22 17:03:41] [INFO ] Deduced a trap composed of 70 places in 1899 ms of which 13 ms to minimize.
[2024-05-22 17:03:43] [INFO ] Deduced a trap composed of 55 places in 1731 ms of which 14 ms to minimize.
[2024-05-22 17:03:45] [INFO ] Deduced a trap composed of 70 places in 1863 ms of which 13 ms to minimize.
[2024-05-22 17:03:46] [INFO ] Deduced a trap composed of 55 places in 1691 ms of which 13 ms to minimize.
[2024-05-22 17:03:48] [INFO ] Deduced a trap composed of 64 places in 1767 ms of which 13 ms to minimize.
[2024-05-22 17:03:50] [INFO ] Deduced a trap composed of 68 places in 1864 ms of which 13 ms to minimize.
[2024-05-22 17:03:52] [INFO ] Deduced a trap composed of 88 places in 1777 ms of which 13 ms to minimize.
SMT process timed out in 112529ms, After SMT, problems are : Problem set: 0 solved, 20 unsolved
Fused 20 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 35 out of 2871 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2871/2871 places, 10299/10299 transitions.
Applied a total of 0 rules in 415 ms. Remains 2871 /2871 variables (removed 0) and now considering 10299/10299 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 415 ms. Remains : 2871/2871 places, 10299/10299 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2871/2871 places, 10299/10299 transitions.
Applied a total of 0 rules in 390 ms. Remains 2871 /2871 variables (removed 0) and now considering 10299/10299 (removed 0) transitions.
[2024-05-22 17:03:53] [INFO ] Invariant cache hit.
[2024-05-22 17:03:56] [INFO ] Implicit Places using invariants in 3698 ms returned []
Implicit Place search using SMT only with invariants took 3701 ms to find 0 implicit places.
Running 10249 sub problems to find dead transitions.
[2024-05-22 17:03:56] [INFO ] Invariant cache hit.
[2024-05-22 17:03:57] [INFO ] State equation strengthened by 9978 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2870 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 10249 unsolved
SMT process timed out in 44859ms, After SMT, problems are : Problem set: 0 solved, 10249 unsolved
Search for dead transitions found 0 dead transitions in 44952ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49068 ms. Remains : 2871/2871 places, 10299/10299 transitions.
Successfully simplified 1 atomic propositions for a total of 16 simplifications.
FORMULA CANInsertWithFailure-PT-050-CTLCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-22 17:04:42] [INFO ] Flatten gal took : 306 ms
[2024-05-22 17:04:42] [INFO ] Flatten gal took : 335 ms
[2024-05-22 17:04:43] [INFO ] Input system was already deterministic with 15300 transitions.
Computed a total of 202 stabilizing places and 350 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Applied a total of 0 rules in 486 ms. Remains 5603 /5603 variables (removed 0) and now considering 15300/15300 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 486 ms. Remains : 5603/5603 places, 15300/15300 transitions.
[2024-05-22 17:04:44] [INFO ] Flatten gal took : 292 ms
[2024-05-22 17:04:44] [INFO ] Flatten gal took : 320 ms
[2024-05-22 17:04:45] [INFO ] Input system was already deterministic with 15300 transitions.
Starting structural reductions in LTL mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Applied a total of 0 rules in 478 ms. Remains 5603 /5603 variables (removed 0) and now considering 15300/15300 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 480 ms. Remains : 5603/5603 places, 15300/15300 transitions.
[2024-05-22 17:04:46] [INFO ] Flatten gal took : 271 ms
[2024-05-22 17:04:46] [INFO ] Flatten gal took : 309 ms
[2024-05-22 17:04:47] [INFO ] Input system was already deterministic with 15300 transitions.
Starting structural reductions in LTL mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Applied a total of 0 rules in 473 ms. Remains 5603 /5603 variables (removed 0) and now considering 15300/15300 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 475 ms. Remains : 5603/5603 places, 15300/15300 transitions.
[2024-05-22 17:04:47] [INFO ] Flatten gal took : 271 ms
[2024-05-22 17:04:48] [INFO ] Flatten gal took : 311 ms
[2024-05-22 17:04:48] [INFO ] Input system was already deterministic with 15300 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 346 transitions
Trivial Post-agglo rules discarded 346 transitions
Performed 346 trivial Post agglomeration. Transition count delta: 346
Iterating post reduction 0 with 346 rules applied. Total rules applied 346 place count 5603 transition count 14954
Reduce places removed 346 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 348 rules applied. Total rules applied 694 place count 5257 transition count 14952
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 696 place count 5255 transition count 14952
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 696 place count 5255 transition count 14951
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 698 place count 5254 transition count 14951
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 3 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 3 with 98 rules applied. Total rules applied 796 place count 5205 transition count 14902
Applied a total of 796 rules in 1316 ms. Remains 5205 /5603 variables (removed 398) and now considering 14902/15300 (removed 398) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1316 ms. Remains : 5205/5603 places, 14902/15300 transitions.
[2024-05-22 17:04:50] [INFO ] Flatten gal took : 266 ms
[2024-05-22 17:04:50] [INFO ] Flatten gal took : 303 ms
[2024-05-22 17:04:51] [INFO ] Input system was already deterministic with 14902 transitions.
Starting structural reductions in LTL mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Applied a total of 0 rules in 472 ms. Remains 5603 /5603 variables (removed 0) and now considering 15300/15300 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 474 ms. Remains : 5603/5603 places, 15300/15300 transitions.
[2024-05-22 17:04:52] [INFO ] Flatten gal took : 269 ms
[2024-05-22 17:04:52] [INFO ] Flatten gal took : 307 ms
[2024-05-22 17:04:53] [INFO ] Input system was already deterministic with 15300 transitions.
Starting structural reductions in LTL mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Applied a total of 0 rules in 467 ms. Remains 5603 /5603 variables (removed 0) and now considering 15300/15300 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 469 ms. Remains : 5603/5603 places, 15300/15300 transitions.
[2024-05-22 17:04:54] [INFO ] Flatten gal took : 232 ms
[2024-05-22 17:04:54] [INFO ] Flatten gal took : 257 ms
[2024-05-22 17:04:54] [INFO ] Input system was already deterministic with 15300 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 350 transitions
Trivial Post-agglo rules discarded 350 transitions
Performed 350 trivial Post agglomeration. Transition count delta: 350
Iterating post reduction 0 with 350 rules applied. Total rules applied 350 place count 5603 transition count 14950
Reduce places removed 350 places and 0 transitions.
Iterating post reduction 1 with 350 rules applied. Total rules applied 700 place count 5253 transition count 14950
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 3 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 800 place count 5203 transition count 14900
Applied a total of 800 rules in 1125 ms. Remains 5203 /5603 variables (removed 400) and now considering 14900/15300 (removed 400) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1125 ms. Remains : 5203/5603 places, 14900/15300 transitions.
[2024-05-22 17:04:56] [INFO ] Flatten gal took : 236 ms
[2024-05-22 17:04:56] [INFO ] Flatten gal took : 252 ms
[2024-05-22 17:04:57] [INFO ] Input system was already deterministic with 14900 transitions.
RANDOM walk for 31546 steps (57 resets) in 821 ms. (38 steps per ms) remains 0/1 properties
FORMULA CANInsertWithFailure-PT-050-CTLCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 348 transitions
Trivial Post-agglo rules discarded 348 transitions
Performed 348 trivial Post agglomeration. Transition count delta: 348
Iterating post reduction 0 with 348 rules applied. Total rules applied 348 place count 5603 transition count 14952
Reduce places removed 348 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 349 rules applied. Total rules applied 697 place count 5255 transition count 14951
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 698 place count 5254 transition count 14951
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 3 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 3 with 98 rules applied. Total rules applied 796 place count 5205 transition count 14902
Applied a total of 796 rules in 1165 ms. Remains 5205 /5603 variables (removed 398) and now considering 14902/15300 (removed 398) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1165 ms. Remains : 5205/5603 places, 14902/15300 transitions.
[2024-05-22 17:04:58] [INFO ] Flatten gal took : 227 ms
[2024-05-22 17:04:59] [INFO ] Flatten gal took : 252 ms
[2024-05-22 17:04:59] [INFO ] Input system was already deterministic with 14902 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 346 transitions
Trivial Post-agglo rules discarded 346 transitions
Performed 346 trivial Post agglomeration. Transition count delta: 346
Iterating post reduction 0 with 346 rules applied. Total rules applied 346 place count 5603 transition count 14954
Reduce places removed 346 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 348 rules applied. Total rules applied 694 place count 5257 transition count 14952
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 696 place count 5255 transition count 14952
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 3 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 3 with 100 rules applied. Total rules applied 796 place count 5205 transition count 14902
Partial Post-agglomeration rule applied 194 times.
Drop transitions (Partial Post agglomeration) removed 194 transitions
Iterating global reduction 3 with 194 rules applied. Total rules applied 990 place count 5205 transition count 14902
Discarding 96 places :
Symmetric choice reduction at 3 with 96 rule applications. Total rules 1086 place count 5109 transition count 14806
Iterating global reduction 3 with 96 rules applied. Total rules applied 1182 place count 5109 transition count 14806
Drop transitions (Redundant composition of simpler transitions.) removed 48 transitions
Redundant transition composition rules discarded 48 transitions
Iterating global reduction 3 with 48 rules applied. Total rules applied 1230 place count 5109 transition count 14758
Applied a total of 1230 rules in 3290 ms. Remains 5109 /5603 variables (removed 494) and now considering 14758/15300 (removed 542) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3290 ms. Remains : 5109/5603 places, 14758/15300 transitions.
[2024-05-22 17:05:03] [INFO ] Flatten gal took : 224 ms
[2024-05-22 17:05:03] [INFO ] Flatten gal took : 247 ms
[2024-05-22 17:05:03] [INFO ] Input system was already deterministic with 14758 transitions.
Starting structural reductions in LTL mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Applied a total of 0 rules in 466 ms. Remains 5603 /5603 variables (removed 0) and now considering 15300/15300 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 466 ms. Remains : 5603/5603 places, 15300/15300 transitions.
[2024-05-22 17:05:04] [INFO ] Flatten gal took : 235 ms
[2024-05-22 17:05:04] [INFO ] Flatten gal took : 261 ms
[2024-05-22 17:05:05] [INFO ] Input system was already deterministic with 15300 transitions.
Starting structural reductions in LTL mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Applied a total of 0 rules in 581 ms. Remains 5603 /5603 variables (removed 0) and now considering 15300/15300 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 581 ms. Remains : 5603/5603 places, 15300/15300 transitions.
[2024-05-22 17:05:06] [INFO ] Flatten gal took : 238 ms
[2024-05-22 17:05:06] [INFO ] Flatten gal took : 264 ms
[2024-05-22 17:05:07] [INFO ] Input system was already deterministic with 15300 transitions.
Starting structural reductions in LTL mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Applied a total of 0 rules in 477 ms. Remains 5603 /5603 variables (removed 0) and now considering 15300/15300 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 477 ms. Remains : 5603/5603 places, 15300/15300 transitions.
[2024-05-22 17:05:07] [INFO ] Flatten gal took : 238 ms
[2024-05-22 17:05:08] [INFO ] Flatten gal took : 261 ms
[2024-05-22 17:05:08] [INFO ] Input system was already deterministic with 15300 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 350 transitions
Trivial Post-agglo rules discarded 350 transitions
Performed 350 trivial Post agglomeration. Transition count delta: 350
Iterating post reduction 0 with 350 rules applied. Total rules applied 350 place count 5603 transition count 14950
Reduce places removed 350 places and 0 transitions.
Iterating post reduction 1 with 350 rules applied. Total rules applied 700 place count 5253 transition count 14950
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 3 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 800 place count 5203 transition count 14900
Applied a total of 800 rules in 1100 ms. Remains 5203 /5603 variables (removed 400) and now considering 14900/15300 (removed 400) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1101 ms. Remains : 5203/5603 places, 14900/15300 transitions.
[2024-05-22 17:05:10] [INFO ] Flatten gal took : 231 ms
[2024-05-22 17:05:10] [INFO ] Flatten gal took : 254 ms
[2024-05-22 17:05:10] [INFO ] Input system was already deterministic with 14900 transitions.
Starting structural reductions in LTL mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Applied a total of 0 rules in 479 ms. Remains 5603 /5603 variables (removed 0) and now considering 15300/15300 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 479 ms. Remains : 5603/5603 places, 15300/15300 transitions.
[2024-05-22 17:05:11] [INFO ] Flatten gal took : 232 ms
[2024-05-22 17:05:11] [INFO ] Flatten gal took : 264 ms
[2024-05-22 17:05:12] [INFO ] Input system was already deterministic with 15300 transitions.
Starting structural reductions in LTL mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Applied a total of 0 rules in 466 ms. Remains 5603 /5603 variables (removed 0) and now considering 15300/15300 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 467 ms. Remains : 5603/5603 places, 15300/15300 transitions.
[2024-05-22 17:05:13] [INFO ] Flatten gal took : 234 ms
[2024-05-22 17:05:13] [INFO ] Flatten gal took : 261 ms
[2024-05-22 17:05:13] [INFO ] Input system was already deterministic with 15300 transitions.
[2024-05-22 17:05:14] [INFO ] Flatten gal took : 252 ms
[2024-05-22 17:05:14] [INFO ] Flatten gal took : 258 ms
[2024-05-22 17:05:14] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2024-05-22 17:05:14] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 5603 places, 15300 transitions and 40900 arcs took 53 ms.
Total runtime 360262 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running CANInsertWithFailure-PT-050
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/405/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 5603
TRANSITIONS: 15300
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.227s, Sys 0.015s]
SAVING FILE /home/mcc/execution/405/model (.net / .def) ...
EXPORT TIME: [User 0.034s, Sys 0.011s]
----------------------------------------------------------------------
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: 902
MODEL NAME: /home/mcc/execution/405/model
5603 places, 15300 transitions.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
CANNOT_COMPUTE
EXITCODE: 87
----------------------------------------------------------------------
BK_STOP 1716398151715
--------------------
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 CTLCardinality -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory
MEDDLY ERROR: Insufficient memory
MEDDLY ERROR: Insufficient memory
MEDDLY ERROR: Insufficient memory
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="CANInsertWithFailure-PT-050"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="greatspnxred"
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-5568"
echo " Executing tool greatspnxred"
echo " Input is CANInsertWithFailure-PT-050, 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 r069-tall-171620503900129"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CANInsertWithFailure-PT-050.tgz
mv CANInsertWithFailure-PT-050 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 ;