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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 620K
-rw-r--r-- 1 mcc users 7.2K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K 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 49K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 15K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 178K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K 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 101K 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-10-ReachabilityCardinality-2024-00
FORMULA_NAME FireWire-PT-10-ReachabilityCardinality-2024-01
FORMULA_NAME FireWire-PT-10-ReachabilityCardinality-2024-02
FORMULA_NAME FireWire-PT-10-ReachabilityCardinality-2024-03
FORMULA_NAME FireWire-PT-10-ReachabilityCardinality-2024-04
FORMULA_NAME FireWire-PT-10-ReachabilityCardinality-2024-05
FORMULA_NAME FireWire-PT-10-ReachabilityCardinality-2024-06
FORMULA_NAME FireWire-PT-10-ReachabilityCardinality-2024-07
FORMULA_NAME FireWire-PT-10-ReachabilityCardinality-2024-08
FORMULA_NAME FireWire-PT-10-ReachabilityCardinality-2024-09
FORMULA_NAME FireWire-PT-10-ReachabilityCardinality-2024-10
FORMULA_NAME FireWire-PT-10-ReachabilityCardinality-2024-11
FORMULA_NAME FireWire-PT-10-ReachabilityCardinality-2024-12
FORMULA_NAME FireWire-PT-10-ReachabilityCardinality-2024-13
FORMULA_NAME FireWire-PT-10-ReachabilityCardinality-2024-14
FORMULA_NAME FireWire-PT-10-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717367215169

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-02 22:26:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-02 22:26:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 22:26:56] [INFO ] Load time of PNML (sax parser for PT used): 91 ms
[2024-06-02 22:26:56] [INFO ] Transformed 131 places.
[2024-06-02 22:26:56] [INFO ] Transformed 409 transitions.
[2024-06-02 22:26:56] [INFO ] Found NUPN structural information;
[2024-06-02 22:26:56] [INFO ] Parsed PT model containing 131 places and 409 transitions and 1529 arcs in 192 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 25 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 56 transitions
Reduce redundant transitions removed 56 transitions.
FORMULA FireWire-PT-10-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-10-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-10-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (2221 resets) in 2149 ms. (18 steps per ms) remains 11/13 properties
FORMULA FireWire-PT-10-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FireWire-PT-10-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (551 resets) in 500 ms. (79 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (1519 resets) in 239 ms. (166 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (553 resets) in 147 ms. (270 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (590 resets) in 287 ms. (138 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (42 resets) in 745 ms. (53 steps per ms) remains 9/11 properties
FORMULA FireWire-PT-10-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-10-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (577 resets) in 161 ms. (246 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 137 ms. (289 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (543 resets) in 138 ms. (287 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (582 resets) in 151 ms. (263 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (634 resets) in 120 ms. (330 steps per ms) remains 9/9 properties
[2024-06-02 22:26:58] [INFO ] Flow matrix only has 321 transitions (discarded 32 similar events)
// Phase 1: matrix 321 rows 131 cols
[2024-06-02 22:26:58] [INFO ] Computed 8 invariants in 16 ms
[2024-06-02 22:26:58] [INFO ] State equation strengthened by 45 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 97/97 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem FireWire-PT-10-ReachabilityCardinality-2024-06 is UNSAT
FORMULA FireWire-PT-10-ReachabilityCardinality-2024-06 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (OVERLAPS) 34/131 variables, 7/105 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/131 variables, 34/139 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/131 variables, 0/139 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 320/451 variables, 131/270 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/451 variables, 44/314 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/451 variables, 0/314 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 1/452 variables, 1/315 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/452 variables, 0/315 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 0/452 variables, 0/315 constraints. Problems are: Problem set: 1 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 452/452 variables, and 315 constraints, problems are : Problem set: 1 solved, 8 unsolved in 940 ms.
Refiners :[Domain max(s): 131/131 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 131/131 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 85/85 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 1/86 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 0/86 constraints. Problems are: Problem set: 1 solved, 8 unsolved
Problem FireWire-PT-10-ReachabilityCardinality-2024-15 is UNSAT
FORMULA FireWire-PT-10-ReachabilityCardinality-2024-15 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (OVERLAPS) 46/131 variables, 7/93 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/131 variables, 46/139 constraints. Problems are: Problem set: 2 solved, 7 unsolved
[2024-06-02 22:26:59] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 11 ms to minimize.
[2024-06-02 22:26:59] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 2 ms to minimize.
Problem FireWire-PT-10-ReachabilityCardinality-2024-02 is UNSAT
FORMULA FireWire-PT-10-ReachabilityCardinality-2024-02 TRUE TECHNIQUES SMT_REFINEMENT
Problem FireWire-PT-10-ReachabilityCardinality-2024-04 is UNSAT
FORMULA FireWire-PT-10-ReachabilityCardinality-2024-04 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 5 (INCLUDED_ONLY) 0/131 variables, 2/141 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/131 variables, 0/141 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 320/451 variables, 131/272 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/451 variables, 44/316 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/451 variables, 5/321 constraints. Problems are: Problem set: 4 solved, 5 unsolved
[2024-06-02 22:27:00] [INFO ] Deduced a trap composed of 50 places in 74 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/451 variables, 1/322 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/451 variables, 0/322 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 1/452 variables, 1/323 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/452 variables, 0/323 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 0/452 variables, 0/323 constraints. Problems are: Problem set: 4 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 452/452 variables, and 323 constraints, problems are : Problem set: 4 solved, 5 unsolved in 1474 ms.
Refiners :[Domain max(s): 131/131 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 131/131 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 5/9 constraints, Known Traps: 3/3 constraints]
After SMT, in 2578ms problems are : Problem set: 4 solved, 5 unsolved
Parikh walk visited 0 properties in 4438 ms.
Support contains 54 out of 131 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 131/131 places, 353/353 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 131 transition count 350
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 5 place count 129 transition count 346
Iterating global reduction 1 with 2 rules applied. Total rules applied 7 place count 129 transition count 346
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 129 transition count 345
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 128 transition count 344
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 16 place count 128 transition count 338
Applied a total of 16 rules in 63 ms. Remains 128 /131 variables (removed 3) and now considering 338/353 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 128/131 places, 338/353 transitions.
RANDOM walk for 40000 steps (2192 resets) in 407 ms. (98 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (1530 resets) in 140 ms. (283 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (639 resets) in 206 ms. (193 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 87 ms. (454 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (567 resets) in 57 ms. (689 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (598 resets) in 60 ms. (655 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 1600854 steps, run timeout after 3001 ms. (steps per millisecond=533 ) properties seen :4 out of 5
Probabilistic random walk after 1600854 steps, saw 340703 distinct states, run finished after 3005 ms. (steps per millisecond=532 ) properties seen :4
FORMULA FireWire-PT-10-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA FireWire-PT-10-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA FireWire-PT-10-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA FireWire-PT-10-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
[2024-06-02 22:27:08] [INFO ] Flow matrix only has 314 transitions (discarded 24 similar events)
// Phase 1: matrix 314 rows 128 cols
[2024-06-02 22:27:08] [INFO ] Computed 8 invariants in 3 ms
[2024-06-02 22:27:08] [INFO ] State equation strengthened by 44 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 99/105 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 20/125 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 314/439 variables, 125/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/439 variables, 44/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/439 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 3/442 variables, 3/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/442 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/442 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 442/442 variables, and 180 constraints, problems are : Problem set: 0 solved, 1 unsolved in 177 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 128/128 constraints, ReadFeed: 44/44 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/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 99/105 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 20/125 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 22:27:09] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 314/439 variables, 125/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/439 variables, 44/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/439 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 3/442 variables, 3/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/442 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/442 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/442 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 442/442 variables, and 182 constraints, problems are : Problem set: 0 solved, 1 unsolved in 289 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 128/128 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 481ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 30 ms.
Support contains 6 out of 128 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 128/128 places, 338/338 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 126 transition count 333
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 126 transition count 333
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 126 transition count 332
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 1 with 4 rules applied. Total rules applied 9 place count 124 transition count 336
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 13 place count 124 transition count 332
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 15 place count 124 transition count 330
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 16 place count 124 transition count 332
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 2 with 3 rules applied. Total rules applied 19 place count 123 transition count 330
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 21 place count 123 transition count 328
Applied a total of 21 rules in 53 ms. Remains 123 /128 variables (removed 5) and now considering 328/338 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 123/128 places, 328/338 transitions.
RANDOM walk for 40000 steps (2213 resets) in 100 ms. (396 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 40 ms. (975 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1761861 steps, run timeout after 3001 ms. (steps per millisecond=587 ) properties seen :0 out of 1
Probabilistic random walk after 1761861 steps, saw 393413 distinct states, run finished after 3001 ms. (steps per millisecond=587 ) properties seen :0
[2024-06-02 22:27:12] [INFO ] Flow matrix only has 301 transitions (discarded 27 similar events)
// Phase 1: matrix 301 rows 123 cols
[2024-06-02 22:27:12] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 22:27:12] [INFO ] State equation strengthened by 45 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 94/100 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 20/120 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 301/421 variables, 120/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/421 variables, 45/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/421 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 3/424 variables, 3/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/424 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/424 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 424/424 variables, and 176 constraints, problems are : Problem set: 0 solved, 1 unsolved in 113 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 123/123 constraints, ReadFeed: 45/45 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/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 94/100 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 20/120 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 301/421 variables, 120/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/421 variables, 45/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/421 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 3/424 variables, 3/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/424 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/424 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/424 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 424/424 variables, and 177 constraints, problems are : Problem set: 0 solved, 1 unsolved in 179 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 123/123 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 316ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 32 ms.
Support contains 6 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 328/328 transitions.
Applied a total of 0 rules in 12 ms. Remains 123 /123 variables (removed 0) and now considering 328/328 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 123/123 places, 328/328 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 328/328 transitions.
Applied a total of 0 rules in 8 ms. Remains 123 /123 variables (removed 0) and now considering 328/328 (removed 0) transitions.
[2024-06-02 22:27:12] [INFO ] Flow matrix only has 301 transitions (discarded 27 similar events)
[2024-06-02 22:27:12] [INFO ] Invariant cache hit.
[2024-06-02 22:27:12] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-06-02 22:27:12] [INFO ] Flow matrix only has 301 transitions (discarded 27 similar events)
[2024-06-02 22:27:12] [INFO ] Invariant cache hit.
[2024-06-02 22:27:12] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-06-02 22:27:13] [INFO ] Implicit Places using invariants and state equation in 183 ms returned [13, 38]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 284 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 121/123 places, 328/328 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 121 transition count 326
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 119 transition count 326
Applied a total of 4 rules in 15 ms. Remains 119 /121 variables (removed 2) and now considering 326/328 (removed 2) transitions.
[2024-06-02 22:27:13] [INFO ] Flow matrix only has 299 transitions (discarded 27 similar events)
// Phase 1: matrix 299 rows 119 cols
[2024-06-02 22:27:13] [INFO ] Computed 6 invariants in 2 ms
[2024-06-02 22:27:13] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-06-02 22:27:13] [INFO ] Flow matrix only has 299 transitions (discarded 27 similar events)
[2024-06-02 22:27:13] [INFO ] Invariant cache hit.
[2024-06-02 22:27:13] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-06-02 22:27:13] [INFO ] Implicit Places using invariants and state equation in 184 ms returned []
Implicit Place search using SMT with State Equation took 257 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 119/123 places, 326/328 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 566 ms. Remains : 119/123 places, 326/328 transitions.
RANDOM walk for 40000 steps (2181 resets) in 72 ms. (547 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 32 ms. (1212 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1818433 steps, run timeout after 3001 ms. (steps per millisecond=605 ) properties seen :0 out of 1
Probabilistic random walk after 1818433 steps, saw 401485 distinct states, run finished after 3001 ms. (steps per millisecond=605 ) properties seen :0
[2024-06-02 22:27:16] [INFO ] Flow matrix only has 299 transitions (discarded 27 similar events)
[2024-06-02 22:27:16] [INFO ] Invariant cache hit.
[2024-06-02 22:27:16] [INFO ] State equation strengthened by 45 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 92/98 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 16/114 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 299/413 variables, 114/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/413 variables, 45/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/413 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 5/418 variables, 5/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/418 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/418 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 418/418 variables, and 170 constraints, problems are : Problem set: 0 solved, 1 unsolved in 117 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 119/119 constraints, ReadFeed: 45/45 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/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 92/98 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 16/114 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 299/413 variables, 114/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/413 variables, 45/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/413 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 5/418 variables, 5/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/418 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/418 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 22:27:16] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 0 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/418 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/418 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/418 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 418/418 variables, and 172 constraints, problems are : Problem set: 0 solved, 1 unsolved in 230 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 119/119 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 370ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 22 ms.
Support contains 6 out of 119 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 119/119 places, 326/326 transitions.
Applied a total of 0 rules in 7 ms. Remains 119 /119 variables (removed 0) and now considering 326/326 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 119/119 places, 326/326 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 119/119 places, 326/326 transitions.
Applied a total of 0 rules in 5 ms. Remains 119 /119 variables (removed 0) and now considering 326/326 (removed 0) transitions.
[2024-06-02 22:27:16] [INFO ] Flow matrix only has 299 transitions (discarded 27 similar events)
[2024-06-02 22:27:16] [INFO ] Invariant cache hit.
[2024-06-02 22:27:16] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-06-02 22:27:16] [INFO ] Flow matrix only has 299 transitions (discarded 27 similar events)
[2024-06-02 22:27:16] [INFO ] Invariant cache hit.
[2024-06-02 22:27:16] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-06-02 22:27:16] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 240 ms to find 0 implicit places.
[2024-06-02 22:27:16] [INFO ] Redundant transitions in 20 ms returned []
Running 325 sub problems to find dead transitions.
[2024-06-02 22:27:17] [INFO ] Flow matrix only has 299 transitions (discarded 27 similar events)
[2024-06-02 22:27:17] [INFO ] Invariant cache hit.
[2024-06-02 22:27:17] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 1 (OVERLAPS) 1/119 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 325 unsolved
[2024-06-02 22:27:18] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 2 ms to minimize.
[2024-06-02 22:27:19] [INFO ] Deduced a trap composed of 44 places in 59 ms of which 1 ms to minimize.
[2024-06-02 22:27:19] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 1 ms to minimize.
[2024-06-02 22:27:19] [INFO ] Deduced a trap composed of 42 places in 33 ms of which 1 ms to minimize.
[2024-06-02 22:27:19] [INFO ] Deduced a trap composed of 34 places in 27 ms of which 1 ms to minimize.
[2024-06-02 22:27:20] [INFO ] Deduced a trap composed of 43 places in 63 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 4 (OVERLAPS) 299/418 variables, 119/131 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/418 variables, 45/176 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/418 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 7 (OVERLAPS) 0/418 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 325 unsolved
No progress, stopping.
After SMT solving in domain Real declared 418/418 variables, and 176 constraints, problems are : Problem set: 0 solved, 325 unsolved in 8842 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 119/119 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 325/325 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 325 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 1 (OVERLAPS) 1/119 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 325 unsolved
[2024-06-02 22:27:27] [INFO ] Deduced a trap composed of 41 places in 56 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 325 unsolved
[2024-06-02 22:27:28] [INFO ] Deduced a trap composed of 70 places in 77 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/119 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 6 (OVERLAPS) 299/418 variables, 119/133 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/418 variables, 45/178 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/418 variables, 325/503 constraints. Problems are: Problem set: 0 solved, 325 unsolved
[2024-06-02 22:27:34] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/418 variables, 1/504 constraints. Problems are: Problem set: 0 solved, 325 unsolved
[2024-06-02 22:27:39] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/418 variables, 1/505 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/418 variables, 0/505 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 12 (OVERLAPS) 0/418 variables, 0/505 constraints. Problems are: Problem set: 0 solved, 325 unsolved
No progress, stopping.
After SMT solving in domain Int declared 418/418 variables, and 505 constraints, problems are : Problem set: 0 solved, 325 unsolved in 28350 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 119/119 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 325/325 constraints, Known Traps: 10/10 constraints]
After SMT, in 37519ms problems are : Problem set: 0 solved, 325 unsolved
Search for dead transitions found 0 dead transitions in 37528ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37806 ms. Remains : 119/119 places, 326/326 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 91 edges and 119 vertex of which 13 / 119 are part of one of the 4 SCC in 4 ms
Free SCC test removed 9 places
Drop transitions (Empty/Sink Transition effects.) removed 42 transitions
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 74 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 109 transition count 251
Drop transitions (Redundant composition of simpler transitions.) removed 32 transitions
Redundant transition composition rules discarded 32 transitions
Iterating global reduction 0 with 32 rules applied. Total rules applied 35 place count 109 transition count 219
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 39 place count 109 transition count 215
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 43 place count 105 transition count 215
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 43 place count 105 transition count 213
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 47 place count 103 transition count 213
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 49 place count 102 transition count 212
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
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 51 place count 101 transition count 212
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 52 place count 101 transition count 211
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 56 place count 101 transition count 207
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 58 place count 100 transition count 206
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 59 place count 99 transition count 174
Iterating global reduction 3 with 1 rules applied. Total rules applied 60 place count 99 transition count 174
Free-agglomeration rule applied 5 times with reduction of 2 identical transitions.
Iterating global reduction 3 with 5 rules applied. Total rules applied 65 place count 99 transition count 167
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 70 place count 94 transition count 167
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 71 place count 94 transition count 166
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 77 place count 94 transition count 166
Applied a total of 77 rules in 68 ms. Remains 94 /119 variables (removed 25) and now considering 166/326 (removed 160) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 166 rows 94 cols
[2024-06-02 22:27:54] [INFO ] Computed 6 invariants in 1 ms
[2024-06-02 22:27:54] [INFO ] After 88ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 22:27:54] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-06-02 22:27:54] [INFO ] After 41ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 22:27:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 22:27:54] [INFO ] After 21ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 22:27:54] [INFO ] After 78ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-02 22:27:54] [INFO ] After 289ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 461 ms.
[2024-06-02 22:27:55] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 7 ms.
[2024-06-02 22:27:55] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 119 places, 326 transitions and 1228 arcs took 7 ms.
[2024-06-02 22:27:55] [INFO ] Flatten gal took : 89 ms
Total runtime 58889 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running FireWire-PT-10

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: 119
TRANSITIONS: 326
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.007s, Sys 0.000s]


SAVING FILE /home/mcc/execution/413/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: 650
MODEL NAME: /home/mcc/execution/413/model
119 places, 326 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-10-ReachabilityCardinality-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1717367408077

--------------------
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 ReachabilityCardinality -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-10"
export BK_EXAMINATION="ReachabilityCardinality"
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-10, examination is ReachabilityCardinality"
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-171734898100246"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FireWire-PT-10.tgz
mv FireWire-PT-10 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;