About the Execution of LTSMin+red for FireWire-PT-14
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 998.451 | 70773.00 | 100346.00 | 258.50 | FTF?FFFTTTTFFFF? | 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-171734901300279.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-14, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r553-tall-171734901300279
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 596K
-rw-r--r-- 1 mcc users 5.8K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 11K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 110K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K 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-14-ReachabilityFireability-2024-00
FORMULA_NAME FireWire-PT-14-ReachabilityFireability-2024-01
FORMULA_NAME FireWire-PT-14-ReachabilityFireability-2024-02
FORMULA_NAME FireWire-PT-14-ReachabilityFireability-2024-03
FORMULA_NAME FireWire-PT-14-ReachabilityFireability-2024-04
FORMULA_NAME FireWire-PT-14-ReachabilityFireability-2024-05
FORMULA_NAME FireWire-PT-14-ReachabilityFireability-2024-06
FORMULA_NAME FireWire-PT-14-ReachabilityFireability-2024-07
FORMULA_NAME FireWire-PT-14-ReachabilityFireability-2024-08
FORMULA_NAME FireWire-PT-14-ReachabilityFireability-2024-09
FORMULA_NAME FireWire-PT-14-ReachabilityFireability-2024-10
FORMULA_NAME FireWire-PT-14-ReachabilityFireability-2024-11
FORMULA_NAME FireWire-PT-14-ReachabilityFireability-2024-12
FORMULA_NAME FireWire-PT-14-ReachabilityFireability-2024-13
FORMULA_NAME FireWire-PT-14-ReachabilityFireability-2024-14
FORMULA_NAME FireWire-PT-14-ReachabilityFireability-2024-15
=== Now, execution of the tool begins
BK_START 1717356609206
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-14
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 19:30:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-02 19:30:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 19:30:10] [INFO ] Load time of PNML (sax parser for PT used): 87 ms
[2024-06-02 19:30:10] [INFO ] Transformed 205 places.
[2024-06-02 19:30:10] [INFO ] Transformed 610 transitions.
[2024-06-02 19:30:10] [INFO ] Found NUPN structural information;
[2024-06-02 19:30:10] [INFO ] Parsed PT model containing 205 places and 610 transitions and 2315 arcs in 182 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 71 transitions
Reduce redundant transitions removed 71 transitions.
RANDOM walk for 40000 steps (1179 resets) in 1645 ms. (24 steps per ms) remains 10/16 properties
FORMULA FireWire-PT-14-ReachabilityFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FireWire-PT-14-ReachabilityFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FireWire-PT-14-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FireWire-PT-14-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FireWire-PT-14-ReachabilityFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FireWire-PT-14-ReachabilityFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 821 ms. (48 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (243 resets) in 179 ms. (222 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (240 resets) in 642 ms. (62 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (111 resets) in 360 ms. (110 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (262 resets) in 145 ms. (274 steps per ms) remains 9/10 properties
FORMULA FireWire-PT-14-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40002 steps (205 resets) in 115 ms. (344 steps per ms) remains 8/9 properties
FORMULA FireWire-PT-14-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (11 resets) in 142 ms. (279 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (391 resets) in 186 ms. (213 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (14 resets) in 100 ms. (396 steps per ms) remains 7/8 properties
FORMULA FireWire-PT-14-ReachabilityFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (29 resets) in 183 ms. (217 steps per ms) remains 7/7 properties
[2024-06-02 19:30:12] [INFO ] Flow matrix only has 501 transitions (discarded 38 similar events)
// Phase 1: matrix 501 rows 205 cols
[2024-06-02 19:30:12] [INFO ] Computed 10 invariants in 24 ms
[2024-06-02 19:30:12] [INFO ] State equation strengthened by 73 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 114/114 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/114 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem FireWire-PT-14-ReachabilityFireability-2024-00 is UNSAT
FORMULA FireWire-PT-14-ReachabilityFireability-2024-00 FALSE TECHNIQUES SMT_REFINEMENT
Problem FireWire-PT-14-ReachabilityFireability-2024-04 is UNSAT
FORMULA FireWire-PT-14-ReachabilityFireability-2024-04 FALSE TECHNIQUES SMT_REFINEMENT
Problem FireWire-PT-14-ReachabilityFireability-2024-12 is UNSAT
FORMULA FireWire-PT-14-ReachabilityFireability-2024-12 FALSE TECHNIQUES SMT_REFINEMENT
Problem FireWire-PT-14-ReachabilityFireability-2024-13 is UNSAT
FORMULA FireWire-PT-14-ReachabilityFireability-2024-13 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 85/199 variables, 9/123 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/199 variables, 85/208 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/199 variables, 0/208 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 3/202 variables, 1/209 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/202 variables, 3/212 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 0/212 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 500/702 variables, 202/414 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/702 variables, 72/486 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/702 variables, 0/486 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 3/705 variables, 3/489 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/705 variables, 3/492 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/705 variables, 0/492 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 1/706 variables, 1/493 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/706 variables, 0/493 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 0/706 variables, 0/493 constraints. Problems are: Problem set: 4 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 706/706 variables, and 493 constraints, problems are : Problem set: 4 solved, 3 unsolved in 785 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: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 56/56 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 0/56 constraints. Problems are: Problem set: 4 solved, 3 unsolved
Problem FireWire-PT-14-ReachabilityFireability-2024-08 is UNSAT
FORMULA FireWire-PT-14-ReachabilityFireability-2024-08 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 143/199 variables, 9/65 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/199 variables, 143/208 constraints. Problems are: Problem set: 5 solved, 2 unsolved
[2024-06-02 19:30:13] [INFO ] Deduced a trap composed of 44 places in 85 ms of which 10 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/199 variables, 1/209 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/199 variables, 0/209 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 3/202 variables, 1/210 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 3/213 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 0/213 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 500/702 variables, 202/415 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/702 variables, 72/487 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/702 variables, 1/488 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/702 variables, 0/488 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 3/705 variables, 3/491 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/705 variables, 3/494 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/705 variables, 1/495 constraints. Problems are: Problem set: 5 solved, 2 unsolved
[2024-06-02 19:30:14] [INFO ] Deduced a trap composed of 36 places in 59 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/705 variables, 1/496 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/705 variables, 0/496 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 1/706 variables, 1/497 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/706 variables, 0/497 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/706 variables, 0/497 constraints. Problems are: Problem set: 5 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 706/706 variables, and 497 constraints, problems are : Problem set: 5 solved, 2 unsolved in 1682 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: 2/7 constraints, Known Traps: 2/2 constraints]
After SMT, in 2906ms problems are : Problem set: 5 solved, 2 unsolved
Parikh walk visited 0 properties in 233 ms.
Support contains 52 out of 205 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 205/205 places, 539/539 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 536
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 3 place count 205 transition count 533
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 9 place count 202 transition count 533
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 15 place count 196 transition count 521
Iterating global reduction 1 with 6 rules applied. Total rules applied 21 place count 196 transition count 521
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 24 place count 196 transition count 518
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 26 place count 194 transition count 512
Iterating global reduction 2 with 2 rules applied. Total rules applied 28 place count 194 transition count 512
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 29 place count 193 transition count 510
Iterating global reduction 2 with 1 rules applied. Total rules applied 30 place count 193 transition count 510
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 31 place count 192 transition count 507
Iterating global reduction 2 with 1 rules applied. Total rules applied 32 place count 192 transition count 507
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 33 place count 191 transition count 505
Iterating global reduction 2 with 1 rules applied. Total rules applied 34 place count 191 transition count 505
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 35 place count 190 transition count 502
Iterating global reduction 2 with 1 rules applied. Total rules applied 36 place count 190 transition count 502
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 37 place count 189 transition count 500
Iterating global reduction 2 with 1 rules applied. Total rules applied 38 place count 189 transition count 500
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 39 place count 188 transition count 497
Iterating global reduction 2 with 1 rules applied. Total rules applied 40 place count 188 transition count 497
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 41 place count 187 transition count 495
Iterating global reduction 2 with 1 rules applied. Total rules applied 42 place count 187 transition count 495
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 43 place count 186 transition count 492
Iterating global reduction 2 with 1 rules applied. Total rules applied 44 place count 186 transition count 492
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 45 place count 185 transition count 490
Iterating global reduction 2 with 1 rules applied. Total rules applied 46 place count 185 transition count 490
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 47 place count 184 transition count 488
Iterating global reduction 2 with 1 rules applied. Total rules applied 48 place count 184 transition count 488
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 54 place count 181 transition count 485
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 56 place count 180 transition count 487
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 58 place count 180 transition count 485
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 3 with 7 rules applied. Total rules applied 65 place count 180 transition count 478
Applied a total of 65 rules in 146 ms. Remains 180 /205 variables (removed 25) and now considering 478/539 (removed 61) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 175 ms. Remains : 180/205 places, 478/539 transitions.
RANDOM walk for 40000 steps (1246 resets) in 446 ms. (89 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (269 resets) in 75 ms. (526 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (18 resets) in 168 ms. (236 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 672410 steps, run timeout after 3001 ms. (steps per millisecond=224 ) properties seen :0 out of 2
Probabilistic random walk after 672410 steps, saw 188491 distinct states, run finished after 3008 ms. (steps per millisecond=223 ) properties seen :0
[2024-06-02 19:30:18] [INFO ] Flow matrix only has 448 transitions (discarded 30 similar events)
// Phase 1: matrix 448 rows 180 cols
[2024-06-02 19:30:18] [INFO ] Computed 10 invariants in 5 ms
[2024-06-02 19:30:18] [INFO ] State equation strengthened by 68 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 122/174 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 3/177 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/177 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 448/625 variables, 177/187 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/625 variables, 68/255 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/625 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 3/628 variables, 3/258 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/628 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/628 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 628/628 variables, and 258 constraints, problems are : Problem set: 0 solved, 2 unsolved in 296 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 180/180 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 122/174 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-02 19:30:19] [INFO ] Deduced a trap composed of 43 places in 51 ms of which 1 ms to minimize.
[2024-06-02 19:30:19] [INFO ] Deduced a trap composed of 35 places in 35 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-02 19:30:19] [INFO ] Deduced a trap composed of 53 places in 44 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/174 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/174 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 3/177 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/177 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 448/625 variables, 177/190 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/625 variables, 68/258 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/625 variables, 1/259 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/625 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 3/628 variables, 3/262 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/628 variables, 1/263 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-02 19:30:19] [INFO ] Deduced a trap composed of 34 places in 36 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/628 variables, 1/264 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/628 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/628 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 628/628 variables, and 264 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1107 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 180/180 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 4/4 constraints]
After SMT, in 1461ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 255 ms.
Support contains 52 out of 180 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 180/180 places, 478/478 transitions.
Applied a total of 0 rules in 12 ms. Remains 180 /180 variables (removed 0) and now considering 478/478 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 180/180 places, 478/478 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 180/180 places, 478/478 transitions.
Applied a total of 0 rules in 10 ms. Remains 180 /180 variables (removed 0) and now considering 478/478 (removed 0) transitions.
[2024-06-02 19:30:20] [INFO ] Flow matrix only has 448 transitions (discarded 30 similar events)
[2024-06-02 19:30:20] [INFO ] Invariant cache hit.
[2024-06-02 19:30:20] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-06-02 19:30:20] [INFO ] Flow matrix only has 448 transitions (discarded 30 similar events)
[2024-06-02 19:30:20] [INFO ] Invariant cache hit.
[2024-06-02 19:30:20] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-06-02 19:30:20] [INFO ] Implicit Places using invariants and state equation in 315 ms returned [19, 68, 126]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 410 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 177/180 places, 478/478 transitions.
Applied a total of 0 rules in 9 ms. Remains 177 /177 variables (removed 0) and now considering 478/478 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 429 ms. Remains : 177/180 places, 478/478 transitions.
RANDOM walk for 40000 steps (1270 resets) in 147 ms. (270 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (270 resets) in 102 ms. (388 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (37 resets) in 126 ms. (314 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 629758 steps, run timeout after 3001 ms. (steps per millisecond=209 ) properties seen :0 out of 2
Probabilistic random walk after 629758 steps, saw 176526 distinct states, run finished after 3001 ms. (steps per millisecond=209 ) properties seen :0
[2024-06-02 19:30:24] [INFO ] Flow matrix only has 448 transitions (discarded 30 similar events)
// Phase 1: matrix 448 rows 177 cols
[2024-06-02 19:30:24] [INFO ] Computed 7 invariants in 7 ms
[2024-06-02 19:30:24] [INFO ] State equation strengthened by 68 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 116/168 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 3/171 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 445/616 variables, 171/178 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/616 variables, 68/246 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/616 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 9/625 variables, 6/252 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/625 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/625 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 625/625 variables, and 252 constraints, problems are : Problem set: 0 solved, 2 unsolved in 280 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 177/177 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 116/168 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-02 19:30:24] [INFO ] Deduced a trap composed of 42 places in 47 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/168 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 3/171 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-02 19:30:24] [INFO ] Deduced a trap composed of 34 places in 36 ms of which 1 ms to minimize.
[2024-06-02 19:30:24] [INFO ] Deduced a trap composed of 43 places in 36 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/171 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/171 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 445/616 variables, 171/181 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/616 variables, 68/249 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/616 variables, 1/250 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/616 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 9/625 variables, 6/256 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/625 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/625 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/625 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 625/625 variables, and 257 constraints, problems are : Problem set: 0 solved, 2 unsolved in 982 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 177/177 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints]
After SMT, in 1307ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 280 ms.
Support contains 52 out of 177 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 177/177 places, 478/478 transitions.
Applied a total of 0 rules in 8 ms. Remains 177 /177 variables (removed 0) and now considering 478/478 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 177/177 places, 478/478 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 177/177 places, 478/478 transitions.
Applied a total of 0 rules in 8 ms. Remains 177 /177 variables (removed 0) and now considering 478/478 (removed 0) transitions.
[2024-06-02 19:30:25] [INFO ] Flow matrix only has 448 transitions (discarded 30 similar events)
[2024-06-02 19:30:25] [INFO ] Invariant cache hit.
[2024-06-02 19:30:25] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-06-02 19:30:25] [INFO ] Flow matrix only has 448 transitions (discarded 30 similar events)
[2024-06-02 19:30:25] [INFO ] Invariant cache hit.
[2024-06-02 19:30:25] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-06-02 19:30:26] [INFO ] Implicit Places using invariants and state equation in 276 ms returned []
Implicit Place search using SMT with State Equation took 363 ms to find 0 implicit places.
[2024-06-02 19:30:26] [INFO ] Redundant transitions in 31 ms returned []
Running 477 sub problems to find dead transitions.
[2024-06-02 19:30:26] [INFO ] Flow matrix only has 448 transitions (discarded 30 similar events)
[2024-06-02 19:30:26] [INFO ] Invariant cache hit.
[2024-06-02 19:30:26] [INFO ] State equation strengthened by 68 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/176 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 1 (OVERLAPS) 1/177 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 477 unsolved
[2024-06-02 19:30:29] [INFO ] Deduced a trap composed of 64 places in 94 ms of which 1 ms to minimize.
[2024-06-02 19:30:29] [INFO ] Deduced a trap composed of 17 places in 95 ms of which 2 ms to minimize.
[2024-06-02 19:30:29] [INFO ] Deduced a trap composed of 35 places in 29 ms of which 1 ms to minimize.
[2024-06-02 19:30:29] [INFO ] Deduced a trap composed of 35 places in 39 ms of which 1 ms to minimize.
[2024-06-02 19:30:29] [INFO ] Deduced a trap composed of 24 places in 90 ms of which 1 ms to minimize.
[2024-06-02 19:30:31] [INFO ] Deduced a trap composed of 30 places in 90 ms of which 2 ms to minimize.
[2024-06-02 19:30:31] [INFO ] Deduced a trap composed of 34 places in 35 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/177 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/177 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 4 (OVERLAPS) 448/625 variables, 177/191 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/625 variables, 68/259 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/625 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 7 (OVERLAPS) 0/625 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 477 unsolved
No progress, stopping.
After SMT solving in domain Real declared 625/625 variables, and 259 constraints, problems are : Problem set: 0 solved, 477 unsolved in 21683 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 177/177 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 477/477 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 477 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/176 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 1 (OVERLAPS) 1/177 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/177 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/177 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 4 (OVERLAPS) 448/625 variables, 177/191 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/625 variables, 68/259 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/625 variables, 477/736 constraints. Problems are: Problem set: 0 solved, 477 unsolved
[2024-06-02 19:30:56] [INFO ] Deduced a trap composed of 53 places in 46 ms of which 1 ms to minimize.
[2024-06-02 19:31:00] [INFO ] Deduced a trap composed of 42 places in 40 ms of which 1 ms to minimize.
[2024-06-02 19:31:02] [INFO ] Deduced a trap composed of 42 places in 42 ms of which 1 ms to minimize.
[2024-06-02 19:31:03] [INFO ] Deduced a trap composed of 51 places in 42 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/625 variables, 4/740 constraints. Problems are: Problem set: 0 solved, 477 unsolved
[2024-06-02 19:31:08] [INFO ] Deduced a trap composed of 43 places in 37 ms of which 1 ms to minimize.
[2024-06-02 19:31:12] [INFO ] Deduced a trap composed of 43 places in 41 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/625 variables, 2/742 constraints. Problems are: Problem set: 0 solved, 477 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 625/625 variables, and 742 constraints, problems are : Problem set: 0 solved, 477 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 177/177 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 477/477 constraints, Known Traps: 13/13 constraints]
After SMT, in 52195ms problems are : Problem set: 0 solved, 477 unsolved
Search for dead transitions found 0 dead transitions in 52201ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52617 ms. Remains : 177/177 places, 478/478 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 55 edges and 177 vertex of which 5 / 177 are part of one of the 2 SCC in 2 ms
Free SCC test removed 3 places
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 38 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 25 transitions
Redundant transition composition rules discarded 25 transitions
Iterating global reduction 0 with 25 rules applied. Total rules applied 26 place count 174 transition count 415
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 173 transition count 414
Applied a total of 28 rules in 25 ms. Remains 173 /177 variables (removed 4) and now considering 414/478 (removed 64) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 414 rows 173 cols
[2024-06-02 19:31:18] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 19:31:18] [INFO ] After 120ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-02 19:31:18] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 19:31:18] [INFO ] After 243ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-06-02 19:31:18] [INFO ] Deduced a trap composed of 40 places in 61 ms of which 1 ms to minimize.
[2024-06-02 19:31:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 100 ms
[2024-06-02 19:31:19] [INFO ] Deduced a trap composed of 33 places in 38 ms of which 1 ms to minimize.
[2024-06-02 19:31:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 92 ms
TRAPS : Iteration 1
[2024-06-02 19:31:19] [INFO ] After 814ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-06-02 19:31:19] [INFO ] After 1032ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 1213 ms.
[2024-06-02 19:31:19] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 7 ms.
[2024-06-02 19:31:19] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 177 places, 478 transitions and 1798 arcs took 7 ms.
[2024-06-02 19:31:19] [INFO ] Flatten gal took : 66 ms
Total runtime 69367 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-14-ReachabilityFireability-2024-03
Could not compute solution for formula : FireWire-PT-14-ReachabilityFireability-2024-15
BK_STOP 1717356679979
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
mcc2024
rfs formula name FireWire-PT-14-ReachabilityFireability-2024-03
rfs formula type AG
rfs formula formula --invariant=/tmp/631/inv_0_
rfs formula name FireWire-PT-14-ReachabilityFireability-2024-15
rfs formula type AG
rfs formula formula --invariant=/tmp/631/inv_1_
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-14"
export BK_EXAMINATION="ReachabilityFireability"
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-14, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r553-tall-171734901300279"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FireWire-PT-14.tgz
mv FireWire-PT-14 execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;