About the Execution of LTSMin+red for FireWire-PT-13
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1246.560 | 94534.00 | 135589.00 | 318.50 | FT?TF??FFTFFTTFF | 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-171734901300270.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-13, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r553-tall-171734901300270
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 6.0K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 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 12K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 126K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 49K 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 153K 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-13-ReachabilityCardinality-2024-00
FORMULA_NAME FireWire-PT-13-ReachabilityCardinality-2024-01
FORMULA_NAME FireWire-PT-13-ReachabilityCardinality-2024-02
FORMULA_NAME FireWire-PT-13-ReachabilityCardinality-2024-03
FORMULA_NAME FireWire-PT-13-ReachabilityCardinality-2024-04
FORMULA_NAME FireWire-PT-13-ReachabilityCardinality-2024-05
FORMULA_NAME FireWire-PT-13-ReachabilityCardinality-2024-06
FORMULA_NAME FireWire-PT-13-ReachabilityCardinality-2024-07
FORMULA_NAME FireWire-PT-13-ReachabilityCardinality-2024-08
FORMULA_NAME FireWire-PT-13-ReachabilityCardinality-2024-09
FORMULA_NAME FireWire-PT-13-ReachabilityCardinality-2024-10
FORMULA_NAME FireWire-PT-13-ReachabilityCardinality-2024-11
FORMULA_NAME FireWire-PT-13-ReachabilityCardinality-2024-12
FORMULA_NAME FireWire-PT-13-ReachabilityCardinality-2024-13
FORMULA_NAME FireWire-PT-13-ReachabilityCardinality-2024-14
FORMULA_NAME FireWire-PT-13-ReachabilityCardinality-2024-15
=== Now, execution of the tool begins
BK_START 1717356117249
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-13
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 19:21:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-02 19:21:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 19:21:58] [INFO ] Load time of PNML (sax parser for PT used): 89 ms
[2024-06-02 19:21:58] [INFO ] Transformed 205 places.
[2024-06-02 19:21:58] [INFO ] Transformed 610 transitions.
[2024-06-02 19:21:58] [INFO ] Found NUPN structural information;
[2024-06-02 19:21:58] [INFO ] Parsed PT model containing 205 places and 610 transitions and 2309 arcs in 184 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 17 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 68 transitions
Reduce redundant transitions removed 68 transitions.
FORMULA FireWire-PT-13-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-13-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-13-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-13-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-13-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (1173 resets) in 1826 ms. (21 steps per ms) remains 8/11 properties
FORMULA FireWire-PT-13-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FireWire-PT-13-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FireWire-PT-13-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (234 resets) in 452 ms. (88 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (255 resets) in 173 ms. (229 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (287 resets) in 617 ms. (64 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (243 resets) in 104 ms. (380 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (238 resets) in 207 ms. (192 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (256 resets) in 115 ms. (344 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (12 resets) in 144 ms. (275 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (269 resets) in 154 ms. (258 steps per ms) remains 8/8 properties
[2024-06-02 19:21:59] [INFO ] Flow matrix only has 504 transitions (discarded 38 similar events)
// Phase 1: matrix 504 rows 205 cols
[2024-06-02 19:21:59] [INFO ] Computed 10 invariants in 20 ms
[2024-06-02 19:21:59] [INFO ] State equation strengthened by 73 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 89/89 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem FireWire-PT-13-ReachabilityCardinality-2024-08 is UNSAT
FORMULA FireWire-PT-13-ReachabilityCardinality-2024-08 FALSE TECHNIQUES SMT_REFINEMENT
Problem FireWire-PT-13-ReachabilityCardinality-2024-11 is UNSAT
FORMULA FireWire-PT-13-ReachabilityCardinality-2024-11 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 115/204 variables, 10/99 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 115/214 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 0/214 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 503/707 variables, 204/418 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/707 variables, 72/490 constraints. Problems are: Problem set: 2 solved, 6 unsolved
[2024-06-02 19:22:00] [INFO ] Deduced a trap composed of 36 places in 231 ms of which 157 ms to minimize.
[2024-06-02 19:22:00] [INFO ] Deduced a trap composed of 36 places in 51 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/707 variables, 2/492 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/707 variables, 0/492 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 1/708 variables, 1/493 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/708 variables, 1/494 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/708 variables, 0/494 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 1/709 variables, 1/495 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/709 variables, 0/495 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 0/709 variables, 0/495 constraints. Problems are: Problem set: 2 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 709/709 variables, and 495 constraints, problems are : Problem set: 2 solved, 6 unsolved in 1240 ms.
Refiners :[Domain max(s): 205/205 constraints, Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 205/205 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 2 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 68/68 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 0/68 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 136/204 variables, 10/78 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 136/214 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 2/216 constraints. Problems are: Problem set: 2 solved, 6 unsolved
[2024-06-02 19:22:01] [INFO ] Deduced a trap composed of 44 places in 49 ms of which 1 ms to minimize.
[2024-06-02 19:22:01] [INFO ] Deduced a trap composed of 44 places in 95 ms of which 2 ms to minimize.
[2024-06-02 19:22:01] [INFO ] Deduced a trap composed of 114 places in 91 ms of which 2 ms to minimize.
[2024-06-02 19:22:01] [INFO ] Deduced a trap composed of 17 places in 90 ms of which 2 ms to minimize.
[2024-06-02 19:22:01] [INFO ] Deduced a trap composed of 44 places in 33 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/204 variables, 5/221 constraints. Problems are: Problem set: 2 solved, 6 unsolved
[2024-06-02 19:22:01] [INFO ] Deduced a trap composed of 76 places in 93 ms of which 2 ms to minimize.
[2024-06-02 19:22:01] [INFO ] Deduced a trap composed of 48 places in 39 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/204 variables, 2/223 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/204 variables, 0/223 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 503/707 variables, 204/427 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/707 variables, 72/499 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/707 variables, 2/501 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/707 variables, 0/501 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 1/708 variables, 1/502 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/708 variables, 1/503 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/708 variables, 4/507 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/708 variables, 0/507 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 1/709 variables, 1/508 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/709 variables, 0/508 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 0/709 variables, 0/508 constraints. Problems are: Problem set: 2 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 709/709 variables, and 508 constraints, problems are : Problem set: 2 solved, 6 unsolved in 2492 ms.
Refiners :[Domain max(s): 205/205 constraints, Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 205/205 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 6/8 constraints, Known Traps: 9/9 constraints]
After SMT, in 3985ms problems are : Problem set: 2 solved, 6 unsolved
Parikh walk visited 0 properties in 1735 ms.
Support contains 68 out of 205 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 205/205 places, 542/542 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 205 transition count 539
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 3 place count 205 transition count 538
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 204 transition count 538
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 9 place count 200 transition count 530
Iterating global reduction 1 with 4 rules applied. Total rules applied 13 place count 200 transition count 530
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 200 transition count 528
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 17 place count 199 transition count 527
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 23 place count 199 transition count 521
Applied a total of 23 rules in 91 ms. Remains 199 /205 variables (removed 6) and now considering 521/542 (removed 21) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 101 ms. Remains : 199/205 places, 521/542 transitions.
RANDOM walk for 40000 steps (1182 resets) in 333 ms. (119 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (257 resets) in 110 ms. (360 steps per ms) remains 5/6 properties
FORMULA FireWire-PT-13-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40002 steps (251 resets) in 85 ms. (465 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (243 resets) in 91 ms. (434 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (247 resets) in 91 ms. (434 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (258 resets) in 62 ms. (634 steps per ms) remains 5/5 properties
[2024-06-02 19:22:05] [INFO ] Flow matrix only has 491 transitions (discarded 30 similar events)
// Phase 1: matrix 491 rows 199 cols
[2024-06-02 19:22:05] [INFO ] Computed 10 invariants in 3 ms
[2024-06-02 19:22:05] [INFO ] State equation strengthened by 72 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 144/192 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/192 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 6/198 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/198 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 491/689 variables, 198/208 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/689 variables, 72/280 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-02 19:22:06] [INFO ] Deduced a trap composed of 43 places in 106 ms of which 2 ms to minimize.
[2024-06-02 19:22:06] [INFO ] Deduced a trap composed of 35 places in 99 ms of which 2 ms to minimize.
[2024-06-02 19:22:06] [INFO ] Deduced a trap composed of 70 places in 85 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/689 variables, 3/283 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/689 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 1/690 variables, 1/284 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/690 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-02 19:22:06] [INFO ] Deduced a trap composed of 24 places in 97 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/690 variables, 1/285 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/690 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 0/690 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 690/690 variables, and 285 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1016 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 199/199 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 144/192 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/192 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-02 19:22:07] [INFO ] Deduced a trap composed of 59 places in 97 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/192 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 6/198 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-02 19:22:07] [INFO ] Deduced a trap composed of 43 places in 43 ms of which 1 ms to minimize.
[2024-06-02 19:22:07] [INFO ] Deduced a trap composed of 48 places in 36 ms of which 1 ms to minimize.
[2024-06-02 19:22:07] [INFO ] Deduced a trap composed of 35 places in 45 ms of which 1 ms to minimize.
[2024-06-02 19:22:07] [INFO ] Deduced a trap composed of 36 places in 37 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 4/19 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/198 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 491/689 variables, 198/217 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/689 variables, 72/289 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/689 variables, 3/292 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-02 19:22:07] [INFO ] Deduced a trap composed of 44 places in 44 ms of which 0 ms to minimize.
[2024-06-02 19:22:07] [INFO ] Deduced a trap composed of 17 places in 98 ms of which 1 ms to minimize.
[2024-06-02 19:22:08] [INFO ] Deduced a trap composed of 16 places in 106 ms of which 1 ms to minimize.
[2024-06-02 19:22:08] [INFO ] Deduced a trap composed of 15 places in 105 ms of which 1 ms to minimize.
[2024-06-02 19:22:08] [INFO ] Deduced a trap composed of 47 places in 44 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/689 variables, 5/297 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/689 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 1/690 variables, 1/298 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/690 variables, 2/300 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/690 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 0/690 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 690/690 variables, and 300 constraints, problems are : Problem set: 0 solved, 5 unsolved in 2327 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 199/199 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 14/14 constraints]
After SMT, in 3379ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 0 properties in 2610 ms.
Support contains 48 out of 199 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 199/199 places, 521/521 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 197 transition count 515
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 197 transition count 515
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 195 transition count 511
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 195 transition count 511
Applied a total of 8 rules in 30 ms. Remains 195 /199 variables (removed 4) and now considering 511/521 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 195/199 places, 511/521 transitions.
RANDOM walk for 40000 steps (1162 resets) in 161 ms. (246 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (251 resets) in 111 ms. (357 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (231 resets) in 51 ms. (769 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (242 resets) in 44 ms. (888 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (257 resets) in 36 ms. (1081 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (254 resets) in 50 ms. (784 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 645615 steps, run timeout after 3001 ms. (steps per millisecond=215 ) properties seen :1 out of 5
Probabilistic random walk after 645615 steps, saw 154162 distinct states, run finished after 3006 ms. (steps per millisecond=214 ) properties seen :1
FORMULA FireWire-PT-13-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
[2024-06-02 19:22:15] [INFO ] Flow matrix only has 481 transitions (discarded 30 similar events)
// Phase 1: matrix 481 rows 195 cols
[2024-06-02 19:22:15] [INFO ] Computed 10 invariants in 5 ms
[2024-06-02 19:22:15] [INFO ] State equation strengthened by 70 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 145/188 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/188 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 6/194 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/194 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 481/675 variables, 194/204 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/675 variables, 70/274 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/675 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 1/676 variables, 1/275 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-02 19:22:15] [INFO ] Deduced a trap composed of 58 places in 99 ms of which 2 ms to minimize.
[2024-06-02 19:22:15] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 1 ms to minimize.
[2024-06-02 19:22:15] [INFO ] Deduced a trap composed of 43 places in 54 ms of which 1 ms to minimize.
[2024-06-02 19:22:15] [INFO ] Deduced a trap composed of 35 places in 37 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/676 variables, 4/279 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-02 19:22:15] [INFO ] Deduced a trap composed of 44 places in 45 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/676 variables, 1/280 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/676 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 0/676 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 676/676 variables, and 280 constraints, problems are : Problem set: 0 solved, 4 unsolved in 848 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 195/195 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 145/188 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/188 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-02 19:22:16] [INFO ] Deduced a trap composed of 43 places in 37 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 6/194 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-02 19:22:16] [INFO ] Deduced a trap composed of 35 places in 35 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/194 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/194 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 481/675 variables, 194/211 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/675 variables, 70/281 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/675 variables, 2/283 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/675 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 1/676 variables, 1/284 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/676 variables, 2/286 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/676 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 0/676 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 676/676 variables, and 286 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1072 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 195/195 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 7/7 constraints]
After SMT, in 1944ms problems are : Problem set: 0 solved, 4 unsolved
FORMULA FireWire-PT-13-ReachabilityCardinality-2024-03 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 916 ms.
Support contains 33 out of 195 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 195/195 places, 511/511 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 195 transition count 509
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 193 transition count 509
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 193 transition count 511
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 8 place count 192 transition count 509
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 10 place count 192 transition count 507
Applied a total of 10 rules in 38 ms. Remains 192 /195 variables (removed 3) and now considering 507/511 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 192/195 places, 507/511 transitions.
RANDOM walk for 40000 steps (1302 resets) in 112 ms. (353 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (273 resets) in 84 ms. (470 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (287 resets) in 42 ms. (930 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (268 resets) in 76 ms. (519 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 654319 steps, run timeout after 3001 ms. (steps per millisecond=218 ) properties seen :0 out of 3
Probabilistic random walk after 654319 steps, saw 156395 distinct states, run finished after 3001 ms. (steps per millisecond=218 ) properties seen :0
[2024-06-02 19:22:21] [INFO ] Flow matrix only has 478 transitions (discarded 29 similar events)
// Phase 1: matrix 478 rows 192 cols
[2024-06-02 19:22:21] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 19:22:21] [INFO ] State equation strengthened by 72 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 144/177 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-02 19:22:21] [INFO ] Deduced a trap composed of 44 places in 86 ms of which 2 ms to minimize.
[2024-06-02 19:22:21] [INFO ] Deduced a trap composed of 68 places in 85 ms of which 2 ms to minimize.
[2024-06-02 19:22:21] [INFO ] Deduced a trap composed of 58 places in 86 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/177 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/177 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 12/189 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 478/667 variables, 189/202 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/667 variables, 72/274 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-02 19:22:21] [INFO ] Deduced a trap composed of 17 places in 86 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/667 variables, 1/275 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/667 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 3/670 variables, 3/278 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/670 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/670 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 670/670 variables, and 278 constraints, problems are : Problem set: 0 solved, 3 unsolved in 735 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 192/192 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 144/177 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/177 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-02 19:22:22] [INFO ] Deduced a trap composed of 42 places in 41 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/177 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/177 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 12/189 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-02 19:22:22] [INFO ] Deduced a trap composed of 43 places in 33 ms of which 0 ms to minimize.
[2024-06-02 19:22:22] [INFO ] Deduced a trap composed of 35 places in 29 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 478/667 variables, 189/206 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/667 variables, 72/278 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/667 variables, 2/280 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/667 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 3/670 variables, 3/283 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/670 variables, 1/284 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-02 19:22:22] [INFO ] Deduced a trap composed of 34 places in 49 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/670 variables, 1/285 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-02 19:22:22] [INFO ] Deduced a trap composed of 36 places in 33 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/670 variables, 1/286 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/670 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 0/670 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 670/670 variables, and 286 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1362 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 192/192 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 9/9 constraints]
After SMT, in 2122ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 274 ms.
Support contains 33 out of 192 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 192/192 places, 507/507 transitions.
Applied a total of 0 rules in 11 ms. Remains 192 /192 variables (removed 0) and now considering 507/507 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 192/192 places, 507/507 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 192/192 places, 507/507 transitions.
Applied a total of 0 rules in 9 ms. Remains 192 /192 variables (removed 0) and now considering 507/507 (removed 0) transitions.
[2024-06-02 19:22:23] [INFO ] Flow matrix only has 478 transitions (discarded 29 similar events)
[2024-06-02 19:22:23] [INFO ] Invariant cache hit.
[2024-06-02 19:22:23] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-06-02 19:22:23] [INFO ] Flow matrix only has 478 transitions (discarded 29 similar events)
[2024-06-02 19:22:23] [INFO ] Invariant cache hit.
[2024-06-02 19:22:23] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-02 19:22:23] [INFO ] Implicit Places using invariants and state equation in 297 ms returned [20, 78, 140]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 393 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 189/192 places, 507/507 transitions.
Applied a total of 0 rules in 11 ms. Remains 189 /189 variables (removed 0) and now considering 507/507 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 415 ms. Remains : 189/192 places, 507/507 transitions.
RANDOM walk for 40000 steps (1286 resets) in 127 ms. (312 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (272 resets) in 69 ms. (571 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (276 resets) in 40 ms. (975 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (279 resets) in 42 ms. (930 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 835142 steps, run timeout after 3001 ms. (steps per millisecond=278 ) properties seen :0 out of 3
Probabilistic random walk after 835142 steps, saw 198002 distinct states, run finished after 3001 ms. (steps per millisecond=278 ) properties seen :0
[2024-06-02 19:22:27] [INFO ] Flow matrix only has 478 transitions (discarded 29 similar events)
// Phase 1: matrix 478 rows 189 cols
[2024-06-02 19:22:27] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 19:22:27] [INFO ] State equation strengthened by 72 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 139/172 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/172 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 9/181 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/181 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 474/655 variables, 181/188 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/655 variables, 70/258 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/655 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 12/667 variables, 8/266 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/667 variables, 2/268 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-02 19:22:27] [INFO ] Deduced a trap composed of 43 places in 86 ms of which 1 ms to minimize.
[2024-06-02 19:22:27] [INFO ] Deduced a trap composed of 58 places in 91 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/667 variables, 2/270 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-02 19:22:27] [INFO ] Deduced a trap composed of 29 places in 88 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/667 variables, 1/271 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/667 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/667 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 667/667 variables, and 271 constraints, problems are : Problem set: 0 solved, 3 unsolved in 695 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 139/172 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/172 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/172 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 9/181 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-02 19:22:27] [INFO ] Deduced a trap composed of 34 places in 33 ms of which 0 ms to minimize.
[2024-06-02 19:22:27] [INFO ] Deduced a trap composed of 36 places in 29 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/181 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/181 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 474/655 variables, 181/192 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/655 variables, 70/262 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/655 variables, 1/263 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/655 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 12/667 variables, 8/271 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/667 variables, 2/273 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/667 variables, 2/275 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/667 variables, 1/276 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/667 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 0/667 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 667/667 variables, and 276 constraints, problems are : Problem set: 0 solved, 3 unsolved in 824 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 5/5 constraints]
After SMT, in 1536ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 534 ms.
Support contains 33 out of 189 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 189/189 places, 507/507 transitions.
Applied a total of 0 rules in 8 ms. Remains 189 /189 variables (removed 0) and now considering 507/507 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 189/189 places, 507/507 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 189/189 places, 507/507 transitions.
Applied a total of 0 rules in 8 ms. Remains 189 /189 variables (removed 0) and now considering 507/507 (removed 0) transitions.
[2024-06-02 19:22:29] [INFO ] Flow matrix only has 478 transitions (discarded 29 similar events)
[2024-06-02 19:22:29] [INFO ] Invariant cache hit.
[2024-06-02 19:22:29] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-06-02 19:22:29] [INFO ] Flow matrix only has 478 transitions (discarded 29 similar events)
[2024-06-02 19:22:29] [INFO ] Invariant cache hit.
[2024-06-02 19:22:29] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-02 19:22:29] [INFO ] Implicit Places using invariants and state equation in 331 ms returned []
Implicit Place search using SMT with State Equation took 429 ms to find 0 implicit places.
[2024-06-02 19:22:29] [INFO ] Redundant transitions in 32 ms returned []
Running 506 sub problems to find dead transitions.
[2024-06-02 19:22:29] [INFO ] Flow matrix only has 478 transitions (discarded 29 similar events)
[2024-06-02 19:22:29] [INFO ] Invariant cache hit.
[2024-06-02 19:22:29] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 506 unsolved
At refinement iteration 1 (OVERLAPS) 1/189 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 506 unsolved
[2024-06-02 19:22:33] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 1 ms to minimize.
[2024-06-02 19:22:33] [INFO ] Deduced a trap composed of 67 places in 93 ms of which 1 ms to minimize.
[2024-06-02 19:22:34] [INFO ] Deduced a trap composed of 17 places in 97 ms of which 1 ms to minimize.
[2024-06-02 19:22:34] [INFO ] Deduced a trap composed of 25 places in 93 ms of which 1 ms to minimize.
[2024-06-02 19:22:34] [INFO ] Deduced a trap composed of 35 places in 39 ms of which 0 ms to minimize.
[2024-06-02 19:22:34] [INFO ] Deduced a trap composed of 24 places in 88 ms of which 2 ms to minimize.
[2024-06-02 19:22:35] [INFO ] Deduced a trap composed of 30 places in 193 ms of which 2 ms to minimize.
[2024-06-02 19:22:35] [INFO ] Deduced a trap composed of 34 places in 34 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 506 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 506 unsolved
At refinement iteration 4 (OVERLAPS) 478/667 variables, 189/204 constraints. Problems are: Problem set: 0 solved, 506 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/667 variables, 72/276 constraints. Problems are: Problem set: 0 solved, 506 unsolved
[2024-06-02 19:22:43] [INFO ] Deduced a trap composed of 42 places in 40 ms of which 1 ms to minimize.
[2024-06-02 19:22:45] [INFO ] Deduced a trap composed of 44 places in 40 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/667 variables, 2/278 constraints. Problems are: Problem set: 0 solved, 506 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/667 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 506 unsolved
At refinement iteration 8 (OVERLAPS) 0/667 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 506 unsolved
No progress, stopping.
After SMT solving in domain Real declared 667/667 variables, and 278 constraints, problems are : Problem set: 0 solved, 506 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 506/506 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 506 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 506 unsolved
At refinement iteration 1 (OVERLAPS) 1/189 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 506 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 506 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 506 unsolved
At refinement iteration 4 (OVERLAPS) 478/667 variables, 189/206 constraints. Problems are: Problem set: 0 solved, 506 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/667 variables, 72/278 constraints. Problems are: Problem set: 0 solved, 506 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/667 variables, 506/784 constraints. Problems are: Problem set: 0 solved, 506 unsolved
[2024-06-02 19:23:10] [INFO ] Deduced a trap composed of 44 places in 43 ms of which 1 ms to minimize.
[2024-06-02 19:23:11] [INFO ] Deduced a trap composed of 43 places in 40 ms of which 1 ms to minimize.
[2024-06-02 19:23:17] [INFO ] Deduced a trap composed of 48 places in 54 ms of which 7 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/667 variables, 3/787 constraints. Problems are: Problem set: 0 solved, 506 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 667/667 variables, and 787 constraints, problems are : Problem set: 0 solved, 506 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 506/506 constraints, Known Traps: 13/13 constraints]
After SMT, in 60604ms problems are : Problem set: 0 solved, 506 unsolved
Search for dead transitions found 0 dead transitions in 60611ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61094 ms. Remains : 189/189 places, 507/507 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 97 edges and 189 vertex of which 15 / 189 are part of one of the 4 SCC in 2 ms
Free SCC test removed 11 places
Drop transitions (Empty/Sink Transition effects.) removed 29 transitions
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 64 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 177 transition count 442
Drop transitions (Redundant composition of simpler transitions.) removed 27 transitions
Redundant transition composition rules discarded 27 transitions
Iterating global reduction 0 with 27 rules applied. Total rules applied 30 place count 177 transition count 415
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 32 place count 176 transition count 414
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 34 place count 176 transition count 412
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 36 place count 174 transition count 412
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 174 transition count 412
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 38 place count 174 transition count 411
Applied a total of 38 rules in 41 ms. Remains 174 /189 variables (removed 15) and now considering 411/507 (removed 96) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 411 rows 174 cols
[2024-06-02 19:23:30] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 19:23:30] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-06-02 19:23:30] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 19:23:30] [INFO ] After 148ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-06-02 19:23:30] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-02 19:23:30] [INFO ] After 74ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2024-06-02 19:23:30] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
[2024-06-02 19:23:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 67 ms
[2024-06-02 19:23:30] [INFO ] Deduced a trap composed of 34 places in 50 ms of which 1 ms to minimize.
[2024-06-02 19:23:30] [INFO ] Deduced a trap composed of 32 places in 33 ms of which 0 ms to minimize.
[2024-06-02 19:23:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 124 ms
TRAPS : Iteration 1
[2024-06-02 19:23:31] [INFO ] Deduced a trap composed of 34 places in 40 ms of which 1 ms to minimize.
[2024-06-02 19:23:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 74 ms
TRAPS : Iteration 2
[2024-06-02 19:23:31] [INFO ] After 622ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2024-06-02 19:23:31] [INFO ] After 892ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Over-approximation ignoring read arcs solved 0 properties in 993 ms.
[2024-06-02 19:23:31] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 4 ms.
[2024-06-02 19:23:31] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 189 places, 507 transitions and 1901 arcs took 5 ms.
[2024-06-02 19:23:31] [INFO ] Flatten gal took : 67 ms
Total runtime 93225 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-13-ReachabilityCardinality-2024-02
Could not compute solution for formula : FireWire-PT-13-ReachabilityCardinality-2024-05
Could not compute solution for formula : FireWire-PT-13-ReachabilityCardinality-2024-06
BK_STOP 1717356211783
--------------------
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
mcc2024
rfs formula name FireWire-PT-13-ReachabilityCardinality-2024-02
rfs formula type EF
rfs formula formula --invariant=/tmp/757/inv_0_
rfs formula name FireWire-PT-13-ReachabilityCardinality-2024-05
rfs formula type EF
rfs formula formula --invariant=/tmp/757/inv_1_
rfs formula name FireWire-PT-13-ReachabilityCardinality-2024-06
rfs formula type EF
rfs formula formula --invariant=/tmp/757/inv_2_
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-13"
export BK_EXAMINATION="ReachabilityCardinality"
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-13, 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 r553-tall-171734901300270"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FireWire-PT-13.tgz
mv FireWire-PT-13 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 ;