About the Execution of GreatSPN+red for Peterson-PT-3
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 552.111 | 81239.00 | 229273.00 | 216.50 | F | 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.r276-smll-171654416100163.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 Peterson-PT-3, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r276-smll-171654416100163
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.7M
-rw-r--r-- 1 mcc users 27K Apr 12 02:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 143K Apr 12 02:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 27K Apr 12 02:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 134K Apr 12 02:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 17K Apr 23 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Apr 23 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 14K Apr 23 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 23 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 108K Apr 12 02:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 511K Apr 12 02:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 71K Apr 12 02:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 344K Apr 12 02:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 5.5K Apr 23 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 12K Apr 23 07:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 2 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 143K 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
FORMULA_NAME StableMarking
=== Now, execution of the tool begins
BK_START 1716820388327
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=Peterson-PT-3
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-27 14:33:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2024-05-27 14:33:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 14:33:10] [INFO ] Load time of PNML (sax parser for PT used): 131 ms
[2024-05-27 14:33:10] [INFO ] Transformed 244 places.
[2024-05-27 14:33:10] [INFO ] Transformed 332 transitions.
[2024-05-27 14:33:10] [INFO ] Found NUPN structural information;
[2024-05-27 14:33:10] [INFO ] Parsed PT model containing 244 places and 332 transitions and 1016 arcs in 310 ms.
RANDOM walk for 40000 steps (8 resets) in 2996 ms. (13 steps per ms) remains 78/244 properties
BEST_FIRST walk for 4004 steps (8 resets) in 54 ms. (72 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 74/78 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 74/74 properties
[2024-05-27 14:33:12] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 244 cols
[2024-05-27 14:33:12] [INFO ] Computed 15 invariants in 15 ms
[2024-05-27 14:33:12] [INFO ] State equation strengthened by 57 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 74/74 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (OVERLAPS) 152/226 variables, 6/80 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/226 variables, 152/232 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/226 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (OVERLAPS) 2/228 variables, 2/234 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/228 variables, 2/236 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/228 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 8 (OVERLAPS) 4/232 variables, 4/240 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/232 variables, 4/244 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/232 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 11 (OVERLAPS) 308/540 variables, 232/476 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/540 variables, 57/533 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/540 variables, 0/533 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 14 (OVERLAPS) 12/552 variables, 12/545 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/552 variables, 12/557 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/552 variables, 3/560 constraints. Problems are: Problem set: 0 solved, 74 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 (/ 19.0 25.0))
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 (/ 1.0 50.0))
(s14 0.0)
(s15 0.0)
(s16 (/ 1.0 50.0))
(s17 (/ 1.0 50.0))
(s18 0.0)
(s19 0.0)
(s20 (/ 1.0 50.0))
(s21 (/ 1.0 50.0))
(s22 0.0)
(s23 (/ 1.0 50.0))
(s24 (/ 1.0 50.0))
(s25 (/ 1.0 50.0))
(s26 0.0)
(s27 (/ 1.0 50.0))
(s28 (/ 1.0 50.0))
(s29 (/ 1.0 50.0))
(s30 (/ 1.0 50.0))
(s31 (/ 1.0 50.0))
(s32 (/ 1.0 50.0))
(s33 (/ 1.0 50.0))
(s34 (/ 1.0 50.0))
(s35 (/ 1.0 50.0))
(s36 (/ 1.0 50.0))
(s37 (/ 1.0 50.0))
(s38 (/ 1.0 50.0))
(s39 (/ 1.0 50.0))
(s40 (/ 1.0 50.0))
(s41 (/ 1.0 50.0))
(s42 (/ 1.0 50.0))
(s43 (/ 1.0 50.0))
(s44 (/ 1.0 50.0))
(s45 0.0)
(s46 (/ 1.0 50.0))
(s47 (/ 1.0 50.0))
(s48 (/ 1.0 50.0))
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 (/ 1.0 50.0))
(s86 0.0)
(s87 0.0)
(s88 (/ 1.0 50.0))
(s89 (/ 1.0 50.0))
(s90 0.0)
(s91 0.0)
(s92 (/ 1.0 50.0))
(s93 (/ 1.0 50.0))
(s94 (/ 1.0 50.0))
(s95 0.0)
(s96 (/ 1.0 50.0))
(s97 (/ 1.0 50.0))
(s98 (/ 1.0 50.0))
(s99 0.0)
(s100 (/ 1.0 50.0))
(s101 (/ 1.0 50.0))
(s102 (/ 49.0 50.0))
(s103 (/ 1.0 50.0))
(s104 (/ 1.0 50.0))
(s105 (/ 1.0 50.0))
(s106 (/ 1.0 50.0))
(s107 (/ 1.0 50.0))
(s108 (/ 1.0 50.0))
(s109 0.0)
(s110 (/ 13.0 25.0))
(s111 (/ 13.0 25.0))
(s112 (/ 1.0 50.0))
(s113 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 552/552 variables, and 560 constraints, problems are : Problem set: 0 solved, 74 unsolved in 5064 ms.
Refiners :[Domain max(s): 244/244 constraints, Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 244/244 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 74 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 74/74 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (OVERLAPS) 152/226 variables, 6/80 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/226 variables, 152/232 constraints. Problems are: Problem set: 0 solved, 74 unsolved
[2024-05-27 14:33:18] [INFO ] Deduced a trap composed of 97 places in 184 ms of which 35 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/226 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/226 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (OVERLAPS) 2/228 variables, 2/235 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/228 variables, 2/237 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/228 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 9 (OVERLAPS) 4/232 variables, 4/241 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/232 variables, 4/245 constraints. Problems are: Problem set: 0 solved, 74 unsolved
[2024-05-27 14:33:20] [INFO ] Deduced a trap composed of 49 places in 148 ms of which 4 ms to minimize.
[2024-05-27 14:33:20] [INFO ] Deduced a trap composed of 73 places in 108 ms of which 3 ms to minimize.
[2024-05-27 14:33:20] [INFO ] Deduced a trap composed of 61 places in 122 ms of which 3 ms to minimize.
[2024-05-27 14:33:20] [INFO ] Deduced a trap composed of 98 places in 75 ms of which 2 ms to minimize.
[2024-05-27 14:33:20] [INFO ] Deduced a trap composed of 73 places in 76 ms of which 2 ms to minimize.
[2024-05-27 14:33:20] [INFO ] Deduced a trap composed of 85 places in 84 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/232 variables, 6/251 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/232 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 13 (OVERLAPS) 308/540 variables, 232/483 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/540 variables, 57/540 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/540 variables, 74/614 constraints. Problems are: Problem set: 0 solved, 74 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 540/552 variables, and 614 constraints, problems are : Problem set: 0 solved, 74 unsolved in 5012 ms.
Refiners :[Domain max(s): 232/244 constraints, Positive P Invariants (semi-flows): 8/11 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 232/244 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 7/7 constraints]
After SMT, in 10188ms problems are : Problem set: 0 solved, 74 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 74 out of 244 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 244/244 places, 332/332 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 56 place count 244 transition count 276
Reduce places removed 56 places and 0 transitions.
Iterating post reduction 1 with 56 rules applied. Total rules applied 112 place count 188 transition count 276
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 37 Pre rules applied. Total rules applied 112 place count 188 transition count 239
Deduced a syphon composed of 37 places in 1 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 186 place count 151 transition count 239
Applied a total of 186 rules in 57 ms. Remains 151 /244 variables (removed 93) and now considering 239/332 (removed 93) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 151/244 places, 239/332 transitions.
RANDOM walk for 4000000 steps (8 resets) in 43308 ms. (92 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400004 steps (8 resets) in 923 ms. (432 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400004 steps (8 resets) in 913 ms. (437 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400004 steps (8 resets) in 918 ms. (435 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1046 ms. (382 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400004 steps (8 resets) in 925 ms. (431 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400004 steps (8 resets) in 918 ms. (435 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400004 steps (8 resets) in 918 ms. (435 steps per ms) remains 67/74 properties
BEST_FIRST walk for 400004 steps (8 resets) in 871 ms. (458 steps per ms) remains 67/67 properties
BEST_FIRST walk for 400004 steps (8 resets) in 868 ms. (460 steps per ms) remains 67/67 properties
BEST_FIRST walk for 400004 steps (8 resets) in 845 ms. (472 steps per ms) remains 63/67 properties
BEST_FIRST walk for 400004 steps (8 resets) in 829 ms. (481 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400004 steps (8 resets) in 826 ms. (483 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400004 steps (8 resets) in 832 ms. (480 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400004 steps (8 resets) in 824 ms. (484 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400004 steps (8 resets) in 832 ms. (480 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400004 steps (8 resets) in 824 ms. (484 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400004 steps (8 resets) in 830 ms. (481 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400004 steps (8 resets) in 825 ms. (484 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400004 steps (8 resets) in 892 ms. (447 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400004 steps (8 resets) in 831 ms. (480 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400004 steps (8 resets) in 830 ms. (481 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400004 steps (8 resets) in 826 ms. (483 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400004 steps (8 resets) in 828 ms. (482 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400004 steps (8 resets) in 840 ms. (475 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400004 steps (8 resets) in 833 ms. (479 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400004 steps (8 resets) in 823 ms. (485 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400004 steps (8 resets) in 819 ms. (487 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400004 steps (8 resets) in 827 ms. (483 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400004 steps (8 resets) in 833 ms. (479 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400004 steps (8 resets) in 886 ms. (450 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400004 steps (8 resets) in 834 ms. (479 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400004 steps (8 resets) in 828 ms. (482 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400004 steps (8 resets) in 834 ms. (479 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400004 steps (8 resets) in 821 ms. (486 steps per ms) remains 59/63 properties
BEST_FIRST walk for 400004 steps (8 resets) in 809 ms. (493 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400004 steps (8 resets) in 792 ms. (504 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400004 steps (8 resets) in 813 ms. (491 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400004 steps (8 resets) in 807 ms. (495 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400004 steps (8 resets) in 824 ms. (484 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400004 steps (8 resets) in 809 ms. (493 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400004 steps (8 resets) in 813 ms. (491 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400004 steps (8 resets) in 815 ms. (490 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400004 steps (8 resets) in 822 ms. (486 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400004 steps (8 resets) in 808 ms. (494 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400004 steps (8 resets) in 808 ms. (494 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400004 steps (8 resets) in 810 ms. (493 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400004 steps (8 resets) in 805 ms. (496 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400004 steps (8 resets) in 810 ms. (493 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400004 steps (8 resets) in 806 ms. (495 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400004 steps (8 resets) in 814 ms. (490 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400004 steps (8 resets) in 802 ms. (498 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400004 steps (8 resets) in 812 ms. (492 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400004 steps (8 resets) in 801 ms. (498 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400004 steps (8 resets) in 809 ms. (493 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400004 steps (8 resets) in 802 ms. (498 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400004 steps (8 resets) in 808 ms. (494 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400004 steps (8 resets) in 803 ms. (497 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400004 steps (8 resets) in 806 ms. (495 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400004 steps (8 resets) in 803 ms. (497 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400004 steps (8 resets) in 808 ms. (494 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400004 steps (8 resets) in 804 ms. (496 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400004 steps (8 resets) in 808 ms. (494 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400004 steps (8 resets) in 803 ms. (497 steps per ms) remains 59/59 properties
[2024-05-27 14:33:48] [INFO ] Flow matrix only has 215 transitions (discarded 24 similar events)
// Phase 1: matrix 215 rows 151 cols
[2024-05-27 14:33:48] [INFO ] Computed 15 invariants in 3 ms
[2024-05-27 14:33:48] [INFO ] State equation strengthened by 57 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 59/59 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (OVERLAPS) 72/131 variables, 4/63 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/131 variables, 72/135 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/131 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 5 (OVERLAPS) 4/135 variables, 4/139 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/135 variables, 4/143 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/135 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 8 (OVERLAPS) 4/139 variables, 4/147 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/139 variables, 4/151 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/139 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 11 (OVERLAPS) 215/354 variables, 139/290 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/354 variables, 57/347 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/354 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 14 (OVERLAPS) 12/366 variables, 12/359 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/366 variables, 12/371 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/366 variables, 3/374 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/366 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 18 (OVERLAPS) 0/366 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Real declared 366/366 variables, and 374 constraints, problems are : Problem set: 0 solved, 59 unsolved in 3247 ms.
Refiners :[Domain max(s): 151/151 constraints, Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 151/151 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 59 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 59/59 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (OVERLAPS) 72/131 variables, 4/63 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/131 variables, 72/135 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/131 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 5 (OVERLAPS) 4/135 variables, 4/139 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/135 variables, 4/143 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/135 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 8 (OVERLAPS) 4/139 variables, 4/147 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/139 variables, 4/151 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-27 14:33:52] [INFO ] Deduced a trap composed of 22 places in 93 ms of which 5 ms to minimize.
[2024-05-27 14:33:52] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 2 ms to minimize.
[2024-05-27 14:33:52] [INFO ] Deduced a trap composed of 28 places in 65 ms of which 2 ms to minimize.
[2024-05-27 14:33:53] [INFO ] Deduced a trap composed of 37 places in 46 ms of which 2 ms to minimize.
[2024-05-27 14:33:53] [INFO ] Deduced a trap composed of 37 places in 49 ms of which 1 ms to minimize.
[2024-05-27 14:33:53] [INFO ] Deduced a trap composed of 61 places in 64 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/139 variables, 6/157 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/139 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 12 (OVERLAPS) 215/354 variables, 139/296 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/354 variables, 57/353 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/354 variables, 59/412 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/354 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 16 (OVERLAPS) 12/366 variables, 12/424 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/366 variables, 12/436 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/366 variables, 3/439 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-27 14:33:55] [INFO ] Deduced a trap composed of 7 places in 80 ms of which 2 ms to minimize.
[2024-05-27 14:33:55] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 2 ms to minimize.
[2024-05-27 14:33:55] [INFO ] Deduced a trap composed of 20 places in 69 ms of which 2 ms to minimize.
[2024-05-27 14:33:55] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 2 ms to minimize.
[2024-05-27 14:33:55] [INFO ] Deduced a trap composed of 36 places in 53 ms of which 1 ms to minimize.
[2024-05-27 14:33:55] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 1 ms to minimize.
[2024-05-27 14:33:55] [INFO ] Deduced a trap composed of 8 places in 81 ms of which 2 ms to minimize.
[2024-05-27 14:33:55] [INFO ] Deduced a trap composed of 8 places in 67 ms of which 2 ms to minimize.
[2024-05-27 14:33:55] [INFO ] Deduced a trap composed of 7 places in 76 ms of which 4 ms to minimize.
[2024-05-27 14:33:55] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 1 ms to minimize.
[2024-05-27 14:33:55] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 1 ms to minimize.
[2024-05-27 14:33:55] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 2 ms to minimize.
[2024-05-27 14:33:56] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 2 ms to minimize.
[2024-05-27 14:33:56] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 2 ms to minimize.
[2024-05-27 14:33:56] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 1 ms to minimize.
[2024-05-27 14:33:56] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
[2024-05-27 14:33:56] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 1 ms to minimize.
[2024-05-27 14:33:56] [INFO ] Deduced a trap composed of 7 places in 90 ms of which 2 ms to minimize.
[2024-05-27 14:33:56] [INFO ] Deduced a trap composed of 7 places in 74 ms of which 2 ms to minimize.
[2024-05-27 14:33:56] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/366 variables, 20/459 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-27 14:33:57] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 2 ms to minimize.
[2024-05-27 14:33:57] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 7 ms to minimize.
[2024-05-27 14:33:57] [INFO ] Deduced a trap composed of 8 places in 76 ms of which 1 ms to minimize.
[2024-05-27 14:33:57] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 1 ms to minimize.
[2024-05-27 14:33:57] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 2 ms to minimize.
[2024-05-27 14:33:58] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 1 ms to minimize.
[2024-05-27 14:33:58] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 2 ms to minimize.
[2024-05-27 14:33:58] [INFO ] Deduced a trap composed of 36 places in 61 ms of which 1 ms to minimize.
[2024-05-27 14:33:58] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 2 ms to minimize.
[2024-05-27 14:33:58] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 1 ms to minimize.
[2024-05-27 14:33:58] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 2 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/366 variables, 11/470 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-27 14:33:59] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/366 variables, 1/471 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-27 14:34:00] [INFO ] Deduced a trap composed of 32 places in 55 ms of which 2 ms to minimize.
[2024-05-27 14:34:00] [INFO ] Deduced a trap composed of 32 places in 54 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/366 variables, 2/473 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-27 14:34:01] [INFO ] Deduced a trap composed of 39 places in 63 ms of which 2 ms to minimize.
[2024-05-27 14:34:01] [INFO ] Deduced a trap composed of 36 places in 56 ms of which 2 ms to minimize.
[2024-05-27 14:34:01] [INFO ] Deduced a trap composed of 36 places in 63 ms of which 1 ms to minimize.
[2024-05-27 14:34:01] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 3 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/366 variables, 4/477 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/366 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 25 (OVERLAPS) 0/366 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Int declared 366/366 variables, and 477 constraints, problems are : Problem set: 0 solved, 59 unsolved in 14124 ms.
Refiners :[Domain max(s): 151/151 constraints, Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 151/151 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 44/44 constraints]
After SMT, in 17405ms problems are : Problem set: 0 solved, 59 unsolved
Parikh walk visited 15 properties in 4039 ms.
Support contains 44 out of 151 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 151/151 places, 239/239 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 151 transition count 223
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 135 transition count 223
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 32 place count 135 transition count 218
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 42 place count 130 transition count 218
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 50 place count 126 transition count 214
Applied a total of 50 rules in 27 ms. Remains 126 /151 variables (removed 25) and now considering 214/239 (removed 25) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 126/151 places, 214/239 transitions.
RANDOM walk for 4000000 steps (8 resets) in 30101 ms. (132 steps per ms) remains 44/44 properties
BEST_FIRST walk for 400004 steps (8 resets) in 697 ms. (573 steps per ms) remains 44/44 properties
BEST_FIRST walk for 400004 steps (8 resets) in 686 ms. (582 steps per ms) remains 44/44 properties
BEST_FIRST walk for 400004 steps (8 resets) in 687 ms. (581 steps per ms) remains 44/44 properties
BEST_FIRST walk for 400004 steps (8 resets) in 694 ms. (575 steps per ms) remains 44/44 properties
BEST_FIRST walk for 400004 steps (8 resets) in 683 ms. (584 steps per ms) remains 44/44 properties
BEST_FIRST walk for 400004 steps (8 resets) in 689 ms. (579 steps per ms) remains 44/44 properties
BEST_FIRST walk for 400004 steps (8 resets) in 686 ms. (582 steps per ms) remains 44/44 properties
BEST_FIRST walk for 400004 steps (8 resets) in 692 ms. (577 steps per ms) remains 44/44 properties
BEST_FIRST walk for 400004 steps (8 resets) in 686 ms. (582 steps per ms) remains 44/44 properties
BEST_FIRST walk for 400004 steps (8 resets) in 688 ms. (580 steps per ms) remains 44/44 properties
BEST_FIRST walk for 400004 steps (8 resets) in 687 ms. (581 steps per ms) remains 44/44 properties
BEST_FIRST walk for 400004 steps (8 resets) in 685 ms. (583 steps per ms) remains 44/44 properties
BEST_FIRST walk for 400004 steps (8 resets) in 690 ms. (578 steps per ms) remains 44/44 properties
BEST_FIRST walk for 400004 steps (8 resets) in 685 ms. (583 steps per ms) remains 44/44 properties
BEST_FIRST walk for 400004 steps (8 resets) in 689 ms. (579 steps per ms) remains 44/44 properties
BEST_FIRST walk for 400004 steps (8 resets) in 688 ms. (580 steps per ms) remains 44/44 properties
BEST_FIRST walk for 400004 steps (8 resets) in 692 ms. (577 steps per ms) remains 44/44 properties
BEST_FIRST walk for 400004 steps (8 resets) in 687 ms. (581 steps per ms) remains 44/44 properties
BEST_FIRST walk for 400004 steps (8 resets) in 688 ms. (580 steps per ms) remains 44/44 properties
BEST_FIRST walk for 400004 steps (8 resets) in 693 ms. (576 steps per ms) remains 44/44 properties
BEST_FIRST walk for 400004 steps (8 resets) in 687 ms. (581 steps per ms) remains 44/44 properties
BEST_FIRST walk for 400004 steps (8 resets) in 691 ms. (578 steps per ms) remains 44/44 properties
BEST_FIRST walk for 400004 steps (8 resets) in 689 ms. (579 steps per ms) remains 44/44 properties
BEST_FIRST walk for 400004 steps (8 resets) in 692 ms. (577 steps per ms) remains 43/44 properties
BEST_FIRST walk for 400004 steps (8 resets) in 682 ms. (585 steps per ms) remains 43/43 properties
BEST_FIRST walk for 400004 steps (8 resets) in 678 ms. (589 steps per ms) remains 43/43 properties
BEST_FIRST walk for 400004 steps (8 resets) in 683 ms. (584 steps per ms) remains 43/43 properties
BEST_FIRST walk for 400004 steps (8 resets) in 678 ms. (589 steps per ms) remains 43/43 properties
BEST_FIRST walk for 400004 steps (8 resets) in 684 ms. (583 steps per ms) remains 43/43 properties
BEST_FIRST walk for 400004 steps (8 resets) in 678 ms. (589 steps per ms) remains 43/43 properties
BEST_FIRST walk for 400004 steps (8 resets) in 683 ms. (584 steps per ms) remains 43/43 properties
BEST_FIRST walk for 400004 steps (8 resets) in 681 ms. (586 steps per ms) remains 43/43 properties
BEST_FIRST walk for 400004 steps (8 resets) in 680 ms. (587 steps per ms) remains 43/43 properties
BEST_FIRST walk for 400004 steps (8 resets) in 684 ms. (583 steps per ms) remains 43/43 properties
BEST_FIRST walk for 400004 steps (8 resets) in 678 ms. (589 steps per ms) remains 43/43 properties
BEST_FIRST walk for 400004 steps (8 resets) in 681 ms. (586 steps per ms) remains 43/43 properties
BEST_FIRST walk for 400004 steps (8 resets) in 677 ms. (589 steps per ms) remains 43/43 properties
BEST_FIRST walk for 400004 steps (8 resets) in 684 ms. (583 steps per ms) remains 43/43 properties
BEST_FIRST walk for 400004 steps (8 resets) in 679 ms. (588 steps per ms) remains 43/43 properties
BEST_FIRST walk for 400004 steps (8 resets) in 679 ms. (588 steps per ms) remains 43/43 properties
BEST_FIRST walk for 400004 steps (8 resets) in 685 ms. (583 steps per ms) remains 43/43 properties
BEST_FIRST walk for 400004 steps (8 resets) in 674 ms. (592 steps per ms) remains 43/43 properties
BEST_FIRST walk for 400004 steps (8 resets) in 684 ms. (583 steps per ms) remains 43/43 properties
BEST_FIRST walk for 400004 steps (8 resets) in 674 ms. (592 steps per ms) remains 43/43 properties
Finished probabilistic random walk after 367555 steps, run visited all 43 properties in 2703 ms. (steps per millisecond=135 )
Probabilistic random walk after 367555 steps, saw 73682 distinct states, run finished after 2711 ms. (steps per millisecond=135 ) properties seen :43
Able to resolve query StableMarking after proving 244 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PARIKH_WALK PROBABILISTIC_WALK BESTFIRST_WALK TOPOLOGICAL
Total runtime 79369 ms.
ITS solved all properties within timeout
BK_STOP 1716820469566
--------------------
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 StableMarking -timeout 180 -rebuildPNML
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Peterson-PT-3"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is Peterson-PT-3, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r276-smll-171654416100163"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Peterson-PT-3.tgz
mv Peterson-PT-3 execution
cd execution
if [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "UpperBounds" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] || [ "StableMarking" = "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 [ "StableMarking" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "StableMarking" != "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 "StableMarking.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property StableMarking.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "StableMarking.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 [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] ; then
echo "FORMULA_NAME StableMarking"
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 ;