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-171683760900348.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 LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r528-tall-171683760900348
=====================================================================

--------------------
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-LTLFireability-00
FORMULA_NAME ShieldIIPt-PT-100B-LTLFireability-01
FORMULA_NAME ShieldIIPt-PT-100B-LTLFireability-02
FORMULA_NAME ShieldIIPt-PT-100B-LTLFireability-03
FORMULA_NAME ShieldIIPt-PT-100B-LTLFireability-04
FORMULA_NAME ShieldIIPt-PT-100B-LTLFireability-05
FORMULA_NAME ShieldIIPt-PT-100B-LTLFireability-06
FORMULA_NAME ShieldIIPt-PT-100B-LTLFireability-07
FORMULA_NAME ShieldIIPt-PT-100B-LTLFireability-08
FORMULA_NAME ShieldIIPt-PT-100B-LTLFireability-09
FORMULA_NAME ShieldIIPt-PT-100B-LTLFireability-10
FORMULA_NAME ShieldIIPt-PT-100B-LTLFireability-11
FORMULA_NAME ShieldIIPt-PT-100B-LTLFireability-12
FORMULA_NAME ShieldIIPt-PT-100B-LTLFireability-13
FORMULA_NAME ShieldIIPt-PT-100B-LTLFireability-14
FORMULA_NAME ShieldIIPt-PT-100B-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717241286155

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
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:28:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 11:28:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 11:28:07] [INFO ] Load time of PNML (sax parser for PT used): 314 ms
[2024-06-01 11:28:07] [INFO ] Transformed 7003 places.
[2024-06-01 11:28:07] [INFO ] Transformed 6503 transitions.
[2024-06-01 11:28:07] [INFO ] Found NUPN structural information;
[2024-06-01 11:28:08] [INFO ] Parsed PT model containing 7003 places and 6503 transitions and 16206 arcs in 708 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA ShieldIIPt-PT-100B-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 46 out of 7003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7003/7003 places, 6503/6503 transitions.
Discarding 1090 places :
Symmetric choice reduction at 0 with 1090 rule applications. Total rules 1090 place count 5913 transition count 5413
Iterating global reduction 0 with 1090 rules applied. Total rules applied 2180 place count 5913 transition count 5413
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2181 place count 5912 transition count 5412
Iterating global reduction 0 with 1 rules applied. Total rules applied 2182 place count 5912 transition count 5412
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2183 place count 5911 transition count 5411
Iterating global reduction 0 with 1 rules applied. Total rules applied 2184 place count 5911 transition count 5411
Applied a total of 2184 rules in 3645 ms. Remains 5911 /7003 variables (removed 1092) and now considering 5411/6503 (removed 1092) transitions.
// Phase 1: matrix 5411 rows 5911 cols
[2024-06-01 11:28:12] [INFO ] Computed 901 invariants in 70 ms
[2024-06-01 11:28:14] [INFO ] Implicit Places using invariants in 2575 ms returned []
[2024-06-01 11:28:14] [INFO ] Invariant cache hit.
[2024-06-01 11:28:21] [INFO ] Implicit Places using invariants and state equation in 7250 ms returned []
Implicit Place search using SMT with State Equation took 9863 ms to find 0 implicit places.
Running 5410 sub problems to find dead transitions.
[2024-06-01 11:28:22] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 5910/11322 variables, and 0 constraints, problems are : Problem set: 0 solved, 5410 unsolved in 30125 ms.
Refiners :[Positive P Invariants (semi-flows): 0/901 constraints, State Equation: 0/5911 constraints, PredecessorRefiner: 5410/5410 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5410 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 5910/11322 variables, and 0 constraints, problems are : Problem set: 0 solved, 5410 unsolved in 30073 ms.
Refiners :[Positive P Invariants (semi-flows): 0/901 constraints, State Equation: 0/5911 constraints, PredecessorRefiner: 0/5410 constraints, Known Traps: 0/0 constraints]
After SMT, in 63113ms problems are : Problem set: 0 solved, 5410 unsolved
Search for dead transitions found 0 dead transitions in 63180ms
Starting structural reductions in LTL mode, iteration 1 : 5911/7003 places, 5411/6503 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 76747 ms. Remains : 5911/7003 places, 5411/6503 transitions.
Support contains 46 out of 5911 places after structural reductions.
[2024-06-01 11:29:25] [INFO ] Flatten gal took : 310 ms
[2024-06-01 11:29:25] [INFO ] Flatten gal took : 189 ms
[2024-06-01 11:29:26] [INFO ] Input system was already deterministic with 5411 transitions.
RANDOM walk for 40000 steps (8 resets) in 2804 ms. (14 steps per ms) remains 20/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (8 resets) in 22 ms. (174 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 20/20 properties
[2024-06-01 11:29:27] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 397/429 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/429 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 5482/5911 variables, 869/901 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/5911 variables, 0/901 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 5411/11322 variables, 5911/6812 constraints. Problems are: Problem set: 0 solved, 20 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 Real declared 11322/11322 variables, and 6812 constraints, problems are : Problem set: 0 solved, 20 unsolved in 5016 ms.
Refiners :[Positive P Invariants (semi-flows): 901/901 constraints, State Equation: 5911/5911 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 397/429 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/429 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 5482/5911 variables, 869/901 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-06-01 11:29:34] [INFO ] Deduced a trap composed of 24 places in 695 ms of which 82 ms to minimize.
[2024-06-01 11:29:35] [INFO ] Deduced a trap composed of 28 places in 571 ms of which 11 ms to minimize.
[2024-06-01 11:29:35] [INFO ] Deduced a trap composed of 28 places in 567 ms of which 8 ms to minimize.
[2024-06-01 11:29:36] [INFO ] Deduced a trap composed of 23 places in 552 ms of which 9 ms to minimize.
[2024-06-01 11:29:37] [INFO ] Deduced a trap composed of 31 places in 530 ms of which 9 ms to minimize.
[2024-06-01 11:29:37] [INFO ] Deduced a trap composed of 25 places in 500 ms of which 9 ms to minimize.
SMT process timed out in 10324ms, After SMT, problems are : Problem set: 0 solved, 20 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 32 out of 5911 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5911/5911 places, 5411/5411 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1188 transitions
Trivial Post-agglo rules discarded 1188 transitions
Performed 1188 trivial Post agglomeration. Transition count delta: 1188
Iterating post reduction 0 with 1188 rules applied. Total rules applied 1188 place count 5911 transition count 4223
Reduce places removed 1188 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 1192 rules applied. Total rules applied 2380 place count 4723 transition count 4219
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 2384 place count 4719 transition count 4219
Performed 787 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 787 Pre rules applied. Total rules applied 2384 place count 4719 transition count 3432
Deduced a syphon composed of 787 places in 12 ms
Reduce places removed 787 places and 0 transitions.
Iterating global reduction 3 with 1574 rules applied. Total rules applied 3958 place count 3932 transition count 3432
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 3962 place count 3928 transition count 3428
Iterating global reduction 3 with 4 rules applied. Total rules applied 3966 place count 3928 transition count 3428
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 3966 place count 3928 transition count 3425
Deduced a syphon composed of 3 places in 10 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 3972 place count 3925 transition count 3425
Performed 1690 Post agglomeration using F-continuation condition.Transition count delta: 1690
Deduced a syphon composed of 1690 places in 11 ms
Reduce places removed 1690 places and 0 transitions.
Iterating global reduction 3 with 3380 rules applied. Total rules applied 7352 place count 2235 transition count 1735
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 7353 place count 2235 transition count 1734
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 12 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 7355 place count 2234 transition count 1733
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -66
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 7557 place count 2133 transition count 1799
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -66
Deduced a syphon composed of 101 places in 15 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 7759 place count 2032 transition count 1865
Performed 92 Post agglomeration using F-continuation condition.Transition count delta: -60
Deduced a syphon composed of 92 places in 7 ms
Reduce places removed 92 places and 0 transitions.
Iterating global reduction 4 with 184 rules applied. Total rules applied 7943 place count 1940 transition count 1925
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 7944 place count 1940 transition count 1924
Free-agglomeration rule applied 3 times.
Iterating global reduction 5 with 3 rules applied. Total rules applied 7947 place count 1940 transition count 1921
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 7950 place count 1937 transition count 1921
Partial Free-agglomeration rule applied 98 times.
Drop transitions (Partial Free agglomeration) removed 98 transitions
Iterating global reduction 6 with 98 rules applied. Total rules applied 8048 place count 1937 transition count 1921
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 8049 place count 1936 transition count 1920
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 8051 place count 1934 transition count 1920
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 8051 place count 1934 transition count 1919
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 8053 place count 1933 transition count 1919
Applied a total of 8053 rules in 1988 ms. Remains 1933 /5911 variables (removed 3978) and now considering 1919/5411 (removed 3492) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1989 ms. Remains : 1933/5911 places, 1919/5411 transitions.
RANDOM walk for 40000 steps (8 resets) in 1031 ms. (38 steps per ms) remains 18/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 62 ms. (63 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 64 ms. (61 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 53 ms. (74 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 139 ms. (28 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 53 ms. (74 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 55 ms. (71 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 77 ms. (51 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 70 ms. (56 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (8 resets) in 67 ms. (58 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 63 ms. (62 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 64 ms. (61 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 54 ms. (72 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 71 ms. (55 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 57 ms. (69 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 18/18 properties
// Phase 1: matrix 1919 rows 1933 cols
[2024-06-01 11:29:40] [INFO ] Computed 899 invariants in 5 ms
[2024-06-01 11:29:40] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 64/93 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 19/112 variables, 8/37 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 169/281 variables, 112/149 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/281 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (OVERLAPS) 307/588 variables, 151/300 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/588 variables, 66/366 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/588 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 10 (OVERLAPS) 8/596 variables, 8/374 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/596 variables, 8/382 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/596 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 13 (OVERLAPS) 16/612 variables, 8/390 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/612 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 15 (OVERLAPS) 379/991 variables, 196/586 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/991 variables, 86/672 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/991 variables, 0/672 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 18 (OVERLAPS) 2/993 variables, 3/675 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/993 variables, 2/677 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/993 variables, 0/677 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 21 (OVERLAPS) 2/995 variables, 1/678 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/995 variables, 0/678 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 23 (OVERLAPS) 367/1362 variables, 166/844 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1362 variables, 67/911 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1362 variables, 0/911 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 26 (OVERLAPS) 13/1375 variables, 15/926 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1375 variables, 13/939 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1375 variables, 0/939 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 29 (OVERLAPS) 22/1397 variables, 11/950 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1397 variables, 0/950 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 31 (OVERLAPS) 353/1750 variables, 192/1142 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1750 variables, 76/1218 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1750 variables, 0/1218 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 34 (OVERLAPS) 6/1756 variables, 9/1227 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/1756 variables, 6/1233 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1756 variables, 0/1233 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 37 (OVERLAPS) 6/1762 variables, 3/1236 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1762 variables, 0/1236 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 39 (OVERLAPS) 333/2095 variables, 166/1402 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/2095 variables, 57/1459 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/2095 variables, 0/1459 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 42 (OVERLAPS) 14/2109 variables, 23/1482 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/2109 variables, 14/1496 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/2109 variables, 0/1496 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 45 (OVERLAPS) 10/2119 variables, 5/1501 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/2119 variables, 0/1501 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 47 (OVERLAPS) 217/2336 variables, 126/1627 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/2336 variables, 52/1679 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/2336 variables, 0/1679 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 50 (OVERLAPS) 4/2340 variables, 6/1685 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/2340 variables, 4/1689 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/2340 variables, 0/1689 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 53 (OVERLAPS) 4/2344 variables, 2/1691 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/2344 variables, 0/1691 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 55 (OVERLAPS) 174/2518 variables, 88/1779 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/2518 variables, 30/1809 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/2518 variables, 0/1809 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 58 (OVERLAPS) 7/2525 variables, 12/1821 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/2525 variables, 7/1828 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/2525 variables, 0/1828 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 61 (OVERLAPS) 4/2529 variables, 2/1830 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/2529 variables, 0/1830 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 63 (OVERLAPS) 124/2653 variables, 68/1898 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/2653 variables, 26/1924 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/2653 variables, 0/1924 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 66 (OVERLAPS) 4/2657 variables, 6/1930 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/2657 variables, 4/1934 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/2657 variables, 0/1934 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 69 (OVERLAPS) 2/2659 variables, 1/1935 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/2659 variables, 0/1935 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 71 (OVERLAPS) 104/2763 variables, 52/1987 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/2763 variables, 19/2006 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/2763 variables, 0/2006 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 74 (OVERLAPS) 4/2767 variables, 6/2012 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/2767 variables, 4/2016 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/2767 variables, 0/2016 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 77 (OVERLAPS) 4/2771 variables, 2/2018 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/2771 variables, 0/2018 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 79 (OVERLAPS) 86/2857 variables, 46/2064 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/2857 variables, 19/2083 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/2857 variables, 0/2083 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 82 (OVERLAPS) 1/2858 variables, 2/2085 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/2858 variables, 1/2086 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/2858 variables, 0/2086 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 85 (OVERLAPS) 95/2953 variables, 44/2130 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/2953 variables, 16/2146 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/2953 variables, 0/2146 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 88 (OVERLAPS) 4/2957 variables, 6/2152 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/2957 variables, 4/2156 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/2957 variables, 0/2156 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 91 (OVERLAPS) 4/2961 variables, 2/2158 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/2961 variables, 0/2158 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 93 (OVERLAPS) 86/3047 variables, 46/2204 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 94 (INCLUDED_ONLY) 0/3047 variables, 19/2223 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 95 (INCLUDED_ONLY) 0/3047 variables, 0/2223 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 96 (OVERLAPS) 1/3048 variables, 2/2225 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 97 (INCLUDED_ONLY) 0/3048 variables, 1/2226 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/3048 variables, 0/2226 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 99 (OVERLAPS) 87/3135 variables, 42/2268 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 100 (INCLUDED_ONLY) 0/3135 variables, 15/2283 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 101 (INCLUDED_ONLY) 0/3135 variables, 0/2283 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 102 (OVERLAPS) 4/3139 variables, 6/2289 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 103 (INCLUDED_ONLY) 0/3139 variables, 4/2293 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 104 (INCLUDED_ONLY) 0/3139 variables, 0/2293 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 105 (OVERLAPS) 4/3143 variables, 2/2295 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 106 (INCLUDED_ONLY) 0/3143 variables, 0/2295 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 107 (OVERLAPS) 62/3205 variables, 36/2331 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 108 (INCLUDED_ONLY) 0/3205 variables, 14/2345 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 109 (INCLUDED_ONLY) 0/3205 variables, 0/2345 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 110 (OVERLAPS) 1/3206 variables, 2/2347 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 111 (INCLUDED_ONLY) 0/3206 variables, 1/2348 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 112 (INCLUDED_ONLY) 0/3206 variables, 0/2348 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 113 (OVERLAPS) 56/3262 variables, 26/2374 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 114 (INCLUDED_ONLY) 0/3262 variables, 10/2384 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 115 (INCLUDED_ONLY) 0/3262 variables, 0/2384 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 116 (OVERLAPS) 3/3265 variables, 3/2387 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 117 (INCLUDED_ONLY) 0/3265 variables, 1/2388 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 118 (INCLUDED_ONLY) 0/3265 variables, 0/2388 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 119 (OVERLAPS) 2/3267 variables, 1/2389 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 120 (INCLUDED_ONLY) 0/3267 variables, 0/2389 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 121 (OVERLAPS) 56/3323 variables, 31/2420 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 122 (INCLUDED_ONLY) 0/3323 variables, 11/2431 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 123 (INCLUDED_ONLY) 0/3323 variables, 0/2431 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 124 (OVERLAPS) 1/3324 variables, 2/2433 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 125 (INCLUDED_ONLY) 0/3324 variables, 1/2434 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 126 (INCLUDED_ONLY) 0/3324 variables, 0/2434 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 127 (OVERLAPS) 56/3380 variables, 26/2460 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 128 (INCLUDED_ONLY) 0/3380 variables, 10/2470 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 129 (INCLUDED_ONLY) 0/3380 variables, 0/2470 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 130 (OVERLAPS) 2/3382 variables, 3/2473 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 131 (INCLUDED_ONLY) 0/3382 variables, 2/2475 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 132 (INCLUDED_ONLY) 0/3382 variables, 0/2475 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 133 (OVERLAPS) 2/3384 variables, 1/2476 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 134 (INCLUDED_ONLY) 0/3384 variables, 0/2476 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 135 (OVERLAPS) 53/3437 variables, 28/2504 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 136 (INCLUDED_ONLY) 0/3437 variables, 11/2515 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 137 (INCLUDED_ONLY) 0/3437 variables, 0/2515 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 138 (OVERLAPS) 1/3438 variables, 2/2517 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 139 (INCLUDED_ONLY) 0/3438 variables, 1/2518 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 140 (INCLUDED_ONLY) 0/3438 variables, 0/2518 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 141 (OVERLAPS) 56/3494 variables, 26/2544 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 142 (INCLUDED_ONLY) 0/3494 variables, 10/2554 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 143 (INCLUDED_ONLY) 0/3494 variables, 0/2554 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 144 (OVERLAPS) 2/3496 variables, 3/2557 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 145 (INCLUDED_ONLY) 0/3496 variables, 2/2559 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 146 (INCLUDED_ONLY) 0/3496 variables, 0/2559 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 147 (OVERLAPS) 2/3498 variables, 1/2560 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 148 (INCLUDED_ONLY) 0/3498 variables, 0/2560 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 149 (OVERLAPS) 53/3551 variables, 28/2588 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 150 (INCLUDED_ONLY) 0/3551 variables, 11/2599 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 151 (INCLUDED_ONLY) 0/3551 variables, 0/2599 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 152 (OVERLAPS) 1/3552 variables, 2/2601 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 153 (INCLUDED_ONLY) 0/3552 variables, 1/2602 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 154 (INCLUDED_ONLY) 0/3552 variables, 0/2602 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 155 (OVERLAPS) 56/3608 variables, 26/2628 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 156 (INCLUDED_ONLY) 0/3608 variables, 10/2638 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 157 (INCLUDED_ONLY) 0/3608 variables, 0/2638 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 158 (OVERLAPS) 2/3610 variables, 3/2641 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 159 (INCLUDED_ONLY) 0/3610 variables, 2/2643 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 160 (INCLUDED_ONLY) 0/3610 variables, 0/2643 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 161 (OVERLAPS) 2/3612 variables, 1/2644 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 162 (INCLUDED_ONLY) 0/3612 variables, 0/2644 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 163 (OVERLAPS) 53/3665 variables, 28/2672 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 164 (INCLUDED_ONLY) 0/3665 variables, 11/2683 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 165 (INCLUDED_ONLY) 0/3665 variables, 0/2683 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 166 (OVERLAPS) 1/3666 variables, 2/2685 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 167 (INCLUDED_ONLY) 0/3666 variables, 1/2686 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 168 (INCLUDED_ONLY) 0/3666 variables, 0/2686 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 169 (OVERLAPS) 52/3718 variables, 26/2712 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 170 (INCLUDED_ONLY) 0/3718 variables, 10/2722 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 171 (INCLUDED_ONLY) 0/3718 variables, 0/2722 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 172 (OVERLAPS) 2/3720 variables, 3/2725 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 173 (INCLUDED_ONLY) 0/3720 variables, 2/2727 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 174 (INCLUDED_ONLY) 0/3720 variables, 0/2727 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 175 (OVERLAPS) 2/3722 variables, 1/2728 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 176 (INCLUDED_ONLY) 0/3722 variables, 0/2728 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 177 (OVERLAPS) 30/3752 variables, 18/2746 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 178 (INCLUDED_ONLY) 0/3752 variables, 6/2752 constraints. Problems are: Problem set: 0 solved, 18 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3752/3852 variables, and 2752 constraints, problems are : Problem set: 0 solved, 18 unsolved in 45009 ms.
Refiners :[Positive P Invariants (semi-flows): 872/899 constraints, State Equation: 1880/1933 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 64/93 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 19/112 variables, 8/37 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 169/281 variables, 112/149 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/281 variables, 10/159 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/281 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (OVERLAPS) 307/588 variables, 151/310 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/588 variables, 66/376 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/588 variables, 8/384 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-06-01 11:30:26] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/588 variables, 1/385 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/588 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 13 (OVERLAPS) 8/596 variables, 8/393 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/596 variables, 8/401 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/596 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 16 (OVERLAPS) 16/612 variables, 8/409 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/612 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 18 (OVERLAPS) 379/991 variables, 196/605 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/991 variables, 86/691 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/991 variables, 0/691 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 21 (OVERLAPS) 2/993 variables, 3/694 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/993 variables, 2/696 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/993 variables, 0/696 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 24 (OVERLAPS) 2/995 variables, 1/697 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/995 variables, 0/697 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 26 (OVERLAPS) 367/1362 variables, 166/863 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1362 variables, 67/930 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1362 variables, 0/930 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 29 (OVERLAPS) 13/1375 variables, 15/945 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1375 variables, 13/958 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1375 variables, 0/958 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 32 (OVERLAPS) 22/1397 variables, 11/969 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1397 variables, 0/969 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 34 (OVERLAPS) 353/1750 variables, 192/1161 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/1750 variables, 76/1237 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1750 variables, 0/1237 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 37 (OVERLAPS) 6/1756 variables, 9/1246 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1756 variables, 6/1252 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/1756 variables, 0/1252 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 40 (OVERLAPS) 6/1762 variables, 3/1255 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/1762 variables, 0/1255 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 42 (OVERLAPS) 333/2095 variables, 166/1421 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/2095 variables, 57/1478 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/2095 variables, 0/1478 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 45 (OVERLAPS) 14/2109 variables, 23/1501 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/2109 variables, 14/1515 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/2109 variables, 0/1515 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 48 (OVERLAPS) 10/2119 variables, 5/1520 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/2119 variables, 0/1520 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 50 (OVERLAPS) 217/2336 variables, 126/1646 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/2336 variables, 52/1698 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/2336 variables, 0/1698 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 53 (OVERLAPS) 4/2340 variables, 6/1704 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/2340 variables, 4/1708 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/2340 variables, 0/1708 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 56 (OVERLAPS) 4/2344 variables, 2/1710 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/2344 variables, 0/1710 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 58 (OVERLAPS) 174/2518 variables, 88/1798 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/2518 variables, 30/1828 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/2518 variables, 0/1828 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 61 (OVERLAPS) 7/2525 variables, 12/1840 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/2525 variables, 7/1847 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/2525 variables, 0/1847 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 64 (OVERLAPS) 4/2529 variables, 2/1849 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/2529 variables, 0/1849 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 66 (OVERLAPS) 124/2653 variables, 68/1917 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/2653 variables, 26/1943 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/2653 variables, 0/1943 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 69 (OVERLAPS) 4/2657 variables, 6/1949 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/2657 variables, 4/1953 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/2657 variables, 0/1953 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 72 (OVERLAPS) 2/2659 variables, 1/1954 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/2659 variables, 0/1954 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 74 (OVERLAPS) 104/2763 variables, 52/2006 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/2763 variables, 19/2025 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/2763 variables, 0/2025 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 77 (OVERLAPS) 4/2767 variables, 6/2031 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/2767 variables, 4/2035 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/2767 variables, 0/2035 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 80 (OVERLAPS) 4/2771 variables, 2/2037 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/2771 variables, 0/2037 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 82 (OVERLAPS) 86/2857 variables, 46/2083 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/2857 variables, 19/2102 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/2857 variables, 0/2102 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 85 (OVERLAPS) 1/2858 variables, 2/2104 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/2858 variables, 1/2105 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/2858 variables, 0/2105 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 88 (OVERLAPS) 95/2953 variables, 44/2149 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/2953 variables, 16/2165 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/2953 variables, 0/2165 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 91 (OVERLAPS) 4/2957 variables, 6/2171 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/2957 variables, 4/2175 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 93 (INCLUDED_ONLY) 0/2957 variables, 0/2175 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 94 (OVERLAPS) 4/2961 variables, 2/2177 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 95 (INCLUDED_ONLY) 0/2961 variables, 0/2177 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 96 (OVERLAPS) 86/3047 variables, 46/2223 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 97 (INCLUDED_ONLY) 0/3047 variables, 19/2242 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/3047 variables, 0/2242 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 99 (OVERLAPS) 1/3048 variables, 2/2244 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 100 (INCLUDED_ONLY) 0/3048 variables, 1/2245 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 101 (INCLUDED_ONLY) 0/3048 variables, 0/2245 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 102 (OVERLAPS) 87/3135 variables, 42/2287 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 103 (INCLUDED_ONLY) 0/3135 variables, 15/2302 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 104 (INCLUDED_ONLY) 0/3135 variables, 0/2302 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 105 (OVERLAPS) 4/3139 variables, 6/2308 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 106 (INCLUDED_ONLY) 0/3139 variables, 4/2312 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 107 (INCLUDED_ONLY) 0/3139 variables, 0/2312 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 108 (OVERLAPS) 4/3143 variables, 2/2314 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 109 (INCLUDED_ONLY) 0/3143 variables, 0/2314 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 110 (OVERLAPS) 62/3205 variables, 36/2350 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 111 (INCLUDED_ONLY) 0/3205 variables, 14/2364 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 112 (INCLUDED_ONLY) 0/3205 variables, 0/2364 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 113 (OVERLAPS) 1/3206 variables, 2/2366 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 114 (INCLUDED_ONLY) 0/3206 variables, 1/2367 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 115 (INCLUDED_ONLY) 0/3206 variables, 0/2367 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 116 (OVERLAPS) 56/3262 variables, 26/2393 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 117 (INCLUDED_ONLY) 0/3262 variables, 10/2403 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 118 (INCLUDED_ONLY) 0/3262 variables, 0/2403 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 119 (OVERLAPS) 3/3265 variables, 3/2406 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 120 (INCLUDED_ONLY) 0/3265 variables, 1/2407 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 121 (INCLUDED_ONLY) 0/3265 variables, 0/2407 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 122 (OVERLAPS) 2/3267 variables, 1/2408 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 123 (INCLUDED_ONLY) 0/3267 variables, 0/2408 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 124 (OVERLAPS) 56/3323 variables, 31/2439 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 125 (INCLUDED_ONLY) 0/3323 variables, 11/2450 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 126 (INCLUDED_ONLY) 0/3323 variables, 0/2450 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 127 (OVERLAPS) 1/3324 variables, 2/2452 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 128 (INCLUDED_ONLY) 0/3324 variables, 1/2453 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 129 (INCLUDED_ONLY) 0/3324 variables, 0/2453 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 130 (OVERLAPS) 56/3380 variables, 26/2479 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 131 (INCLUDED_ONLY) 0/3380 variables, 10/2489 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 132 (INCLUDED_ONLY) 0/3380 variables, 0/2489 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 133 (OVERLAPS) 2/3382 variables, 3/2492 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 134 (INCLUDED_ONLY) 0/3382 variables, 2/2494 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 135 (INCLUDED_ONLY) 0/3382 variables, 0/2494 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 136 (OVERLAPS) 2/3384 variables, 1/2495 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 137 (INCLUDED_ONLY) 0/3384 variables, 0/2495 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 138 (OVERLAPS) 53/3437 variables, 28/2523 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 139 (INCLUDED_ONLY) 0/3437 variables, 11/2534 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 140 (INCLUDED_ONLY) 0/3437 variables, 0/2534 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 141 (OVERLAPS) 1/3438 variables, 2/2536 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 142 (INCLUDED_ONLY) 0/3438 variables, 1/2537 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 143 (INCLUDED_ONLY) 0/3438 variables, 0/2537 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 144 (OVERLAPS) 56/3494 variables, 26/2563 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 145 (INCLUDED_ONLY) 0/3494 variables, 10/2573 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 146 (INCLUDED_ONLY) 0/3494 variables, 0/2573 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 147 (OVERLAPS) 2/3496 variables, 3/2576 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 148 (INCLUDED_ONLY) 0/3496 variables, 2/2578 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 149 (INCLUDED_ONLY) 0/3496 variables, 0/2578 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 150 (OVERLAPS) 2/3498 variables, 1/2579 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 151 (INCLUDED_ONLY) 0/3498 variables, 0/2579 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 152 (OVERLAPS) 53/3551 variables, 28/2607 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 153 (INCLUDED_ONLY) 0/3551 variables, 11/2618 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 154 (INCLUDED_ONLY) 0/3551 variables, 0/2618 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 155 (OVERLAPS) 1/3552 variables, 2/2620 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 156 (INCLUDED_ONLY) 0/3552 variables, 1/2621 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 157 (INCLUDED_ONLY) 0/3552 variables, 0/2621 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 158 (OVERLAPS) 56/3608 variables, 26/2647 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 159 (INCLUDED_ONLY) 0/3608 variables, 10/2657 constraints. Problems are: Problem set: 0 solved, 18 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3608/3852 variables, and 2657 constraints, problems are : Problem set: 0 solved, 18 unsolved in 45009 ms.
Refiners :[Positive P Invariants (semi-flows): 835/899 constraints, State Equation: 1803/1933 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 1/1 constraints]
After SMT, in 90050ms problems are : Problem set: 0 solved, 18 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 29 out of 1933 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1933/1933 places, 1919/1919 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1933 transition count 1918
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1932 transition count 1918
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 6 place count 1930 transition count 1916
Applied a total of 6 rules in 120 ms. Remains 1930 /1933 variables (removed 3) and now considering 1916/1919 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 120 ms. Remains : 1930/1933 places, 1916/1919 transitions.
Computed a total of 1600 stabilizing places and 1600 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 5911 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5911/5911 places, 5411/5411 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1201 transitions
Trivial Post-agglo rules discarded 1201 transitions
Performed 1201 trivial Post agglomeration. Transition count delta: 1201
Iterating post reduction 0 with 1201 rules applied. Total rules applied 1201 place count 5910 transition count 4209
Reduce places removed 1201 places and 0 transitions.
Iterating post reduction 1 with 1201 rules applied. Total rules applied 2402 place count 4709 transition count 4209
Performed 795 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 795 Pre rules applied. Total rules applied 2402 place count 4709 transition count 3414
Deduced a syphon composed of 795 places in 10 ms
Reduce places removed 795 places and 0 transitions.
Iterating global reduction 2 with 1590 rules applied. Total rules applied 3992 place count 3914 transition count 3414
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 3999 place count 3907 transition count 3407
Iterating global reduction 2 with 7 rules applied. Total rules applied 4006 place count 3907 transition count 3407
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 4006 place count 3907 transition count 3402
Deduced a syphon composed of 5 places in 10 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 4016 place count 3902 transition count 3402
Performed 1699 Post agglomeration using F-continuation condition.Transition count delta: 1699
Deduced a syphon composed of 1699 places in 4 ms
Reduce places removed 1699 places and 0 transitions.
Iterating global reduction 2 with 3398 rules applied. Total rules applied 7414 place count 2203 transition count 1703
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7415 place count 2203 transition count 1702
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 7417 place count 2202 transition count 1701
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -67
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 7619 place count 2101 transition count 1768
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -66
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 7821 place count 2000 transition count 1834
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: -65
Deduced a syphon composed of 96 places in 4 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 3 with 192 rules applied. Total rules applied 8013 place count 1904 transition count 1899
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 8015 place count 1902 transition count 1897
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 8017 place count 1900 transition count 1897
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 8017 place count 1900 transition count 1896
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 8019 place count 1899 transition count 1896
Applied a total of 8019 rules in 1761 ms. Remains 1899 /5911 variables (removed 4012) and now considering 1896/5411 (removed 3515) transitions.
// Phase 1: matrix 1896 rows 1899 cols
[2024-06-01 11:31:12] [INFO ] Computed 899 invariants in 13 ms
[2024-06-01 11:31:13] [INFO ] Implicit Places using invariants in 1152 ms returned [1888]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1155 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1898/5911 places, 1896/5411 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1897 transition count 1895
Applied a total of 2 rules in 119 ms. Remains 1897 /1898 variables (removed 1) and now considering 1895/1896 (removed 1) transitions.
// Phase 1: matrix 1895 rows 1897 cols
[2024-06-01 11:31:14] [INFO ] Computed 898 invariants in 14 ms
[2024-06-01 11:31:15] [INFO ] Implicit Places using invariants in 1172 ms returned []
[2024-06-01 11:31:15] [INFO ] Invariant cache hit.
[2024-06-01 11:31:17] [INFO ] Implicit Places using invariants and state equation in 2274 ms returned []
Implicit Place search using SMT with State Equation took 3451 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1897/5911 places, 1895/5411 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 6487 ms. Remains : 1897/5911 places, 1895/5411 transitions.
Stuttering acceptance computed with spot in 155 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-100B-LTLFireability-00
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 2 ms.
FORMULA ShieldIIPt-PT-100B-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-100B-LTLFireability-00 finished in 6708 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1)&&F(G(p2)))))'
Support contains 3 out of 5911 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5911/5911 places, 5411/5411 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1199 transitions
Trivial Post-agglo rules discarded 1199 transitions
Performed 1199 trivial Post agglomeration. Transition count delta: 1199
Iterating post reduction 0 with 1199 rules applied. Total rules applied 1199 place count 5910 transition count 4211
Reduce places removed 1199 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 1200 rules applied. Total rules applied 2399 place count 4711 transition count 4210
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2400 place count 4710 transition count 4210
Performed 796 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 796 Pre rules applied. Total rules applied 2400 place count 4710 transition count 3414
Deduced a syphon composed of 796 places in 10 ms
Reduce places removed 796 places and 0 transitions.
Iterating global reduction 3 with 1592 rules applied. Total rules applied 3992 place count 3914 transition count 3414
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 3999 place count 3907 transition count 3407
Iterating global reduction 3 with 7 rules applied. Total rules applied 4006 place count 3907 transition count 3407
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 4006 place count 3907 transition count 3402
Deduced a syphon composed of 5 places in 10 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 4016 place count 3902 transition count 3402
Performed 1694 Post agglomeration using F-continuation condition.Transition count delta: 1694
Deduced a syphon composed of 1694 places in 4 ms
Reduce places removed 1694 places and 0 transitions.
Iterating global reduction 3 with 3388 rules applied. Total rules applied 7404 place count 2208 transition count 1708
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 7405 place count 2208 transition count 1707
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 7407 place count 2207 transition count 1706
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -66
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 7609 place count 2106 transition count 1772
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -68
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 7811 place count 2005 transition count 1840
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: -65
Deduced a syphon composed of 97 places in 5 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 4 with 194 rules applied. Total rules applied 8005 place count 1908 transition count 1905
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 8007 place count 1906 transition count 1903
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 8009 place count 1904 transition count 1903
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 8009 place count 1904 transition count 1902
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 8011 place count 1903 transition count 1902
Applied a total of 8011 rules in 1694 ms. Remains 1903 /5911 variables (removed 4008) and now considering 1902/5411 (removed 3509) transitions.
// Phase 1: matrix 1902 rows 1903 cols
[2024-06-01 11:31:19] [INFO ] Computed 899 invariants in 11 ms
[2024-06-01 11:31:20] [INFO ] Implicit Places using invariants in 1102 ms returned [1892]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1106 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1902/5911 places, 1902/5411 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1901 transition count 1901
Applied a total of 2 rules in 111 ms. Remains 1901 /1902 variables (removed 1) and now considering 1901/1902 (removed 1) transitions.
// Phase 1: matrix 1901 rows 1901 cols
[2024-06-01 11:31:20] [INFO ] Computed 898 invariants in 10 ms
[2024-06-01 11:31:21] [INFO ] Implicit Places using invariants in 1080 ms returned []
[2024-06-01 11:31:21] [INFO ] Invariant cache hit.
[2024-06-01 11:31:22] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-06-01 11:31:24] [INFO ] Implicit Places using invariants and state equation in 2857 ms returned []
Implicit Place search using SMT with State Equation took 3941 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1901/5911 places, 1901/5411 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 6853 ms. Remains : 1901/5911 places, 1901/5411 transitions.
Stuttering acceptance computed with spot in 207 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2)]
Running random walk in product with property : ShieldIIPt-PT-100B-LTLFireability-01
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA ShieldIIPt-PT-100B-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-100B-LTLFireability-01 finished in 7100 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 5911 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5911/5911 places, 5411/5411 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1200 transitions
Trivial Post-agglo rules discarded 1200 transitions
Performed 1200 trivial Post agglomeration. Transition count delta: 1200
Iterating post reduction 0 with 1200 rules applied. Total rules applied 1200 place count 5910 transition count 4210
Reduce places removed 1200 places and 0 transitions.
Iterating post reduction 1 with 1200 rules applied. Total rules applied 2400 place count 4710 transition count 4210
Performed 795 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 795 Pre rules applied. Total rules applied 2400 place count 4710 transition count 3415
Deduced a syphon composed of 795 places in 10 ms
Reduce places removed 795 places and 0 transitions.
Iterating global reduction 2 with 1590 rules applied. Total rules applied 3990 place count 3915 transition count 3415
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 3996 place count 3909 transition count 3409
Iterating global reduction 2 with 6 rules applied. Total rules applied 4002 place count 3909 transition count 3409
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 4002 place count 3909 transition count 3404
Deduced a syphon composed of 5 places in 10 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 4012 place count 3904 transition count 3404
Performed 1700 Post agglomeration using F-continuation condition.Transition count delta: 1700
Deduced a syphon composed of 1700 places in 4 ms
Reduce places removed 1700 places and 0 transitions.
Iterating global reduction 2 with 3400 rules applied. Total rules applied 7412 place count 2204 transition count 1704
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7413 place count 2204 transition count 1703
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 7415 place count 2203 transition count 1702
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -66
Deduced a syphon composed of 101 places in 3 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 7617 place count 2102 transition count 1768
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -68
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 7819 place count 2001 transition count 1836
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: -65
Deduced a syphon composed of 97 places in 4 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 3 with 194 rules applied. Total rules applied 8013 place count 1904 transition count 1901
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 8015 place count 1902 transition count 1899
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 8017 place count 1900 transition count 1899
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 8017 place count 1900 transition count 1898
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 8019 place count 1899 transition count 1898
Applied a total of 8019 rules in 1642 ms. Remains 1899 /5911 variables (removed 4012) and now considering 1898/5411 (removed 3513) transitions.
// Phase 1: matrix 1898 rows 1899 cols
[2024-06-01 11:31:26] [INFO ] Computed 899 invariants in 10 ms
[2024-06-01 11:31:27] [INFO ] Implicit Places using invariants in 1098 ms returned [1888]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1100 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1898/5911 places, 1898/5411 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1897 transition count 1897
Applied a total of 2 rules in 113 ms. Remains 1897 /1898 variables (removed 1) and now considering 1897/1898 (removed 1) transitions.
// Phase 1: matrix 1897 rows 1897 cols
[2024-06-01 11:31:27] [INFO ] Computed 898 invariants in 10 ms
[2024-06-01 11:31:28] [INFO ] Implicit Places using invariants in 1096 ms returned []
[2024-06-01 11:31:28] [INFO ] Invariant cache hit.
[2024-06-01 11:31:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 11:31:31] [INFO ] Implicit Places using invariants and state equation in 2455 ms returned []
Implicit Place search using SMT with State Equation took 3562 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1897/5911 places, 1897/5411 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 6417 ms. Remains : 1897/5911 places, 1897/5411 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-100B-LTLFireability-02
Product exploration explored 100000 steps with 0 reset in 1465 ms.
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA ShieldIIPt-PT-100B-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-100B-LTLFireability-02 finished in 7958 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U (p1&&G(!p2))))'
Support contains 5 out of 5911 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5911/5911 places, 5411/5411 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1200 transitions
Trivial Post-agglo rules discarded 1200 transitions
Performed 1200 trivial Post agglomeration. Transition count delta: 1200
Iterating post reduction 0 with 1200 rules applied. Total rules applied 1200 place count 5910 transition count 4210
Reduce places removed 1200 places and 0 transitions.
Iterating post reduction 1 with 1200 rules applied. Total rules applied 2400 place count 4710 transition count 4210
Performed 794 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 794 Pre rules applied. Total rules applied 2400 place count 4710 transition count 3416
Deduced a syphon composed of 794 places in 10 ms
Reduce places removed 794 places and 0 transitions.
Iterating global reduction 2 with 1588 rules applied. Total rules applied 3988 place count 3916 transition count 3416
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 3994 place count 3910 transition count 3410
Iterating global reduction 2 with 6 rules applied. Total rules applied 4000 place count 3910 transition count 3410
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 4000 place count 3910 transition count 3406
Deduced a syphon composed of 4 places in 11 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 4008 place count 3906 transition count 3406
Performed 1698 Post agglomeration using F-continuation condition.Transition count delta: 1698
Deduced a syphon composed of 1698 places in 4 ms
Reduce places removed 1698 places and 0 transitions.
Iterating global reduction 2 with 3396 rules applied. Total rules applied 7404 place count 2208 transition count 1708
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7405 place count 2208 transition count 1707
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 7407 place count 2207 transition count 1706
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -66
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 7609 place count 2106 transition count 1772
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -68
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 7811 place count 2005 transition count 1840
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: -65
Deduced a syphon composed of 97 places in 5 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 3 with 194 rules applied. Total rules applied 8005 place count 1908 transition count 1905
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 8007 place count 1906 transition count 1903
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 8009 place count 1904 transition count 1903
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 8009 place count 1904 transition count 1902
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 8011 place count 1903 transition count 1902
Applied a total of 8011 rules in 1630 ms. Remains 1903 /5911 variables (removed 4008) and now considering 1902/5411 (removed 3509) transitions.
// Phase 1: matrix 1902 rows 1903 cols
[2024-06-01 11:31:34] [INFO ] Computed 899 invariants in 8 ms
[2024-06-01 11:31:35] [INFO ] Implicit Places using invariants in 1059 ms returned [1892]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1061 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1902/5911 places, 1902/5411 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1901 transition count 1901
Applied a total of 2 rules in 109 ms. Remains 1901 /1902 variables (removed 1) and now considering 1901/1902 (removed 1) transitions.
// Phase 1: matrix 1901 rows 1901 cols
[2024-06-01 11:31:35] [INFO ] Computed 898 invariants in 7 ms
[2024-06-01 11:31:36] [INFO ] Implicit Places using invariants in 1060 ms returned []
[2024-06-01 11:31:36] [INFO ] Invariant cache hit.
[2024-06-01 11:31:37] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-06-01 11:31:39] [INFO ] Implicit Places using invariants and state equation in 2407 ms returned []
Implicit Place search using SMT with State Equation took 3469 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1901/5911 places, 1901/5411 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 6271 ms. Remains : 1901/5911 places, 1901/5411 transitions.
Stuttering acceptance computed with spot in 146 ms :[(OR (NOT p1) p2), (NOT p0), p2]
Running random walk in product with property : ShieldIIPt-PT-100B-LTLFireability-03
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-100B-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-100B-LTLFireability-03 finished in 6454 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(F(p0)))||G(p1))))'
Support contains 2 out of 5911 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5911/5911 places, 5411/5411 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 5902 transition count 5402
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 5902 transition count 5402
Applied a total of 18 rules in 1982 ms. Remains 5902 /5911 variables (removed 9) and now considering 5402/5411 (removed 9) transitions.
// Phase 1: matrix 5402 rows 5902 cols
[2024-06-01 11:31:41] [INFO ] Computed 901 invariants in 21 ms
[2024-06-01 11:31:43] [INFO ] Implicit Places using invariants in 2058 ms returned []
[2024-06-01 11:31:43] [INFO ] Invariant cache hit.
[2024-06-01 11:31:50] [INFO ] Implicit Places using invariants and state equation in 7251 ms returned []
Implicit Place search using SMT with State Equation took 9335 ms to find 0 implicit places.
Running 5401 sub problems to find dead transitions.
[2024-06-01 11:31:50] [INFO ] Invariant cache hit.
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 Real declared 5901/11304 variables, and 0 constraints, problems are : Problem set: 0 solved, 5401 unsolved in 30074 ms.
Refiners :[Positive P Invariants (semi-flows): 0/901 constraints, State Equation: 0/5902 constraints, PredecessorRefiner: 5401/5401 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5401 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 5901/11304 variables, and 0 constraints, problems are : Problem set: 0 solved, 5401 unsolved in 30062 ms.
Refiners :[Positive P Invariants (semi-flows): 0/901 constraints, State Equation: 0/5902 constraints, PredecessorRefiner: 0/5401 constraints, Known Traps: 0/0 constraints]
After SMT, in 62954ms problems are : Problem set: 0 solved, 5401 unsolved
Search for dead transitions found 0 dead transitions in 63040ms
Starting structural reductions in LTL mode, iteration 1 : 5902/5911 places, 5402/5411 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 74370 ms. Remains : 5902/5911 places, 5402/5411 transitions.
Stuttering acceptance computed with spot in 225 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPt-PT-100B-LTLFireability-04
Product exploration explored 100000 steps with 45 reset in 1017 ms.
Product exploration explored 100000 steps with 45 reset in 1169 ms.
Computed a total of 1598 stabilizing places and 1598 stable transitions
Computed a total of 1598 stabilizing places and 1598 stable transitions
Detected a total of 1598/5902 stabilizing places and 1598/5402 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p1)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 107 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 8448 steps (0 resets) in 128 ms. (65 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p1)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 119 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 135 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 140 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
[2024-06-01 11:32:57] [INFO ] Invariant cache hit.
[2024-06-01 11:33:05] [INFO ] [Real]Absence check using 901 positive place invariants in 4175 ms returned sat
[2024-06-01 11:33:12] [INFO ] [Real]Absence check using state equation in 6646 ms returned unknown
Could not prove EG (NOT p0)
Support contains 1 out of 5902 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 5902/5902 places, 5402/5402 transitions.
Applied a total of 0 rules in 964 ms. Remains 5902 /5902 variables (removed 0) and now considering 5402/5402 (removed 0) transitions.
[2024-06-01 11:33:13] [INFO ] Invariant cache hit.
[2024-06-01 11:33:15] [INFO ] Implicit Places using invariants in 2300 ms returned []
[2024-06-01 11:33:15] [INFO ] Invariant cache hit.
[2024-06-01 11:33:22] [INFO ] Implicit Places using invariants and state equation in 7373 ms returned []
Implicit Place search using SMT with State Equation took 9676 ms to find 0 implicit places.
Running 5401 sub problems to find dead transitions.
[2024-06-01 11:33:22] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 5901/11304 variables, and 0 constraints, problems are : Problem set: 0 solved, 5401 unsolved in 30067 ms.
Refiners :[Positive P Invariants (semi-flows): 0/901 constraints, State Equation: 0/5902 constraints, PredecessorRefiner: 5401/5401 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5401 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 5901/11304 variables, and 0 constraints, problems are : Problem set: 0 solved, 5401 unsolved in 30064 ms.
Refiners :[Positive P Invariants (semi-flows): 0/901 constraints, State Equation: 0/5902 constraints, PredecessorRefiner: 0/5401 constraints, Known Traps: 0/0 constraints]
After SMT, in 62623ms problems are : Problem set: 0 solved, 5401 unsolved
Search for dead transitions found 0 dead transitions in 62668ms
Finished structural reductions in LTL mode , in 1 iterations and 73323 ms. Remains : 5902/5902 places, 5402/5402 transitions.
Computed a total of 1598 stabilizing places and 1598 stable transitions
Computed a total of 1598 stabilizing places and 1598 stable transitions
Detected a total of 1598/5902 stabilizing places and 1598/5402 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 85 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 168 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 8682 steps (0 resets) in 160 ms. (53 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 100 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 236 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 156 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
[2024-06-01 11:34:26] [INFO ] Invariant cache hit.
[2024-06-01 11:34:34] [INFO ] [Real]Absence check using 901 positive place invariants in 4178 ms returned sat
[2024-06-01 11:34:41] [INFO ] [Real]Absence check using state equation in 6914 ms returned unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 154 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 46 reset in 970 ms.
Product exploration explored 100000 steps with 46 reset in 1174 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 159 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 5902 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5902/5902 places, 5402/5402 transitions.
Performed 1197 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1197 rules applied. Total rules applied 1197 place count 5902 transition count 5402
Performed 402 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 402 Pre rules applied. Total rules applied 1197 place count 5902 transition count 5704
Deduced a syphon composed of 1599 places in 16 ms
Iterating global reduction 1 with 402 rules applied. Total rules applied 1599 place count 5902 transition count 5704
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 1600 place count 5901 transition count 5703
Deduced a syphon composed of 1599 places in 22 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 1601 place count 5901 transition count 5703
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 1601 place count 5901 transition count 5704
Deduced a syphon composed of 1600 places in 16 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 1602 place count 5901 transition count 5704
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 1603 place count 5900 transition count 5702
Deduced a syphon composed of 1599 places in 14 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 1604 place count 5900 transition count 5702
Performed 1998 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3597 places in 10 ms
Iterating global reduction 1 with 1998 rules applied. Total rules applied 3602 place count 5900 transition count 5702
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3603 place count 5900 transition count 5701
Renaming transitions due to excessive name length > 1024 char.
Discarding 798 places :
Symmetric choice reduction at 2 with 798 rule applications. Total rules 4401 place count 5102 transition count 4903
Deduced a syphon composed of 2799 places in 10 ms
Iterating global reduction 2 with 798 rules applied. Total rules applied 5199 place count 5102 transition count 4903
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2800 places in 10 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 5200 place count 5102 transition count 4903
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 5202 place count 5100 transition count 4901
Deduced a syphon composed of 2798 places in 9 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 5204 place count 5100 transition count 4901
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -530
Deduced a syphon composed of 2899 places in 12 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 5305 place count 5100 transition count 5431
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 5406 place count 4999 transition count 5229
Deduced a syphon composed of 2798 places in 11 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 5507 place count 4999 transition count 5229
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -526
Deduced a syphon composed of 2899 places in 12 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 5608 place count 4999 transition count 5755
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 5709 place count 4898 transition count 5553
Deduced a syphon composed of 2798 places in 12 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 5810 place count 4898 transition count 5553
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -530
Deduced a syphon composed of 2899 places in 12 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 5911 place count 4898 transition count 6083
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 6012 place count 4797 transition count 5881
Deduced a syphon composed of 2798 places in 11 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 6113 place count 4797 transition count 5881
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: -512
Deduced a syphon composed of 2894 places in 14 ms
Iterating global reduction 2 with 96 rules applied. Total rules applied 6209 place count 4797 transition count 6393
Discarding 96 places :
Symmetric choice reduction at 2 with 96 rule applications. Total rules 6305 place count 4701 transition count 6201
Deduced a syphon composed of 2798 places in 13 ms
Iterating global reduction 2 with 96 rules applied. Total rules applied 6401 place count 4701 transition count 6201
Deduced a syphon composed of 2798 places in 12 ms
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 2 with 9 rules applied. Total rules applied 6410 place count 4701 transition count 6192
Deduced a syphon composed of 2798 places in 13 ms
Applied a total of 6410 rules in 8474 ms. Remains 4701 /5902 variables (removed 1201) and now considering 6192/5402 (removed -790) transitions.
[2024-06-01 11:34:53] [INFO ] Redundant transitions in 549 ms returned []
Running 6191 sub problems to find dead transitions.
// Phase 1: matrix 6192 rows 4701 cols
[2024-06-01 11:34:53] [INFO ] Computed 901 invariants in 129 ms
[2024-06-01 11:34:53] [INFO ] State equation strengthened by 1300 read => feed constraints.
FORMULA ShieldIIPt-PT-100B-LTLFireability-00 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA ShieldIIPt-PT-100B-LTLFireability-01 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : ShieldIIPt-PT-100B-LTLFireability-02
FORMULA ShieldIIPt-PT-100B-LTLFireability-03 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA ShieldIIPt-PT-100B-LTLFireability-04 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : ShieldIIPt-PT-100B-LTLFireability-05
FORMULA ShieldIIPt-PT-100B-LTLFireability-06 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA ShieldIIPt-PT-100B-LTLFireability-07 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : ShieldIIPt-PT-100B-LTLFireability-08
FORMULA ShieldIIPt-PT-100B-LTLFireability-09 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA ShieldIIPt-PT-100B-LTLFireability-10 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA ShieldIIPt-PT-100B-LTLFireability-11 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : ShieldIIPt-PT-100B-LTLFireability-12
FORMULA ShieldIIPt-PT-100B-LTLFireability-13 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA ShieldIIPt-PT-100B-LTLFireability-14 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA ShieldIIPt-PT-100B-LTLFireability-15 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717242721187

--------------------
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 LTLFireability -timeout 360 -rebuildPNML
mcc2024
ltl formula name ShieldIIPt-PT-100B-LTLFireability-00
ltl formula formula --ltl=/tmp/899/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 7003 places, 6503 transitions and 16206 arcs
pnml2lts-mc( 0/ 4): Petri net ShieldIIPt-PT-100B analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.730 real 0.230 user 0.250 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/899/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/899/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/899/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/899/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 1 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 7005 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 7004, there are 6504 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~235!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 992
pnml2lts-mc( 0/ 4): unique transitions count: 19169
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 1001
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1001
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 1001 states 19189 transitions, fanout: 19.170
pnml2lts-mc( 0/ 4): Total exploration time 2.170 sec (2.140 sec minimum, 2.163 sec on average)
pnml2lts-mc( 0/ 4): States per second: 461, Transitions per second: 8843
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.7MB, 37.7 B/state, compr.: 0.1%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 6622 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.7MB (~256.0MB paged-in)
ltl formula name ShieldIIPt-PT-100B-LTLFireability-01
ltl formula formula --ltl=/tmp/899/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 7003 places, 6503 transitions and 16206 arcs
pnml2lts-mc( 0/ 4): Petri net ShieldIIPt-PT-100B analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.680 real 0.210 user 0.240 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/899/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/899/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/899/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/899/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): There are 7004 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 7004, there are 6513 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 3/ 4): Accepting cycle FOUND at depth ~29!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 106
pnml2lts-mc( 0/ 4): unique transitions count: 1575
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 118
pnml2lts-mc( 0/ 4): - cum. max stack depth: 118
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 118 states 1630 transitions, fanout: 13.814
pnml2lts-mc( 0/ 4): Total exploration time 0.230 sec (0.220 sec minimum, 0.222 sec on average)
pnml2lts-mc( 0/ 4): States per second: 513, Transitions per second: 7087
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 56.3 B/state, compr.: 0.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 6622 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name ShieldIIPt-PT-100B-LTLFireability-02
ltl formula formula --ltl=/tmp/899/ltl_2_
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 7003 places, 6503 transitions and 16206 arcs
pnml2lts-mc( 0/ 4): Petri net ShieldIIPt-PT-100B analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.660 real 0.240 user 0.230 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/899/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/899/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/899/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/899/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): There are 7004 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 7004, there are 6507 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4): ~2500 levels ~10000 states ~219088 transitions
pnml2lts-mc( 3/ 4): ~5000 levels ~20000 states ~556696 transitions
pnml2lts-mc( 3/ 4): ~9813 levels ~40000 states ~675176 transitions
pnml2lts-mc( 3/ 4): ~19063 levels ~80000 states ~867412 transitions
ltl formula name ShieldIIPt-PT-100B-LTLFireability-03
ltl formula formula --ltl=/tmp/899/ltl_3_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 7003 places, 6503 transitions and 16206 arcs
pnml2lts-mc( 0/ 4): Petri net ShieldIIPt-PT-100B analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.810 real 0.260 user 0.210 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/899/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/899/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/899/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/899/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): There are 7004 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 7004, there are 6512 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~374!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 1474
pnml2lts-mc( 0/ 4): unique transitions count: 30206
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 1488
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1488
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 1488 states 30252 transitions, fanout: 20.331
pnml2lts-mc( 0/ 4): Total exploration time 2.790 sec (2.790 sec minimum, 2.790 sec on average)
pnml2lts-mc( 0/ 4): States per second: 533, Transitions per second: 10843
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 1.0MB, 35.8 B/state, compr.: 0.1%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/1.0%
pnml2lts-mc( 0/ 4): Stored 6622 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 1.0MB (~256.0MB paged-in)
ltl formula name ShieldIIPt-PT-100B-LTLFireability-04
ltl formula formula --ltl=/tmp/899/ltl_4_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 7003 places, 6503 transitions and 16206 arcs
pnml2lts-mc( 0/ 4): Petri net ShieldIIPt-PT-100B analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.640 real 0.210 user 0.250 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/899/ltl_4_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/899/ltl_4_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/899/ltl_4_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/899/ltl_4_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 7005 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 7004, there are 6512 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 2/ 4): Accepting cycle FOUND at depth ~114!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 436
pnml2lts-mc( 0/ 4): unique transitions count: 4774
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 446
pnml2lts-mc( 0/ 4): - cum. max stack depth: 446
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 446 states 4798 transitions, fanout: 10.758
pnml2lts-mc( 0/ 4): Total exploration time 0.850 sec (0.850 sec minimum, 0.850 sec on average)
pnml2lts-mc( 0/ 4): States per second: 525, Transitions per second: 5645
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.2MB, 47.3 B/state, compr.: 0.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 6622 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.2MB (~256.0MB paged-in)
ltl formula name ShieldIIPt-PT-100B-LTLFireability-05
ltl formula formula --ltl=/tmp/899/ltl_5_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 7003 places, 6503 transitions and 16206 arcs
pnml2lts-mc( 0/ 4): Petri net ShieldIIPt-PT-100B analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.680 real 0.230 user 0.240 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/899/ltl_5_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/899/ltl_5_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/899/ltl_5_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/899/ltl_5_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 7005 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 7004, there are 6509 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4): ~2500 levels ~10000 states ~171548 transitions
pnml2lts-mc( 1/ 4): ~5000 levels ~20000 states ~462104 transitions
pnml2lts-mc( 2/ 4): ~9855 levels ~40000 states ~715592 transitions
pnml2lts-mc( 2/ 4): ~19663 levels ~80000 states ~954596 transitions
ltl formula name ShieldIIPt-PT-100B-LTLFireability-06
ltl formula formula --ltl=/tmp/899/ltl_6_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 7003 places, 6503 transitions and 16206 arcs
pnml2lts-mc( 0/ 4): Petri net ShieldIIPt-PT-100B analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.860 real 0.230 user 0.270 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/899/ltl_6_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/899/ltl_6_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/899/ltl_6_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/899/ltl_6_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 7005 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 7004, there are 6510 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 2/ 4): Accepting cycle FOUND at depth ~896!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 4807
pnml2lts-mc( 0/ 4): unique transitions count: 183428
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 4816
pnml2lts-mc( 0/ 4): - cum. max stack depth: 4816
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 4816 states 183448 transitions, fanout: 38.091
pnml2lts-mc( 0/ 4): Total exploration time 12.280 sec (12.260 sec minimum, 12.275 sec on average)
pnml2lts-mc( 0/ 4): States per second: 392, Transitions per second: 14939
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 4.5MB, 25.5 B/state, compr.: 0.1%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/4.0%
pnml2lts-mc( 0/ 4): Stored 6622 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 4.5MB (~256.0MB paged-in)
ltl formula name ShieldIIPt-PT-100B-LTLFireability-07
ltl formula formula --ltl=/tmp/899/ltl_7_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 7003 places, 6503 transitions and 16206 arcs
pnml2lts-mc( 0/ 4): Petri net ShieldIIPt-PT-100B analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.670 real 0.270 user 0.200 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/899/ltl_7_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/899/ltl_7_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/899/ltl_7_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/899/ltl_7_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 7005 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 7004, there are 6506 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 2
pnml2lts-mc( 0/ 4): unique states count: 2
pnml2lts-mc( 0/ 4): unique transitions count: 1
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 8
pnml2lts-mc( 0/ 4): - cum. max stack depth: 8
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 8 states 8 transitions, fanout: 1.000
pnml2lts-mc( 0/ 4): Total exploration time 0.020 sec (0.020 sec minimum, 0.020 sec on average)
pnml2lts-mc( 0/ 4): States per second: 400, Transitions per second: 400
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 124.0 B/state, compr.: 0.4%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 6622 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name ShieldIIPt-PT-100B-LTLFireability-08
ltl formula formula --ltl=/tmp/899/ltl_8_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 7003 places, 6503 transitions and 16206 arcs
pnml2lts-mc( 0/ 4): Petri net ShieldIIPt-PT-100B analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.700 real 0.210 user 0.270 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/899/ltl_8_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/899/ltl_8_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/899/ltl_8_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/899/ltl_8_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): There are 7004 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 7004, there are 6509 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~2500 levels ~10000 states ~194832 transitions
pnml2lts-mc( 0/ 4): ~5000 levels ~20000 states ~261248 transitions
pnml2lts-mc( 2/ 4): ~9536 levels ~40000 states ~386812 transitions
pnml2lts-mc( 2/ 4): ~18565 levels ~80000 states ~590140 transitions
ltl formula name ShieldIIPt-PT-100B-LTLFireability-09
ltl formula formula --ltl=/tmp/899/ltl_9_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 7003 places, 6503 transitions and 16206 arcs
pnml2lts-mc( 0/ 4): Petri net ShieldIIPt-PT-100B analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.840 real 0.250 user 0.250 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/899/ltl_9_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/899/ltl_9_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/899/ltl_9_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/899/ltl_9_
pnml2lts-mc( 0/ 4): buchi has 1 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 7005 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 7004, there are 6505 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 3/ 4): Accepting cycle FOUND at depth ~30!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 104
pnml2lts-mc( 0/ 4): unique transitions count: 786
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 116
pnml2lts-mc( 0/ 4): - cum. max stack depth: 116
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 116 states 815 transitions, fanout: 7.026
pnml2lts-mc( 0/ 4): Total exploration time 0.220 sec (0.220 sec minimum, 0.220 sec on average)
pnml2lts-mc( 0/ 4): States per second: 527, Transitions per second: 3705
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 57.1 B/state, compr.: 0.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 6622 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name ShieldIIPt-PT-100B-LTLFireability-10
ltl formula formula --ltl=/tmp/899/ltl_10_
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 7003 places, 6503 transitions and 16206 arcs
pnml2lts-mc( 0/ 4): Petri net ShieldIIPt-PT-100B analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.680 real 0.200 user 0.270 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/899/ltl_10_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/899/ltl_10_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/899/ltl_10_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/899/ltl_10_
pnml2lts-mc( 0/ 4): buchi has 8 states
pnml2lts-mc( 0/ 4): There are 7004 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 7004, there are 6520 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~159!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 617
pnml2lts-mc( 0/ 4): unique transitions count: 9682
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 627
pnml2lts-mc( 0/ 4): - cum. max stack depth: 627
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 627 states 9714 transitions, fanout: 15.493
pnml2lts-mc( 0/ 4): Total exploration time 1.530 sec (1.520 sec minimum, 1.523 sec on average)
pnml2lts-mc( 0/ 4): States per second: 410, Transitions per second: 6349
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.4MB, 42.6 B/state, compr.: 0.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 6622 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.4MB (~256.0MB paged-in)
ltl formula name ShieldIIPt-PT-100B-LTLFireability-11
ltl formula formula --ltl=/tmp/899/ltl_11_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 7003 places, 6503 transitions and 16206 arcs
pnml2lts-mc( 0/ 4): Petri net ShieldIIPt-PT-100B analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.680 real 0.230 user 0.210 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/899/ltl_11_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/899/ltl_11_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/899/ltl_11_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/899/ltl_11_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 7005 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 7004, there are 6513 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 3/ 4): Accepting cycle FOUND at depth ~120!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 507
pnml2lts-mc( 0/ 4): unique transitions count: 7571
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 516
pnml2lts-mc( 0/ 4): - cum. max stack depth: 516
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 516 states 7592 transitions, fanout: 14.713
pnml2lts-mc( 0/ 4): Total exploration time 1.150 sec (1.140 sec minimum, 1.142 sec on average)
pnml2lts-mc( 0/ 4): States per second: 449, Transitions per second: 6602
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.3MB, 43.9 B/state, compr.: 0.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 6622 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.3MB (~256.0MB paged-in)
ltl formula name ShieldIIPt-PT-100B-LTLFireability-12
ltl formula formula --ltl=/tmp/899/ltl_12_
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 7003 places, 6503 transitions and 16206 arcs
pnml2lts-mc( 0/ 4): Petri net ShieldIIPt-PT-100B analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.670 real 0.240 user 0.210 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/899/ltl_12_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/899/ltl_12_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/899/ltl_12_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/899/ltl_12_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 7005 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 7004, there are 6508 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4): ~2500 levels ~10000 states ~244424 transitions
pnml2lts-mc( 2/ 4): ~4845 levels ~20000 states ~546172 transitions
pnml2lts-mc( 2/ 4): ~9279 levels ~40000 states ~636776 transitions
pnml2lts-mc( 2/ 4): ~18066 levels ~80000 states ~834148 transitions
ltl formula name ShieldIIPt-PT-100B-LTLFireability-13
ltl formula formula --ltl=/tmp/899/ltl_13_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 7003 places, 6503 transitions and 16206 arcs
pnml2lts-mc( 0/ 4): Petri net ShieldIIPt-PT-100B analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.790 real 0.220 user 0.260 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/899/ltl_13_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/899/ltl_13_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/899/ltl_13_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/899/ltl_13_
pnml2lts-mc( 0/ 4): buchi has 8 states
pnml2lts-mc( 0/ 4): There are 7004 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 7004, there are 6535 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 2
pnml2lts-mc( 0/ 4): unique states count: 2
pnml2lts-mc( 0/ 4): unique transitions count: 1
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 8
pnml2lts-mc( 0/ 4): - cum. max stack depth: 8
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 8 states 8 transitions, fanout: 1.000
pnml2lts-mc( 0/ 4): Total exploration time 0.030 sec (0.020 sec minimum, 0.025 sec on average)
pnml2lts-mc( 0/ 4): States per second: 267, Transitions per second: 267
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 128.0 B/state, compr.: 0.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 6622 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name ShieldIIPt-PT-100B-LTLFireability-14
ltl formula formula --ltl=/tmp/899/ltl_14_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 7003 places, 6503 transitions and 16206 arcs
pnml2lts-mc( 0/ 4): Petri net ShieldIIPt-PT-100B analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.670 real 0.220 user 0.240 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/899/ltl_14_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/899/ltl_14_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/899/ltl_14_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/899/ltl_14_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 7005 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 7004, there are 6509 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~450!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 1732
pnml2lts-mc( 0/ 4): unique transitions count: 40117
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 1742
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1742
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 1742 states 40140 transitions, fanout: 23.042
pnml2lts-mc( 0/ 4): Total exploration time 3.340 sec (3.340 sec minimum, 3.340 sec on average)
pnml2lts-mc( 0/ 4): States per second: 522, Transitions per second: 12018
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 1.2MB, 32.0 B/state, compr.: 0.1%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/1.0%
pnml2lts-mc( 0/ 4): Stored 6622 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 1.2MB (~256.0MB paged-in)
ltl formula name ShieldIIPt-PT-100B-LTLFireability-15
ltl formula formula --ltl=/tmp/899/ltl_15_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 7003 places, 6503 transitions and 16206 arcs
pnml2lts-mc( 0/ 4): Petri net ShieldIIPt-PT-100B analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.680 real 0.220 user 0.250 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/899/ltl_15_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/899/ltl_15_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/899/ltl_15_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/899/ltl_15_
pnml2lts-mc( 0/ 4): buchi has 7 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 7005 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 7004, there are 6520 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 1/ 4): Accepting cycle FOUND at depth ~606!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 2728
pnml2lts-mc( 0/ 4): unique transitions count: 66098
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 2737
pnml2lts-mc( 0/ 4): - cum. max stack depth: 2737
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 2737 states 66120 transitions, fanout: 24.158
pnml2lts-mc( 0/ 4): Total exploration time 6.780 sec (6.760 sec minimum, 6.775 sec on average)
pnml2lts-mc( 0/ 4): States per second: 404, Transitions per second: 9752
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 2.1MB, 32.6 B/state, compr.: 0.1%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/2.0%
pnml2lts-mc( 0/ 4): Stored 6622 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 2.1MB (~256.0MB paged-in)

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="LTLFireability"
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 LTLFireability"
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-171683760900348"
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 [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;