About the Execution of LTSMin+red for FireWire-PT-12
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 746.235 | 68627.00 | 97637.00 | 170.50 | F???TF?????FT??? | 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.r553-tall-171734901300257.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 ltsminxred
Input is FireWire-PT-12, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r553-tall-171734901300257
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 6.7K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K 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.8K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 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 11K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K 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 125K 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-12-CTLCardinality-2024-00
FORMULA_NAME FireWire-PT-12-CTLCardinality-2024-01
FORMULA_NAME FireWire-PT-12-CTLCardinality-2024-02
FORMULA_NAME FireWire-PT-12-CTLCardinality-2024-03
FORMULA_NAME FireWire-PT-12-CTLCardinality-2024-04
FORMULA_NAME FireWire-PT-12-CTLCardinality-2024-05
FORMULA_NAME FireWire-PT-12-CTLCardinality-2024-06
FORMULA_NAME FireWire-PT-12-CTLCardinality-2024-07
FORMULA_NAME FireWire-PT-12-CTLCardinality-2024-08
FORMULA_NAME FireWire-PT-12-CTLCardinality-2024-09
FORMULA_NAME FireWire-PT-12-CTLCardinality-2024-10
FORMULA_NAME FireWire-PT-12-CTLCardinality-2024-11
FORMULA_NAME FireWire-PT-12-CTLCardinality-2024-12
FORMULA_NAME FireWire-PT-12-CTLCardinality-2024-13
FORMULA_NAME FireWire-PT-12-CTLCardinality-2024-14
FORMULA_NAME FireWire-PT-12-CTLCardinality-2024-15
=== Now, execution of the tool begins
BK_START 1717355373153
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-12
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 19:09:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-02 19:09:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 19:09:34] [INFO ] Load time of PNML (sax parser for PT used): 82 ms
[2024-06-02 19:09:34] [INFO ] Transformed 169 places.
[2024-06-02 19:09:34] [INFO ] Transformed 508 transitions.
[2024-06-02 19:09:34] [INFO ] Found NUPN structural information;
[2024-06-02 19:09:34] [INFO ] Parsed PT model containing 169 places and 508 transitions and 1889 arcs in 178 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 13 ms.
Ensure Unique test removed 68 transitions
Reduce redundant transitions removed 68 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA FireWire-PT-12-CTLCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 78 out of 169 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 169/169 places, 440/440 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 169 transition count 434
Applied a total of 6 rules in 26 ms. Remains 169 /169 variables (removed 0) and now considering 434/440 (removed 6) transitions.
[2024-06-02 19:09:34] [INFO ] Flow matrix only has 402 transitions (discarded 32 similar events)
// Phase 1: matrix 402 rows 169 cols
[2024-06-02 19:09:34] [INFO ] Computed 10 invariants in 20 ms
[2024-06-02 19:09:34] [INFO ] Implicit Places using invariants in 272 ms returned []
[2024-06-02 19:09:34] [INFO ] Flow matrix only has 402 transitions (discarded 32 similar events)
[2024-06-02 19:09:34] [INFO ] Invariant cache hit.
[2024-06-02 19:09:35] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-06-02 19:09:35] [INFO ] Implicit Places using invariants and state equation in 381 ms returned [115, 167]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 681 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 167/169 places, 434/440 transitions.
Applied a total of 0 rules in 6 ms. Remains 167 /167 variables (removed 0) and now considering 434/434 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 732 ms. Remains : 167/169 places, 434/440 transitions.
Support contains 78 out of 167 places after structural reductions.
[2024-06-02 19:09:35] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2024-06-02 19:09:35] [INFO ] Flatten gal took : 63 ms
FORMULA FireWire-PT-12-CTLCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-12-CTLCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-12-CTLCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-02 19:09:35] [INFO ] Flatten gal took : 27 ms
[2024-06-02 19:09:35] [INFO ] Input system was already deterministic with 434 transitions.
Support contains 67 out of 167 places (down from 78) after GAL structural reductions.
RANDOM walk for 40000 steps (1067 resets) in 2470 ms. (16 steps per ms) remains 9/47 properties
BEST_FIRST walk for 40004 steps (214 resets) in 194 ms. (205 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (223 resets) in 95 ms. (416 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (191 resets) in 246 ms. (161 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (254 resets) in 78 ms. (506 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (212 resets) in 66 ms. (597 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (208 resets) in 75 ms. (526 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (213 resets) in 68 ms. (579 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (220 resets) in 63 ms. (625 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (211 resets) in 78 ms. (506 steps per ms) remains 9/9 properties
[2024-06-02 19:09:36] [INFO ] Flow matrix only has 402 transitions (discarded 32 similar events)
// Phase 1: matrix 402 rows 167 cols
[2024-06-02 19:09:36] [INFO ] Computed 8 invariants in 8 ms
[2024-06-02 19:09:36] [INFO ] State equation strengthened by 58 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/17 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp21 is UNSAT
At refinement iteration 2 (OVERLAPS) 120/137 variables, 5/22 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 120/142 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 0/142 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 20/157 variables, 3/145 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/157 variables, 20/165 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/157 variables, 0/165 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 394/551 variables, 157/322 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/551 variables, 56/378 constraints. Problems are: Problem set: 2 solved, 7 unsolved
[2024-06-02 19:09:37] [INFO ] Deduced a trap composed of 37 places in 113 ms of which 12 ms to minimize.
[2024-06-02 19:09:37] [INFO ] Deduced a trap composed of 28 places in 141 ms of which 8 ms to minimize.
[2024-06-02 19:09:37] [INFO ] Deduced a trap composed of 63 places in 91 ms of which 1 ms to minimize.
[2024-06-02 19:09:37] [INFO ] Deduced a trap composed of 37 places in 31 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/551 variables, 4/382 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/551 variables, 0/382 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 17/568 variables, 10/392 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/568 variables, 10/402 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/568 variables, 1/403 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/568 variables, 0/403 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 16 (OVERLAPS) 1/569 variables, 1/404 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/569 variables, 0/404 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 18 (OVERLAPS) 0/569 variables, 0/404 constraints. Problems are: Problem set: 2 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 569/569 variables, and 404 constraints, problems are : Problem set: 2 solved, 7 unsolved in 1176 ms.
Refiners :[Domain max(s): 167/167 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 167/167 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 2 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 9/9 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/9 variables, 0/9 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 127/136 variables, 5/14 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 127/141 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/136 variables, 2/143 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/136 variables, 0/143 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 20/156 variables, 3/146 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/156 variables, 20/166 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/156 variables, 2/168 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/156 variables, 0/168 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 393/549 variables, 156/324 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/549 variables, 55/379 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/549 variables, 5/384 constraints. Problems are: Problem set: 2 solved, 7 unsolved
[2024-06-02 19:09:38] [INFO ] Deduced a trap composed of 50 places in 82 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/549 variables, 1/385 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/549 variables, 0/385 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 19/568 variables, 11/396 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/568 variables, 11/407 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/568 variables, 2/409 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/568 variables, 2/411 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/568 variables, 0/411 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 20 (OVERLAPS) 1/569 variables, 1/412 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/569 variables, 0/412 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 22 (OVERLAPS) 0/569 variables, 0/412 constraints. Problems are: Problem set: 2 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 569/569 variables, and 412 constraints, problems are : Problem set: 2 solved, 7 unsolved in 1074 ms.
Refiners :[Domain max(s): 167/167 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 167/167 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 7/9 constraints, Known Traps: 5/5 constraints]
After SMT, in 2295ms problems are : Problem set: 2 solved, 7 unsolved
Fused 7 Parikh solutions to 5 different solutions.
Parikh walk visited 2 properties in 1615 ms.
Support contains 6 out of 167 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 167/167 places, 434/434 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 167 transition count 431
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 6 Pre rules applied. Total rules applied 3 place count 167 transition count 425
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 15 place count 161 transition count 425
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 160 transition count 423
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 160 transition count 423
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 23 place count 157 transition count 430
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 29 place count 157 transition count 424
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 32 place count 157 transition count 421
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 2 with 6 rules applied. Total rules applied 38 place count 157 transition count 426
Reduce places removed 6 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 51 place count 151 transition count 419
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 3 with 8 rules applied. Total rules applied 59 place count 151 transition count 411
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 60 place count 150 transition count 410
Applied a total of 60 rules in 118 ms. Remains 150 /167 variables (removed 17) and now considering 410/434 (removed 24) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 119 ms. Remains : 150/167 places, 410/434 transitions.
RANDOM walk for 40000 steps (1290 resets) in 1439 ms. (27 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (272 resets) in 328 ms. (121 steps per ms) remains 3/5 properties
BEST_FIRST walk for 40003 steps (276 resets) in 327 ms. (121 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (269 resets) in 96 ms. (412 steps per ms) remains 3/3 properties
[2024-06-02 19:09:41] [INFO ] Flow matrix only has 373 transitions (discarded 37 similar events)
// Phase 1: matrix 373 rows 150 cols
[2024-06-02 19:09:41] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 19:09:41] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 79/82 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-02 19:09:41] [INFO ] Deduced a trap composed of 32 places in 41 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 238/320 variables, 82/86 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/320 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 112/432 variables, 19/105 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/432 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/432 variables, 36/142 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/432 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 1/433 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/433 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/433 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 79/512 variables, 40/184 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/512 variables, 20/204 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/512 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 1/513 variables, 1/205 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/513 variables, 1/206 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/513 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 9/522 variables, 6/212 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/522 variables, 2/214 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/522 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 1/523 variables, 1/215 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/523 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (OVERLAPS) 0/523 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 523/523 variables, and 215 constraints, problems are : Problem set: 0 solved, 3 unsolved in 370 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 150/150 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 79/82 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 238/320 variables, 82/86 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/320 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/320 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 112/432 variables, 19/106 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/432 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/432 variables, 36/143 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/432 variables, 2/145 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/432 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 1/433 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/433 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/433 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 79/512 variables, 40/187 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/512 variables, 20/207 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/512 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 1/513 variables, 1/208 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/513 variables, 1/209 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/513 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 9/522 variables, 6/215 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/522 variables, 2/217 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/522 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (OVERLAPS) 1/523 variables, 1/218 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/523 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (OVERLAPS) 0/523 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 523/523 variables, and 218 constraints, problems are : Problem set: 0 solved, 3 unsolved in 386 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 150/150 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
After SMT, in 767ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 2 properties in 67 ms.
Support contains 1 out of 150 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 150/150 places, 410/410 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 148 transition count 412
Applied a total of 4 rules in 22 ms. Remains 148 /150 variables (removed 2) and now considering 412/410 (removed -2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 148/150 places, 412/410 transitions.
RANDOM walk for 40000 steps (1285 resets) in 109 ms. (363 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (264 resets) in 30 ms. (1290 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1347659 steps, run timeout after 3001 ms. (steps per millisecond=449 ) properties seen :0 out of 1
Probabilistic random walk after 1347659 steps, saw 364514 distinct states, run finished after 3004 ms. (steps per millisecond=448 ) properties seen :0
[2024-06-02 19:09:45] [INFO ] Flow matrix only has 375 transitions (discarded 37 similar events)
// Phase 1: matrix 375 rows 148 cols
[2024-06-02 19:09:45] [INFO ] Computed 8 invariants in 3 ms
[2024-06-02 19:09:45] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 38/39 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 119/158 variables, 39/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 186/344 variables, 16/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/344 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/344 variables, 18/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/344 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 1/345 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/345 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/345 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 159/504 variables, 79/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/504 variables, 2/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/504 variables, 38/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/504 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 17/521 variables, 11/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/521 variables, 3/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/521 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/523 variables, 2/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/523 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/523 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 523/523 variables, and 212 constraints, problems are : Problem set: 0 solved, 1 unsolved in 176 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 148/148 constraints, ReadFeed: 56/56 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 38/39 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 119/158 variables, 39/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 186/344 variables, 16/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/344 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/344 variables, 18/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/344 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/344 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/345 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/345 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/345 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 159/504 variables, 79/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/504 variables, 2/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/504 variables, 38/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/504 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 17/521 variables, 11/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/521 variables, 3/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/521 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/523 variables, 2/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/523 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/523 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 523/523 variables, and 213 constraints, problems are : Problem set: 0 solved, 1 unsolved in 227 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 148/148 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 414ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 5 ms.
Support contains 1 out of 148 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 148/148 places, 412/412 transitions.
Applied a total of 0 rules in 9 ms. Remains 148 /148 variables (removed 0) and now considering 412/412 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 148/148 places, 412/412 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 148/148 places, 412/412 transitions.
Applied a total of 0 rules in 8 ms. Remains 148 /148 variables (removed 0) and now considering 412/412 (removed 0) transitions.
[2024-06-02 19:09:45] [INFO ] Flow matrix only has 375 transitions (discarded 37 similar events)
[2024-06-02 19:09:45] [INFO ] Invariant cache hit.
[2024-06-02 19:09:45] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-06-02 19:09:45] [INFO ] Flow matrix only has 375 transitions (discarded 37 similar events)
[2024-06-02 19:09:45] [INFO ] Invariant cache hit.
[2024-06-02 19:09:45] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-06-02 19:09:46] [INFO ] Implicit Places using invariants and state equation in 218 ms returned [56]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 310 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 147/148 places, 412/412 transitions.
Applied a total of 0 rules in 10 ms. Remains 147 /147 variables (removed 0) and now considering 412/412 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 329 ms. Remains : 147/148 places, 412/412 transitions.
RANDOM walk for 40000 steps (1289 resets) in 102 ms. (388 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (272 resets) in 23 ms. (1666 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1419661 steps, run timeout after 3001 ms. (steps per millisecond=473 ) properties seen :0 out of 1
Probabilistic random walk after 1419661 steps, saw 384458 distinct states, run finished after 3001 ms. (steps per millisecond=473 ) properties seen :0
[2024-06-02 19:09:49] [INFO ] Flow matrix only has 375 transitions (discarded 37 similar events)
// Phase 1: matrix 375 rows 147 cols
[2024-06-02 19:09:49] [INFO ] Computed 7 invariants in 7 ms
[2024-06-02 19:09:49] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 38/39 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 119/158 variables, 39/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 186/344 variables, 16/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/344 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/344 variables, 18/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/344 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 1/345 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/345 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/345 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 159/504 variables, 79/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/504 variables, 2/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/504 variables, 38/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/504 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 16/520 variables, 10/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/520 variables, 2/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/520 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/522 variables, 2/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/522 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/522 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 522/522 variables, and 210 constraints, problems are : Problem set: 0 solved, 1 unsolved in 163 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 147/147 constraints, ReadFeed: 56/56 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 38/39 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 119/158 variables, 39/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 186/344 variables, 16/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/344 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/344 variables, 18/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/344 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/344 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/345 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/345 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/345 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 159/504 variables, 79/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/504 variables, 2/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/504 variables, 38/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/504 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 16/520 variables, 10/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/520 variables, 2/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/520 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/522 variables, 2/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/522 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/522 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 522/522 variables, and 211 constraints, problems are : Problem set: 0 solved, 1 unsolved in 172 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 147/147 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 352ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 147 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 147/147 places, 412/412 transitions.
Applied a total of 0 rules in 8 ms. Remains 147 /147 variables (removed 0) and now considering 412/412 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 147/147 places, 412/412 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 147/147 places, 412/412 transitions.
Applied a total of 0 rules in 8 ms. Remains 147 /147 variables (removed 0) and now considering 412/412 (removed 0) transitions.
[2024-06-02 19:09:49] [INFO ] Flow matrix only has 375 transitions (discarded 37 similar events)
[2024-06-02 19:09:49] [INFO ] Invariant cache hit.
[2024-06-02 19:09:49] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-06-02 19:09:49] [INFO ] Flow matrix only has 375 transitions (discarded 37 similar events)
[2024-06-02 19:09:49] [INFO ] Invariant cache hit.
[2024-06-02 19:09:49] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-06-02 19:09:49] [INFO ] Implicit Places using invariants and state equation in 226 ms returned []
Implicit Place search using SMT with State Equation took 301 ms to find 0 implicit places.
[2024-06-02 19:09:49] [INFO ] Redundant transitions in 26 ms returned []
Running 406 sub problems to find dead transitions.
[2024-06-02 19:09:49] [INFO ] Flow matrix only has 375 transitions (discarded 37 similar events)
[2024-06-02 19:09:49] [INFO ] Invariant cache hit.
[2024-06-02 19:09:49] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/147 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 406 unsolved
[2024-06-02 19:09:51] [INFO ] Deduced a trap composed of 50 places in 74 ms of which 1 ms to minimize.
[2024-06-02 19:09:51] [INFO ] Deduced a trap composed of 32 places in 72 ms of which 2 ms to minimize.
[2024-06-02 19:09:51] [INFO ] Deduced a trap composed of 23 places in 106 ms of which 1 ms to minimize.
[2024-06-02 19:09:52] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 1 ms to minimize.
[2024-06-02 19:09:52] [INFO ] Deduced a trap composed of 25 places in 81 ms of which 7 ms to minimize.
[2024-06-02 19:09:52] [INFO ] Deduced a trap composed of 32 places in 30 ms of which 0 ms to minimize.
[2024-06-02 19:09:52] [INFO ] Deduced a trap composed of 32 places in 34 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/147 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 3 (OVERLAPS) 375/522 variables, 147/161 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/522 variables, 56/217 constraints. Problems are: Problem set: 0 solved, 406 unsolved
[2024-06-02 19:09:59] [INFO ] Deduced a trap composed of 38 places in 46 ms of which 2 ms to minimize.
[2024-06-02 19:09:59] [INFO ] Deduced a trap composed of 38 places in 33 ms of which 0 ms to minimize.
[2024-06-02 19:09:59] [INFO ] Deduced a trap composed of 38 places in 37 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/522 variables, 3/220 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/522 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 7 (OVERLAPS) 0/522 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 406 unsolved
No progress, stopping.
After SMT solving in domain Real declared 522/522 variables, and 220 constraints, problems are : Problem set: 0 solved, 406 unsolved in 19448 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 147/147 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 406/406 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 406 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/147 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/147 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 3 (OVERLAPS) 375/522 variables, 147/164 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/522 variables, 56/220 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/522 variables, 406/626 constraints. Problems are: Problem set: 0 solved, 406 unsolved
[2024-06-02 19:10:20] [INFO ] Deduced a trap composed of 51 places in 81 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/522 variables, 1/627 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/522 variables, 0/627 constraints. Problems are: Problem set: 0 solved, 406 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 522/522 variables, and 627 constraints, problems are : Problem set: 0 solved, 406 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 147/147 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 406/406 constraints, Known Traps: 11/11 constraints]
After SMT, in 49904ms problems are : Problem set: 0 solved, 406 unsolved
Search for dead transitions found 0 dead transitions in 49912ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50263 ms. Remains : 147/147 places, 412/412 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 136 edges and 147 vertex of which 29 / 147 are part of one of the 4 SCC in 1 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 123 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 144 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 121 transition count 267
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 0 with 9 rules applied. Total rules applied 12 place count 121 transition count 258
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 14 place count 120 transition count 257
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 15 place count 120 transition count 256
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 17 place count 119 transition count 255
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 18 place count 118 transition count 216
Iterating global reduction 0 with 1 rules applied. Total rules applied 19 place count 118 transition count 216
Free-agglomeration rule applied 9 times with reduction of 6 identical transitions.
Iterating global reduction 0 with 9 rules applied. Total rules applied 28 place count 118 transition count 201
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 40 place count 109 transition count 198
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 46 place count 109 transition count 198
Applied a total of 46 rules in 84 ms. Remains 109 /147 variables (removed 38) and now considering 198/412 (removed 214) transitions.
Running SMT prover for 1 properties.
[2024-06-02 19:10:39] [INFO ] Flow matrix only has 196 transitions (discarded 2 similar events)
// Phase 1: matrix 196 rows 109 cols
[2024-06-02 19:10:39] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 19:10:39] [INFO ] [Real]Absence check using 7 positive place invariants in 9 ms returned sat
[2024-06-02 19:10:40] [INFO ] After 162ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 19:10:40] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-02 19:10:40] [INFO ] After 41ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 19:10:40] [INFO ] Deduced a trap composed of 21 places in 19 ms of which 0 ms to minimize.
[2024-06-02 19:10:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 37 ms
TRAPS : Iteration 1
[2024-06-02 19:10:40] [INFO ] After 95ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-02 19:10:40] [INFO ] After 128ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 393 ms.
Successfully simplified 2 atomic propositions for a total of 12 simplifications.
[2024-06-02 19:10:40] [INFO ] Flatten gal took : 29 ms
[2024-06-02 19:10:40] [INFO ] Flatten gal took : 22 ms
[2024-06-02 19:10:40] [INFO ] Input system was already deterministic with 434 transitions.
Support contains 55 out of 167 places (down from 60) after GAL structural reductions.
Computed a total of 23 stabilizing places and 37 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 167/167 places, 434/434 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 164 transition count 428
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 164 transition count 428
Applied a total of 6 rules in 4 ms. Remains 164 /167 variables (removed 3) and now considering 428/434 (removed 6) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 164/167 places, 428/434 transitions.
[2024-06-02 19:10:40] [INFO ] Flatten gal took : 36 ms
[2024-06-02 19:10:40] [INFO ] Flatten gal took : 34 ms
[2024-06-02 19:10:40] [INFO ] Input system was already deterministic with 428 transitions.
Starting structural reductions in LTL mode, iteration 0 : 167/167 places, 434/434 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 165 transition count 430
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 165 transition count 430
Applied a total of 4 rules in 11 ms. Remains 165 /167 variables (removed 2) and now considering 430/434 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 165/167 places, 430/434 transitions.
[2024-06-02 19:10:40] [INFO ] Flatten gal took : 30 ms
[2024-06-02 19:10:40] [INFO ] Flatten gal took : 26 ms
[2024-06-02 19:10:40] [INFO ] Input system was already deterministic with 430 transitions.
Starting structural reductions in LTL mode, iteration 0 : 167/167 places, 434/434 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 164 transition count 428
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 164 transition count 428
Applied a total of 6 rules in 3 ms. Remains 164 /167 variables (removed 3) and now considering 428/434 (removed 6) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 164/167 places, 428/434 transitions.
[2024-06-02 19:10:40] [INFO ] Flatten gal took : 15 ms
[2024-06-02 19:10:40] [INFO ] Flatten gal took : 16 ms
[2024-06-02 19:10:40] [INFO ] Input system was already deterministic with 428 transitions.
Starting structural reductions in LTL mode, iteration 0 : 167/167 places, 434/434 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 165 transition count 430
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 165 transition count 430
Applied a total of 4 rules in 3 ms. Remains 165 /167 variables (removed 2) and now considering 430/434 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 165/167 places, 430/434 transitions.
[2024-06-02 19:10:40] [INFO ] Flatten gal took : 16 ms
[2024-06-02 19:10:40] [INFO ] Flatten gal took : 24 ms
[2024-06-02 19:10:40] [INFO ] Input system was already deterministic with 430 transitions.
Starting structural reductions in LTL mode, iteration 0 : 167/167 places, 434/434 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 164 transition count 428
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 164 transition count 428
Applied a total of 6 rules in 3 ms. Remains 164 /167 variables (removed 3) and now considering 428/434 (removed 6) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 164/167 places, 428/434 transitions.
[2024-06-02 19:10:40] [INFO ] Flatten gal took : 15 ms
[2024-06-02 19:10:40] [INFO ] Flatten gal took : 15 ms
[2024-06-02 19:10:40] [INFO ] Input system was already deterministic with 428 transitions.
Starting structural reductions in LTL mode, iteration 0 : 167/167 places, 434/434 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 165 transition count 430
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 165 transition count 430
Applied a total of 4 rules in 3 ms. Remains 165 /167 variables (removed 2) and now considering 430/434 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 165/167 places, 430/434 transitions.
[2024-06-02 19:10:40] [INFO ] Flatten gal took : 17 ms
[2024-06-02 19:10:40] [INFO ] Flatten gal took : 15 ms
[2024-06-02 19:10:40] [INFO ] Input system was already deterministic with 430 transitions.
Starting structural reductions in LTL mode, iteration 0 : 167/167 places, 434/434 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 165 transition count 430
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 165 transition count 430
Applied a total of 4 rules in 3 ms. Remains 165 /167 variables (removed 2) and now considering 430/434 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 165/167 places, 430/434 transitions.
[2024-06-02 19:10:40] [INFO ] Flatten gal took : 13 ms
[2024-06-02 19:10:40] [INFO ] Flatten gal took : 14 ms
[2024-06-02 19:10:40] [INFO ] Input system was already deterministic with 430 transitions.
Starting structural reductions in LTL mode, iteration 0 : 167/167 places, 434/434 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 165 transition count 430
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 165 transition count 430
Applied a total of 4 rules in 3 ms. Remains 165 /167 variables (removed 2) and now considering 430/434 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 165/167 places, 430/434 transitions.
[2024-06-02 19:10:40] [INFO ] Flatten gal took : 13 ms
[2024-06-02 19:10:40] [INFO ] Flatten gal took : 13 ms
[2024-06-02 19:10:41] [INFO ] Input system was already deterministic with 430 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 167/167 places, 434/434 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 166 transition count 427
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 160 transition count 427
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 157 transition count 421
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 157 transition count 421
Applied a total of 18 rules in 17 ms. Remains 157 /167 variables (removed 10) and now considering 421/434 (removed 13) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 17 ms. Remains : 157/167 places, 421/434 transitions.
[2024-06-02 19:10:41] [INFO ] Flatten gal took : 11 ms
[2024-06-02 19:10:41] [INFO ] Flatten gal took : 12 ms
[2024-06-02 19:10:41] [INFO ] Input system was already deterministic with 421 transitions.
RANDOM walk for 2958 steps (97 resets) in 29 ms. (98 steps per ms) remains 0/1 properties
FORMULA FireWire-PT-12-CTLCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 167/167 places, 434/434 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 166 transition count 432
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 166 transition count 432
Applied a total of 2 rules in 3 ms. Remains 166 /167 variables (removed 1) and now considering 432/434 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 166/167 places, 432/434 transitions.
[2024-06-02 19:10:41] [INFO ] Flatten gal took : 12 ms
[2024-06-02 19:10:41] [INFO ] Flatten gal took : 13 ms
[2024-06-02 19:10:41] [INFO ] Input system was already deterministic with 432 transitions.
Starting structural reductions in LTL mode, iteration 0 : 167/167 places, 434/434 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 164 transition count 428
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 164 transition count 428
Applied a total of 6 rules in 3 ms. Remains 164 /167 variables (removed 3) and now considering 428/434 (removed 6) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 164/167 places, 428/434 transitions.
[2024-06-02 19:10:41] [INFO ] Flatten gal took : 13 ms
[2024-06-02 19:10:41] [INFO ] Flatten gal took : 12 ms
[2024-06-02 19:10:41] [INFO ] Input system was already deterministic with 428 transitions.
Starting structural reductions in LTL mode, iteration 0 : 167/167 places, 434/434 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 165 transition count 430
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 165 transition count 430
Applied a total of 4 rules in 3 ms. Remains 165 /167 variables (removed 2) and now considering 430/434 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 165/167 places, 430/434 transitions.
[2024-06-02 19:10:41] [INFO ] Flatten gal took : 12 ms
[2024-06-02 19:10:41] [INFO ] Flatten gal took : 12 ms
[2024-06-02 19:10:41] [INFO ] Input system was already deterministic with 430 transitions.
[2024-06-02 19:10:41] [INFO ] Flatten gal took : 12 ms
[2024-06-02 19:10:41] [INFO ] Flatten gal took : 13 ms
[2024-06-02 19:10:41] [INFO ] Export to MCC of 11 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 6 ms.
[2024-06-02 19:10:41] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 167 places, 434 transitions and 1587 arcs took 9 ms.
Total runtime 67124 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=
[--mu-opt] [--saturation=
[--sat-granularity=
[--guidance=
[--action=
[--trace=
[--mu=
[--ctl=
[--save-levels=STRING] [--pg-solve] [--attr=
[--saturating-attractor] [--write-strategy=
[--check-strategy] [--interactive-play] [--player]
[--pg-write=
[--edge-label=
[--mucalc=
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por=
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=
[--cw-max-cols=
[--mh-timeout=
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=
[--ldd32-cache=
[--cache-ratio=
[--min-free-nodes=
[--fdd-reorder=
[--vset-cache-diff=
[--next-union] [--peak-nodes] [--maxsum=
[--block-size=
[--debug=
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS]
Could not compute solution for formula : FireWire-PT-12-CTLCardinality-2024-01
Could not compute solution for formula : FireWire-PT-12-CTLCardinality-2024-02
Could not compute solution for formula : FireWire-PT-12-CTLCardinality-2024-03
Could not compute solution for formula : FireWire-PT-12-CTLCardinality-2024-06
Could not compute solution for formula : FireWire-PT-12-CTLCardinality-2024-07
Could not compute solution for formula : FireWire-PT-12-CTLCardinality-2024-08
Could not compute solution for formula : FireWire-PT-12-CTLCardinality-2024-09
Could not compute solution for formula : FireWire-PT-12-CTLCardinality-2024-10
Could not compute solution for formula : FireWire-PT-12-CTLCardinality-2024-13
Could not compute solution for formula : FireWire-PT-12-CTLCardinality-2024-14
Could not compute solution for formula : FireWire-PT-12-CTLCardinality-2024-15
BK_STOP 1717355441780
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -timeout 360 -rebuildPNML
mcc2024
ctl formula name FireWire-PT-12-CTLCardinality-2024-01
ctl formula formula --ctl=/tmp/624/ctl_0_
ctl formula name FireWire-PT-12-CTLCardinality-2024-02
ctl formula formula --ctl=/tmp/624/ctl_1_
ctl formula name FireWire-PT-12-CTLCardinality-2024-03
ctl formula formula --ctl=/tmp/624/ctl_2_
ctl formula name FireWire-PT-12-CTLCardinality-2024-06
ctl formula formula --ctl=/tmp/624/ctl_3_
ctl formula name FireWire-PT-12-CTLCardinality-2024-07
ctl formula formula --ctl=/tmp/624/ctl_4_
ctl formula name FireWire-PT-12-CTLCardinality-2024-08
ctl formula formula --ctl=/tmp/624/ctl_5_
ctl formula name FireWire-PT-12-CTLCardinality-2024-09
ctl formula formula --ctl=/tmp/624/ctl_6_
ctl formula name FireWire-PT-12-CTLCardinality-2024-10
ctl formula formula --ctl=/tmp/624/ctl_7_
ctl formula name FireWire-PT-12-CTLCardinality-2024-13
ctl formula formula --ctl=/tmp/624/ctl_8_
ctl formula name FireWire-PT-12-CTLCardinality-2024-14
ctl formula formula --ctl=/tmp/624/ctl_9_
ctl formula name FireWire-PT-12-CTLCardinality-2024-15
ctl formula formula --ctl=/tmp/624/ctl_10_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc
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-12"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is FireWire-PT-12, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r553-tall-171734901300257"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FireWire-PT-12.tgz
mv FireWire-PT-12 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;