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.r135-tall-171631131500646.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 DoubleLock-PT-p3s3, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r135-tall-171631131500646
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.9M
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 15:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 148K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 124K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 19 07:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 19 15:25 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1.4M May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME DoubleLock-PT-p3s3-ReachabilityCardinality-2024-00
FORMULA_NAME DoubleLock-PT-p3s3-ReachabilityCardinality-2024-01
FORMULA_NAME DoubleLock-PT-p3s3-ReachabilityCardinality-2024-02
FORMULA_NAME DoubleLock-PT-p3s3-ReachabilityCardinality-2024-03
FORMULA_NAME DoubleLock-PT-p3s3-ReachabilityCardinality-2024-04
FORMULA_NAME DoubleLock-PT-p3s3-ReachabilityCardinality-2024-05
FORMULA_NAME DoubleLock-PT-p3s3-ReachabilityCardinality-2024-06
FORMULA_NAME DoubleLock-PT-p3s3-ReachabilityCardinality-2024-07
FORMULA_NAME DoubleLock-PT-p3s3-ReachabilityCardinality-2023-08
FORMULA_NAME DoubleLock-PT-p3s3-ReachabilityCardinality-2024-09
FORMULA_NAME DoubleLock-PT-p3s3-ReachabilityCardinality-2024-10
FORMULA_NAME DoubleLock-PT-p3s3-ReachabilityCardinality-2024-11
FORMULA_NAME DoubleLock-PT-p3s3-ReachabilityCardinality-2024-12
FORMULA_NAME DoubleLock-PT-p3s3-ReachabilityCardinality-2024-13
FORMULA_NAME DoubleLock-PT-p3s3-ReachabilityCardinality-2024-14
FORMULA_NAME DoubleLock-PT-p3s3-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716400089183

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleLock-PT-p3s3
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 17:48:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-22 17:48:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 17:48:10] [INFO ] Load time of PNML (sax parser for PT used): 200 ms
[2024-05-22 17:48:10] [INFO ] Transformed 306 places.
[2024-05-22 17:48:10] [INFO ] Transformed 3136 transitions.
[2024-05-22 17:48:10] [INFO ] Parsed PT model containing 306 places and 3136 transitions and 12672 arcs in 342 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 19 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 68 places in 13 ms
Reduce places removed 68 places and 128 transitions.
FORMULA DoubleLock-PT-p3s3-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleLock-PT-p3s3-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleLock-PT-p3s3-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40014 steps (378 resets) in 2045 ms. (19 steps per ms) remains 10/13 properties
FORMULA DoubleLock-PT-p3s3-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleLock-PT-p3s3-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleLock-PT-p3s3-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (68 resets) in 391 ms. (102 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (68 resets) in 134 ms. (296 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (58 resets) in 73 ms. (540 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (56 resets) in 287 ms. (138 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (65 resets) in 128 ms. (310 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (61 resets) in 171 ms. (232 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (63 resets) in 144 ms. (275 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (62 resets) in 95 ms. (416 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (66 resets) in 86 ms. (459 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (63 resets) in 60 ms. (655 steps per ms) remains 10/10 properties
[2024-05-22 17:48:12] [INFO ] Flow matrix only has 2121 transitions (discarded 887 similar events)
// Phase 1: matrix 2121 rows 238 cols
[2024-05-22 17:48:12] [INFO ] Computed 4 invariants in 47 ms
[2024-05-22 17:48:12] [INFO ] State equation strengthened by 143 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem DoubleLock-PT-p3s3-ReachabilityCardinality-2024-01 is UNSAT
FORMULA DoubleLock-PT-p3s3-ReachabilityCardinality-2024-01 TRUE TECHNIQUES SMT_REFINEMENT
Problem DoubleLock-PT-p3s3-ReachabilityCardinality-2024-02 is UNSAT
FORMULA DoubleLock-PT-p3s3-ReachabilityCardinality-2024-02 TRUE TECHNIQUES SMT_REFINEMENT
Problem DoubleLock-PT-p3s3-ReachabilityCardinality-2024-05 is UNSAT
FORMULA DoubleLock-PT-p3s3-ReachabilityCardinality-2024-05 FALSE TECHNIQUES SMT_REFINEMENT
Problem DoubleLock-PT-p3s3-ReachabilityCardinality-2024-09 is UNSAT
FORMULA DoubleLock-PT-p3s3-ReachabilityCardinality-2024-09 FALSE TECHNIQUES SMT_REFINEMENT
Problem DoubleLock-PT-p3s3-ReachabilityCardinality-2024-12 is UNSAT
FORMULA DoubleLock-PT-p3s3-ReachabilityCardinality-2024-12 FALSE TECHNIQUES SMT_REFINEMENT
Problem DoubleLock-PT-p3s3-ReachabilityCardinality-2024-13 is UNSAT
FORMULA DoubleLock-PT-p3s3-ReachabilityCardinality-2024-13 TRUE TECHNIQUES SMT_REFINEMENT
Problem DoubleLock-PT-p3s3-ReachabilityCardinality-2024-14 is UNSAT
FORMULA DoubleLock-PT-p3s3-ReachabilityCardinality-2024-14 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 150/228 variables, 3/3 constraints. Problems are: Problem set: 7 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 1/4 constraints. Problems are: Problem set: 7 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/228 variables, 0/4 constraints. Problems are: Problem set: 7 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 2119/2347 variables, 228/232 constraints. Problems are: Problem set: 7 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2347 variables, 143/375 constraints. Problems are: Problem set: 7 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2347 variables, 0/375 constraints. Problems are: Problem set: 7 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 12/2359 variables, 10/385 constraints. Problems are: Problem set: 7 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2359 variables, 0/385 constraints. Problems are: Problem set: 7 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/2359 variables, 0/385 constraints. Problems are: Problem set: 7 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2359/2359 variables, and 385 constraints, problems are : Problem set: 7 solved, 3 unsolved in 1567 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 238/238 constraints, ReadFeed: 143/143 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 7 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 7 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 183/227 variables, 3/3 constraints. Problems are: Problem set: 7 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/227 variables, 1/4 constraints. Problems are: Problem set: 7 solved, 3 unsolved
[2024-05-22 17:48:14] [INFO ] Deduced a trap composed of 147 places in 337 ms of which 34 ms to minimize.
[2024-05-22 17:48:14] [INFO ] Deduced a trap composed of 98 places in 261 ms of which 2 ms to minimize.
[2024-05-22 17:48:14] [INFO ] Deduced a trap composed of 160 places in 265 ms of which 3 ms to minimize.
[2024-05-22 17:48:15] [INFO ] Deduced a trap composed of 96 places in 284 ms of which 3 ms to minimize.
[2024-05-22 17:48:15] [INFO ] Deduced a trap composed of 158 places in 253 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/227 variables, 5/9 constraints. Problems are: Problem set: 7 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/227 variables, 0/9 constraints. Problems are: Problem set: 7 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 2118/2345 variables, 227/236 constraints. Problems are: Problem set: 7 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2345 variables, 142/378 constraints. Problems are: Problem set: 7 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2345 variables, 0/378 constraints. Problems are: Problem set: 7 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 14/2359 variables, 11/389 constraints. Problems are: Problem set: 7 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2359 variables, 1/390 constraints. Problems are: Problem set: 7 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2359/2359 variables, and 393 constraints, problems are : Problem set: 7 solved, 3 unsolved in 5014 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 238/238 constraints, ReadFeed: 143/143 constraints, PredecessorRefiner: 3/10 constraints, Known Traps: 5/5 constraints]
After SMT, in 6871ms problems are : Problem set: 7 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 44 out of 238 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 238/238 places, 3008/3008 transitions.
Graph (complete) has 5131 edges and 238 vertex of which 237 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.11 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 157 ms. Remains 237 /238 variables (removed 1) and now considering 3008/3008 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 168 ms. Remains : 237/238 places, 3008/3008 transitions.
RANDOM walk for 40009 steps (377 resets) in 265 ms. (150 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (67 resets) in 133 ms. (298 steps per ms) remains 2/3 properties
FORMULA DoubleLock-PT-p3s3-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (73 resets) in 75 ms. (526 steps per ms) remains 2/2 properties
[2024-05-22 17:48:19] [INFO ] Flow matrix only has 2121 transitions (discarded 887 similar events)
// Phase 1: matrix 2121 rows 237 cols
[2024-05-22 17:48:19] [INFO ] Computed 3 invariants in 19 ms
[2024-05-22 17:48:19] [INFO ] State equation strengthened by 143 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 203/226 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/226 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2118/2344 variables, 226/229 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2344 variables, 142/371 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2344 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 14/2358 variables, 11/382 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2358 variables, 1/383 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2358 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/2358 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2358/2358 variables, and 383 constraints, problems are : Problem set: 0 solved, 2 unsolved in 875 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 237/237 constraints, ReadFeed: 143/143 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 203/226 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 17:48:20] [INFO ] Deduced a trap composed of 87 places in 257 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/226 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/226 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 2118/2344 variables, 226/230 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2344 variables, 142/372 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 17:48:21] [INFO ] Deduced a trap composed of 85 places in 262 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/2344 variables, 1/373 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2344 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 14/2358 variables, 11/384 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2358 variables, 1/385 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2358 variables, 2/387 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 17:48:31] [INFO ] Deduced a trap composed of 106 places in 243 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/2358 variables, 1/388 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2358 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/2358 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2358/2358 variables, and 388 constraints, problems are : Problem set: 0 solved, 2 unsolved in 39427 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 237/237 constraints, ReadFeed: 143/143 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints]
After SMT, in 40389ms problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 23 out of 237 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 237/237 places, 3008/3008 transitions.
Applied a total of 0 rules in 82 ms. Remains 237 /237 variables (removed 0) and now considering 3008/3008 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82 ms. Remains : 237/237 places, 3008/3008 transitions.
RANDOM walk for 40002 steps (382 resets) in 204 ms. (195 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (61 resets) in 111 ms. (357 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (65 resets) in 90 ms. (439 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 233124 steps, run timeout after 3001 ms. (steps per millisecond=77 ) properties seen :0 out of 2
Probabilistic random walk after 233124 steps, saw 176765 distinct states, run finished after 3005 ms. (steps per millisecond=77 ) properties seen :0
[2024-05-22 17:49:02] [INFO ] Flow matrix only has 2121 transitions (discarded 887 similar events)
[2024-05-22 17:49:02] [INFO ] Invariant cache hit.
[2024-05-22 17:49:02] [INFO ] State equation strengthened by 143 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 203/226 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/226 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2118/2344 variables, 226/229 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2344 variables, 142/371 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2344 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 14/2358 variables, 11/382 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2358 variables, 1/383 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2358 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/2358 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2358/2358 variables, and 383 constraints, problems are : Problem set: 0 solved, 2 unsolved in 658 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 237/237 constraints, ReadFeed: 143/143 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 203/226 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 17:49:03] [INFO ] Deduced a trap composed of 158 places in 263 ms of which 2 ms to minimize.
[2024-05-22 17:49:04] [INFO ] Deduced a trap composed of 161 places in 254 ms of which 2 ms to minimize.
[2024-05-22 17:49:04] [INFO ] Deduced a trap composed of 173 places in 230 ms of which 2 ms to minimize.
[2024-05-22 17:49:04] [INFO ] Deduced a trap composed of 168 places in 274 ms of which 1 ms to minimize.
[2024-05-22 17:49:04] [INFO ] Deduced a trap composed of 157 places in 246 ms of which 2 ms to minimize.
[2024-05-22 17:49:05] [INFO ] Deduced a trap composed of 171 places in 258 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/226 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 17:49:05] [INFO ] Deduced a trap composed of 105 places in 262 ms of which 2 ms to minimize.
[2024-05-22 17:49:05] [INFO ] Deduced a trap composed of 127 places in 250 ms of which 2 ms to minimize.
[2024-05-22 17:49:06] [INFO ] Deduced a trap composed of 161 places in 260 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/226 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 17:49:06] [INFO ] Deduced a trap composed of 96 places in 238 ms of which 2 ms to minimize.
[2024-05-22 17:49:06] [INFO ] Deduced a trap composed of 169 places in 230 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/226 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/226 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2118/2344 variables, 226/240 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2344 variables, 142/382 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2344 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 14/2358 variables, 11/393 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2358 variables, 1/394 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2358 variables, 2/396 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2358 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/2358 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2358/2358 variables, and 396 constraints, problems are : Problem set: 0 solved, 2 unsolved in 42728 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 237/237 constraints, ReadFeed: 143/143 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 11/11 constraints]
After SMT, in 43431ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 393 ms.
Support contains 23 out of 237 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 237/237 places, 3008/3008 transitions.
Applied a total of 0 rules in 53 ms. Remains 237 /237 variables (removed 0) and now considering 3008/3008 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 237/237 places, 3008/3008 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 237/237 places, 3008/3008 transitions.
Applied a total of 0 rules in 66 ms. Remains 237 /237 variables (removed 0) and now considering 3008/3008 (removed 0) transitions.
[2024-05-22 17:49:46] [INFO ] Flow matrix only has 2121 transitions (discarded 887 similar events)
[2024-05-22 17:49:46] [INFO ] Invariant cache hit.
[2024-05-22 17:49:47] [INFO ] Implicit Places using invariants in 276 ms returned []
[2024-05-22 17:49:47] [INFO ] Flow matrix only has 2121 transitions (discarded 887 similar events)
[2024-05-22 17:49:47] [INFO ] Invariant cache hit.
[2024-05-22 17:49:47] [INFO ] State equation strengthened by 143 read => feed constraints.
[2024-05-22 17:50:05] [INFO ] Implicit Places using invariants and state equation in 18197 ms returned []
Implicit Place search using SMT with State Equation took 18483 ms to find 0 implicit places.
[2024-05-22 17:50:05] [INFO ] Redundant transitions in 171 ms returned []
Running 3006 sub problems to find dead transitions.
[2024-05-22 17:50:05] [INFO ] Flow matrix only has 2121 transitions (discarded 887 similar events)
[2024-05-22 17:50:05] [INFO ] Invariant cache hit.
[2024-05-22 17:50:05] [INFO ] State equation strengthened by 143 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3006 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/235 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3006 unsolved
At refinement iteration 2 (OVERLAPS) 1/236 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 3006 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 236/2358 variables, and 3 constraints, problems are : Problem set: 0 solved, 3006 unsolved in 30073 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/237 constraints, ReadFeed: 0/143 constraints, PredecessorRefiner: 3006/3006 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3006 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3006 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/235 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3006 unsolved
At refinement iteration 2 (OVERLAPS) 1/236 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 3006 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 236/2358 variables, and 3 constraints, problems are : Problem set: 0 solved, 3006 unsolved in 30050 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/237 constraints, ReadFeed: 0/143 constraints, PredecessorRefiner: 0/3006 constraints, Known Traps: 0/0 constraints]
After SMT, in 66852ms problems are : Problem set: 0 solved, 3006 unsolved
Search for dead transitions found 0 dead transitions in 66882ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 85633 ms. Remains : 237/237 places, 3008/3008 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 887 transitions
Reduce isomorphic transitions removed 887 transitions.
Iterating post reduction 0 with 887 rules applied. Total rules applied 887 place count 237 transition count 2121
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 5 Pre rules applied. Total rules applied 887 place count 237 transition count 2116
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 10 rules applied. Total rules applied 897 place count 232 transition count 2116
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 899 place count 231 transition count 2115
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 900 place count 231 transition count 2114
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 901 place count 230 transition count 2114
Applied a total of 901 rules in 115 ms. Remains 230 /237 variables (removed 7) and now considering 2114/3008 (removed 894) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 2114 rows 230 cols
[2024-05-22 17:51:12] [INFO ] Computed 3 invariants in 17 ms
[2024-05-22 17:51:12] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-22 17:51:12] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-22 17:51:13] [INFO ] After 1028ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-22 17:51:14] [INFO ] After 1947ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-22 17:51:15] [INFO ] After 2626ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 2842 ms.
[2024-05-22 17:51:15] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 6 ms.
[2024-05-22 17:51:15] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 237 places, 3008 transitions and 12128 arcs took 15 ms.
[2024-05-22 17:51:15] [INFO ] Flatten gal took : 243 ms
Total runtime 185369 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running DoubleLock-PT-p3s3

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/404/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 237
TRANSITIONS: 3008
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.058s, Sys 0.007s]


SAVING FILE /home/mcc/execution/404/model (.net / .def) ...
EXPORT TIME: [User 0.009s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

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

Process ID: 642
MODEL NAME: /home/mcc/execution/404/model
237 places, 3008 transitions.
Enabling coverability test.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Building monolithic NSF...
Building monolithic NSF...
Building monolithic NSF...
Building monolithic NSF...
Start RS construction.
Start RS construction.
Start RS construction.
Start RS construction.
coverability test failed!!
Convergence in 15 steps.
The state space is infinite.
CANNOT_COMPUTE
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716400283488

--------------------
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 ReachabilityCardinality -timeout 360 -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="DoubleLock-PT-p3s3"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is DoubleLock-PT-p3s3, 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 r135-tall-171631131500646"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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