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.r536-tall-171690533400900.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 Szymanski-PT-b12, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r536-tall-171690533400900
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.0M
-rw-r--r-- 1 mcc users 7.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 16:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 19:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.3K Apr 11 15:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 69K Apr 11 15:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 08:02 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 08:02 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 3.7M May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME Szymanski-PT-b12-LTLFireability-00
FORMULA_NAME Szymanski-PT-b12-LTLFireability-01
FORMULA_NAME Szymanski-PT-b12-LTLFireability-02
FORMULA_NAME Szymanski-PT-b12-LTLFireability-03
FORMULA_NAME Szymanski-PT-b12-LTLFireability-04
FORMULA_NAME Szymanski-PT-b12-LTLFireability-05
FORMULA_NAME Szymanski-PT-b12-LTLFireability-06
FORMULA_NAME Szymanski-PT-b12-LTLFireability-07
FORMULA_NAME Szymanski-PT-b12-LTLFireability-08
FORMULA_NAME Szymanski-PT-b12-LTLFireability-09
FORMULA_NAME Szymanski-PT-b12-LTLFireability-10
FORMULA_NAME Szymanski-PT-b12-LTLFireability-11
FORMULA_NAME Szymanski-PT-b12-LTLFireability-12
FORMULA_NAME Szymanski-PT-b12-LTLFireability-13
FORMULA_NAME Szymanski-PT-b12-LTLFireability-14
FORMULA_NAME Szymanski-PT-b12-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717285263083

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Szymanski-PT-b12
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 23:41:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 23:41:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 23:41:04] [INFO ] Load time of PNML (sax parser for PT used): 340 ms
[2024-06-01 23:41:04] [INFO ] Transformed 568 places.
[2024-06-01 23:41:04] [INFO ] Transformed 8320 transitions.
[2024-06-01 23:41:04] [INFO ] Parsed PT model containing 568 places and 8320 transitions and 33408 arcs in 483 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 260 places in 18 ms
Reduce places removed 260 places and 256 transitions.
FORMULA Szymanski-PT-b12-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 53 out of 308 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 308/308 places, 8064/8064 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 306 transition count 8064
Applied a total of 2 rules in 136 ms. Remains 306 /308 variables (removed 2) and now considering 8064/8064 (removed 0) transitions.
[2024-06-01 23:41:05] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
// Phase 1: matrix 2733 rows 306 cols
[2024-06-01 23:41:05] [INFO ] Computed 1 invariants in 74 ms
[2024-06-01 23:41:05] [INFO ] Implicit Places using invariants in 583 ms returned []
[2024-06-01 23:41:05] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
[2024-06-01 23:41:05] [INFO ] Invariant cache hit.
[2024-06-01 23:41:06] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-06-01 23:41:36] [INFO ] Performed 261/306 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-06-01 23:41:41] [INFO ] Implicit Places using invariants and state equation in 36073 ms returned []
Implicit Place search using SMT with State Equation took 36688 ms to find 0 implicit places.
Running 8062 sub problems to find dead transitions.
[2024-06-01 23:41:41] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
[2024-06-01 23:41:41] [INFO ] Invariant cache hit.
[2024-06-01 23:41:41] [INFO ] State equation strengthened by 147 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 8062 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 306/3039 variables, and 1 constraints, problems are : Problem set: 0 solved, 8062 unsolved in 30229 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/306 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 8062/8062 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8062 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 8062 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 306/3039 variables, and 1 constraints, problems are : Problem set: 0 solved, 8062 unsolved in 30108 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/306 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 0/8062 constraints, Known Traps: 0/0 constraints]
After SMT, in 88416ms problems are : Problem set: 0 solved, 8062 unsolved
Search for dead transitions found 0 dead transitions in 88530ms
Starting structural reductions in LTL mode, iteration 1 : 306/308 places, 8064/8064 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 125410 ms. Remains : 306/308 places, 8064/8064 transitions.
Support contains 53 out of 306 places after structural reductions.
[2024-06-01 23:43:11] [INFO ] Flatten gal took : 524 ms
[2024-06-01 23:43:11] [INFO ] Flatten gal took : 282 ms
[2024-06-01 23:43:11] [INFO ] Input system was already deterministic with 8064 transitions.
Support contains 51 out of 306 places (down from 53) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 28 to 27
RANDOM walk for 40014 steps (9 resets) in 949 ms. (42 steps per ms) remains 25/27 properties
BEST_FIRST walk for 4003 steps (8 resets) in 47 ms. (83 steps per ms) remains 24/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 20/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 50 ms. (78 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (8 resets) in 49 ms. (80 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 39 ms. (100 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 19/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 18/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 18/18 properties
[2024-06-01 23:43:12] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
[2024-06-01 23:43:12] [INFO ] Invariant cache hit.
[2024-06-01 23:43:12] [INFO ] State equation strengthened by 147 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 270/306 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 18 unsolved
Problem AtomicPropp14 is UNSAT
At refinement iteration 3 (OVERLAPS) 2733/3039 variables, 306/307 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3039 variables, 147/454 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3039 variables, 0/454 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 0/3039 variables, 0/454 constraints. Problems are: Problem set: 1 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3039/3039 variables, and 454 constraints, problems are : Problem set: 1 solved, 17 unsolved in 3413 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 306/306 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 273/306 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 2733/3039 variables, 306/307 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3039 variables, 147/454 constraints. Problems are: Problem set: 1 solved, 17 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3039/3039 variables, and 471 constraints, problems are : Problem set: 1 solved, 17 unsolved in 5021 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 306/306 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 17/18 constraints, Known Traps: 0/0 constraints]
After SMT, in 8551ms problems are : Problem set: 1 solved, 17 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 33 out of 306 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Applied a total of 0 rules in 467 ms. Remains 306 /306 variables (removed 0) and now considering 8064/8064 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 469 ms. Remains : 306/306 places, 8064/8064 transitions.
RANDOM walk for 40029 steps (12 resets) in 285 ms. (139 steps per ms) remains 15/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 15/15 properties
[2024-06-01 23:43:21] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
[2024-06-01 23:43:21] [INFO ] Invariant cache hit.
[2024-06-01 23:43:21] [INFO ] State equation strengthened by 147 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 277/306 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 2733/3039 variables, 306/307 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3039 variables, 147/454 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3039 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 0/3039 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3039/3039 variables, and 454 constraints, problems are : Problem set: 0 solved, 15 unsolved in 2256 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 306/306 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 277/306 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 2733/3039 variables, 306/307 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3039 variables, 147/454 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3039 variables, 15/469 constraints. Problems are: Problem set: 0 solved, 15 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3039/3039 variables, and 469 constraints, problems are : Problem set: 0 solved, 15 unsolved in 45015 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 306/306 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
After SMT, in 47363ms problems are : Problem set: 0 solved, 15 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 29 out of 306 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Applied a total of 0 rules in 224 ms. Remains 306 /306 variables (removed 0) and now considering 8064/8064 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 224 ms. Remains : 306/306 places, 8064/8064 transitions.
RANDOM walk for 40018 steps (9 resets) in 168 ms. (236 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 15/15 properties
Interrupted probabilistic random walk after 108251 steps, run timeout after 3001 ms. (steps per millisecond=36 ) properties seen :2 out of 15
Probabilistic random walk after 108251 steps, saw 85260 distinct states, run finished after 3006 ms. (steps per millisecond=36 ) properties seen :2
[2024-06-01 23:44:12] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
[2024-06-01 23:44:12] [INFO ] Invariant cache hit.
[2024-06-01 23:44:12] [INFO ] State equation strengthened by 147 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 280/306 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 2733/3039 variables, 306/307 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3039 variables, 147/454 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3039 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (OVERLAPS) 0/3039 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3039/3039 variables, and 454 constraints, problems are : Problem set: 0 solved, 13 unsolved in 2965 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 306/306 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 280/306 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 2733/3039 variables, 306/307 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3039 variables, 147/454 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3039 variables, 13/467 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3039 variables, 0/467 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3039/3039 variables, and 467 constraints, problems are : Problem set: 0 solved, 13 unsolved in 75013 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 306/306 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
After SMT, in 78057ms problems are : Problem set: 0 solved, 13 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 26 out of 306 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Applied a total of 0 rules in 359 ms. Remains 306 /306 variables (removed 0) and now considering 8064/8064 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 359 ms. Remains : 306/306 places, 8064/8064 transitions.
Successfully simplified 1 atomic propositions for a total of 15 simplifications.
FORMULA Szymanski-PT-b12-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 12 stabilizing places and 2432 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 305 transition count 7936
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 305 transition count 7936
Applied a total of 2 rules in 121 ms. Remains 305 /306 variables (removed 1) and now considering 7936/8064 (removed 128) transitions.
[2024-06-01 23:45:31] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2024-06-01 23:45:31] [INFO ] Computed 1 invariants in 28 ms
[2024-06-01 23:45:31] [INFO ] Implicit Places using invariants in 548 ms returned []
[2024-06-01 23:45:31] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-06-01 23:45:31] [INFO ] Invariant cache hit.
[2024-06-01 23:45:33] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-06-01 23:46:03] [INFO ] Performed 279/305 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-06-01 23:46:14] [INFO ] Implicit Places using invariants and state equation in 42171 ms returned []
Implicit Place search using SMT with State Equation took 42737 ms to find 0 implicit places.
Running 7934 sub problems to find dead transitions.
[2024-06-01 23:46:14] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-06-01 23:46:14] [INFO ] Invariant cache hit.
[2024-06-01 23:46:14] [INFO ] State equation strengthened by 147 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7934 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 305/3037 variables, and 1 constraints, problems are : Problem set: 0 solved, 7934 unsolved in 30118 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/305 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 7934/7934 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7934 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7934 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 305/3037 variables, and 1 constraints, problems are : Problem set: 0 solved, 7934 unsolved in 30098 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/305 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 0/7934 constraints, Known Traps: 0/0 constraints]
After SMT, in 89702ms problems are : Problem set: 0 solved, 7934 unsolved
Search for dead transitions found 0 dead transitions in 89776ms
Starting structural reductions in LTL mode, iteration 1 : 305/306 places, 7936/8064 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 132657 ms. Remains : 305/306 places, 7936/8064 transitions.
Stuttering acceptance computed with spot in 202 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Szymanski-PT-b12-LTLFireability-00
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA Szymanski-PT-b12-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Szymanski-PT-b12-LTLFireability-00 finished in 132926 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X(X(G(p1)))))'
Support contains 4 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 305 transition count 7936
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 305 transition count 7936
Applied a total of 2 rules in 80 ms. Remains 305 /306 variables (removed 1) and now considering 7936/8064 (removed 128) transitions.
[2024-06-01 23:47:44] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-06-01 23:47:44] [INFO ] Invariant cache hit.
[2024-06-01 23:47:44] [INFO ] Implicit Places using invariants in 436 ms returned []
[2024-06-01 23:47:44] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-06-01 23:47:44] [INFO ] Invariant cache hit.
[2024-06-01 23:47:46] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-06-01 23:48:16] [INFO ] Performed 264/305 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-06-01 23:48:31] [INFO ] Implicit Places using invariants and state equation in 47005 ms returned []
Implicit Place search using SMT with State Equation took 47446 ms to find 0 implicit places.
Running 7934 sub problems to find dead transitions.
[2024-06-01 23:48:31] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-06-01 23:48:31] [INFO ] Invariant cache hit.
[2024-06-01 23:48:31] [INFO ] State equation strengthened by 147 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7934 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 305/3037 variables, and 1 constraints, problems are : Problem set: 0 solved, 7934 unsolved in 30126 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/305 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 7934/7934 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7934 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7934 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 305/3037 variables, and 1 constraints, problems are : Problem set: 0 solved, 7934 unsolved in 30098 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/305 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 0/7934 constraints, Known Traps: 0/0 constraints]
After SMT, in 90913ms problems are : Problem set: 0 solved, 7934 unsolved
Search for dead transitions found 0 dead transitions in 90979ms
Starting structural reductions in LTL mode, iteration 1 : 305/306 places, 7936/8064 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 138521 ms. Remains : 305/306 places, 7936/8064 transitions.
Stuttering acceptance computed with spot in 230 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Szymanski-PT-b12-LTLFireability-01
Stuttering criterion allowed to conclude after 16554 steps with 52 reset in 297 ms.
FORMULA Szymanski-PT-b12-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Szymanski-PT-b12-LTLFireability-01 finished in 139078 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(G((X((G(p1) U G((p2 U p3))))||p0))))'
Support contains 7 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 305 transition count 7936
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 305 transition count 7936
Applied a total of 2 rules in 55 ms. Remains 305 /306 variables (removed 1) and now considering 7936/8064 (removed 128) transitions.
[2024-06-01 23:50:03] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-06-01 23:50:03] [INFO ] Invariant cache hit.
[2024-06-01 23:50:03] [INFO ] Implicit Places using invariants in 507 ms returned []
[2024-06-01 23:50:03] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-06-01 23:50:03] [INFO ] Invariant cache hit.
[2024-06-01 23:50:05] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-06-01 23:50:35] [INFO ] Performed 125/305 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-06-01 23:50:48] [INFO ] Implicit Places using invariants and state equation in 44612 ms returned []
Implicit Place search using SMT with State Equation took 45127 ms to find 0 implicit places.
Running 7934 sub problems to find dead transitions.
[2024-06-01 23:50:48] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-06-01 23:50:48] [INFO ] Invariant cache hit.
[2024-06-01 23:50:48] [INFO ] State equation strengthened by 147 read => feed constraints.
FORMULA Szymanski-PT-b12-LTLFireability-00 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA Szymanski-PT-b12-LTLFireability-01 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : Szymanski-PT-b12-LTLFireability-02
FORMULA Szymanski-PT-b12-LTLFireability-03 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA Szymanski-PT-b12-LTLFireability-04 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : Szymanski-PT-b12-LTLFireability-05
Could not compute solution for formula : Szymanski-PT-b12-LTLFireability-06
FORMULA Szymanski-PT-b12-LTLFireability-07 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA Szymanski-PT-b12-LTLFireability-08 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : Szymanski-PT-b12-LTLFireability-09
Could not compute solution for formula : Szymanski-PT-b12-LTLFireability-10
FORMULA Szymanski-PT-b12-LTLFireability-11 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA Szymanski-PT-b12-LTLFireability-12 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA Szymanski-PT-b12-LTLFireability-13 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA Szymanski-PT-b12-LTLFireability-14 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA Szymanski-PT-b12-LTLFireability-15 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717286886289

