About the Execution of LTSMin+red for SieveSingleMsgMbox-PT-d1m96
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 600.844 | 28095.00 | 54986.00 | 204.10 | FTTTTTTFTTFTF?FT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r532-smll-171683810700094.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 SieveSingleMsgMbox-PT-d1m96, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r532-smll-171683810700094
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 868K
-rw-r--r-- 1 mcc users 7.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 23 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 23 07:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 19:19 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.9K Apr 12 19:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 98K Apr 12 19:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Apr 12 19:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Apr 12 19:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 450K 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 SieveSingleMsgMbox-PT-d1m96-ReachabilityCardinality-2024-00
FORMULA_NAME SieveSingleMsgMbox-PT-d1m96-ReachabilityCardinality-2024-01
FORMULA_NAME SieveSingleMsgMbox-PT-d1m96-ReachabilityCardinality-2024-02
FORMULA_NAME SieveSingleMsgMbox-PT-d1m96-ReachabilityCardinality-2024-03
FORMULA_NAME SieveSingleMsgMbox-PT-d1m96-ReachabilityCardinality-2024-04
FORMULA_NAME SieveSingleMsgMbox-PT-d1m96-ReachabilityCardinality-2024-05
FORMULA_NAME SieveSingleMsgMbox-PT-d1m96-ReachabilityCardinality-2024-06
FORMULA_NAME SieveSingleMsgMbox-PT-d1m96-ReachabilityCardinality-2024-07
FORMULA_NAME SieveSingleMsgMbox-PT-d1m96-ReachabilityCardinality-2024-08
FORMULA_NAME SieveSingleMsgMbox-PT-d1m96-ReachabilityCardinality-2024-09
FORMULA_NAME SieveSingleMsgMbox-PT-d1m96-ReachabilityCardinality-2024-10
FORMULA_NAME SieveSingleMsgMbox-PT-d1m96-ReachabilityCardinality-2024-11
FORMULA_NAME SieveSingleMsgMbox-PT-d1m96-ReachabilityCardinality-2024-12
FORMULA_NAME SieveSingleMsgMbox-PT-d1m96-ReachabilityCardinality-2024-13
FORMULA_NAME SieveSingleMsgMbox-PT-d1m96-ReachabilityCardinality-2024-14
FORMULA_NAME SieveSingleMsgMbox-PT-d1m96-ReachabilityCardinality-2024-15
=== Now, execution of the tool begins
BK_START 1717246615992
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SieveSingleMsgMbox-PT-d1m96
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 12:56:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 12:56:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 12:56:58] [INFO ] Load time of PNML (sax parser for PT used): 342 ms
[2024-06-01 12:56:58] [INFO ] Transformed 1295 places.
[2024-06-01 12:56:58] [INFO ] Transformed 749 transitions.
[2024-06-01 12:56:58] [INFO ] Parsed PT model containing 1295 places and 749 transitions and 2996 arcs in 600 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 44 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 1036 places in 18 ms
Reduce places removed 1036 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d1m96-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m96-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m96-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m96-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m96-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m96-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m96-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m96-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m96-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m96-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m96-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m96-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m96-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8878 resets) in 4984 ms. (8 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (3931 resets) in 634 ms. (62 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (3815 resets) in 519 ms. (76 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (3840 resets) in 457 ms. (87 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 454681 steps, run timeout after 3001 ms. (steps per millisecond=151 ) properties seen :1 out of 3
Probabilistic random walk after 454681 steps, saw 209638 distinct states, run finished after 3009 ms. (steps per millisecond=151 ) properties seen :1
FORMULA SieveSingleMsgMbox-PT-d1m96-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 749 rows 259 cols
[2024-06-01 12:57:03] [INFO ] Computed 6 invariants in 34 ms
[2024-06-01 12:57:04] [INFO ] State equation strengthened by 587 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem SieveSingleMsgMbox-PT-d1m96-ReachabilityCardinality-2024-09 is UNSAT
FORMULA SieveSingleMsgMbox-PT-d1m96-ReachabilityCardinality-2024-09 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 92/94 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 34/128 variables, 2/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 131/259 variables, 3/6 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-06-01 12:57:04] [INFO ] Deduced a trap composed of 31 places in 384 ms of which 24 ms to minimize.
[2024-06-01 12:57:05] [INFO ] Deduced a trap composed of 35 places in 368 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/259 variables, 2/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/259 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 749/1008 variables, 259/267 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/1008 variables, 587/854 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1008 variables, 0/854 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1008 variables, 0/854 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1008/1008 variables, and 854 constraints, problems are : Problem set: 1 solved, 1 unsolved in 2132 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 259/259 constraints, ReadFeed: 587/587 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 81/82 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 80/162 variables, 3/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 97/259 variables, 2/6 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/259 variables, 2/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-06-01 12:57:06] [INFO ] Deduced a trap composed of 17 places in 312 ms of which 6 ms to minimize.
[2024-06-01 12:57:07] [INFO ] Deduced a trap composed of 128 places in 315 ms of which 5 ms to minimize.
[2024-06-01 12:57:07] [INFO ] Deduced a trap composed of 92 places in 149 ms of which 4 ms to minimize.
[2024-06-01 12:57:07] [INFO ] Deduced a trap composed of 86 places in 178 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/259 variables, 4/12 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/259 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 749/1008 variables, 259/271 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1008 variables, 587/858 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1008 variables, 1/859 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1008 variables, 0/859 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/1008 variables, 0/859 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1008/1008 variables, and 859 constraints, problems are : Problem set: 1 solved, 1 unsolved in 2056 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 259/259 constraints, ReadFeed: 587/587 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 6/6 constraints]
After SMT, in 4401ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 1808 ms.
Support contains 1 out of 259 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 259/259 places, 749/749 transitions.
Graph (complete) has 1159 edges and 259 vertex of which 241 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.4 ms
Discarding 18 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 242 transitions.
Iterating post reduction 0 with 242 rules applied. Total rules applied 243 place count 241 transition count 507
Discarding 61 places :
Symmetric choice reduction at 1 with 61 rule applications. Total rules 304 place count 180 transition count 230
Iterating global reduction 1 with 61 rules applied. Total rules applied 365 place count 180 transition count 230
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 371 place count 180 transition count 224
Discarding 45 places :
Symmetric choice reduction at 2 with 45 rule applications. Total rules 416 place count 135 transition count 179
Iterating global reduction 2 with 45 rules applied. Total rules applied 461 place count 135 transition count 179
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 477 place count 135 transition count 163
Discarding 27 places :
Symmetric choice reduction at 3 with 27 rule applications. Total rules 504 place count 108 transition count 134
Iterating global reduction 3 with 27 rules applied. Total rules applied 531 place count 108 transition count 134
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 3 with 16 rules applied. Total rules applied 547 place count 108 transition count 118
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 554 place count 101 transition count 108
Iterating global reduction 4 with 7 rules applied. Total rules applied 561 place count 101 transition count 108
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 568 place count 94 transition count 101
Iterating global reduction 4 with 7 rules applied. Total rules applied 575 place count 94 transition count 101
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 579 place count 90 transition count 96
Iterating global reduction 4 with 4 rules applied. Total rules applied 583 place count 90 transition count 96
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 584 place count 90 transition count 95
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 588 place count 86 transition count 91
Iterating global reduction 5 with 4 rules applied. Total rules applied 592 place count 86 transition count 91
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 595 place count 83 transition count 88
Iterating global reduction 5 with 3 rules applied. Total rules applied 598 place count 83 transition count 88
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 599 place count 82 transition count 86
Iterating global reduction 5 with 1 rules applied. Total rules applied 600 place count 82 transition count 86
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 601 place count 81 transition count 85
Iterating global reduction 5 with 1 rules applied. Total rules applied 602 place count 81 transition count 85
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 603 place count 80 transition count 84
Iterating global reduction 5 with 1 rules applied. Total rules applied 604 place count 80 transition count 84
Applied a total of 604 rules in 160 ms. Remains 80 /259 variables (removed 179) and now considering 84/749 (removed 665) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 179 ms. Remains : 80/259 places, 84/749 transitions.
RANDOM walk for 40000 steps (8885 resets) in 144 ms. (275 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (4226 resets) in 69 ms. (571 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2715621 steps, run timeout after 3001 ms. (steps per millisecond=904 ) properties seen :0 out of 1
Probabilistic random walk after 2715621 steps, saw 1316621 distinct states, run finished after 3001 ms. (steps per millisecond=904 ) properties seen :0
// Phase 1: matrix 84 rows 80 cols
[2024-06-01 12:57:13] [INFO ] Computed 4 invariants in 4 ms
[2024-06-01 12:57:13] [INFO ] State equation strengthened by 33 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 38/39 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/47 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/53 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/53 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 60/113 variables, 53/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/113 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 28/141 variables, 15/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/141 variables, 22/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/141 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 23/164 variables, 12/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/164 variables, 11/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/164 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/164 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 164/164 variables, and 117 constraints, problems are : Problem set: 0 solved, 1 unsolved in 169 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 80/80 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 38/39 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/47 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/53 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 12:57:13] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/53 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/53 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 60/113 variables, 53/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/113 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 28/141 variables, 15/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/141 variables, 22/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/141 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/141 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 23/164 variables, 12/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/164 variables, 11/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/164 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/164 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 164/164 variables, and 119 constraints, problems are : Problem set: 0 solved, 1 unsolved in 228 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 80/80 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 411ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 355 ms.
Support contains 1 out of 80 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 80/80 places, 84/84 transitions.
Applied a total of 0 rules in 9 ms. Remains 80 /80 variables (removed 0) and now considering 84/84 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 80/80 places, 84/84 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 80/80 places, 84/84 transitions.
Applied a total of 0 rules in 9 ms. Remains 80 /80 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2024-06-01 12:57:14] [INFO ] Invariant cache hit.
[2024-06-01 12:57:14] [INFO ] Implicit Places using invariants in 130 ms returned []
[2024-06-01 12:57:14] [INFO ] Invariant cache hit.
[2024-06-01 12:57:14] [INFO ] State equation strengthened by 33 read => feed constraints.
[2024-06-01 12:57:14] [INFO ] Implicit Places using invariants and state equation in 314 ms returned []
Implicit Place search using SMT with State Equation took 460 ms to find 0 implicit places.
[2024-06-01 12:57:14] [INFO ] Redundant transitions in 3 ms returned []
Running 83 sub problems to find dead transitions.
[2024-06-01 12:57:14] [INFO ] Invariant cache hit.
[2024-06-01 12:57:14] [INFO ] State equation strengthened by 33 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/79 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 3 (OVERLAPS) 1/80 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 5 (OVERLAPS) 84/164 variables, 80/84 constraints. Problems are: Problem set: 0 solved, 83 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/164 variables, 33/117 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/164 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 8 (OVERLAPS) 0/164 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 83 unsolved
No progress, stopping.
After SMT solving in domain Real declared 164/164 variables, and 117 constraints, problems are : Problem set: 0 solved, 83 unsolved in 3165 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 80/80 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 83 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/79 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 3 (OVERLAPS) 1/80 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 5 (OVERLAPS) 84/164 variables, 80/84 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/164 variables, 33/117 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/164 variables, 83/200 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/164 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 9 (OVERLAPS) 0/164 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 83 unsolved
No progress, stopping.
After SMT solving in domain Int declared 164/164 variables, and 200 constraints, problems are : Problem set: 0 solved, 83 unsolved in 5094 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 80/80 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 0/0 constraints]
After SMT, in 8485ms problems are : Problem set: 0 solved, 83 unsolved
Search for dead transitions found 0 dead transitions in 8492ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8977 ms. Remains : 80/80 places, 84/84 transitions.
Attempting over-approximation, by ignoring read arcs.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 80 transition count 77
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 12 place count 75 transition count 77
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 12 place count 75 transition count 64
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 38 place count 62 transition count 64
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 50 place count 56 transition count 58
Applied a total of 50 rules in 18 ms. Remains 56 /80 variables (removed 24) and now considering 58/84 (removed 26) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 58 rows 56 cols
[2024-06-01 12:57:23] [INFO ] Computed 6 invariants in 3 ms
[2024-06-01 12:57:23] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-01 12:57:23] [INFO ] [Real]Absence check using 4 positive and 2 generalized place invariants in 1 ms returned sat
[2024-06-01 12:57:23] [INFO ] After 31ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 12:57:23] [INFO ] After 50ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
[2024-06-01 12:57:23] [INFO ] After 102ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 135 ms.
[2024-06-01 12:57:23] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 7 ms.
[2024-06-01 12:57:23] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 80 places, 84 transitions and 334 arcs took 7 ms.
[2024-06-01 12:57:23] [INFO ] Flatten gal took : 53 ms
Total runtime 25511 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 : SieveSingleMsgMbox-PT-d1m96-ReachabilityCardinality-2024-13
BK_STOP 1717246644087
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
mcc2024
rfs formula name SieveSingleMsgMbox-PT-d1m96-ReachabilityCardinality-2024-13
rfs formula type EF
rfs formula formula --invariant=/tmp/559/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="SieveSingleMsgMbox-PT-d1m96"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is SieveSingleMsgMbox-PT-d1m96, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r532-smll-171683810700094"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/SieveSingleMsgMbox-PT-d1m96.tgz
mv SieveSingleMsgMbox-PT-d1m96 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;