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.r267-smll-171654406000250.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 Peterson-PT-2, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r267-smll-171654406000250
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.0M
-rw-r--r-- 1 mcc users 19K Apr 12 02:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 116K Apr 12 02:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 13K Apr 12 02:41 CTLFireability.txt
-rw-r--r-- 1 mcc users 73K Apr 12 02:41 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 7.2K Apr 23 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 33K Apr 23 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Apr 23 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 28K Apr 23 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 42K Apr 12 02:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 262K Apr 12 02:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 42K Apr 12 02:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 224K Apr 12 02:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.7K Apr 23 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.0K Apr 23 07:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 2 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 100K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716766967389

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Peterson-PT-2
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-26 23:42:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-26 23:42:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 23:42:49] [INFO ] Load time of PNML (sax parser for PT used): 106 ms
[2024-05-26 23:42:49] [INFO ] Transformed 102 places.
[2024-05-26 23:42:49] [INFO ] Transformed 126 transitions.
[2024-05-26 23:42:49] [INFO ] Found NUPN structural information;
[2024-05-26 23:42:49] [INFO ] Parsed PT model containing 102 places and 126 transitions and 384 arcs in 289 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 89 ms.
Support contains 102 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Applied a total of 0 rules in 15 ms. Remains 102 /102 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2024-05-26 23:42:49] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
// Phase 1: matrix 120 rows 102 cols
[2024-05-26 23:42:49] [INFO ] Computed 11 invariants in 14 ms
[2024-05-26 23:42:50] [INFO ] Implicit Places using invariants in 290 ms returned []
[2024-05-26 23:42:50] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
[2024-05-26 23:42:50] [INFO ] Invariant cache hit.
[2024-05-26 23:42:50] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-26 23:42:50] [INFO ] Implicit Places using invariants and state equation in 278 ms returned []
Implicit Place search using SMT with State Equation took 618 ms to find 0 implicit places.
Running 123 sub problems to find dead transitions.
[2024-05-26 23:42:50] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
[2024-05-26 23:42:50] [INFO ] Invariant cache hit.
[2024-05-26 23:42:50] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 99/99 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 2/101 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 3 (OVERLAPS) 3/102 variables, 6/107 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 3/110 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 3/113 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-05-26 23:42:52] [INFO ] Deduced a trap composed of 12 places in 103 ms of which 22 ms to minimize.
[2024-05-26 23:42:52] [INFO ] Deduced a trap composed of 26 places in 64 ms of which 2 ms to minimize.
[2024-05-26 23:42:52] [INFO ] Deduced a trap composed of 12 places in 82 ms of which 3 ms to minimize.
[2024-05-26 23:42:52] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 2 ms to minimize.
[2024-05-26 23:42:52] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 2 ms to minimize.
[2024-05-26 23:42:52] [INFO ] Deduced a trap composed of 26 places in 51 ms of which 2 ms to minimize.
[2024-05-26 23:42:52] [INFO ] Deduced a trap composed of 8 places in 69 ms of which 2 ms to minimize.
[2024-05-26 23:42:52] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 1 ms to minimize.
[2024-05-26 23:42:52] [INFO ] Deduced a trap composed of 40 places in 49 ms of which 2 ms to minimize.
[2024-05-26 23:42:53] [INFO ] Deduced a trap composed of 42 places in 58 ms of which 1 ms to minimize.
[2024-05-26 23:42:53] [INFO ] Deduced a trap composed of 34 places in 53 ms of which 3 ms to minimize.
[2024-05-26 23:42:53] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 2 ms to minimize.
[2024-05-26 23:42:53] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 1 ms to minimize.
[2024-05-26 23:42:53] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
[2024-05-26 23:42:53] [INFO ] Deduced a trap composed of 34 places in 49 ms of which 1 ms to minimize.
[2024-05-26 23:42:53] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-05-26 23:42:53] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 1 ms to minimize.
[2024-05-26 23:42:53] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 18/131 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-05-26 23:42:54] [INFO ] Deduced a trap composed of 50 places in 53 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/102 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 9 (OVERLAPS) 120/222 variables, 102/234 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/222 variables, 22/256 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/222 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 12 (OVERLAPS) 0/222 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Real declared 222/222 variables, and 256 constraints, problems are : Problem set: 0 solved, 123 unsolved in 9560 ms.
Refiners :[Domain max(s): 102/102 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 102/102 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 123 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 99/99 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 2/101 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 15/116 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 4 (OVERLAPS) 3/102 variables, 6/122 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 3/125 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 3/128 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 4/132 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/102 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 9 (OVERLAPS) 120/222 variables, 102/234 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/222 variables, 22/256 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/222 variables, 123/379 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-05-26 23:43:03] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/222 variables, 1/380 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/222 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 14 (OVERLAPS) 0/222 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Int declared 222/222 variables, and 380 constraints, problems are : Problem set: 0 solved, 123 unsolved in 7187 ms.
Refiners :[Domain max(s): 102/102 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 102/102 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 20/20 constraints]
After SMT, in 16860ms problems are : Problem set: 0 solved, 123 unsolved
Search for dead transitions found 0 dead transitions in 16886ms
Finished structural reductions in LTL mode , in 1 iterations and 17550 ms. Remains : 102/102 places, 126/126 transitions.
Support contains 102 out of 102 places after structural reductions.
[2024-05-26 23:43:07] [INFO ] Flatten gal took : 68 ms
[2024-05-26 23:43:07] [INFO ] Flatten gal took : 23 ms
[2024-05-26 23:43:08] [INFO ] Input system was already deterministic with 126 transitions.
Reduction of identical properties reduced properties to check from 56 to 51
RANDOM walk for 40000 steps (8 resets) in 3308 ms. (12 steps per ms) remains 11/51 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1144 ms. (34 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 375 ms. (106 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 141 ms. (281 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 141 ms. (281 steps per ms) remains 10/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 108 ms. (367 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 231 ms. (172 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 122 ms. (325 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 145 ms. (274 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 112 ms. (354 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 63 ms. (625 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 58 ms. (678 steps per ms) remains 10/10 properties
[2024-05-26 23:43:09] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
[2024-05-26 23:43:09] [INFO ] Invariant cache hit.
[2024-05-26 23:43:09] [INFO ] State equation strengthened by 22 read => feed constraints.
Problem AtomicPropp8 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 46/46 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 3/49 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 1/50 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 0/50 constraints. Problems are: Problem set: 1 solved, 9 unsolved
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp54 is UNSAT
At refinement iteration 4 (OVERLAPS) 55/101 variables, 5/55 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/101 variables, 55/110 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/101 variables, 1/111 constraints. Problems are: Problem set: 4 solved, 6 unsolved
[2024-05-26 23:43:10] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/101 variables, 1/112 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/101 variables, 0/112 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 1/102 variables, 1/113 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/102 variables, 1/114 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/102 variables, 0/114 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 120/222 variables, 102/216 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/222 variables, 22/238 constraints. Problems are: Problem set: 4 solved, 6 unsolved
[2024-05-26 23:43:10] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 2 ms to minimize.
[2024-05-26 23:43:10] [INFO ] Deduced a trap composed of 8 places in 63 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/222 variables, 2/240 constraints. Problems are: Problem set: 4 solved, 6 unsolved
[2024-05-26 23:43:10] [INFO ] Deduced a trap composed of 26 places in 63 ms of which 2 ms to minimize.
[2024-05-26 23:43:10] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/222 variables, 2/242 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/222 variables, 0/242 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 0/222 variables, 0/242 constraints. Problems are: Problem set: 4 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 222/222 variables, and 242 constraints, problems are : Problem set: 4 solved, 6 unsolved in 840 ms.
Refiners :[Domain max(s): 102/102 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 102/102 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 4 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 26/26 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 3/29 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 1/30 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/26 variables, 0/30 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 75/101 variables, 5/35 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/101 variables, 75/110 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/101 variables, 1/111 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/101 variables, 4/115 constraints. Problems are: Problem set: 4 solved, 6 unsolved
[2024-05-26 23:43:10] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 2 ms to minimize.
[2024-05-26 23:43:10] [INFO ] Deduced a trap composed of 37 places in 46 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/101 variables, 2/117 constraints. Problems are: Problem set: 4 solved, 6 unsolved
[2024-05-26 23:43:11] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 1 ms to minimize.
[2024-05-26 23:43:11] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/101 variables, 2/119 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/101 variables, 0/119 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 1/102 variables, 1/120 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/102 variables, 1/121 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/102 variables, 1/122 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/102 variables, 0/122 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 120/222 variables, 102/224 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/222 variables, 22/246 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/222 variables, 6/252 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/222 variables, 0/252 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 19 (OVERLAPS) 0/222 variables, 0/252 constraints. Problems are: Problem set: 4 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 222/222 variables, and 252 constraints, problems are : Problem set: 4 solved, 6 unsolved in 732 ms.
Refiners :[Domain max(s): 102/102 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 102/102 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 6/10 constraints, Known Traps: 9/9 constraints]
After SMT, in 1597ms problems are : Problem set: 4 solved, 6 unsolved
Parikh walk visited 0 properties in 1960 ms.
Support contains 26 out of 102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 126/126 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 29 place count 102 transition count 97
Reduce places removed 29 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 30 rules applied. Total rules applied 59 place count 73 transition count 96
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 60 place count 72 transition count 96
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 60 place count 72 transition count 81
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 90 place count 57 transition count 81
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 100 place count 52 transition count 76
Applied a total of 100 rules in 42 ms. Remains 52 /102 variables (removed 50) and now considering 76/126 (removed 50) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 52/102 places, 76/126 transitions.
RANDOM walk for 40000 steps (8 resets) in 401 ms. (99 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 142 ms. (279 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 97 ms. (408 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 99 ms. (400 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 108 ms. (367 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 107 ms. (370 steps per ms) remains 5/5 properties
[2024-05-26 23:43:13] [INFO ] Flow matrix only has 70 transitions (discarded 6 similar events)
// Phase 1: matrix 70 rows 52 cols
[2024-05-26 23:43:13] [INFO ] Computed 11 invariants in 2 ms
[2024-05-26 23:43:13] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 27/51 variables, 6/32 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 27/59 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-26 23:43:14] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
[2024-05-26 23:43:14] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 1 ms to minimize.
[2024-05-26 23:43:14] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/51 variables, 3/64 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-26 23:43:14] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 1 ms to minimize.
[2024-05-26 23:43:14] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 2 ms to minimize.
[2024-05-26 23:43:14] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/51 variables, 3/67 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/51 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 1/52 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/52 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-26 23:43:14] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-05-26 23:43:14] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/52 variables, 2/71 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/52 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 70/122 variables, 52/123 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/122 variables, 22/145 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/122 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 0/122 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 145 constraints, problems are : Problem set: 0 solved, 5 unsolved in 569 ms.
Refiners :[Domain max(s): 52/52 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 52/52 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 27/51 variables, 6/32 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 27/59 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/51 variables, 6/67 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/51 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 1/52 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/52 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/52 variables, 2/71 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-26 23:43:14] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-05-26 23:43:14] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
[2024-05-26 23:43:14] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/52 variables, 3/74 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-26 23:43:14] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/52 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/52 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 70/122 variables, 52/127 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/122 variables, 22/149 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/122 variables, 5/154 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/122 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (OVERLAPS) 0/122 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 154 constraints, problems are : Problem set: 0 solved, 5 unsolved in 453 ms.
Refiners :[Domain max(s): 52/52 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 52/52 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 12/12 constraints]
After SMT, in 1038ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 1 properties in 878 ms.
Support contains 23 out of 52 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 52/52 places, 76/76 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 1 place count 52 transition count 75
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 51 transition count 75
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 51 transition count 74
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 50 transition count 74
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 49 transition count 73
Applied a total of 6 rules in 8 ms. Remains 49 /52 variables (removed 3) and now considering 73/76 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 49/52 places, 73/76 transitions.
RANDOM walk for 40000 steps (8 resets) in 168 ms. (236 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 185 ms. (215 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 135 ms. (294 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 100 ms. (396 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 100 ms. (396 steps per ms) remains 4/4 properties
Finished probabilistic random walk after 4778 steps, run visited all 4 properties in 51 ms. (steps per millisecond=93 )
Probabilistic random walk after 4778 steps, saw 1250 distinct states, run finished after 58 ms. (steps per millisecond=82 ) properties seen :4
Successfully simplified 4 atomic propositions for a total of 16 simplifications.
[2024-05-26 23:43:16] [INFO ] Flatten gal took : 15 ms
[2024-05-26 23:43:16] [INFO ] Flatten gal took : 16 ms
[2024-05-26 23:43:16] [INFO ] Input system was already deterministic with 126 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Applied a total of 0 rules in 4 ms. Remains 102 /102 variables (removed 0) and now considering 126/126 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 102/102 places, 126/126 transitions.
[2024-05-26 23:43:16] [INFO ] Flatten gal took : 11 ms
[2024-05-26 23:43:16] [INFO ] Flatten gal took : 11 ms
[2024-05-26 23:43:16] [INFO ] Input system was already deterministic with 126 transitions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Applied a total of 0 rules in 4 ms. Remains 102 /102 variables (removed 0) and now considering 126/126 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 102/102 places, 126/126 transitions.
[2024-05-26 23:43:16] [INFO ] Flatten gal took : 10 ms
[2024-05-26 23:43:16] [INFO ] Flatten gal took : 11 ms
[2024-05-26 23:43:16] [INFO ] Input system was already deterministic with 126 transitions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Applied a total of 0 rules in 2 ms. Remains 102 /102 variables (removed 0) and now considering 126/126 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 102/102 places, 126/126 transitions.
[2024-05-26 23:43:16] [INFO ] Flatten gal took : 11 ms
[2024-05-26 23:43:16] [INFO ] Flatten gal took : 12 ms
[2024-05-26 23:43:16] [INFO ] Input system was already deterministic with 126 transitions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Applied a total of 0 rules in 2 ms. Remains 102 /102 variables (removed 0) and now considering 126/126 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 102/102 places, 126/126 transitions.
[2024-05-26 23:43:16] [INFO ] Flatten gal took : 10 ms
[2024-05-26 23:43:16] [INFO ] Flatten gal took : 11 ms
[2024-05-26 23:43:16] [INFO ] Input system was already deterministic with 126 transitions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Applied a total of 0 rules in 4 ms. Remains 102 /102 variables (removed 0) and now considering 126/126 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 102/102 places, 126/126 transitions.
[2024-05-26 23:43:16] [INFO ] Flatten gal took : 8 ms
[2024-05-26 23:43:16] [INFO ] Flatten gal took : 9 ms
[2024-05-26 23:43:16] [INFO ] Input system was already deterministic with 126 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 102 transition count 94
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 64 place count 70 transition count 94
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 64 place count 70 transition count 74
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 104 place count 50 transition count 74
Applied a total of 104 rules in 11 ms. Remains 50 /102 variables (removed 52) and now considering 74/126 (removed 52) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 12 ms. Remains : 50/102 places, 74/126 transitions.
[2024-05-26 23:43:16] [INFO ] Flatten gal took : 5 ms
[2024-05-26 23:43:16] [INFO ] Flatten gal took : 5 ms
[2024-05-26 23:43:16] [INFO ] Input system was already deterministic with 74 transitions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Applied a total of 0 rules in 2 ms. Remains 102 /102 variables (removed 0) and now considering 126/126 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 102/102 places, 126/126 transitions.
[2024-05-26 23:43:16] [INFO ] Flatten gal took : 7 ms
[2024-05-26 23:43:16] [INFO ] Flatten gal took : 8 ms
[2024-05-26 23:43:16] [INFO ] Input system was already deterministic with 126 transitions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Applied a total of 0 rules in 5 ms. Remains 102 /102 variables (removed 0) and now considering 126/126 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 102/102 places, 126/126 transitions.
[2024-05-26 23:43:16] [INFO ] Flatten gal took : 7 ms
[2024-05-26 23:43:16] [INFO ] Flatten gal took : 7 ms
[2024-05-26 23:43:16] [INFO ] Input system was already deterministic with 126 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 102 transition count 95
Reduce places removed 31 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 33 rules applied. Total rules applied 64 place count 71 transition count 93
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 66 place count 69 transition count 93
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 16 Pre rules applied. Total rules applied 66 place count 69 transition count 77
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 98 place count 53 transition count 77
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 110 place count 47 transition count 71
Applied a total of 110 rules in 14 ms. Remains 47 /102 variables (removed 55) and now considering 71/126 (removed 55) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 14 ms. Remains : 47/102 places, 71/126 transitions.
[2024-05-26 23:43:16] [INFO ] Flatten gal took : 4 ms
[2024-05-26 23:43:16] [INFO ] Flatten gal took : 4 ms
[2024-05-26 23:43:16] [INFO ] Input system was already deterministic with 71 transitions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Applied a total of 0 rules in 5 ms. Remains 102 /102 variables (removed 0) and now considering 126/126 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 102/102 places, 126/126 transitions.
[2024-05-26 23:43:16] [INFO ] Flatten gal took : 7 ms
[2024-05-26 23:43:16] [INFO ] Flatten gal took : 7 ms
[2024-05-26 23:43:16] [INFO ] Input system was already deterministic with 126 transitions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Applied a total of 0 rules in 4 ms. Remains 102 /102 variables (removed 0) and now considering 126/126 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 102/102 places, 126/126 transitions.
[2024-05-26 23:43:16] [INFO ] Flatten gal took : 6 ms
[2024-05-26 23:43:16] [INFO ] Flatten gal took : 7 ms
[2024-05-26 23:43:16] [INFO ] Input system was already deterministic with 126 transitions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Applied a total of 0 rules in 4 ms. Remains 102 /102 variables (removed 0) and now considering 126/126 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 102/102 places, 126/126 transitions.
[2024-05-26 23:43:16] [INFO ] Flatten gal took : 6 ms
[2024-05-26 23:43:16] [INFO ] Flatten gal took : 7 ms
[2024-05-26 23:43:16] [INFO ] Input system was already deterministic with 126 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 102 transition count 90
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 72 place count 66 transition count 90
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 72 place count 66 transition count 72
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 108 place count 48 transition count 72
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 120 place count 42 transition count 66
Applied a total of 120 rules in 14 ms. Remains 42 /102 variables (removed 60) and now considering 66/126 (removed 60) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 14 ms. Remains : 42/102 places, 66/126 transitions.
[2024-05-26 23:43:16] [INFO ] Flatten gal took : 4 ms
[2024-05-26 23:43:16] [INFO ] Flatten gal took : 4 ms
[2024-05-26 23:43:16] [INFO ] Input system was already deterministic with 66 transitions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Applied a total of 0 rules in 4 ms. Remains 102 /102 variables (removed 0) and now considering 126/126 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 102/102 places, 126/126 transitions.
[2024-05-26 23:43:16] [INFO ] Flatten gal took : 6 ms
[2024-05-26 23:43:16] [INFO ] Flatten gal took : 6 ms
[2024-05-26 23:43:16] [INFO ] Input system was already deterministic with 126 transitions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Applied a total of 0 rules in 3 ms. Remains 102 /102 variables (removed 0) and now considering 126/126 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 102/102 places, 126/126 transitions.
[2024-05-26 23:43:16] [INFO ] Flatten gal took : 5 ms
[2024-05-26 23:43:16] [INFO ] Flatten gal took : 5 ms
[2024-05-26 23:43:16] [INFO ] Input system was already deterministic with 126 transitions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Applied a total of 0 rules in 2 ms. Remains 102 /102 variables (removed 0) and now considering 126/126 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 102/102 places, 126/126 transitions.
[2024-05-26 23:43:17] [INFO ] Flatten gal took : 4 ms
[2024-05-26 23:43:17] [INFO ] Flatten gal took : 5 ms
[2024-05-26 23:43:17] [INFO ] Input system was already deterministic with 126 transitions.
[2024-05-26 23:43:17] [INFO ] Flatten gal took : 7 ms
[2024-05-26 23:43:17] [INFO ] Flatten gal took : 7 ms
[2024-05-26 23:43:17] [INFO ] Export to MCC of 16 properties in file /home/mcc/execution/CTLFireability.sr.xml took 12 ms.
[2024-05-26 23:43:17] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 102 places, 126 transitions and 384 arcs took 6 ms.
Total runtime 27943 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running Peterson-PT-2

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/415/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 102
TRANSITIONS: 126
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.002s, Sys 0.001s]


SAVING FILE /home/mcc/execution/415/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: 696
MODEL NAME: /home/mcc/execution/415/model
102 places, 126 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 Peterson-PT-2-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Peterson-PT-2-CTLFireability-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Peterson-PT-2-CTLFireability-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Peterson-PT-2-CTLFireability-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Peterson-PT-2-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Peterson-PT-2-CTLFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Peterson-PT-2-CTLFireability-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Peterson-PT-2-CTLFireability-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Peterson-PT-2-CTLFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Peterson-PT-2-CTLFireability-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Peterson-PT-2-CTLFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Peterson-PT-2-CTLFireability-2024-14 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Peterson-PT-2-CTLFireability-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Peterson-PT-2-CTLFireability-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Peterson-PT-2-CTLFireability-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Peterson-PT-2-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716767004399

--------------------
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="Peterson-PT-2"
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 Peterson-PT-2, 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 r267-smll-171654406000250"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Peterson-PT-2.tgz
mv Peterson-PT-2 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;