About the Execution of LTSMin+red for NoC3x3-PT-6A
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1519.896 | 77068.00 | 104276.00 | 258.60 | TTTTTTTTTT?FTFTT | 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.r508-tall-171654352100639.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 NoC3x3-PT-6A, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r508-tall-171654352100639
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 784K
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 19 07:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 19 16:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 173K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Apr 12 07:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Apr 12 07:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.4K May 19 07:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 19 15:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 297K May 18 16:43 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 NoC3x3-PT-6A-ReachabilityFireability-2024-00
FORMULA_NAME NoC3x3-PT-6A-ReachabilityFireability-2024-01
FORMULA_NAME NoC3x3-PT-6A-ReachabilityFireability-2024-02
FORMULA_NAME NoC3x3-PT-6A-ReachabilityFireability-2024-03
FORMULA_NAME NoC3x3-PT-6A-ReachabilityFireability-2024-04
FORMULA_NAME NoC3x3-PT-6A-ReachabilityFireability-2024-05
FORMULA_NAME NoC3x3-PT-6A-ReachabilityFireability-2024-06
FORMULA_NAME NoC3x3-PT-6A-ReachabilityFireability-2024-07
FORMULA_NAME NoC3x3-PT-6A-ReachabilityFireability-2024-08
FORMULA_NAME NoC3x3-PT-6A-ReachabilityFireability-2024-09
FORMULA_NAME NoC3x3-PT-6A-ReachabilityFireability-2024-10
FORMULA_NAME NoC3x3-PT-6A-ReachabilityFireability-2024-11
FORMULA_NAME NoC3x3-PT-6A-ReachabilityFireability-2024-12
FORMULA_NAME NoC3x3-PT-6A-ReachabilityFireability-2024-13
FORMULA_NAME NoC3x3-PT-6A-ReachabilityFireability-2024-14
FORMULA_NAME NoC3x3-PT-6A-ReachabilityFireability-2024-15
=== Now, execution of the tool begins
BK_START 1717243308946
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NoC3x3-PT-6A
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 12:01:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 12:01:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 12:01:50] [INFO ] Load time of PNML (sax parser for PT used): 110 ms
[2024-06-01 12:01:50] [INFO ] Transformed 512 places.
[2024-06-01 12:01:50] [INFO ] Transformed 1117 transitions.
[2024-06-01 12:01:50] [INFO ] Found NUPN structural information;
[2024-06-01 12:01:50] [INFO ] Parsed PT model containing 512 places and 1117 transitions and 4279 arcs in 234 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 20 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (104 resets) in 1844 ms. (21 steps per ms) remains 2/16 properties
FORMULA NoC3x3-PT-6A-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-6A-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-6A-ReachabilityFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-6A-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-6A-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-6A-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-6A-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-6A-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-6A-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-6A-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-6A-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-6A-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-6A-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-6A-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 443 ms. (90 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 368 ms. (108 steps per ms) remains 2/2 properties
[2024-06-01 12:01:51] [INFO ] Flow matrix only has 1075 transitions (discarded 42 similar events)
// Phase 1: matrix 1075 rows 512 cols
[2024-06-01 12:01:51] [INFO ] Computed 66 invariants in 23 ms
[2024-06-01 12:01:51] [INFO ] State equation strengthened by 41 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 69/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/69 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem NoC3x3-PT-6A-ReachabilityFireability-2024-11 is UNSAT
FORMULA NoC3x3-PT-6A-ReachabilityFireability-2024-11 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 311/380 variables, 39/108 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/380 variables, 311/419 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/380 variables, 0/419 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 132/512 variables, 27/446 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/512 variables, 132/578 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/512 variables, 0/578 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1075/1587 variables, 512/1090 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1587 variables, 41/1131 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1587 variables, 0/1131 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1587 variables, 0/1131 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1587/1587 variables, and 1131 constraints, problems are : Problem set: 1 solved, 1 unsolved in 572 ms.
Refiners :[Domain max(s): 512/512 constraints, Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 512/512 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 46/46 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 0/46 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 281/327 variables, 33/79 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/327 variables, 281/360 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/327 variables, 0/360 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 185/512 variables, 33/393 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/512 variables, 185/578 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/512 variables, 0/578 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1075/1587 variables, 512/1090 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1587 variables, 41/1131 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1587 variables, 1/1132 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1587 variables, 0/1132 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/1587 variables, 0/1132 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1587/1587 variables, and 1132 constraints, problems are : Problem set: 1 solved, 1 unsolved in 1042 ms.
Refiners :[Domain max(s): 512/512 constraints, Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 512/512 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 1778ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 180 ms.
Support contains 46 out of 512 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 512/512 places, 1117/1117 transitions.
Discarding 70 places :
Symmetric choice reduction at 0 with 70 rule applications. Total rules 70 place count 442 transition count 840
Iterating global reduction 0 with 70 rules applied. Total rules applied 140 place count 442 transition count 840
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -25
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 146 place count 439 transition count 865
Free-agglomeration rule applied 15 times.
Iterating global reduction 0 with 15 rules applied. Total rules applied 161 place count 439 transition count 850
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 176 place count 424 transition count 850
Applied a total of 176 rules in 134 ms. Remains 424 /512 variables (removed 88) and now considering 850/1117 (removed 267) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 145 ms. Remains : 424/512 places, 850/1117 transitions.
RANDOM walk for 40000 steps (11 resets) in 696 ms. (57 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 154 ms. (258 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 573906 steps, run timeout after 3001 ms. (steps per millisecond=191 ) properties seen :0 out of 1
Probabilistic random walk after 573906 steps, saw 401955 distinct states, run finished after 3005 ms. (steps per millisecond=190 ) properties seen :0
[2024-06-01 12:01:56] [INFO ] Flow matrix only has 839 transitions (discarded 11 similar events)
// Phase 1: matrix 839 rows 424 cols
[2024-06-01 12:01:56] [INFO ] Computed 66 invariants in 4 ms
[2024-06-01 12:01:56] [INFO ] State equation strengthened by 41 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 226/272 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/272 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 152/424 variables, 33/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/424 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 839/1263 variables, 424/490 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1263 variables, 41/531 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1263 variables, 0/531 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/1263 variables, 0/531 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1263/1263 variables, and 531 constraints, problems are : Problem set: 0 solved, 1 unsolved in 305 ms.
Refiners :[Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 424/424 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 226/272 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/272 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 152/424 variables, 33/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/424 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 839/1263 variables, 424/490 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1263 variables, 41/531 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1263 variables, 1/532 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1263 variables, 0/532 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/1263 variables, 0/532 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1263/1263 variables, and 532 constraints, problems are : Problem set: 0 solved, 1 unsolved in 881 ms.
Refiners :[Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 424/424 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1233ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 102 ms.
Support contains 46 out of 424 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 424/424 places, 850/850 transitions.
Applied a total of 0 rules in 25 ms. Remains 424 /424 variables (removed 0) and now considering 850/850 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 424/424 places, 850/850 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 424/424 places, 850/850 transitions.
Applied a total of 0 rules in 20 ms. Remains 424 /424 variables (removed 0) and now considering 850/850 (removed 0) transitions.
[2024-06-01 12:01:57] [INFO ] Flow matrix only has 839 transitions (discarded 11 similar events)
[2024-06-01 12:01:57] [INFO ] Invariant cache hit.
[2024-06-01 12:01:58] [INFO ] Implicit Places using invariants in 212 ms returned [10, 44, 88, 127, 188, 270, 324, 360, 407]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 219 ms to find 9 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 415/424 places, 850/850 transitions.
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 0 with 34 rules applied. Total rules applied 34 place count 398 transition count 833
Applied a total of 34 rules in 36 ms. Remains 398 /415 variables (removed 17) and now considering 833/850 (removed 17) transitions.
[2024-06-01 12:01:58] [INFO ] Flow matrix only has 822 transitions (discarded 11 similar events)
// Phase 1: matrix 822 rows 398 cols
[2024-06-01 12:01:58] [INFO ] Computed 57 invariants in 4 ms
[2024-06-01 12:01:58] [INFO ] Implicit Places using invariants in 166 ms returned []
[2024-06-01 12:01:58] [INFO ] Flow matrix only has 822 transitions (discarded 11 similar events)
[2024-06-01 12:01:58] [INFO ] Invariant cache hit.
[2024-06-01 12:01:58] [INFO ] State equation strengthened by 34 read => feed constraints.
[2024-06-01 12:01:58] [INFO ] Implicit Places using invariants and state equation in 432 ms returned []
Implicit Place search using SMT with State Equation took 598 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 398/424 places, 833/850 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 875 ms. Remains : 398/424 places, 833/850 transitions.
RANDOM walk for 40000 steps (10 resets) in 140 ms. (283 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 140 ms. (283 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 613764 steps, run timeout after 3001 ms. (steps per millisecond=204 ) properties seen :0 out of 1
Probabilistic random walk after 613764 steps, saw 387690 distinct states, run finished after 3004 ms. (steps per millisecond=204 ) properties seen :0
[2024-06-01 12:02:01] [INFO ] Flow matrix only has 822 transitions (discarded 11 similar events)
[2024-06-01 12:02:01] [INFO ] Invariant cache hit.
[2024-06-01 12:02:01] [INFO ] State equation strengthened by 34 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 219/265 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/265 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 133/398 variables, 24/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/398 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 822/1220 variables, 398/455 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1220 variables, 34/489 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1220 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/1220 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1220/1220 variables, and 489 constraints, problems are : Problem set: 0 solved, 1 unsolved in 277 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 398/398 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 219/265 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/265 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 133/398 variables, 24/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/398 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 822/1220 variables, 398/455 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1220 variables, 34/489 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1220 variables, 1/490 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1220 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/1220 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1220/1220 variables, and 490 constraints, problems are : Problem set: 0 solved, 1 unsolved in 936 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 398/398 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1252ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 163 ms.
Support contains 46 out of 398 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 398/398 places, 833/833 transitions.
Applied a total of 0 rules in 17 ms. Remains 398 /398 variables (removed 0) and now considering 833/833 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 398/398 places, 833/833 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 398/398 places, 833/833 transitions.
Applied a total of 0 rules in 17 ms. Remains 398 /398 variables (removed 0) and now considering 833/833 (removed 0) transitions.
[2024-06-01 12:02:03] [INFO ] Flow matrix only has 822 transitions (discarded 11 similar events)
[2024-06-01 12:02:03] [INFO ] Invariant cache hit.
[2024-06-01 12:02:03] [INFO ] Implicit Places using invariants in 156 ms returned []
[2024-06-01 12:02:03] [INFO ] Flow matrix only has 822 transitions (discarded 11 similar events)
[2024-06-01 12:02:03] [INFO ] Invariant cache hit.
[2024-06-01 12:02:03] [INFO ] State equation strengthened by 34 read => feed constraints.
[2024-06-01 12:02:03] [INFO ] Implicit Places using invariants and state equation in 451 ms returned []
Implicit Place search using SMT with State Equation took 610 ms to find 0 implicit places.
[2024-06-01 12:02:04] [INFO ] Redundant transitions in 46 ms returned []
Running 825 sub problems to find dead transitions.
[2024-06-01 12:02:04] [INFO ] Flow matrix only has 822 transitions (discarded 11 similar events)
[2024-06-01 12:02:04] [INFO ] Invariant cache hit.
[2024-06-01 12:02:04] [INFO ] State equation strengthened by 34 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/397 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 825 unsolved
At refinement iteration 1 (OVERLAPS) 1/398 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 825 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/398 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 825 unsolved
At refinement iteration 3 (OVERLAPS) 822/1220 variables, 398/455 constraints. Problems are: Problem set: 0 solved, 825 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1220 variables, 34/489 constraints. Problems are: Problem set: 0 solved, 825 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1220/1220 variables, and 489 constraints, problems are : Problem set: 0 solved, 825 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 398/398 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 825/825 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 825 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/397 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 825 unsolved
At refinement iteration 1 (OVERLAPS) 1/398 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 825 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/398 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 825 unsolved
At refinement iteration 3 (OVERLAPS) 822/1220 variables, 398/455 constraints. Problems are: Problem set: 0 solved, 825 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1220 variables, 34/489 constraints. Problems are: Problem set: 0 solved, 825 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1220 variables, 825/1314 constraints. Problems are: Problem set: 0 solved, 825 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1220/1220 variables, and 1314 constraints, problems are : Problem set: 0 solved, 825 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 398/398 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 825/825 constraints, Known Traps: 0/0 constraints]
After SMT, in 60541ms problems are : Problem set: 0 solved, 825 unsolved
Search for dead transitions found 0 dead transitions in 60553ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61247 ms. Remains : 398/398 places, 833/833 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 398 transition count 822
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 15 place count 398 transition count 822
Applied a total of 15 rules in 35 ms. Remains 398 /398 variables (removed 0) and now considering 822/833 (removed 11) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 822 rows 398 cols
[2024-06-01 12:03:04] [INFO ] Computed 57 invariants in 8 ms
[2024-06-01 12:03:04] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 12:03:04] [INFO ] [Nat]Absence check using 57 positive place invariants in 9 ms returned sat
[2024-06-01 12:03:05] [INFO ] After 294ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 12:03:05] [INFO ] After 488ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 12:03:05] [INFO ] After 730ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 869 ms.
[2024-06-01 12:03:05] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 6 ms.
[2024-06-01 12:03:05] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 398 places, 833 transitions and 3572 arcs took 11 ms.
[2024-06-01 12:03:05] [INFO ] Flatten gal took : 111 ms
Total runtime 75795 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 : NoC3x3-PT-6A-ReachabilityFireability-2024-10
BK_STOP 1717243386014
--------------------
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 ReachabilityFireability -timeout 360 -rebuildPNML
mcc2024
rfs formula name NoC3x3-PT-6A-ReachabilityFireability-2024-10
rfs formula type AG
rfs formula formula --invariant=/tmp/562/inv_0_
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="NoC3x3-PT-6A"
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 NoC3x3-PT-6A, 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 r508-tall-171654352100639"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/NoC3x3-PT-6A.tgz
mv NoC3x3-PT-6A 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 ;