About the Execution of LTSMin+red for ShieldIIPt-PT-100B
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 2319.359 | 269039.00 | 330630.00 | 786.50 | ??T???TT??F?T??? | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r528-tall-171683760900351.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 ShieldIIPt-PT-100B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r528-tall-171683760900351
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.1M
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 38K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 16:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 19:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Apr 12 20:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 98K Apr 12 20:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Apr 12 20:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Apr 12 20:40 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 1.7M 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 ShieldIIPt-PT-100B-ReachabilityFireability-2024-00
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityFireability-2024-01
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityFireability-2024-02
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityFireability-2024-03
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityFireability-2024-04
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityFireability-2024-05
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityFireability-2024-06
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityFireability-2024-07
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityFireability-2024-08
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityFireability-2024-09
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityFireability-2024-10
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityFireability-2024-11
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityFireability-2024-12
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityFireability-2024-13
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityFireability-2024-14
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityFireability-2024-15
=== Now, execution of the tool begins
BK_START 1717241446212
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-100B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 11:30:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 11:30:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 11:30:47] [INFO ] Load time of PNML (sax parser for PT used): 304 ms
[2024-06-01 11:30:47] [INFO ] Transformed 7003 places.
[2024-06-01 11:30:47] [INFO ] Transformed 6503 transitions.
[2024-06-01 11:30:47] [INFO ] Found NUPN structural information;
[2024-06-01 11:30:48] [INFO ] Parsed PT model containing 7003 places and 6503 transitions and 16206 arcs in 693 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (8 resets) in 2335 ms. (17 steps per ms) remains 11/16 properties
FORMULA ShieldIIPt-PT-100B-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-100B-ReachabilityFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-100B-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-100B-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-100B-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 149 ms. (266 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 261 ms. (152 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 205 ms. (194 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 386 ms. (103 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 77 ms. (512 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 133 ms. (298 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 78 ms. (506 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 88 ms. (449 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 53 ms. (740 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 75 ms. (526 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 927 ms. (43 steps per ms) remains 11/11 properties
// Phase 1: matrix 6503 rows 7003 cols
[2024-06-01 11:30:49] [INFO ] Computed 901 invariants in 69 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 185/185 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/185 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 4537/4722 variables, 570/755 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/4722 variables, 4537/5292 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4722 variables, 0/5292 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 2281/7003 variables, 331/5623 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7003 variables, 2281/7904 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/7003 variables, 0/7904 constraints. Problems are: Problem set: 0 solved, 11 unsolved
SMT process timed out in 5273ms, After SMT, problems are : Problem set: 0 solved, 11 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 185 out of 7003 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7003/7003 places, 6503/6503 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1554 transitions
Trivial Post-agglo rules discarded 1554 transitions
Performed 1554 trivial Post agglomeration. Transition count delta: 1554
Iterating post reduction 0 with 1554 rules applied. Total rules applied 1554 place count 7003 transition count 4949
Reduce places removed 1554 places and 0 transitions.
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Iterating post reduction 1 with 1604 rules applied. Total rules applied 3158 place count 5449 transition count 4899
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 2 with 50 rules applied. Total rules applied 3208 place count 5399 transition count 4899
Performed 413 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 413 Pre rules applied. Total rules applied 3208 place count 5399 transition count 4486
Deduced a syphon composed of 413 places in 22 ms
Reduce places removed 413 places and 0 transitions.
Iterating global reduction 3 with 826 rules applied. Total rules applied 4034 place count 4986 transition count 4486
Discarding 665 places :
Symmetric choice reduction at 3 with 665 rule applications. Total rules 4699 place count 4321 transition count 3821
Iterating global reduction 3 with 665 rules applied. Total rules applied 5364 place count 4321 transition count 3821
Performed 263 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 263 Pre rules applied. Total rules applied 5364 place count 4321 transition count 3558
Deduced a syphon composed of 263 places in 17 ms
Reduce places removed 263 places and 0 transitions.
Iterating global reduction 3 with 526 rules applied. Total rules applied 5890 place count 4058 transition count 3558
Performed 1626 Post agglomeration using F-continuation condition.Transition count delta: 1626
Deduced a syphon composed of 1626 places in 15 ms
Reduce places removed 1626 places and 0 transitions.
Iterating global reduction 3 with 3252 rules applied. Total rules applied 9142 place count 2432 transition count 1932
Renaming transitions due to excessive name length > 1024 char.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -53
Deduced a syphon composed of 101 places in 6 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 9344 place count 2331 transition count 1985
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -51
Deduced a syphon composed of 101 places in 5 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 9546 place count 2230 transition count 2036
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: -33
Deduced a syphon composed of 59 places in 7 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 3 with 118 rules applied. Total rules applied 9664 place count 2171 transition count 2069
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 9665 place count 2171 transition count 2068
Free-agglomeration rule applied 14 times.
Iterating global reduction 4 with 14 rules applied. Total rules applied 9679 place count 2171 transition count 2054
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 4 with 14 rules applied. Total rules applied 9693 place count 2157 transition count 2054
Partial Free-agglomeration rule applied 95 times.
Drop transitions (Partial Free agglomeration) removed 95 transitions
Iterating global reduction 5 with 95 rules applied. Total rules applied 9788 place count 2157 transition count 2054
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 9789 place count 2156 transition count 2053
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 9790 place count 2155 transition count 2053
Applied a total of 9790 rules in 2715 ms. Remains 2155 /7003 variables (removed 4848) and now considering 2053/6503 (removed 4450) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2726 ms. Remains : 2155/7003 places, 2053/6503 transitions.
RANDOM walk for 40000 steps (8 resets) in 953 ms. (41 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 473 ms. (84 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 422 ms. (94 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 422 ms. (94 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 282 ms. (141 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 353 ms. (113 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 394 ms. (101 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 329 ms. (121 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 376 ms. (106 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 323 ms. (123 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 324 ms. (123 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 427 ms. (93 steps per ms) remains 11/11 properties
Interrupted probabilistic random walk after 57777 steps, run timeout after 3001 ms. (steps per millisecond=19 ) properties seen :0 out of 11
Probabilistic random walk after 57777 steps, saw 39732 distinct states, run finished after 3004 ms. (steps per millisecond=19 ) properties seen :0
// Phase 1: matrix 2053 rows 2155 cols
[2024-06-01 11:31:02] [INFO ] Computed 900 invariants in 9 ms
[2024-06-01 11:31:02] [INFO ] State equation strengthened by 657 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 1275/1460 variables, 570/570 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1460 variables, 0/570 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 604/2064 variables, 287/857 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2064 variables, 0/857 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 2000/4064 variables, 2064/2921 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4064 variables, 655/3576 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4064 variables, 0/3576 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 100/4164 variables, 64/3640 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4164 variables, 28/3668 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4164 variables, 2/3670 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4164 variables, 0/3670 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (OVERLAPS) 2/4166 variables, 3/3673 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4166 variables, 2/3675 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4166 variables, 0/3675 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 15 (OVERLAPS) 2/4168 variables, 1/3676 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/4168 variables, 0/3676 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 17 (OVERLAPS) 30/4198 variables, 18/3694 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/4198 variables, 7/3701 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/4198 variables, 0/3701 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 20 (OVERLAPS) 1/4199 variables, 1/3702 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/4199 variables, 1/3703 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/4199 variables, 0/3703 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 23 (OVERLAPS) 2/4201 variables, 1/3704 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/4201 variables, 0/3704 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 25 (OVERLAPS) 7/4208 variables, 6/3710 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/4208 variables, 2/3712 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/4208 variables, 0/3712 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 28 (OVERLAPS) 0/4208 variables, 0/3712 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4208/4208 variables, and 3712 constraints, problems are : Problem set: 0 solved, 11 unsolved in 16611 ms.
Refiners :[Positive P Invariants (semi-flows): 900/900 constraints, State Equation: 2155/2155 constraints, ReadFeed: 657/657 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 1275/1460 variables, 570/570 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-06-01 11:31:19] [INFO ] Deduced a trap composed of 8 places in 525 ms of which 61 ms to minimize.
[2024-06-01 11:31:20] [INFO ] Deduced a trap composed of 5 places in 433 ms of which 11 ms to minimize.
[2024-06-01 11:31:20] [INFO ] Deduced a trap composed of 8 places in 437 ms of which 7 ms to minimize.
[2024-06-01 11:31:21] [INFO ] Deduced a trap composed of 8 places in 473 ms of which 7 ms to minimize.
[2024-06-01 11:31:21] [INFO ] Deduced a trap composed of 14 places in 151 ms of which 10 ms to minimize.
[2024-06-01 11:31:21] [INFO ] Deduced a trap composed of 13 places in 92 ms of which 2 ms to minimize.
[2024-06-01 11:31:21] [INFO ] Deduced a trap composed of 13 places in 106 ms of which 2 ms to minimize.
[2024-06-01 11:31:21] [INFO ] Deduced a trap composed of 14 places in 109 ms of which 2 ms to minimize.
[2024-06-01 11:31:22] [INFO ] Deduced a trap composed of 17 places in 113 ms of which 2 ms to minimize.
[2024-06-01 11:31:22] [INFO ] Deduced a trap composed of 15 places in 93 ms of which 2 ms to minimize.
[2024-06-01 11:31:22] [INFO ] Deduced a trap composed of 14 places in 97 ms of which 2 ms to minimize.
[2024-06-01 11:31:22] [INFO ] Deduced a trap composed of 16 places in 91 ms of which 2 ms to minimize.
[2024-06-01 11:31:22] [INFO ] Deduced a trap composed of 16 places in 107 ms of which 2 ms to minimize.
[2024-06-01 11:31:22] [INFO ] Deduced a trap composed of 17 places in 101 ms of which 2 ms to minimize.
[2024-06-01 11:31:22] [INFO ] Deduced a trap composed of 16 places in 116 ms of which 2 ms to minimize.
[2024-06-01 11:31:22] [INFO ] Deduced a trap composed of 17 places in 104 ms of which 2 ms to minimize.
[2024-06-01 11:31:23] [INFO ] Deduced a trap composed of 16 places in 89 ms of which 2 ms to minimize.
[2024-06-01 11:31:23] [INFO ] Deduced a trap composed of 16 places in 90 ms of which 2 ms to minimize.
[2024-06-01 11:31:23] [INFO ] Deduced a trap composed of 8 places in 93 ms of which 2 ms to minimize.
[2024-06-01 11:31:23] [INFO ] Deduced a trap composed of 16 places in 90 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1460 variables, 20/590 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-06-01 11:31:23] [INFO ] Deduced a trap composed of 7 places in 90 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1460 variables, 1/591 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-06-01 11:31:24] [INFO ] Deduced a trap composed of 13 places in 100 ms of which 3 ms to minimize.
[2024-06-01 11:31:24] [INFO ] Deduced a trap composed of 12 places in 101 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1460 variables, 2/593 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1460 variables, 0/593 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (OVERLAPS) 604/2064 variables, 287/880 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-06-01 11:31:25] [INFO ] Deduced a trap composed of 4 places in 122 ms of which 2 ms to minimize.
[2024-06-01 11:31:25] [INFO ] Deduced a trap composed of 6 places in 118 ms of which 2 ms to minimize.
[2024-06-01 11:31:25] [INFO ] Deduced a trap composed of 8 places in 119 ms of which 2 ms to minimize.
[2024-06-01 11:31:25] [INFO ] Deduced a trap composed of 5 places in 122 ms of which 2 ms to minimize.
[2024-06-01 11:31:25] [INFO ] Deduced a trap composed of 7 places in 104 ms of which 3 ms to minimize.
[2024-06-01 11:31:25] [INFO ] Deduced a trap composed of 5 places in 111 ms of which 3 ms to minimize.
[2024-06-01 11:31:25] [INFO ] Deduced a trap composed of 6 places in 107 ms of which 2 ms to minimize.
[2024-06-01 11:31:26] [INFO ] Deduced a trap composed of 4 places in 99 ms of which 2 ms to minimize.
[2024-06-01 11:31:26] [INFO ] Deduced a trap composed of 5 places in 106 ms of which 2 ms to minimize.
[2024-06-01 11:31:26] [INFO ] Deduced a trap composed of 4 places in 107 ms of which 3 ms to minimize.
[2024-06-01 11:31:26] [INFO ] Deduced a trap composed of 4 places in 132 ms of which 5 ms to minimize.
[2024-06-01 11:31:26] [INFO ] Deduced a trap composed of 8 places in 110 ms of which 3 ms to minimize.
[2024-06-01 11:31:27] [INFO ] Deduced a trap composed of 7 places in 111 ms of which 3 ms to minimize.
[2024-06-01 11:31:27] [INFO ] Deduced a trap composed of 8 places in 102 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/2064 variables, 14/894 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-06-01 11:31:27] [INFO ] Deduced a trap composed of 8 places in 101 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/2064 variables, 1/895 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2064 variables, 0/895 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (OVERLAPS) 2000/4064 variables, 2064/2959 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4064 variables, 655/3614 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4064 variables, 6/3620 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-06-01 11:31:36] [INFO ] Deduced a trap composed of 13 places in 210 ms of which 4 ms to minimize.
[2024-06-01 11:31:36] [INFO ] Deduced a trap composed of 14 places in 210 ms of which 4 ms to minimize.
[2024-06-01 11:31:37] [INFO ] Deduced a trap composed of 13 places in 211 ms of which 4 ms to minimize.
[2024-06-01 11:31:37] [INFO ] Deduced a trap composed of 16 places in 209 ms of which 4 ms to minimize.
[2024-06-01 11:31:37] [INFO ] Deduced a trap composed of 8 places in 202 ms of which 4 ms to minimize.
[2024-06-01 11:31:38] [INFO ] Deduced a trap composed of 5 places in 205 ms of which 4 ms to minimize.
[2024-06-01 11:31:38] [INFO ] Deduced a trap composed of 14 places in 197 ms of which 3 ms to minimize.
[2024-06-01 11:31:39] [INFO ] Deduced a trap composed of 7 places in 213 ms of which 4 ms to minimize.
[2024-06-01 11:31:39] [INFO ] Deduced a trap composed of 13 places in 212 ms of which 4 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/4064 variables, 9/3629 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-06-01 11:31:41] [INFO ] Deduced a trap composed of 15 places in 193 ms of which 4 ms to minimize.
[2024-06-01 11:31:41] [INFO ] Deduced a trap composed of 16 places in 195 ms of which 3 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/4064 variables, 2/3631 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/4064 variables, 0/3631 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 16 (OVERLAPS) 100/4164 variables, 64/3695 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/4164 variables, 28/3723 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/4164 variables, 2/3725 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/4164 variables, 5/3730 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-06-01 11:31:57] [INFO ] Deduced a trap composed of 7 places in 167 ms of which 3 ms to minimize.
[2024-06-01 11:31:57] [INFO ] Deduced a trap composed of 4 places in 161 ms of which 4 ms to minimize.
[2024-06-01 11:31:57] [INFO ] Deduced a trap composed of 13 places in 157 ms of which 3 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/4164 variables, 3/3733 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-06-01 11:32:01] [INFO ] Deduced a trap composed of 7 places in 150 ms of which 3 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/4164 variables, 1/3734 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4164/4208 variables, and 3734 constraints, problems are : Problem set: 0 solved, 11 unsolved in 45015 ms.
Refiners :[Positive P Invariants (semi-flows): 885/900 constraints, State Equation: 2128/2155 constraints, ReadFeed: 657/657 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 53/53 constraints]
After SMT, in 61709ms problems are : Problem set: 0 solved, 11 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 185 out of 2155 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2155/2155 places, 2053/2053 transitions.
Applied a total of 0 rules in 68 ms. Remains 2155 /2155 variables (removed 0) and now considering 2053/2053 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68 ms. Remains : 2155/2155 places, 2053/2053 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2155/2155 places, 2053/2053 transitions.
Applied a total of 0 rules in 62 ms. Remains 2155 /2155 variables (removed 0) and now considering 2053/2053 (removed 0) transitions.
[2024-06-01 11:32:04] [INFO ] Invariant cache hit.
[2024-06-01 11:32:05] [INFO ] Implicit Places using invariants in 1072 ms returned []
[2024-06-01 11:32:05] [INFO ] Invariant cache hit.
[2024-06-01 11:32:06] [INFO ] State equation strengthened by 657 read => feed constraints.
[2024-06-01 11:32:24] [INFO ] Implicit Places using invariants and state equation in 19311 ms returned []
Implicit Place search using SMT with State Equation took 20392 ms to find 0 implicit places.
[2024-06-01 11:32:24] [INFO ] Redundant transitions in 143 ms returned []
Running 2043 sub problems to find dead transitions.
[2024-06-01 11:32:24] [INFO ] Invariant cache hit.
[2024-06-01 11:32:24] [INFO ] State equation strengthened by 657 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2148 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 2043 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2148/4208 variables, and 49 constraints, problems are : Problem set: 0 solved, 2043 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 49/900 constraints, State Equation: 0/2155 constraints, ReadFeed: 0/657 constraints, PredecessorRefiner: 2043/2043 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2043 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2148 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 2043 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2148/4208 variables, and 49 constraints, problems are : Problem set: 0 solved, 2043 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 49/900 constraints, State Equation: 0/2155 constraints, ReadFeed: 0/657 constraints, PredecessorRefiner: 0/2043 constraints, Known Traps: 0/0 constraints]
After SMT, in 61010ms problems are : Problem set: 0 solved, 2043 unsolved
Search for dead transitions found 0 dead transitions in 61037ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 81655 ms. Remains : 2155/2155 places, 2053/2053 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 361 times.
Drop transitions (Partial Free agglomeration) removed 361 transitions
Iterating global reduction 0 with 361 rules applied. Total rules applied 361 place count 2155 transition count 2053
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 367 place count 2155 transition count 2047
Applied a total of 367 rules in 178 ms. Remains 2155 /2155 variables (removed 0) and now considering 2047/2053 (removed 6) transitions.
Running SMT prover for 11 properties.
// Phase 1: matrix 2047 rows 2155 cols
[2024-06-01 11:33:25] [INFO ] Computed 900 invariants in 6 ms
[2024-06-01 11:33:26] [INFO ] [Real]Absence check using 900 positive place invariants in 160 ms returned sat
[2024-06-01 11:33:26] [INFO ] After 951ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2024-06-01 11:33:27] [INFO ] [Nat]Absence check using 900 positive place invariants in 155 ms returned sat
[2024-06-01 11:33:29] [INFO ] After 1905ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2024-06-01 11:33:29] [INFO ] State equation strengthened by 326 read => feed constraints.
[2024-06-01 11:33:33] [INFO ] After 3481ms SMT Verify possible using 326 Read/Feed constraints in natural domain returned unsat :0 sat :11
TRAPS : Iteration 0
[2024-06-01 11:33:33] [INFO ] Deduced a trap composed of 8 places in 261 ms of which 4 ms to minimize.
[2024-06-01 11:33:34] [INFO ] Deduced a trap composed of 4 places in 276 ms of which 5 ms to minimize.
[2024-06-01 11:33:34] [INFO ] Deduced a trap composed of 9 places in 241 ms of which 7 ms to minimize.
[2024-06-01 11:33:34] [INFO ] Deduced a trap composed of 17 places in 247 ms of which 5 ms to minimize.
[2024-06-01 11:33:35] [INFO ] Deduced a trap composed of 6 places in 260 ms of which 5 ms to minimize.
[2024-06-01 11:33:35] [INFO ] Deduced a trap composed of 6 places in 236 ms of which 4 ms to minimize.
[2024-06-01 11:33:35] [INFO ] Deduced a trap composed of 13 places in 244 ms of which 4 ms to minimize.
[2024-06-01 11:33:35] [INFO ] Deduced a trap composed of 18 places in 231 ms of which 5 ms to minimize.
[2024-06-01 11:33:36] [INFO ] Deduced a trap composed of 15 places in 223 ms of which 5 ms to minimize.
[2024-06-01 11:33:36] [INFO ] Deduced a trap composed of 13 places in 229 ms of which 4 ms to minimize.
[2024-06-01 11:33:36] [INFO ] Deduced a trap composed of 14 places in 227 ms of which 5 ms to minimize.
[2024-06-01 11:33:36] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 3563 ms
[2024-06-01 11:33:37] [INFO ] Deduced a trap composed of 13 places in 246 ms of which 5 ms to minimize.
[2024-06-01 11:33:37] [INFO ] Deduced a trap composed of 13 places in 238 ms of which 4 ms to minimize.
[2024-06-01 11:33:38] [INFO ] Deduced a trap composed of 16 places in 235 ms of which 5 ms to minimize.
[2024-06-01 11:33:38] [INFO ] Deduced a trap composed of 11 places in 237 ms of which 4 ms to minimize.
[2024-06-01 11:33:38] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1326 ms
[2024-06-01 11:33:39] [INFO ] Deduced a trap composed of 16 places in 215 ms of which 5 ms to minimize.
[2024-06-01 11:33:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 369 ms
[2024-06-01 11:33:40] [INFO ] Deduced a trap composed of 5 places in 234 ms of which 5 ms to minimize.
[2024-06-01 11:33:40] [INFO ] Deduced a trap composed of 5 places in 239 ms of which 4 ms to minimize.
[2024-06-01 11:33:41] [INFO ] Deduced a trap composed of 7 places in 238 ms of which 5 ms to minimize.
[2024-06-01 11:33:41] [INFO ] Deduced a trap composed of 16 places in 234 ms of which 4 ms to minimize.
[2024-06-01 11:33:41] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1344 ms
[2024-06-01 11:33:43] [INFO ] Deduced a trap composed of 5 places in 731 ms of which 9 ms to minimize.
[2024-06-01 11:33:44] [INFO ] Deduced a trap composed of 4 places in 739 ms of which 9 ms to minimize.
[2024-06-01 11:33:44] [INFO ] Deduced a trap composed of 6 places in 716 ms of which 9 ms to minimize.
[2024-06-01 11:33:44] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2485 ms
[2024-06-01 11:33:45] [INFO ] Deduced a trap composed of 16 places in 288 ms of which 5 ms to minimize.
[2024-06-01 11:33:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 435 ms
[2024-06-01 11:33:48] [INFO ] Deduced a trap composed of 15 places in 265 ms of which 4 ms to minimize.
[2024-06-01 11:33:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 424 ms
TRAPS : Iteration 1
[2024-06-01 11:33:48] [INFO ] Deduced a trap composed of 3 places in 260 ms of which 5 ms to minimize.
[2024-06-01 11:33:49] [INFO ] Deduced a trap composed of 8 places in 260 ms of which 5 ms to minimize.
[2024-06-01 11:33:49] [INFO ] Deduced a trap composed of 5 places in 249 ms of which 4 ms to minimize.
[2024-06-01 11:33:49] [INFO ] Deduced a trap composed of 5 places in 253 ms of which 5 ms to minimize.
[2024-06-01 11:33:49] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1402 ms
[2024-06-01 11:33:51] [INFO ] Deduced a trap composed of 5 places in 277 ms of which 5 ms to minimize.
[2024-06-01 11:33:51] [INFO ] Deduced a trap composed of 9 places in 268 ms of which 5 ms to minimize.
[2024-06-01 11:33:52] [INFO ] Deduced a trap composed of 7 places in 261 ms of which 5 ms to minimize.
[2024-06-01 11:33:52] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1114 ms
[2024-06-01 11:33:53] [INFO ] Deduced a trap composed of 13 places in 289 ms of which 6 ms to minimize.
[2024-06-01 11:33:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 442 ms
[2024-06-01 11:33:54] [INFO ] Deduced a trap composed of 15 places in 282 ms of which 5 ms to minimize.
[2024-06-01 11:33:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 430 ms
TRAPS : Iteration 2
[2024-06-01 11:33:56] [INFO ] Deduced a trap composed of 6 places in 272 ms of which 5 ms to minimize.
[2024-06-01 11:33:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 415 ms
[2024-06-01 11:33:56] [INFO ] Deduced a trap composed of 8 places in 271 ms of which 5 ms to minimize.
[2024-06-01 11:33:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 414 ms
[2024-06-01 11:33:57] [INFO ] Deduced a trap composed of 14 places in 274 ms of which 5 ms to minimize.
[2024-06-01 11:33:58] [INFO ] Deduced a trap composed of 4 places in 262 ms of which 5 ms to minimize.
[2024-06-01 11:33:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 783 ms
[2024-06-01 11:33:59] [INFO ] Deduced a trap composed of 15 places in 290 ms of which 5 ms to minimize.
[2024-06-01 11:34:00] [INFO ] Deduced a trap composed of 21 places in 294 ms of which 5 ms to minimize.
[2024-06-01 11:34:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 809 ms
[2024-06-01 11:34:00] [INFO ] Deduced a trap composed of 16 places in 303 ms of which 5 ms to minimize.
[2024-06-01 11:34:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 448 ms
[2024-06-01 11:34:03] [INFO ] Deduced a trap composed of 13 places in 308 ms of which 6 ms to minimize.
[2024-06-01 11:34:03] [INFO ] Deduced a trap composed of 14 places in 306 ms of which 6 ms to minimize.
[2024-06-01 11:34:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 851 ms
TRAPS : Iteration 3
[2024-06-01 11:34:04] [INFO ] Deduced a trap composed of 13 places in 296 ms of which 5 ms to minimize.
[2024-06-01 11:34:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 438 ms
[2024-06-01 11:34:06] [INFO ] Deduced a trap composed of 17 places in 328 ms of which 6 ms to minimize.
[2024-06-01 11:34:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 475 ms
[2024-06-01 11:34:07] [INFO ] Deduced a trap composed of 17 places in 302 ms of which 5 ms to minimize.
[2024-06-01 11:34:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 453 ms
[2024-06-01 11:34:10] [INFO ] Deduced a trap composed of 9 places in 269 ms of which 5 ms to minimize.
[2024-06-01 11:34:10] [INFO ] Deduced a trap composed of 8 places in 263 ms of which 5 ms to minimize.
[2024-06-01 11:34:11] [INFO ] Deduced a trap composed of 11 places in 264 ms of which 5 ms to minimize.
[2024-06-01 11:34:11] [INFO ] Deduced a trap composed of 16 places in 256 ms of which 5 ms to minimize.
[2024-06-01 11:34:11] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1470 ms
TRAPS : Iteration 4
[2024-06-01 11:34:13] [INFO ] Deduced a trap composed of 16 places in 513 ms of which 8 ms to minimize.
[2024-06-01 11:34:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1375 ms
[2024-06-01 11:34:18] [INFO ] Deduced a trap composed of 16 places in 290 ms of which 5 ms to minimize.
[2024-06-01 11:34:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 441 ms
TRAPS : Iteration 5
[2024-06-01 11:34:18] [INFO ] Deduced a trap composed of 7 places in 296 ms of which 6 ms to minimize.
[2024-06-01 11:34:19] [INFO ] Deduced a trap composed of 6 places in 289 ms of which 5 ms to minimize.
[2024-06-01 11:34:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 802 ms
[2024-06-01 11:34:23] [INFO ] Deduced a trap composed of 16 places in 286 ms of which 5 ms to minimize.
[2024-06-01 11:34:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 432 ms
TRAPS : Iteration 6
[2024-06-01 11:34:25] [INFO ] Deduced a trap composed of 7 places in 489 ms of which 8 ms to minimize.
[2024-06-01 11:34:26] [INFO ] Deduced a trap composed of 8 places in 767 ms of which 9 ms to minimize.
[2024-06-01 11:34:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1527 ms
[2024-06-01 11:34:27] [INFO ] Deduced a trap composed of 16 places in 292 ms of which 5 ms to minimize.
[2024-06-01 11:34:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 435 ms
[2024-06-01 11:34:28] [INFO ] Deduced a trap composed of 21 places in 302 ms of which 5 ms to minimize.
[2024-06-01 11:34:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 448 ms
[2024-06-01 11:34:31] [INFO ] Deduced a trap composed of 6 places in 297 ms of which 6 ms to minimize.
[2024-06-01 11:34:31] [INFO ] Deduced a trap composed of 8 places in 294 ms of which 5 ms to minimize.
[2024-06-01 11:34:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 824 ms
TRAPS : Iteration 7
[2024-06-01 11:34:33] [INFO ] Deduced a trap composed of 8 places in 287 ms of which 5 ms to minimize.
[2024-06-01 11:34:33] [INFO ] Deduced a trap composed of 14 places in 282 ms of which 5 ms to minimize.
[2024-06-01 11:34:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 796 ms
[2024-06-01 11:34:34] [INFO ] Deduced a trap composed of 5 places in 300 ms of which 5 ms to minimize.
[2024-06-01 11:34:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 450 ms
[2024-06-01 11:34:35] [INFO ] Deduced a trap composed of 5 places in 320 ms of which 5 ms to minimize.
[2024-06-01 11:34:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 467 ms
[2024-06-01 11:34:38] [INFO ] Deduced a trap composed of 14 places in 276 ms of which 5 ms to minimize.
[2024-06-01 11:34:39] [INFO ] Deduced a trap composed of 14 places in 269 ms of which 5 ms to minimize.
[2024-06-01 11:34:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 784 ms
TRAPS : Iteration 8
[2024-06-01 11:34:42] [INFO ] Deduced a trap composed of 14 places in 317 ms of which 6 ms to minimize.
[2024-06-01 11:34:42] [INFO ] Deduced a trap composed of 8 places in 308 ms of which 6 ms to minimize.
[2024-06-01 11:34:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 853 ms
[2024-06-01 11:34:45] [INFO ] Deduced a trap composed of 15 places in 264 ms of which 5 ms to minimize.
[2024-06-01 11:34:45] [INFO ] Deduced a trap composed of 16 places in 267 ms of which 5 ms to minimize.
[2024-06-01 11:34:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 763 ms
TRAPS : Iteration 9
[2024-06-01 11:34:46] [INFO ] Deduced a trap composed of 7 places in 264 ms of which 5 ms to minimize.
[2024-06-01 11:34:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 413 ms
[2024-06-01 11:34:51] [INFO ] Deduced a trap composed of 21 places in 293 ms of which 6 ms to minimize.
[2024-06-01 11:34:51] [INFO ] Deduced a trap composed of 16 places in 310 ms of which 5 ms to minimize.
[2024-06-01 11:34:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 847 ms
TRAPS : Iteration 10
[2024-06-01 11:34:52] [INFO ] Deduced a trap composed of 12 places in 589 ms of which 8 ms to minimize.
[2024-06-01 11:34:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 740 ms
[2024-06-01 11:34:53] [INFO ] Deduced a trap composed of 11 places in 262 ms of which 4 ms to minimize.
[2024-06-01 11:34:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 397 ms
[2024-06-01 11:34:54] [INFO ] Deduced a trap composed of 5 places in 276 ms of which 5 ms to minimize.
[2024-06-01 11:34:55] [INFO ] Deduced a trap composed of 6 places in 275 ms of which 5 ms to minimize.
[2024-06-01 11:34:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 781 ms
[2024-06-01 11:34:55] [INFO ] Deduced a trap composed of 5 places in 294 ms of which 6 ms to minimize.
[2024-06-01 11:34:56] [INFO ] Deduced a trap composed of 22 places in 278 ms of which 5 ms to minimize.
[2024-06-01 11:34:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 803 ms
[2024-06-01 11:34:58] [INFO ] Deduced a trap composed of 9 places in 289 ms of which 5 ms to minimize.
[2024-06-01 11:34:59] [INFO ] Deduced a trap composed of 4 places in 285 ms of which 5 ms to minimize.
[2024-06-01 11:34:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 819 ms
TRAPS : Iteration 11
[2024-06-01 11:35:02] [INFO ] Deduced a trap composed of 13 places in 278 ms of which 5 ms to minimize.
[2024-06-01 11:35:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 428 ms
[2024-06-01 11:35:04] [INFO ] Deduced a trap composed of 9 places in 294 ms of which 6 ms to minimize.
[2024-06-01 11:35:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 456 ms
TRAPS : Iteration 12
[2024-06-01 11:35:09] [INFO ] After 99706ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
[2024-06-01 11:35:14] [INFO ] After 107461ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Over-approximation ignoring read arcs solved 0 properties in 108639 ms.
[2024-06-01 11:35:14] [INFO ] Export to MCC of 11 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 4 ms.
[2024-06-01 11:35:14] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2155 places, 2053 transitions and 9929 arcs took 18 ms.
[2024-06-01 11:35:14] [INFO ] Flatten gal took : 339 ms
Total runtime 267585 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=
[--mu-opt] [--saturation=
[--sat-granularity=
[--guidance=
[--action=
[--trace=
[--mu=
[--ctl=
[--save-levels=STRING] [--pg-solve] [--attr=
[--saturating-attractor] [--write-strategy=
[--check-strategy] [--interactive-play] [--player]
[--pg-write=
[--edge-label=
[--mucalc=
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por=
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=
[--cw-max-cols=
[--mh-timeout=
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=
[--ldd32-cache=
[--cache-ratio=
[--min-free-nodes=
[--fdd-reorder=
[--vset-cache-diff=
[--next-union] [--peak-nodes] [--maxsum=
[--block-size=
[--debug=
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS]
Could not compute solution for formula : ShieldIIPt-PT-100B-ReachabilityFireability-2024-00
Could not compute solution for formula : ShieldIIPt-PT-100B-ReachabilityFireability-2024-01
Could not compute solution for formula : ShieldIIPt-PT-100B-ReachabilityFireability-2024-03
Could not compute solution for formula : ShieldIIPt-PT-100B-ReachabilityFireability-2024-04
Could not compute solution for formula : ShieldIIPt-PT-100B-ReachabilityFireability-2024-05
Could not compute solution for formula : ShieldIIPt-PT-100B-ReachabilityFireability-2024-08
Could not compute solution for formula : ShieldIIPt-PT-100B-ReachabilityFireability-2024-09
Could not compute solution for formula : ShieldIIPt-PT-100B-ReachabilityFireability-2024-11
Could not compute solution for formula : ShieldIIPt-PT-100B-ReachabilityFireability-2024-13
Could not compute solution for formula : ShieldIIPt-PT-100B-ReachabilityFireability-2024-14
Could not compute solution for formula : ShieldIIPt-PT-100B-ReachabilityFireability-2024-15
BK_STOP 1717241715251
--------------------
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 ShieldIIPt-PT-100B-ReachabilityFireability-2024-00
rfs formula type EF
rfs formula formula --invariant=/tmp/962/inv_0_
rfs formula name ShieldIIPt-PT-100B-ReachabilityFireability-2024-01
rfs formula type AG
rfs formula formula --invariant=/tmp/962/inv_1_
rfs formula name ShieldIIPt-PT-100B-ReachabilityFireability-2024-03
rfs formula type AG
rfs formula formula --invariant=/tmp/962/inv_2_
rfs formula name ShieldIIPt-PT-100B-ReachabilityFireability-2024-04
rfs formula type EF
rfs formula formula --invariant=/tmp/962/inv_3_
rfs formula name ShieldIIPt-PT-100B-ReachabilityFireability-2024-05
rfs formula type EF
rfs formula formula --invariant=/tmp/962/inv_4_
rfs formula name ShieldIIPt-PT-100B-ReachabilityFireability-2024-08
rfs formula type AG
rfs formula formula --invariant=/tmp/962/inv_5_
rfs formula name ShieldIIPt-PT-100B-ReachabilityFireability-2024-09
rfs formula type AG
rfs formula formula --invariant=/tmp/962/inv_6_
rfs formula name ShieldIIPt-PT-100B-ReachabilityFireability-2024-11
rfs formula type AG
rfs formula formula --invariant=/tmp/962/inv_7_
rfs formula name ShieldIIPt-PT-100B-ReachabilityFireability-2024-13
rfs formula type AG
rfs formula formula --invariant=/tmp/962/inv_8_
rfs formula name ShieldIIPt-PT-100B-ReachabilityFireability-2024-14
rfs formula type AG
rfs formula formula --invariant=/tmp/962/inv_9_
rfs formula name ShieldIIPt-PT-100B-ReachabilityFireability-2024-15
rfs formula type EF
rfs formula formula --invariant=/tmp/962/inv_10_
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="ShieldIIPt-PT-100B"
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 ShieldIIPt-PT-100B, 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 r528-tall-171683760900351"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPt-PT-100B.tgz
mv ShieldIIPt-PT-100B execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;