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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 588K
-rw-r--r-- 1 mcc users 7.4K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 12K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 126K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 99K 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 100K 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-09-ReachabilityFireability-2024-00
FORMULA_NAME FireWire-PT-09-ReachabilityFireability-2024-01
FORMULA_NAME FireWire-PT-09-ReachabilityFireability-2024-02
FORMULA_NAME FireWire-PT-09-ReachabilityFireability-2024-03
FORMULA_NAME FireWire-PT-09-ReachabilityFireability-2024-04
FORMULA_NAME FireWire-PT-09-ReachabilityFireability-2024-05
FORMULA_NAME FireWire-PT-09-ReachabilityFireability-2024-06
FORMULA_NAME FireWire-PT-09-ReachabilityFireability-2024-07
FORMULA_NAME FireWire-PT-09-ReachabilityFireability-2024-08
FORMULA_NAME FireWire-PT-09-ReachabilityFireability-2024-09
FORMULA_NAME FireWire-PT-09-ReachabilityFireability-2024-10
FORMULA_NAME FireWire-PT-09-ReachabilityFireability-2024-11
FORMULA_NAME FireWire-PT-09-ReachabilityFireability-2024-12
FORMULA_NAME FireWire-PT-09-ReachabilityFireability-2024-13
FORMULA_NAME FireWire-PT-09-ReachabilityFireability-2024-14
FORMULA_NAME FireWire-PT-09-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717366947124

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-09
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-02 22:22:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-02 22:22:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 22:22:28] [INFO ] Load time of PNML (sax parser for PT used): 76 ms
[2024-06-02 22:22:28] [INFO ] Transformed 130 places.
[2024-06-02 22:22:28] [INFO ] Transformed 408 transitions.
[2024-06-02 22:22:28] [INFO ] Found NUPN structural information;
[2024-06-02 22:22:28] [INFO ] Parsed PT model containing 130 places and 408 transitions and 1525 arcs in 204 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 56 transitions
Reduce redundant transitions removed 56 transitions.
FORMULA FireWire-PT-09-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (2245 resets) in 1853 ms. (21 steps per ms) remains 13/15 properties
FORMULA FireWire-PT-09-ReachabilityFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FireWire-PT-09-ReachabilityFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (12 resets) in 262 ms. (152 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (88 resets) in 267 ms. (149 steps per ms) remains 9/13 properties
FORMULA FireWire-PT-09-ReachabilityFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-09-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-09-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-09-ReachabilityFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40002 steps (8 resets) in 104 ms. (380 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (587 resets) in 114 ms. (347 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (60 resets) in 145 ms. (273 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (786 resets) in 120 ms. (330 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (446 resets) in 930 ms. (42 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (8 resets) in 193 ms. (206 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (93 resets) in 191 ms. (208 steps per ms) remains 9/9 properties
[2024-06-02 22:22:29] [INFO ] Flow matrix only has 320 transitions (discarded 32 similar events)
// Phase 1: matrix 320 rows 130 cols
[2024-06-02 22:22:29] [INFO ] Computed 8 invariants in 21 ms
[2024-06-02 22:22:29] [INFO ] State equation strengthened by 45 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 89/89 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem FireWire-PT-09-ReachabilityFireability-2024-00 is UNSAT
FORMULA FireWire-PT-09-ReachabilityFireability-2024-00 FALSE TECHNIQUES SMT_REFINEMENT
Problem FireWire-PT-09-ReachabilityFireability-2024-01 is UNSAT
FORMULA FireWire-PT-09-ReachabilityFireability-2024-01 FALSE TECHNIQUES SMT_REFINEMENT
Problem FireWire-PT-09-ReachabilityFireability-2024-02 is UNSAT
FORMULA FireWire-PT-09-ReachabilityFireability-2024-02 FALSE TECHNIQUES SMT_REFINEMENT
Problem FireWire-PT-09-ReachabilityFireability-2024-05 is UNSAT
FORMULA FireWire-PT-09-ReachabilityFireability-2024-05 FALSE TECHNIQUES SMT_REFINEMENT
Problem FireWire-PT-09-ReachabilityFireability-2024-06 is UNSAT
FORMULA FireWire-PT-09-ReachabilityFireability-2024-06 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 39/128 variables, 8/97 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 39/136 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 0/136 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 319/447 variables, 128/264 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/447 variables, 44/308 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/447 variables, 0/308 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 2/449 variables, 2/310 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/449 variables, 2/312 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/449 variables, 0/312 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 1/450 variables, 1/313 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/450 variables, 0/313 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/450 variables, 0/313 constraints. Problems are: Problem set: 5 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 450/450 variables, and 313 constraints, problems are : Problem set: 5 solved, 4 unsolved in 625 ms.
Refiners :[Domain max(s): 130/130 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 130/130 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 52/52 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/52 constraints. Problems are: Problem set: 5 solved, 4 unsolved
Problem FireWire-PT-09-ReachabilityFireability-2024-09 is UNSAT
FORMULA FireWire-PT-09-ReachabilityFireability-2024-09 TRUE TECHNIQUES SMT_REFINEMENT
Problem FireWire-PT-09-ReachabilityFireability-2024-13 is UNSAT
FORMULA FireWire-PT-09-ReachabilityFireability-2024-13 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 69/121 variables, 6/58 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 69/127 constraints. Problems are: Problem set: 7 solved, 2 unsolved
[2024-06-02 22:22:31] [INFO ] Deduced a trap composed of 54 places in 97 ms of which 44 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 1/128 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 0/128 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 7/128 variables, 2/130 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 7/137 constraints. Problems are: Problem set: 7 solved, 2 unsolved
[2024-06-02 22:22:31] [INFO ] Deduced a trap composed of 44 places in 48 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/128 variables, 1/138 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/128 variables, 0/138 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 319/447 variables, 128/266 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/447 variables, 44/310 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/447 variables, 2/312 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/447 variables, 0/312 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 2/449 variables, 2/314 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/449 variables, 2/316 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/449 variables, 0/316 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 1/450 variables, 1/317 constraints. Problems are: Problem set: 7 solved, 2 unsolved
[2024-06-02 22:22:31] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/450 variables, 1/318 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/450 variables, 0/318 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/450 variables, 0/318 constraints. Problems are: Problem set: 7 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 450/450 variables, and 318 constraints, problems are : Problem set: 7 solved, 2 unsolved in 918 ms.
Refiners :[Domain max(s): 130/130 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 130/130 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 2/9 constraints, Known Traps: 3/3 constraints]
After SMT, in 1827ms problems are : Problem set: 7 solved, 2 unsolved
Parikh walk visited 0 properties in 310 ms.
Support contains 16 out of 130 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 130/130 places, 352/352 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 130 transition count 349
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 7 place count 126 transition count 341
Iterating global reduction 1 with 4 rules applied. Total rules applied 11 place count 126 transition count 341
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 14 place count 126 transition count 338
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 15 place count 125 transition count 335
Iterating global reduction 2 with 1 rules applied. Total rules applied 16 place count 125 transition count 335
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 17 place count 124 transition count 333
Iterating global reduction 2 with 1 rules applied. Total rules applied 18 place count 124 transition count 333
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 2 with 2 rules applied. Total rules applied 20 place count 123 transition count 332
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 22 place count 122 transition count 334
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 24 place count 122 transition count 332
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 3 with 7 rules applied. Total rules applied 31 place count 122 transition count 325
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 32 place count 122 transition count 327
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 3 with 3 rules applied. Total rules applied 35 place count 121 transition count 325
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 37 place count 121 transition count 323
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 38 place count 120 transition count 322
Applied a total of 38 rules in 121 ms. Remains 120 /130 variables (removed 10) and now considering 322/352 (removed 30) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 130 ms. Remains : 120/130 places, 322/352 transitions.
RANDOM walk for 40000 steps (2385 resets) in 453 ms. (88 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (571 resets) in 157 ms. (253 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (100 resets) in 101 ms. (392 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1632058 steps, run timeout after 3001 ms. (steps per millisecond=543 ) properties seen :1 out of 2
Probabilistic random walk after 1632058 steps, saw 357882 distinct states, run finished after 3006 ms. (steps per millisecond=542 ) properties seen :1
FORMULA FireWire-PT-09-ReachabilityFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
[2024-06-02 22:22:35] [INFO ] Flow matrix only has 297 transitions (discarded 25 similar events)
// Phase 1: matrix 297 rows 120 cols
[2024-06-02 22:22:35] [INFO ] Computed 8 invariants in 5 ms
[2024-06-02 22:22:35] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 59/61 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 242/303 variables, 61/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/303 variables, 24/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/303 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 107/410 variables, 52/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/410 variables, 3/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/410 variables, 20/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/410 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/411 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/411 variables, 1/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/411 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 6/417 variables, 6/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/417 variables, 2/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/417 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/417 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 417/417 variables, and 172 constraints, problems are : Problem set: 0 solved, 1 unsolved in 140 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 120/120 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 59/61 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 242/303 variables, 61/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/303 variables, 24/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/303 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 107/410 variables, 52/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/410 variables, 3/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/410 variables, 20/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/410 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/410 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/411 variables, 1/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/411 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/411 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 6/417 variables, 6/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/417 variables, 2/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/417 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/417 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 417/417 variables, and 173 constraints, problems are : Problem set: 0 solved, 1 unsolved in 180 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 120/120 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 337ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 6 ms.
Support contains 2 out of 120 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 120/120 places, 322/322 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 119 transition count 319
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 119 transition count 319
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 118 transition count 317
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 118 transition count 317
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 117 transition count 314
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 117 transition count 314
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 0 with 4 rules applied. Total rules applied 10 place count 115 transition count 318
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 14 place count 115 transition count 314
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 16 place count 115 transition count 312
Applied a total of 16 rules in 35 ms. Remains 115 /120 variables (removed 5) and now considering 312/322 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 115/120 places, 312/322 transitions.
RANDOM walk for 40000 steps (2264 resets) in 148 ms. (268 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (541 resets) in 41 ms. (952 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1994383 steps, run timeout after 3001 ms. (steps per millisecond=664 ) properties seen :0 out of 1
Probabilistic random walk after 1994383 steps, saw 442041 distinct states, run finished after 3001 ms. (steps per millisecond=664 ) properties seen :0
[2024-06-02 22:22:38] [INFO ] Flow matrix only has 283 transitions (discarded 29 similar events)
// Phase 1: matrix 283 rows 115 cols
[2024-06-02 22:22:38] [INFO ] Computed 8 invariants in 6 ms
[2024-06-02 22:22:38] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 56/58 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 232/290 variables, 58/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/290 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/290 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 101/391 variables, 50/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/391 variables, 3/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/391 variables, 22/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/391 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/392 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/392 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/392 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 6/398 variables, 6/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/398 variables, 2/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/398 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/398 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 398/398 variables, and 165 constraints, problems are : Problem set: 0 solved, 1 unsolved in 132 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 115/115 constraints, ReadFeed: 42/42 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 56/58 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 232/290 variables, 58/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/290 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/290 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 101/391 variables, 50/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/391 variables, 3/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/391 variables, 22/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/391 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/391 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/392 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/392 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 22:22:39] [INFO ] Deduced a trap composed of 39 places in 34 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/392 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/392 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 6/398 variables, 6/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/398 variables, 2/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/398 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/398 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 398/398 variables, and 167 constraints, problems are : Problem set: 0 solved, 1 unsolved in 205 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 115/115 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 354ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 16 ms.
Support contains 2 out of 115 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 115/115 places, 312/312 transitions.
Applied a total of 0 rules in 7 ms. Remains 115 /115 variables (removed 0) and now considering 312/312 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 115/115 places, 312/312 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 115/115 places, 312/312 transitions.
Applied a total of 0 rules in 7 ms. Remains 115 /115 variables (removed 0) and now considering 312/312 (removed 0) transitions.
[2024-06-02 22:22:39] [INFO ] Flow matrix only has 283 transitions (discarded 29 similar events)
[2024-06-02 22:22:39] [INFO ] Invariant cache hit.
[2024-06-02 22:22:39] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-06-02 22:22:39] [INFO ] Flow matrix only has 283 transitions (discarded 29 similar events)
[2024-06-02 22:22:39] [INFO ] Invariant cache hit.
[2024-06-02 22:22:39] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-06-02 22:22:39] [INFO ] Implicit Places using invariants and state equation in 171 ms returned [12, 36]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 255 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 113/115 places, 312/312 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 113 transition count 310
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 111 transition count 310
Applied a total of 4 rules in 14 ms. Remains 111 /113 variables (removed 2) and now considering 310/312 (removed 2) transitions.
[2024-06-02 22:22:39] [INFO ] Flow matrix only has 281 transitions (discarded 29 similar events)
// Phase 1: matrix 281 rows 111 cols
[2024-06-02 22:22:39] [INFO ] Computed 6 invariants in 2 ms
[2024-06-02 22:22:39] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-06-02 22:22:39] [INFO ] Flow matrix only has 281 transitions (discarded 29 similar events)
[2024-06-02 22:22:39] [INFO ] Invariant cache hit.
[2024-06-02 22:22:39] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-06-02 22:22:39] [INFO ] Implicit Places using invariants and state equation in 162 ms returned []
Implicit Place search using SMT with State Equation took 236 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 111/115 places, 310/312 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 513 ms. Remains : 111/115 places, 310/312 transitions.
RANDOM walk for 40000 steps (2346 resets) in 95 ms. (416 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (579 resets) in 67 ms. (588 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1923173 steps, run timeout after 3001 ms. (steps per millisecond=640 ) properties seen :0 out of 1
Probabilistic random walk after 1923173 steps, saw 426854 distinct states, run finished after 3001 ms. (steps per millisecond=640 ) properties seen :0
[2024-06-02 22:22:42] [INFO ] Flow matrix only has 281 transitions (discarded 29 similar events)
[2024-06-02 22:22:42] [INFO ] Invariant cache hit.
[2024-06-02 22:22:42] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 56/58 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 232/290 variables, 58/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/290 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/290 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 99/389 variables, 50/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/389 variables, 3/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/389 variables, 22/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/389 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/390 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/390 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/390 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/392 variables, 2/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/392 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/392 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 392/392 variables, and 159 constraints, problems are : Problem set: 0 solved, 1 unsolved in 148 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 111/111 constraints, ReadFeed: 42/42 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 56/58 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 232/290 variables, 58/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/290 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/290 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 99/389 variables, 50/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/389 variables, 3/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/389 variables, 22/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/389 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/389 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/390 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/390 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/390 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/392 variables, 2/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/392 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/392 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 392/392 variables, and 160 constraints, problems are : Problem set: 0 solved, 1 unsolved in 180 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 111/111 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 341ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 7 ms.
Support contains 2 out of 111 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 111/111 places, 310/310 transitions.
Applied a total of 0 rules in 7 ms. Remains 111 /111 variables (removed 0) and now considering 310/310 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 111/111 places, 310/310 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 111/111 places, 310/310 transitions.
Applied a total of 0 rules in 6 ms. Remains 111 /111 variables (removed 0) and now considering 310/310 (removed 0) transitions.
[2024-06-02 22:22:43] [INFO ] Flow matrix only has 281 transitions (discarded 29 similar events)
[2024-06-02 22:22:43] [INFO ] Invariant cache hit.
[2024-06-02 22:22:43] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-06-02 22:22:43] [INFO ] Flow matrix only has 281 transitions (discarded 29 similar events)
[2024-06-02 22:22:43] [INFO ] Invariant cache hit.
[2024-06-02 22:22:43] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-06-02 22:22:43] [INFO ] Implicit Places using invariants and state equation in 162 ms returned []
Implicit Place search using SMT with State Equation took 228 ms to find 0 implicit places.
[2024-06-02 22:22:43] [INFO ] Redundant transitions in 17 ms returned []
Running 308 sub problems to find dead transitions.
[2024-06-02 22:22:43] [INFO ] Flow matrix only has 281 transitions (discarded 29 similar events)
[2024-06-02 22:22:43] [INFO ] Invariant cache hit.
[2024-06-02 22:22:43] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 308 unsolved
[2024-06-02 22:22:44] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2024-06-02 22:22:44] [INFO ] Deduced a trap composed of 39 places in 91 ms of which 1 ms to minimize.
[2024-06-02 22:22:44] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 1 ms to minimize.
[2024-06-02 22:22:44] [INFO ] Deduced a trap composed of 40 places in 28 ms of which 1 ms to minimize.
[2024-06-02 22:22:44] [INFO ] Deduced a trap composed of 32 places in 25 ms of which 0 ms to minimize.
[2024-06-02 22:22:45] [INFO ] Deduced a trap composed of 40 places in 78 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/110 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 3 (OVERLAPS) 281/391 variables, 110/122 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/391 variables, 42/164 constraints. Problems are: Problem set: 0 solved, 308 unsolved
[2024-06-02 22:22:48] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/391 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/391 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 7 (OVERLAPS) 1/392 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/392 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 9 (OVERLAPS) 0/392 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 308 unsolved
No progress, stopping.
After SMT solving in domain Real declared 392/392 variables, and 166 constraints, problems are : Problem set: 0 solved, 308 unsolved in 14987 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 111/111 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 308/308 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 308 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/110 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 308 unsolved
[2024-06-02 22:22:59] [INFO ] Deduced a trap composed of 39 places in 44 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 4 (OVERLAPS) 281/391 variables, 110/124 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/391 variables, 42/166 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/391 variables, 308/474 constraints. Problems are: Problem set: 0 solved, 308 unsolved
[2024-06-02 22:23:04] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 0 ms to minimize.
[2024-06-02 22:23:04] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/391 variables, 2/476 constraints. Problems are: Problem set: 0 solved, 308 unsolved
[2024-06-02 22:23:07] [INFO ] Deduced a trap composed of 45 places in 43 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/391 variables, 1/477 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/391 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 10 (OVERLAPS) 1/392 variables, 1/478 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/392 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 308 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 392/392 variables, and 478 constraints, problems are : Problem set: 0 solved, 308 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 111/111 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 308/308 constraints, Known Traps: 11/11 constraints]
After SMT, in 45240ms problems are : Problem set: 0 solved, 308 unsolved
Search for dead transitions found 0 dead transitions in 45244ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45507 ms. Remains : 111/111 places, 310/310 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 109 edges and 111 vertex of which 29 / 111 are part of one of the 4 SCC in 2 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 119 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 126 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 85 transition count 183
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 85 transition count 180
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 8 place count 84 transition count 179
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 9 place count 84 transition count 178
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 11 place count 83 transition count 177
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 12 place count 82 transition count 147
Iterating global reduction 0 with 1 rules applied. Total rules applied 13 place count 82 transition count 147
Free-agglomeration rule applied 3 times with reduction of 2 identical transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 82 transition count 142
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 20 place count 79 transition count 141
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 22 place count 79 transition count 141
Applied a total of 22 rules in 31 ms. Remains 79 /111 variables (removed 32) and now considering 141/310 (removed 169) transitions.
Running SMT prover for 1 properties.
[2024-06-02 22:23:28] [INFO ] Flow matrix only has 139 transitions (discarded 2 similar events)
// Phase 1: matrix 139 rows 79 cols
[2024-06-02 22:23:28] [INFO ] Computed 6 invariants in 1 ms
[2024-06-02 22:23:28] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-06-02 22:23:28] [INFO ] After 66ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 22:23:28] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-06-02 22:23:28] [INFO ] After 30ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 22:23:28] [INFO ] After 42ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-02 22:23:28] [INFO ] After 81ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 193 ms.
[2024-06-02 22:23:28] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 2 ms.
[2024-06-02 22:23:28] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 111 places, 310 transitions and 1163 arcs took 5 ms.
[2024-06-02 22:23:29] [INFO ] Flatten gal took : 80 ms
Total runtime 60914 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running FireWire-PT-09

IS_COLORED=
IS_NUPN=

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


SAVING FILE /home/mcc/execution/412/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: 649
MODEL NAME: /home/mcc/execution/412/model
111 places, 310 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-09-ReachabilityFireability-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1717367013140

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

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