About the Execution of GreatSPN+red for FireWire-PT-18
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 2346.907 | 269354.00 | 306043.00 | 509.30 | TFFFFTFFTTFTFFFT | normal |
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-171734898300310.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-18, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r549-tall-171734898300310
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 8.3K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K 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 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 10K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.1K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 25K 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 168K 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-18-ReachabilityCardinality-2024-00
FORMULA_NAME FireWire-PT-18-ReachabilityCardinality-2024-01
FORMULA_NAME FireWire-PT-18-ReachabilityCardinality-2024-02
FORMULA_NAME FireWire-PT-18-ReachabilityCardinality-2024-03
FORMULA_NAME FireWire-PT-18-ReachabilityCardinality-2024-04
FORMULA_NAME FireWire-PT-18-ReachabilityCardinality-2024-05
FORMULA_NAME FireWire-PT-18-ReachabilityCardinality-2024-06
FORMULA_NAME FireWire-PT-18-ReachabilityCardinality-2024-07
FORMULA_NAME FireWire-PT-18-ReachabilityCardinality-2024-08
FORMULA_NAME FireWire-PT-18-ReachabilityCardinality-2024-09
FORMULA_NAME FireWire-PT-18-ReachabilityCardinality-2024-10
FORMULA_NAME FireWire-PT-18-ReachabilityCardinality-2024-11
FORMULA_NAME FireWire-PT-18-ReachabilityCardinality-2024-12
FORMULA_NAME FireWire-PT-18-ReachabilityCardinality-2024-13
FORMULA_NAME FireWire-PT-18-ReachabilityCardinality-2024-14
FORMULA_NAME FireWire-PT-18-ReachabilityCardinality-2024-15
=== Now, execution of the tool begins
BK_START 1717373502113
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-18
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-03 00:11:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-03 00:11:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-03 00:11:43] [INFO ] Load time of PNML (sax parser for PT used): 97 ms
[2024-06-03 00:11:43] [INFO ] Transformed 437 places.
[2024-06-03 00:11:43] [INFO ] Transformed 707 transitions.
[2024-06-03 00:11:43] [INFO ] Found NUPN structural information;
[2024-06-03 00:11:43] [INFO ] Parsed PT model containing 437 places and 707 transitions and 2170 arcs in 208 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 18 ms.
Working with output stream class java.io.PrintStream
FORMULA FireWire-PT-18-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-18-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (11 resets) in 2049 ms. (19 steps per ms) remains 12/14 properties
FORMULA FireWire-PT-18-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FireWire-PT-18-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40000 steps (26 resets) in 596 ms. (67 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40000 steps (11 resets) in 310 ms. (128 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40000 steps (16 resets) in 220 ms. (180 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40000 steps (24 resets) in 241 ms. (165 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (10 resets) in 167 ms. (238 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40000 steps (16 resets) in 311 ms. (128 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (14 resets) in 155 ms. (256 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (10 resets) in 218 ms. (182 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40000 steps (12 resets) in 217 ms. (183 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (20 resets) in 76 ms. (519 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40000 steps (22 resets) in 308 ms. (129 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (23 resets) in 229 ms. (173 steps per ms) remains 12/12 properties
// Phase 1: matrix 707 rows 437 cols
[2024-06-03 00:11:45] [INFO ] Computed 9 invariants in 36 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Problem FireWire-PT-18-ReachabilityCardinality-2024-14 is UNSAT
FORMULA FireWire-PT-18-ReachabilityCardinality-2024-14 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 345/425 variables, 8/88 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/425 variables, 345/433 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/425 variables, 0/433 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 12/437 variables, 1/434 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/437 variables, 12/446 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/437 variables, 0/446 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 707/1144 variables, 437/883 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1144 variables, 0/883 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 10 (OVERLAPS) 0/1144 variables, 0/883 constraints. Problems are: Problem set: 1 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1144/1144 variables, and 883 constraints, problems are : Problem set: 1 solved, 11 unsolved in 1347 ms.
Refiners :[Domain max(s): 437/437 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 437/437 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 57/57 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 0/57 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 368/425 variables, 8/65 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/425 variables, 368/433 constraints. Problems are: Problem set: 1 solved, 11 unsolved
[2024-06-03 00:11:47] [INFO ] Deduced a trap composed of 19 places in 281 ms of which 35 ms to minimize.
[2024-06-03 00:11:47] [INFO ] Deduced a trap composed of 76 places in 235 ms of which 4 ms to minimize.
[2024-06-03 00:11:47] [INFO ] Deduced a trap composed of 62 places in 175 ms of which 3 ms to minimize.
[2024-06-03 00:11:47] [INFO ] Deduced a trap composed of 137 places in 105 ms of which 5 ms to minimize.
[2024-06-03 00:11:48] [INFO ] Deduced a trap composed of 19 places in 149 ms of which 3 ms to minimize.
[2024-06-03 00:11:48] [INFO ] Deduced a trap composed of 127 places in 98 ms of which 2 ms to minimize.
[2024-06-03 00:11:48] [INFO ] Deduced a trap composed of 126 places in 346 ms of which 3 ms to minimize.
[2024-06-03 00:11:48] [INFO ] Deduced a trap composed of 128 places in 73 ms of which 2 ms to minimize.
[2024-06-03 00:11:48] [INFO ] Deduced a trap composed of 114 places in 75 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/425 variables, 9/442 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/425 variables, 0/442 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 6 (OVERLAPS) 12/437 variables, 1/443 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/437 variables, 12/455 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/437 variables, 0/455 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 9 (OVERLAPS) 707/1144 variables, 437/892 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1144 variables, 11/903 constraints. Problems are: Problem set: 1 solved, 11 unsolved
[2024-06-03 00:11:50] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1144 variables, 1/904 constraints. Problems are: Problem set: 1 solved, 11 unsolved
[2024-06-03 00:11:50] [INFO ] Deduced a trap composed of 145 places in 178 ms of which 3 ms to minimize.
[2024-06-03 00:11:50] [INFO ] Deduced a trap composed of 135 places in 164 ms of which 3 ms to minimize.
[2024-06-03 00:11:51] [INFO ] Deduced a trap composed of 84 places in 141 ms of which 3 ms to minimize.
[2024-06-03 00:11:51] [INFO ] Deduced a trap composed of 61 places in 167 ms of which 2 ms to minimize.
[2024-06-03 00:11:51] [INFO ] Deduced a trap composed of 165 places in 150 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1144 variables, 5/909 constraints. Problems are: Problem set: 1 solved, 11 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1144/1144 variables, and 909 constraints, problems are : Problem set: 1 solved, 11 unsolved in 5012 ms.
Refiners :[Domain max(s): 437/437 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 437/437 constraints, PredecessorRefiner: 11/12 constraints, Known Traps: 15/15 constraints]
After SMT, in 6489ms problems are : Problem set: 1 solved, 11 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 57 out of 437 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 437/437 places, 707/707 transitions.
Graph (trivial) has 253 edges and 437 vertex of which 3 / 437 are part of one of the 1 SCC in 5 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (complete) has 1279 edges and 435 vertex of which 426 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.2 ms
Discarding 9 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 58 transitions
Trivial Post-agglo rules discarded 58 transitions
Performed 58 trivial Post agglomeration. Transition count delta: 58
Iterating post reduction 0 with 59 rules applied. Total rules applied 61 place count 426 transition count 645
Reduce places removed 58 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 67 rules applied. Total rules applied 128 place count 368 transition count 636
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 136 place count 360 transition count 636
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 136 place count 360 transition count 627
Deduced a syphon composed of 9 places in 3 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 154 place count 351 transition count 627
Discarding 57 places :
Symmetric choice reduction at 3 with 57 rule applications. Total rules 211 place count 294 transition count 567
Iterating global reduction 3 with 57 rules applied. Total rules applied 268 place count 294 transition count 567
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 269 place count 294 transition count 566
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 269 place count 294 transition count 563
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 275 place count 291 transition count 563
Discarding 14 places :
Symmetric choice reduction at 4 with 14 rule applications. Total rules 289 place count 277 transition count 487
Iterating global reduction 4 with 14 rules applied. Total rules applied 303 place count 277 transition count 487
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 305 place count 277 transition count 485
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 307 place count 275 transition count 482
Iterating global reduction 5 with 2 rules applied. Total rules applied 309 place count 275 transition count 482
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 2 rules applied. Total rules applied 311 place count 275 transition count 480
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 312 place count 274 transition count 480
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 313 place count 273 transition count 477
Iterating global reduction 7 with 1 rules applied. Total rules applied 314 place count 273 transition count 477
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 315 place count 272 transition count 475
Iterating global reduction 7 with 1 rules applied. Total rules applied 316 place count 272 transition count 475
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 7 with 64 rules applied. Total rules applied 380 place count 240 transition count 443
Performed 19 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 7 with 38 rules applied. Total rules applied 418 place count 221 transition count 486
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 7 with 4 rules applied. Total rules applied 422 place count 221 transition count 482
Free-agglomeration rule applied 17 times.
Iterating global reduction 7 with 17 rules applied. Total rules applied 439 place count 221 transition count 465
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 7 with 17 rules applied. Total rules applied 456 place count 204 transition count 465
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 458 place count 202 transition count 463
Iterating global reduction 8 with 2 rules applied. Total rules applied 460 place count 202 transition count 463
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 463 place count 202 transition count 460
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 8 with 7 rules applied. Total rules applied 470 place count 202 transition count 460
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 471 place count 201 transition count 459
Applied a total of 471 rules in 260 ms. Remains 201 /437 variables (removed 236) and now considering 459/707 (removed 248) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 271 ms. Remains : 201/437 places, 459/707 transitions.
RANDOM walk for 40000 steps (17 resets) in 255 ms. (156 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40000 steps (31 resets) in 278 ms. (143 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40000 steps (35 resets) in 261 ms. (152 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40000 steps (19 resets) in 298 ms. (133 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40000 steps (13 resets) in 227 ms. (175 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (9 resets) in 98 ms. (404 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40000 steps (28 resets) in 443 ms. (90 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40001 steps (24 resets) in 123 ms. (322 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (21 resets) in 90 ms. (439 steps per ms) remains 10/11 properties
FORMULA FireWire-PT-18-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40000 steps (42 resets) in 135 ms. (294 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (38 resets) in 119 ms. (333 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (19 resets) in 113 ms. (350 steps per ms) remains 10/10 properties
Interrupted probabilistic random walk after 869769 steps, run timeout after 3001 ms. (steps per millisecond=289 ) properties seen :9 out of 10
Probabilistic random walk after 869769 steps, saw 222737 distinct states, run finished after 3017 ms. (steps per millisecond=288 ) properties seen :9
FORMULA FireWire-PT-18-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA FireWire-PT-18-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA FireWire-PT-18-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA FireWire-PT-18-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA FireWire-PT-18-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA FireWire-PT-18-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA FireWire-PT-18-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA FireWire-PT-18-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA FireWire-PT-18-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
[2024-06-03 00:11:56] [INFO ] Flow matrix only has 455 transitions (discarded 4 similar events)
// Phase 1: matrix 455 rows 201 cols
[2024-06-03 00:11:56] [INFO ] Computed 7 invariants in 4 ms
[2024-06-03 00:11:56] [INFO ] State equation strengthened by 6 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 152/166 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 11/177 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/177 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 438/615 variables, 177/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/615 variables, 6/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/615 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 30/645 variables, 15/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/645 variables, 1/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/645 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/647 variables, 1/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/647 variables, 2/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/647 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 8/655 variables, 6/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/655 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1/656 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/656 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/656 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 656/656 variables, and 214 constraints, problems are : Problem set: 0 solved, 1 unsolved in 188 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 201/201 constraints, ReadFeed: 6/6 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/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 152/166 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 11/177 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/177 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 438/615 variables, 177/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/615 variables, 6/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/615 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 30/645 variables, 15/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/645 variables, 1/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/645 variables, 1/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/645 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/647 variables, 1/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/647 variables, 2/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/647 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 8/655 variables, 6/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/655 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1/656 variables, 1/215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/656 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/656 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 656/656 variables, and 215 constraints, problems are : Problem set: 0 solved, 1 unsolved in 336 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 201/201 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 543ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 26 ms.
Support contains 14 out of 201 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 201/201 places, 459/459 transitions.
Graph (trivial) has 67 edges and 201 vertex of which 2 / 201 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 876 edges and 200 vertex of which 199 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 8 rules applied. Total rules applied 10 place count 199 transition count 449
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 8 rules applied. Total rules applied 18 place count 192 transition count 448
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 19 place count 191 transition count 448
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 19 place count 191 transition count 442
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 31 place count 185 transition count 442
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 34 place count 182 transition count 436
Iterating global reduction 3 with 3 rules applied. Total rules applied 37 place count 182 transition count 436
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 38 place count 181 transition count 435
Iterating global reduction 3 with 1 rules applied. Total rules applied 39 place count 181 transition count 435
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 53 place count 174 transition count 428
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 56 place count 171 transition count 425
Iterating global reduction 3 with 3 rules applied. Total rules applied 59 place count 171 transition count 425
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 62 place count 171 transition count 422
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 76 place count 164 transition count 436
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 78 place count 164 transition count 434
Free-agglomeration rule applied 4 times.
Iterating global reduction 4 with 4 rules applied. Total rules applied 82 place count 164 transition count 430
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 87 place count 160 transition count 429
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 88 place count 159 transition count 428
Iterating global reduction 5 with 1 rules applied. Total rules applied 89 place count 159 transition count 428
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 92 place count 159 transition count 425
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 6 with 2 rules applied. Total rules applied 94 place count 159 transition count 527
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 101 place count 157 transition count 522
Drop transitions (Redundant composition of simpler transitions.) removed 41 transitions
Redundant transition composition rules discarded 41 transitions
Iterating global reduction 7 with 41 rules applied. Total rules applied 142 place count 157 transition count 481
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 143 place count 157 transition count 481
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 144 place count 157 transition count 480
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 145 place count 156 transition count 479
Applied a total of 145 rules in 155 ms. Remains 156 /201 variables (removed 45) and now considering 479/459 (removed -20) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 155 ms. Remains : 156/201 places, 479/459 transitions.
RANDOM walk for 40000 steps (1867 resets) in 110 ms. (360 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (358 resets) in 41 ms. (952 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1186167 steps, run timeout after 3001 ms. (steps per millisecond=395 ) properties seen :0 out of 1
Probabilistic random walk after 1186167 steps, saw 297408 distinct states, run finished after 3001 ms. (steps per millisecond=395 ) properties seen :0
[2024-06-03 00:11:59] [INFO ] Flow matrix only has 467 transitions (discarded 12 similar events)
// Phase 1: matrix 467 rows 156 cols
[2024-06-03 00:11:59] [INFO ] Computed 7 invariants in 2 ms
[2024-06-03 00:11:59] [INFO ] State equation strengthened by 63 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 119/133 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 450/583 variables, 133/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/583 variables, 63/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/583 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 35/618 variables, 18/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/618 variables, 3/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/618 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/619 variables, 1/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/619 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/619 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 4/623 variables, 4/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/623 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/623 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 623/623 variables, and 226 constraints, problems are : Problem set: 0 solved, 1 unsolved in 218 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 156/156 constraints, ReadFeed: 63/63 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/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 119/133 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 450/583 variables, 133/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/583 variables, 63/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/583 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 35/618 variables, 18/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/618 variables, 3/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/618 variables, 1/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/618 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/619 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/619 variables, 1/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/619 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 4/623 variables, 4/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/623 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/623 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 623/623 variables, and 227 constraints, problems are : Problem set: 0 solved, 1 unsolved in 350 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 156/156 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 600ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 22 ms.
Support contains 14 out of 156 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 479/479 transitions.
Applied a total of 0 rules in 8 ms. Remains 156 /156 variables (removed 0) and now considering 479/479 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 156/156 places, 479/479 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 479/479 transitions.
Applied a total of 0 rules in 7 ms. Remains 156 /156 variables (removed 0) and now considering 479/479 (removed 0) transitions.
[2024-06-03 00:12:00] [INFO ] Flow matrix only has 467 transitions (discarded 12 similar events)
[2024-06-03 00:12:00] [INFO ] Invariant cache hit.
[2024-06-03 00:12:00] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-06-03 00:12:00] [INFO ] Flow matrix only has 467 transitions (discarded 12 similar events)
[2024-06-03 00:12:00] [INFO ] Invariant cache hit.
[2024-06-03 00:12:00] [INFO ] State equation strengthened by 63 read => feed constraints.
[2024-06-03 00:12:01] [INFO ] Implicit Places using invariants and state equation in 453 ms returned []
Implicit Place search using SMT with State Equation took 560 ms to find 0 implicit places.
[2024-06-03 00:12:01] [INFO ] Redundant transitions in 25 ms returned []
Running 472 sub problems to find dead transitions.
[2024-06-03 00:12:01] [INFO ] Flow matrix only has 467 transitions (discarded 12 similar events)
[2024-06-03 00:12:01] [INFO ] Invariant cache hit.
[2024-06-03 00:12:01] [INFO ] State equation strengthened by 63 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 472 unsolved
[2024-06-03 00:12:03] [INFO ] Deduced a trap composed of 40 places in 49 ms of which 1 ms to minimize.
[2024-06-03 00:12:03] [INFO ] Deduced a trap composed of 49 places in 42 ms of which 0 ms to minimize.
[2024-06-03 00:12:04] [INFO ] Deduced a trap composed of 25 places in 85 ms of which 1 ms to minimize.
[2024-06-03 00:12:04] [INFO ] Deduced a trap composed of 17 places in 92 ms of which 1 ms to minimize.
[2024-06-03 00:12:04] [INFO ] Deduced a trap composed of 52 places in 37 ms of which 1 ms to minimize.
[2024-06-03 00:12:04] [INFO ] Deduced a trap composed of 47 places in 83 ms of which 1 ms to minimize.
[2024-06-03 00:12:04] [INFO ] Deduced a trap composed of 32 places in 83 ms of which 1 ms to minimize.
[2024-06-03 00:12:04] [INFO ] Deduced a trap composed of 53 places in 82 ms of which 2 ms to minimize.
[2024-06-03 00:12:05] [INFO ] Deduced a trap composed of 56 places in 83 ms of which 2 ms to minimize.
[2024-06-03 00:12:05] [INFO ] Deduced a trap composed of 31 places in 75 ms of which 1 ms to minimize.
[2024-06-03 00:12:05] [INFO ] Deduced a trap composed of 105 places in 70 ms of which 1 ms to minimize.
[2024-06-03 00:12:05] [INFO ] Deduced a trap composed of 117 places in 66 ms of which 1 ms to minimize.
[2024-06-03 00:12:06] [INFO ] Deduced a trap composed of 52 places in 83 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/154 variables, 13/18 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 3 (OVERLAPS) 1/155 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 472 unsolved
[2024-06-03 00:12:10] [INFO ] Deduced a trap composed of 47 places in 39 ms of which 1 ms to minimize.
[2024-06-03 00:12:10] [INFO ] Deduced a trap composed of 40 places in 62 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/155 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 472 unsolved
[2024-06-03 00:12:12] [INFO ] Deduced a trap composed of 37 places in 45 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/155 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/155 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 7 (OVERLAPS) 467/622 variables, 155/178 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/622 variables, 63/241 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/622 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 10 (OVERLAPS) 1/623 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/623 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 472 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 623/623 variables, and 242 constraints, problems are : Problem set: 0 solved, 472 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 156/156 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 472/472 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 472 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/154 variables, 16/21 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 3 (OVERLAPS) 1/155 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/155 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 5 (OVERLAPS) 467/622 variables, 155/178 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/622 variables, 63/241 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/622 variables, 472/713 constraints. Problems are: Problem set: 0 solved, 472 unsolved
[2024-06-03 00:12:43] [INFO ] Deduced a trap composed of 86 places in 79 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/622 variables, 1/714 constraints. Problems are: Problem set: 0 solved, 472 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 622/623 variables, and 714 constraints, problems are : Problem set: 0 solved, 472 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 155/156 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 472/472 constraints, Known Traps: 17/17 constraints]
After SMT, in 60561ms problems are : Problem set: 0 solved, 472 unsolved
Search for dead transitions found 0 dead transitions in 60566ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61170 ms. Remains : 156/156 places, 479/479 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 90 edges and 156 vertex of which 6 / 156 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 45 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 150 transition count 433
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 150 transition count 433
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 11 place count 150 transition count 425
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 1 with 2 rules applied. Total rules applied 13 place count 149 transition count 424
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 15 place count 149 transition count 422
Drop transitions (Redundant composition of simpler transitions.) removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 2 with 26 rules applied. Total rules applied 41 place count 149 transition count 396
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 42 place count 149 transition count 428
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 43 place count 148 transition count 428
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 3 with 9 rules applied. Total rules applied 52 place count 148 transition count 428
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 54 place count 148 transition count 426
Applied a total of 54 rules in 34 ms. Remains 148 /156 variables (removed 8) and now considering 426/479 (removed 53) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 426 rows 148 cols
[2024-06-03 00:13:01] [INFO ] Computed 7 invariants in 1 ms
[2024-06-03 00:13:01] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-03 00:13:01] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-03 00:13:02] [INFO ] After 129ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-03 00:13:02] [INFO ] After 170ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-03 00:13:02] [INFO ] After 368ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 464 ms.
[2024-06-03 00:13:02] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 9 ms.
[2024-06-03 00:13:02] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 156 places, 479 transitions and 1842 arcs took 7 ms.
[2024-06-03 00:13:02] [INFO ] Flatten gal took : 94 ms
Total runtime 79333 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running FireWire-PT-18
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/422/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 156
TRANSITIONS: 479
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.010s, Sys 0.000s]
SAVING FILE /home/mcc/execution/422/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: 691
MODEL NAME: /home/mcc/execution/422/model
156 places, 479 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-18-ReachabilityCardinality-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------
BK_STOP 1717373771467
--------------------
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-18"
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-18, 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-171734898300310"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FireWire-PT-18.tgz
mv FireWire-PT-18 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 '
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 ;