About the Execution of LTSMin+red for ShieldPPPt-PT-050B
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 2180.920 | 184236.00 | 242684.00 | 455.60 | [undef] | Cannot compute |
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-171683761600682.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 ShieldPPPt-PT-050B, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r528-tall-171683761600682
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 9.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 114K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K 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 Apr 23 07:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 23 07:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 19:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 11 14:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 170K Apr 11 14:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Apr 11 14:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K Apr 11 14:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:54 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 955K 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 ShieldPPPt-PT-050B-CTLFireability-2024-00
FORMULA_NAME ShieldPPPt-PT-050B-CTLFireability-2024-01
FORMULA_NAME ShieldPPPt-PT-050B-CTLFireability-2024-02
FORMULA_NAME ShieldPPPt-PT-050B-CTLFireability-2024-03
FORMULA_NAME ShieldPPPt-PT-050B-CTLFireability-2024-04
FORMULA_NAME ShieldPPPt-PT-050B-CTLFireability-2024-05
FORMULA_NAME ShieldPPPt-PT-050B-CTLFireability-2024-06
FORMULA_NAME ShieldPPPt-PT-050B-CTLFireability-2024-07
FORMULA_NAME ShieldPPPt-PT-050B-CTLFireability-2024-08
FORMULA_NAME ShieldPPPt-PT-050B-CTLFireability-2024-09
FORMULA_NAME ShieldPPPt-PT-050B-CTLFireability-2024-10
FORMULA_NAME ShieldPPPt-PT-050B-CTLFireability-2024-11
FORMULA_NAME ShieldPPPt-PT-050B-CTLFireability-2023-12
FORMULA_NAME ShieldPPPt-PT-050B-CTLFireability-2023-13
FORMULA_NAME ShieldPPPt-PT-050B-CTLFireability-2023-14
FORMULA_NAME ShieldPPPt-PT-050B-CTLFireability-2023-15
=== Now, execution of the tool begins
BK_START 1717259841195
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPt-PT-050B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 16:37:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 16:37:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 16:37:22] [INFO ] Load time of PNML (sax parser for PT used): 210 ms
[2024-06-01 16:37:22] [INFO ] Transformed 3903 places.
[2024-06-01 16:37:22] [INFO ] Transformed 3553 transitions.
[2024-06-01 16:37:22] [INFO ] Found NUPN structural information;
[2024-06-01 16:37:22] [INFO ] Parsed PT model containing 3903 places and 3553 transitions and 8906 arcs in 467 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 13 ms.
Support contains 120 out of 3903 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3903/3903 places, 3553/3553 transitions.
Discarding 517 places :
Symmetric choice reduction at 0 with 517 rule applications. Total rules 517 place count 3386 transition count 3036
Iterating global reduction 0 with 517 rules applied. Total rules applied 1034 place count 3386 transition count 3036
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1035 place count 3385 transition count 3035
Iterating global reduction 0 with 1 rules applied. Total rules applied 1036 place count 3385 transition count 3035
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1037 place count 3384 transition count 3034
Iterating global reduction 0 with 1 rules applied. Total rules applied 1038 place count 3384 transition count 3034
Applied a total of 1038 rules in 1561 ms. Remains 3384 /3903 variables (removed 519) and now considering 3034/3553 (removed 519) transitions.
// Phase 1: matrix 3034 rows 3384 cols
[2024-06-01 16:37:24] [INFO ] Computed 551 invariants in 42 ms
[2024-06-01 16:37:25] [INFO ] Implicit Places using invariants in 1317 ms returned []
[2024-06-01 16:37:25] [INFO ] Invariant cache hit.
[2024-06-01 16:37:28] [INFO ] Implicit Places using invariants and state equation in 2935 ms returned []
Implicit Place search using SMT with State Equation took 4279 ms to find 0 implicit places.
Running 3033 sub problems to find dead transitions.
[2024-06-01 16:37:28] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3383/6418 variables, and 0 constraints, problems are : Problem set: 0 solved, 3033 unsolved in 30070 ms.
Refiners :[Positive P Invariants (semi-flows): 0/551 constraints, State Equation: 0/3384 constraints, PredecessorRefiner: 3033/3033 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3033 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 3383/6418 variables, and 0 constraints, problems are : Problem set: 0 solved, 3033 unsolved in 30047 ms.
Refiners :[Positive P Invariants (semi-flows): 0/551 constraints, State Equation: 0/3384 constraints, PredecessorRefiner: 0/3033 constraints, Known Traps: 0/0 constraints]
After SMT, in 61227ms problems are : Problem set: 0 solved, 3033 unsolved
Search for dead transitions found 0 dead transitions in 61276ms
Starting structural reductions in LTL mode, iteration 1 : 3384/3903 places, 3034/3553 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 67152 ms. Remains : 3384/3903 places, 3034/3553 transitions.
Support contains 120 out of 3384 places after structural reductions.
[2024-06-01 16:38:30] [INFO ] Flatten gal took : 179 ms
[2024-06-01 16:38:30] [INFO ] Flatten gal took : 117 ms
[2024-06-01 16:38:30] [INFO ] Input system was already deterministic with 3034 transitions.
Support contains 110 out of 3384 places (down from 120) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 2559 ms. (15 steps per ms) remains 32/65 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 9 ms. (400 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 9 ms. (400 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 32/32 properties
[2024-06-01 16:38:31] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 1909/1974 variables, 306/306 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1974 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (OVERLAPS) 1410/3384 variables, 245/551 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3384 variables, 0/551 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (OVERLAPS) 3034/6418 variables, 3384/3935 constraints. Problems are: Problem set: 0 solved, 32 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 6418/6418 variables, and 3935 constraints, problems are : Problem set: 0 solved, 32 unsolved in 5013 ms.
Refiners :[Positive P Invariants (semi-flows): 551/551 constraints, State Equation: 3384/3384 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 32 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 1909/1974 variables, 306/306 constraints. Problems are: Problem set: 0 solved, 32 unsolved
[2024-06-01 16:38:37] [INFO ] Deduced a trap composed of 42 places in 637 ms of which 82 ms to minimize.
[2024-06-01 16:38:38] [INFO ] Deduced a trap composed of 47 places in 534 ms of which 10 ms to minimize.
[2024-06-01 16:38:39] [INFO ] Deduced a trap composed of 55 places in 498 ms of which 9 ms to minimize.
[2024-06-01 16:38:39] [INFO ] Deduced a trap composed of 40 places in 518 ms of which 9 ms to minimize.
[2024-06-01 16:38:40] [INFO ] Deduced a trap composed of 46 places in 465 ms of which 9 ms to minimize.
[2024-06-01 16:38:40] [INFO ] Deduced a trap composed of 44 places in 484 ms of which 8 ms to minimize.
[2024-06-01 16:38:41] [INFO ] Deduced a trap composed of 43 places in 463 ms of which 8 ms to minimize.
[2024-06-01 16:38:41] [INFO ] Deduced a trap composed of 48 places in 306 ms of which 6 ms to minimize.
[2024-06-01 16:38:41] [INFO ] Deduced a trap composed of 62 places in 298 ms of which 6 ms to minimize.
[2024-06-01 16:38:42] [INFO ] Deduced a trap composed of 53 places in 288 ms of which 6 ms to minimize.
SMT process timed out in 10272ms, After SMT, problems are : Problem set: 0 solved, 32 unsolved
Fused 32 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 65 out of 3384 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3384/3384 places, 3034/3034 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 673 transitions
Trivial Post-agglo rules discarded 673 transitions
Performed 673 trivial Post agglomeration. Transition count delta: 673
Iterating post reduction 0 with 673 rules applied. Total rules applied 673 place count 3384 transition count 2361
Reduce places removed 673 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 1 with 682 rules applied. Total rules applied 1355 place count 2711 transition count 2352
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 1364 place count 2702 transition count 2352
Performed 372 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 372 Pre rules applied. Total rules applied 1364 place count 2702 transition count 1980
Deduced a syphon composed of 372 places in 4 ms
Reduce places removed 372 places and 0 transitions.
Iterating global reduction 3 with 744 rules applied. Total rules applied 2108 place count 2330 transition count 1980
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 2115 place count 2323 transition count 1973
Iterating global reduction 3 with 7 rules applied. Total rules applied 2122 place count 2323 transition count 1973
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 2122 place count 2323 transition count 1967
Deduced a syphon composed of 6 places in 4 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 2134 place count 2317 transition count 1967
Performed 840 Post agglomeration using F-continuation condition.Transition count delta: 840
Deduced a syphon composed of 840 places in 3 ms
Reduce places removed 840 places and 0 transitions.
Iterating global reduction 3 with 1680 rules applied. Total rules applied 3814 place count 1477 transition count 1127
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3815 place count 1477 transition count 1126
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 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3817 place count 1476 transition count 1125
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 5 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 4019 place count 1375 transition count 1125
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 35 places in 5 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 4 with 70 rules applied. Total rules applied 4089 place count 1340 transition count 1125
Free-agglomeration rule applied 7 times.
Iterating global reduction 4 with 7 rules applied. Total rules applied 4096 place count 1340 transition count 1118
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 4103 place count 1333 transition count 1118
Partial Free-agglomeration rule applied 144 times.
Drop transitions (Partial Free agglomeration) removed 144 transitions
Iterating global reduction 5 with 144 rules applied. Total rules applied 4247 place count 1333 transition count 1118
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 4248 place count 1332 transition count 1117
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 4249 place count 1331 transition count 1117
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 4249 place count 1331 transition count 1115
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 4253 place count 1329 transition count 1115
Applied a total of 4253 rules in 798 ms. Remains 1329 /3384 variables (removed 2055) and now considering 1115/3034 (removed 1919) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 798 ms. Remains : 1329/3384 places, 1115/3034 transitions.
RANDOM walk for 40000 steps (8 resets) in 742 ms. (53 steps per ms) remains 29/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (8 resets) in 33 ms. (117 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 29/29 properties
// Phase 1: matrix 1115 rows 1329 cols
[2024-06-01 16:38:43] [INFO ] Computed 550 invariants in 5 ms
[2024-06-01 16:38:43] [INFO ] State equation strengthened by 177 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (OVERLAPS) 706/764 variables, 302/302 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/764 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (OVERLAPS) 74/838 variables, 32/334 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/838 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (OVERLAPS) 738/1576 variables, 838/1172 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1576 variables, 170/1342 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1576 variables, 0/1342 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 8 (OVERLAPS) 162/1738 variables, 90/1432 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1738 variables, 31/1463 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1738 variables, 5/1468 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1738 variables, 0/1468 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 12 (OVERLAPS) 9/1747 variables, 10/1478 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1747 variables, 9/1487 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1747 variables, 0/1487 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 15 (OVERLAPS) 16/1763 variables, 8/1495 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1763 variables, 0/1495 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 17 (OVERLAPS) 158/1921 variables, 89/1584 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1921 variables, 25/1609 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1921 variables, 0/1609 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 20 (OVERLAPS) 10/1931 variables, 10/1619 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1931 variables, 8/1627 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1931 variables, 0/1627 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 23 (OVERLAPS) 14/1945 variables, 7/1634 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1945 variables, 0/1634 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 25 (OVERLAPS) 158/2103 variables, 95/1729 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/2103 variables, 27/1756 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/2103 variables, 0/1756 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 28 (OVERLAPS) 9/2112 variables, 11/1767 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/2112 variables, 9/1776 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/2112 variables, 0/1776 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 31 (OVERLAPS) 12/2124 variables, 6/1782 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/2124 variables, 0/1782 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 33 (OVERLAPS) 89/2213 variables, 57/1839 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/2213 variables, 18/1857 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/2213 variables, 0/1857 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 36 (OVERLAPS) 3/2216 variables, 3/1860 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/2216 variables, 3/1863 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/2216 variables, 0/1863 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 39 (OVERLAPS) 6/2222 variables, 3/1866 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/2222 variables, 0/1866 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 41 (OVERLAPS) 61/2283 variables, 37/1903 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/2283 variables, 12/1915 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/2283 variables, 0/1915 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 44 (OVERLAPS) 3/2286 variables, 3/1918 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/2286 variables, 3/1921 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/2286 variables, 0/1921 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 47 (OVERLAPS) 6/2292 variables, 3/1924 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/2292 variables, 0/1924 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 49 (OVERLAPS) 36/2328 variables, 26/1950 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/2328 variables, 9/1959 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/2328 variables, 0/1959 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 52 (OVERLAPS) 22/2350 variables, 10/1969 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/2350 variables, 3/1972 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/2350 variables, 0/1972 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 55 (OVERLAPS) 2/2352 variables, 2/1974 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/2352 variables, 2/1976 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/2352 variables, 0/1976 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 58 (OVERLAPS) 4/2356 variables, 2/1978 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/2356 variables, 0/1978 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 60 (OVERLAPS) 21/2377 variables, 15/1993 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/2377 variables, 5/1998 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/2377 variables, 0/1998 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 63 (OVERLAPS) 19/2396 variables, 8/2006 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/2396 variables, 2/2008 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/2396 variables, 1/2009 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/2396 variables, 0/2009 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 67 (OVERLAPS) 2/2398 variables, 2/2011 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/2398 variables, 2/2013 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/2398 variables, 0/2013 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 70 (OVERLAPS) 4/2402 variables, 2/2015 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/2402 variables, 0/2015 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 72 (OVERLAPS) 18/2420 variables, 14/2029 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/2420 variables, 5/2034 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/2420 variables, 0/2034 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 75 (OVERLAPS) 13/2433 variables, 6/2040 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/2433 variables, 2/2042 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/2433 variables, 1/2043 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/2433 variables, 0/2043 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 79 (OVERLAPS) 1/2434 variables, 1/2044 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/2434 variables, 1/2045 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/2434 variables, 0/2045 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 82 (OVERLAPS) 1/2435 variables, 1/2046 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/2435 variables, 1/2047 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/2435 variables, 0/2047 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 85 (OVERLAPS) 9/2444 variables, 6/2053 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/2444 variables, 3/2056 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/2444 variables, 0/2056 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 88 (OVERLAPS) 0/2444 variables, 0/2056 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2444/2444 variables, and 2056 constraints, problems are : Problem set: 0 solved, 29 unsolved in 43659 ms.
Refiners :[Positive P Invariants (semi-flows): 550/550 constraints, State Equation: 1329/1329 constraints, ReadFeed: 177/177 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 29 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (OVERLAPS) 706/764 variables, 302/302 constraints. Problems are: Problem set: 0 solved, 29 unsolved
[2024-06-01 16:39:27] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 1 ms to minimize.
[2024-06-01 16:39:27] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/764 variables, 2/304 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/764 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (OVERLAPS) 74/838 variables, 32/336 constraints. Problems are: Problem set: 0 solved, 29 unsolved
[2024-06-01 16:39:28] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 0 ms to minimize.
[2024-06-01 16:39:28] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 0 ms to minimize.
[2024-06-01 16:39:28] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 0 ms to minimize.
[2024-06-01 16:39:28] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/838 variables, 4/340 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/838 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 7 (OVERLAPS) 738/1576 variables, 838/1178 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1576 variables, 170/1348 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1576 variables, 27/1375 constraints. Problems are: Problem set: 0 solved, 29 unsolved
[2024-06-01 16:39:30] [INFO ] Deduced a trap composed of 5 places in 48 ms of which 1 ms to minimize.
[2024-06-01 16:39:30] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 1 ms to minimize.
[2024-06-01 16:39:30] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 1 ms to minimize.
[2024-06-01 16:39:30] [INFO ] Deduced a trap composed of 8 places in 55 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1576 variables, 4/1379 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1576 variables, 0/1379 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 12 (OVERLAPS) 162/1738 variables, 90/1469 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1738 variables, 31/1500 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1738 variables, 5/1505 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1738 variables, 2/1507 constraints. Problems are: Problem set: 0 solved, 29 unsolved
[2024-06-01 16:39:35] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 1 ms to minimize.
[2024-06-01 16:39:35] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 1 ms to minimize.
[2024-06-01 16:39:35] [INFO ] Deduced a trap composed of 6 places in 65 ms of which 1 ms to minimize.
[2024-06-01 16:39:35] [INFO ] Deduced a trap composed of 6 places in 53 ms of which 1 ms to minimize.
[2024-06-01 16:39:35] [INFO ] Deduced a trap composed of 6 places in 62 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1738 variables, 5/1512 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1738 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 18 (OVERLAPS) 9/1747 variables, 10/1522 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1747 variables, 9/1531 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1747 variables, 0/1531 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 21 (OVERLAPS) 16/1763 variables, 8/1539 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1763 variables, 0/1539 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 23 (OVERLAPS) 158/1921 variables, 89/1628 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1921 variables, 25/1653 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1921 variables, 0/1653 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 26 (OVERLAPS) 10/1931 variables, 10/1663 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1931 variables, 8/1671 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1931 variables, 0/1671 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 29 (OVERLAPS) 14/1945 variables, 7/1678 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1945 variables, 0/1678 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 31 (OVERLAPS) 158/2103 variables, 95/1773 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/2103 variables, 27/1800 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/2103 variables, 0/1800 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 34 (OVERLAPS) 9/2112 variables, 11/1811 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/2112 variables, 9/1820 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/2112 variables, 0/1820 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 37 (OVERLAPS) 12/2124 variables, 6/1826 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/2124 variables, 0/1826 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 39 (OVERLAPS) 89/2213 variables, 57/1883 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/2213 variables, 18/1901 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/2213 variables, 0/1901 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 42 (OVERLAPS) 3/2216 variables, 3/1904 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/2216 variables, 3/1907 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/2216 variables, 0/1907 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 45 (OVERLAPS) 6/2222 variables, 3/1910 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/2222 variables, 0/1910 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 47 (OVERLAPS) 61/2283 variables, 37/1947 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/2283 variables, 12/1959 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/2283 variables, 0/1959 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 50 (OVERLAPS) 3/2286 variables, 3/1962 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/2286 variables, 3/1965 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/2286 variables, 0/1965 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 53 (OVERLAPS) 6/2292 variables, 3/1968 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/2292 variables, 0/1968 constraints. Problems are: Problem set: 0 solved, 29 unsolved
SMT process timed out in 88711ms, After SMT, problems are : Problem set: 0 solved, 29 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 58 out of 1329 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1329/1329 places, 1115/1115 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 1329 transition count 1114
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1328 transition count 1114
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 12 place count 1323 transition count 1109
Applied a total of 12 rules in 73 ms. Remains 1323 /1329 variables (removed 6) and now considering 1109/1115 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 1323/1329 places, 1109/1115 transitions.
[2024-06-01 16:40:12] [INFO ] Flatten gal took : 85 ms
[2024-06-01 16:40:12] [INFO ] Flatten gal took : 87 ms
[2024-06-01 16:40:12] [INFO ] Input system was already deterministic with 3034 transitions.
Computed a total of 806 stabilizing places and 806 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 3384/3384 places, 3034/3034 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 3356 transition count 3006
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 3356 transition count 3006
Applied a total of 56 rules in 529 ms. Remains 3356 /3384 variables (removed 28) and now considering 3006/3034 (removed 28) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 529 ms. Remains : 3356/3384 places, 3006/3034 transitions.
[2024-06-01 16:40:13] [INFO ] Flatten gal took : 69 ms
[2024-06-01 16:40:13] [INFO ] Flatten gal took : 73 ms
[2024-06-01 16:40:13] [INFO ] Input system was already deterministic with 3006 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 3384/3384 places, 3034/3034 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 709 transitions
Trivial Post-agglo rules discarded 709 transitions
Performed 709 trivial Post agglomeration. Transition count delta: 709
Iterating post reduction 0 with 709 rules applied. Total rules applied 709 place count 3383 transition count 2324
Reduce places removed 709 places and 0 transitions.
Iterating post reduction 1 with 709 rules applied. Total rules applied 1418 place count 2674 transition count 2324
Performed 378 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 378 Pre rules applied. Total rules applied 1418 place count 2674 transition count 1946
Deduced a syphon composed of 378 places in 3 ms
Reduce places removed 378 places and 0 transitions.
Iterating global reduction 2 with 756 rules applied. Total rules applied 2174 place count 2296 transition count 1946
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 2196 place count 2274 transition count 1924
Iterating global reduction 2 with 22 rules applied. Total rules applied 2218 place count 2274 transition count 1924
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 2218 place count 2274 transition count 1905
Deduced a syphon composed of 19 places in 2 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 2256 place count 2255 transition count 1905
Performed 796 Post agglomeration using F-continuation condition.Transition count delta: 796
Deduced a syphon composed of 796 places in 1 ms
Reduce places removed 796 places and 0 transitions.
Iterating global reduction 2 with 1592 rules applied. Total rules applied 3848 place count 1459 transition count 1109
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 3850 place count 1457 transition count 1107
Applied a total of 3850 rules in 506 ms. Remains 1457 /3384 variables (removed 1927) and now considering 1107/3034 (removed 1927) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 507 ms. Remains : 1457/3384 places, 1107/3034 transitions.
[2024-06-01 16:40:14] [INFO ] Flatten gal took : 30 ms
[2024-06-01 16:40:14] [INFO ] Flatten gal took : 32 ms
[2024-06-01 16:40:14] [INFO ] Input system was already deterministic with 1107 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 3384/3384 places, 3034/3034 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 710 transitions
Trivial Post-agglo rules discarded 710 transitions
Performed 710 trivial Post agglomeration. Transition count delta: 710
Iterating post reduction 0 with 710 rules applied. Total rules applied 710 place count 3383 transition count 2323
Reduce places removed 710 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 711 rules applied. Total rules applied 1421 place count 2673 transition count 2322
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1422 place count 2672 transition count 2322
Performed 376 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 376 Pre rules applied. Total rules applied 1422 place count 2672 transition count 1946
Deduced a syphon composed of 376 places in 3 ms
Reduce places removed 376 places and 0 transitions.
Iterating global reduction 3 with 752 rules applied. Total rules applied 2174 place count 2296 transition count 1946
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 2195 place count 2275 transition count 1925
Iterating global reduction 3 with 21 rules applied. Total rules applied 2216 place count 2275 transition count 1925
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 18 Pre rules applied. Total rules applied 2216 place count 2275 transition count 1907
Deduced a syphon composed of 18 places in 3 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 2252 place count 2257 transition count 1907
Performed 799 Post agglomeration using F-continuation condition.Transition count delta: 799
Deduced a syphon composed of 799 places in 1 ms
Reduce places removed 799 places and 0 transitions.
Iterating global reduction 3 with 1598 rules applied. Total rules applied 3850 place count 1458 transition count 1108
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3851 place count 1458 transition count 1107
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 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3853 place count 1457 transition count 1106
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3855 place count 1455 transition count 1104
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3856 place count 1454 transition count 1104
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 3856 place count 1454 transition count 1102
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 3860 place count 1452 transition count 1102
Applied a total of 3860 rules in 526 ms. Remains 1452 /3384 variables (removed 1932) and now considering 1102/3034 (removed 1932) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 526 ms. Remains : 1452/3384 places, 1102/3034 transitions.
[2024-06-01 16:40:14] [INFO ] Flatten gal took : 27 ms
[2024-06-01 16:40:14] [INFO ] Flatten gal took : 29 ms
[2024-06-01 16:40:14] [INFO ] Input system was already deterministic with 1102 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3384/3384 places, 3034/3034 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 3351 transition count 3001
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 3351 transition count 3001
Applied a total of 66 rules in 519 ms. Remains 3351 /3384 variables (removed 33) and now considering 3001/3034 (removed 33) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 520 ms. Remains : 3351/3384 places, 3001/3034 transitions.
[2024-06-01 16:40:15] [INFO ] Flatten gal took : 60 ms
[2024-06-01 16:40:15] [INFO ] Flatten gal took : 66 ms
[2024-06-01 16:40:15] [INFO ] Input system was already deterministic with 3001 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 3384/3384 places, 3034/3034 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 706 transitions
Trivial Post-agglo rules discarded 706 transitions
Performed 706 trivial Post agglomeration. Transition count delta: 706
Iterating post reduction 0 with 706 rules applied. Total rules applied 706 place count 3383 transition count 2327
Reduce places removed 706 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 709 rules applied. Total rules applied 1415 place count 2677 transition count 2324
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 1418 place count 2674 transition count 2324
Performed 375 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 375 Pre rules applied. Total rules applied 1418 place count 2674 transition count 1949
Deduced a syphon composed of 375 places in 3 ms
Reduce places removed 375 places and 0 transitions.
Iterating global reduction 3 with 750 rules applied. Total rules applied 2168 place count 2299 transition count 1949
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 2188 place count 2279 transition count 1929
Iterating global reduction 3 with 20 rules applied. Total rules applied 2208 place count 2279 transition count 1929
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 18 Pre rules applied. Total rules applied 2208 place count 2279 transition count 1911
Deduced a syphon composed of 18 places in 3 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 2244 place count 2261 transition count 1911
Performed 789 Post agglomeration using F-continuation condition.Transition count delta: 789
Deduced a syphon composed of 789 places in 2 ms
Reduce places removed 789 places and 0 transitions.
Iterating global reduction 3 with 1578 rules applied. Total rules applied 3822 place count 1472 transition count 1122
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3823 place count 1472 transition count 1121
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 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3825 place count 1471 transition count 1120
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3827 place count 1469 transition count 1118
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3828 place count 1468 transition count 1118
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 3828 place count 1468 transition count 1116
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 3832 place count 1466 transition count 1116
Applied a total of 3832 rules in 581 ms. Remains 1466 /3384 variables (removed 1918) and now considering 1116/3034 (removed 1918) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 582 ms. Remains : 1466/3384 places, 1116/3034 transitions.
[2024-06-01 16:40:16] [INFO ] Flatten gal took : 35 ms
[2024-06-01 16:40:16] [INFO ] Flatten gal took : 35 ms
[2024-06-01 16:40:16] [INFO ] Input system was already deterministic with 1116 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3384/3384 places, 3034/3034 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 3353 transition count 3003
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 3353 transition count 3003
Applied a total of 62 rules in 531 ms. Remains 3353 /3384 variables (removed 31) and now considering 3003/3034 (removed 31) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 532 ms. Remains : 3353/3384 places, 3003/3034 transitions.
[2024-06-01 16:40:16] [INFO ] Flatten gal took : 57 ms
[2024-06-01 16:40:16] [INFO ] Flatten gal took : 61 ms
[2024-06-01 16:40:17] [INFO ] Input system was already deterministic with 3003 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3384/3384 places, 3034/3034 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 3351 transition count 3001
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 3351 transition count 3001
Applied a total of 66 rules in 518 ms. Remains 3351 /3384 variables (removed 33) and now considering 3001/3034 (removed 33) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 519 ms. Remains : 3351/3384 places, 3001/3034 transitions.
[2024-06-01 16:40:17] [INFO ] Flatten gal took : 59 ms
[2024-06-01 16:40:17] [INFO ] Flatten gal took : 62 ms
[2024-06-01 16:40:17] [INFO ] Input system was already deterministic with 3001 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3384/3384 places, 3034/3034 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 3355 transition count 3005
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 3355 transition count 3005
Applied a total of 58 rules in 567 ms. Remains 3355 /3384 variables (removed 29) and now considering 3005/3034 (removed 29) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 568 ms. Remains : 3355/3384 places, 3005/3034 transitions.
[2024-06-01 16:40:18] [INFO ] Flatten gal took : 59 ms
[2024-06-01 16:40:18] [INFO ] Flatten gal took : 63 ms
[2024-06-01 16:40:18] [INFO ] Input system was already deterministic with 3005 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3384/3384 places, 3034/3034 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 3351 transition count 3001
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 3351 transition count 3001
Applied a total of 66 rules in 535 ms. Remains 3351 /3384 variables (removed 33) and now considering 3001/3034 (removed 33) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 536 ms. Remains : 3351/3384 places, 3001/3034 transitions.
[2024-06-01 16:40:19] [INFO ] Flatten gal took : 54 ms
[2024-06-01 16:40:19] [INFO ] Flatten gal took : 56 ms
[2024-06-01 16:40:19] [INFO ] Input system was already deterministic with 3001 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3384/3384 places, 3034/3034 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 3354 transition count 3004
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 3354 transition count 3004
Applied a total of 60 rules in 526 ms. Remains 3354 /3384 variables (removed 30) and now considering 3004/3034 (removed 30) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 526 ms. Remains : 3354/3384 places, 3004/3034 transitions.
[2024-06-01 16:40:20] [INFO ] Flatten gal took : 53 ms
[2024-06-01 16:40:20] [INFO ] Flatten gal took : 57 ms
[2024-06-01 16:40:20] [INFO ] Input system was already deterministic with 3004 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3384/3384 places, 3034/3034 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 3354 transition count 3004
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 3354 transition count 3004
Applied a total of 60 rules in 530 ms. Remains 3354 /3384 variables (removed 30) and now considering 3004/3034 (removed 30) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 532 ms. Remains : 3354/3384 places, 3004/3034 transitions.
[2024-06-01 16:40:20] [INFO ] Flatten gal took : 53 ms
[2024-06-01 16:40:20] [INFO ] Flatten gal took : 55 ms
[2024-06-01 16:40:20] [INFO ] Input system was already deterministic with 3004 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3384/3384 places, 3034/3034 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 3352 transition count 3002
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 3352 transition count 3002
Applied a total of 64 rules in 550 ms. Remains 3352 /3384 variables (removed 32) and now considering 3002/3034 (removed 32) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 550 ms. Remains : 3352/3384 places, 3002/3034 transitions.
[2024-06-01 16:40:21] [INFO ] Flatten gal took : 53 ms
[2024-06-01 16:40:21] [INFO ] Flatten gal took : 56 ms
[2024-06-01 16:40:21] [INFO ] Input system was already deterministic with 3002 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3384/3384 places, 3034/3034 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 3351 transition count 3001
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 3351 transition count 3001
Applied a total of 66 rules in 512 ms. Remains 3351 /3384 variables (removed 33) and now considering 3001/3034 (removed 33) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 512 ms. Remains : 3351/3384 places, 3001/3034 transitions.
[2024-06-01 16:40:22] [INFO ] Flatten gal took : 52 ms
[2024-06-01 16:40:22] [INFO ] Flatten gal took : 54 ms
[2024-06-01 16:40:22] [INFO ] Input system was already deterministic with 3001 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3384/3384 places, 3034/3034 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 3355 transition count 3005
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 3355 transition count 3005
Applied a total of 58 rules in 506 ms. Remains 3355 /3384 variables (removed 29) and now considering 3005/3034 (removed 29) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 510 ms. Remains : 3355/3384 places, 3005/3034 transitions.
[2024-06-01 16:40:23] [INFO ] Flatten gal took : 53 ms
[2024-06-01 16:40:23] [INFO ] Flatten gal took : 56 ms
[2024-06-01 16:40:23] [INFO ] Input system was already deterministic with 3005 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3384/3384 places, 3034/3034 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 3352 transition count 3002
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 3352 transition count 3002
Applied a total of 64 rules in 513 ms. Remains 3352 /3384 variables (removed 32) and now considering 3002/3034 (removed 32) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 514 ms. Remains : 3352/3384 places, 3002/3034 transitions.
[2024-06-01 16:40:23] [INFO ] Flatten gal took : 51 ms
[2024-06-01 16:40:23] [INFO ] Flatten gal took : 54 ms
[2024-06-01 16:40:24] [INFO ] Input system was already deterministic with 3002 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3384/3384 places, 3034/3034 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 3354 transition count 3004
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 3354 transition count 3004
Applied a total of 60 rules in 589 ms. Remains 3354 /3384 variables (removed 30) and now considering 3004/3034 (removed 30) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 590 ms. Remains : 3354/3384 places, 3004/3034 transitions.
[2024-06-01 16:40:24] [INFO ] Flatten gal took : 52 ms
[2024-06-01 16:40:24] [INFO ] Flatten gal took : 55 ms
[2024-06-01 16:40:24] [INFO ] Input system was already deterministic with 3004 transitions.
[2024-06-01 16:40:24] [INFO ] Flatten gal took : 55 ms
[2024-06-01 16:40:25] [INFO ] Flatten gal took : 56 ms
[2024-06-01 16:40:25] [INFO ] Export to MCC of 16 properties in file /home/mcc/execution/CTLFireability.sr.xml took 11 ms.
[2024-06-01 16:40:25] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 3384 places, 3034 transitions and 7868 arcs took 20 ms.
Total runtime 182785 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=
[--mu-opt] [--saturation=
[--sat-granularity=
[--guidance=
[--action=
[--trace=
[--mu=
[--ctl=
[--save-levels=STRING] [--pg-solve] [--attr=
[--saturating-attractor] [--write-strategy=
[--check-strategy] [--interactive-play] [--player]
[--pg-write=
[--edge-label=
[--mucalc=
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por=
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=
[--cw-max-cols=
[--mh-timeout=
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=
[--ldd32-cache=
[--cache-ratio=
[--min-free-nodes=
[--fdd-reorder=
[--vset-cache-diff=
[--next-union] [--peak-nodes] [--maxsum=
[--block-size=
[--debug=
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS]
Could not compute solution for formula : ShieldPPPt-PT-050B-CTLFireability-2024-00
Could not compute solution for formula : ShieldPPPt-PT-050B-CTLFireability-2024-01
Could not compute solution for formula : ShieldPPPt-PT-050B-CTLFireability-2024-02
Could not compute solution for formula : ShieldPPPt-PT-050B-CTLFireability-2024-03
Could not compute solution for formula : ShieldPPPt-PT-050B-CTLFireability-2024-04
Could not compute solution for formula : ShieldPPPt-PT-050B-CTLFireability-2024-05
Could not compute solution for formula : ShieldPPPt-PT-050B-CTLFireability-2024-06
Could not compute solution for formula : ShieldPPPt-PT-050B-CTLFireability-2024-07
Could not compute solution for formula : ShieldPPPt-PT-050B-CTLFireability-2024-08
Could not compute solution for formula : ShieldPPPt-PT-050B-CTLFireability-2024-09
Could not compute solution for formula : ShieldPPPt-PT-050B-CTLFireability-2024-10
Could not compute solution for formula : ShieldPPPt-PT-050B-CTLFireability-2024-11
Could not compute solution for formula : ShieldPPPt-PT-050B-CTLFireability-2023-12
Could not compute solution for formula : ShieldPPPt-PT-050B-CTLFireability-2023-13
Could not compute solution for formula : ShieldPPPt-PT-050B-CTLFireability-2023-14
Could not compute solution for formula : ShieldPPPt-PT-050B-CTLFireability-2023-15
BK_STOP 1717260025431
--------------------
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 CTLFireability -timeout 360 -rebuildPNML
mcc2024
ctl formula name ShieldPPPt-PT-050B-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/618/ctl_0_
ctl formula name ShieldPPPt-PT-050B-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/618/ctl_1_
ctl formula name ShieldPPPt-PT-050B-CTLFireability-2024-02
ctl formula formula --ctl=/tmp/618/ctl_2_
ctl formula name ShieldPPPt-PT-050B-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/618/ctl_3_
ctl formula name ShieldPPPt-PT-050B-CTLFireability-2024-04
ctl formula formula --ctl=/tmp/618/ctl_4_
ctl formula name ShieldPPPt-PT-050B-CTLFireability-2024-05
ctl formula formula --ctl=/tmp/618/ctl_5_
ctl formula name ShieldPPPt-PT-050B-CTLFireability-2024-06
ctl formula formula --ctl=/tmp/618/ctl_6_
ctl formula name ShieldPPPt-PT-050B-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/618/ctl_7_
ctl formula name ShieldPPPt-PT-050B-CTLFireability-2024-08
ctl formula formula --ctl=/tmp/618/ctl_8_
ctl formula name ShieldPPPt-PT-050B-CTLFireability-2024-09
ctl formula formula --ctl=/tmp/618/ctl_9_
ctl formula name ShieldPPPt-PT-050B-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/618/ctl_10_
ctl formula name ShieldPPPt-PT-050B-CTLFireability-2024-11
ctl formula formula --ctl=/tmp/618/ctl_11_
ctl formula name ShieldPPPt-PT-050B-CTLFireability-2023-12
ctl formula formula --ctl=/tmp/618/ctl_12_
ctl formula name ShieldPPPt-PT-050B-CTLFireability-2023-13
ctl formula formula --ctl=/tmp/618/ctl_13_
ctl formula name ShieldPPPt-PT-050B-CTLFireability-2023-14
ctl formula formula --ctl=/tmp/618/ctl_14_
ctl formula name ShieldPPPt-PT-050B-CTLFireability-2023-15
ctl formula formula --ctl=/tmp/618/ctl_15_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldPPPt-PT-050B"
export BK_EXAMINATION="CTLFireability"
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 ShieldPPPt-PT-050B, examination is CTLFireability"
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-171683761600682"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPt-PT-050B.tgz
mv ShieldPPPt-PT-050B execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;