About the Execution of GreatSPN+red for MedleyA-PT-05
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
865.067 | 112122.00 | 216614.00 | 373.20 | FFTFTTTTFTTTFTTT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r575-smll-171734919500034.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is MedleyA-PT-05, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r575-smll-171734919500034
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 456K
-rw-r--r-- 1 mcc users 6.7K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 11K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.5K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 30K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 75K Jun 2 16:33 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 MedleyA-PT-05-CTLFireability-2024-00
FORMULA_NAME MedleyA-PT-05-CTLFireability-2024-01
FORMULA_NAME MedleyA-PT-05-CTLFireability-2024-02
FORMULA_NAME MedleyA-PT-05-CTLFireability-2024-03
FORMULA_NAME MedleyA-PT-05-CTLFireability-2024-04
FORMULA_NAME MedleyA-PT-05-CTLFireability-2024-05
FORMULA_NAME MedleyA-PT-05-CTLFireability-2024-06
FORMULA_NAME MedleyA-PT-05-CTLFireability-2024-07
FORMULA_NAME MedleyA-PT-05-CTLFireability-2024-08
FORMULA_NAME MedleyA-PT-05-CTLFireability-2024-09
FORMULA_NAME MedleyA-PT-05-CTLFireability-2024-10
FORMULA_NAME MedleyA-PT-05-CTLFireability-2024-11
FORMULA_NAME MedleyA-PT-05-CTLFireability-2024-12
FORMULA_NAME MedleyA-PT-05-CTLFireability-2024-13
FORMULA_NAME MedleyA-PT-05-CTLFireability-2024-14
FORMULA_NAME MedleyA-PT-05-CTLFireability-2024-15
=== Now, execution of the tool begins
BK_START 1717352758969
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-05
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-02 18:26:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-02 18:26:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:26:01] [INFO ] Load time of PNML (sax parser for PT used): 227 ms
[2024-06-02 18:26:02] [INFO ] Transformed 115 places.
[2024-06-02 18:26:02] [INFO ] Transformed 257 transitions.
[2024-06-02 18:26:02] [INFO ] Found NUPN structural information;
[2024-06-02 18:26:02] [INFO ] Parsed PT model containing 115 places and 257 transitions and 1160 arcs in 491 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 40 ms.
Ensure Unique test removed 3 transitions
Reduce redundant transitions removed 3 transitions.
Support contains 68 out of 115 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 254/254 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 109 transition count 242
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 109 transition count 242
Applied a total of 12 rules in 51 ms. Remains 109 /115 variables (removed 6) and now considering 242/254 (removed 12) transitions.
[2024-06-02 18:26:02] [INFO ] Flow matrix only has 241 transitions (discarded 1 similar events)
// Phase 1: matrix 241 rows 109 cols
[2024-06-02 18:26:02] [INFO ] Computed 20 invariants in 26 ms
[2024-06-02 18:26:02] [INFO ] Implicit Places using invariants in 440 ms returned []
[2024-06-02 18:26:02] [INFO ] Flow matrix only has 241 transitions (discarded 1 similar events)
[2024-06-02 18:26:02] [INFO ] Invariant cache hit.
[2024-06-02 18:26:03] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-06-02 18:26:03] [INFO ] Implicit Places using invariants and state equation in 446 ms returned []
Implicit Place search using SMT with State Equation took 966 ms to find 0 implicit places.
Running 241 sub problems to find dead transitions.
[2024-06-02 18:26:03] [INFO ] Flow matrix only has 241 transitions (discarded 1 similar events)
[2024-06-02 18:26:03] [INFO ] Invariant cache hit.
[2024-06-02 18:26:03] [INFO ] State equation strengthened by 94 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/109 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-06-02 18:26:07] [INFO ] Deduced a trap composed of 31 places in 147 ms of which 25 ms to minimize.
[2024-06-02 18:26:07] [INFO ] Deduced a trap composed of 25 places in 108 ms of which 3 ms to minimize.
[2024-06-02 18:26:07] [INFO ] Deduced a trap composed of 15 places in 99 ms of which 3 ms to minimize.
[2024-06-02 18:26:07] [INFO ] Deduced a trap composed of 21 places in 100 ms of which 2 ms to minimize.
[2024-06-02 18:26:07] [INFO ] Deduced a trap composed of 25 places in 86 ms of which 2 ms to minimize.
[2024-06-02 18:26:07] [INFO ] Deduced a trap composed of 22 places in 74 ms of which 2 ms to minimize.
[2024-06-02 18:26:07] [INFO ] Deduced a trap composed of 21 places in 71 ms of which 2 ms to minimize.
[2024-06-02 18:26:07] [INFO ] Deduced a trap composed of 31 places in 76 ms of which 3 ms to minimize.
[2024-06-02 18:26:08] [INFO ] Deduced a trap composed of 14 places in 87 ms of which 2 ms to minimize.
[2024-06-02 18:26:08] [INFO ] Deduced a trap composed of 33 places in 86 ms of which 1 ms to minimize.
[2024-06-02 18:26:08] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 1 ms to minimize.
[2024-06-02 18:26:08] [INFO ] Deduced a trap composed of 35 places in 63 ms of which 1 ms to minimize.
[2024-06-02 18:26:08] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 13/33 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 240/349 variables, 109/142 constraints. Problems are: Problem set: 0 solved, 241 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/349 variables, 93/235 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/349 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 8 (OVERLAPS) 1/350 variables, 1/236 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/350 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 10 (OVERLAPS) 0/350 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Real declared 350/350 variables, and 236 constraints, problems are : Problem set: 0 solved, 241 unsolved in 18502 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 109/109 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 241 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/109 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 13/33 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-06-02 18:26:24] [INFO ] Deduced a trap composed of 30 places in 86 ms of which 2 ms to minimize.
[2024-06-02 18:26:24] [INFO ] Deduced a trap composed of 29 places in 70 ms of which 2 ms to minimize.
[2024-06-02 18:26:24] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (OVERLAPS) 240/349 variables, 109/145 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/349 variables, 93/238 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/349 variables, 241/479 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-06-02 18:26:29] [INFO ] Deduced a trap composed of 55 places in 108 ms of which 2 ms to minimize.
[2024-06-02 18:26:30] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 2 ms to minimize.
[2024-06-02 18:26:30] [INFO ] Deduced a trap composed of 21 places in 72 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/349 variables, 3/482 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-06-02 18:26:35] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/349 variables, 1/483 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-06-02 18:26:39] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
[2024-06-02 18:26:40] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/349 variables, 2/485 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/349 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 13 (OVERLAPS) 1/350 variables, 1/486 constraints. Problems are: Problem set: 0 solved, 241 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 350/350 variables, and 486 constraints, problems are : Problem set: 0 solved, 241 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 109/109 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 22/22 constraints]
After SMT, in 49126ms problems are : Problem set: 0 solved, 241 unsolved
Search for dead transitions found 0 dead transitions in 49164ms
Starting structural reductions in LTL mode, iteration 1 : 109/115 places, 242/254 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50236 ms. Remains : 109/115 places, 242/254 transitions.
Support contains 68 out of 109 places after structural reductions.
[2024-06-02 18:26:52] [INFO ] Flatten gal took : 104 ms
[2024-06-02 18:26:53] [INFO ] Flatten gal took : 49 ms
[2024-06-02 18:26:53] [INFO ] Input system was already deterministic with 242 transitions.
Support contains 65 out of 109 places (down from 68) after GAL structural reductions.
RANDOM walk for 40000 steps (3006 resets) in 2687 ms. (14 steps per ms) remains 20/60 properties
BEST_FIRST walk for 4004 steps (43 resets) in 16 ms. (235 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (37 resets) in 35 ms. (111 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (42 resets) in 34 ms. (114 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (46 resets) in 26 ms. (148 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (25 resets) in 23 ms. (166 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (26 resets) in 26 ms. (148 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (44 resets) in 19 ms. (200 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (24 resets) in 21 ms. (182 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (43 resets) in 22 ms. (174 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (43 resets) in 19 ms. (200 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (44 resets) in 21 ms. (182 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (46 resets) in 20 ms. (190 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (46 resets) in 38 ms. (102 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (25 resets) in 30 ms. (129 steps per ms) remains 19/20 properties
BEST_FIRST walk for 4003 steps (27 resets) in 20 ms. (190 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (48 resets) in 28 ms. (138 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (47 resets) in 19 ms. (200 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (35 resets) in 22 ms. (174 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (56 resets) in 20 ms. (190 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (44 resets) in 26 ms. (148 steps per ms) remains 19/19 properties
[2024-06-02 18:26:54] [INFO ] Flow matrix only has 241 transitions (discarded 1 similar events)
[2024-06-02 18:26:54] [INFO ] Invariant cache hit.
[2024-06-02 18:26:54] [INFO ] State equation strengthened by 94 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
Problem AtomicPropp41 is UNSAT
At refinement iteration 1 (OVERLAPS) 66/97 variables, 15/15 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/15 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 11/108 variables, 5/20 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 0/20 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 239/347 variables, 108/128 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/347 variables, 93/221 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/347 variables, 0/221 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 8 (OVERLAPS) 2/349 variables, 1/222 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/349 variables, 0/222 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 10 (OVERLAPS) 1/350 variables, 1/223 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/350 variables, 0/223 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 12 (OVERLAPS) 0/350 variables, 0/223 constraints. Problems are: Problem set: 1 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 350/350 variables, and 223 constraints, problems are : Problem set: 1 solved, 18 unsolved in 968 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 109/109 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 18 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 18 unsolved
Problem AtomicPropp46 is UNSAT
At refinement iteration 1 (OVERLAPS) 69/96 variables, 15/15 constraints. Problems are: Problem set: 2 solved, 17 unsolved
[2024-06-02 18:26:55] [INFO ] Deduced a trap composed of 22 places in 70 ms of which 1 ms to minimize.
[2024-06-02 18:26:55] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 2/17 constraints. Problems are: Problem set: 2 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 0/17 constraints. Problems are: Problem set: 2 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 12/108 variables, 5/22 constraints. Problems are: Problem set: 2 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/108 variables, 0/22 constraints. Problems are: Problem set: 2 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 239/347 variables, 108/130 constraints. Problems are: Problem set: 2 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/347 variables, 93/223 constraints. Problems are: Problem set: 2 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/347 variables, 7/230 constraints. Problems are: Problem set: 2 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/347 variables, 0/230 constraints. Problems are: Problem set: 2 solved, 17 unsolved
At refinement iteration 10 (OVERLAPS) 2/349 variables, 1/231 constraints. Problems are: Problem set: 2 solved, 17 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/349 variables, 10/241 constraints. Problems are: Problem set: 2 solved, 17 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/349 variables, 0/241 constraints. Problems are: Problem set: 2 solved, 17 unsolved
At refinement iteration 13 (OVERLAPS) 1/350 variables, 1/242 constraints. Problems are: Problem set: 2 solved, 17 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/350 variables, 0/242 constraints. Problems are: Problem set: 2 solved, 17 unsolved
At refinement iteration 15 (OVERLAPS) 0/350 variables, 0/242 constraints. Problems are: Problem set: 2 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 350/350 variables, and 242 constraints, problems are : Problem set: 2 solved, 17 unsolved in 2201 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 109/109 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 17/19 constraints, Known Traps: 2/2 constraints]
After SMT, in 3212ms problems are : Problem set: 2 solved, 17 unsolved
Finished Parikh walk after 14220 steps, including 474 resets, run visited all 2 properties in 161 ms. (steps per millisecond=88 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 2 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 17 properties in 4895 ms.
Successfully simplified 2 atomic propositions for a total of 16 simplifications.
FORMULA MedleyA-PT-05-CTLFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-02 18:27:02] [INFO ] Flatten gal took : 19 ms
[2024-06-02 18:27:02] [INFO ] Flatten gal took : 23 ms
[2024-06-02 18:27:02] [INFO ] Input system was already deterministic with 242 transitions.
Computed a total of 15 stabilizing places and 90 stable transitions
Graph (complete) has 536 edges and 109 vertex of which 108 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 109/109 places, 242/242 transitions.
Graph (complete) has 536 edges and 109 vertex of which 108 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 108 transition count 240
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 107 transition count 240
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 14 place count 96 transition count 218
Iterating global reduction 2 with 11 rules applied. Total rules applied 25 place count 96 transition count 218
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 28 place count 96 transition count 215
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 34 place count 93 transition count 212
Applied a total of 34 rules in 56 ms. Remains 93 /109 variables (removed 16) and now considering 212/242 (removed 30) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 56 ms. Remains : 93/109 places, 212/242 transitions.
[2024-06-02 18:27:02] [INFO ] Flatten gal took : 17 ms
[2024-06-02 18:27:02] [INFO ] Flatten gal took : 19 ms
[2024-06-02 18:27:02] [INFO ] Input system was already deterministic with 212 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 109/109 places, 242/242 transitions.
Graph (complete) has 536 edges and 109 vertex of which 108 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 108 transition count 240
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 107 transition count 240
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 13 place count 97 transition count 220
Iterating global reduction 0 with 10 rules applied. Total rules applied 23 place count 97 transition count 220
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 26 place count 97 transition count 217
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 32 place count 94 transition count 214
Applied a total of 32 rules in 42 ms. Remains 94 /109 variables (removed 15) and now considering 214/242 (removed 28) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 42 ms. Remains : 94/109 places, 214/242 transitions.
[2024-06-02 18:27:02] [INFO ] Flatten gal took : 16 ms
[2024-06-02 18:27:02] [INFO ] Flatten gal took : 17 ms
[2024-06-02 18:27:02] [INFO ] Input system was already deterministic with 214 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 109/109 places, 242/242 transitions.
Graph (complete) has 536 edges and 109 vertex of which 108 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 108 transition count 240
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 107 transition count 240
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 13 place count 97 transition count 220
Iterating global reduction 2 with 10 rules applied. Total rules applied 23 place count 97 transition count 220
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 26 place count 97 transition count 217
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 32 place count 94 transition count 214
Applied a total of 32 rules in 35 ms. Remains 94 /109 variables (removed 15) and now considering 214/242 (removed 28) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 35 ms. Remains : 94/109 places, 214/242 transitions.
[2024-06-02 18:27:02] [INFO ] Flatten gal took : 15 ms
[2024-06-02 18:27:02] [INFO ] Flatten gal took : 17 ms
[2024-06-02 18:27:02] [INFO ] Input system was already deterministic with 214 transitions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 242/242 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 99 transition count 222
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 99 transition count 222
Applied a total of 20 rules in 5 ms. Remains 99 /109 variables (removed 10) and now considering 222/242 (removed 20) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 99/109 places, 222/242 transitions.
[2024-06-02 18:27:02] [INFO ] Flatten gal took : 14 ms
[2024-06-02 18:27:02] [INFO ] Flatten gal took : 15 ms
[2024-06-02 18:27:02] [INFO ] Input system was already deterministic with 222 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 109/109 places, 242/242 transitions.
Graph (complete) has 536 edges and 109 vertex of which 108 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 108 transition count 240
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 107 transition count 240
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 15 place count 95 transition count 216
Iterating global reduction 2 with 12 rules applied. Total rules applied 27 place count 95 transition count 216
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 30 place count 95 transition count 213
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 36 place count 92 transition count 210
Applied a total of 36 rules in 33 ms. Remains 92 /109 variables (removed 17) and now considering 210/242 (removed 32) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 33 ms. Remains : 92/109 places, 210/242 transitions.
[2024-06-02 18:27:02] [INFO ] Flatten gal took : 12 ms
[2024-06-02 18:27:02] [INFO ] Flatten gal took : 14 ms
[2024-06-02 18:27:03] [INFO ] Input system was already deterministic with 210 transitions.
RANDOM walk for 40000 steps (3082 resets) in 505 ms. (79 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (285 resets) in 464 ms. (86 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1546746 steps, run timeout after 3001 ms. (steps per millisecond=515 ) properties seen :0 out of 1
Probabilistic random walk after 1546746 steps, saw 246051 distinct states, run finished after 3007 ms. (steps per millisecond=514 ) properties seen :0
[2024-06-02 18:27:06] [INFO ] Flow matrix only has 209 transitions (discarded 1 similar events)
// Phase 1: matrix 209 rows 92 cols
[2024-06-02 18:27:06] [INFO ] Computed 20 invariants in 7 ms
[2024-06-02 18:27:06] [INFO ] State equation strengthened by 94 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 20/24 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 54/78 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 13/91 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 208/299 variables, 91/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/299 variables, 93/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/299 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/300 variables, 1/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/300 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/301 variables, 1/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/301 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/301 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 301/301 variables, and 206 constraints, problems are : Problem set: 0 solved, 1 unsolved in 167 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 92/92 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 20/24 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 54/78 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 13/91 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 208/299 variables, 91/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/299 variables, 93/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/299 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/300 variables, 1/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/300 variables, 1/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/300 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/301 variables, 1/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/301 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/301 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 301/301 variables, and 207 constraints, problems are : Problem set: 0 solved, 1 unsolved in 219 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 92/92 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 406ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 119 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=59 )
FORMULA MedleyA-PT-05-CTLFireability-2024-04 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 2 ms.
Starting structural reductions in SI_CTL mode, iteration 0 : 109/109 places, 242/242 transitions.
Graph (complete) has 536 edges and 109 vertex of which 108 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 108 transition count 240
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 107 transition count 240
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 15 place count 95 transition count 216
Iterating global reduction 2 with 12 rules applied. Total rules applied 27 place count 95 transition count 216
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 30 place count 95 transition count 213
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 36 place count 92 transition count 210
Applied a total of 36 rules in 51 ms. Remains 92 /109 variables (removed 17) and now considering 210/242 (removed 32) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 52 ms. Remains : 92/109 places, 210/242 transitions.
[2024-06-02 18:27:06] [INFO ] Flatten gal took : 19 ms
[2024-06-02 18:27:06] [INFO ] Flatten gal took : 21 ms
[2024-06-02 18:27:06] [INFO ] Input system was already deterministic with 210 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 109/109 places, 242/242 transitions.
Graph (complete) has 536 edges and 109 vertex of which 108 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 108 transition count 240
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 107 transition count 240
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 14 place count 96 transition count 218
Iterating global reduction 2 with 11 rules applied. Total rules applied 25 place count 96 transition count 218
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 27 place count 96 transition count 216
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 31 place count 94 transition count 214
Applied a total of 31 rules in 40 ms. Remains 94 /109 variables (removed 15) and now considering 214/242 (removed 28) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 41 ms. Remains : 94/109 places, 214/242 transitions.
[2024-06-02 18:27:06] [INFO ] Flatten gal took : 20 ms
[2024-06-02 18:27:06] [INFO ] Flatten gal took : 22 ms
[2024-06-02 18:27:07] [INFO ] Input system was already deterministic with 214 transitions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 242/242 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 99 transition count 222
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 99 transition count 222
Applied a total of 20 rules in 5 ms. Remains 99 /109 variables (removed 10) and now considering 222/242 (removed 20) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 99/109 places, 222/242 transitions.
[2024-06-02 18:27:07] [INFO ] Flatten gal took : 20 ms
[2024-06-02 18:27:07] [INFO ] Flatten gal took : 21 ms
[2024-06-02 18:27:07] [INFO ] Input system was already deterministic with 222 transitions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 242/242 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 99 transition count 222
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 99 transition count 222
Applied a total of 20 rules in 5 ms. Remains 99 /109 variables (removed 10) and now considering 222/242 (removed 20) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 99/109 places, 222/242 transitions.
[2024-06-02 18:27:07] [INFO ] Flatten gal took : 18 ms
[2024-06-02 18:27:07] [INFO ] Flatten gal took : 21 ms
[2024-06-02 18:27:07] [INFO ] Input system was already deterministic with 222 transitions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 242/242 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 100 transition count 224
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 100 transition count 224
Applied a total of 18 rules in 3 ms. Remains 100 /109 variables (removed 9) and now considering 224/242 (removed 18) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 100/109 places, 224/242 transitions.
[2024-06-02 18:27:07] [INFO ] Flatten gal took : 12 ms
[2024-06-02 18:27:07] [INFO ] Flatten gal took : 12 ms
[2024-06-02 18:27:07] [INFO ] Input system was already deterministic with 224 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 109/109 places, 242/242 transitions.
Graph (complete) has 536 edges and 109 vertex of which 108 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 108 transition count 240
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 107 transition count 240
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 15 place count 95 transition count 216
Iterating global reduction 2 with 12 rules applied. Total rules applied 27 place count 95 transition count 216
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 30 place count 95 transition count 213
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 36 place count 92 transition count 210
Applied a total of 36 rules in 24 ms. Remains 92 /109 variables (removed 17) and now considering 210/242 (removed 32) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 26 ms. Remains : 92/109 places, 210/242 transitions.
[2024-06-02 18:27:07] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:27:07] [INFO ] Flatten gal took : 12 ms
[2024-06-02 18:27:07] [INFO ] Input system was already deterministic with 210 transitions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 242/242 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 98 transition count 220
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 98 transition count 220
Applied a total of 22 rules in 3 ms. Remains 98 /109 variables (removed 11) and now considering 220/242 (removed 22) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 98/109 places, 220/242 transitions.
[2024-06-02 18:27:07] [INFO ] Flatten gal took : 11 ms
[2024-06-02 18:27:07] [INFO ] Flatten gal took : 12 ms
[2024-06-02 18:27:07] [INFO ] Input system was already deterministic with 220 transitions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 242/242 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 97 transition count 218
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 97 transition count 218
Applied a total of 24 rules in 3 ms. Remains 97 /109 variables (removed 12) and now considering 218/242 (removed 24) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 97/109 places, 218/242 transitions.
[2024-06-02 18:27:07] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:27:07] [INFO ] Flatten gal took : 12 ms
[2024-06-02 18:27:07] [INFO ] Input system was already deterministic with 218 transitions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 242/242 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 97 transition count 218
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 97 transition count 218
Applied a total of 24 rules in 3 ms. Remains 97 /109 variables (removed 12) and now considering 218/242 (removed 24) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 97/109 places, 218/242 transitions.
[2024-06-02 18:27:07] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:27:07] [INFO ] Flatten gal took : 12 ms
[2024-06-02 18:27:07] [INFO ] Input system was already deterministic with 218 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 109/109 places, 242/242 transitions.
Graph (complete) has 536 edges and 109 vertex of which 108 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 108 transition count 240
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 107 transition count 240
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 14 place count 96 transition count 218
Iterating global reduction 0 with 11 rules applied. Total rules applied 25 place count 96 transition count 218
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 28 place count 96 transition count 215
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 34 place count 93 transition count 212
Applied a total of 34 rules in 22 ms. Remains 93 /109 variables (removed 16) and now considering 212/242 (removed 30) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 24 ms. Remains : 93/109 places, 212/242 transitions.
[2024-06-02 18:27:07] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:27:07] [INFO ] Flatten gal took : 11 ms
[2024-06-02 18:27:07] [INFO ] Input system was already deterministic with 212 transitions.
[2024-06-02 18:27:07] [INFO ] Flatten gal took : 12 ms
[2024-06-02 18:27:07] [INFO ] Flatten gal took : 12 ms
[2024-06-02 18:27:07] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLFireability.sr.xml took 6 ms.
[2024-06-02 18:27:07] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 109 places, 242 transitions and 1127 arcs took 4 ms.
Total runtime 66175 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running MedleyA-PT-05
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/418/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 109
TRANSITIONS: 242
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.006s, Sys 0.001s]
SAVING FILE /home/mcc/execution/418/model (.net / .def) ...
EXPORT TIME: [User 0.000s, 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: 648
MODEL NAME: /home/mcc/execution/418/model
109 places, 242 transitions.
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.
Building monolithic NSF...
FORMULA MedleyA-PT-05-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA MedleyA-PT-05-CTLFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA MedleyA-PT-05-CTLFireability-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA MedleyA-PT-05-CTLFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA MedleyA-PT-05-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA MedleyA-PT-05-CTLFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA MedleyA-PT-05-CTLFireability-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA MedleyA-PT-05-CTLFireability-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA MedleyA-PT-05-CTLFireability-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA MedleyA-PT-05-CTLFireability-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA MedleyA-PT-05-CTLFireability-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA MedleyA-PT-05-CTLFireability-2024-14 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA MedleyA-PT-05-CTLFireability-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA MedleyA-PT-05-CTLFireability-2024-12 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------
BK_STOP 1717352871091
--------------------
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="MedleyA-PT-05"
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 MedleyA-PT-05, 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 r575-smll-171734919500034"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/MedleyA-PT-05.tgz
mv MedleyA-PT-05 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 '
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 ;