About the Execution of LTSMin+red for ResIsolation-PT-N10P2
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16198.268 | 2992270.00 | 6269555.00 | 6014.90 | FF?FT?FF?FFTTF?T | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r631-smll-171774447100092.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 ResIsolation-PT-N10P2, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r631-smll-171774447100092
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 45M
-rw-r--r-- 1 mcc users 6.1K Jun 7 06:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Jun 7 06:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Jun 7 06:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Jun 7 06:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Jun 7 06:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Jun 7 06:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Jun 7 06:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Jun 7 06:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 7 06:26 NewModel
-rw-r--r-- 1 mcc users 14K Jun 7 06:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 150K Jun 7 06:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Jun 7 06:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Jun 7 06:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Jun 7 06:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Jun 7 06:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 7 06:26 equiv_col
-rw-r--r-- 1 mcc users 6 Jun 7 06:26 instance
-rw-r--r-- 1 mcc users 6 Jun 7 06:26 iscolored
-rw-r--r-- 1 mcc users 45M Jun 7 06:26 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 ResIsolation-PT-N10P2-LTLFireability-00
FORMULA_NAME ResIsolation-PT-N10P2-LTLFireability-01
FORMULA_NAME ResIsolation-PT-N10P2-LTLFireability-02
FORMULA_NAME ResIsolation-PT-N10P2-LTLFireability-03
FORMULA_NAME ResIsolation-PT-N10P2-LTLFireability-04
FORMULA_NAME ResIsolation-PT-N10P2-LTLFireability-05
FORMULA_NAME ResIsolation-PT-N10P2-LTLFireability-06
FORMULA_NAME ResIsolation-PT-N10P2-LTLFireability-07
FORMULA_NAME ResIsolation-PT-N10P2-LTLFireability-08
FORMULA_NAME ResIsolation-PT-N10P2-LTLFireability-09
FORMULA_NAME ResIsolation-PT-N10P2-LTLFireability-10
FORMULA_NAME ResIsolation-PT-N10P2-LTLFireability-11
FORMULA_NAME ResIsolation-PT-N10P2-LTLFireability-12
FORMULA_NAME ResIsolation-PT-N10P2-LTLFireability-13
FORMULA_NAME ResIsolation-PT-N10P2-LTLFireability-14
FORMULA_NAME ResIsolation-PT-N10P2-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1717807494394
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ResIsolation-PT-N10P2
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-08 00:44:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-08 00:44:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-08 00:45:00] [INFO ] Load time of PNML (sax parser for PT used): 3289 ms
[2024-06-08 00:45:00] [INFO ] Transformed 367 places.
[2024-06-08 00:45:00] [INFO ] Transformed 37193 transitions.
[2024-06-08 00:45:00] [INFO ] Found NUPN structural information;
[2024-06-08 00:45:00] [INFO ] Parsed PT model containing 367 places and 37193 transitions and 885405 arcs in 4256 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 56 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA ResIsolation-PT-N10P2-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResIsolation-PT-N10P2-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 49 out of 367 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 367/367 places, 37193/37193 transitions.
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 355 transition count 37193
Discarding 201 places :
Symmetric choice reduction at 1 with 201 rule applications. Total rules 213 place count 154 transition count 36992
Iterating global reduction 1 with 201 rules applied. Total rules applied 414 place count 154 transition count 36992
Ensure Unique test removed 3077 transitions
Reduce isomorphic transitions removed 3077 transitions.
Iterating post reduction 1 with 3077 rules applied. Total rules applied 3491 place count 154 transition count 33915
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 3512 place count 133 transition count 33894
Iterating global reduction 2 with 21 rules applied. Total rules applied 3533 place count 133 transition count 33894
Applied a total of 3533 rules in 1344 ms. Remains 133 /367 variables (removed 234) and now considering 33894/37193 (removed 3299) transitions.
// Phase 1: matrix 33894 rows 133 cols
[2024-06-08 00:45:04] [INFO ] Computed 0 invariants in 1199 ms
[2024-06-08 00:45:06] [INFO ] Implicit Places using invariants in 2977 ms returned []
Implicit Place search using SMT only with invariants took 3031 ms to find 0 implicit places.
Running 33893 sub problems to find dead transitions.
[2024-06-08 00:45:07] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 132/34027 variables, and 0 constraints, problems are : Problem set: 0 solved, 33893 unsolved in 31074 ms.
Refiners :[State Equation: 0/133 constraints, PredecessorRefiner: 33893/72 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 33893 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 132/34027 variables, and 0 constraints, problems are : Problem set: 0 solved, 33893 unsolved in 30687 ms.
Refiners :[State Equation: 0/133 constraints, PredecessorRefiner: 33821/72 constraints, Known Traps: 0/0 constraints]
After SMT, in 739220ms problems are : Problem set: 0 solved, 33893 unsolved
Search for dead transitions found 0 dead transitions in 740139ms
Starting structural reductions in LTL mode, iteration 1 : 133/367 places, 33894/37193 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 744719 ms. Remains : 133/367 places, 33894/37193 transitions.
Support contains 49 out of 133 places after structural reductions.
[2024-06-08 00:57:35] [INFO ] Flatten gal took : 7759 ms
[2024-06-08 00:57:43] [INFO ] Flatten gal took : 7393 ms
[2024-06-08 00:57:52] [INFO ] Input system was already deterministic with 33894 transitions.
RANDOM walk for 40000 steps (8 resets) in 14645 ms. (2 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 134 ms. (29 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 143 ms. (27 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (8 resets) in 142 ms. (27 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (8 resets) in 132 ms. (30 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (8 resets) in 153 ms. (25 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 112 ms. (35 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 139 ms. (28 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 128 ms. (31 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 129 ms. (30 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 86 ms. (46 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 89 ms. (44 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 91 ms. (43 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 71 ms. (55 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 111 ms. (35 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 98 ms. (40 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 107 ms. (37 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 119 ms. (33 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 152 ms. (26 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 142 ms. (28 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 139 ms. (28 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 132 ms. (30 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 118 ms. (33 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 118 ms. (33 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 122 ms. (32 steps per ms) remains 24/24 properties
Interrupted probabilistic random walk after 108076 steps, run timeout after 15002 ms. (steps per millisecond=7 ) properties seen :4 out of 24
Probabilistic random walk after 108076 steps, saw 51315 distinct states, run finished after 15008 ms. (steps per millisecond=7 ) properties seen :4
[2024-06-08 00:58:13] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
SMT process timed out in 6218ms, After SMT, problems are : Problem set: 0 solved, 20 unsolved
Fused 20 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 49 out of 133 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 33894/33894 transitions.
Graph (complete) has 1197 edges and 133 vertex of which 131 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.315 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 35 rules applied. Total rules applied 36 place count 131 transition count 33857
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 59 place count 108 transition count 33857
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 12 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 123 place count 76 transition count 33825
Free-agglomeration rule applied 6 times.
Iterating global reduction 2 with 6 rules applied. Total rules applied 129 place count 76 transition count 33819
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 135 place count 70 transition count 33819
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 136 place count 69 transition count 33818
Applied a total of 136 rules in 6646 ms. Remains 69 /133 variables (removed 64) and now considering 33818/33894 (removed 76) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6650 ms. Remains : 69/133 places, 33818/33894 transitions.
RANDOM walk for 40000 steps (8 resets) in 57395 ms. (0 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (4 resets) in 774 ms. (5 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 1103 ms. (3 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (1 resets) in 440 ms. (9 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (0 resets) in 322 ms. (12 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (2 resets) in 473 ms. (8 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (2 resets) in 563 ms. (7 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (3 resets) in 545 ms. (7 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 466 ms. (8 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (6 resets) in 533 ms. (7 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (5 resets) in 619 ms. (6 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (5 resets) in 615 ms. (6 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (5 resets) in 638 ms. (6 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (2 resets) in 447 ms. (8 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (0 resets) in 441 ms. (9 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 503 ms. (7 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (6 resets) in 489 ms. (8 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (0 resets) in 402 ms. (9 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (5 resets) in 637 ms. (6 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (4 resets) in 502 ms. (7 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 566 ms. (7 steps per ms) remains 20/20 properties
Interrupted probabilistic random walk after 466878 steps, run timeout after 60001 ms. (steps per millisecond=7 ) properties seen :1 out of 20
Probabilistic random walk after 466878 steps, saw 67806 distinct states, run finished after 60002 ms. (steps per millisecond=7 ) properties seen :1
// Phase 1: matrix 33818 rows 69 cols
[2024-06-08 00:59:47] [INFO ] Computed 12 invariants in 365 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 20/69 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 33818/33887 variables, 69/81 constraints. Problems are: Problem set: 0 solved, 19 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 33887/33887 variables, and 81 constraints, problems are : Problem set: 0 solved, 19 unsolved in 45044 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 69/69 constraints, PredecessorRefiner: 19/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 19 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 20/69 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 33818/33887 variables, 69/81 constraints. Problems are: Problem set: 0 solved, 19 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 33887/33887 variables, and 81 constraints, problems are : Problem set: 0 solved, 19 unsolved in 45030 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 69/69 constraints, PredecessorRefiner: 19/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 91074ms problems are : Problem set: 0 solved, 19 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 49 out of 69 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 69/69 places, 33818/33818 transitions.
Applied a total of 0 rules in 911 ms. Remains 69 /69 variables (removed 0) and now considering 33818/33818 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 916 ms. Remains : 69/69 places, 33818/33818 transitions.
Computed a total of 45 stabilizing places and 57 stable transitions
Graph (complete) has 1197 edges and 133 vertex of which 131 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.720 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(F((G(p0)||(F(p1)&&X(X(X(F(p2)))))))))'
Support contains 19 out of 133 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 133/133 places, 33894/33894 transitions.
Applied a total of 0 rules in 388 ms. Remains 133 /133 variables (removed 0) and now considering 33894/33894 (removed 0) transitions.
// Phase 1: matrix 33894 rows 133 cols
[2024-06-08 01:01:21] [INFO ] Computed 0 invariants in 1459 ms
[2024-06-08 01:01:29] [INFO ] Implicit Places using invariants in 8688 ms returned []
Implicit Place search using SMT only with invariants took 8694 ms to find 0 implicit places.
Running 33893 sub problems to find dead transitions.
[2024-06-08 01:01:29] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 132/34027 variables, and 0 constraints, problems are : Problem set: 0 solved, 33893 unsolved in 30550 ms.
Refiners :[State Equation: 0/133 constraints, PredecessorRefiner: 33893/72 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 33893 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 132/34027 variables, and 0 constraints, problems are : Problem set: 0 solved, 33893 unsolved in 30603 ms.
Refiners :[State Equation: 0/133 constraints, PredecessorRefiner: 33821/72 constraints, Known Traps: 0/0 constraints]
After SMT, in 820196ms problems are : Problem set: 0 solved, 33893 unsolved
Search for dead transitions found 0 dead transitions in 820645ms
Finished structural reductions in LTL mode , in 1 iterations and 829914 ms. Remains : 133/133 places, 33894/33894 transitions.
Stuttering acceptance computed with spot in 504 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : ResIsolation-PT-N10P2-LTLFireability-00
Product exploration timeout after 43090 steps with 1 reset in 10001 ms.
Stack based approach found an accepted trace after 24 steps with 0 reset with depth 25 and stack size 25 in 6 ms.
FORMULA ResIsolation-PT-N10P2-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property ResIsolation-PT-N10P2-LTLFireability-00 finished in 840816 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)))'
Support contains 12 out of 133 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 133/133 places, 33894/33894 transitions.
Graph (trivial) has 89 edges and 133 vertex of which 24 / 133 are part of one of the 8 SCC in 5 ms
Free SCC test removed 16 places
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Graph (complete) has 1173 edges and 117 vertex of which 115 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.457 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 16 place count 114 transition count 33861
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 30 place count 100 transition count 33861
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 30 place count 100 transition count 33849
Deduced a syphon composed of 12 places in 59 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 54 place count 88 transition count 33849
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 16 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 78 place count 76 transition count 33837
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 9 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 84 place count 73 transition count 33845
Applied a total of 84 rules in 4799 ms. Remains 73 /133 variables (removed 60) and now considering 33845/33894 (removed 49) transitions.
[2024-06-08 01:15:25] [INFO ] Flow matrix only has 33838 transitions (discarded 7 similar events)
// Phase 1: matrix 33838 rows 73 cols
[2024-06-08 01:15:26] [INFO ] Computed 0 invariants in 513 ms
[2024-06-08 01:15:33] [INFO ] Implicit Places using invariants in 7989 ms returned []
Implicit Place search using SMT only with invariants took 8009 ms to find 0 implicit places.
Running 33827 sub problems to find dead transitions.
[2024-06-08 01:15:34] [INFO ] Flow matrix only has 33838 transitions (discarded 7 similar events)
[2024-06-08 01:15:34] [INFO ] Invariant cache hit.
FORMULA ResIsolation-PT-N10P2-LTLFireability-00 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA ResIsolation-PT-N10P2-LTLFireability-01 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : ResIsolation-PT-N10P2-LTLFireability-02
FORMULA ResIsolation-PT-N10P2-LTLFireability-03 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA ResIsolation-PT-N10P2-LTLFireability-04 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : ResIsolation-PT-N10P2-LTLFireability-05
FORMULA ResIsolation-PT-N10P2-LTLFireability-06 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA ResIsolation-PT-N10P2-LTLFireability-07 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : ResIsolation-PT-N10P2-LTLFireability-08
FORMULA ResIsolation-PT-N10P2-LTLFireability-09 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA ResIsolation-PT-N10P2-LTLFireability-10 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA ResIsolation-PT-N10P2-LTLFireability-11 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA ResIsolation-PT-N10P2-LTLFireability-12 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA ResIsolation-PT-N10P2-LTLFireability-13 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : ResIsolation-PT-N10P2-LTLFireability-14
FORMULA ResIsolation-PT-N10P2-LTLFireability-15 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
BK_STOP 1717810486664
--------------------
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 ResIsolation-PT-N10P2-LTLFireability-00
ltl formula formula --ltl=/tmp/677/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 367 places, 37193 transitions and 885405 arcs
pnml2lts-mc( 0/ 4): Petri net ResIsolation-PT-N10P2 analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 7.330 real 3.250 user 1.500 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/677/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/677/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/677/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/677/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): There are 356 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 368, there are 37198 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 ~8!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 18
pnml2lts-mc( 0/ 4): unique transitions count: 47
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: 32
pnml2lts-mc( 0/ 4): - cum. max stack depth: 32
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 32 states 79 transitions, fanout: 2.469
pnml2lts-mc( 0/ 4): Total exploration time 0.040 sec (0.030 sec minimum, 0.035 sec on average)
pnml2lts-mc( 0/ 4): States per second: 800, Transitions per second: 1975
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, 45.0 B/state, compr.: 3.1%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 38177 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 2MB
pnml2lts-mc( 0/ 4): Est. total memory use: 2.0MB (~258.0MB paged-in)
ltl formula name ResIsolation-PT-N10P2-LTLFireability-01
ltl formula formula --ltl=/tmp/677/ltl_1_
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 367 places, 37193 transitions and 885405 arcs
pnml2lts-mc( 0/ 4): Petri net ResIsolation-PT-N10P2 analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 6.420 real 3.310 user 1.360 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/677/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/677/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/677/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/677/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 357 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 368, there are 37196 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 ~18!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 71
pnml2lts-mc( 0/ 4): unique transitions count: 289
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: 80
pnml2lts-mc( 0/ 4): - cum. max stack depth: 80
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 80 states 315 transitions, fanout: 3.938
pnml2lts-mc( 0/ 4): Total exploration time 0.090 sec (0.090 sec minimum, 0.090 sec on average)
pnml2lts-mc( 0/ 4): States per second: 889, Transitions per second: 3500
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, 31.4 B/state, compr.: 2.1%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 38177 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 2MB
pnml2lts-mc( 0/ 4): Est. total memory use: 2.0MB (~258.0MB paged-in)
ltl formula name ResIsolation-PT-N10P2-LTLFireability-02
ltl formula formula --ltl=/tmp/677/ltl_2_
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 367 places, 37193 transitions and 885405 arcs
pnml2lts-mc( 0/ 4): Petri net ResIsolation-PT-N10P2 analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 6.530 real 3.640 user 1.510 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/677/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/677/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/677/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/677/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): There are 356 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 368, there are 37199 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 ~90184 transitions
pnml2lts-mc( 3/ 4): ~5000 levels ~20000 states ~180184 transitions
pnml2lts-mc( 3/ 4): ~9994 levels ~40000 states ~342764 transitions
pnml2lts-mc( 3/ 4): ~11917 levels ~80000 states ~693940 transitions
pnml2lts-mc( 3/ 4): ~11917 levels ~160000 states ~1417396 transitions
ltl formula name ResIsolation-PT-N10P2-LTLFireability-03
ltl formula formula --ltl=/tmp/677/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 367 places, 37193 transitions and 885405 arcs
pnml2lts-mc( 0/ 4): Petri net ResIsolation-PT-N10P2 analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 6.830 real 3.510 user 1.530 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/677/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/677/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/677/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/677/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): There are 356 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 368, there are 37197 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 ~14!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 42
pnml2lts-mc( 0/ 4): unique transitions count: 187
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: 51
pnml2lts-mc( 0/ 4): - cum. max stack depth: 51
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 51 states 208 transitions, fanout: 4.078
pnml2lts-mc( 0/ 4): Total exploration time 0.070 sec (0.070 sec minimum, 0.070 sec on average)
pnml2lts-mc( 0/ 4): States per second: 729, Transitions per second: 2971
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, 32.9 B/state, compr.: 2.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 38177 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 2MB
pnml2lts-mc( 0/ 4): Est. total memory use: 2.0MB (~258.0MB paged-in)
ltl formula name ResIsolation-PT-N10P2-LTLFireability-04
ltl formula formula --ltl=/tmp/677/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 367 places, 37193 transitions and 885405 arcs
pnml2lts-mc( 0/ 4): Petri net ResIsolation-PT-N10P2 analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 13.470 real 3.670 user 1.930 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/677/ltl_4_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/677/ltl_4_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/677/ltl_4_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/677/ltl_4_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): There are 356 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 368, there are 37201 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: 1
pnml2lts-mc( 0/ 4): unique states count: 1
pnml2lts-mc( 0/ 4): unique transitions count: 0
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: 4
pnml2lts-mc( 0/ 4): - cum. max stack depth: 4
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 4 states 4 transitions, fanout: 1.000
pnml2lts-mc( 0/ 4): Total exploration time 0.010 sec (0.010 sec minimum, 0.010 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, 72.0 B/state, compr.: 4.9%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 38177 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 2MB
pnml2lts-mc( 0/ 4): Est. total memory use: 2.0MB (~258.0MB paged-in)
ltl formula name ResIsolation-PT-N10P2-LTLFireability-05
ltl formula formula --ltl=/tmp/677/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 367 places, 37193 transitions and 885405 arcs
pnml2lts-mc( 0/ 4): Petri net ResIsolation-PT-N10P2 analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 6.980 real 3.450 user 1.790 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/677/ltl_5_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/677/ltl_5_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/677/ltl_5_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/677/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 357 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 368, there are 37202 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): ~102 levels ~10000 states ~41768 transitions
pnml2lts-mc( 0/ 4): ~102 levels ~20000 states ~83552 transitions
pnml2lts-mc( 0/ 4): ~102 levels ~40000 states ~183680 transitions
pnml2lts-mc( 0/ 4): ~102 levels ~80000 states ~389588 transitions
pnml2lts-mc( 0/ 4): ~102 levels ~160000 states ~784968 transitions
ltl formula name ResIsolation-PT-N10P2-LTLFireability-06
ltl formula formula --ltl=/tmp/677/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 367 places, 37193 transitions and 885405 arcs
pnml2lts-mc( 0/ 4): Petri net ResIsolation-PT-N10P2 analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 6.550 real 3.650 user 1.410 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/677/ltl_6_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/677/ltl_6_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/677/ltl_6_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/677/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 357 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 368, there are 37198 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 ~16!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 58
pnml2lts-mc( 0/ 4): unique transitions count: 303
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: 69
pnml2lts-mc( 0/ 4): - cum. max stack depth: 69
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 69 states 337 transitions, fanout: 4.884
pnml2lts-mc( 0/ 4): Total exploration time 0.080 sec (0.080 sec minimum, 0.080 sec on average)
pnml2lts-mc( 0/ 4): States per second: 862, Transitions per second: 4212
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, 30.3 B/state, compr.: 2.1%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 38177 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 2MB
pnml2lts-mc( 0/ 4): Est. total memory use: 2.0MB (~258.0MB paged-in)
ltl formula name ResIsolation-PT-N10P2-LTLFireability-07
ltl formula formula --ltl=/tmp/677/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 367 places, 37193 transitions and 885405 arcs
pnml2lts-mc( 0/ 4): Petri net ResIsolation-PT-N10P2 analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 6.760 real 3.490 user 1.570 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/677/ltl_7_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/677/ltl_7_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/677/ltl_7_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/677/ltl_7_
pnml2lts-mc( 0/ 4): buchi has 8 states
pnml2lts-mc( 0/ 4): There are 356 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 368, there are 37219 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 ~11!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 30
pnml2lts-mc( 0/ 4): unique transitions count: 190
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 3
pnml2lts-mc( 0/ 4): - claim success count: 42
pnml2lts-mc( 0/ 4): - cum. max stack depth: 42
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 42 states 253 transitions, fanout: 6.024
pnml2lts-mc( 0/ 4): Total exploration time 0.060 sec (0.050 sec minimum, 0.053 sec on average)
pnml2lts-mc( 0/ 4): States per second: 700, Transitions per second: 4217
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, 34.5 B/state, compr.: 2.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 38177 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 2MB
pnml2lts-mc( 0/ 4): Est. total memory use: 2.0MB (~258.0MB paged-in)
ltl formula name ResIsolation-PT-N10P2-LTLFireability-08
ltl formula formula --ltl=/tmp/677/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 367 places, 37193 transitions and 885405 arcs
pnml2lts-mc( 0/ 4): Petri net ResIsolation-PT-N10P2 analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 6.680 real 3.340 user 1.490 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/677/ltl_8_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/677/ltl_8_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/677/ltl_8_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/677/ltl_8_
pnml2lts-mc( 0/ 4): buchi has 7 states
pnml2lts-mc( 0/ 4): There are 356 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 368, there are 37211 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): ~1773 levels ~10000 states ~68252 transitions
pnml2lts-mc( 0/ 4): ~1773 levels ~20000 states ~134608 transitions
pnml2lts-mc( 0/ 4): ~2700 levels ~40000 states ~275248 transitions
pnml2lts-mc( 0/ 4): ~3595 levels ~80000 states ~554748 transitions
pnml2lts-mc( 3/ 4): ~401 levels ~160000 states ~1004376 transitions
ltl formula name ResIsolation-PT-N10P2-LTLFireability-09
ltl formula formula --ltl=/tmp/677/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 367 places, 37193 transitions and 885405 arcs
pnml2lts-mc( 0/ 4): Petri net ResIsolation-PT-N10P2 analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 6.350 real 3.450 user 1.530 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/677/ltl_9_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/677/ltl_9_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/677/ltl_9_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/677/ltl_9_
pnml2lts-mc( 0/ 4): buchi has 14 states
pnml2lts-mc( 0/ 4): There are 356 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 368, there are 37232 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 ~22!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 95
pnml2lts-mc( 0/ 4): unique transitions count: 465
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: 104
pnml2lts-mc( 0/ 4): - cum. max stack depth: 104
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 104 states 486 transitions, fanout: 4.673
pnml2lts-mc( 0/ 4): Total exploration time 0.130 sec (0.130 sec minimum, 0.130 sec on average)
pnml2lts-mc( 0/ 4): States per second: 800, Transitions per second: 3738
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, 28.2 B/state, compr.: 1.9%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 38177 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 2MB
pnml2lts-mc( 0/ 4): Est. total memory use: 2.0MB (~258.0MB paged-in)
ltl formula name ResIsolation-PT-N10P2-LTLFireability-10
ltl formula formula --ltl=/tmp/677/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 367 places, 37193 transitions and 885405 arcs
pnml2lts-mc( 0/ 4): Petri net ResIsolation-PT-N10P2 analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 6.780 real 3.440 user 1.590 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/677/ltl_10_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/677/ltl_10_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/677/ltl_10_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/677/ltl_10_
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 357 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 368, there are 37210 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 ~8!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 30
pnml2lts-mc( 0/ 4): unique transitions count: 105
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: 39
pnml2lts-mc( 0/ 4): - cum. max stack depth: 39
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 39 states 128 transitions, fanout: 3.282
pnml2lts-mc( 0/ 4): Total exploration time 0.050 sec (0.050 sec minimum, 0.050 sec on average)
pnml2lts-mc( 0/ 4): States per second: 780, Transitions per second: 2560
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, 38.9 B/state, compr.: 2.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 38177 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 2MB
pnml2lts-mc( 0/ 4): Est. total memory use: 2.0MB (~258.0MB paged-in)
ltl formula name ResIsolation-PT-N10P2-LTLFireability-11
ltl formula formula --ltl=/tmp/677/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 367 places, 37193 transitions and 885405 arcs
pnml2lts-mc( 0/ 4): Petri net ResIsolation-PT-N10P2 analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 6.880 real 3.600 user 1.550 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/677/ltl_11_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/677/ltl_11_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/677/ltl_11_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/677/ltl_11_
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 357 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 368, there are 37211 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.010 sec (0.010 sec minimum, 0.010 sec on average)
pnml2lts-mc( 0/ 4): States per second: 800, Transitions per second: 800
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, 88.0 B/state, compr.: 6.0%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 38177 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 2MB
pnml2lts-mc( 0/ 4): Est. total memory use: 2.0MB (~258.0MB paged-in)
ltl formula name ResIsolation-PT-N10P2-LTLFireability-12
ltl formula formula --ltl=/tmp/677/ltl_12_
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 367 places, 37193 transitions and 885405 arcs
pnml2lts-mc( 0/ 4): Petri net ResIsolation-PT-N10P2 analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 9.090 real 3.650 user 1.730 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/677/ltl_12_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/677/ltl_12_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/677/ltl_12_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/677/ltl_12_
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 357 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 368, there are 37207 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: 1
pnml2lts-mc( 0/ 4): unique states count: 1
pnml2lts-mc( 0/ 4): unique transitions count: 0
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: 4
pnml2lts-mc( 0/ 4): - cum. max stack depth: 4
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 4 states 4 transitions, fanout: 1.000
pnml2lts-mc( 0/ 4): Total exploration time 0.010 sec (0.010 sec minimum, 0.010 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, 72.0 B/state, compr.: 4.9%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 38177 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 2MB
pnml2lts-mc( 0/ 4): Est. total memory use: 2.0MB (~258.0MB paged-in)
ltl formula name ResIsolation-PT-N10P2-LTLFireability-13
ltl formula formula --ltl=/tmp/677/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 367 places, 37193 transitions and 885405 arcs
pnml2lts-mc( 0/ 4): Petri net ResIsolation-PT-N10P2 analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 6.680 real 3.390 user 1.580 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/677/ltl_13_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/677/ltl_13_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/677/ltl_13_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/677/ltl_13_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 357 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 368, there are 37196 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 ~9!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 26
pnml2lts-mc( 0/ 4): unique transitions count: 103
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: 35
pnml2lts-mc( 0/ 4): - cum. max stack depth: 35
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 35 states 126 transitions, fanout: 3.600
pnml2lts-mc( 0/ 4): Total exploration time 0.040 sec (0.040 sec minimum, 0.040 sec on average)
pnml2lts-mc( 0/ 4): States per second: 875, Transitions per second: 3150
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, 37.3 B/state, compr.: 2.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 38177 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 2MB
pnml2lts-mc( 0/ 4): Est. total memory use: 2.0MB (~258.0MB paged-in)
ltl formula name ResIsolation-PT-N10P2-LTLFireability-14
ltl formula formula --ltl=/tmp/677/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 367 places, 37193 transitions and 885405 arcs
pnml2lts-mc( 0/ 4): Petri net ResIsolation-PT-N10P2 analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 6.500 real 3.520 user 1.570 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/677/ltl_14_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/677/ltl_14_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/677/ltl_14_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/677/ltl_14_
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 357 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 368, there are 37199 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): ~1176 levels ~10000 states ~67048 transitions
pnml2lts-mc( 0/ 4): ~1176 levels ~20000 states ~136076 transitions
pnml2lts-mc( 0/ 4): ~1176 levels ~40000 states ~270244 transitions
pnml2lts-mc( 0/ 4): ~1176 levels ~80000 states ~552104 transitions
pnml2lts-mc( 3/ 4): ~273 levels ~160000 states ~912828 transitions
ltl formula name ResIsolation-PT-N10P2-LTLFireability-15
ltl formula formula --ltl=/tmp/677/ltl_15_
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 367 places, 37193 transitions and 885405 arcs
pnml2lts-mc( 0/ 4): Petri net ResIsolation-PT-N10P2 analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 6.490 real 3.340 user 1.540 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/677/ltl_15_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/677/ltl_15_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/677/ltl_15_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/677/ltl_15_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 357 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 368, there are 37195 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.000 sec (0.000 sec minimum, 0.000 sec on average)
pnml2lts-mc( 0/ 4): States per second: inf, Transitions per second: inf
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, 84.0 B/state, compr.: 5.7%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 38177 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 2MB
pnml2lts-mc( 0/ 4): Est. total memory use: 2.0MB (~258.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="ResIsolation-PT-N10P2"
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 ResIsolation-PT-N10P2, 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 r631-smll-171774447100092"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ResIsolation-PT-N10P2.tgz
mv ResIsolation-PT-N10P2 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 '
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 ;