Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r298-tajo-171654454900138.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
......................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is PolyORBLF-PT-S02J04T06, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r298-tajo-171654454900138
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.6M
-rw-r--r-- 1 mcc users 11K Apr 11 16:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Apr 11 16:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 24K Apr 11 16:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 133K Apr 11 16:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 9.2K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 41K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 31K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 26K Apr 11 17:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 159K Apr 11 17:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 17K Apr 11 17:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 92K Apr 11 17:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.6K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.6K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 862K 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 1717103658963

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=PolyORBLF-PT-S02J04T06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-30 21:14:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2024-05-30 21:14:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 21:14:20] [INFO ] Load time of PNML (sax parser for PT used): 141 ms
[2024-05-30 21:14:20] [INFO ] Transformed 476 places.
[2024-05-30 21:14:20] [INFO ] Transformed 920 transitions.
[2024-05-30 21:14:20] [INFO ] Parsed PT model containing 476 places and 920 transitions and 4242 arcs in 269 ms.
Ensure Unique test removed 96 transitions
Reduce redundant transitions removed 96 transitions.
RANDOM walk for 40000 steps (14 resets) in 2135 ms. (18 steps per ms) remains 14/476 properties
BEST_FIRST walk for 40001 steps (8 resets) in 263 ms. (151 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (9 resets) in 279 ms. (142 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40000 steps (10 resets) in 322 ms. (123 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (10 resets) in 203 ms. (196 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (10 resets) in 218 ms. (182 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (12 resets) in 200 ms. (199 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (9 resets) in 274 ms. (145 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (10 resets) in 161 ms. (246 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (11 resets) in 261 ms. (152 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (9 resets) in 226 ms. (176 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (14 resets) in 192 ms. (207 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40001 steps (12 resets) in 136 ms. (291 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (11 resets) in 210 ms. (189 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40001 steps (10 resets) in 171 ms. (232 steps per ms) remains 14/14 properties
[2024-05-30 21:14:22] [INFO ] Flow matrix only has 812 transitions (discarded 12 similar events)
// Phase 1: matrix 812 rows 476 cols
[2024-05-30 21:14:22] [INFO ] Computed 46 invariants in 43 ms
[2024-05-30 21:14:22] [INFO ] State equation strengthened by 72 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 196/210 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/210 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 85/295 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/295 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 2/297 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/297 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 175/472 variables, 29/43 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/472 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (OVERLAPS) 1/473 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/473 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 11 (OVERLAPS) 1/474 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/474 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 13 (OVERLAPS) 812/1286 variables, 474/519 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1286 variables, 72/591 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1286 variables, 0/591 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 16 (OVERLAPS) 2/1288 variables, 2/593 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1288 variables, 1/594 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1288 variables, 0/594 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 19 (OVERLAPS) 0/1288 variables, 0/594 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1288/1288 variables, and 594 constraints, problems are : Problem set: 0 solved, 14 unsolved in 3165 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 35/35 constraints, State Equation: 476/476 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 196/210 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/210 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 85/295 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/295 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 2/297 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/297 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 175/472 variables, 29/43 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-05-30 21:14:27] [INFO ] Deduced a trap composed of 65 places in 215 ms of which 46 ms to minimize.
[2024-05-30 21:14:27] [INFO ] Deduced a trap composed of 65 places in 125 ms of which 1 ms to minimize.
[2024-05-30 21:14:27] [INFO ] Deduced a trap composed of 65 places in 283 ms of which 27 ms to minimize.
[2024-05-30 21:14:28] [INFO ] Deduced a trap composed of 65 places in 120 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/472 variables, 4/47 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/472 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (OVERLAPS) 1/473 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/473 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 12 (OVERLAPS) 1/474 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/474 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 14 (OVERLAPS) 812/1286 variables, 474/523 constraints. Problems are: Problem set: 0 solved, 14 unsolved
SMT process timed out in 8305ms, After SMT, problems are : Problem set: 0 solved, 14 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 14 out of 476 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 476/476 places, 824/824 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 56 rules applied. Total rules applied 56 place count 474 transition count 770
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 110 place count 420 transition count 770
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 48 Pre rules applied. Total rules applied 110 place count 420 transition count 722
Deduced a syphon composed of 48 places in 5 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 206 place count 372 transition count 722
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 302 place count 324 transition count 674
Free-agglomeration rule (complex) applied 12 times.
Iterating global reduction 2 with 12 rules applied. Total rules applied 314 place count 324 transition count 662
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 326 place count 312 transition count 662
Applied a total of 326 rules in 300 ms. Remains 312 /476 variables (removed 164) and now considering 662/824 (removed 162) transitions.
Running 660 sub problems to find dead transitions.
[2024-05-30 21:14:31] [INFO ] Flow matrix only has 650 transitions (discarded 12 similar events)
// Phase 1: matrix 650 rows 312 cols
[2024-05-30 21:14:31] [INFO ] Computed 44 invariants in 17 ms
[2024-05-30 21:14:31] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 29/41 constraints. Problems are: Problem set: 0 solved, 660 unsolved
[2024-05-30 21:14:36] [INFO ] Deduced a trap composed of 39 places in 135 ms of which 3 ms to minimize.
[2024-05-30 21:14:36] [INFO ] Deduced a trap composed of 38 places in 123 ms of which 2 ms to minimize.
[2024-05-30 21:14:36] [INFO ] Deduced a trap composed of 39 places in 147 ms of which 1 ms to minimize.
[2024-05-30 21:14:36] [INFO ] Deduced a trap composed of 39 places in 130 ms of which 15 ms to minimize.
[2024-05-30 21:14:36] [INFO ] Deduced a trap composed of 15 places in 249 ms of which 13 ms to minimize.
[2024-05-30 21:14:36] [INFO ] Deduced a trap composed of 38 places in 44 ms of which 2 ms to minimize.
[2024-05-30 21:14:37] [INFO ] Deduced a trap composed of 102 places in 184 ms of which 2 ms to minimize.
[2024-05-30 21:14:37] [INFO ] Deduced a trap composed of 39 places in 52 ms of which 1 ms to minimize.
[2024-05-30 21:14:38] [INFO ] Deduced a trap composed of 49 places in 155 ms of which 2 ms to minimize.
[2024-05-30 21:14:39] [INFO ] Deduced a trap composed of 152 places in 187 ms of which 2 ms to minimize.
[2024-05-30 21:14:39] [INFO ] Deduced a trap composed of 97 places in 162 ms of which 2 ms to minimize.
[2024-05-30 21:14:40] [INFO ] Deduced a trap composed of 110 places in 186 ms of which 2 ms to minimize.
[2024-05-30 21:14:41] [INFO ] Deduced a trap composed of 81 places in 166 ms of which 2 ms to minimize.
[2024-05-30 21:14:41] [INFO ] Deduced a trap composed of 134 places in 209 ms of which 3 ms to minimize.
[2024-05-30 21:14:42] [INFO ] Deduced a trap composed of 149 places in 193 ms of which 3 ms to minimize.
[2024-05-30 21:14:42] [INFO ] Deduced a trap composed of 126 places in 202 ms of which 3 ms to minimize.
[2024-05-30 21:14:42] [INFO ] Deduced a trap composed of 26 places in 150 ms of which 2 ms to minimize.
[2024-05-30 21:14:42] [INFO ] Deduced a trap composed of 121 places in 149 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/310 variables, 18/59 constraints. Problems are: Problem set: 0 solved, 660 unsolved
[2024-05-30 21:14:45] [INFO ] Deduced a trap composed of 32 places in 122 ms of which 3 ms to minimize.
[2024-05-30 21:14:47] [INFO ] Deduced a trap composed of 117 places in 102 ms of which 2 ms to minimize.
[2024-05-30 21:14:48] [INFO ] Deduced a trap composed of 159 places in 125 ms of which 2 ms to minimize.
[2024-05-30 21:14:48] [INFO ] Deduced a trap composed of 179 places in 144 ms of which 2 ms to minimize.
[2024-05-30 21:14:48] [INFO ] Deduced a trap composed of 180 places in 158 ms of which 3 ms to minimize.
[2024-05-30 21:14:48] [INFO ] Deduced a trap composed of 110 places in 141 ms of which 2 ms to minimize.
[2024-05-30 21:14:49] [INFO ] Deduced a trap composed of 174 places in 152 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 9.0)
(s4 0.0)
(s5 1.0)
(s6 1.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 1.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 1.0)
(s37 1.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.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 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/310 variables, 7/66 constraints. Problems are: Problem set: 0 solved, 660 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 310/962 variables, and 66 constraints, problems are : Problem set: 0 solved, 660 unsolved in 20036 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 29/32 constraints, State Equation: 0/312 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 660/660 constraints, Known Traps: 25/25 constraints]
Escalating to Integer solving :Problem set: 0 solved, 660 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 29/41 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/310 variables, 25/66 constraints. Problems are: Problem set: 0 solved, 660 unsolved
[2024-05-30 21:14:55] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/310 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 660 unsolved
[2024-05-30 21:15:09] [INFO ] Deduced a trap composed of 121 places in 166 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/310 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 660 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 310/962 variables, and 68 constraints, problems are : Problem set: 0 solved, 660 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 29/32 constraints, State Equation: 0/312 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/660 constraints, Known Traps: 27/27 constraints]
After SMT, in 41837ms problems are : Problem set: 0 solved, 660 unsolved
Search for dead transitions found 0 dead transitions in 41851ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42174 ms. Remains : 312/476 places, 662/824 transitions.
RANDOM walk for 4000000 steps (2305 resets) in 27729 ms. (144 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000003 steps (945 resets) in 11482 ms. (348 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000001 steps (996 resets) in 11433 ms. (349 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000003 steps (953 resets) in 11064 ms. (361 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000003 steps (947 resets) in 10830 ms. (369 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000002 steps (958 resets) in 11352 ms. (352 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000002 steps (1006 resets) in 11482 ms. (348 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000004 steps (953 resets) in 10906 ms. (366 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000002 steps (1020 resets) in 11389 ms. (351 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000002 steps (983 resets) in 11379 ms. (351 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000003 steps (1014 resets) in 11304 ms. (353 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000002 steps (1031 resets) in 11441 ms. (349 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000002 steps (948 resets) in 11262 ms. (355 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000004 steps (1009 resets) in 11146 ms. (358 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000001 steps (1005 resets) in 10973 ms. (364 steps per ms) remains 14/14 properties
Interrupted probabilistic random walk after 6328891 steps, run timeout after 147001 ms. (steps per millisecond=43 ) properties seen :0 out of 14
Probabilistic random walk after 6328891 steps, saw 2868785 distinct states, run finished after 147009 ms. (steps per millisecond=43 ) properties seen :0
[2024-05-30 21:18:30] [INFO ] Flow matrix only has 650 transitions (discarded 12 similar events)
[2024-05-30 21:18:30] [INFO ] Invariant cache hit.
[2024-05-30 21:18:30] [INFO ] State equation strengthened by 72 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 146/160 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 55/215 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/215 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 2/217 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/217 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 91/308 variables, 27/41 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/308 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (OVERLAPS) 2/310 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/310 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 11 (OVERLAPS) 650/960 variables, 310/353 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/960 variables, 72/425 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/960 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 14 (OVERLAPS) 2/962 variables, 2/427 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/962 variables, 1/428 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/962 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 17 (OVERLAPS) 0/962 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 962/962 variables, and 428 constraints, problems are : Problem set: 0 solved, 14 unsolved in 1616 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 32/32 constraints, State Equation: 312/312 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 146/160 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 55/215 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/215 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 2/217 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/217 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 91/308 variables, 27/41 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-05-30 21:18:32] [INFO ] Deduced a trap composed of 38 places in 206 ms of which 3 ms to minimize.
[2024-05-30 21:18:32] [INFO ] Deduced a trap composed of 38 places in 175 ms of which 3 ms to minimize.
[2024-05-30 21:18:32] [INFO ] Deduced a trap composed of 138 places in 164 ms of which 3 ms to minimize.
[2024-05-30 21:18:32] [INFO ] Deduced a trap composed of 38 places in 43 ms of which 2 ms to minimize.
[2024-05-30 21:18:32] [INFO ] Deduced a trap composed of 39 places in 30 ms of which 1 ms to minimize.
[2024-05-30 21:18:33] [INFO ] Deduced a trap composed of 125 places in 161 ms of which 2 ms to minimize.
[2024-05-30 21:18:33] [INFO ] Deduced a trap composed of 134 places in 140 ms of which 2 ms to minimize.
[2024-05-30 21:18:33] [INFO ] Deduced a trap composed of 38 places in 40 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/308 variables, 8/49 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-05-30 21:18:33] [INFO ] Deduced a trap composed of 118 places in 141 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/308 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/308 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 11 (OVERLAPS) 2/310 variables, 2/52 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/310 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 13 (OVERLAPS) 650/960 variables, 310/362 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/960 variables, 72/434 constraints. Problems are: Problem set: 0 solved, 14 unsolved
Problem smplace_36 is UNSAT
FORMULA StableMarking TRUE TECHNIQUES RANDOM_WALK SMT_REFINEMENT TOPOLOGICAL
SMT process timed out in 5794ms, After SMT, problems are : Problem set: 0 solved, 14 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 14 out of 312 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 662/662 transitions.
Applied a total of 0 rules in 32 ms. Remains 312 /312 variables (removed 0) and now considering 662/662 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 312/312 places, 662/662 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 662/662 transitions.
Applied a total of 0 rules in 24 ms. Remains 312 /312 variables (removed 0) and now considering 662/662 (removed 0) transitions.
[2024-05-30 21:18:35] [INFO ] Flow matrix only has 650 transitions (discarded 12 similar events)
[2024-05-30 21:18:35] [INFO ] Invariant cache hit.
[2024-05-30 21:18:36] [INFO ] Implicit Places using invariants in 635 ms returned [79, 157, 178, 180, 275, 286]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 640 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 306/312 places, 662/662 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 302 transition count 658
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 302 transition count 658
Applied a total of 8 rules in 21 ms. Remains 302 /306 variables (removed 4) and now considering 658/662 (removed 4) transitions.
[2024-05-30 21:18:36] [INFO ] Flow matrix only has 646 transitions (discarded 12 similar events)
// Phase 1: matrix 646 rows 302 cols
[2024-05-30 21:18:36] [INFO ] Computed 38 invariants in 10 ms
[2024-05-30 21:18:36] [INFO ] Implicit Places using invariants in 389 ms returned []
[2024-05-30 21:18:36] [INFO ] Flow matrix only has 646 transitions (discarded 12 similar events)
[2024-05-30 21:18:36] [INFO ] Invariant cache hit.
[2024-05-30 21:18:37] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-30 21:18:40] [INFO ] Implicit Places using invariants and state equation in 3587 ms returned []
Implicit Place search using SMT with State Equation took 3979 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 302/312 places, 658/662 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 4666 ms. Remains : 302/312 places, 658/662 transitions.
Total runtime 260180 ms.
ITS solved all properties within timeout

BK_STOP 1717103920943

--------------------
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="PolyORBLF-PT-S02J04T06"
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 PolyORBLF-PT-S02J04T06, 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 r298-tajo-171654454900138"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-PT-S02J04T06.tgz
mv PolyORBLF-PT-S02J04T06 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 '' StableMarking.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;