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-171734898000178.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 CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r549-tall-171734898000178
=====================================================================

--------------------
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-CTLFireability-2024-00
FORMULA_NAME FireWire-PT-02-CTLFireability-2024-01
FORMULA_NAME FireWire-PT-02-CTLFireability-2024-02
FORMULA_NAME FireWire-PT-02-CTLFireability-2024-03
FORMULA_NAME FireWire-PT-02-CTLFireability-2024-04
FORMULA_NAME FireWire-PT-02-CTLFireability-2024-05
FORMULA_NAME FireWire-PT-02-CTLFireability-2024-06
FORMULA_NAME FireWire-PT-02-CTLFireability-2024-07
FORMULA_NAME FireWire-PT-02-CTLFireability-2024-08
FORMULA_NAME FireWire-PT-02-CTLFireability-2024-09
FORMULA_NAME FireWire-PT-02-CTLFireability-2024-10
FORMULA_NAME FireWire-PT-02-CTLFireability-2024-11
FORMULA_NAME FireWire-PT-02-CTLFireability-2024-12
FORMULA_NAME FireWire-PT-02-CTLFireability-2024-13
FORMULA_NAME FireWire-PT-02-CTLFireability-2024-14
FORMULA_NAME FireWire-PT-02-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717365194083

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLFireability
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:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-02 21:53:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 21:53:15] [INFO ] Load time of PNML (sax parser for PT used): 77 ms
[2024-06-02 21:53:15] [INFO ] Transformed 108 places.
[2024-06-02 21:53:15] [INFO ] Transformed 355 transitions.
[2024-06-02 21:53:15] [INFO ] Found NUPN structural information;
[2024-06-02 21:53:15] [INFO ] Parsed PT model containing 108 places and 355 transitions and 1311 arcs in 174 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 12 ms.
Ensure Unique test removed 54 transitions
Reduce redundant transitions removed 54 transitions.
Support contains 78 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 301/301 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 107 transition count 299
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 107 transition count 299
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 107 transition count 298
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 9 place count 107 transition count 292
Applied a total of 9 rules in 32 ms. Remains 107 /108 variables (removed 1) and now considering 292/301 (removed 9) transitions.
[2024-06-02 21:53:15] [INFO ] Flow matrix only has 266 transitions (discarded 26 similar events)
// Phase 1: matrix 266 rows 107 cols
[2024-06-02 21:53:15] [INFO ] Computed 8 invariants in 19 ms
[2024-06-02 21:53:15] [INFO ] Implicit Places using invariants in 210 ms returned []
[2024-06-02 21:53:15] [INFO ] Flow matrix only has 266 transitions (discarded 26 similar events)
[2024-06-02 21:53:15] [INFO ] Invariant cache hit.
[2024-06-02 21:53:15] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 21:53:15] [INFO ] Implicit Places using invariants and state equation in 193 ms returned []
Implicit Place search using SMT with State Equation took 431 ms to find 0 implicit places.
Running 291 sub problems to find dead transitions.
[2024-06-02 21:53:15] [INFO ] Flow matrix only has 266 transitions (discarded 26 similar events)
[2024-06-02 21:53:16] [INFO ] Invariant cache hit.
[2024-06-02 21:53:16] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 291 unsolved
[2024-06-02 21:53:18] [INFO ] Deduced a trap composed of 36 places in 152 ms of which 10 ms to minimize.
[2024-06-02 21:53:18] [INFO ] Deduced a trap composed of 37 places in 67 ms of which 2 ms to minimize.
[2024-06-02 21:53:18] [INFO ] Deduced a trap composed of 15 places in 180 ms of which 2 ms to minimize.
[2024-06-02 21:53:19] [INFO ] Deduced a trap composed of 35 places in 539 ms of which 1 ms to minimize.
[2024-06-02 21:53:19] [INFO ] Deduced a trap composed of 22 places in 69 ms of which 2 ms to minimize.
[2024-06-02 21:53:19] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 1 ms to minimize.
[2024-06-02 21:53:19] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 291 unsolved
[2024-06-02 21:53:20] [INFO ] Deduced a trap composed of 34 places in 70 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 5 (OVERLAPS) 265/372 variables, 107/123 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/372 variables, 39/162 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/372 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 8 (OVERLAPS) 1/373 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/373 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 10 (OVERLAPS) 0/373 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 291 unsolved
No progress, stopping.
After SMT solving in domain Real declared 373/373 variables, and 163 constraints, problems are : Problem set: 0 solved, 291 unsolved in 13800 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 107/107 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 291/291 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 291 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 4 (OVERLAPS) 265/372 variables, 107/123 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/372 variables, 39/162 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/372 variables, 291/453 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/372 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 8 (OVERLAPS) 1/373 variables, 1/454 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/373 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 10 (OVERLAPS) 0/373 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 291 unsolved
No progress, stopping.
After SMT solving in domain Int declared 373/373 variables, and 454 constraints, problems are : Problem set: 0 solved, 291 unsolved in 22406 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 107/107 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 291/291 constraints, Known Traps: 8/8 constraints]
After SMT, in 36491ms problems are : Problem set: 0 solved, 291 unsolved
Search for dead transitions found 0 dead transitions in 36512ms
Starting structural reductions in LTL mode, iteration 1 : 107/108 places, 292/301 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37001 ms. Remains : 107/108 places, 292/301 transitions.
Support contains 78 out of 107 places after structural reductions.
[2024-06-02 21:53:52] [INFO ] Flatten gal took : 48 ms
[2024-06-02 21:53:52] [INFO ] Flatten gal took : 23 ms
[2024-06-02 21:53:52] [INFO ] Input system was already deterministic with 292 transitions.
Support contains 77 out of 107 places (down from 78) after GAL structural reductions.
RANDOM walk for 40000 steps (2205 resets) in 2196 ms. (18 steps per ms) remains 37/77 properties
BEST_FIRST walk for 4003 steps (13 resets) in 30 ms. (129 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (24 resets) in 65 ms. (60 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (72 resets) in 70 ms. (56 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (55 resets) in 67 ms. (58 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (53 resets) in 16 ms. (235 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (61 resets) in 15 ms. (250 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (15 resets) in 12 ms. (307 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (51 resets) in 19 ms. (200 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (61 resets) in 15 ms. (250 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (62 resets) in 17 ms. (222 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (55 resets) in 15 ms. (250 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (16 resets) in 40 ms. (97 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (46 resets) in 18 ms. (210 steps per ms) remains 36/37 properties
BEST_FIRST walk for 4003 steps (9 resets) in 13 ms. (285 steps per ms) remains 33/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (66 resets) in 15 ms. (250 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (9 resets) in 12 ms. (308 steps per ms) remains 31/33 properties
BEST_FIRST walk for 4003 steps (18 resets) in 12 ms. (307 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (102 resets) in 13 ms. (285 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (17 resets) in 14 ms. (266 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (101 resets) in 16 ms. (235 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (61 resets) in 27 ms. (143 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4000 steps (60 resets) in 15 ms. (250 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (74 resets) in 16 ms. (235 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (53 resets) in 10 ms. (363 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (12 resets) in 12 ms. (308 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (117 resets) in 16 ms. (235 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (75 resets) in 11 ms. (333 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (22 resets) in 24 ms. (160 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (9 resets) in 24 ms. (160 steps per ms) remains 30/31 properties
BEST_FIRST walk for 4004 steps (96 resets) in 20 ms. (190 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (50 resets) in 22 ms. (174 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (65 resets) in 16 ms. (235 steps per ms) remains 30/30 properties
[2024-06-02 21:53:53] [INFO ] Flow matrix only has 266 transitions (discarded 26 similar events)
[2024-06-02 21:53:53] [INFO ] Invariant cache hit.
[2024-06-02 21:53:53] [INFO ] State equation strengthened by 40 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp71 is UNSAT
At refinement iteration 1 (OVERLAPS) 63/104 variables, 7/7 constraints. Problems are: Problem set: 2 solved, 28 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/7 constraints. Problems are: Problem set: 2 solved, 28 unsolved
At refinement iteration 3 (OVERLAPS) 2/106 variables, 1/8 constraints. Problems are: Problem set: 2 solved, 28 unsolved
[2024-06-02 21:53:54] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 1/9 constraints. Problems are: Problem set: 2 solved, 28 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/106 variables, 0/9 constraints. Problems are: Problem set: 2 solved, 28 unsolved
At refinement iteration 6 (OVERLAPS) 265/371 variables, 106/115 constraints. Problems are: Problem set: 2 solved, 28 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/371 variables, 39/154 constraints. Problems are: Problem set: 2 solved, 28 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/371 variables, 0/154 constraints. Problems are: Problem set: 2 solved, 28 unsolved
At refinement iteration 9 (OVERLAPS) 1/372 variables, 1/155 constraints. Problems are: Problem set: 2 solved, 28 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/372 variables, 0/155 constraints. Problems are: Problem set: 2 solved, 28 unsolved
At refinement iteration 11 (OVERLAPS) 1/373 variables, 1/156 constraints. Problems are: Problem set: 2 solved, 28 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/373 variables, 0/156 constraints. Problems are: Problem set: 2 solved, 28 unsolved
At refinement iteration 13 (OVERLAPS) 0/373 variables, 0/156 constraints. Problems are: Problem set: 2 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Real declared 373/373 variables, and 156 constraints, problems are : Problem set: 2 solved, 28 unsolved in 1173 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 107/107 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 2 solved, 28 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 28 unsolved
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp38 is UNSAT
At refinement iteration 1 (OVERLAPS) 67/104 variables, 7/7 constraints. Problems are: Problem set: 4 solved, 26 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 1/8 constraints. Problems are: Problem set: 4 solved, 26 unsolved
[2024-06-02 21:53:55] [INFO ] Deduced a trap composed of 35 places in 37 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 1/9 constraints. Problems are: Problem set: 4 solved, 26 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/9 constraints. Problems are: Problem set: 4 solved, 26 unsolved
At refinement iteration 5 (OVERLAPS) 2/106 variables, 1/10 constraints. Problems are: Problem set: 4 solved, 26 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 0/10 constraints. Problems are: Problem set: 4 solved, 26 unsolved
At refinement iteration 7 (OVERLAPS) 265/371 variables, 106/116 constraints. Problems are: Problem set: 4 solved, 26 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/371 variables, 39/155 constraints. Problems are: Problem set: 4 solved, 26 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/371 variables, 25/180 constraints. Problems are: Problem set: 4 solved, 26 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/371 variables, 0/180 constraints. Problems are: Problem set: 4 solved, 26 unsolved
At refinement iteration 11 (OVERLAPS) 1/372 variables, 1/181 constraints. Problems are: Problem set: 4 solved, 26 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/372 variables, 1/182 constraints. Problems are: Problem set: 4 solved, 26 unsolved
[2024-06-02 21:53:56] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/372 variables, 1/183 constraints. Problems are: Problem set: 4 solved, 26 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/372 variables, 0/183 constraints. Problems are: Problem set: 4 solved, 26 unsolved
At refinement iteration 15 (OVERLAPS) 1/373 variables, 1/184 constraints. Problems are: Problem set: 4 solved, 26 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/373 variables, 0/184 constraints. Problems are: Problem set: 4 solved, 26 unsolved
At refinement iteration 17 (OVERLAPS) 0/373 variables, 0/184 constraints. Problems are: Problem set: 4 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Int declared 373/373 variables, and 184 constraints, problems are : Problem set: 4 solved, 26 unsolved in 3353 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 107/107 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 26/30 constraints, Known Traps: 3/3 constraints]
After SMT, in 4570ms problems are : Problem set: 4 solved, 26 unsolved
Parikh walk visited 6 properties in 4342 ms.
Support contains 25 out of 107 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 107/107 places, 292/292 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 288
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 288
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 287
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 7 place count 105 transition count 287
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 12 place count 100 transition count 274
Iterating global reduction 2 with 5 rules applied. Total rules applied 17 place count 100 transition count 274
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 19 place count 100 transition count 272
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 21 place count 98 transition count 268
Iterating global reduction 3 with 2 rules applied. Total rules applied 23 place count 98 transition count 268
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 29 place count 95 transition count 274
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 35 place count 95 transition count 268
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 38 place count 95 transition count 265
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 39 place count 95 transition count 267
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 42 place count 94 transition count 265
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 44 place count 94 transition count 263
Applied a total of 44 rules in 80 ms. Remains 94 /107 variables (removed 13) and now considering 263/292 (removed 29) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80 ms. Remains : 94/107 places, 263/292 transitions.
RANDOM walk for 40000 steps (2375 resets) in 957 ms. (41 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (67 resets) in 28 ms. (138 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (65 resets) in 16 ms. (235 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (17 resets) in 14 ms. (266 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (73 resets) in 15 ms. (250 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (67 resets) in 20 ms. (190 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (57 resets) in 12 ms. (307 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4001 steps (133 resets) in 14 ms. (266 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (18 resets) in 13 ms. (285 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (139 resets) in 16 ms. (235 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (51 resets) in 14 ms. (266 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (59 resets) in 13 ms. (285 steps per ms) remains 19/20 properties
BEST_FIRST walk for 4003 steps (15 resets) in 32 ms. (121 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4001 steps (149 resets) in 19 ms. (200 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (68 resets) in 17 ms. (222 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (140 resets) in 25 ms. (153 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (69 resets) in 14 ms. (266 steps per ms) remains 19/19 properties
Probabilistic random walk after 1000001 steps, saw 211601 distinct states, run finished after 2942 ms. (steps per millisecond=339 ) properties seen :17
[2024-06-02 21:54:06] [INFO ] Flow matrix only has 234 transitions (discarded 29 similar events)
// Phase 1: matrix 234 rows 94 cols
[2024-06-02 21:54:06] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 21:54:06] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 64/68 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 25/93 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 234/327 variables, 93/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/327 variables, 38/139 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/327 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/328 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/328 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/328 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 328/328 variables, and 140 constraints, problems are : Problem set: 0 solved, 2 unsolved in 218 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 94/94 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 64/68 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 25/93 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-02 21:54:06] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 234/327 variables, 93/102 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/327 variables, 38/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/327 variables, 2/142 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/327 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/328 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/328 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/328 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 328/328 variables, and 143 constraints, problems are : Problem set: 0 solved, 2 unsolved in 270 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 94/94 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 503ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 388 ms.
Support contains 4 out of 94 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 94/94 places, 263/263 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 93 transition count 261
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 93 transition count 261
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 92 transition count 260
Applied a total of 3 rules in 16 ms. Remains 92 /94 variables (removed 2) and now considering 260/263 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 92/94 places, 260/263 transitions.
RANDOM walk for 40000 steps (2612 resets) in 149 ms. (266 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (641 resets) in 59 ms. (666 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (41 resets) in 21 ms. (1818 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1187396 steps, run timeout after 3001 ms. (steps per millisecond=395 ) properties seen :0 out of 2
Probabilistic random walk after 1187396 steps, saw 245527 distinct states, run finished after 3005 ms. (steps per millisecond=395 ) properties seen :0
[2024-06-02 21:54:10] [INFO ] Flow matrix only has 231 transitions (discarded 29 similar events)
// Phase 1: matrix 231 rows 92 cols
[2024-06-02 21:54:10] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 21:54:10] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 63/67 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 206/273 variables, 67/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/273 variables, 26/97 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/273 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 47/320 variables, 23/120 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/320 variables, 3/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/320 variables, 11/134 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/320 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 3/323 variables, 2/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/323 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/323 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/323 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 323/323 variables, and 137 constraints, problems are : Problem set: 0 solved, 2 unsolved in 131 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 92/92 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 63/67 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 206/273 variables, 67/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/273 variables, 26/97 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/273 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/273 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 47/320 variables, 23/121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/320 variables, 3/124 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/320 variables, 11/135 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/320 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/320 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 3/323 variables, 2/138 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/323 variables, 1/139 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/323 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/323 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 323/323 variables, and 139 constraints, problems are : Problem set: 0 solved, 2 unsolved in 196 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 92/92 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 346ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 43 ms.
Support contains 4 out of 92 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 92/92 places, 260/260 transitions.
Applied a total of 0 rules in 6 ms. Remains 92 /92 variables (removed 0) and now considering 260/260 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 92/92 places, 260/260 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 92/92 places, 260/260 transitions.
Applied a total of 0 rules in 5 ms. Remains 92 /92 variables (removed 0) and now considering 260/260 (removed 0) transitions.
[2024-06-02 21:54:10] [INFO ] Flow matrix only has 231 transitions (discarded 29 similar events)
[2024-06-02 21:54:10] [INFO ] Invariant cache hit.
[2024-06-02 21:54:10] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-06-02 21:54:10] [INFO ] Flow matrix only has 231 transitions (discarded 29 similar events)
[2024-06-02 21:54:10] [INFO ] Invariant cache hit.
[2024-06-02 21:54:10] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-02 21:54:10] [INFO ] Implicit Places using invariants and state equation in 142 ms returned [56]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 208 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 91/92 places, 260/260 transitions.
Applied a total of 0 rules in 8 ms. Remains 91 /91 variables (removed 0) and now considering 260/260 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 222 ms. Remains : 91/92 places, 260/260 transitions.
RANDOM walk for 40000 steps (2603 resets) in 90 ms. (439 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (21 resets) in 18 ms. (2105 steps per ms) remains 1/1 properties
[2024-06-02 21:54:10] [INFO ] Flow matrix only has 231 transitions (discarded 29 similar events)
// Phase 1: matrix 231 rows 91 cols
[2024-06-02 21:54:10] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 21:54:10] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 62/66 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 206/272 variables, 66/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/272 variables, 26/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/272 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 47/319 variables, 23/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/319 variables, 3/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/319 variables, 11/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/319 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 3/322 variables, 2/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/322 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/322 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/322 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 322/322 variables, and 135 constraints, problems are : Problem set: 0 solved, 1 unsolved in 121 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 91/91 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 62/66 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 206/272 variables, 66/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/272 variables, 26/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/272 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 47/319 variables, 23/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/319 variables, 3/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/319 variables, 11/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/319 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/319 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 3/322 variables, 2/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/322 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/322 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/322 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 322/322 variables, and 136 constraints, problems are : Problem set: 0 solved, 1 unsolved in 144 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 91/91 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 279ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 26 ms.
Support contains 4 out of 91 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 91/91 places, 260/260 transitions.
Applied a total of 0 rules in 6 ms. Remains 91 /91 variables (removed 0) and now considering 260/260 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 91/91 places, 260/260 transitions.
RANDOM walk for 40000 steps (2607 resets) in 90 ms. (439 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (26 resets) in 19 ms. (2000 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2072940 steps, run timeout after 3001 ms. (steps per millisecond=690 ) properties seen :0 out of 1
Probabilistic random walk after 2072940 steps, saw 422367 distinct states, run finished after 3005 ms. (steps per millisecond=689 ) properties seen :0
[2024-06-02 21:54:14] [INFO ] Flow matrix only has 231 transitions (discarded 29 similar events)
[2024-06-02 21:54:14] [INFO ] Invariant cache hit.
[2024-06-02 21:54:14] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 62/66 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 206/272 variables, 66/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/272 variables, 26/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/272 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 47/319 variables, 23/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/319 variables, 3/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/319 variables, 11/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/319 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 3/322 variables, 2/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/322 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/322 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/322 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 322/322 variables, and 135 constraints, problems are : Problem set: 0 solved, 1 unsolved in 164 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 91/91 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 62/66 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 206/272 variables, 66/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/272 variables, 26/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/272 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 47/319 variables, 23/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/319 variables, 3/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/319 variables, 11/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/319 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/319 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 3/322 variables, 2/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/322 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/322 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/322 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 322/322 variables, and 136 constraints, problems are : Problem set: 0 solved, 1 unsolved in 181 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 91/91 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 354ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 14 ms.
Support contains 4 out of 91 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 91/91 places, 260/260 transitions.
Applied a total of 0 rules in 6 ms. Remains 91 /91 variables (removed 0) and now considering 260/260 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 91/91 places, 260/260 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 91/91 places, 260/260 transitions.
Applied a total of 0 rules in 6 ms. Remains 91 /91 variables (removed 0) and now considering 260/260 (removed 0) transitions.
[2024-06-02 21:54:14] [INFO ] Flow matrix only has 231 transitions (discarded 29 similar events)
[2024-06-02 21:54:14] [INFO ] Invariant cache hit.
[2024-06-02 21:54:14] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-06-02 21:54:14] [INFO ] Flow matrix only has 231 transitions (discarded 29 similar events)
[2024-06-02 21:54:14] [INFO ] Invariant cache hit.
[2024-06-02 21:54:14] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-02 21:54:14] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 224 ms to find 0 implicit places.
[2024-06-02 21:54:14] [INFO ] Redundant transitions in 10 ms returned []
Running 258 sub problems to find dead transitions.
[2024-06-02 21:54:14] [INFO ] Flow matrix only has 231 transitions (discarded 29 similar events)
[2024-06-02 21:54:14] [INFO ] Invariant cache hit.
[2024-06-02 21:54:14] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 258 unsolved
[2024-06-02 21:54:15] [INFO ] Deduced a trap composed of 32 places in 67 ms of which 1 ms to minimize.
[2024-06-02 21:54:15] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
[2024-06-02 21:54:15] [INFO ] Deduced a trap composed of 32 places in 30 ms of which 0 ms to minimize.
[2024-06-02 21:54:15] [INFO ] Deduced a trap composed of 38 places in 46 ms of which 1 ms to minimize.
[2024-06-02 21:54:15] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 1 ms to minimize.
[2024-06-02 21:54:15] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-06-02 21:54:16] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-06-02 21:54:16] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 258 unsolved
[2024-06-02 21:54:17] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (OVERLAPS) 231/321 variables, 90/106 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/321 variables, 37/143 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/321 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 7 (OVERLAPS) 1/322 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 258 unsolved
[2024-06-02 21:54:21] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/322 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/322 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 10 (OVERLAPS) 0/322 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 258 unsolved
No progress, stopping.
After SMT solving in domain Real declared 322/322 variables, and 145 constraints, problems are : Problem set: 0 solved, 258 unsolved in 10032 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 91/91 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 258 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (OVERLAPS) 231/321 variables, 90/107 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/321 variables, 37/144 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/321 variables, 258/402 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/321 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 7 (OVERLAPS) 1/322 variables, 1/403 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/322 variables, 0/403 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 9 (OVERLAPS) 0/322 variables, 0/403 constraints. Problems are: Problem set: 0 solved, 258 unsolved
No progress, stopping.
After SMT solving in domain Int declared 322/322 variables, and 403 constraints, problems are : Problem set: 0 solved, 258 unsolved in 13222 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 91/91 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 10/10 constraints]
After SMT, in 23406ms problems are : Problem set: 0 solved, 258 unsolved
Search for dead transitions found 0 dead transitions in 23409ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23655 ms. Remains : 91/91 places, 260/260 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 88 edges and 91 vertex of which 20 / 91 are part of one of the 3 SCC in 5 ms
Free SCC test removed 17 places
Drop transitions (Empty/Sink Transition effects.) removed 51 transitions
Ensure Unique test removed 39 transitions
Reduce isomorphic transitions removed 90 transitions.
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 3 place count 73 transition count 169
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 0 with 12 rules applied. Total rules applied 15 place count 73 transition count 157
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 73 transition count 156
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 72 transition count 156
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 72 transition count 158
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 19 place count 71 transition count 158
Applied a total of 19 rules in 48 ms. Remains 71 /91 variables (removed 20) and now considering 158/260 (removed 102) transitions.
Running SMT prover for 1 properties.
[2024-06-02 21:54:38] [INFO ] Flow matrix only has 157 transitions (discarded 1 similar events)
// Phase 1: matrix 157 rows 71 cols
[2024-06-02 21:54:38] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 21:54:38] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-02 21:54:38] [INFO ] After 77ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 21:54:38] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 21:54:38] [INFO ] After 35ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 21:54:38] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 1 ms to minimize.
[2024-06-02 21:54:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 33 ms
TRAPS : Iteration 1
[2024-06-02 21:54:38] [INFO ] After 90ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-02 21:54:38] [INFO ] After 126ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 280 ms.
Successfully simplified 4 atomic propositions for a total of 16 simplifications.
FORMULA FireWire-PT-02-CTLFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-02 21:54:38] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-06-02 21:54:38] [INFO ] Flatten gal took : 19 ms
FORMULA FireWire-PT-02-CTLFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-02 21:54:38] [INFO ] Flatten gal took : 18 ms
[2024-06-02 21:54:38] [INFO ] Input system was already deterministic with 292 transitions.
Support contains 62 out of 107 places (down from 73) after GAL structural reductions.
Computed a total of 6 stabilizing places and 11 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 107/107 places, 292/292 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 102 transition count 279
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 102 transition count 279
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 277
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 15 place count 99 transition count 271
Iterating global reduction 1 with 3 rules applied. Total rules applied 18 place count 99 transition count 271
Applied a total of 18 rules in 5 ms. Remains 99 /107 variables (removed 8) and now considering 271/292 (removed 21) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 99/107 places, 271/292 transitions.
[2024-06-02 21:54:38] [INFO ] Flatten gal took : 14 ms
[2024-06-02 21:54:38] [INFO ] Flatten gal took : 14 ms
[2024-06-02 21:54:38] [INFO ] Input system was already deterministic with 271 transitions.
Starting structural reductions in LTL mode, iteration 0 : 107/107 places, 292/292 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 102 transition count 279
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 102 transition count 279
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 277
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 15 place count 99 transition count 271
Iterating global reduction 1 with 3 rules applied. Total rules applied 18 place count 99 transition count 271
Applied a total of 18 rules in 4 ms. Remains 99 /107 variables (removed 8) and now considering 271/292 (removed 21) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 99/107 places, 271/292 transitions.
[2024-06-02 21:54:38] [INFO ] Flatten gal took : 12 ms
[2024-06-02 21:54:38] [INFO ] Flatten gal took : 13 ms
[2024-06-02 21:54:38] [INFO ] Input system was already deterministic with 271 transitions.
Starting structural reductions in LTL mode, iteration 0 : 107/107 places, 292/292 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 103 transition count 282
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 103 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 10 place count 103 transition count 280
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 12 place count 101 transition count 276
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 101 transition count 276
Applied a total of 14 rules in 4 ms. Remains 101 /107 variables (removed 6) and now considering 276/292 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 101/107 places, 276/292 transitions.
[2024-06-02 21:54:38] [INFO ] Flatten gal took : 13 ms
[2024-06-02 21:54:38] [INFO ] Flatten gal took : 17 ms
[2024-06-02 21:54:38] [INFO ] Input system was already deterministic with 276 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 107/107 places, 292/292 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 290
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 290
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 289
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 289
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 9 place count 99 transition count 276
Iterating global reduction 2 with 5 rules applied. Total rules applied 14 place count 99 transition count 276
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 16 place count 99 transition count 274
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 19 place count 96 transition count 268
Iterating global reduction 3 with 3 rules applied. Total rules applied 22 place count 96 transition count 268
Applied a total of 22 rules in 19 ms. Remains 96 /107 variables (removed 11) and now considering 268/292 (removed 24) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 19 ms. Remains : 96/107 places, 268/292 transitions.
[2024-06-02 21:54:38] [INFO ] Flatten gal took : 11 ms
[2024-06-02 21:54:38] [INFO ] Flatten gal took : 11 ms
[2024-06-02 21:54:38] [INFO ] Input system was already deterministic with 268 transitions.
RANDOM walk for 40000 steps (2614 resets) in 279 ms. (142 steps per ms) remains 1/1 properties
BEST_FIRST walk for 36396 steps (615 resets) in 29 ms. (1213 steps per ms) remains 0/1 properties
FORMULA FireWire-PT-02-CTLFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Starting structural reductions in LTL mode, iteration 0 : 107/107 places, 292/292 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 103 transition count 282
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 103 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 10 place count 103 transition count 280
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 12 place count 101 transition count 276
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 101 transition count 276
Applied a total of 14 rules in 4 ms. Remains 101 /107 variables (removed 6) and now considering 276/292 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 101/107 places, 276/292 transitions.
[2024-06-02 21:54:39] [INFO ] Flatten gal took : 10 ms
[2024-06-02 21:54:39] [INFO ] Flatten gal took : 11 ms
[2024-06-02 21:54:39] [INFO ] Input system was already deterministic with 276 transitions.
Starting structural reductions in LTL mode, iteration 0 : 107/107 places, 292/292 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 102 transition count 279
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 102 transition count 279
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 277
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 14 place count 100 transition count 273
Iterating global reduction 1 with 2 rules applied. Total rules applied 16 place count 100 transition count 273
Applied a total of 16 rules in 4 ms. Remains 100 /107 variables (removed 7) and now considering 273/292 (removed 19) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 100/107 places, 273/292 transitions.
[2024-06-02 21:54:39] [INFO ] Flatten gal took : 10 ms
[2024-06-02 21:54:39] [INFO ] Flatten gal took : 11 ms
[2024-06-02 21:54:39] [INFO ] Input system was already deterministic with 273 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 107/107 places, 292/292 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 291
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 291
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 290
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 290
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 9 place count 100 transition count 277
Iterating global reduction 2 with 5 rules applied. Total rules applied 14 place count 100 transition count 277
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 16 place count 100 transition count 275
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 19 place count 97 transition count 269
Iterating global reduction 3 with 3 rules applied. Total rules applied 22 place count 97 transition count 269
Applied a total of 22 rules in 14 ms. Remains 97 /107 variables (removed 10) and now considering 269/292 (removed 23) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 15 ms. Remains : 97/107 places, 269/292 transitions.
[2024-06-02 21:54:39] [INFO ] Flatten gal took : 9 ms
[2024-06-02 21:54:39] [INFO ] Flatten gal took : 10 ms
[2024-06-02 21:54:39] [INFO ] Input system was already deterministic with 269 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 107/107 places, 292/292 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 290
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 290
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 289
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 289
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 9 place count 99 transition count 276
Iterating global reduction 2 with 5 rules applied. Total rules applied 14 place count 99 transition count 276
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 16 place count 99 transition count 274
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 19 place count 96 transition count 268
Iterating global reduction 3 with 3 rules applied. Total rules applied 22 place count 96 transition count 268
Applied a total of 22 rules in 14 ms. Remains 96 /107 variables (removed 11) and now considering 268/292 (removed 24) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 14 ms. Remains : 96/107 places, 268/292 transitions.
[2024-06-02 21:54:39] [INFO ] Flatten gal took : 9 ms
[2024-06-02 21:54:39] [INFO ] Flatten gal took : 9 ms
[2024-06-02 21:54:39] [INFO ] Input system was already deterministic with 268 transitions.
Starting structural reductions in LTL mode, iteration 0 : 107/107 places, 292/292 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 102 transition count 279
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 102 transition count 279
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 277
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 14 place count 100 transition count 273
Iterating global reduction 1 with 2 rules applied. Total rules applied 16 place count 100 transition count 273
Applied a total of 16 rules in 3 ms. Remains 100 /107 variables (removed 7) and now considering 273/292 (removed 19) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 100/107 places, 273/292 transitions.
[2024-06-02 21:54:39] [INFO ] Flatten gal took : 14 ms
[2024-06-02 21:54:39] [INFO ] Flatten gal took : 10 ms
[2024-06-02 21:54:39] [INFO ] Input system was already deterministic with 273 transitions.
Starting structural reductions in LTL mode, iteration 0 : 107/107 places, 292/292 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 102 transition count 279
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 102 transition count 279
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 277
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 15 place count 99 transition count 271
Iterating global reduction 1 with 3 rules applied. Total rules applied 18 place count 99 transition count 271
Applied a total of 18 rules in 2 ms. Remains 99 /107 variables (removed 8) and now considering 271/292 (removed 21) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 99/107 places, 271/292 transitions.
[2024-06-02 21:54:39] [INFO ] Flatten gal took : 9 ms
[2024-06-02 21:54:39] [INFO ] Flatten gal took : 9 ms
[2024-06-02 21:54:39] [INFO ] Input system was already deterministic with 271 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 107/107 places, 292/292 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 290
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 290
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 289
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 289
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 8 place count 100 transition count 279
Iterating global reduction 2 with 4 rules applied. Total rules applied 12 place count 100 transition count 279
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 277
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 16 place count 98 transition count 273
Iterating global reduction 3 with 2 rules applied. Total rules applied 18 place count 98 transition count 273
Applied a total of 18 rules in 14 ms. Remains 98 /107 variables (removed 9) and now considering 273/292 (removed 19) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 14 ms. Remains : 98/107 places, 273/292 transitions.
[2024-06-02 21:54:39] [INFO ] Flatten gal took : 9 ms
[2024-06-02 21:54:39] [INFO ] Flatten gal took : 10 ms
[2024-06-02 21:54:39] [INFO ] Input system was already deterministic with 273 transitions.
RANDOM walk for 40000 steps (2627 resets) in 281 ms. (141 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (682 resets) in 59 ms. (666 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1071912 steps, run visited all 1 properties in 1502 ms. (steps per millisecond=713 )
Probabilistic random walk after 1071912 steps, saw 196857 distinct states, run finished after 1505 ms. (steps per millisecond=712 ) properties seen :1
FORMULA FireWire-PT-02-CTLFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Starting structural reductions in LTL mode, iteration 0 : 107/107 places, 292/292 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 103 transition count 282
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 103 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 10 place count 103 transition count 280
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 102 transition count 278
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 102 transition count 278
Applied a total of 12 rules in 3 ms. Remains 102 /107 variables (removed 5) and now considering 278/292 (removed 14) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 102/107 places, 278/292 transitions.
[2024-06-02 21:54:41] [INFO ] Flatten gal took : 8 ms
[2024-06-02 21:54:41] [INFO ] Flatten gal took : 9 ms
[2024-06-02 21:54:41] [INFO ] Input system was already deterministic with 278 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 107/107 places, 292/292 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 290
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 290
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 289
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 289
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 8 place count 100 transition count 279
Iterating global reduction 2 with 4 rules applied. Total rules applied 12 place count 100 transition count 279
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 277
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 16 place count 98 transition count 273
Iterating global reduction 3 with 2 rules applied. Total rules applied 18 place count 98 transition count 273
Applied a total of 18 rules in 12 ms. Remains 98 /107 variables (removed 9) and now considering 273/292 (removed 19) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 12 ms. Remains : 98/107 places, 273/292 transitions.
[2024-06-02 21:54:41] [INFO ] Flatten gal took : 8 ms
[2024-06-02 21:54:41] [INFO ] Flatten gal took : 9 ms
[2024-06-02 21:54:41] [INFO ] Input system was already deterministic with 273 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 107/107 places, 292/292 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 290
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 290
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 289
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 289
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 9 place count 99 transition count 276
Iterating global reduction 2 with 5 rules applied. Total rules applied 14 place count 99 transition count 276
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 16 place count 99 transition count 274
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 19 place count 96 transition count 268
Iterating global reduction 3 with 3 rules applied. Total rules applied 22 place count 96 transition count 268
Applied a total of 22 rules in 11 ms. Remains 96 /107 variables (removed 11) and now considering 268/292 (removed 24) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 11 ms. Remains : 96/107 places, 268/292 transitions.
[2024-06-02 21:54:41] [INFO ] Flatten gal took : 8 ms
[2024-06-02 21:54:41] [INFO ] Flatten gal took : 8 ms
[2024-06-02 21:54:41] [INFO ] Input system was already deterministic with 268 transitions.
[2024-06-02 21:54:41] [INFO ] Flatten gal took : 9 ms
[2024-06-02 21:54:41] [INFO ] Flatten gal took : 10 ms
[2024-06-02 21:54:41] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2024-06-02 21:54:41] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 107 places, 292 transitions and 1069 arcs took 3 ms.
Total runtime 85931 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/411/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 107
TRANSITIONS: 292
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.007s, Sys 0.000s]


SAVING FILE /home/mcc/execution/411/model (.net / .def) ...
EXPORT TIME: [User 0.001s, 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: 689
MODEL NAME: /home/mcc/execution/411/model
107 places, 292 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-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-02-CTLFireability-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-02-CTLFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-02-CTLFireability-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-02-CTLFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-02-CTLFireability-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-02-CTLFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-02-CTLFireability-2024-12 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-02-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-02-CTLFireability-2024-14 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-02-CTLFireability-2024-15 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-02-CTLFireability-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1717365308645

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is FireWire-PT-02, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r549-tall-171734898000178"
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 [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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