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.r289-tajo-171654445600305.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-S04J06T10, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r289-tajo-171654445600305
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.0M
-rw-r--r-- 1 mcc users 21K Apr 11 16:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 119K Apr 11 16:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 69K Apr 11 16:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 339K 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 6.3K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 14K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 51K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 21K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 77K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 50K Apr 11 17:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 256K Apr 11 17:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 113K Apr 11 17:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 540K Apr 11 17:07 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 4.6K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 9.6K Apr 23 07:44 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 4.3M May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716867534945

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-PT-S04J06T10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 03:38:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-28 03:38:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 03:38:57] [INFO ] Load time of PNML (sax parser for PT used): 557 ms
[2024-05-28 03:38:57] [INFO ] Transformed 966 places.
[2024-05-28 03:38:57] [INFO ] Transformed 5354 transitions.
[2024-05-28 03:38:57] [INFO ] Parsed PT model containing 966 places and 5354 transitions and 36134 arcs in 771 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 41 ms.
Ensure Unique test removed 2710 transitions
Reduce redundant transitions removed 2710 transitions.
Support contains 506 out of 966 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 966/966 places, 2644/2644 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 962 transition count 2644
Applied a total of 4 rules in 202 ms. Remains 962 /966 variables (removed 4) and now considering 2644/2644 (removed 0) transitions.
Running 2640 sub problems to find dead transitions.
[2024-05-28 03:38:58] [INFO ] Flow matrix only has 2604 transitions (discarded 40 similar events)
// Phase 1: matrix 2604 rows 962 cols
[2024-05-28 03:38:58] [INFO ] Computed 58 invariants in 236 ms
[2024-05-28 03:38:58] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/958 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2640 unsolved
SMT process timed out in 35907ms, After SMT, problems are : Problem set: 0 solved, 2640 unsolved
Search for dead transitions found 0 dead transitions in 36027ms
[2024-05-28 03:39:34] [INFO ] Flow matrix only has 2604 transitions (discarded 40 similar events)
[2024-05-28 03:39:34] [INFO ] Invariant cache hit.
[2024-05-28 03:39:35] [INFO ] Implicit Places using invariants in 1209 ms returned []
[2024-05-28 03:39:35] [INFO ] Flow matrix only has 2604 transitions (discarded 40 similar events)
[2024-05-28 03:39:35] [INFO ] Invariant cache hit.
[2024-05-28 03:39:38] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-05-28 03:40:09] [INFO ] Performed 885/962 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-28 03:40:12] [INFO ] Implicit Places using invariants and state equation in 37587 ms returned []
Implicit Place search using SMT with State Equation took 38831 ms to find 0 implicit places.
Running 2640 sub problems to find dead transitions.
[2024-05-28 03:40:12] [INFO ] Flow matrix only has 2604 transitions (discarded 40 similar events)
[2024-05-28 03:40:12] [INFO ] Invariant cache hit.
[2024-05-28 03:40:12] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/958 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2640 unsolved
SMT process timed out in 43097ms, After SMT, problems are : Problem set: 0 solved, 2640 unsolved
Search for dead transitions found 0 dead transitions in 43134ms
Starting structural reductions in LTL mode, iteration 1 : 962/966 places, 2644/2644 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 118372 ms. Remains : 962/966 places, 2644/2644 transitions.
Support contains 506 out of 962 places after structural reductions.
[2024-05-28 03:40:56] [INFO ] Flatten gal took : 243 ms
[2024-05-28 03:40:56] [INFO ] Flatten gal took : 208 ms
[2024-05-28 03:40:57] [INFO ] Input system was already deterministic with 2644 transitions.
Support contains 502 out of 962 places (down from 506) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 3428 ms. (11 steps per ms) remains 62/88 properties
BEST_FIRST walk for 4002 steps (8 resets) in 146 ms. (27 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4002 steps (8 resets) in 140 ms. (28 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4002 steps (8 resets) in 53 ms. (74 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4003 steps (8 resets) in 72 ms. (54 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4003 steps (8 resets) in 52 ms. (75 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4002 steps (8 resets) in 81 ms. (48 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4002 steps (8 resets) in 71 ms. (55 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4001 steps (8 resets) in 73 ms. (54 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4002 steps (8 resets) in 66 ms. (59 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4003 steps (8 resets) in 56 ms. (70 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4003 steps (8 resets) in 86 ms. (46 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4003 steps (8 resets) in 90 ms. (43 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4002 steps (8 resets) in 77 ms. (51 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4001 steps (8 resets) in 42 ms. (93 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4003 steps (8 resets) in 48 ms. (81 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4002 steps (8 resets) in 88 ms. (44 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4002 steps (8 resets) in 93 ms. (42 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4002 steps (8 resets) in 75 ms. (52 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4002 steps (8 resets) in 110 ms. (36 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4002 steps (8 resets) in 89 ms. (44 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4002 steps (8 resets) in 82 ms. (48 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4003 steps (8 resets) in 130 ms. (30 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4001 steps (8 resets) in 62 ms. (63 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (8 resets) in 97 ms. (40 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4001 steps (8 resets) in 57 ms. (68 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4002 steps (8 resets) in 65 ms. (60 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4003 steps (8 resets) in 129 ms. (30 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4003 steps (8 resets) in 64 ms. (61 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4003 steps (8 resets) in 83 ms. (47 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4003 steps (8 resets) in 78 ms. (50 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4003 steps (8 resets) in 69 ms. (57 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4003 steps (8 resets) in 62 ms. (63 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4003 steps (8 resets) in 61 ms. (64 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4001 steps (8 resets) in 94 ms. (42 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4003 steps (8 resets) in 69 ms. (57 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4001 steps (8 resets) in 68 ms. (57 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4003 steps (8 resets) in 76 ms. (51 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4002 steps (8 resets) in 79 ms. (50 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4001 steps (8 resets) in 64 ms. (61 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4002 steps (8 resets) in 66 ms. (59 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4002 steps (8 resets) in 50 ms. (78 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4003 steps (8 resets) in 87 ms. (45 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4002 steps (8 resets) in 81 ms. (48 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4003 steps (8 resets) in 104 ms. (38 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4001 steps (8 resets) in 75 ms. (52 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4001 steps (8 resets) in 45 ms. (86 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4002 steps (8 resets) in 43 ms. (90 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4003 steps (8 resets) in 61 ms. (64 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4002 steps (8 resets) in 69 ms. (57 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4001 steps (8 resets) in 117 ms. (33 steps per ms) remains 62/62 properties
[2024-05-28 03:41:00] [INFO ] Flow matrix only has 2604 transitions (discarded 40 similar events)
[2024-05-28 03:41:00] [INFO ] Invariant cache hit.
[2024-05-28 03:41:00] [INFO ] State equation strengthened by 200 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/439 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/439 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 62 unsolved
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp46 is UNSAT
Problem AtomicPropp52 is UNSAT
Problem AtomicPropp53 is UNSAT
Problem AtomicPropp58 is UNSAT
Problem AtomicPropp62 is UNSAT
Problem AtomicPropp65 is UNSAT
Problem AtomicPropp71 is UNSAT
Problem AtomicPropp82 is UNSAT
Problem AtomicPropp84 is UNSAT
At refinement iteration 2 (OVERLAPS) 149/588 variables, 17/19 constraints. Problems are: Problem set: 17 solved, 45 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/588 variables, 1/20 constraints. Problems are: Problem set: 17 solved, 45 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/588 variables, 0/20 constraints. Problems are: Problem set: 17 solved, 45 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp48 is UNSAT
Problem AtomicPropp51 is UNSAT
Problem AtomicPropp54 is UNSAT
Problem AtomicPropp55 is UNSAT
Problem AtomicPropp59 is UNSAT
Problem AtomicPropp63 is UNSAT
Problem AtomicPropp64 is UNSAT
Problem AtomicPropp66 is UNSAT
Problem AtomicPropp69 is UNSAT
Problem AtomicPropp72 is UNSAT
Problem AtomicPropp73 is UNSAT
Problem AtomicPropp74 is UNSAT
Problem AtomicPropp77 is UNSAT
Problem AtomicPropp83 is UNSAT
Problem AtomicPropp85 is UNSAT
At refinement iteration 5 (OVERLAPS) 373/961 variables, 37/57 constraints. Problems are: Problem set: 59 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/961 variables, 0/57 constraints. Problems are: Problem set: 59 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 1/962 variables, 1/58 constraints. Problems are: Problem set: 59 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/962 variables, 0/58 constraints. Problems are: Problem set: 59 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3566/3566 variables, and 1020 constraints, problems are : Problem set: 59 solved, 3 unsolved in 5017 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 40/40 constraints, State Equation: 962/962 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 62/62 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 59 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 59 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 63/71 variables, 2/2 constraints. Problems are: Problem set: 59 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/2 constraints. Problems are: Problem set: 59 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 4/75 variables, 1/3 constraints. Problems are: Problem set: 59 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 0/3 constraints. Problems are: Problem set: 59 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 59/134 variables, 1/4 constraints. Problems are: Problem set: 59 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 0/4 constraints. Problems are: Problem set: 59 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 20/154 variables, 5/9 constraints. Problems are: Problem set: 59 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/154 variables, 0/9 constraints. Problems are: Problem set: 59 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 172/326 variables, 4/13 constraints. Problems are: Problem set: 59 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/326 variables, 0/13 constraints. Problems are: Problem set: 59 solved, 3 unsolved
Problem AtomicPropp57 is UNSAT
At refinement iteration 11 (OVERLAPS) 604/930 variables, 28/41 constraints. Problems are: Problem set: 60 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/930 variables, 0/41 constraints. Problems are: Problem set: 60 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 4/934 variables, 4/45 constraints. Problems are: Problem set: 60 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/934 variables, 0/45 constraints. Problems are: Problem set: 60 solved, 2 unsolved
Problem AtomicPropp39 is UNSAT
At refinement iteration 15 (OVERLAPS) 26/960 variables, 12/57 constraints. Problems are: Problem set: 61 solved, 1 unsolved
[2024-05-28 03:41:07] [INFO ] Deduced a trap composed of 83 places in 616 ms of which 66 ms to minimize.
[2024-05-28 03:41:08] [INFO ] Deduced a trap composed of 83 places in 750 ms of which 15 ms to minimize.
[2024-05-28 03:41:08] [INFO ] Deduced a trap composed of 83 places in 507 ms of which 5 ms to minimize.
[2024-05-28 03:41:08] [INFO ] Deduced a trap composed of 84 places in 279 ms of which 3 ms to minimize.
[2024-05-28 03:41:09] [INFO ] Deduced a trap composed of 83 places in 296 ms of which 3 ms to minimize.
[2024-05-28 03:41:09] [INFO ] Deduced a trap composed of 83 places in 261 ms of which 5 ms to minimize.
[2024-05-28 03:41:12] [INFO ] Deduced a trap composed of 84 places in 2871 ms of which 7 ms to minimize.
SMT process timed out in 11947ms, After SMT, problems are : Problem set: 61 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 962 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 962/962 places, 2644/2644 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 90 rules applied. Total rules applied 90 place count 962 transition count 2554
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 1 with 90 rules applied. Total rules applied 180 place count 872 transition count 2554
Performed 120 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 120 Pre rules applied. Total rules applied 180 place count 872 transition count 2434
Deduced a syphon composed of 120 places in 5 ms
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 2 with 240 rules applied. Total rules applied 420 place count 752 transition count 2434
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 3 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 620 place count 652 transition count 2334
Free-agglomeration rule (complex) applied 20 times.
Iterating global reduction 2 with 20 rules applied. Total rules applied 640 place count 652 transition count 2314
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 660 place count 632 transition count 2314
Applied a total of 660 rules in 383 ms. Remains 632 /962 variables (removed 330) and now considering 2314/2644 (removed 330) transitions.
Running 2310 sub problems to find dead transitions.
[2024-05-28 03:41:12] [INFO ] Flow matrix only has 2274 transitions (discarded 40 similar events)
// Phase 1: matrix 2274 rows 632 cols
[2024-05-28 03:41:12] [INFO ] Computed 58 invariants in 51 ms
[2024-05-28 03:41:12] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/628 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2310 unsolved
SMT process timed out in 39243ms, After SMT, problems are : Problem set: 0 solved, 2310 unsolved
Search for dead transitions found 0 dead transitions in 39274ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39665 ms. Remains : 632/962 places, 2314/2644 transitions.
RANDOM walk for 40000 steps (8 resets) in 831 ms. (48 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 302 ms. (132 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 135650 steps, run timeout after 3001 ms. (steps per millisecond=45 ) properties seen :0 out of 1
Probabilistic random walk after 135650 steps, saw 103809 distinct states, run finished after 3005 ms. (steps per millisecond=45 ) properties seen :0
[2024-05-28 03:41:55] [INFO ] Flow matrix only has 2274 transitions (discarded 40 similar events)
[2024-05-28 03:41:55] [INFO ] Invariant cache hit.
[2024-05-28 03:41:55] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 232/233 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/233 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 183/416 variables, 11/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/416 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 12/428 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/428 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 201/629 variables, 38/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 03:41:55] [INFO ] Deduced a trap composed of 50 places in 194 ms of which 4 ms to minimize.
[2024-05-28 03:41:56] [INFO ] Deduced a trap composed of 50 places in 180 ms of which 2 ms to minimize.
[2024-05-28 03:41:56] [INFO ] Deduced a trap composed of 50 places in 271 ms of which 2 ms to minimize.
[2024-05-28 03:41:56] [INFO ] Deduced a trap composed of 51 places in 114 ms of which 2 ms to minimize.
[2024-05-28 03:41:56] [INFO ] Deduced a trap composed of 51 places in 114 ms of which 1 ms to minimize.
[2024-05-28 03:41:56] [INFO ] Deduced a trap composed of 50 places in 147 ms of which 1 ms to minimize.
[2024-05-28 03:41:57] [INFO ] Deduced a trap composed of 50 places in 103 ms of which 1 ms to minimize.
[2024-05-28 03:41:57] [INFO ] Deduced a trap composed of 51 places in 64 ms of which 0 ms to minimize.
[2024-05-28 03:41:57] [INFO ] Deduced a trap composed of 51 places in 64 ms of which 1 ms to minimize.
Problem AtomicPropp79 is UNSAT
After SMT solving in domain Real declared 629/2906 variables, and 65 constraints, problems are : Problem set: 1 solved, 0 unsolved in 1674 ms.
Refiners :[Positive P Invariants (semi-flows): 15/17 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 0/632 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 9/9 constraints]
After SMT, in 1698ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 62 atomic propositions for a total of 16 simplifications.
FORMULA PolyORBLF-PT-S04J06T10-CTLCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J06T10-CTLCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J06T10-CTLCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J06T10-CTLCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J06T10-CTLCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 03:41:57] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2024-05-28 03:41:57] [INFO ] Flatten gal took : 270 ms
FORMULA PolyORBLF-PT-S04J06T10-CTLCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J06T10-CTLCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 03:41:57] [INFO ] Flatten gal took : 270 ms
[2024-05-28 03:41:58] [INFO ] Input system was already deterministic with 2644 transitions.
Support contains 30 out of 962 places (down from 46) after GAL structural reductions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 962/962 places, 2644/2644 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 952 transition count 2634
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 952 transition count 2634
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 30 place count 942 transition count 2624
Iterating global reduction 0 with 10 rules applied. Total rules applied 40 place count 942 transition count 2624
Applied a total of 40 rules in 127 ms. Remains 942 /962 variables (removed 20) and now considering 2624/2644 (removed 20) transitions.
Running 2620 sub problems to find dead transitions.
[2024-05-28 03:41:58] [INFO ] Flow matrix only has 2584 transitions (discarded 40 similar events)
// Phase 1: matrix 2584 rows 942 cols
[2024-05-28 03:41:58] [INFO ] Computed 58 invariants in 97 ms
[2024-05-28 03:41:58] [INFO ] State equation strengthened by 200 read => feed constraints.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running PolyORBLF-PT-S04J06T10

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 966
TRANSITIONS: 5354
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.318s, Sys 0.019s]


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


----------------------------------------------------------------------
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: 652
MODEL NAME: /home/mcc/execution/model
966 places, 5354 transitions.

No place bound informations found.
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
No place bound informations found.
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.

BK_TIME_CONFINEMENT_REACHED

--------------------
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 CTLCardinality -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="PolyORBLF-PT-S04J06T10"
export BK_EXAMINATION="CTLCardinality"
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 PolyORBLF-PT-S04J06T10, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r289-tajo-171654445600305"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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