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-171683810700087.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-d1m64, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r532-smll-171683810700087
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 840K
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 07:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 19 07:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 19:18 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.4K Apr 12 19:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 70K Apr 12 19:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 19:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 91K Apr 12 19:26 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-d1m64-ReachabilityFireability-2024-00
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-ReachabilityFireability-2024-01
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-ReachabilityFireability-2024-02
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-ReachabilityFireability-2024-03
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-ReachabilityFireability-2024-04
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-ReachabilityFireability-2024-05
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-ReachabilityFireability-2024-06
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-ReachabilityFireability-2024-07
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-ReachabilityFireability-2024-08
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-ReachabilityFireability-2024-09
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-ReachabilityFireability-2024-10
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-ReachabilityFireability-2024-11
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-ReachabilityFireability-2024-12
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-ReachabilityFireability-2024-13
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-ReachabilityFireability-2024-14
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717245269419

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SieveSingleMsgMbox-PT-d1m64
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 12:34:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 12:34:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 12:34:32] [INFO ] Load time of PNML (sax parser for PT used): 330 ms
[2024-06-01 12:34:32] [INFO ] Transformed 1295 places.
[2024-06-01 12:34:32] [INFO ] Transformed 749 transitions.
[2024-06-01 12:34:32] [INFO ] Parsed PT model containing 1295 places and 749 transitions and 2996 arcs in 583 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 39 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 1036 places in 24 ms
Reduce places removed 1036 places and 0 transitions.
RANDOM walk for 40000 steps (8841 resets) in 3916 ms. (10 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (172 resets) in 143 ms. (27 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (173 resets) in 55 ms. (71 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (180 resets) in 80 ms. (49 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (186 resets) in 73 ms. (54 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (183 resets) in 109 ms. (36 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (194 resets) in 97 ms. (40 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (234 resets) in 52 ms. (75 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (200 resets) in 38 ms. (102 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (187 resets) in 103 ms. (38 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (203 resets) in 37 ms. (105 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (193 resets) in 244 ms. (16 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (197 resets) in 84 ms. (47 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (417 resets) in 201 ms. (19 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (190 resets) in 44 ms. (88 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (179 resets) in 98 ms. (40 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (203 resets) in 34 ms. (114 steps per ms) remains 16/16 properties
Interrupted probabilistic random walk after 174959 steps, run timeout after 3001 ms. (steps per millisecond=58 ) properties seen :7 out of 16
Probabilistic random walk after 174959 steps, saw 80690 distinct states, run finished after 3015 ms. (steps per millisecond=58 ) properties seen :7
FORMULA SieveSingleMsgMbox-PT-d1m64-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA SieveSingleMsgMbox-PT-d1m64-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA SieveSingleMsgMbox-PT-d1m64-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA SieveSingleMsgMbox-PT-d1m64-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA SieveSingleMsgMbox-PT-d1m64-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA SieveSingleMsgMbox-PT-d1m64-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA SieveSingleMsgMbox-PT-d1m64-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 749 rows 259 cols
[2024-06-01 12:34:37] [INFO ] Computed 6 invariants in 53 ms
[2024-06-01 12:34:37] [INFO ] State equation strengthened by 587 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 97/175 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem SieveSingleMsgMbox-PT-d1m64-ReachabilityFireability-2024-02 is UNSAT
FORMULA SieveSingleMsgMbox-PT-d1m64-ReachabilityFireability-2024-02 FALSE TECHNIQUES SMT_REFINEMENT
Problem SieveSingleMsgMbox-PT-d1m64-ReachabilityFireability-2024-06 is UNSAT
FORMULA SieveSingleMsgMbox-PT-d1m64-ReachabilityFireability-2024-06 FALSE TECHNIQUES SMT_REFINEMENT
Problem SieveSingleMsgMbox-PT-d1m64-ReachabilityFireability-2024-08 is UNSAT
FORMULA SieveSingleMsgMbox-PT-d1m64-ReachabilityFireability-2024-08 TRUE TECHNIQUES SMT_REFINEMENT
Problem SieveSingleMsgMbox-PT-d1m64-ReachabilityFireability-2024-10 is UNSAT
FORMULA SieveSingleMsgMbox-PT-d1m64-ReachabilityFireability-2024-10 TRUE TECHNIQUES SMT_REFINEMENT
Problem SieveSingleMsgMbox-PT-d1m64-ReachabilityFireability-2024-11 is UNSAT
FORMULA SieveSingleMsgMbox-PT-d1m64-ReachabilityFireability-2024-11 TRUE TECHNIQUES SMT_REFINEMENT
Problem SieveSingleMsgMbox-PT-d1m64-ReachabilityFireability-2024-14 is UNSAT
FORMULA SieveSingleMsgMbox-PT-d1m64-ReachabilityFireability-2024-14 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (OVERLAPS) 84/259 variables, 3/6 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/259 variables, 0/6 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 749/1008 variables, 259/265 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1008 variables, 587/852 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1008 variables, 0/852 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/1008 variables, 0/852 constraints. Problems are: Problem set: 6 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1008/1008 variables, and 852 constraints, problems are : Problem set: 6 solved, 3 unsolved in 1604 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: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 6 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 114/138 variables, 2/2 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 0/2 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 7/145 variables, 1/3 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/145 variables, 0/3 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 114/259 variables, 3/6 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/259 variables, 0/6 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 749/1008 variables, 259/265 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1008 variables, 587/852 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1008 variables, 3/855 constraints. Problems are: Problem set: 6 solved, 3 unsolved
[2024-06-01 12:34:42] [INFO ] Deduced a trap composed of 29 places in 213 ms of which 42 ms to minimize.
[2024-06-01 12:34:42] [INFO ] Deduced a trap composed of 116 places in 166 ms of which 4 ms to minimize.
[2024-06-01 12:34:42] [INFO ] Deduced a trap composed of 95 places in 142 ms of which 3 ms to minimize.
[2024-06-01 12:34:43] [INFO ] Deduced a trap composed of 29 places in 88 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1008 variables, 4/859 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1008 variables, 0/859 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/1008 variables, 0/859 constraints. Problems are: Problem set: 6 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1008/1008 variables, and 859 constraints, problems are : Problem set: 6 solved, 3 unsolved in 4646 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: 3/9 constraints, Known Traps: 4/4 constraints]
After SMT, in 7089ms problems are : Problem set: 6 solved, 3 unsolved
Parikh walk visited 0 properties in 25768 ms.
Support contains 24 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.5 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 45 places :
Symmetric choice reduction at 1 with 45 rule applications. Total rules 288 place count 196 transition count 388
Iterating global reduction 1 with 45 rules applied. Total rules applied 333 place count 196 transition count 388
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 340 place count 196 transition count 381
Discarding 29 places :
Symmetric choice reduction at 2 with 29 rule applications. Total rules 369 place count 167 transition count 352
Iterating global reduction 2 with 29 rules applied. Total rules applied 398 place count 167 transition count 352
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 412 place count 167 transition count 338
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 426 place count 153 transition count 323
Iterating global reduction 3 with 14 rules applied. Total rules applied 440 place count 153 transition count 323
Ensure Unique test removed 39 transitions
Reduce isomorphic transitions removed 39 transitions.
Iterating post reduction 3 with 39 rules applied. Total rules applied 479 place count 153 transition count 284
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 484 place count 148 transition count 276
Iterating global reduction 4 with 5 rules applied. Total rules applied 489 place count 148 transition count 276
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 494 place count 143 transition count 271
Iterating global reduction 4 with 5 rules applied. Total rules applied 499 place count 143 transition count 271
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 501 place count 141 transition count 269
Iterating global reduction 4 with 2 rules applied. Total rules applied 503 place count 141 transition count 269
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 504 place count 140 transition count 268
Iterating global reduction 4 with 1 rules applied. Total rules applied 505 place count 140 transition count 268
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 506 place count 139 transition count 267
Iterating global reduction 4 with 1 rules applied. Total rules applied 507 place count 139 transition count 267
Applied a total of 507 rules in 172 ms. Remains 139 /259 variables (removed 120) and now considering 267/749 (removed 482) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 188 ms. Remains : 139/259 places, 267/749 transitions.
RANDOM walk for 40000 steps (8960 resets) in 230 ms. (173 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (1904 resets) in 148 ms. (268 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (1902 resets) in 172 ms. (231 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (1923 resets) in 168 ms. (236 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 462178 steps, run timeout after 3001 ms. (steps per millisecond=154 ) properties seen :0 out of 3
Probabilistic random walk after 462178 steps, saw 210914 distinct states, run finished after 3002 ms. (steps per millisecond=153 ) properties seen :0
// Phase 1: matrix 267 rows 139 cols
[2024-06-01 12:35:13] [INFO ] Computed 4 invariants in 4 ms
[2024-06-01 12:35:13] [INFO ] State equation strengthened by 169 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 66/90 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 9/99 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 253/352 variables, 99/103 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/352 variables, 155/258 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/352 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 54/406 variables, 40/298 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/406 variables, 14/312 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/406 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/406 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 406/406 variables, and 312 constraints, problems are : Problem set: 0 solved, 3 unsolved in 754 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 139/139 constraints, ReadFeed: 169/169 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 66/90 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 9/99 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 12:35:14] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 2 ms to minimize.
[2024-06-01 12:35:14] [INFO ] Deduced a trap composed of 40 places in 60 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/99 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 253/352 variables, 99/105 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/352 variables, 155/260 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/352 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 54/406 variables, 40/300 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/406 variables, 14/314 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/406 variables, 3/317 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 12:35:15] [INFO ] Deduced a trap composed of 41 places in 99 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/406 variables, 1/318 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/406 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/406 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 406/406 variables, and 318 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1823 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 139/139 constraints, ReadFeed: 169/169 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 3/3 constraints]
After SMT, in 2629ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 11245 ms.
Support contains 24 out of 139 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 139/139 places, 267/267 transitions.
Applied a total of 0 rules in 18 ms. Remains 139 /139 variables (removed 0) and now considering 267/267 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 139/139 places, 267/267 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 139/139 places, 267/267 transitions.
Applied a total of 0 rules in 16 ms. Remains 139 /139 variables (removed 0) and now considering 267/267 (removed 0) transitions.
[2024-06-01 12:35:27] [INFO ] Invariant cache hit.
[2024-06-01 12:35:27] [INFO ] Implicit Places using invariants in 150 ms returned []
[2024-06-01 12:35:27] [INFO ] Invariant cache hit.
[2024-06-01 12:35:28] [INFO ] State equation strengthened by 169 read => feed constraints.
[2024-06-01 12:35:28] [INFO ] Implicit Places using invariants and state equation in 743 ms returned []
Implicit Place search using SMT with State Equation took 910 ms to find 0 implicit places.
[2024-06-01 12:35:28] [INFO ] Redundant transitions in 28 ms returned []
Running 266 sub problems to find dead transitions.
[2024-06-01 12:35:28] [INFO ] Invariant cache hit.
[2024-06-01 12:35:28] [INFO ] State equation strengthened by 169 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 3 (OVERLAPS) 1/139 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/139 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 5 (OVERLAPS) 267/406 variables, 139/143 constraints. Problems are: Problem set: 0 solved, 266 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/406 variables, 169/312 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/406 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 8 (OVERLAPS) 0/406 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 266 unsolved
No progress, stopping.
After SMT solving in domain Real declared 406/406 variables, and 312 constraints, problems are : Problem set: 0 solved, 266 unsolved in 16981 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 139/139 constraints, ReadFeed: 169/169 constraints, PredecessorRefiner: 266/266 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 266 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 3 (OVERLAPS) 1/139 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/139 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 5 (OVERLAPS) 267/406 variables, 139/143 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/406 variables, 169/312 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/406 variables, 266/578 constraints. Problems are: Problem set: 0 solved, 266 unsolved
[2024-06-01 12:35:57] [INFO ] Deduced a trap composed of 41 places in 43 ms of which 1 ms to minimize.
[2024-06-01 12:35:58] [INFO ] Deduced a trap composed of 54 places in 57 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/406 variables, 2/580 constraints. Problems are: Problem set: 0 solved, 266 unsolved
[2024-06-01 12:36:08] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/406 variables, 1/581 constraints. Problems are: Problem set: 0 solved, 266 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 406/406 variables, and 581 constraints, problems are : Problem set: 0 solved, 266 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 139/139 constraints, ReadFeed: 169/169 constraints, PredecessorRefiner: 266/266 constraints, Known Traps: 3/3 constraints]
After SMT, in 47837ms problems are : Problem set: 0 solved, 266 unsolved
Search for dead transitions found 0 dead transitions in 47849ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48817 ms. Remains : 139/139 places, 267/267 transitions.
Attempting over-approximation, by ignoring read arcs.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 139 transition count 263
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 136 transition count 263
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 7 place count 136 transition count 249
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 35 place count 122 transition count 249
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 57 place count 111 transition count 238
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 59 place count 110 transition count 238
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 61 place count 110 transition count 236
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 63 place count 108 transition count 236
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 64 place count 108 transition count 235
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 65 place count 107 transition count 235
Applied a total of 65 rules in 69 ms. Remains 107 /139 variables (removed 32) and now considering 235/267 (removed 32) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 235 rows 107 cols
[2024-06-01 12:36:16] [INFO ] Computed 4 invariants in 4 ms
[2024-06-01 12:36:16] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-06-01 12:36:16] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 3 ms returned sat
[2024-06-01 12:36:17] [INFO ] After 506ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-06-01 12:36:17] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-06-01 12:36:17] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 3 ms returned sat
[2024-06-01 12:36:17] [INFO ] After 341ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2024-06-01 12:36:17] [INFO ] Deduced a trap composed of 28 places in 53 ms of which 2 ms to minimize.
[2024-06-01 12:36:17] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 1 ms to minimize.
[2024-06-01 12:36:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 162 ms
TRAPS : Iteration 1
[2024-06-01 12:36:18] [INFO ] After 849ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2024-06-01 12:36:18] [INFO ] After 1065ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Over-approximation ignoring read arcs solved 0 properties in 1689 ms.
[2024-06-01 12:36:18] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 6 ms.
[2024-06-01 12:36:18] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 139 places, 267 transitions and 1055 arcs took 8 ms.
[2024-06-01 12:36:18] [INFO ] Flatten gal took : 76 ms
Total runtime 106609 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : SieveSingleMsgMbox-PT-d1m64-ReachabilityFireability-2024-00
Could not compute solution for formula : SieveSingleMsgMbox-PT-d1m64-ReachabilityFireability-2024-01
Could not compute solution for formula : SieveSingleMsgMbox-PT-d1m64-ReachabilityFireability-2024-09

BK_STOP 1717245378941

--------------------
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 SieveSingleMsgMbox-PT-d1m64-ReachabilityFireability-2024-00
rfs formula type EF
rfs formula formula --invariant=/tmp/588/inv_0_
rfs formula name SieveSingleMsgMbox-PT-d1m64-ReachabilityFireability-2024-01
rfs formula type EF
rfs formula formula --invariant=/tmp/588/inv_1_
rfs formula name SieveSingleMsgMbox-PT-d1m64-ReachabilityFireability-2024-09
rfs formula type EF
rfs formula formula --invariant=/tmp/588/inv_2_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="SieveSingleMsgMbox-PT-d1m64"
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 SieveSingleMsgMbox-PT-d1m64, 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 r532-smll-171683810700087"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SieveSingleMsgMbox-PT-d1m64.tgz
mv SieveSingleMsgMbox-PT-d1m64 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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;