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-171654454900147.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-S02J04T10, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r298-tajo-171654454900147
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.4M
-rw-r--r-- 1 mcc users 25K Apr 11 16:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 137K Apr 11 16:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 46K Apr 11 16:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 243K Apr 11 16:46 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 9.5K 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 11K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 45K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 58K Apr 11 16:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 293K Apr 11 16:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 93K Apr 11 16:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 478K Apr 11 16:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.0K 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 906K 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 QuasiLiveness

=== Now, execution of the tool begins

BK_START 1717103721266

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=PolyORBLF-PT-S02J04T10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-30 21:15:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2024-05-30 21:15:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 21:15:22] [INFO ] Load time of PNML (sax parser for PT used): 144 ms
[2024-05-30 21:15:23] [INFO ] Transformed 752 places.
[2024-05-30 21:15:23] [INFO ] Transformed 1572 transitions.
[2024-05-30 21:15:23] [INFO ] Parsed PT model containing 752 places and 1572 transitions and 7262 arcs in 277 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 752/752 places, 1572/1572 transitions.
Ensure Unique test removed 2 places
Ensure Unique test removed 160 transitions
Reduce isomorphic transitions removed 160 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 90 transitions
Trivial Post-agglo rules discarded 90 transitions
Performed 90 trivial Post agglomeration. Transition count delta: 90
Iterating post reduction 0 with 252 rules applied. Total rules applied 252 place count 750 transition count 1322
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 1 with 90 rules applied. Total rules applied 342 place count 660 transition count 1322
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 80 Pre rules applied. Total rules applied 342 place count 660 transition count 1242
Deduced a syphon composed of 80 places in 9 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 502 place count 580 transition count 1242
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 6 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 662 place count 500 transition count 1162
Applied a total of 662 rules in 166 ms. Remains 500 /752 variables (removed 252) and now considering 1162/1572 (removed 410) transitions.
Running 1160 sub problems to find dead transitions.
[2024-05-30 21:15:23] [INFO ] Flow matrix only has 1142 transitions (discarded 20 similar events)
// Phase 1: matrix 1142 rows 500 cols
[2024-05-30 21:15:23] [INFO ] Computed 52 invariants in 59 ms
[2024-05-30 21:15:23] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/498 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/498 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1160 unsolved
[2024-05-30 21:15:34] [INFO ] Deduced a trap composed of 41 places in 156 ms of which 28 ms to minimize.
[2024-05-30 21:15:34] [INFO ] Deduced a trap composed of 40 places in 115 ms of which 2 ms to minimize.
[2024-05-30 21:15:34] [INFO ] Deduced a trap composed of 41 places in 100 ms of which 2 ms to minimize.
[2024-05-30 21:15:34] [INFO ] Deduced a trap composed of 40 places in 64 ms of which 1 ms to minimize.
[2024-05-30 21:15:34] [INFO ] Deduced a trap composed of 41 places in 71 ms of which 1 ms to minimize.
[2024-05-30 21:15:34] [INFO ] Deduced a trap composed of 40 places in 61 ms of which 1 ms to minimize.
[2024-05-30 21:15:35] [INFO ] Deduced a trap composed of 40 places in 53 ms of which 1 ms to minimize.
[2024-05-30 21:15:35] [INFO ] Deduced a trap composed of 41 places in 47 ms of which 2 ms to minimize.
[2024-05-30 21:15:35] [INFO ] Deduced a trap composed of 41 places in 39 ms of which 1 ms to minimize.
[2024-05-30 21:15:35] [INFO ] Deduced a trap composed of 40 places in 44 ms of which 0 ms to minimize.
[2024-05-30 21:15:35] [INFO ] Deduced a trap composed of 54 places in 287 ms of which 5 ms to minimize.
[2024-05-30 21:15:35] [INFO ] Deduced a trap composed of 224 places in 313 ms of which 4 ms to minimize.
[2024-05-30 21:15:36] [INFO ] Deduced a trap composed of 91 places in 277 ms of which 4 ms to minimize.
[2024-05-30 21:15:36] [INFO ] Deduced a trap composed of 204 places in 242 ms of which 3 ms to minimize.
[2024-05-30 21:15:37] [INFO ] Deduced a trap composed of 185 places in 232 ms of which 3 ms to minimize.
[2024-05-30 21:15:37] [INFO ] Deduced a trap composed of 192 places in 235 ms of which 3 ms to minimize.
[2024-05-30 21:15:37] [INFO ] Deduced a trap composed of 183 places in 229 ms of which 3 ms to minimize.
[2024-05-30 21:15:38] [INFO ] Deduced a trap composed of 37 places in 253 ms of which 4 ms to minimize.
[2024-05-30 21:15:38] [INFO ] Deduced a trap composed of 306 places in 269 ms of which 4 ms to minimize.
[2024-05-30 21:15:41] [INFO ] Deduced a trap composed of 79 places in 186 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/498 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 1160 unsolved
[2024-05-30 21:15:43] [INFO ] Deduced a trap composed of 198 places in 282 ms of which 4 ms to minimize.
[2024-05-30 21:15:43] [INFO ] Deduced a trap composed of 182 places in 283 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 498/1642 variables, and 72 constraints, problems are : Problem set: 0 solved, 1160 unsolved in 20084 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 38/40 constraints, State Equation: 0/500 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1160/1160 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1160 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/498 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/498 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1160 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/498 variables, 22/72 constraints. Problems are: Problem set: 0 solved, 1160 unsolved
[2024-05-30 21:15:55] [INFO ] Deduced a trap composed of 41 places in 139 ms of which 2 ms to minimize.
[2024-05-30 21:15:55] [INFO ] Deduced a trap composed of 38 places in 103 ms of which 2 ms to minimize.
[2024-05-30 21:15:57] [INFO ] Deduced a trap composed of 42 places in 163 ms of which 2 ms to minimize.
[2024-05-30 21:15:58] [INFO ] Deduced a trap composed of 23 places in 143 ms of which 2 ms to minimize.
[2024-05-30 21:16:01] [INFO ] Deduced a trap composed of 232 places in 338 ms of which 3 ms to minimize.
[2024-05-30 21:16:01] [INFO ] Deduced a trap composed of 242 places in 283 ms of which 3 ms to minimize.
[2024-05-30 21:16:01] [INFO ] Deduced a trap composed of 192 places in 226 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 498/1642 variables, and 79 constraints, problems are : Problem set: 0 solved, 1160 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 38/40 constraints, State Equation: 0/500 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1160 constraints, Known Traps: 29/29 constraints]
After SMT, in 42200ms problems are : Problem set: 0 solved, 1160 unsolved
Search for dead transitions found 0 dead transitions in 42245ms
[2024-05-30 21:16:05] [INFO ] Flow matrix only has 1142 transitions (discarded 20 similar events)
[2024-05-30 21:16:05] [INFO ] Invariant cache hit.
[2024-05-30 21:16:06] [INFO ] Implicit Places using invariants in 525 ms returned [3, 59, 123, 176, 257, 286, 346, 380, 388, 448]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 532 ms to find 10 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 490/752 places, 1162/1572 transitions.
Applied a total of 0 rules in 11 ms. Remains 490 /490 variables (removed 0) and now considering 1162/1162 (removed 0) transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 43009 ms. Remains : 490/752 places, 1162/1572 transitions.
Initial state reduction rules removed 2 formulas.
RANDOM walk for 40000 steps (14 resets) in 3360 ms. (11 steps per ms) remains 164/1160 properties
BEST_FIRST walk for 401 steps (8 resets) in 9 ms. (40 steps per ms) remains 164/164 properties
BEST_FIRST walk for 402 steps (8 resets) in 8 ms. (44 steps per ms) remains 164/164 properties
BEST_FIRST walk for 402 steps (8 resets) in 8 ms. (44 steps per ms) remains 164/164 properties
BEST_FIRST walk for 402 steps (8 resets) in 16 ms. (23 steps per ms) remains 164/164 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 164/164 properties
BEST_FIRST walk for 402 steps (8 resets) in 9 ms. (40 steps per ms) remains 164/164 properties
BEST_FIRST walk for 402 steps (8 resets) in 13 ms. (28 steps per ms) remains 164/164 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 164/164 properties
BEST_FIRST walk for 402 steps (8 resets) in 11 ms. (33 steps per ms) remains 164/164 properties
BEST_FIRST walk for 402 steps (8 resets) in 10 ms. (36 steps per ms) remains 164/164 properties
BEST_FIRST walk for 402 steps (8 resets) in 8 ms. (44 steps per ms) remains 164/164 properties
BEST_FIRST walk for 402 steps (8 resets) in 13 ms. (28 steps per ms) remains 164/164 properties
BEST_FIRST walk for 401 steps (8 resets) in 8 ms. (44 steps per ms) remains 164/164 properties
BEST_FIRST walk for 402 steps (8 resets) in 9 ms. (40 steps per ms) remains 164/164 properties
BEST_FIRST walk for 402 steps (8 resets) in 11 ms. (33 steps per ms) remains 164/164 properties
BEST_FIRST walk for 402 steps (8 resets) in 14 ms. (26 steps per ms) remains 164/164 properties
BEST_FIRST walk for 402 steps (8 resets) in 10 ms. (36 steps per ms) remains 164/164 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 164/164 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 164/164 properties
BEST_FIRST walk for 400 steps (8 resets) in 10 ms. (36 steps per ms) remains 164/164 properties
BEST_FIRST walk for 402 steps (8 resets) in 8 ms. (44 steps per ms) remains 164/164 properties
BEST_FIRST walk for 400 steps (8 resets) in 9 ms. (40 steps per ms) remains 164/164 properties
BEST_FIRST walk for 401 steps (8 resets) in 9 ms. (40 steps per ms) remains 164/164 properties
BEST_FIRST walk for 402 steps (8 resets) in 10 ms. (36 steps per ms) remains 164/164 properties
BEST_FIRST walk for 401 steps (8 resets) in 8 ms. (44 steps per ms) remains 164/164 properties
BEST_FIRST walk for 401 steps (8 resets) in 9 ms. (40 steps per ms) remains 164/164 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 164/164 properties
BEST_FIRST walk for 402 steps (8 resets) in 8 ms. (44 steps per ms) remains 164/164 properties
BEST_FIRST walk for 402 steps (8 resets) in 7 ms. (50 steps per ms) remains 164/164 properties
BEST_FIRST walk for 402 steps (8 resets) in 6 ms. (57 steps per ms) remains 164/164 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 164/164 properties
BEST_FIRST walk for 402 steps (8 resets) in 7 ms. (50 steps per ms) remains 164/164 properties
BEST_FIRST walk for 402 steps (8 resets) in 6 ms. (57 steps per ms) remains 164/164 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 164/164 properties
BEST_FIRST walk for 403 steps (8 resets) in 11 ms. (33 steps per ms) remains 164/164 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 164/164 properties
BEST_FIRST walk for 402 steps (8 resets) in 7 ms. (50 steps per ms) remains 164/164 properties
BEST_FIRST walk for 402 steps (8 resets) in 8 ms. (44 steps per ms) remains 164/164 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 164/164 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 164/164 properties
BEST_FIRST walk for 402 steps (8 resets) in 8 ms. (44 steps per ms) remains 164/164 properties
BEST_FIRST walk for 402 steps (8 resets) in 8 ms. (44 steps per ms) remains 164/164 properties
BEST_FIRST walk for 401 steps (8 resets) in 7 ms. (50 steps per ms) remains 164/164 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 164/164 properties
BEST_FIRST walk for 402 steps (8 resets) in 7 ms. (50 steps per ms) remains 164/164 properties
BEST_FIRST walk for 401 steps (8 resets) in 8 ms. (44 steps per ms) remains 164/164 properties
BEST_FIRST walk for 402 steps (8 resets) in 8 ms. (44 steps per ms) remains 164/164 properties
BEST_FIRST walk for 401 steps (8 resets) in 7 ms. (50 steps per ms) remains 164/164 properties
BEST_FIRST walk for 402 steps (8 resets) in 6 ms. (57 steps per ms) remains 164/164 properties
BEST_FIRST walk for 402 steps (8 resets) in 4 ms. (80 steps per ms) remains 164/164 properties
[2024-05-30 21:16:07] [INFO ] Flow matrix only has 1142 transitions (discarded 20 similar events)
// Phase 1: matrix 1142 rows 490 cols
[2024-05-30 21:16:07] [INFO ] Computed 42 invariants in 31 ms
[2024-05-30 21:16:07] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (OVERLAPS) 2/72 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 164 unsolved
Problem qltransition_1 is UNSAT
FORMULA QuasiLiveness FALSE TECHNIQUES RANDOM_WALK SMT_REFINEMENT TOPOLOGICAL INITIAL_STATE
SMT process timed out in 1347ms, After SMT, problems are : Problem set: 0 solved, 164 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 70 out of 490 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 490/490 places, 1162/1162 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 481 transition count 1153
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 481 transition count 1153
Applied a total of 18 rules in 104 ms. Remains 481 /490 variables (removed 9) and now considering 1153/1162 (removed 9) transitions.
Running 1151 sub problems to find dead transitions.
[2024-05-30 21:16:08] [INFO ] Flow matrix only has 1133 transitions (discarded 20 similar events)
// Phase 1: matrix 1133 rows 481 cols
[2024-05-30 21:16:08] [INFO ] Computed 42 invariants in 28 ms
[2024-05-30 21:16:08] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/479 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1151 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/479 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 1151 unsolved
[2024-05-30 21:16:17] [INFO ] Deduced a trap composed of 40 places in 98 ms of which 2 ms to minimize.
[2024-05-30 21:16:17] [INFO ] Deduced a trap composed of 41 places in 95 ms of which 2 ms to minimize.
[2024-05-30 21:16:17] [INFO ] Deduced a trap composed of 41 places in 90 ms of which 1 ms to minimize.
[2024-05-30 21:16:17] [INFO ] Deduced a trap composed of 40 places in 60 ms of which 1 ms to minimize.
[2024-05-30 21:16:17] [INFO ] Deduced a trap composed of 40 places in 60 ms of which 2 ms to minimize.
[2024-05-30 21:16:17] [INFO ] Deduced a trap composed of 40 places in 41 ms of which 2 ms to minimize.
[2024-05-30 21:16:17] [INFO ] Deduced a trap composed of 40 places in 55 ms of which 3 ms to minimize.
[2024-05-30 21:16:18] [INFO ] Deduced a trap composed of 40 places in 52 ms of which 1 ms to minimize.
[2024-05-30 21:16:18] [INFO ] Deduced a trap composed of 41 places in 46 ms of which 1 ms to minimize.
[2024-05-30 21:16:18] [INFO ] Deduced a trap composed of 40 places in 38 ms of which 0 ms to minimize.
[2024-05-30 21:16:18] [INFO ] Deduced a trap composed of 112 places in 285 ms of which 4 ms to minimize.
[2024-05-30 21:16:19] [INFO ] Deduced a trap composed of 197 places in 284 ms of which 3 ms to minimize.
[2024-05-30 21:16:19] [INFO ] Deduced a trap composed of 42 places in 149 ms of which 2 ms to minimize.
[2024-05-30 21:16:19] [INFO ] Deduced a trap composed of 187 places in 242 ms of which 3 ms to minimize.
[2024-05-30 21:16:19] [INFO ] Deduced a trap composed of 176 places in 251 ms of which 3 ms to minimize.
[2024-05-30 21:16:20] [INFO ] Deduced a trap composed of 108 places in 205 ms of which 3 ms to minimize.
[2024-05-30 21:16:20] [INFO ] Deduced a trap composed of 67 places in 166 ms of which 2 ms to minimize.
[2024-05-30 21:16:25] [INFO ] Deduced a trap composed of 291 places in 246 ms of which 3 ms to minimize.
[2024-05-30 21:16:26] [INFO ] Deduced a trap composed of 295 places in 253 ms of which 4 ms to minimize.
[2024-05-30 21:16:26] [INFO ] Deduced a trap composed of 309 places in 256 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/479 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1151 unsolved
[2024-05-30 21:16:29] [INFO ] Deduced a trap composed of 293 places in 266 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 479/1614 variables, and 61 constraints, problems are : Problem set: 0 solved, 1151 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/481 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1151/1151 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1151 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/479 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1151 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/479 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 1151 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/479 variables, 21/61 constraints. Problems are: Problem set: 0 solved, 1151 unsolved
[2024-05-30 21:16:40] [INFO ] Deduced a trap composed of 211 places in 271 ms of which 4 ms to minimize.
[2024-05-30 21:16:40] [INFO ] Deduced a trap composed of 212 places in 223 ms of which 3 ms to minimize.
[2024-05-30 21:16:40] [INFO ] Deduced a trap composed of 196 places in 293 ms of which 3 ms to minimize.
[2024-05-30 21:16:40] [INFO ] Deduced a trap composed of 189 places in 280 ms of which 4 ms to minimize.
[2024-05-30 21:16:42] [INFO ] Deduced a trap composed of 42 places in 140 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 1)
(s3 0)
(s4 1)
(s5 1)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 10)
(s30 0)
(s31 0)
(s32 0)
(s33 1)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 1)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 9)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 1)
(s81 0)
(s82 0)
(s83 0)
(s84 7)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 1)
(s96 0)
(s97 0)
(s98 1)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 1)
(s158 0)
(s159 0)
(s160 0)
(s161 1)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 1)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 1)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 1)
(s200 1)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 1)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 1)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 1)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 1)
(s309 0)
(s310 0)
(s311 0)
(s312 1)
(s313 0)
(s314 3)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 1)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 1)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 0)
(s349 0)
(s350 0)
(s351 0)
(s352 0)
(s353 0)
(s354 0)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 1)
(s369 0)
(s370 0)
(s371 0)
(s372 0)
(s373 0)
(s374 0)
(s375 0)
(s376 0)
(s377 0)
(s378 0)
(s379 0)
(s380 0)
(s381 1)
(s382 0)
(s383 0)
(s384 0)
(s385 0)
(s386 0)
(s387 0)
(s388 1)
(s389 0)
(s390 0)
(s391 0)
(s392 1)
(s393 0)
(s394 0)
(s395 0)
(s396 0)
(s397 0)
(s398 0)
(s399 1)
(s400 0)
(s401 0)
(s402 0)
(s403 0)
(s404 1)
(s405 0)
(s406 0)
(s407 0)
(s408 0)
(s409 0)
(s410 0)
(s411 0)
(s412 0)
(s413 0)
(s414 0)
(s415 0)
(s416 0)
(s417 9)
(s418 0)
(s419 0)
(s420 0)
(s421 0)
(s422 0)
(s423 0)
(s424 0)
(s425 0)
(s426 0)
(s427 0)
(s428 0)
(s429 0)
(s430 0)
(s431 0)
(s432 0)
(s433 0)
(s434 0)
(s435 0)
(s436 0)
(s437 0)
(s438 0)
(s439 0)
(s440 0)
(s441 0)
(s442 0)
(s443 0)
(s444 0)
(s445 0)
(s446 0)
(s447 0)
(s448 0)
(s449 0)
(s450 0)
(s451 0)
(s452 0)
(s453 0)
(s454 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 479/1614 variables, and 66 constraints, problems are : Problem set: 0 solved, 1151 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/481 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1151 constraints, Known Traps: 26/26 constraints]
After SMT, in 41711ms problems are : Problem set: 0 solved, 1151 unsolved
Search for dead transitions found 0 dead transitions in 41721ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41829 ms. Remains : 481/490 places, 1153/1162 transitions.
Total runtime 87807 ms.
ITS solved all properties within timeout

BK_STOP 1717103810600

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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 QuasiLiveness -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-S02J04T10"
export BK_EXAMINATION="QuasiLiveness"
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-S02J04T10, examination is QuasiLiveness"
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-171654454900147"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-PT-S02J04T10.tgz
mv PolyORBLF-PT-S02J04T10 execution
cd execution
if [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "UpperBounds" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] || [ "QuasiLiveness" = "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 [ "QuasiLiveness" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "QuasiLiveness" != "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 "QuasiLiveness.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property QuasiLiveness.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "QuasiLiveness.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 '' QuasiLiveness.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] ; then
echo "FORMULA_NAME QuasiLiveness"
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 ;