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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 11M
-rw-r--r-- 1 mcc users 13K Apr 11 17:34 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K Apr 11 17:34 CTLCardinality.xml
-rw-r--r-- 1 mcc users 221K Apr 11 17:32 CTLFireability.txt
-rw-r--r-- 1 mcc users 912K Apr 11 17:32 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 8.9K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 38K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 112K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 343K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 19K Apr 11 17:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Apr 11 17:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 291K Apr 11 17:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.2M Apr 11 17:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.7K 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 6.8M 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-S06J04T04-CTLFireability-2024-00
FORMULA_NAME PolyORBLF-PT-S06J04T04-CTLFireability-2024-01
FORMULA_NAME PolyORBLF-PT-S06J04T04-CTLFireability-2024-02
FORMULA_NAME PolyORBLF-PT-S06J04T04-CTLFireability-2024-03
FORMULA_NAME PolyORBLF-PT-S06J04T04-CTLFireability-2024-04
FORMULA_NAME PolyORBLF-PT-S06J04T04-CTLFireability-2024-05
FORMULA_NAME PolyORBLF-PT-S06J04T04-CTLFireability-2024-06
FORMULA_NAME PolyORBLF-PT-S06J04T04-CTLFireability-2024-07
FORMULA_NAME PolyORBLF-PT-S06J04T04-CTLFireability-2024-08
FORMULA_NAME PolyORBLF-PT-S06J04T04-CTLFireability-2024-09
FORMULA_NAME PolyORBLF-PT-S06J04T04-CTLFireability-2024-10
FORMULA_NAME PolyORBLF-PT-S06J04T04-CTLFireability-2024-11
FORMULA_NAME PolyORBLF-PT-S06J04T04-CTLFireability-2024-12
FORMULA_NAME PolyORBLF-PT-S06J04T04-CTLFireability-2024-13
FORMULA_NAME PolyORBLF-PT-S06J04T04-CTLFireability-2024-14
FORMULA_NAME PolyORBLF-PT-S06J04T04-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716869868390

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-PT-S06J04T04
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 04:17:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-28 04:17:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 04:17:50] [INFO ] Load time of PNML (sax parser for PT used): 547 ms
[2024-05-28 04:17:50] [INFO ] Transformed 454 places.
[2024-05-28 04:17:50] [INFO ] Transformed 6994 transitions.
[2024-05-28 04:17:50] [INFO ] Parsed PT model containing 454 places and 6994 transitions and 59152 arcs in 742 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 99 ms.
[2024-05-28 04:17:50] [INFO ] Reduced 4680 identical enabling conditions.
[2024-05-28 04:17:50] [INFO ] Reduced 60 identical enabling conditions.
[2024-05-28 04:17:50] [INFO ] Reduced 4680 identical enabling conditions.
Ensure Unique test removed 5380 transitions
Reduce redundant transitions removed 5380 transitions.
Support contains 310 out of 454 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 454/454 places, 1614/1614 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 450 transition count 1610
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 450 transition count 1610
Applied a total of 8 rules in 90 ms. Remains 450 /454 variables (removed 4) and now considering 1610/1614 (removed 4) transitions.
Running 1604 sub problems to find dead transitions.
[2024-05-28 04:17:51] [INFO ] Flow matrix only has 1586 transitions (discarded 24 similar events)
// Phase 1: matrix 1586 rows 450 cols
[2024-05-28 04:17:51] [INFO ] Computed 50 invariants in 105 ms
[2024-05-28 04:17:51] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/438 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1604 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/438 variables, 25/37 constraints. Problems are: Problem set: 0 solved, 1604 unsolved
[2024-05-28 04:18:24] [INFO ] Deduced a trap composed of 103 places in 527 ms of which 54 ms to minimize.
[2024-05-28 04:18:25] [INFO ] Deduced a trap composed of 211 places in 338 ms of which 3 ms to minimize.
[2024-05-28 04:18:25] [INFO ] Deduced a trap composed of 11 places in 245 ms of which 2 ms to minimize.
[2024-05-28 04:18:26] [INFO ] Deduced a trap composed of 47 places in 254 ms of which 2 ms to minimize.
[2024-05-28 04:18:26] [INFO ] Deduced a trap composed of 202 places in 292 ms of which 3 ms to minimize.
[2024-05-28 04:18:27] [INFO ] Deduced a trap composed of 210 places in 263 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 438/2036 variables, and 43 constraints, problems are : Problem set: 0 solved, 1604 unsolved in 20119 ms.
Refiners :[Positive P Invariants (semi-flows): 12/17 constraints, Generalized P Invariants (flows): 25/33 constraints, State Equation: 0/450 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1604/1604 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1604 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/438 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1604 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/438 variables, 25/37 constraints. Problems are: Problem set: 0 solved, 1604 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/438 variables, 6/43 constraints. Problems are: Problem set: 0 solved, 1604 unsolved
[2024-05-28 04:18:34] [INFO ] Deduced a trap composed of 79 places in 354 ms of which 15 ms to minimize.
[2024-05-28 04:18:35] [INFO ] Deduced a trap composed of 85 places in 111 ms of which 2 ms to minimize.
[2024-05-28 04:18:35] [INFO ] Deduced a trap composed of 85 places in 84 ms of which 1 ms to minimize.
[2024-05-28 04:18:44] [INFO ] Deduced a trap composed of 179 places in 332 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 438/2036 variables, and 47 constraints, problems are : Problem set: 0 solved, 1604 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 12/17 constraints, Generalized P Invariants (flows): 25/33 constraints, State Equation: 0/450 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1604 constraints, Known Traps: 10/10 constraints]
After SMT, in 57069ms problems are : Problem set: 0 solved, 1604 unsolved
Search for dead transitions found 0 dead transitions in 57125ms
[2024-05-28 04:18:48] [INFO ] Flow matrix only has 1586 transitions (discarded 24 similar events)
[2024-05-28 04:18:48] [INFO ] Invariant cache hit.
[2024-05-28 04:18:48] [INFO ] Implicit Places using invariants in 260 ms returned []
[2024-05-28 04:18:48] [INFO ] Flow matrix only has 1586 transitions (discarded 24 similar events)
[2024-05-28 04:18:48] [INFO ] Invariant cache hit.
[2024-05-28 04:18:49] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-05-28 04:18:54] [INFO ] Implicit Places using invariants and state equation in 5715 ms returned []
Implicit Place search using SMT with State Equation took 5999 ms to find 0 implicit places.
Running 1604 sub problems to find dead transitions.
[2024-05-28 04:18:54] [INFO ] Flow matrix only has 1586 transitions (discarded 24 similar events)
[2024-05-28 04:18:54] [INFO ] Invariant cache hit.
[2024-05-28 04:18:54] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/438 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1604 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/438 variables, 25/37 constraints. Problems are: Problem set: 0 solved, 1604 unsolved
[2024-05-28 04:19:23] [INFO ] Deduced a trap composed of 103 places in 421 ms of which 2 ms to minimize.
[2024-05-28 04:19:24] [INFO ] Deduced a trap composed of 61 places in 344 ms of which 1 ms to minimize.
[2024-05-28 04:19:25] [INFO ] Deduced a trap composed of 11 places in 370 ms of which 1 ms to minimize.
[2024-05-28 04:19:25] [INFO ] Deduced a trap composed of 199 places in 445 ms of which 3 ms to minimize.
[2024-05-28 04:19:26] [INFO ] Deduced a trap composed of 210 places in 448 ms of which 3 ms to minimize.
[2024-05-28 04:19:27] [INFO ] Deduced a trap composed of 202 places in 455 ms of which 3 ms to minimize.
[2024-05-28 04:19:28] [INFO ] Deduced a trap composed of 187 places in 384 ms of which 2 ms to minimize.
[2024-05-28 04:19:33] [INFO ] Deduced a trap composed of 199 places in 363 ms of which 2 ms to minimize.
[2024-05-28 04:19:36] [INFO ] Deduced a trap composed of 78 places in 394 ms of which 2 ms to minimize.
[2024-05-28 04:19:37] [INFO ] Deduced a trap composed of 47 places in 287 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 438/2036 variables, and 47 constraints, problems are : Problem set: 0 solved, 1604 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 12/17 constraints, Generalized P Invariants (flows): 25/33 constraints, State Equation: 0/450 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1604/1604 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1604 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/438 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1604 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/438 variables, 25/37 constraints. Problems are: Problem set: 0 solved, 1604 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/438 variables, 10/47 constraints. Problems are: Problem set: 0 solved, 1604 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 438/2036 variables, and 47 constraints, problems are : Problem set: 0 solved, 1604 unsolved in 30054 ms.
Refiners :[Positive P Invariants (semi-flows): 12/17 constraints, Generalized P Invariants (flows): 25/33 constraints, State Equation: 0/450 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1604 constraints, Known Traps: 10/10 constraints]
After SMT, in 77444ms problems are : Problem set: 0 solved, 1604 unsolved
Search for dead transitions found 0 dead transitions in 77461ms
Starting structural reductions in LTL mode, iteration 1 : 450/454 places, 1610/1614 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 140737 ms. Remains : 450/454 places, 1610/1614 transitions.
Support contains 310 out of 450 places after structural reductions.
[2024-05-28 04:20:12] [INFO ] Flatten gal took : 445 ms
[2024-05-28 04:20:13] [INFO ] Flatten gal took : 268 ms
[2024-05-28 04:20:14] [INFO ] Input system was already deterministic with 1610 transitions.
Reduction of identical properties reduced properties to check from 97 to 95
RANDOM walk for 40000 steps (223 resets) in 6988 ms. (5 steps per ms) remains 46/95 properties
BEST_FIRST walk for 4001 steps (19 resets) in 187 ms. (21 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (12 resets) in 77 ms. (51 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (19 resets) in 93 ms. (42 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (8 resets) in 133 ms. (29 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (8 resets) in 29 ms. (133 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4001 steps (8 resets) in 50 ms. (78 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (10 resets) in 36 ms. (108 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (9 resets) in 30 ms. (129 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (8 resets) in 31 ms. (125 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (9 resets) in 49 ms. (80 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (10 resets) in 33 ms. (117 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (9 resets) in 29 ms. (133 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4001 steps (9 resets) in 29 ms. (133 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (9 resets) in 63 ms. (62 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4000 steps (8 resets) in 45 ms. (86 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (8 resets) in 33 ms. (117 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (8 resets) in 40 ms. (97 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (9 resets) in 27 ms. (142 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4000 steps (8 resets) in 39 ms. (100 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4001 steps (11 resets) in 49 ms. (80 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (9 resets) in 25 ms. (153 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (9 resets) in 22 ms. (174 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (8 resets) in 76 ms. (51 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (9 resets) in 26 ms. (148 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (8 resets) in 34 ms. (114 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4000 steps (8 resets) in 37 ms. (105 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4000 steps (8 resets) in 72 ms. (54 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4001 steps (8 resets) in 26 ms. (148 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (8 resets) in 30 ms. (129 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4000 steps (9 resets) in 42 ms. (93 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4000 steps (8 resets) in 46 ms. (85 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4001 steps (8 resets) in 49 ms. (80 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4001 steps (9 resets) in 45 ms. (86 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (8 resets) in 30 ms. (129 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (8 resets) in 21 ms. (181 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (8 resets) in 54 ms. (72 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4001 steps (9 resets) in 30 ms. (129 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4001 steps (8 resets) in 37 ms. (105 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (10 resets) in 36 ms. (108 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (10 resets) in 33 ms. (117 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4001 steps (9 resets) in 46 ms. (85 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (18 resets) in 46 ms. (85 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (9 resets) in 52 ms. (75 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (9 resets) in 28 ms. (138 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4001 steps (8 resets) in 45 ms. (86 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (9 resets) in 35 ms. (111 steps per ms) remains 46/46 properties
[2024-05-28 04:20:17] [INFO ] Flow matrix only has 1586 transitions (discarded 24 similar events)
[2024-05-28 04:20:17] [INFO ] Invariant cache hit.
[2024-05-28 04:20:17] [INFO ] State equation strengthened by 112 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 46 unsolved
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp40 is UNSAT
Problem AtomicPropp42 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp50 is UNSAT
Problem AtomicPropp51 is UNSAT
Problem AtomicPropp52 is UNSAT
Problem AtomicPropp53 is UNSAT
Problem AtomicPropp56 is UNSAT
Problem AtomicPropp58 is UNSAT
Problem AtomicPropp59 is UNSAT
Problem AtomicPropp68 is UNSAT
Problem AtomicPropp69 is UNSAT
Problem AtomicPropp70 is UNSAT
Problem AtomicPropp73 is UNSAT
Problem AtomicPropp81 is UNSAT
Problem AtomicPropp83 is UNSAT
Problem AtomicPropp85 is UNSAT
Problem AtomicPropp87 is UNSAT
Problem AtomicPropp91 is UNSAT
At refinement iteration 1 (OVERLAPS) 112/141 variables, 8/8 constraints. Problems are: Problem set: 22 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/141 variables, 0/8 constraints. Problems are: Problem set: 22 solved, 24 unsolved
At refinement iteration 3 (OVERLAPS) 8/149 variables, 2/10 constraints. Problems are: Problem set: 22 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/149 variables, 0/10 constraints. Problems are: Problem set: 22 solved, 24 unsolved
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp46 is UNSAT
Problem AtomicPropp54 is UNSAT
Problem AtomicPropp55 is UNSAT
Problem AtomicPropp57 is UNSAT
Problem AtomicPropp62 is UNSAT
Problem AtomicPropp63 is UNSAT
Problem AtomicPropp67 is UNSAT
Problem AtomicPropp71 is UNSAT
Problem AtomicPropp75 is UNSAT
Problem AtomicPropp82 is UNSAT
Problem AtomicPropp88 is UNSAT
Problem AtomicPropp90 is UNSAT
Problem AtomicPropp92 is UNSAT
Problem AtomicPropp93 is UNSAT
Problem AtomicPropp95 is UNSAT
Problem AtomicPropp96 is UNSAT
At refinement iteration 5 (OVERLAPS) 268/417 variables, 17/27 constraints. Problems are: Problem set: 42 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/417 variables, 0/27 constraints. Problems are: Problem set: 42 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 11/428 variables, 7/34 constraints. Problems are: Problem set: 42 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/428 variables, 0/34 constraints. Problems are: Problem set: 42 solved, 4 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp27 is UNSAT
At refinement iteration 9 (OVERLAPS) 22/450 variables, 16/50 constraints. Problems are: Problem set: 44 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/450 variables, 0/50 constraints. Problems are: Problem set: 44 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2036/2036 variables, and 500 constraints, problems are : Problem set: 44 solved, 2 unsolved in 2523 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 33/33 constraints, State Equation: 450/450 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 44 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 44 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 87/95 variables, 5/5 constraints. Problems are: Problem set: 44 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 0/5 constraints. Problems are: Problem set: 44 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 36/131 variables, 4/9 constraints. Problems are: Problem set: 44 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/131 variables, 0/9 constraints. Problems are: Problem set: 44 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 284/415 variables, 17/26 constraints. Problems are: Problem set: 44 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/415 variables, 0/26 constraints. Problems are: Problem set: 44 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 11/426 variables, 7/33 constraints. Problems are: Problem set: 44 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/426 variables, 0/33 constraints. Problems are: Problem set: 44 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 22/448 variables, 16/49 constraints. Problems are: Problem set: 44 solved, 2 unsolved
[2024-05-28 04:20:21] [INFO ] Deduced a trap composed of 85 places in 245 ms of which 3 ms to minimize.
[2024-05-28 04:20:21] [INFO ] Deduced a trap composed of 84 places in 191 ms of which 2 ms to minimize.
[2024-05-28 04:20:21] [INFO ] Deduced a trap composed of 85 places in 102 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/448 variables, 3/52 constraints. Problems are: Problem set: 44 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/448 variables, 0/52 constraints. Problems are: Problem set: 44 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 1586/2034 variables, 448/500 constraints. Problems are: Problem set: 44 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2034/2036 variables, and 612 constraints, problems are : Problem set: 44 solved, 2 unsolved in 3324 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 33/33 constraints, State Equation: 448/450 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 0/46 constraints, Known Traps: 3/3 constraints]
After SMT, in 6946ms problems are : Problem set: 44 solved, 2 unsolved
Parikh walk visited 0 properties in 249 ms.
Support contains 8 out of 450 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 450/450 places, 1610/1610 transitions.
Ensure Unique test removed 6 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 444 transition count 1586
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 54 place count 420 transition count 1586
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 48 Pre rules applied. Total rules applied 54 place count 420 transition count 1538
Deduced a syphon composed of 48 places in 2 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 150 place count 372 transition count 1538
Performed 52 Post agglomeration using F-continuation condition.Transition count delta: 52
Deduced a syphon composed of 52 places in 8 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 2 with 104 rules applied. Total rules applied 254 place count 320 transition count 1486
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 2 with 10 rules applied. Total rules applied 264 place count 320 transition count 1476
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 274 place count 310 transition count 1476
Applied a total of 274 rules in 327 ms. Remains 310 /450 variables (removed 140) and now considering 1476/1610 (removed 134) transitions.
Running 1470 sub problems to find dead transitions.
[2024-05-28 04:20:24] [INFO ] Flow matrix only has 1452 transitions (discarded 24 similar events)
// Phase 1: matrix 1452 rows 310 cols
[2024-05-28 04:20:24] [INFO ] Computed 44 invariants in 85 ms
[2024-05-28 04:20:24] [INFO ] State equation strengthened by 112 read => feed constraints.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running PolyORBLF-PT-S06J04T04

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: 454
TRANSITIONS: 6994
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.403s, Sys 0.027s]


SAVING FILE /home/mcc/execution/model (.net / .def) ...
EXPORT TIME: [User 0.072s, 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: 667
MODEL NAME: /home/mcc/execution/model
454 places, 6994 transitions.

No place bound informations found.
No place bound informations found.
No place bound informations found.
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
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 CTLFireability -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-S06J04T04"
export BK_EXAMINATION="CTLFireability"
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-S06J04T04, examination is CTLFireability"
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-171654445700314"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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