About the Execution of LTSMin+red for ShieldPPPt-PT-030B
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 765.123 | 130736.00 | 184596.00 | 301.20 | T???T?FF?T?TFF?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.r528-tall-171683761600654.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 ltsminxred
Input is ShieldPPPt-PT-030B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r528-tall-171683761600654
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.0M
-rw-r--r-- 1 mcc users 7.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 11 14:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 134K Apr 11 14:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Apr 11 14:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 45K Apr 11 14:41 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 569K May 18 16:43 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 ShieldPPPt-PT-030B-ReachabilityCardinality-2024-00
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityCardinality-2024-01
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityCardinality-2024-02
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityCardinality-2024-03
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityCardinality-2024-04
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityCardinality-2024-05
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityCardinality-2024-06
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityCardinality-2024-07
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityCardinality-2024-08
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityCardinality-2024-09
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityCardinality-2024-10
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityCardinality-2024-11
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityCardinality-2024-12
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityCardinality-2024-13
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityCardinality-2024-14
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityCardinality-2024-15
=== Now, execution of the tool begins
BK_START 1717258343128
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPt-PT-030B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 16:12:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 16:12:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 16:12:24] [INFO ] Load time of PNML (sax parser for PT used): 173 ms
[2024-06-01 16:12:24] [INFO ] Transformed 2343 places.
[2024-06-01 16:12:24] [INFO ] Transformed 2133 transitions.
[2024-06-01 16:12:24] [INFO ] Found NUPN structural information;
[2024-06-01 16:12:24] [INFO ] Parsed PT model containing 2343 places and 2133 transitions and 5346 arcs in 355 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 20 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldPPPt-PT-030B-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-030B-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-030B-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 2540 ms. (15 steps per ms) remains 8/13 properties
FORMULA ShieldPPPt-PT-030B-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-030B-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-030B-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-030B-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-030B-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 366 ms. (109 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 119 ms. (333 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 136 ms. (292 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 115 ms. (344 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 152 ms. (261 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 126 ms. (314 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 92 ms. (430 steps per ms) remains 8/8 properties
// Phase 1: matrix 2133 rows 2343 cols
[2024-06-01 16:12:26] [INFO ] Computed 331 invariants in 37 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 129/129 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/129 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem ShieldPPPt-PT-030B-ReachabilityCardinality-2024-06 is UNSAT
FORMULA ShieldPPPt-PT-030B-ReachabilityCardinality-2024-06 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 2214/2343 variables, 331/460 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2343 variables, 2214/2674 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2343 variables, 0/2674 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 2133/4476 variables, 2343/5017 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4476 variables, 0/5017 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 0/4476 variables, 0/5017 constraints. Problems are: Problem set: 1 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4476/4476 variables, and 5017 constraints, problems are : Problem set: 1 solved, 7 unsolved in 2693 ms.
Refiners :[Domain max(s): 2343/2343 constraints, Positive P Invariants (semi-flows): 331/331 constraints, State Equation: 2343/2343 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 94/94 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 0/94 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 2249/2343 variables, 331/425 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2343 variables, 2249/2674 constraints. Problems are: Problem set: 1 solved, 7 unsolved
[2024-06-01 16:12:30] [INFO ] Deduced a trap composed of 32 places in 569 ms of which 71 ms to minimize.
[2024-06-01 16:12:30] [INFO ] Deduced a trap composed of 30 places in 525 ms of which 10 ms to minimize.
[2024-06-01 16:12:31] [INFO ] Deduced a trap composed of 18 places in 474 ms of which 23 ms to minimize.
[2024-06-01 16:12:31] [INFO ] Deduced a trap composed of 20 places in 471 ms of which 9 ms to minimize.
[2024-06-01 16:12:32] [INFO ] Deduced a trap composed of 23 places in 475 ms of which 9 ms to minimize.
[2024-06-01 16:12:32] [INFO ] Deduced a trap composed of 29 places in 455 ms of which 9 ms to minimize.
[2024-06-01 16:12:33] [INFO ] Deduced a trap composed of 20 places in 428 ms of which 9 ms to minimize.
[2024-06-01 16:12:33] [INFO ] Deduced a trap composed of 20 places in 441 ms of which 8 ms to minimize.
[2024-06-01 16:12:34] [INFO ] Deduced a trap composed of 24 places in 453 ms of which 11 ms to minimize.
SMT process timed out in 8320ms, After SMT, problems are : Problem set: 1 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 94 out of 2343 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2343/2343 places, 2133/2133 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 506 transitions
Trivial Post-agglo rules discarded 506 transitions
Performed 506 trivial Post agglomeration. Transition count delta: 506
Iterating post reduction 0 with 506 rules applied. Total rules applied 506 place count 2343 transition count 1627
Reduce places removed 506 places and 0 transitions.
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Iterating post reduction 1 with 536 rules applied. Total rules applied 1042 place count 1837 transition count 1597
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 2 with 30 rules applied. Total rules applied 1072 place count 1807 transition count 1597
Performed 122 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 122 Pre rules applied. Total rules applied 1072 place count 1807 transition count 1475
Deduced a syphon composed of 122 places in 4 ms
Reduce places removed 122 places and 0 transitions.
Iterating global reduction 3 with 244 rules applied. Total rules applied 1316 place count 1685 transition count 1475
Discarding 198 places :
Symmetric choice reduction at 3 with 198 rule applications. Total rules 1514 place count 1487 transition count 1277
Iterating global reduction 3 with 198 rules applied. Total rules applied 1712 place count 1487 transition count 1277
Performed 78 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 78 Pre rules applied. Total rules applied 1712 place count 1487 transition count 1199
Deduced a syphon composed of 78 places in 6 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 3 with 156 rules applied. Total rules applied 1868 place count 1409 transition count 1199
Performed 462 Post agglomeration using F-continuation condition.Transition count delta: 462
Deduced a syphon composed of 462 places in 3 ms
Reduce places removed 462 places and 0 transitions.
Iterating global reduction 3 with 924 rules applied. Total rules applied 2792 place count 947 transition count 737
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 74 places in 1 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 3 with 148 rules applied. Total rules applied 2940 place count 873 transition count 737
Free-agglomeration rule applied 5 times.
Iterating global reduction 3 with 5 rules applied. Total rules applied 2945 place count 873 transition count 732
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 2950 place count 868 transition count 732
Partial Free-agglomeration rule applied 71 times.
Drop transitions (Partial Free agglomeration) removed 71 transitions
Iterating global reduction 4 with 71 rules applied. Total rules applied 3021 place count 868 transition count 732
Applied a total of 3021 rules in 966 ms. Remains 868 /2343 variables (removed 1475) and now considering 732/2133 (removed 1401) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 975 ms. Remains : 868/2343 places, 732/2133 transitions.
RANDOM walk for 40000 steps (8 resets) in 806 ms. (49 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 328 ms. (121 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 222 ms. (179 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 169 ms. (235 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 159 ms. (250 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 196 ms. (203 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 167 ms. (238 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 155 ms. (256 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 146228 steps, run timeout after 3001 ms. (steps per millisecond=48 ) properties seen :0 out of 7
Probabilistic random walk after 146228 steps, saw 116648 distinct states, run finished after 3016 ms. (steps per millisecond=48 ) properties seen :0
// Phase 1: matrix 732 rows 868 cols
[2024-06-01 16:12:39] [INFO ] Computed 331 invariants in 7 ms
[2024-06-01 16:12:39] [INFO ] State equation strengthened by 167 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 774/868 variables, 331/331 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/868 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 732/1600 variables, 868/1199 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1600 variables, 167/1366 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1600 variables, 0/1366 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 0/1600 variables, 0/1366 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1600/1600 variables, and 1366 constraints, problems are : Problem set: 0 solved, 7 unsolved in 1109 ms.
Refiners :[Positive P Invariants (semi-flows): 331/331 constraints, State Equation: 868/868 constraints, ReadFeed: 167/167 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 774/868 variables, 331/331 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 16:12:40] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 1 ms to minimize.
[2024-06-01 16:12:40] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 1 ms to minimize.
[2024-06-01 16:12:40] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 1 ms to minimize.
[2024-06-01 16:12:40] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 2 ms to minimize.
[2024-06-01 16:12:40] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 2 ms to minimize.
[2024-06-01 16:12:40] [INFO ] Deduced a trap composed of 7 places in 57 ms of which 1 ms to minimize.
[2024-06-01 16:12:40] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 1 ms to minimize.
[2024-06-01 16:12:40] [INFO ] Deduced a trap composed of 5 places in 53 ms of which 2 ms to minimize.
[2024-06-01 16:12:41] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 1 ms to minimize.
[2024-06-01 16:12:41] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 1 ms to minimize.
[2024-06-01 16:12:41] [INFO ] Deduced a trap composed of 5 places in 55 ms of which 1 ms to minimize.
[2024-06-01 16:12:41] [INFO ] Deduced a trap composed of 6 places in 45 ms of which 1 ms to minimize.
[2024-06-01 16:12:41] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 2 ms to minimize.
[2024-06-01 16:12:41] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 4 ms to minimize.
[2024-06-01 16:12:41] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 1 ms to minimize.
[2024-06-01 16:12:41] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 1 ms to minimize.
[2024-06-01 16:12:41] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 2 ms to minimize.
[2024-06-01 16:12:41] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 1 ms to minimize.
[2024-06-01 16:12:41] [INFO ] Deduced a trap composed of 5 places in 51 ms of which 2 ms to minimize.
[2024-06-01 16:12:41] [INFO ] Deduced a trap composed of 5 places in 48 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/868 variables, 20/351 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 16:12:41] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/868 variables, 1/352 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/868 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 732/1600 variables, 868/1220 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1600 variables, 167/1387 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1600 variables, 7/1394 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 16:12:43] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 2 ms to minimize.
[2024-06-01 16:12:43] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 2 ms to minimize.
[2024-06-01 16:12:43] [INFO ] Deduced a trap composed of 7 places in 75 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1600 variables, 3/1397 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 16:12:44] [INFO ] Deduced a trap composed of 11 places in 77 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1600 variables, 1/1398 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1600 variables, 0/1398 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 0/1600 variables, 0/1398 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1600/1600 variables, and 1398 constraints, problems are : Problem set: 0 solved, 7 unsolved in 5916 ms.
Refiners :[Positive P Invariants (semi-flows): 331/331 constraints, State Equation: 868/868 constraints, ReadFeed: 167/167 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 25/25 constraints]
After SMT, in 7074ms problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 3279 ms.
Support contains 94 out of 868 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 868/868 places, 732/732 transitions.
Applied a total of 0 rules in 122 ms. Remains 868 /868 variables (removed 0) and now considering 732/732 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 122 ms. Remains : 868/868 places, 732/732 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 868/868 places, 732/732 transitions.
Applied a total of 0 rules in 115 ms. Remains 868 /868 variables (removed 0) and now considering 732/732 (removed 0) transitions.
[2024-06-01 16:12:49] [INFO ] Invariant cache hit.
[2024-06-01 16:12:50] [INFO ] Implicit Places using invariants in 396 ms returned []
[2024-06-01 16:12:50] [INFO ] Invariant cache hit.
[2024-06-01 16:12:50] [INFO ] State equation strengthened by 167 read => feed constraints.
[2024-06-01 16:12:52] [INFO ] Implicit Places using invariants and state equation in 2105 ms returned []
Implicit Place search using SMT with State Equation took 2515 ms to find 0 implicit places.
[2024-06-01 16:12:52] [INFO ] Redundant transitions in 36 ms returned []
Running 731 sub problems to find dead transitions.
[2024-06-01 16:12:52] [INFO ] Invariant cache hit.
[2024-06-01 16:12:52] [INFO ] State equation strengthened by 167 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/867 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 731 unsolved
At refinement iteration 1 (OVERLAPS) 1/868 variables, 331/331 constraints. Problems are: Problem set: 0 solved, 731 unsolved
[2024-06-01 16:13:09] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-06-01 16:13:09] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 1 ms to minimize.
[2024-06-01 16:13:09] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
[2024-06-01 16:13:09] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 1 ms to minimize.
[2024-06-01 16:13:09] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 1 ms to minimize.
[2024-06-01 16:13:09] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 2 ms to minimize.
[2024-06-01 16:13:09] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-06-01 16:13:09] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
[2024-06-01 16:13:09] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 9 ms to minimize.
[2024-06-01 16:13:09] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 1 ms to minimize.
[2024-06-01 16:13:09] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
[2024-06-01 16:13:09] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 1 ms to minimize.
[2024-06-01 16:13:09] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 1 ms to minimize.
[2024-06-01 16:13:09] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 1 ms to minimize.
[2024-06-01 16:13:10] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 0 ms to minimize.
[2024-06-01 16:13:10] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
[2024-06-01 16:13:10] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 2 ms to minimize.
[2024-06-01 16:13:10] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 1 ms to minimize.
[2024-06-01 16:13:10] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
[2024-06-01 16:13:10] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/868 variables, 20/351 constraints. Problems are: Problem set: 0 solved, 731 unsolved
[2024-06-01 16:13:12] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2024-06-01 16:13:12] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 9 ms to minimize.
[2024-06-01 16:13:12] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 1 ms to minimize.
[2024-06-01 16:13:12] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 1 ms to minimize.
[2024-06-01 16:13:12] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 0 ms to minimize.
[2024-06-01 16:13:12] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 0 ms to minimize.
[2024-06-01 16:13:13] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
[2024-06-01 16:13:13] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 2 ms to minimize.
[2024-06-01 16:13:13] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 1 ms to minimize.
[2024-06-01 16:13:15] [INFO ] Deduced a trap composed of 8 places in 103 ms of which 3 ms to minimize.
[2024-06-01 16:13:15] [INFO ] Deduced a trap composed of 10 places in 102 ms of which 3 ms to minimize.
[2024-06-01 16:13:15] [INFO ] Deduced a trap composed of 10 places in 98 ms of which 2 ms to minimize.
[2024-06-01 16:13:15] [INFO ] Deduced a trap composed of 11 places in 100 ms of which 2 ms to minimize.
[2024-06-01 16:13:15] [INFO ] Deduced a trap composed of 10 places in 102 ms of which 2 ms to minimize.
[2024-06-01 16:13:16] [INFO ] Deduced a trap composed of 10 places in 106 ms of which 2 ms to minimize.
[2024-06-01 16:13:16] [INFO ] Deduced a trap composed of 11 places in 104 ms of which 2 ms to minimize.
[2024-06-01 16:13:16] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 2 ms to minimize.
[2024-06-01 16:13:16] [INFO ] Deduced a trap composed of 7 places in 92 ms of which 2 ms to minimize.
[2024-06-01 16:13:16] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 2 ms to minimize.
[2024-06-01 16:13:16] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/868 variables, 20/371 constraints. Problems are: Problem set: 0 solved, 731 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 868/1600 variables, and 371 constraints, problems are : Problem set: 0 solved, 731 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 331/331 constraints, State Equation: 0/868 constraints, ReadFeed: 0/167 constraints, PredecessorRefiner: 731/731 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 731 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/867 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 731 unsolved
At refinement iteration 1 (OVERLAPS) 1/868 variables, 331/331 constraints. Problems are: Problem set: 0 solved, 731 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/868 variables, 40/371 constraints. Problems are: Problem set: 0 solved, 731 unsolved
[2024-06-01 16:13:33] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 1 ms to minimize.
[2024-06-01 16:13:33] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 0 ms to minimize.
[2024-06-01 16:13:33] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 1 ms to minimize.
[2024-06-01 16:13:33] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
[2024-06-01 16:13:33] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 0 ms to minimize.
[2024-06-01 16:13:33] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 1 ms to minimize.
[2024-06-01 16:13:34] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 0 ms to minimize.
[2024-06-01 16:13:34] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 1 ms to minimize.
[2024-06-01 16:13:34] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2024-06-01 16:13:34] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 1 ms to minimize.
[2024-06-01 16:13:34] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 1 ms to minimize.
[2024-06-01 16:13:34] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 0 ms to minimize.
[2024-06-01 16:13:35] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 0 ms to minimize.
[2024-06-01 16:13:35] [INFO ] Deduced a trap composed of 8 places in 57 ms of which 1 ms to minimize.
[2024-06-01 16:13:35] [INFO ] Deduced a trap composed of 7 places in 56 ms of which 1 ms to minimize.
[2024-06-01 16:13:35] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 1 ms to minimize.
[2024-06-01 16:13:35] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 1 ms to minimize.
[2024-06-01 16:13:35] [INFO ] Deduced a trap composed of 8 places in 57 ms of which 1 ms to minimize.
[2024-06-01 16:13:35] [INFO ] Deduced a trap composed of 8 places in 64 ms of which 2 ms to minimize.
[2024-06-01 16:13:35] [INFO ] Deduced a trap composed of 8 places in 61 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/868 variables, 20/391 constraints. Problems are: Problem set: 0 solved, 731 unsolved
[2024-06-01 16:13:39] [INFO ] Deduced a trap composed of 8 places in 61 ms of which 1 ms to minimize.
[2024-06-01 16:13:40] [INFO ] Deduced a trap composed of 5 places in 199 ms of which 4 ms to minimize.
[2024-06-01 16:13:40] [INFO ] Deduced a trap composed of 8 places in 69 ms of which 2 ms to minimize.
[2024-06-01 16:13:40] [INFO ] Deduced a trap composed of 7 places in 63 ms of which 2 ms to minimize.
[2024-06-01 16:13:40] [INFO ] Deduced a trap composed of 8 places in 65 ms of which 1 ms to minimize.
[2024-06-01 16:13:40] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 2 ms to minimize.
[2024-06-01 16:13:41] [INFO ] Deduced a trap composed of 7 places in 69 ms of which 2 ms to minimize.
[2024-06-01 16:13:41] [INFO ] Deduced a trap composed of 6 places in 65 ms of which 1 ms to minimize.
[2024-06-01 16:13:41] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 1 ms to minimize.
[2024-06-01 16:13:41] [INFO ] Deduced a trap composed of 8 places in 69 ms of which 1 ms to minimize.
[2024-06-01 16:13:41] [INFO ] Deduced a trap composed of 6 places in 69 ms of which 2 ms to minimize.
[2024-06-01 16:13:41] [INFO ] Deduced a trap composed of 7 places in 70 ms of which 2 ms to minimize.
[2024-06-01 16:13:42] [INFO ] Deduced a trap composed of 6 places in 76 ms of which 2 ms to minimize.
[2024-06-01 16:13:42] [INFO ] Deduced a trap composed of 6 places in 68 ms of which 1 ms to minimize.
[2024-06-01 16:13:42] [INFO ] Deduced a trap composed of 6 places in 70 ms of which 2 ms to minimize.
[2024-06-01 16:13:42] [INFO ] Deduced a trap composed of 7 places in 69 ms of which 1 ms to minimize.
[2024-06-01 16:13:42] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 2 ms to minimize.
[2024-06-01 16:13:42] [INFO ] Deduced a trap composed of 7 places in 72 ms of which 2 ms to minimize.
[2024-06-01 16:13:43] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 1 ms to minimize.
[2024-06-01 16:13:43] [INFO ] Deduced a trap composed of 5 places in 87 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/868 variables, 20/411 constraints. Problems are: Problem set: 0 solved, 731 unsolved
[2024-06-01 16:13:46] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2024-06-01 16:13:47] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 2 ms to minimize.
[2024-06-01 16:13:49] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 2 ms to minimize.
[2024-06-01 16:13:50] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 868/1600 variables, and 415 constraints, problems are : Problem set: 0 solved, 731 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 331/331 constraints, State Equation: 0/868 constraints, ReadFeed: 0/167 constraints, PredecessorRefiner: 0/731 constraints, Known Traps: 84/84 constraints]
After SMT, in 60213ms problems are : Problem set: 0 solved, 731 unsolved
Search for dead transitions found 0 dead transitions in 60222ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62903 ms. Remains : 868/868 places, 732/732 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 153 times.
Drop transitions (Partial Free agglomeration) removed 153 transitions
Iterating global reduction 0 with 153 rules applied. Total rules applied 153 place count 868 transition count 732
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 154 place count 868 transition count 731
Applied a total of 154 rules in 277 ms. Remains 868 /868 variables (removed 0) and now considering 731/732 (removed 1) transitions.
Running SMT prover for 7 properties.
// Phase 1: matrix 731 rows 868 cols
[2024-06-01 16:13:52] [INFO ] Computed 331 invariants in 10 ms
[2024-06-01 16:13:52] [INFO ] After 198ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2024-06-01 16:13:53] [INFO ] [Nat]Absence check using 331 positive place invariants in 52 ms returned sat
[2024-06-01 16:13:53] [INFO ] After 619ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2024-06-01 16:13:53] [INFO ] State equation strengthened by 118 read => feed constraints.
[2024-06-01 16:13:54] [INFO ] After 702ms SMT Verify possible using 118 Read/Feed constraints in natural domain returned unsat :0 sat :7
TRAPS : Iteration 0
[2024-06-01 16:13:54] [INFO ] Deduced a trap composed of 9 places in 99 ms of which 3 ms to minimize.
[2024-06-01 16:13:55] [INFO ] Deduced a trap composed of 9 places in 96 ms of which 2 ms to minimize.
[2024-06-01 16:13:55] [INFO ] Deduced a trap composed of 6 places in 99 ms of which 2 ms to minimize.
[2024-06-01 16:13:55] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 2 ms to minimize.
[2024-06-01 16:13:55] [INFO ] Deduced a trap composed of 7 places in 96 ms of which 2 ms to minimize.
[2024-06-01 16:13:55] [INFO ] Deduced a trap composed of 16 places in 99 ms of which 2 ms to minimize.
[2024-06-01 16:13:55] [INFO ] Deduced a trap composed of 6 places in 100 ms of which 2 ms to minimize.
[2024-06-01 16:13:55] [INFO ] Deduced a trap composed of 8 places in 80 ms of which 2 ms to minimize.
[2024-06-01 16:13:55] [INFO ] Deduced a trap composed of 7 places in 95 ms of which 2 ms to minimize.
[2024-06-01 16:13:56] [INFO ] Deduced a trap composed of 4 places in 93 ms of which 1 ms to minimize.
[2024-06-01 16:13:56] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 2 ms to minimize.
[2024-06-01 16:13:56] [INFO ] Deduced a trap composed of 8 places in 81 ms of which 2 ms to minimize.
[2024-06-01 16:13:56] [INFO ] Deduced a trap composed of 11 places in 78 ms of which 2 ms to minimize.
[2024-06-01 16:13:56] [INFO ] Deduced a trap composed of 8 places in 78 ms of which 1 ms to minimize.
[2024-06-01 16:13:56] [INFO ] Deduced a trap composed of 5 places in 82 ms of which 1 ms to minimize.
[2024-06-01 16:13:56] [INFO ] Deduced a trap composed of 10 places in 87 ms of which 1 ms to minimize.
[2024-06-01 16:13:56] [INFO ] Deduced a trap composed of 12 places in 78 ms of which 2 ms to minimize.
[2024-06-01 16:13:57] [INFO ] Deduced a trap composed of 8 places in 80 ms of which 2 ms to minimize.
[2024-06-01 16:13:57] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 2 ms to minimize.
[2024-06-01 16:13:57] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 2481 ms
[2024-06-01 16:13:57] [INFO ] Deduced a trap composed of 8 places in 109 ms of which 2 ms to minimize.
[2024-06-01 16:13:57] [INFO ] Deduced a trap composed of 4 places in 98 ms of which 2 ms to minimize.
[2024-06-01 16:13:57] [INFO ] Deduced a trap composed of 6 places in 98 ms of which 2 ms to minimize.
[2024-06-01 16:13:57] [INFO ] Deduced a trap composed of 7 places in 98 ms of which 2 ms to minimize.
[2024-06-01 16:13:57] [INFO ] Deduced a trap composed of 11 places in 94 ms of which 2 ms to minimize.
[2024-06-01 16:13:58] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 2 ms to minimize.
[2024-06-01 16:13:58] [INFO ] Deduced a trap composed of 10 places in 87 ms of which 2 ms to minimize.
[2024-06-01 16:13:58] [INFO ] Deduced a trap composed of 7 places in 87 ms of which 2 ms to minimize.
[2024-06-01 16:13:58] [INFO ] Deduced a trap composed of 10 places in 86 ms of which 2 ms to minimize.
[2024-06-01 16:13:58] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1162 ms
[2024-06-01 16:13:58] [INFO ] Deduced a trap composed of 11 places in 90 ms of which 2 ms to minimize.
[2024-06-01 16:13:58] [INFO ] Deduced a trap composed of 14 places in 83 ms of which 2 ms to minimize.
[2024-06-01 16:13:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 265 ms
[2024-06-01 16:13:59] [INFO ] Deduced a trap composed of 8 places in 73 ms of which 2 ms to minimize.
[2024-06-01 16:13:59] [INFO ] Deduced a trap composed of 5 places in 71 ms of which 1 ms to minimize.
[2024-06-01 16:13:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 248 ms
TRAPS : Iteration 1
[2024-06-01 16:13:59] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 2 ms to minimize.
[2024-06-01 16:13:59] [INFO ] Deduced a trap composed of 7 places in 97 ms of which 2 ms to minimize.
[2024-06-01 16:13:59] [INFO ] Deduced a trap composed of 7 places in 93 ms of which 2 ms to minimize.
[2024-06-01 16:14:00] [INFO ] Deduced a trap composed of 7 places in 91 ms of which 2 ms to minimize.
[2024-06-01 16:14:00] [INFO ] Deduced a trap composed of 7 places in 87 ms of which 2 ms to minimize.
[2024-06-01 16:14:00] [INFO ] Deduced a trap composed of 18 places in 91 ms of which 2 ms to minimize.
[2024-06-01 16:14:00] [INFO ] Deduced a trap composed of 8 places in 86 ms of which 2 ms to minimize.
[2024-06-01 16:14:00] [INFO ] Deduced a trap composed of 12 places in 82 ms of which 2 ms to minimize.
[2024-06-01 16:14:00] [INFO ] Deduced a trap composed of 10 places in 81 ms of which 2 ms to minimize.
[2024-06-01 16:14:00] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1228 ms
[2024-06-01 16:14:00] [INFO ] Deduced a trap composed of 11 places in 80 ms of which 2 ms to minimize.
[2024-06-01 16:14:00] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 2 ms to minimize.
[2024-06-01 16:14:01] [INFO ] Deduced a trap composed of 6 places in 83 ms of which 2 ms to minimize.
[2024-06-01 16:14:01] [INFO ] Deduced a trap composed of 7 places in 75 ms of which 2 ms to minimize.
[2024-06-01 16:14:01] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 475 ms
[2024-06-01 16:14:01] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 2 ms to minimize.
[2024-06-01 16:14:01] [INFO ] Deduced a trap composed of 10 places in 74 ms of which 1 ms to minimize.
[2024-06-01 16:14:01] [INFO ] Deduced a trap composed of 12 places in 77 ms of which 2 ms to minimize.
[2024-06-01 16:14:01] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 345 ms
[2024-06-01 16:14:01] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 1 ms to minimize.
[2024-06-01 16:14:01] [INFO ] Deduced a trap composed of 8 places in 58 ms of which 1 ms to minimize.
[2024-06-01 16:14:02] [INFO ] Deduced a trap composed of 6 places in 68 ms of which 1 ms to minimize.
[2024-06-01 16:14:02] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 1 ms to minimize.
[2024-06-01 16:14:02] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 1 ms to minimize.
[2024-06-01 16:14:02] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 1 ms to minimize.
[2024-06-01 16:14:02] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 1 ms to minimize.
[2024-06-01 16:14:02] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 2 ms to minimize.
[2024-06-01 16:14:02] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 1 ms to minimize.
[2024-06-01 16:14:02] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 907 ms
[2024-06-01 16:14:02] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 2 ms to minimize.
[2024-06-01 16:14:02] [INFO ] Deduced a trap composed of 8 places in 63 ms of which 2 ms to minimize.
[2024-06-01 16:14:03] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 1 ms to minimize.
[2024-06-01 16:14:03] [INFO ] Deduced a trap composed of 11 places in 66 ms of which 2 ms to minimize.
[2024-06-01 16:14:03] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 437 ms
TRAPS : Iteration 2
[2024-06-01 16:14:03] [INFO ] Deduced a trap composed of 7 places in 77 ms of which 3 ms to minimize.
[2024-06-01 16:14:03] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 1 ms to minimize.
[2024-06-01 16:14:03] [INFO ] Deduced a trap composed of 6 places in 72 ms of which 1 ms to minimize.
[2024-06-01 16:14:03] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 393 ms
[2024-06-01 16:14:03] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 1 ms to minimize.
[2024-06-01 16:14:04] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 2 ms to minimize.
[2024-06-01 16:14:04] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 2 ms to minimize.
[2024-06-01 16:14:04] [INFO ] Deduced a trap composed of 11 places in 86 ms of which 2 ms to minimize.
[2024-06-01 16:14:04] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 487 ms
[2024-06-01 16:14:04] [INFO ] Deduced a trap composed of 12 places in 98 ms of which 2 ms to minimize.
[2024-06-01 16:14:04] [INFO ] Deduced a trap composed of 9 places in 108 ms of which 2 ms to minimize.
[2024-06-01 16:14:05] [INFO ] Deduced a trap composed of 12 places in 100 ms of which 3 ms to minimize.
[2024-06-01 16:14:05] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 2 ms to minimize.
[2024-06-01 16:14:05] [INFO ] Deduced a trap composed of 10 places in 89 ms of which 2 ms to minimize.
[2024-06-01 16:14:05] [INFO ] Deduced a trap composed of 8 places in 92 ms of which 2 ms to minimize.
[2024-06-01 16:14:05] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 830 ms
[2024-06-01 16:14:05] [INFO ] Deduced a trap composed of 7 places in 108 ms of which 3 ms to minimize.
[2024-06-01 16:14:05] [INFO ] Deduced a trap composed of 7 places in 108 ms of which 2 ms to minimize.
[2024-06-01 16:14:05] [INFO ] Deduced a trap composed of 12 places in 106 ms of which 2 ms to minimize.
[2024-06-01 16:14:06] [INFO ] Deduced a trap composed of 10 places in 102 ms of which 3 ms to minimize.
[2024-06-01 16:14:06] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 594 ms
TRAPS : Iteration 3
[2024-06-01 16:14:06] [INFO ] Deduced a trap composed of 7 places in 89 ms of which 2 ms to minimize.
[2024-06-01 16:14:06] [INFO ] Deduced a trap composed of 7 places in 92 ms of which 2 ms to minimize.
[2024-06-01 16:14:06] [INFO ] Deduced a trap composed of 11 places in 92 ms of which 2 ms to minimize.
[2024-06-01 16:14:06] [INFO ] Deduced a trap composed of 10 places in 88 ms of which 2 ms to minimize.
[2024-06-01 16:14:07] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 535 ms
[2024-06-01 16:14:07] [INFO ] Deduced a trap composed of 8 places in 97 ms of which 2 ms to minimize.
[2024-06-01 16:14:07] [INFO ] Deduced a trap composed of 12 places in 91 ms of which 2 ms to minimize.
[2024-06-01 16:14:07] [INFO ] Deduced a trap composed of 5 places in 89 ms of which 2 ms to minimize.
[2024-06-01 16:14:07] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 397 ms
[2024-06-01 16:14:07] [INFO ] Deduced a trap composed of 10 places in 99 ms of which 3 ms to minimize.
[2024-06-01 16:14:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 171 ms
TRAPS : Iteration 4
[2024-06-01 16:14:08] [INFO ] Deduced a trap composed of 15 places in 94 ms of which 2 ms to minimize.
[2024-06-01 16:14:08] [INFO ] Deduced a trap composed of 11 places in 82 ms of which 2 ms to minimize.
[2024-06-01 16:14:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 324 ms
[2024-06-01 16:14:08] [INFO ] Deduced a trap composed of 13 places in 91 ms of which 2 ms to minimize.
[2024-06-01 16:14:08] [INFO ] Deduced a trap composed of 11 places in 91 ms of which 2 ms to minimize.
[2024-06-01 16:14:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 272 ms
TRAPS : Iteration 5
[2024-06-01 16:14:09] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 2 ms to minimize.
[2024-06-01 16:14:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 157 ms
[2024-06-01 16:14:09] [INFO ] Deduced a trap composed of 6 places in 95 ms of which 2 ms to minimize.
[2024-06-01 16:14:10] [INFO ] Deduced a trap composed of 7 places in 92 ms of which 2 ms to minimize.
[2024-06-01 16:14:10] [INFO ] Deduced a trap composed of 10 places in 90 ms of which 2 ms to minimize.
[2024-06-01 16:14:10] [INFO ] Deduced a trap composed of 8 places in 93 ms of which 2 ms to minimize.
[2024-06-01 16:14:10] [INFO ] Deduced a trap composed of 10 places in 94 ms of which 2 ms to minimize.
[2024-06-01 16:14:10] [INFO ] Deduced a trap composed of 11 places in 94 ms of which 2 ms to minimize.
[2024-06-01 16:14:10] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 788 ms
[2024-06-01 16:14:11] [INFO ] Deduced a trap composed of 11 places in 121 ms of which 2 ms to minimize.
[2024-06-01 16:14:11] [INFO ] Deduced a trap composed of 17 places in 118 ms of which 2 ms to minimize.
[2024-06-01 16:14:11] [INFO ] Deduced a trap composed of 15 places in 112 ms of which 3 ms to minimize.
[2024-06-01 16:14:11] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 474 ms
TRAPS : Iteration 6
[2024-06-01 16:14:12] [INFO ] Deduced a trap composed of 7 places in 103 ms of which 3 ms to minimize.
[2024-06-01 16:14:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 185 ms
[2024-06-01 16:14:12] [INFO ] Deduced a trap composed of 5 places in 91 ms of which 2 ms to minimize.
[2024-06-01 16:14:12] [INFO ] Deduced a trap composed of 8 places in 93 ms of which 2 ms to minimize.
[2024-06-01 16:14:12] [INFO ] Deduced a trap composed of 8 places in 86 ms of which 2 ms to minimize.
[2024-06-01 16:14:13] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 419 ms
[2024-06-01 16:14:13] [INFO ] Deduced a trap composed of 9 places in 105 ms of which 2 ms to minimize.
[2024-06-01 16:14:13] [INFO ] Deduced a trap composed of 6 places in 100 ms of which 2 ms to minimize.
[2024-06-01 16:14:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 310 ms
TRAPS : Iteration 7
[2024-06-01 16:14:13] [INFO ] Deduced a trap composed of 9 places in 105 ms of which 2 ms to minimize.
[2024-06-01 16:14:14] [INFO ] Deduced a trap composed of 7 places in 104 ms of which 2 ms to minimize.
[2024-06-01 16:14:14] [INFO ] Deduced a trap composed of 9 places in 101 ms of which 2 ms to minimize.
[2024-06-01 16:14:14] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 462 ms
[2024-06-01 16:14:14] [INFO ] Deduced a trap composed of 9 places in 120 ms of which 2 ms to minimize.
[2024-06-01 16:14:14] [INFO ] Deduced a trap composed of 7 places in 115 ms of which 3 ms to minimize.
[2024-06-01 16:14:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 334 ms
[2024-06-01 16:14:14] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 2 ms to minimize.
[2024-06-01 16:14:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 149 ms
TRAPS : Iteration 8
[2024-06-01 16:14:15] [INFO ] Deduced a trap composed of 8 places in 138 ms of which 3 ms to minimize.
[2024-06-01 16:14:16] [INFO ] Deduced a trap composed of 7 places in 135 ms of which 4 ms to minimize.
[2024-06-01 16:14:16] [INFO ] Deduced a trap composed of 9 places in 132 ms of which 2 ms to minimize.
[2024-06-01 16:14:16] [INFO ] Deduced a trap composed of 9 places in 129 ms of which 3 ms to minimize.
[2024-06-01 16:14:16] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 746 ms
[2024-06-01 16:14:16] [INFO ] Deduced a trap composed of 10 places in 132 ms of which 3 ms to minimize.
[2024-06-01 16:14:16] [INFO ] Deduced a trap composed of 11 places in 130 ms of which 2 ms to minimize.
[2024-06-01 16:14:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 359 ms
[2024-06-01 16:14:17] [INFO ] Deduced a trap composed of 8 places in 91 ms of which 2 ms to minimize.
[2024-06-01 16:14:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 177 ms
[2024-06-01 16:14:17] [INFO ] Deduced a trap composed of 8 places in 116 ms of which 2 ms to minimize.
[2024-06-01 16:14:17] [INFO ] Deduced a trap composed of 9 places in 108 ms of which 2 ms to minimize.
[2024-06-01 16:14:17] [INFO ] Deduced a trap composed of 9 places in 107 ms of which 2 ms to minimize.
[2024-06-01 16:14:18] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 500 ms
TRAPS : Iteration 9
[2024-06-01 16:14:19] [INFO ] Deduced a trap composed of 14 places in 101 ms of which 2 ms to minimize.
[2024-06-01 16:14:19] [INFO ] Deduced a trap composed of 8 places in 95 ms of which 2 ms to minimize.
[2024-06-01 16:14:19] [INFO ] Deduced a trap composed of 8 places in 97 ms of which 2 ms to minimize.
[2024-06-01 16:14:19] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 453 ms
[2024-06-01 16:14:19] [INFO ] Deduced a trap composed of 13 places in 132 ms of which 3 ms to minimize.
[2024-06-01 16:14:19] [INFO ] Deduced a trap composed of 9 places in 115 ms of which 3 ms to minimize.
[2024-06-01 16:14:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 363 ms
TRAPS : Iteration 10
[2024-06-01 16:14:20] [INFO ] Deduced a trap composed of 12 places in 107 ms of which 3 ms to minimize.
[2024-06-01 16:14:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 199 ms
[2024-06-01 16:14:20] [INFO ] Deduced a trap composed of 10 places in 121 ms of which 2 ms to minimize.
[2024-06-01 16:14:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 197 ms
[2024-06-01 16:14:21] [INFO ] Deduced a trap composed of 8 places in 110 ms of which 3 ms to minimize.
[2024-06-01 16:14:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 198 ms
[2024-06-01 16:14:21] [INFO ] Deduced a trap composed of 8 places in 122 ms of which 2 ms to minimize.
[2024-06-01 16:14:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 194 ms
TRAPS : Iteration 11
[2024-06-01 16:14:22] [INFO ] Deduced a trap composed of 10 places in 116 ms of which 2 ms to minimize.
[2024-06-01 16:14:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 203 ms
[2024-06-01 16:14:23] [INFO ] Deduced a trap composed of 11 places in 100 ms of which 2 ms to minimize.
[2024-06-01 16:14:23] [INFO ] Deduced a trap composed of 10 places in 107 ms of which 2 ms to minimize.
[2024-06-01 16:14:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 330 ms
TRAPS : Iteration 12
[2024-06-01 16:14:24] [INFO ] Deduced a trap composed of 15 places in 105 ms of which 3 ms to minimize.
[2024-06-01 16:14:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 189 ms
TRAPS : Iteration 13
[2024-06-01 16:14:25] [INFO ] Deduced a trap composed of 7 places in 114 ms of which 3 ms to minimize.
[2024-06-01 16:14:25] [INFO ] Deduced a trap composed of 10 places in 112 ms of which 2 ms to minimize.
[2024-06-01 16:14:26] [INFO ] Deduced a trap composed of 9 places in 107 ms of which 2 ms to minimize.
[2024-06-01 16:14:26] [INFO ] Deduced a trap composed of 8 places in 106 ms of which 3 ms to minimize.
[2024-06-01 16:14:26] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 650 ms
[2024-06-01 16:14:26] [INFO ] Deduced a trap composed of 7 places in 101 ms of which 2 ms to minimize.
[2024-06-01 16:14:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 172 ms
TRAPS : Iteration 14
[2024-06-01 16:14:27] [INFO ] Deduced a trap composed of 17 places in 109 ms of which 3 ms to minimize.
[2024-06-01 16:14:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 171 ms
TRAPS : Iteration 15
[2024-06-01 16:14:29] [INFO ] Deduced a trap composed of 11 places in 99 ms of which 3 ms to minimize.
[2024-06-01 16:14:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 179 ms
[2024-06-01 16:14:29] [INFO ] Deduced a trap composed of 9 places in 104 ms of which 3 ms to minimize.
[2024-06-01 16:14:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 170 ms
TRAPS : Iteration 16
[2024-06-01 16:14:30] [INFO ] Deduced a trap composed of 7 places in 123 ms of which 2 ms to minimize.
[2024-06-01 16:14:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 194 ms
[2024-06-01 16:14:30] [INFO ] Deduced a trap composed of 7 places in 98 ms of which 2 ms to minimize.
[2024-06-01 16:14:30] [INFO ] Deduced a trap composed of 13 places in 96 ms of which 2 ms to minimize.
[2024-06-01 16:14:31] [INFO ] Deduced a trap composed of 11 places in 94 ms of which 2 ms to minimize.
[2024-06-01 16:14:31] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 446 ms
[2024-06-01 16:14:31] [INFO ] Deduced a trap composed of 10 places in 107 ms of which 2 ms to minimize.
[2024-06-01 16:14:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 160 ms
TRAPS : Iteration 17
[2024-06-01 16:14:32] [INFO ] After 38321ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
[2024-06-01 16:14:33] [INFO ] After 40310ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Over-approximation ignoring read arcs solved 0 properties in 40828 ms.
[2024-06-01 16:14:33] [INFO ] Export to MCC of 7 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 6 ms.
[2024-06-01 16:14:33] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 868 places, 732 transitions and 3087 arcs took 8 ms.
[2024-06-01 16:14:33] [INFO ] Flatten gal took : 97 ms
Total runtime 129268 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=
[--mu-opt] [--saturation=
[--sat-granularity=
[--guidance=
[--action=
[--trace=
[--mu=
[--ctl=
[--save-levels=STRING] [--pg-solve] [--attr=
[--saturating-attractor] [--write-strategy=
[--check-strategy] [--interactive-play] [--player]
[--pg-write=
[--edge-label=
[--mucalc=
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por=
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=
[--cw-max-cols=
[--mh-timeout=
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=
[--ldd32-cache=
[--cache-ratio=
[--min-free-nodes=
[--fdd-reorder=
[--vset-cache-diff=
[--next-union] [--peak-nodes] [--maxsum=
[--block-size=
[--debug=
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS]
Could not compute solution for formula : ShieldPPPt-PT-030B-ReachabilityCardinality-2024-01
Could not compute solution for formula : ShieldPPPt-PT-030B-ReachabilityCardinality-2024-02
Could not compute solution for formula : ShieldPPPt-PT-030B-ReachabilityCardinality-2024-03
Could not compute solution for formula : ShieldPPPt-PT-030B-ReachabilityCardinality-2024-05
Could not compute solution for formula : ShieldPPPt-PT-030B-ReachabilityCardinality-2024-08
Could not compute solution for formula : ShieldPPPt-PT-030B-ReachabilityCardinality-2024-10
Could not compute solution for formula : ShieldPPPt-PT-030B-ReachabilityCardinality-2024-14
BK_STOP 1717258473864
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
mcc2024
rfs formula name ShieldPPPt-PT-030B-ReachabilityCardinality-2024-01
rfs formula type EF
rfs formula formula --invariant=/tmp/1338/inv_0_
rfs formula name ShieldPPPt-PT-030B-ReachabilityCardinality-2024-02
rfs formula type EF
rfs formula formula --invariant=/tmp/1338/inv_1_
rfs formula name ShieldPPPt-PT-030B-ReachabilityCardinality-2024-03
rfs formula type AG
rfs formula formula --invariant=/tmp/1338/inv_2_
rfs formula name ShieldPPPt-PT-030B-ReachabilityCardinality-2024-05
rfs formula type EF
rfs formula formula --invariant=/tmp/1338/inv_3_
rfs formula name ShieldPPPt-PT-030B-ReachabilityCardinality-2024-08
rfs formula type EF
rfs formula formula --invariant=/tmp/1338/inv_4_
rfs formula name ShieldPPPt-PT-030B-ReachabilityCardinality-2024-10
rfs formula type EF
rfs formula formula --invariant=/tmp/1338/inv_5_
rfs formula name ShieldPPPt-PT-030B-ReachabilityCardinality-2024-14
rfs formula type EF
rfs formula formula --invariant=/tmp/1338/inv_6_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc
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="ShieldPPPt-PT-030B"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is ShieldPPPt-PT-030B, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r528-tall-171683761600654"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPt-PT-030B.tgz
mv ShieldPPPt-PT-030B execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;