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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 828K
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K 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.5K Apr 23 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K 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 16K May 19 19:18 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Apr 12 19:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 98K Apr 12 19:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Apr 12 19:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Apr 12 19:22 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-d1m36-ReachabilityFireability-2024-00
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-ReachabilityFireability-2024-01
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-ReachabilityFireability-2024-02
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-ReachabilityFireability-2024-03
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-ReachabilityFireability-2024-04
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-ReachabilityFireability-2024-05
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-ReachabilityFireability-2024-06
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-ReachabilityFireability-2024-07
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-ReachabilityFireability-2024-08
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-ReachabilityFireability-2024-09
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-ReachabilityFireability-2024-10
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-ReachabilityFireability-2024-11
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-ReachabilityFireability-2024-12
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-ReachabilityFireability-2024-13
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-ReachabilityFireability-2024-14
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717244476777

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-d1m36
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 12:21:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 12:21:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 12:21:20] [INFO ] Load time of PNML (sax parser for PT used): 358 ms
[2024-06-01 12:21:20] [INFO ] Transformed 1295 places.
[2024-06-01 12:21:20] [INFO ] Transformed 749 transitions.
[2024-06-01 12:21:20] [INFO ] Parsed PT model containing 1295 places and 749 transitions and 2996 arcs in 755 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 34 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 1036 places in 22 ms
Reduce places removed 1036 places and 0 transitions.
RANDOM walk for 40000 steps (8894 resets) in 4232 ms. (9 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (184 resets) in 86 ms. (46 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (179 resets) in 96 ms. (41 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (171 resets) in 217 ms. (18 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (183 resets) in 63 ms. (62 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (189 resets) in 52 ms. (75 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (168 resets) in 48 ms. (81 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (172 resets) in 51 ms. (76 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (187 resets) in 30 ms. (129 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (174 resets) in 35 ms. (111 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (181 resets) in 81 ms. (48 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (182 resets) in 81 ms. (48 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (182 resets) in 65 ms. (60 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (188 resets) in 47 ms. (83 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (200 resets) in 84 ms. (47 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (190 resets) in 29 ms. (133 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (173 resets) in 59 ms. (66 steps per ms) remains 16/16 properties
Interrupted probabilistic random walk after 236132 steps, run timeout after 3001 ms. (steps per millisecond=78 ) properties seen :8 out of 16
Probabilistic random walk after 236132 steps, saw 107938 distinct states, run finished after 3015 ms. (steps per millisecond=78 ) properties seen :8
FORMULA SieveSingleMsgMbox-PT-d1m36-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA SieveSingleMsgMbox-PT-d1m36-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA SieveSingleMsgMbox-PT-d1m36-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA SieveSingleMsgMbox-PT-d1m36-ReachabilityFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA SieveSingleMsgMbox-PT-d1m36-ReachabilityFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA SieveSingleMsgMbox-PT-d1m36-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA SieveSingleMsgMbox-PT-d1m36-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA SieveSingleMsgMbox-PT-d1m36-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 749 rows 259 cols
[2024-06-01 12:21:25] [INFO ] Computed 6 invariants in 49 ms
[2024-06-01 12:21:25] [INFO ] State equation strengthened by 587 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 103/170 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem SieveSingleMsgMbox-PT-d1m36-ReachabilityFireability-2024-02 is UNSAT
FORMULA SieveSingleMsgMbox-PT-d1m36-ReachabilityFireability-2024-02 FALSE TECHNIQUES SMT_REFINEMENT
Problem SieveSingleMsgMbox-PT-d1m36-ReachabilityFireability-2024-07 is UNSAT
FORMULA SieveSingleMsgMbox-PT-d1m36-ReachabilityFireability-2024-07 FALSE TECHNIQUES SMT_REFINEMENT
Problem SieveSingleMsgMbox-PT-d1m36-ReachabilityFireability-2024-15 is UNSAT
FORMULA SieveSingleMsgMbox-PT-d1m36-ReachabilityFireability-2024-15 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (OVERLAPS) 89/259 variables, 3/6 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/259 variables, 0/6 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 749/1008 variables, 259/265 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1008 variables, 587/852 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1008 variables, 0/852 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 0/1008 variables, 0/852 constraints. Problems are: Problem set: 3 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1008/1008 variables, and 852 constraints, problems are : Problem set: 3 solved, 5 unsolved in 2298 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: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 114/151 variables, 3/3 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 108/259 variables, 3/6 constraints. Problems are: Problem set: 3 solved, 5 unsolved
[2024-06-01 12:21:29] [INFO ] Deduced a trap composed of 67 places in 201 ms of which 40 ms to minimize.
[2024-06-01 12:21:29] [INFO ] Deduced a trap composed of 29 places in 156 ms of which 4 ms to minimize.
[2024-06-01 12:21:29] [INFO ] Deduced a trap composed of 95 places in 135 ms of which 3 ms to minimize.
[2024-06-01 12:21:29] [INFO ] Deduced a trap composed of 29 places in 79 ms of which 2 ms to minimize.
[2024-06-01 12:21:29] [INFO ] Deduced a trap composed of 29 places in 362 ms of which 6 ms to minimize.
[2024-06-01 12:21:30] [INFO ] Deduced a trap composed of 89 places in 264 ms of which 4 ms to minimize.
[2024-06-01 12:21:30] [INFO ] Deduced a trap composed of 150 places in 231 ms of which 3 ms to minimize.
[2024-06-01 12:21:30] [INFO ] Deduced a trap composed of 129 places in 181 ms of which 4 ms to minimize.
[2024-06-01 12:21:30] [INFO ] Deduced a trap composed of 150 places in 179 ms of which 3 ms to minimize.
[2024-06-01 12:21:31] [INFO ] Deduced a trap composed of 141 places in 210 ms of which 3 ms to minimize.
[2024-06-01 12:21:31] [INFO ] Deduced a trap composed of 153 places in 194 ms of which 3 ms to minimize.
[2024-06-01 12:21:31] [INFO ] Deduced a trap composed of 164 places in 185 ms of which 4 ms to minimize.
[2024-06-01 12:21:31] [INFO ] Deduced a trap composed of 157 places in 279 ms of which 4 ms to minimize.
[2024-06-01 12:21:32] [INFO ] Deduced a trap composed of 157 places in 266 ms of which 3 ms to minimize.
Problem SieveSingleMsgMbox-PT-d1m36-ReachabilityFireability-2024-06 is UNSAT
FORMULA SieveSingleMsgMbox-PT-d1m36-ReachabilityFireability-2024-06 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 4 (INCLUDED_ONLY) 0/259 variables, 14/20 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/259 variables, 0/20 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 749/1008 variables, 259/279 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1008 variables, 587/866 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1008 variables, 4/870 constraints. Problems are: Problem set: 4 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1008/1008 variables, and 870 constraints, problems are : Problem set: 4 solved, 4 unsolved in 5018 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: 4/8 constraints, Known Traps: 14/14 constraints]
After SMT, in 8078ms problems are : Problem set: 4 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 36 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 242 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.7 ms
Discarding 17 places :
Also discarding 0 output transitions
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 240 transitions.
Iterating post reduction 0 with 240 rules applied. Total rules applied 241 place count 242 transition count 509
Discarding 43 places :
Symmetric choice reduction at 1 with 43 rule applications. Total rules 284 place count 199 transition count 403
Iterating global reduction 1 with 43 rules applied. Total rules applied 327 place count 199 transition count 403
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 336 place count 199 transition count 394
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 360 place count 175 transition count 370
Iterating global reduction 2 with 24 rules applied. Total rules applied 384 place count 175 transition count 370
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 393 place count 175 transition count 361
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 406 place count 162 transition count 347
Iterating global reduction 3 with 13 rules applied. Total rules applied 419 place count 162 transition count 347
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 3 with 31 rules applied. Total rules applied 450 place count 162 transition count 316
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 452 place count 160 transition count 314
Iterating global reduction 4 with 2 rules applied. Total rules applied 454 place count 160 transition count 314
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 455 place count 159 transition count 313
Iterating global reduction 4 with 1 rules applied. Total rules applied 456 place count 159 transition count 313
Applied a total of 456 rules in 263 ms. Remains 159 /259 variables (removed 100) and now considering 313/749 (removed 436) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 286 ms. Remains : 159/259 places, 313/749 transitions.
RANDOM walk for 40000 steps (8928 resets) in 571 ms. (69 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (1836 resets) in 280 ms. (142 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (1986 resets) in 416 ms. (95 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (1889 resets) in 267 ms. (149 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (1892 resets) in 239 ms. (166 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 364566 steps, run timeout after 3001 ms. (steps per millisecond=121 ) properties seen :0 out of 4
Probabilistic random walk after 364566 steps, saw 168489 distinct states, run finished after 3005 ms. (steps per millisecond=121 ) properties seen :0
// Phase 1: matrix 313 rows 159 cols
[2024-06-01 12:21:37] [INFO ] Computed 5 invariants in 10 ms
[2024-06-01 12:21:37] [INFO ] State equation strengthened by 201 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 68/104 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 37/141 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 297/438 variables, 141/146 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/438 variables, 185/331 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/438 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 34/472 variables, 18/349 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/472 variables, 16/365 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/472 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 0/472 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 472/472 variables, and 365 constraints, problems are : Problem set: 0 solved, 4 unsolved in 759 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 159/159 constraints, ReadFeed: 201/201 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 68/104 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 37/141 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 297/438 variables, 141/146 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/438 variables, 185/331 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/438 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 34/472 variables, 18/349 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/472 variables, 16/365 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/472 variables, 4/369 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 12:21:39] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/472 variables, 1/370 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/472 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/472 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 472/472 variables, and 370 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2400 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 159/159 constraints, ReadFeed: 201/201 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints]
After SMT, in 3255ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 12206 ms.
Support contains 36 out of 159 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 159/159 places, 313/313 transitions.
Applied a total of 0 rules in 37 ms. Remains 159 /159 variables (removed 0) and now considering 313/313 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 159/159 places, 313/313 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 159/159 places, 313/313 transitions.
Applied a total of 0 rules in 20 ms. Remains 159 /159 variables (removed 0) and now considering 313/313 (removed 0) transitions.
[2024-06-01 12:21:53] [INFO ] Invariant cache hit.
[2024-06-01 12:21:53] [INFO ] Implicit Places using invariants in 138 ms returned []
[2024-06-01 12:21:53] [INFO ] Invariant cache hit.
[2024-06-01 12:21:53] [INFO ] State equation strengthened by 201 read => feed constraints.
[2024-06-01 12:21:54] [INFO ] Implicit Places using invariants and state equation in 982 ms returned []
Implicit Place search using SMT with State Equation took 1141 ms to find 0 implicit places.
[2024-06-01 12:21:54] [INFO ] Redundant transitions in 29 ms returned []
Running 312 sub problems to find dead transitions.
[2024-06-01 12:21:54] [INFO ] Invariant cache hit.
[2024-06-01 12:21:54] [INFO ] State equation strengthened by 201 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/158 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/158 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 3 (OVERLAPS) 1/159 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 312 unsolved
[2024-06-01 12:22:01] [INFO ] Deduced a trap composed of 53 places in 69 ms of which 2 ms to minimize.
[2024-06-01 12:22:01] [INFO ] Deduced a trap composed of 53 places in 84 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/159 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 6 (OVERLAPS) 313/472 variables, 159/166 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/472 variables, 201/367 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/472 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 9 (OVERLAPS) 0/472 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 312 unsolved
No progress, stopping.
After SMT solving in domain Real declared 472/472 variables, and 367 constraints, problems are : Problem set: 0 solved, 312 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 159/159 constraints, ReadFeed: 201/201 constraints, PredecessorRefiner: 312/312 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 312 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/158 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/158 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 3 (OVERLAPS) 1/159 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/159 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 6 (OVERLAPS) 313/472 variables, 159/166 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/472 variables, 201/367 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/472 variables, 312/679 constraints. Problems are: Problem set: 0 solved, 312 unsolved
[2024-06-01 12:22:39] [INFO ] Deduced a trap composed of 54 places in 72 ms of which 3 ms to minimize.
[2024-06-01 12:22:41] [INFO ] Deduced a trap composed of 56 places in 69 ms of which 3 ms to minimize.
[2024-06-01 12:22:41] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
Problem TDEAD285 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/472 variables, 3/682 constraints. Problems are: Problem set: 1 solved, 311 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 472/472 variables, and 682 constraints, problems are : Problem set: 1 solved, 311 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 159/159 constraints, ReadFeed: 201/201 constraints, PredecessorRefiner: 312/312 constraints, Known Traps: 5/5 constraints]
After SMT, in 61024ms problems are : Problem set: 1 solved, 311 unsolved
Search for dead transitions found 1 dead transitions in 61034ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 159/159 places, 312/313 transitions.
Applied a total of 0 rules in 15 ms. Remains 159 /159 variables (removed 0) and now considering 312/312 (removed 0) transitions.
[2024-06-01 12:22:55] [INFO ] Redundant transitions in 13 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 62279 ms. Remains : 159/159 places, 312/313 transitions.
RANDOM walk for 40000 steps (8893 resets) in 448 ms. (89 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (1904 resets) in 269 ms. (148 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (1925 resets) in 289 ms. (137 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (1873 resets) in 280 ms. (142 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (1916 resets) in 295 ms. (135 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 374612 steps, run timeout after 3001 ms. (steps per millisecond=124 ) properties seen :0 out of 4
Probabilistic random walk after 374612 steps, saw 173450 distinct states, run finished after 3001 ms. (steps per millisecond=124 ) properties seen :0
// Phase 1: matrix 312 rows 159 cols
[2024-06-01 12:22:59] [INFO ] Computed 5 invariants in 2 ms
[2024-06-01 12:22:59] [INFO ] State equation strengthened by 201 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 68/104 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 37/141 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 296/437 variables, 141/146 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/437 variables, 185/331 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/437 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 34/471 variables, 18/349 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/471 variables, 16/365 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/471 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 0/471 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 471/471 variables, and 365 constraints, problems are : Problem set: 0 solved, 4 unsolved in 627 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 159/159 constraints, ReadFeed: 201/201 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 68/104 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 37/141 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 296/437 variables, 141/146 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/437 variables, 185/331 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/437 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 34/471 variables, 18/349 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/471 variables, 16/365 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/471 variables, 4/369 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 12:23:01] [INFO ] Deduced a trap composed of 21 places in 80 ms of which 2 ms to minimize.
[2024-06-01 12:23:01] [INFO ] Deduced a trap composed of 51 places in 60 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/471 variables, 2/371 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/471 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/471 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 471/471 variables, and 371 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2459 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 159/159 constraints, ReadFeed: 201/201 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 2/2 constraints]
After SMT, in 3136ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 16324 ms.
Support contains 36 out of 159 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 159/159 places, 312/312 transitions.
Applied a total of 0 rules in 24 ms. Remains 159 /159 variables (removed 0) and now considering 312/312 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 159/159 places, 312/312 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 159/159 places, 312/312 transitions.
Applied a total of 0 rules in 13 ms. Remains 159 /159 variables (removed 0) and now considering 312/312 (removed 0) transitions.
[2024-06-01 12:23:18] [INFO ] Invariant cache hit.
[2024-06-01 12:23:18] [INFO ] Implicit Places using invariants in 157 ms returned []
[2024-06-01 12:23:18] [INFO ] Invariant cache hit.
[2024-06-01 12:23:18] [INFO ] State equation strengthened by 201 read => feed constraints.
[2024-06-01 12:23:19] [INFO ] Implicit Places using invariants and state equation in 950 ms returned []
Implicit Place search using SMT with State Equation took 1113 ms to find 0 implicit places.
[2024-06-01 12:23:19] [INFO ] Redundant transitions in 8 ms returned []
Running 311 sub problems to find dead transitions.
[2024-06-01 12:23:19] [INFO ] Invariant cache hit.
[2024-06-01 12:23:19] [INFO ] State equation strengthened by 201 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 2 (OVERLAPS) 2/159 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 311 unsolved
[2024-06-01 12:23:27] [INFO ] Deduced a trap composed of 53 places in 73 ms of which 2 ms to minimize.
[2024-06-01 12:23:27] [INFO ] Deduced a trap composed of 53 places in 72 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/159 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 6 (OVERLAPS) 312/471 variables, 159/166 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/471 variables, 201/367 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/471 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 9 (OVERLAPS) 0/471 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 311 unsolved
No progress, stopping.
After SMT solving in domain Real declared 471/471 variables, and 367 constraints, problems are : Problem set: 0 solved, 311 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 159/159 constraints, ReadFeed: 201/201 constraints, PredecessorRefiner: 311/311 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 311 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 2 (OVERLAPS) 2/159 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/159 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 6 (OVERLAPS) 312/471 variables, 159/166 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/471 variables, 201/367 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/471 variables, 311/678 constraints. Problems are: Problem set: 0 solved, 311 unsolved
[2024-06-01 12:24:02] [INFO ] Deduced a trap composed of 51 places in 67 ms of which 2 ms to minimize.
[2024-06-01 12:24:02] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 2 ms to minimize.
[2024-06-01 12:24:02] [INFO ] Deduced a trap composed of 56 places in 45 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/471 variables, 3/681 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/471 variables, 0/681 constraints. Problems are: Problem set: 0 solved, 311 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 471/471 variables, and 681 constraints, problems are : Problem set: 0 solved, 311 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 159/159 constraints, ReadFeed: 201/201 constraints, PredecessorRefiner: 311/311 constraints, Known Traps: 5/5 constraints]
After SMT, in 60957ms problems are : Problem set: 0 solved, 311 unsolved
Search for dead transitions found 0 dead transitions in 60964ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62112 ms. Remains : 159/159 places, 312/312 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 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 159 transition count 308
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 6 place count 157 transition count 308
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 6 place count 157 transition count 296
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 30 place count 145 transition count 296
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 52 place count 134 transition count 285
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 56 place count 132 transition count 295
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 57 place count 132 transition count 294
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 58 place count 131 transition count 294
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 59 place count 131 transition count 294
Applied a total of 59 rules in 45 ms. Remains 131 /159 variables (removed 28) and now considering 294/312 (removed 18) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 294 rows 131 cols
[2024-06-01 12:24:20] [INFO ] Computed 5 invariants in 1 ms
[2024-06-01 12:24:20] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-06-01 12:24:20] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 15 ms returned sat
[2024-06-01 12:24:20] [INFO ] After 89ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-06-01 12:24:20] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 12:24:20] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2024-06-01 12:24:21] [INFO ] After 348ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2024-06-01 12:24:21] [INFO ] Deduced a trap composed of 44 places in 39 ms of which 1 ms to minimize.
[2024-06-01 12:24:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 85 ms
TRAPS : Iteration 1
[2024-06-01 12:24:21] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 1 ms to minimize.
[2024-06-01 12:24:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 53 ms
TRAPS : Iteration 2
[2024-06-01 12:24:22] [INFO ] After 1361ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2024-06-01 12:24:22] [INFO ] After 1658ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Over-approximation ignoring read arcs solved 0 properties in 1834 ms.
[2024-06-01 12:24:22] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 6 ms.
[2024-06-01 12:24:22] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 159 places, 312 transitions and 1233 arcs took 9 ms.
[2024-06-01 12:24:22] [INFO ] Flatten gal took : 82 ms
Total runtime 183184 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-d1m36-ReachabilityFireability-2024-01
Could not compute solution for formula : SieveSingleMsgMbox-PT-d1m36-ReachabilityFireability-2024-04
Could not compute solution for formula : SieveSingleMsgMbox-PT-d1m36-ReachabilityFireability-2024-05
Could not compute solution for formula : SieveSingleMsgMbox-PT-d1m36-ReachabilityFireability-2024-13

BK_STOP 1717244663125

--------------------
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-d1m36-ReachabilityFireability-2024-01
rfs formula type EF
rfs formula formula --invariant=/tmp/667/inv_0_
rfs formula name SieveSingleMsgMbox-PT-d1m36-ReachabilityFireability-2024-04
rfs formula type EF
rfs formula formula --invariant=/tmp/667/inv_1_
rfs formula name SieveSingleMsgMbox-PT-d1m36-ReachabilityFireability-2024-05
rfs formula type EF
rfs formula formula --invariant=/tmp/667/inv_2_
rfs formula name SieveSingleMsgMbox-PT-d1m36-ReachabilityFireability-2024-13
rfs formula type AG
rfs formula formula --invariant=/tmp/667/inv_3_
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-d1m36"
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-d1m36, 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-171683810700079"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SieveSingleMsgMbox-PT-d1m36.tgz
mv SieveSingleMsgMbox-PT-d1m36 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 ;