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.r549-tall-171734898000209.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 FireWire-PT-06, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r549-tall-171734898000209
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 6.8K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K 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 16K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 9.9K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K 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 90K 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 FireWire-PT-06-CTLCardinality-2024-00
FORMULA_NAME FireWire-PT-06-CTLCardinality-2024-01
FORMULA_NAME FireWire-PT-06-CTLCardinality-2024-02
FORMULA_NAME FireWire-PT-06-CTLCardinality-2024-03
FORMULA_NAME FireWire-PT-06-CTLCardinality-2024-04
FORMULA_NAME FireWire-PT-06-CTLCardinality-2024-05
FORMULA_NAME FireWire-PT-06-CTLCardinality-2024-06
FORMULA_NAME FireWire-PT-06-CTLCardinality-2024-07
FORMULA_NAME FireWire-PT-06-CTLCardinality-2024-08
FORMULA_NAME FireWire-PT-06-CTLCardinality-2024-09
FORMULA_NAME FireWire-PT-06-CTLCardinality-2024-10
FORMULA_NAME FireWire-PT-06-CTLCardinality-2024-11
FORMULA_NAME FireWire-PT-06-CTLCardinality-2024-12
FORMULA_NAME FireWire-PT-06-CTLCardinality-2024-13
FORMULA_NAME FireWire-PT-06-CTLCardinality-2024-14
FORMULA_NAME FireWire-PT-06-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717365968195

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-02 22:06:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-02 22:06:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 22:06:09] [INFO ] Load time of PNML (sax parser for PT used): 73 ms
[2024-06-02 22:06:09] [INFO ] Transformed 116 places.
[2024-06-02 22:06:09] [INFO ] Transformed 368 transitions.
[2024-06-02 22:06:09] [INFO ] Found NUPN structural information;
[2024-06-02 22:06:09] [INFO ] Parsed PT model containing 116 places and 368 transitions and 1362 arcs in 166 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 15 ms.
Ensure Unique test removed 56 transitions
Reduce redundant transitions removed 56 transitions.
FORMULA FireWire-PT-06-CTLCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 76 out of 116 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 116/116 places, 312/312 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 116 transition count 306
Applied a total of 6 rules in 23 ms. Remains 116 /116 variables (removed 0) and now considering 306/312 (removed 6) transitions.
[2024-06-02 22:06:09] [INFO ] Flow matrix only has 280 transitions (discarded 26 similar events)
// Phase 1: matrix 280 rows 116 cols
[2024-06-02 22:06:09] [INFO ] Computed 9 invariants in 16 ms
[2024-06-02 22:06:09] [INFO ] Implicit Places using invariants in 225 ms returned []
[2024-06-02 22:06:09] [INFO ] Flow matrix only has 280 transitions (discarded 26 similar events)
[2024-06-02 22:06:09] [INFO ] Invariant cache hit.
[2024-06-02 22:06:10] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-06-02 22:06:10] [INFO ] Implicit Places using invariants and state equation in 227 ms returned []
Implicit Place search using SMT with State Equation took 487 ms to find 0 implicit places.
Running 305 sub problems to find dead transitions.
[2024-06-02 22:06:10] [INFO ] Flow matrix only has 280 transitions (discarded 26 similar events)
[2024-06-02 22:06:10] [INFO ] Invariant cache hit.
[2024-06-02 22:06:10] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 115/115 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 2 (OVERLAPS) 1/116 variables, 9/124 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 1/125 constraints. Problems are: Problem set: 0 solved, 305 unsolved
[2024-06-02 22:06:12] [INFO ] Deduced a trap composed of 3 places in 74 ms of which 7 ms to minimize.
[2024-06-02 22:06:12] [INFO ] Deduced a trap composed of 37 places in 36 ms of which 3 ms to minimize.
[2024-06-02 22:06:12] [INFO ] Deduced a trap composed of 63 places in 68 ms of which 2 ms to minimize.
[2024-06-02 22:06:13] [INFO ] Deduced a trap composed of 26 places in 64 ms of which 2 ms to minimize.
[2024-06-02 22:06:13] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2024-06-02 22:06:13] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 1 ms to minimize.
[2024-06-02 22:06:13] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 1 ms to minimize.
[2024-06-02 22:06:13] [INFO ] Deduced a trap composed of 36 places in 52 ms of which 1 ms to minimize.
[2024-06-02 22:06:14] [INFO ] Deduced a trap composed of 44 places in 35 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 9/134 constraints. Problems are: Problem set: 0 solved, 305 unsolved
[2024-06-02 22:06:14] [INFO ] Deduced a trap composed of 40 places in 66 ms of which 1 ms to minimize.
[2024-06-02 22:06:14] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 2/136 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 7 (OVERLAPS) 279/395 variables, 116/252 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/395 variables, 40/292 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/395 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 10 (OVERLAPS) 1/396 variables, 1/293 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/396 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 12 (OVERLAPS) 0/396 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 305 unsolved
No progress, stopping.
After SMT solving in domain Real declared 396/396 variables, and 293 constraints, problems are : Problem set: 0 solved, 305 unsolved in 16283 ms.
Refiners :[Domain max(s): 116/116 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 116/116 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 305/305 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 305 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 115/115 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 2 (OVERLAPS) 1/116 variables, 9/124 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 1/125 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 11/136 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 6 (OVERLAPS) 279/395 variables, 116/252 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/395 variables, 40/292 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/395 variables, 305/597 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/395 variables, 0/597 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 10 (OVERLAPS) 1/396 variables, 1/598 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/396 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 12 (OVERLAPS) 0/396 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 305 unsolved
No progress, stopping.
After SMT solving in domain Int declared 396/396 variables, and 598 constraints, problems are : Problem set: 0 solved, 305 unsolved in 19784 ms.
Refiners :[Domain max(s): 116/116 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 116/116 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 305/305 constraints, Known Traps: 11/11 constraints]
After SMT, in 36369ms problems are : Problem set: 0 solved, 305 unsolved
Search for dead transitions found 0 dead transitions in 36390ms
Starting structural reductions in LTL mode, iteration 1 : 116/116 places, 306/312 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36926 ms. Remains : 116/116 places, 306/312 transitions.
Support contains 76 out of 116 places after structural reductions.
[2024-06-02 22:06:46] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2024-06-02 22:06:46] [INFO ] Flatten gal took : 56 ms
FORMULA FireWire-PT-06-CTLCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-06-CTLCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-02 22:06:46] [INFO ] Flatten gal took : 26 ms
[2024-06-02 22:06:46] [INFO ] Input system was already deterministic with 306 transitions.
Support contains 66 out of 116 places (down from 76) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 51 to 50
RANDOM walk for 40000 steps (2026 resets) in 1774 ms. (22 steps per ms) remains 24/50 properties
BEST_FIRST walk for 4004 steps (52 resets) in 35 ms. (111 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (58 resets) in 38 ms. (102 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (54 resets) in 34 ms. (114 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (49 resets) in 18 ms. (210 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (43 resets) in 23 ms. (166 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (53 resets) in 17 ms. (222 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (52 resets) in 29 ms. (133 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (25 resets) in 12 ms. (307 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (121 resets) in 24 ms. (160 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (45 resets) in 26 ms. (148 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (63 resets) in 13 ms. (285 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (46 resets) in 22 ms. (174 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (51 resets) in 24 ms. (160 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (55 resets) in 27 ms. (143 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (55 resets) in 53 ms. (74 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (47 resets) in 29 ms. (133 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (54 resets) in 42 ms. (93 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (52 resets) in 24 ms. (160 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (51 resets) in 45 ms. (87 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (39 resets) in 34 ms. (114 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (52 resets) in 15 ms. (250 steps per ms) remains 23/24 properties
BEST_FIRST walk for 4003 steps (49 resets) in 11 ms. (333 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (49 resets) in 21 ms. (182 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (41 resets) in 13 ms. (285 steps per ms) remains 23/23 properties
[2024-06-02 22:06:47] [INFO ] Flow matrix only has 280 transitions (discarded 26 similar events)
[2024-06-02 22:06:47] [INFO ] Invariant cache hit.
[2024-06-02 22:06:47] [INFO ] State equation strengthened by 41 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 23 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp15 is UNSAT
At refinement iteration 2 (OVERLAPS) 79/116 variables, 9/46 constraints. Problems are: Problem set: 3 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 79/125 constraints. Problems are: Problem set: 3 solved, 20 unsolved
[2024-06-02 22:06:48] [INFO ] Deduced a trap composed of 15 places in 184 ms of which 2 ms to minimize.
[2024-06-02 22:06:48] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 1 ms to minimize.
[2024-06-02 22:06:48] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 1 ms to minimize.
[2024-06-02 22:06:48] [INFO ] Deduced a trap composed of 37 places in 55 ms of which 1 ms to minimize.
[2024-06-02 22:06:48] [INFO ] Deduced a trap composed of 38 places in 55 ms of which 1 ms to minimize.
[2024-06-02 22:06:48] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 6/131 constraints. Problems are: Problem set: 3 solved, 20 unsolved
[2024-06-02 22:06:48] [INFO ] Deduced a trap composed of 40 places in 61 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 1/132 constraints. Problems are: Problem set: 3 solved, 20 unsolved
[2024-06-02 22:06:48] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 1/133 constraints. Problems are: Problem set: 3 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/116 variables, 0/133 constraints. Problems are: Problem set: 3 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 279/395 variables, 116/249 constraints. Problems are: Problem set: 3 solved, 20 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/395 variables, 40/289 constraints. Problems are: Problem set: 3 solved, 20 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/395 variables, 0/289 constraints. Problems are: Problem set: 3 solved, 20 unsolved
At refinement iteration 11 (OVERLAPS) 1/396 variables, 1/290 constraints. Problems are: Problem set: 3 solved, 20 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/396 variables, 0/290 constraints. Problems are: Problem set: 3 solved, 20 unsolved
At refinement iteration 13 (OVERLAPS) 0/396 variables, 0/290 constraints. Problems are: Problem set: 3 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 396/396 variables, and 290 constraints, problems are : Problem set: 3 solved, 20 unsolved in 1483 ms.
Refiners :[Domain max(s): 116/116 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 116/116 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 3 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 29/29 constraints. Problems are: Problem set: 3 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 0/29 constraints. Problems are: Problem set: 3 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 78/107 variables, 6/35 constraints. Problems are: Problem set: 3 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 78/113 constraints. Problems are: Problem set: 3 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 7/120 constraints. Problems are: Problem set: 3 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/107 variables, 0/120 constraints. Problems are: Problem set: 3 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 9/116 variables, 3/123 constraints. Problems are: Problem set: 3 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/116 variables, 9/132 constraints. Problems are: Problem set: 3 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/116 variables, 1/133 constraints. Problems are: Problem set: 3 solved, 20 unsolved
[2024-06-02 22:06:49] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/116 variables, 1/134 constraints. Problems are: Problem set: 3 solved, 20 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/116 variables, 0/134 constraints. Problems are: Problem set: 3 solved, 20 unsolved
At refinement iteration 11 (OVERLAPS) 279/395 variables, 116/250 constraints. Problems are: Problem set: 3 solved, 20 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/395 variables, 40/290 constraints. Problems are: Problem set: 3 solved, 20 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/395 variables, 20/310 constraints. Problems are: Problem set: 3 solved, 20 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/395 variables, 0/310 constraints. Problems are: Problem set: 3 solved, 20 unsolved
At refinement iteration 15 (OVERLAPS) 1/396 variables, 1/311 constraints. Problems are: Problem set: 3 solved, 20 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/396 variables, 0/311 constraints. Problems are: Problem set: 3 solved, 20 unsolved
At refinement iteration 17 (OVERLAPS) 0/396 variables, 0/311 constraints. Problems are: Problem set: 3 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 396/396 variables, and 311 constraints, problems are : Problem set: 3 solved, 20 unsolved in 1244 ms.
Refiners :[Domain max(s): 116/116 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 116/116 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 20/23 constraints, Known Traps: 9/9 constraints]
After SMT, in 2746ms problems are : Problem set: 3 solved, 20 unsolved
Fused 20 Parikh solutions to 19 different solutions.
Parikh walk visited 0 properties in 529 ms.
Support contains 29 out of 116 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 116/116 places, 306/306 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 116 transition count 303
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 3 place count 116 transition count 302
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 115 transition count 302
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 7 place count 114 transition count 301
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 9 place count 113 transition count 303
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 11 place count 113 transition count 301
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 113 transition count 300
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 13 place count 112 transition count 299
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 14 place count 111 transition count 299
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 14 place count 111 transition count 298
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 16 place count 110 transition count 298
Applied a total of 16 rules in 54 ms. Remains 110 /116 variables (removed 6) and now considering 298/306 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 110/116 places, 298/306 transitions.
RANDOM walk for 40000 steps (2422 resets) in 474 ms. (84 steps per ms) remains 16/20 properties
BEST_FIRST walk for 4003 steps (49 resets) in 12 ms. (307 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (80 resets) in 22 ms. (174 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (54 resets) in 13 ms. (286 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (65 resets) in 15 ms. (250 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (60 resets) in 14 ms. (266 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (39 resets) in 16 ms. (235 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (69 resets) in 19 ms. (200 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (57 resets) in 20 ms. (190 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (53 resets) in 24 ms. (160 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (52 resets) in 24 ms. (160 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (62 resets) in 20 ms. (190 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (73 resets) in 16 ms. (235 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (56 resets) in 11 ms. (333 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (76 resets) in 14 ms. (266 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (102 resets) in 11 ms. (333 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (58 resets) in 18 ms. (210 steps per ms) remains 16/16 properties
[2024-06-02 22:06:51] [INFO ] Flow matrix only has 274 transitions (discarded 24 similar events)
// Phase 1: matrix 274 rows 110 cols
[2024-06-02 22:06:51] [INFO ] Computed 8 invariants in 8 ms
[2024-06-02 22:06:51] [INFO ] State equation strengthened by 40 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (OVERLAPS) 80/105 variables, 6/31 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 80/111 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-06-02 22:06:51] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
[2024-06-02 22:06:51] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 1 ms to minimize.
[2024-06-02 22:06:51] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 0 ms to minimize.
[2024-06-02 22:06:51] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 4/115 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 272/377 variables, 105/220 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/377 variables, 40/260 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-06-02 22:06:51] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/377 variables, 1/261 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/377 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (OVERLAPS) 7/384 variables, 5/266 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/384 variables, 5/271 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/384 variables, 2/273 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-06-02 22:06:52] [INFO ] Deduced a trap composed of 35 places in 77 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/384 variables, 1/274 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/384 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-06-02 22:06:52] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 1 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/384 variables, 1/275 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/384 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 17 (OVERLAPS) 0/384 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 384/384 variables, and 275 constraints, problems are : Problem set: 0 solved, 16 unsolved in 1362 ms.
Refiners :[Domain max(s): 110/110 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 110/110 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (OVERLAPS) 80/105 variables, 6/31 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 80/111 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 7/118 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-06-02 22:06:52] [INFO ] Deduced a trap composed of 48 places in 56 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/105 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 272/377 variables, 105/224 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/377 variables, 40/264 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/377 variables, 10/274 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/377 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 11 (OVERLAPS) 7/384 variables, 5/279 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/384 variables, 5/284 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/384 variables, 2/286 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/384 variables, 6/292 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-06-02 22:06:53] [INFO ] Deduced a trap composed of 42 places in 33 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/384 variables, 1/293 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/384 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 17 (OVERLAPS) 0/384 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 384/384 variables, and 293 constraints, problems are : Problem set: 0 solved, 16 unsolved in 1274 ms.
Refiners :[Domain max(s): 110/110 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 110/110 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 9/9 constraints]
After SMT, in 2657ms problems are : Problem set: 0 solved, 16 unsolved
Fused 16 Parikh solutions to 15 different solutions.
Parikh walk visited 0 properties in 556 ms.
Support contains 25 out of 110 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 110/110 places, 298/298 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
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 2 place count 109 transition count 300
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 109 transition count 298
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 109 transition count 297
Applied a total of 5 rules in 19 ms. Remains 109 /110 variables (removed 1) and now considering 297/298 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 109/110 places, 297/298 transitions.
RANDOM walk for 40000 steps (2494 resets) in 312 ms. (127 steps per ms) remains 15/16 properties
BEST_FIRST walk for 4004 steps (49 resets) in 14 ms. (266 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (51 resets) in 14 ms. (266 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (58 resets) in 13 ms. (285 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (76 resets) in 13 ms. (285 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (44 resets) in 19 ms. (200 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (47 resets) in 11 ms. (333 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (72 resets) in 14 ms. (266 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (68 resets) in 13 ms. (285 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (54 resets) in 11 ms. (333 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (47 resets) in 12 ms. (307 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (63 resets) in 13 ms. (285 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (66 resets) in 14 ms. (266 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (63 resets) in 14 ms. (266 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (65 resets) in 15 ms. (250 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (57 resets) in 14 ms. (266 steps per ms) remains 15/15 properties
Probabilistic random walk after 1000001 steps, saw 195331 distinct states, run finished after 1712 ms. (steps per millisecond=584 ) properties seen :14
[2024-06-02 22:06:56] [INFO ] Flow matrix only has 271 transitions (discarded 26 similar events)
// Phase 1: matrix 271 rows 109 cols
[2024-06-02 22:06:56] [INFO ] Computed 8 invariants in 4 ms
[2024-06-02 22:06:56] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 75/80 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 75/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 246/326 variables, 80/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/326 variables, 28/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/326 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 52/378 variables, 27/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/378 variables, 27/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/378 variables, 3/249 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/378 variables, 12/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/378 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/380 variables, 2/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/380 variables, 2/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/380 variables, 1/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/380 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/380 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 380/380 variables, and 266 constraints, problems are : Problem set: 0 solved, 1 unsolved in 121 ms.
Refiners :[Domain max(s): 109/109 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 109/109 constraints, ReadFeed: 40/40 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/5 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 75/80 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 75/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 246/326 variables, 80/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/326 variables, 28/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/326 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 52/378 variables, 27/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/378 variables, 27/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/378 variables, 3/249 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/378 variables, 12/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/378 variables, 1/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 22:06:56] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/378 variables, 1/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/378 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/380 variables, 2/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/380 variables, 2/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/380 variables, 1/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/380 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/380 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 380/380 variables, and 268 constraints, problems are : Problem set: 0 solved, 1 unsolved in 214 ms.
Refiners :[Domain max(s): 109/109 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 109/109 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 344ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 3 ms.
Support contains 5 out of 109 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 109/109 places, 297/297 transitions.
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 0 with 4 rules applied. Total rules applied 4 place count 107 transition count 295
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 107 transition count 293
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 107 transition count 295
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 10 place count 106 transition count 293
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 12 place count 106 transition count 291
Applied a total of 12 rules in 39 ms. Remains 106 /109 variables (removed 3) and now considering 291/297 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 106/109 places, 291/297 transitions.
RANDOM walk for 40000 steps (2458 resets) in 73 ms. (540 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (618 resets) in 26 ms. (1481 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 24429 steps, run visited all 1 properties in 44 ms. (steps per millisecond=555 )
Probabilistic random walk after 24429 steps, saw 7165 distinct states, run finished after 47 ms. (steps per millisecond=519 ) properties seen :1
Successfully simplified 3 atomic propositions for a total of 13 simplifications.
[2024-06-02 22:06:57] [INFO ] Flatten gal took : 17 ms
[2024-06-02 22:06:57] [INFO ] Flatten gal took : 18 ms
[2024-06-02 22:06:57] [INFO ] Input system was already deterministic with 306 transitions.
Support contains 59 out of 116 places (down from 60) after GAL structural reductions.
Computed a total of 3 stabilizing places and 2 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 116/116 places, 306/306 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 115 transition count 304
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 2 place count 114 transition count 304
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 113 transition count 302
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 113 transition count 302
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 0 with 2 rules applied. Total rules applied 6 place count 112 transition count 301
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 112 transition count 299
Applied a total of 8 rules in 27 ms. Remains 112 /116 variables (removed 4) and now considering 299/306 (removed 7) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 27 ms. Remains : 112/116 places, 299/306 transitions.
[2024-06-02 22:06:57] [INFO ] Flatten gal took : 15 ms
[2024-06-02 22:06:57] [INFO ] Flatten gal took : 16 ms
[2024-06-02 22:06:57] [INFO ] Input system was already deterministic with 299 transitions.
Starting structural reductions in LTL mode, iteration 0 : 116/116 places, 306/306 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 115 transition count 304
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 115 transition count 304
Applied a total of 2 rules in 3 ms. Remains 115 /116 variables (removed 1) and now considering 304/306 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 115/116 places, 304/306 transitions.
[2024-06-02 22:06:57] [INFO ] Flatten gal took : 13 ms
[2024-06-02 22:06:57] [INFO ] Flatten gal took : 13 ms
[2024-06-02 22:06:57] [INFO ] Input system was already deterministic with 304 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 116/116 places, 306/306 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 115 transition count 304
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 2 place count 114 transition count 304
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 113 transition count 302
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 113 transition count 302
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 0 with 2 rules applied. Total rules applied 6 place count 112 transition count 301
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 112 transition count 299
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 9 place count 111 transition count 298
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 10 place count 110 transition count 298
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 10 place count 110 transition count 297
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 12 place count 109 transition count 297
Applied a total of 12 rules in 29 ms. Remains 109 /116 variables (removed 7) and now considering 297/306 (removed 9) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 29 ms. Remains : 109/116 places, 297/306 transitions.
[2024-06-02 22:06:57] [INFO ] Flatten gal took : 13 ms
[2024-06-02 22:06:57] [INFO ] Flatten gal took : 13 ms
[2024-06-02 22:06:57] [INFO ] Input system was already deterministic with 297 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 116/116 places, 306/306 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 115 transition count 304
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 2 place count 114 transition count 304
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 113 transition count 302
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 113 transition count 302
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 0 with 2 rules applied. Total rules applied 6 place count 112 transition count 301
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 112 transition count 299
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 9 place count 111 transition count 298
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 10 place count 110 transition count 298
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 10 place count 110 transition count 297
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 12 place count 109 transition count 297
Applied a total of 12 rules in 28 ms. Remains 109 /116 variables (removed 7) and now considering 297/306 (removed 9) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 28 ms. Remains : 109/116 places, 297/306 transitions.
[2024-06-02 22:06:57] [INFO ] Flatten gal took : 11 ms
[2024-06-02 22:06:57] [INFO ] Flatten gal took : 11 ms
[2024-06-02 22:06:57] [INFO ] Input system was already deterministic with 297 transitions.
Starting structural reductions in LTL mode, iteration 0 : 116/116 places, 306/306 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 115 transition count 304
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 115 transition count 304
Applied a total of 2 rules in 3 ms. Remains 115 /116 variables (removed 1) and now considering 304/306 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 115/116 places, 304/306 transitions.
[2024-06-02 22:06:57] [INFO ] Flatten gal took : 10 ms
[2024-06-02 22:06:57] [INFO ] Flatten gal took : 11 ms
[2024-06-02 22:06:57] [INFO ] Input system was already deterministic with 304 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 116/116 places, 306/306 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 116 transition count 305
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 2 place count 115 transition count 305
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 114 transition count 303
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 114 transition count 303
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 6 place count 113 transition count 302
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 113 transition count 300
Applied a total of 8 rules in 17 ms. Remains 113 /116 variables (removed 3) and now considering 300/306 (removed 6) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 17 ms. Remains : 113/116 places, 300/306 transitions.
[2024-06-02 22:06:57] [INFO ] Flatten gal took : 10 ms
[2024-06-02 22:06:57] [INFO ] Flatten gal took : 11 ms
[2024-06-02 22:06:57] [INFO ] Input system was already deterministic with 300 transitions.
Starting structural reductions in LTL mode, iteration 0 : 116/116 places, 306/306 transitions.
Applied a total of 0 rules in 1 ms. Remains 116 /116 variables (removed 0) and now considering 306/306 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 116/116 places, 306/306 transitions.
[2024-06-02 22:06:57] [INFO ] Flatten gal took : 10 ms
[2024-06-02 22:06:57] [INFO ] Flatten gal took : 10 ms
[2024-06-02 22:06:57] [INFO ] Input system was already deterministic with 306 transitions.
Starting structural reductions in LTL mode, iteration 0 : 116/116 places, 306/306 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 115 transition count 304
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 115 transition count 304
Applied a total of 2 rules in 2 ms. Remains 115 /116 variables (removed 1) and now considering 304/306 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 115/116 places, 304/306 transitions.
[2024-06-02 22:06:57] [INFO ] Flatten gal took : 10 ms
[2024-06-02 22:06:57] [INFO ] Flatten gal took : 9 ms
[2024-06-02 22:06:57] [INFO ] Input system was already deterministic with 304 transitions.
Starting structural reductions in LTL mode, iteration 0 : 116/116 places, 306/306 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 115 transition count 304
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 115 transition count 304
Applied a total of 2 rules in 2 ms. Remains 115 /116 variables (removed 1) and now considering 304/306 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 115/116 places, 304/306 transitions.
[2024-06-02 22:06:57] [INFO ] Flatten gal took : 9 ms
[2024-06-02 22:06:57] [INFO ] Flatten gal took : 10 ms
[2024-06-02 22:06:57] [INFO ] Input system was already deterministic with 304 transitions.
Starting structural reductions in LTL mode, iteration 0 : 116/116 places, 306/306 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 115 transition count 304
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 115 transition count 304
Applied a total of 2 rules in 2 ms. Remains 115 /116 variables (removed 1) and now considering 304/306 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 115/116 places, 304/306 transitions.
[2024-06-02 22:06:57] [INFO ] Flatten gal took : 9 ms
[2024-06-02 22:06:57] [INFO ] Flatten gal took : 10 ms
[2024-06-02 22:06:57] [INFO ] Input system was already deterministic with 304 transitions.
Starting structural reductions in LTL mode, iteration 0 : 116/116 places, 306/306 transitions.
Applied a total of 0 rules in 1 ms. Remains 116 /116 variables (removed 0) and now considering 306/306 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 116/116 places, 306/306 transitions.
[2024-06-02 22:06:57] [INFO ] Flatten gal took : 9 ms
[2024-06-02 22:06:57] [INFO ] Flatten gal took : 10 ms
[2024-06-02 22:06:57] [INFO ] Input system was already deterministic with 306 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 116/116 places, 306/306 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 115 transition count 304
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 2 place count 114 transition count 304
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 113 transition count 302
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 113 transition count 302
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 6 place count 112 transition count 301
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 112 transition count 299
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 9 place count 111 transition count 298
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 10 place count 110 transition count 298
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 10 place count 110 transition count 297
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 12 place count 109 transition count 297
Applied a total of 12 rules in 25 ms. Remains 109 /116 variables (removed 7) and now considering 297/306 (removed 9) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 25 ms. Remains : 109/116 places, 297/306 transitions.
[2024-06-02 22:06:57] [INFO ] Flatten gal took : 9 ms
[2024-06-02 22:06:57] [INFO ] Flatten gal took : 9 ms
[2024-06-02 22:06:57] [INFO ] Input system was already deterministic with 297 transitions.
Starting structural reductions in LTL mode, iteration 0 : 116/116 places, 306/306 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 115 transition count 304
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 115 transition count 304
Applied a total of 2 rules in 2 ms. Remains 115 /116 variables (removed 1) and now considering 304/306 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 115/116 places, 304/306 transitions.
[2024-06-02 22:06:57] [INFO ] Flatten gal took : 9 ms
[2024-06-02 22:06:57] [INFO ] Flatten gal took : 9 ms
[2024-06-02 22:06:57] [INFO ] Input system was already deterministic with 304 transitions.
[2024-06-02 22:06:57] [INFO ] Flatten gal took : 10 ms
[2024-06-02 22:06:57] [INFO ] Flatten gal took : 10 ms
[2024-06-02 22:06:57] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2024-06-02 22:06:57] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 116 places, 306 transitions and 1118 arcs took 3 ms.
Total runtime 48519 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running FireWire-PT-06

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/416/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 116
TRANSITIONS: 306
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.006s, Sys 0.000s]


SAVING FILE /home/mcc/execution/416/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: 666
MODEL NAME: /home/mcc/execution/416/model
116 places, 306 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 FireWire-PT-06-CTLCardinality-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-06-CTLCardinality-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-06-CTLCardinality-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-06-CTLCardinality-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-06-CTLCardinality-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-06-CTLCardinality-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-06-CTLCardinality-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-06-CTLCardinality-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-06-CTLCardinality-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-06-CTLCardinality-2024-13 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-06-CTLCardinality-2024-12 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-06-CTLCardinality-2024-15 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-06-CTLCardinality-2024-14 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1717366037451

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FireWire-PT-06"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is FireWire-PT-06, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r549-tall-171734898000209"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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