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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 516K
-rw-r--r-- 1 mcc users 6.9K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K 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.2K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K 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.6K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 104K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K 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 86K 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-02-CTLCardinality-2024-00
FORMULA_NAME FireWire-PT-02-CTLCardinality-2024-01
FORMULA_NAME FireWire-PT-02-CTLCardinality-2024-02
FORMULA_NAME FireWire-PT-02-CTLCardinality-2024-03
FORMULA_NAME FireWire-PT-02-CTLCardinality-2024-04
FORMULA_NAME FireWire-PT-02-CTLCardinality-2024-05
FORMULA_NAME FireWire-PT-02-CTLCardinality-2024-06
FORMULA_NAME FireWire-PT-02-CTLCardinality-2024-07
FORMULA_NAME FireWire-PT-02-CTLCardinality-2024-08
FORMULA_NAME FireWire-PT-02-CTLCardinality-2024-09
FORMULA_NAME FireWire-PT-02-CTLCardinality-2024-10
FORMULA_NAME FireWire-PT-02-CTLCardinality-2024-11
FORMULA_NAME FireWire-PT-02-CTLCardinality-2024-12
FORMULA_NAME FireWire-PT-02-CTLCardinality-2024-13
FORMULA_NAME FireWire-PT-02-CTLCardinality-2024-14
FORMULA_NAME FireWire-PT-02-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717365185152

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-02
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-02 21:53:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-02 21:53:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 21:53:06] [INFO ] Load time of PNML (sax parser for PT used): 76 ms
[2024-06-02 21:53:06] [INFO ] Transformed 108 places.
[2024-06-02 21:53:06] [INFO ] Transformed 355 transitions.
[2024-06-02 21:53:06] [INFO ] Found NUPN structural information;
[2024-06-02 21:53:06] [INFO ] Parsed PT model containing 108 places and 355 transitions and 1311 arcs in 173 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 14 ms.
Ensure Unique test removed 54 transitions
Reduce redundant transitions removed 54 transitions.
FORMULA FireWire-PT-02-CTLCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-02-CTLCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-02-CTLCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-02-CTLCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 63 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 301/301 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 108 transition count 295
Applied a total of 6 rules in 22 ms. Remains 108 /108 variables (removed 0) and now considering 295/301 (removed 6) transitions.
[2024-06-02 21:53:06] [INFO ] Flow matrix only has 269 transitions (discarded 26 similar events)
// Phase 1: matrix 269 rows 108 cols
[2024-06-02 21:53:06] [INFO ] Computed 8 invariants in 20 ms
[2024-06-02 21:53:06] [INFO ] Implicit Places using invariants in 214 ms returned []
[2024-06-02 21:53:06] [INFO ] Flow matrix only has 269 transitions (discarded 26 similar events)
[2024-06-02 21:53:06] [INFO ] Invariant cache hit.
[2024-06-02 21:53:06] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 21:53:06] [INFO ] Implicit Places using invariants and state equation in 161 ms returned [67]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 405 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 107/108 places, 295/301 transitions.
Applied a total of 0 rules in 4 ms. Remains 107 /107 variables (removed 0) and now considering 295/295 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 447 ms. Remains : 107/108 places, 295/301 transitions.
Support contains 63 out of 107 places after structural reductions.
[2024-06-02 21:53:07] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-06-02 21:53:07] [INFO ] Flatten gal took : 72 ms
FORMULA FireWire-PT-02-CTLCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-02 21:53:07] [INFO ] Flatten gal took : 39 ms
[2024-06-02 21:53:07] [INFO ] Input system was already deterministic with 295 transitions.
Support contains 55 out of 107 places (down from 63) after GAL structural reductions.
RANDOM walk for 40000 steps (2204 resets) in 2658 ms. (15 steps per ms) remains 18/37 properties
BEST_FIRST walk for 4004 steps (47 resets) in 57 ms. (69 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (58 resets) in 38 ms. (102 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (61 resets) in 14 ms. (266 steps per ms) remains 16/18 properties
BEST_FIRST walk for 4003 steps (74 resets) in 14 ms. (266 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (62 resets) in 12 ms. (308 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (61 resets) in 15 ms. (250 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (46 resets) in 12 ms. (307 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (51 resets) in 17 ms. (222 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (52 resets) in 13 ms. (285 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (61 resets) in 21 ms. (181 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (41 resets) in 16 ms. (235 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (51 resets) in 27 ms. (143 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (70 resets) in 15 ms. (250 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (45 resets) in 12 ms. (307 steps per ms) remains 15/16 properties
BEST_FIRST walk for 4003 steps (50 resets) in 13 ms. (285 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (53 resets) in 32 ms. (121 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (45 resets) in 20 ms. (190 steps per ms) remains 15/15 properties
[2024-06-02 21:53:08] [INFO ] Flow matrix only has 269 transitions (discarded 26 similar events)
// Phase 1: matrix 269 rows 107 cols
[2024-06-02 21:53:08] [INFO ] Computed 7 invariants in 7 ms
[2024-06-02 21:53:08] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 15 unsolved
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp35 is UNSAT
At refinement iteration 2 (OVERLAPS) 70/101 variables, 6/37 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 70/107 constraints. Problems are: Problem set: 2 solved, 13 unsolved
[2024-06-02 21:53:08] [INFO ] Deduced a trap composed of 22 places in 336 ms of which 29 ms to minimize.
[2024-06-02 21:53:09] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
[2024-06-02 21:53:09] [INFO ] Deduced a trap composed of 36 places in 39 ms of which 1 ms to minimize.
[2024-06-02 21:53:09] [INFO ] Deduced a trap composed of 67 places in 68 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 4/111 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/101 variables, 0/111 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 6 (OVERLAPS) 2/103 variables, 1/112 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/103 variables, 2/114 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/103 variables, 0/114 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 9 (OVERLAPS) 265/368 variables, 103/217 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/368 variables, 38/255 constraints. Problems are: Problem set: 2 solved, 13 unsolved
[2024-06-02 21:53:09] [INFO ] Deduced a trap composed of 33 places in 75 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/368 variables, 1/256 constraints. Problems are: Problem set: 2 solved, 13 unsolved
[2024-06-02 21:53:09] [INFO ] Deduced a trap composed of 67 places in 74 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/368 variables, 1/257 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/368 variables, 0/257 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 14 (OVERLAPS) 4/372 variables, 2/259 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/372 variables, 2/261 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/372 variables, 1/262 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/372 variables, 0/262 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 18 (OVERLAPS) 3/375 variables, 2/264 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/375 variables, 2/266 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/375 variables, 0/266 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 21 (OVERLAPS) 1/376 variables, 1/267 constraints. Problems are: Problem set: 2 solved, 13 unsolved
[2024-06-02 21:53:11] [INFO ] Deduced a trap composed of 51 places in 65 ms of which 2 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/376 variables, 1/268 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/376 variables, 0/268 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 24 (OVERLAPS) 0/376 variables, 0/268 constraints. Problems are: Problem set: 2 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 376/376 variables, and 268 constraints, problems are : Problem set: 2 solved, 13 unsolved in 2987 ms.
Refiners :[Domain max(s): 107/107 constraints, Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 107/107 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 2 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 19/19 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/19 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 82/101 variables, 6/25 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 82/107 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 7/114 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/101 variables, 0/114 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 6 (OVERLAPS) 2/103 variables, 1/115 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/103 variables, 2/117 constraints. Problems are: Problem set: 2 solved, 13 unsolved
[2024-06-02 21:53:11] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/103 variables, 1/118 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/103 variables, 0/118 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 10 (OVERLAPS) 265/368 variables, 103/221 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/368 variables, 38/259 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/368 variables, 12/271 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/368 variables, 0/271 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 14 (OVERLAPS) 4/372 variables, 2/273 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/372 variables, 2/275 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/372 variables, 1/276 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/372 variables, 1/277 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/372 variables, 0/277 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 19 (OVERLAPS) 3/375 variables, 2/279 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/375 variables, 2/281 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/375 variables, 0/281 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 22 (OVERLAPS) 1/376 variables, 1/282 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/376 variables, 0/282 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 24 (OVERLAPS) 0/376 variables, 0/282 constraints. Problems are: Problem set: 2 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 376/376 variables, and 282 constraints, problems are : Problem set: 2 solved, 13 unsolved in 1676 ms.
Refiners :[Domain max(s): 107/107 constraints, Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 107/107 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 13/15 constraints, Known Traps: 8/8 constraints]
After SMT, in 4739ms problems are : Problem set: 2 solved, 13 unsolved
Parikh walk visited 2 properties in 7152 ms.
Support contains 15 out of 107 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 107/107 places, 295/295 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 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 4 rules applied. Total rules applied 4 place count 107 transition count 291
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 5 place count 106 transition count 291
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 5 place count 106 transition count 290
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 105 transition count 290
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 11 place count 101 transition count 280
Iterating global reduction 2 with 4 rules applied. Total rules applied 15 place count 101 transition count 280
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 17 place count 101 transition count 278
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 19 place count 99 transition count 274
Iterating global reduction 3 with 2 rules applied. Total rules applied 21 place count 99 transition count 274
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 25 place count 97 transition count 278
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 29 place count 97 transition count 274
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 31 place count 97 transition count 272
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 32 place count 97 transition count 274
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 4 with 3 rules applied. Total rules applied 35 place count 96 transition count 272
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 37 place count 96 transition count 270
Applied a total of 37 rules in 89 ms. Remains 96 /107 variables (removed 11) and now considering 270/295 (removed 25) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 89 ms. Remains : 96/107 places, 270/295 transitions.
RANDOM walk for 40000 steps (2448 resets) in 1034 ms. (38 steps per ms) remains 9/11 properties
BEST_FIRST walk for 40003 steps (647 resets) in 109 ms. (363 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (649 resets) in 56 ms. (701 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (613 resets) in 73 ms. (540 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (685 resets) in 92 ms. (430 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (646 resets) in 71 ms. (555 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (618 resets) in 107 ms. (370 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (588 resets) in 81 ms. (487 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (631 resets) in 88 ms. (449 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (673 resets) in 49 ms. (800 steps per ms) remains 9/9 properties
[2024-06-02 21:53:21] [INFO ] Flow matrix only has 243 transitions (discarded 27 similar events)
// Phase 1: matrix 243 rows 96 cols
[2024-06-02 21:53:21] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 21:53:21] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 79/92 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-02 21:53:21] [INFO ] Deduced a trap composed of 34 places in 97 ms of which 2 ms to minimize.
[2024-06-02 21:53:21] [INFO ] Deduced a trap composed of 16 places in 21 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 2/94 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/94 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 242/336 variables, 94/103 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/336 variables, 38/141 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/336 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 9 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 3/339 variables, 2/143 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/339 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/339 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (OVERLAPS) 0/339 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 339/339 variables, and 144 constraints, problems are : Problem set: 0 solved, 9 unsolved in 642 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 96/96 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 79/92 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 2/94 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/94 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 242/336 variables, 94/103 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/336 variables, 38/141 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/336 variables, 8/149 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/336 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 3/339 variables, 2/151 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/339 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/339 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/339 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (OVERLAPS) 0/339 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 339/339 variables, and 153 constraints, problems are : Problem set: 0 solved, 9 unsolved in 485 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 96/96 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 2/2 constraints]
After SMT, in 1149ms problems are : Problem set: 0 solved, 9 unsolved
Fused 9 Parikh solutions to 7 different solutions.
Parikh walk visited 2 properties in 1142 ms.
Support contains 10 out of 96 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 270/270 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 95 transition count 268
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 95 transition count 268
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 95 transition count 267
Applied a total of 3 rules in 14 ms. Remains 95 /96 variables (removed 1) and now considering 267/270 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 95/96 places, 267/270 transitions.
RANDOM walk for 40000 steps (2427 resets) in 144 ms. (275 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (672 resets) in 76 ms. (519 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (621 resets) in 70 ms. (563 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (634 resets) in 265 ms. (150 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (694 resets) in 69 ms. (571 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (622 resets) in 57 ms. (689 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (676 resets) in 39 ms. (1000 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (725 resets) in 33 ms. (1176 steps per ms) remains 7/7 properties
Finished probabilistic random walk after 5491 steps, run visited all 7 properties in 55 ms. (steps per millisecond=99 )
Probabilistic random walk after 5491 steps, saw 3065 distinct states, run finished after 60 ms. (steps per millisecond=91 ) properties seen :7
Successfully simplified 2 atomic propositions for a total of 10 simplifications.
[2024-06-02 21:53:23] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-06-02 21:53:23] [INFO ] Flatten gal took : 17 ms
FORMULA FireWire-PT-02-CTLCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-02 21:53:23] [INFO ] Flatten gal took : 17 ms
[2024-06-02 21:53:23] [INFO ] Input system was already deterministic with 295 transitions.
Computed a total of 5 stabilizing places and 11 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 107/107 places, 295/295 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 106 transition count 293
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 105 transition count 293
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 105 transition count 292
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 104 transition count 292
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 10 place count 98 transition count 277
Iterating global reduction 2 with 6 rules applied. Total rules applied 16 place count 98 transition count 277
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 19 place count 98 transition count 274
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 22 place count 95 transition count 268
Iterating global reduction 3 with 3 rules applied. Total rules applied 25 place count 95 transition count 268
Applied a total of 25 rules in 22 ms. Remains 95 /107 variables (removed 12) and now considering 268/295 (removed 27) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 22 ms. Remains : 95/107 places, 268/295 transitions.
[2024-06-02 21:53:23] [INFO ] Flatten gal took : 13 ms
[2024-06-02 21:53:23] [INFO ] Flatten gal took : 13 ms
[2024-06-02 21:53:23] [INFO ] Input system was already deterministic with 268 transitions.
RANDOM walk for 40000 steps (2621 resets) in 428 ms. (93 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (670 resets) in 161 ms. (246 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 2560 steps, run visited all 1 properties in 11 ms. (steps per millisecond=232 )
Probabilistic random walk after 2560 steps, saw 1193 distinct states, run finished after 11 ms. (steps per millisecond=232 ) properties seen :1
FORMULA FireWire-PT-02-CTLCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 107/107 places, 295/295 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 107 transition count 294
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 106 transition count 294
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 106 transition count 293
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 105 transition count 293
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 10 place count 99 transition count 278
Iterating global reduction 2 with 6 rules applied. Total rules applied 16 place count 99 transition count 278
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 19 place count 99 transition count 275
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 22 place count 96 transition count 269
Iterating global reduction 3 with 3 rules applied. Total rules applied 25 place count 96 transition count 269
Applied a total of 25 rules in 22 ms. Remains 96 /107 variables (removed 11) and now considering 269/295 (removed 26) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 22 ms. Remains : 96/107 places, 269/295 transitions.
[2024-06-02 21:53:24] [INFO ] Flatten gal took : 12 ms
[2024-06-02 21:53:24] [INFO ] Flatten gal took : 12 ms
[2024-06-02 21:53:24] [INFO ] Input system was already deterministic with 269 transitions.
Starting structural reductions in LTL mode, iteration 0 : 107/107 places, 295/295 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 101 transition count 280
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 101 transition count 280
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 15 place count 101 transition count 277
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 17 place count 99 transition count 273
Iterating global reduction 1 with 2 rules applied. Total rules applied 19 place count 99 transition count 273
Applied a total of 19 rules in 6 ms. Remains 99 /107 variables (removed 8) and now considering 273/295 (removed 22) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 99/107 places, 273/295 transitions.
[2024-06-02 21:53:24] [INFO ] Flatten gal took : 11 ms
[2024-06-02 21:53:24] [INFO ] Flatten gal took : 12 ms
[2024-06-02 21:53:24] [INFO ] Input system was already deterministic with 273 transitions.
Starting structural reductions in LTL mode, iteration 0 : 107/107 places, 295/295 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 101 transition count 280
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 101 transition count 280
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 15 place count 101 transition count 277
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 18 place count 98 transition count 271
Iterating global reduction 1 with 3 rules applied. Total rules applied 21 place count 98 transition count 271
Applied a total of 21 rules in 6 ms. Remains 98 /107 variables (removed 9) and now considering 271/295 (removed 24) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 98/107 places, 271/295 transitions.
[2024-06-02 21:53:24] [INFO ] Flatten gal took : 11 ms
[2024-06-02 21:53:24] [INFO ] Flatten gal took : 10 ms
[2024-06-02 21:53:24] [INFO ] Input system was already deterministic with 271 transitions.
Starting structural reductions in LTL mode, iteration 0 : 107/107 places, 295/295 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 102 transition count 282
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 102 transition count 282
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 102 transition count 280
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 14 place count 100 transition count 276
Iterating global reduction 1 with 2 rules applied. Total rules applied 16 place count 100 transition count 276
Applied a total of 16 rules in 4 ms. Remains 100 /107 variables (removed 7) and now considering 276/295 (removed 19) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 100/107 places, 276/295 transitions.
[2024-06-02 21:53:24] [INFO ] Flatten gal took : 10 ms
[2024-06-02 21:53:24] [INFO ] Flatten gal took : 10 ms
[2024-06-02 21:53:24] [INFO ] Input system was already deterministic with 276 transitions.
Starting structural reductions in LTL mode, iteration 0 : 107/107 places, 295/295 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 101 transition count 280
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 101 transition count 280
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 15 place count 101 transition count 277
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 18 place count 98 transition count 271
Iterating global reduction 1 with 3 rules applied. Total rules applied 21 place count 98 transition count 271
Applied a total of 21 rules in 4 ms. Remains 98 /107 variables (removed 9) and now considering 271/295 (removed 24) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 98/107 places, 271/295 transitions.
[2024-06-02 21:53:24] [INFO ] Flatten gal took : 9 ms
[2024-06-02 21:53:24] [INFO ] Flatten gal took : 10 ms
[2024-06-02 21:53:24] [INFO ] Input system was already deterministic with 271 transitions.
Starting structural reductions in LTL mode, iteration 0 : 107/107 places, 295/295 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 102 transition count 282
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 102 transition count 282
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 102 transition count 280
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 15 place count 99 transition count 274
Iterating global reduction 1 with 3 rules applied. Total rules applied 18 place count 99 transition count 274
Applied a total of 18 rules in 4 ms. Remains 99 /107 variables (removed 8) and now considering 274/295 (removed 21) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 99/107 places, 274/295 transitions.
[2024-06-02 21:53:24] [INFO ] Flatten gal took : 9 ms
[2024-06-02 21:53:24] [INFO ] Flatten gal took : 9 ms
[2024-06-02 21:53:24] [INFO ] Input system was already deterministic with 274 transitions.
Starting structural reductions in LTL mode, iteration 0 : 107/107 places, 295/295 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 102 transition count 282
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 102 transition count 282
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 102 transition count 280
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 15 place count 99 transition count 274
Iterating global reduction 1 with 3 rules applied. Total rules applied 18 place count 99 transition count 274
Applied a total of 18 rules in 4 ms. Remains 99 /107 variables (removed 8) and now considering 274/295 (removed 21) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 99/107 places, 274/295 transitions.
[2024-06-02 21:53:24] [INFO ] Flatten gal took : 9 ms
[2024-06-02 21:53:24] [INFO ] Flatten gal took : 9 ms
[2024-06-02 21:53:24] [INFO ] Input system was already deterministic with 274 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 107/107 places, 295/295 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 106 transition count 293
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 105 transition count 293
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 105 transition count 292
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 104 transition count 292
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 8 place count 100 transition count 282
Iterating global reduction 2 with 4 rules applied. Total rules applied 12 place count 100 transition count 282
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 14 place count 100 transition count 280
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 16 place count 98 transition count 276
Iterating global reduction 3 with 2 rules applied. Total rules applied 18 place count 98 transition count 276
Applied a total of 18 rules in 19 ms. Remains 98 /107 variables (removed 9) and now considering 276/295 (removed 19) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 19 ms. Remains : 98/107 places, 276/295 transitions.
[2024-06-02 21:53:24] [INFO ] Flatten gal took : 10 ms
[2024-06-02 21:53:24] [INFO ] Flatten gal took : 10 ms
[2024-06-02 21:53:24] [INFO ] Input system was already deterministic with 276 transitions.
Starting structural reductions in LTL mode, iteration 0 : 107/107 places, 295/295 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 101 transition count 280
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 101 transition count 280
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 15 place count 101 transition count 277
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 18 place count 98 transition count 271
Iterating global reduction 1 with 3 rules applied. Total rules applied 21 place count 98 transition count 271
Applied a total of 21 rules in 4 ms. Remains 98 /107 variables (removed 9) and now considering 271/295 (removed 24) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 98/107 places, 271/295 transitions.
[2024-06-02 21:53:24] [INFO ] Flatten gal took : 9 ms
[2024-06-02 21:53:24] [INFO ] Flatten gal took : 10 ms
[2024-06-02 21:53:24] [INFO ] Input system was already deterministic with 271 transitions.
[2024-06-02 21:53:24] [INFO ] Flatten gal took : 10 ms
[2024-06-02 21:53:24] [INFO ] Flatten gal took : 9 ms
[2024-06-02 21:53:24] [INFO ] Export to MCC of 9 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2024-06-02 21:53:24] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 107 places, 295 transitions and 1072 arcs took 2 ms.
Total runtime 18328 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running FireWire-PT-02

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/413/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 107
TRANSITIONS: 295
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.005s, Sys 0.003s]


SAVING FILE /home/mcc/execution/413/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: 581
MODEL NAME: /home/mcc/execution/413/model
107 places, 295 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-02-CTLCardinality-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-02-CTLCardinality-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-02-CTLCardinality-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-02-CTLCardinality-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-02-CTLCardinality-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-02-CTLCardinality-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-02-CTLCardinality-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-02-CTLCardinality-2024-12 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-02-CTLCardinality-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1717365218656

--------------------
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-02"
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-02, 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-171734898000177"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FireWire-PT-02.tgz
mv FireWire-PT-02 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 ;