--------------------
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 Szymanski-PT-b12-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 568 places, 8320 transitions and 33408 arcs
pnml2lts-mc( 0/ 4): Petri net Szymanski-PT-b12 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.820 real 0.250 user 0.290 sys
pnml2lts-mc( 3/ 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( 2/ 4): LTL layer: formula: /tmp/677/ltl_0_
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 310 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 569, there are 8324 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 ~75!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 275
pnml2lts-mc( 0/ 4): unique transitions count: 1674
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: 281
pnml2lts-mc( 0/ 4): - cum. max stack depth: 281
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 281 states 1696 transitions, fanout: 6.036
pnml2lts-mc( 0/ 4): Total exploration time 0.060 sec (0.060 sec minimum, 0.060 sec on average)
pnml2lts-mc( 0/ 4): States per second: 4683, Transitions per second: 28267
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.1MB, 41.9 B/state, compr.: 1.8%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 8571 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.1MB (~256.0MB paged-in)
ltl formula name Szymanski-PT-b12-LTLFireability-01
ltl formula formula --ltl=/tmp/677/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 568 places, 8320 transitions and 33408 arcs
pnml2lts-mc( 0/ 4): Petri net Szymanski-PT-b12 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.800 real 0.320 user 0.270 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( 1/ 4): LTL layer: formula: /tmp/677/ltl_1_
pnml2lts-mc( 0/ 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 310 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 569, there are 8322 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 ~66!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 254
pnml2lts-mc( 0/ 4): unique transitions count: 1574
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: 261
pnml2lts-mc( 0/ 4): - cum. max stack depth: 261
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 261 states 1602 transitions, fanout: 6.138
pnml2lts-mc( 0/ 4): Total exploration time 0.060 sec (0.060 sec minimum, 0.060 sec on average)
pnml2lts-mc( 0/ 4): States per second: 4350, Transitions per second: 26700
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.1MB, 41.9 B/state, compr.: 1.8%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 8571 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.1MB (~256.0MB paged-in)
ltl formula name Szymanski-PT-b12-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 568 places, 8320 transitions and 33408 arcs
pnml2lts-mc( 0/ 4): Petri net Szymanski-PT-b12 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.770 real 0.350 user 0.220 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/677/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/677/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/677/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/677/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 9 states
pnml2lts-mc( 0/ 4): There are 309 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 569, there are 8354 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): ~1430 levels ~10000 states ~46248 transitions
pnml2lts-mc( 0/ 4): ~1430 levels ~20000 states ~100064 transitions
pnml2lts-mc( 2/ 4): ~1684 levels ~40000 states ~240732 transitions
pnml2lts-mc( 2/ 4): ~1888 levels ~80000 states ~506480 transitions
pnml2lts-mc( 2/ 4): ~1932 levels ~160000 states ~1060676 transitions
pnml2lts-mc( 0/ 4): ~1430 levels ~320000 states ~1993268 transitions
pnml2lts-mc( 0/ 4): ~1430 levels ~640000 states ~4073708 transitions
pnml2lts-mc( 1/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 61830
pnml2lts-mc( 0/ 4): unique states count: 953550
pnml2lts-mc( 0/ 4): unique transitions count: 6521674
pnml2lts-mc( 0/ 4): - self-loop count: 53373
pnml2lts-mc( 0/ 4): - claim dead count: 1746527
pnml2lts-mc( 0/ 4): - claim found count: 2467789
pnml2lts-mc( 0/ 4): - claim success count: 953566
pnml2lts-mc( 0/ 4): - cum. max stack depth: 248755
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 953567 states 6521745 transitions, fanout: 6.839
pnml2lts-mc( 0/ 4): Total exploration time 145.120 sec (145.100 sec minimum, 145.113 sec on average)
pnml2lts-mc( 0/ 4): States per second: 6571, Transitions per second: 44940
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 79.9MB, 40.2 B/state, compr.: 1.8%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 6.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 8571 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 79.9MB (~256.0MB paged-in)
ltl formula name Szymanski-PT-b12-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 568 places, 8320 transitions and 33408 arcs
pnml2lts-mc( 0/ 4): Petri net Szymanski-PT-b12 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.780 real 0.280 user 0.230 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/677/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/677/ltl_3_
pnml2lts-mc( 1/ 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 5 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 310 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 569, there are 8330 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 ~72!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 277
pnml2lts-mc( 0/ 4): unique transitions count: 1631
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: 284
pnml2lts-mc( 0/ 4): - cum. max stack depth: 284
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 284 states 1657 transitions, fanout: 5.835
pnml2lts-mc( 0/ 4): Total exploration time 0.060 sec (0.060 sec minimum, 0.060 sec on average)
pnml2lts-mc( 0/ 4): States per second: 4733, Transitions per second: 27617
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.1MB, 42.0 B/state, compr.: 1.8%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 8571 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.1MB (~256.0MB paged-in)
ltl formula name Szymanski-PT-b12-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 568 places, 8320 transitions and 33408 arcs
pnml2lts-mc( 0/ 4): Petri net Szymanski-PT-b12 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.800 real 0.270 user 0.270 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/677/ltl_4_
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( 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 310 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 569, there are 8324 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 ~117!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 479
pnml2lts-mc( 0/ 4): unique transitions count: 2438
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: 484
pnml2lts-mc( 0/ 4): - cum. max stack depth: 484
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 484 states 2456 transitions, fanout: 5.074
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: 5378, Transitions per second: 27289
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.1MB, 47.7 B/state, compr.: 2.1%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 8571 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.1MB (~256.0MB paged-in)
ltl formula name Szymanski-PT-b12-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 568 places, 8320 transitions and 33408 arcs
pnml2lts-mc( 0/ 4): Petri net Szymanski-PT-b12 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.770 real 0.290 user 0.280 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/677/ltl_5_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/677/ltl_5_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/677/ltl_5_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/677/ltl_5_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 310 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 569, there are 8326 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): ~775 levels ~10000 states ~49176 transitions
pnml2lts-mc( 1/ 4): ~775 levels ~20000 states ~101604 transitions
pnml2lts-mc( 1/ 4): ~775 levels ~40000 states ~217184 transitions
pnml2lts-mc( 1/ 4): ~903 levels ~80000 states ~478392 transitions
pnml2lts-mc( 3/ 4): ~1964 levels ~160000 states ~1029676 transitions
pnml2lts-mc( 3/ 4): ~1973 levels ~320000 states ~2198136 transitions
pnml2lts-mc( 3/ 4): ~4425 levels ~640000 states ~4448872 transitions
pnml2lts-mc( 2/ 4): ~4519 levels ~1280000 states ~9409480 transitions
ltl formula name Szymanski-PT-b12-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 568 places, 8320 transitions and 33408 arcs
pnml2lts-mc( 0/ 4): Petri net Szymanski-PT-b12 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.950 real 0.320 user 0.220 sys
pnml2lts-mc( 3/ 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( 2/ 4): LTL layer: formula: /tmp/677/ltl_6_
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 310 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 569, there are 8323 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): ~647 levels ~10000 states ~48924 transitions
pnml2lts-mc( 3/ 4): ~1159 levels ~20000 states ~109776 transitions
pnml2lts-mc( 1/ 4): ~2018 levels ~40000 states ~216324 transitions
pnml2lts-mc( 1/ 4): ~2019 levels ~80000 states ~454660 transitions
pnml2lts-mc( 1/ 4): ~2213 levels ~160000 states ~935512 transitions
pnml2lts-mc( 1/ 4): ~2312 levels ~320000 states ~2057924 transitions
pnml2lts-mc( 0/ 4): ~17633 levels ~640000 states ~4058528 transitions
pnml2lts-mc( 0/ 4): ~17664 levels ~1280000 states ~8120772 transitions
pnml2lts-mc( 0/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 145351
pnml2lts-mc( 0/ 4): unique states count: 1489783
pnml2lts-mc( 0/ 4): unique transitions count: 10368886
pnml2lts-mc( 0/ 4): - self-loop count: 139031
pnml2lts-mc( 0/ 4): - claim dead count: 2969085
pnml2lts-mc( 0/ 4): - claim found count: 4386589
pnml2lts-mc( 0/ 4): - claim success count: 1490135
pnml2lts-mc( 0/ 4): - cum. max stack depth: 345463
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 1490409 states 10373036 transitions, fanout: 6.960
pnml2lts-mc( 0/ 4): Total exploration time 219.350 sec (219.290 sec minimum, 219.305 sec on average)
pnml2lts-mc( 0/ 4): States per second: 6795, Transitions per second: 47290
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 82.3MB, 36.0 B/state, compr.: 1.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 7.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 8571 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 82.3MB (~256.0MB paged-in)
ltl formula name Szymanski-PT-b12-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 568 places, 8320 transitions and 33408 arcs
pnml2lts-mc( 0/ 4): Petri net Szymanski-PT-b12 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.750 real 0.320 user 0.260 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/677/ltl_7_
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( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): There are 309 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 569, there are 8328 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 ~72!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 289
pnml2lts-mc( 0/ 4): unique transitions count: 5349
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: 297
pnml2lts-mc( 0/ 4): - cum. max stack depth: 297
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 297 states 5443 transitions, fanout: 18.327
pnml2lts-mc( 0/ 4): Total exploration time 0.060 sec (0.060 sec minimum, 0.060 sec on average)
pnml2lts-mc( 0/ 4): States per second: 4950, Transitions per second: 90717
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.1MB, 43.5 B/state, compr.: 1.9%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 8571 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.1MB (~256.0MB paged-in)
ltl formula name Szymanski-PT-b12-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 568 places, 8320 transitions and 33408 arcs
pnml2lts-mc( 0/ 4): Petri net Szymanski-PT-b12 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.780 real 0.310 user 0.210 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( 2/ 4): LTL layer: formula: /tmp/677/ltl_8_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/677/ltl_8_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): There are 309 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 569, there are 8328 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 ~117!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 424
pnml2lts-mc( 0/ 4): unique transitions count: 4086
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: 438
pnml2lts-mc( 0/ 4): - cum. max stack depth: 438
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 438 states 4206 transitions, fanout: 9.603
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: 4867, Transitions per second: 46733
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.1MB, 37.7 B/state, compr.: 1.7%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 8571 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.1MB (~256.0MB paged-in)
ltl formula name Szymanski-PT-b12-LTLFireability-09
ltl formula formula --ltl=/tmp/677/ltl_9_
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 568 places, 8320 transitions and 33408 arcs
pnml2lts-mc( 0/ 4): Petri net Szymanski-PT-b12 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.770 real 0.280 user 0.250 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/677/ltl_9_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/677/ltl_9_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/677/ltl_9_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/677/ltl_9_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): There are 309 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 569, there are 8326 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): ~1267 levels ~10000 states ~49696 transitions
pnml2lts-mc( 0/ 4): ~1267 levels ~20000 states ~105412 transitions
pnml2lts-mc( 0/ 4): ~1267 levels ~40000 states ~219460 transitions
pnml2lts-mc( 0/ 4): ~1498 levels ~80000 states ~475276 transitions
pnml2lts-mc( 0/ 4): ~1498 levels ~160000 states ~997148 transitions
pnml2lts-mc( 0/ 4): ~1498 levels ~320000 states ~2019068 transitions
pnml2lts-mc( 0/ 4): ~1498 levels ~640000 states ~4353760 transitions
pnml2lts-mc( 0/ 4): ~1498 levels ~1280000 states ~9008068 transitions
pnml2lts-mc( 0/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 14644
pnml2lts-mc( 0/ 4): unique states count: 1399905
pnml2lts-mc( 0/ 4): unique transitions count: 10140395
pnml2lts-mc( 0/ 4): - self-loop count: 3097
pnml2lts-mc( 0/ 4): - claim dead count: 3403510
pnml2lts-mc( 0/ 4): - claim found count: 4237232
pnml2lts-mc( 0/ 4): - claim success count: 1399911
pnml2lts-mc( 0/ 4): - cum. max stack depth: 233607
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 1399928 states 10140488 transitions, fanout: 7.244
pnml2lts-mc( 0/ 4): Total exploration time 197.270 sec (197.260 sec minimum, 197.262 sec on average)
pnml2lts-mc( 0/ 4): States per second: 7097, Transitions per second: 51404
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 81.7MB, 36.9 B/state, compr.: 1.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 6.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 8571 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 81.7MB (~256.0MB paged-in)
ltl formula name Szymanski-PT-b12-LTLFireability-10
ltl formula formula --ltl=/tmp/677/ltl_10_
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 568 places, 8320 transitions and 33408 arcs
pnml2lts-mc( 0/ 4): Petri net Szymanski-PT-b12 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.760 real 0.280 user 0.240 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/677/ltl_10_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/677/ltl_10_
pnml2lts-mc( 3/ 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 5 states
pnml2lts-mc( 0/ 4): There are 309 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 569, there are 8331 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): ~1794 levels ~10000 states ~48852 transitions
pnml2lts-mc( 3/ 4): ~1794 levels ~20000 states ~102724 transitions
pnml2lts-mc( 3/ 4): ~1794 levels ~40000 states ~218456 transitions
pnml2lts-mc( 3/ 4): ~1794 levels ~80000 states ~468840 transitions
pnml2lts-mc( 2/ 4): ~2118 levels ~160000 states ~983416 transitions
pnml2lts-mc( 2/ 4): ~2121 levels ~320000 states ~2082188 transitions
pnml2lts-mc( 2/ 4): ~2121 levels ~640000 states ~4356768 transitions
ltl formula name Szymanski-PT-b12-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 568 places, 8320 transitions and 33408 arcs
pnml2lts-mc( 0/ 4): Petri net Szymanski-PT-b12 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.840 real 0.280 user 0.250 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/677/ltl_11_
pnml2lts-mc( 0/ 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): buchi has 5 states
pnml2lts-mc( 0/ 4): There are 309 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 569, there are 8332 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 ~115!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 464
pnml2lts-mc( 0/ 4): unique transitions count: 2550
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: 469
pnml2lts-mc( 0/ 4): - cum. max stack depth: 469
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 469 states 2568 transitions, fanout: 5.475
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: 5211, Transitions per second: 28533
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.1MB, 46.4 B/state, compr.: 2.0%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 8571 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.1MB (~256.0MB paged-in)
ltl formula name Szymanski-PT-b12-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 568 places, 8320 transitions and 33408 arcs
pnml2lts-mc( 0/ 4): Petri net Szymanski-PT-b12 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.790 real 0.280 user 0.250 sys
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( 2/ 4): LTL layer: formula: /tmp/677/ltl_12_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 310 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 569, there are 8328 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 ~107!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 429
pnml2lts-mc( 0/ 4): unique transitions count: 2204
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: 436
pnml2lts-mc( 0/ 4): - cum. max stack depth: 436
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 436 states 2230 transitions, fanout: 5.115
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: 4844, Transitions per second: 24778
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.1MB, 44.7 B/state, compr.: 2.0%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 8571 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.1MB (~256.0MB paged-in)
ltl formula name Szymanski-PT-b12-LTLFireability-13
ltl formula formula --ltl=/tmp/677/ltl_13_
Warning: program compiled against libxml 210 using older 209
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
pnml2lts-mc( 0/ 4): Petri net has 568 places, 8320 transitions and 33408 arcs
pnml2lts-mc( 0/ 4): Petri net Szymanski-PT-b12 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.760 real 0.280 user 0.290 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/677/ltl_13_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/677/ltl_13_
pnml2lts-mc( 3/ 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 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 310 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 569, there are 8325 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 ~68!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 272
pnml2lts-mc( 0/ 4): unique transitions count: 1745
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: 277
pnml2lts-mc( 0/ 4): - cum. max stack depth: 277
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 277 states 1763 transitions, fanout: 6.365
pnml2lts-mc( 0/ 4): Total exploration time 0.060 sec (0.060 sec minimum, 0.060 sec on average)
pnml2lts-mc( 0/ 4): States per second: 4617, Transitions per second: 29383
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.1MB, 41.5 B/state, compr.: 1.8%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 8571 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.1MB (~256.0MB paged-in)
ltl formula name Szymanski-PT-b12-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 568 places, 8320 transitions and 33408 arcs
pnml2lts-mc( 0/ 4): Petri net Szymanski-PT-b12 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.790 real 0.290 user 0.230 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( 0/ 4): LTL layer: formula: /tmp/677/ltl_14_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/677/ltl_14_
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 310 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 569, there are 8322 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: 3
pnml2lts-mc( 0/ 4): unique states count: 3
pnml2lts-mc( 0/ 4): unique transitions count: 2
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 1
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 9
pnml2lts-mc( 0/ 4): - cum. max stack depth: 8
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 9 states 12 transitions, fanout: 1.333
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, 109.3 B/state, compr.: 4.8%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 8571 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name Szymanski-PT-b12-LTLFireability-15
ltl formula formula --ltl=/tmp/677/ltl_15_
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): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 568 places, 8320 transitions and 33408 arcs
pnml2lts-mc( 0/ 4): Petri net Szymanski-PT-b12 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.760 real 0.320 user 0.270 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/677/ltl_15_
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( 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 310 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 569, there are 8322 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: 3
pnml2lts-mc( 0/ 4): unique states count: 3
pnml2lts-mc( 0/ 4): unique transitions count: 2
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: 9
pnml2lts-mc( 0/ 4): - cum. max stack depth: 8
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 9 states 12 transitions, fanout: 1.333
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, 109.3 B/state, compr.: 4.8%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 8571 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)

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="Szymanski-PT-b12"
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 Szymanski-PT-b12, 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 r536-tall-171690533400900"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Szymanski-PT-b12.tgz
mv Szymanski-PT-b12 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;