About the Execution of LTSMin+red for BugTracking-PT-q8m064
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16074.691 | 1361844.00 | 4878003.00 | 159.90 | TFFFTFFFFTFFFTFT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2024-input.r472-tajo-171620399500428.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..........................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is BugTracking-PT-q8m064, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r472-tajo-171620399500428
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 8.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 8.5K May 19 15:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 89K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K 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.7K May 19 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 19 15:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 16M May 18 16:42 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 BugTracking-PT-q8m064-LTLFireability-00
FORMULA_NAME BugTracking-PT-q8m064-LTLFireability-01
FORMULA_NAME BugTracking-PT-q8m064-LTLFireability-02
FORMULA_NAME BugTracking-PT-q8m064-LTLFireability-03
FORMULA_NAME BugTracking-PT-q8m064-LTLFireability-04
FORMULA_NAME BugTracking-PT-q8m064-LTLFireability-05
FORMULA_NAME BugTracking-PT-q8m064-LTLFireability-06
FORMULA_NAME BugTracking-PT-q8m064-LTLFireability-07
FORMULA_NAME BugTracking-PT-q8m064-LTLFireability-08
FORMULA_NAME BugTracking-PT-q8m064-LTLFireability-09
FORMULA_NAME BugTracking-PT-q8m064-LTLFireability-10
FORMULA_NAME BugTracking-PT-q8m064-LTLFireability-11
FORMULA_NAME BugTracking-PT-q8m064-LTLFireability-12
FORMULA_NAME BugTracking-PT-q8m064-LTLFireability-13
FORMULA_NAME BugTracking-PT-q8m064-LTLFireability-14
FORMULA_NAME BugTracking-PT-q8m064-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1717224477791
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BugTracking-PT-q8m064
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 06:47:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 06:47:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 06:48:00] [INFO ] Load time of PNML (sax parser for PT used): 773 ms
[2024-06-01 06:48:00] [INFO ] Transformed 754 places.
[2024-06-01 06:48:00] [INFO ] Transformed 27370 transitions.
[2024-06-01 06:48:00] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 994 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 474 places in 95 ms
Reduce places removed 474 places and 23466 transitions.
Initial state reduction rules removed 3 formulas.
FORMULA BugTracking-PT-q8m064-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m064-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m064-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m064-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m064-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m064-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m064-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m064-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m064-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m064-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m064-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m064-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m064-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m064-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 5 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 3904/3904 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 278 transition count 3904
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 277 transition count 3871
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 277 transition count 3871
Applied a total of 4 rules in 107 ms. Remains 277 /280 variables (removed 3) and now considering 3871/3904 (removed 33) transitions.
[2024-06-01 06:48:00] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
// Phase 1: matrix 3707 rows 277 cols
[2024-06-01 06:48:00] [INFO ] Computed 8 invariants in 41 ms
[2024-06-01 06:48:01] [INFO ] Implicit Places using invariants in 641 ms returned []
[2024-06-01 06:48:01] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
[2024-06-01 06:48:01] [INFO ] Invariant cache hit.
[2024-06-01 06:48:01] [INFO ] State equation strengthened by 282 read => feed constraints.
[2024-06-01 06:48:03] [INFO ] Implicit Places using invariants and state equation in 2298 ms returned []
Implicit Place search using SMT with State Equation took 2971 ms to find 0 implicit places.
Running 3869 sub problems to find dead transitions.
[2024-06-01 06:48:03] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
[2024-06-01 06:48:03] [INFO ] Invariant cache hit.
[2024-06-01 06:48:03] [INFO ] State equation strengthened by 282 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/276 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3869 unsolved
[2024-06-01 06:49:10] [INFO ] Deduced a trap composed of 10 places in 265 ms of which 12 ms to minimize.
[2024-06-01 06:49:10] [INFO ] Deduced a trap composed of 7 places in 158 ms of which 2 ms to minimize.
[2024-06-01 06:49:11] [INFO ] Deduced a trap composed of 23 places in 134 ms of which 1 ms to minimize.
[2024-06-01 06:49:19] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 1 ms to minimize.
Problem TDEAD784 is UNSAT
Problem TDEAD790 is UNSAT
Problem TDEAD796 is UNSAT
Problem TDEAD802 is UNSAT
Problem TDEAD808 is UNSAT
Problem TDEAD809 is UNSAT
Problem TDEAD810 is UNSAT
Problem TDEAD811 is UNSAT
Problem TDEAD812 is UNSAT
Problem TDEAD813 is UNSAT
Problem TDEAD814 is UNSAT
Problem TDEAD817 is UNSAT
Problem TDEAD818 is UNSAT
Problem TDEAD819 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 276/3984 variables, and 12 constraints, problems are : Problem set: 14 solved, 3855 unsolved in 30131 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/277 constraints, ReadFeed: 0/282 constraints, PredecessorRefiner: 3869/2672 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 14 solved, 3855 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/276 variables, 8/8 constraints. Problems are: Problem set: 14 solved, 3855 unsolved
Problem TDEAD2706 is UNSAT
Problem TDEAD2715 is UNSAT
Problem TDEAD2727 is UNSAT
Problem TDEAD2731 is UNSAT
Problem TDEAD2740 is UNSAT
Problem TDEAD2752 is UNSAT
Problem TDEAD2756 is UNSAT
Problem TDEAD2765 is UNSAT
Problem TDEAD2777 is UNSAT
Problem TDEAD2781 is UNSAT
Problem TDEAD2782 is UNSAT
Problem TDEAD2783 is UNSAT
Problem TDEAD2784 is UNSAT
Problem TDEAD2785 is UNSAT
Problem TDEAD2786 is UNSAT
Problem TDEAD2787 is UNSAT
Problem TDEAD2788 is UNSAT
Problem TDEAD2789 is UNSAT
Problem TDEAD2790 is UNSAT
Problem TDEAD2794 is UNSAT
Problem TDEAD2795 is UNSAT
Problem TDEAD2796 is UNSAT
Problem TDEAD2797 is UNSAT
Problem TDEAD2798 is UNSAT
Problem TDEAD2799 is UNSAT
Problem TDEAD2800 is UNSAT
Problem TDEAD2801 is UNSAT
Problem TDEAD2802 is UNSAT
Problem TDEAD2803 is UNSAT
Problem TDEAD2804 is UNSAT
Problem TDEAD2805 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/276 variables, 4/12 constraints. Problems are: Problem set: 45 solved, 3824 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 276/3984 variables, and 12 constraints, problems are : Problem set: 45 solved, 3824 unsolved in 30091 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/277 constraints, ReadFeed: 0/282 constraints, PredecessorRefiner: 1197/2672 constraints, Known Traps: 4/4 constraints]
After SMT, in 107583ms problems are : Problem set: 45 solved, 3824 unsolved
Search for dead transitions found 45 dead transitions in 107667ms
Found 45 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 45 transitions
Dead transitions reduction (with SMT) removed 45 transitions
Starting structural reductions in LTL mode, iteration 1 : 277/280 places, 3826/3904 transitions.
Reduce places removed 11 places and 334 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 266 transition count 3492
Reduce places removed 5 places and 152 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 16 place count 261 transition count 3340
Reduce places removed 2 places and 56 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 18 place count 259 transition count 3284
Reduce places removed 1 places and 32 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 19 place count 258 transition count 3252
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 20 place count 257 transition count 3227
Iterating global reduction 4 with 1 rules applied. Total rules applied 21 place count 257 transition count 3227
Applied a total of 21 rules in 102 ms. Remains 257 /277 variables (removed 20) and now considering 3227/3826 (removed 599) transitions.
[2024-06-01 06:49:51] [INFO ] Flow matrix only has 3100 transitions (discarded 127 similar events)
// Phase 1: matrix 3100 rows 257 cols
[2024-06-01 06:49:51] [INFO ] Computed 8 invariants in 18 ms
[2024-06-01 06:49:52] [INFO ] Implicit Places using invariants in 494 ms returned []
[2024-06-01 06:49:52] [INFO ] Flow matrix only has 3100 transitions (discarded 127 similar events)
[2024-06-01 06:49:52] [INFO ] Invariant cache hit.
[2024-06-01 06:49:52] [INFO ] State equation strengthened by 251 read => feed constraints.
[2024-06-01 06:49:53] [INFO ] Implicit Places using invariants and state equation in 1637 ms returned []
Implicit Place search using SMT with State Equation took 2136 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 257/280 places, 3227/3904 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 113041 ms. Remains : 257/280 places, 3227/3904 transitions.
Support contains 5 out of 257 places after structural reductions.
[2024-06-01 06:49:54] [INFO ] Flatten gal took : 377 ms
[2024-06-01 06:49:54] [INFO ] Flatten gal took : 227 ms
[2024-06-01 06:49:54] [INFO ] Input system was already deterministic with 3227 transitions.
RANDOM walk for 40048 steps (27 resets) in 1512 ms. (26 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 180 ms. (221 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 132 ms. (300 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 149300 steps, run timeout after 3001 ms. (steps per millisecond=49 ) properties seen :0 out of 2
Probabilistic random walk after 149300 steps, saw 74654 distinct states, run finished after 3004 ms. (steps per millisecond=49 ) properties seen :0
[2024-06-01 06:49:58] [INFO ] Flow matrix only has 3100 transitions (discarded 127 similar events)
[2024-06-01 06:49:58] [INFO ] Invariant cache hit.
[2024-06-01 06:49:58] [INFO ] State equation strengthened by 251 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 36/41 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 971/1012 variables, 41/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1012 variables, 73/116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1012 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1947/2959 variables, 73/189 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2959 variables, 104/293 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2959 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 4/2963 variables, 1/294 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2963 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 350/3313 variables, 113/407 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3313 variables, 3/410 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3313 variables, 65/475 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3313 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 2/3315 variables, 1/476 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3315 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 42/3357 variables, 30/506 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3357 variables, 1/507 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3357 variables, 9/516 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3357 variables, 0/516 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/3357 variables, 0/516 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3357/3357 variables, and 516 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1652 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 257/257 constraints, ReadFeed: 251/251 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 36/41 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 971/1012 variables, 41/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1012 variables, 73/116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1012 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 1947/2959 variables, 73/189 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2959 variables, 104/293 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2959 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 4/2963 variables, 1/294 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2963 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 350/3313 variables, 113/407 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3313 variables, 3/410 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3313 variables, 65/475 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3313 variables, 2/477 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 06:50:01] [INFO ] Deduced a trap composed of 24 places in 275 ms of which 2 ms to minimize.
[2024-06-01 06:50:01] [INFO ] Deduced a trap composed of 8 places in 147 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/3313 variables, 2/479 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3313 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 2/3315 variables, 1/480 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3315 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 42/3357 variables, 30/510 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3357 variables, 1/511 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3357 variables, 9/520 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 06:50:03] [INFO ] Deduced a trap composed of 6 places in 183 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/3357 variables, 1/521 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3357 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 0/3357 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3357/3357 variables, and 521 constraints, problems are : Problem set: 0 solved, 2 unsolved in 4001 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 257/257 constraints, ReadFeed: 251/251 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints]
After SMT, in 5723ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 2257 ms.
Support contains 5 out of 257 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 257/257 places, 3227/3227 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 255 transition count 3232
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 10 place count 255 transition count 3226
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 16 place count 249 transition count 3226
Applied a total of 16 rules in 182 ms. Remains 249 /257 variables (removed 8) and now considering 3226/3227 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 183 ms. Remains : 249/257 places, 3226/3227 transitions.
RANDOM walk for 40057 steps (8 resets) in 248 ms. (160 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 223 ms. (178 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 149 ms. (266 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 149850 steps, run timeout after 3001 ms. (steps per millisecond=49 ) properties seen :0 out of 2
Probabilistic random walk after 149850 steps, saw 63989 distinct states, run finished after 3001 ms. (steps per millisecond=49 ) properties seen :0
[2024-06-01 06:50:09] [INFO ] Flow matrix only has 3092 transitions (discarded 134 similar events)
// Phase 1: matrix 3092 rows 249 cols
[2024-06-01 06:50:10] [INFO ] Computed 8 invariants in 30 ms
[2024-06-01 06:50:10] [INFO ] State equation strengthened by 252 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 35/40 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 970/1010 variables, 40/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1010 variables, 74/116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1010 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1947/2957 variables, 73/189 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2957 variables, 104/293 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2957 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 2/2959 variables, 1/294 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2959 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 357/3316 variables, 111/405 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3316 variables, 4/409 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3316 variables, 74/483 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3316 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 25/3341 variables, 25/508 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3341 variables, 1/509 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3341 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/3341 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3341/3341 variables, and 509 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1117 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 249/249 constraints, ReadFeed: 252/252 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 35/40 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 970/1010 variables, 40/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1010 variables, 74/116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1010 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 1947/2957 variables, 73/189 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2957 variables, 104/293 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2957 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 2/2959 variables, 1/294 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2959 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 357/3316 variables, 111/405 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3316 variables, 4/409 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3316 variables, 74/483 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3316 variables, 2/485 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 06:50:12] [INFO ] Deduced a trap composed of 24 places in 246 ms of which 2 ms to minimize.
[2024-06-01 06:50:12] [INFO ] Deduced a trap composed of 8 places in 102 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/3316 variables, 2/487 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3316 variables, 0/487 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 25/3341 variables, 25/512 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3341 variables, 1/513 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 06:50:14] [INFO ] Deduced a trap composed of 6 places in 315 ms of which 1 ms to minimize.
[2024-06-01 06:50:14] [INFO ] Deduced a trap composed of 57 places in 283 ms of which 1 ms to minimize.
[2024-06-01 06:50:14] [INFO ] Deduced a trap composed of 17 places in 318 ms of which 2 ms to minimize.
[2024-06-01 06:50:14] [INFO ] Deduced a trap composed of 4 places in 158 ms of which 4 ms to minimize.
[2024-06-01 06:50:15] [INFO ] Deduced a trap composed of 24 places in 123 ms of which 2 ms to minimize.
[2024-06-01 06:50:15] [INFO ] Deduced a trap composed of 22 places in 153 ms of which 0 ms to minimize.
[2024-06-01 06:50:15] [INFO ] Deduced a trap composed of 21 places in 187 ms of which 1 ms to minimize.
[2024-06-01 06:50:16] [INFO ] Deduced a trap composed of 22 places in 134 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/3341 variables, 8/521 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3341 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/3341 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3341/3341 variables, and 521 constraints, problems are : Problem set: 0 solved, 2 unsolved in 5905 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 249/249 constraints, ReadFeed: 252/252 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 10/10 constraints]
After SMT, in 7124ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 1763 ms.
Support contains 5 out of 249 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 249/249 places, 3226/3226 transitions.
Applied a total of 0 rules in 49 ms. Remains 249 /249 variables (removed 0) and now considering 3226/3226 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 249/249 places, 3226/3226 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 249/249 places, 3226/3226 transitions.
Applied a total of 0 rules in 45 ms. Remains 249 /249 variables (removed 0) and now considering 3226/3226 (removed 0) transitions.
[2024-06-01 06:50:18] [INFO ] Flow matrix only has 3092 transitions (discarded 134 similar events)
[2024-06-01 06:50:18] [INFO ] Invariant cache hit.
[2024-06-01 06:50:19] [INFO ] Implicit Places using invariants in 378 ms returned []
[2024-06-01 06:50:19] [INFO ] Flow matrix only has 3092 transitions (discarded 134 similar events)
[2024-06-01 06:50:19] [INFO ] Invariant cache hit.
[2024-06-01 06:50:19] [INFO ] State equation strengthened by 252 read => feed constraints.
[2024-06-01 06:50:20] [INFO ] Implicit Places using invariants and state equation in 1506 ms returned []
Implicit Place search using SMT with State Equation took 1888 ms to find 0 implicit places.
[2024-06-01 06:50:21] [INFO ] Redundant transitions in 208 ms returned []
Running 3225 sub problems to find dead transitions.
[2024-06-01 06:50:21] [INFO ] Flow matrix only has 3092 transitions (discarded 134 similar events)
[2024-06-01 06:50:21] [INFO ] Invariant cache hit.
[2024-06-01 06:50:21] [INFO ] State equation strengthened by 252 read => feed constraints.
Could not compute solution for formula : BugTracking-PT-q8m064-LTLFireability-00
FORMULA BugTracking-PT-q8m064-LTLFireability-01 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA BugTracking-PT-q8m064-LTLFireability-02 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA BugTracking-PT-q8m064-LTLFireability-03 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : BugTracking-PT-q8m064-LTLFireability-04
FORMULA BugTracking-PT-q8m064-LTLFireability-05 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA BugTracking-PT-q8m064-LTLFireability-06 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA BugTracking-PT-q8m064-LTLFireability-07 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA BugTracking-PT-q8m064-LTLFireability-08 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : BugTracking-PT-q8m064-LTLFireability-09
FORMULA BugTracking-PT-q8m064-LTLFireability-10 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA BugTracking-PT-q8m064-LTLFireability-11 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA BugTracking-PT-q8m064-LTLFireability-12 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : BugTracking-PT-q8m064-LTLFireability-13
FORMULA BugTracking-PT-q8m064-LTLFireability-14 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : BugTracking-PT-q8m064-LTLFireability-15
BK_STOP 1717225839635
--------------------
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 BugTracking-PT-q8m064-LTLFireability-00
ltl formula formula --ltl=/tmp/628/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 754 places, 27370 transitions and 136172 arcs
pnml2lts-mc( 0/ 4): Petri net BugTracking-PT-q8 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 3.440 real 1.020 user 1.050 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/628/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/628/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/628/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/628/ltl_0_
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 754 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 755, there are 27373 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): ~1889 levels ~10000 states ~15892 transitions
pnml2lts-mc( 0/ 4): ~3889 levels ~20000 states ~31892 transitions
pnml2lts-mc( 0/ 4): ~7889 levels ~40000 states ~63892 transitions
pnml2lts-mc( 1/ 4): ~20000 levels ~80000 states ~240000 transitions
pnml2lts-mc( 0/ 4): ~31889 levels ~160000 states ~255892 transitions
pnml2lts-mc( 0/ 4): ~63889 levels ~320000 states ~511892 transitions
ltl formula name BugTracking-PT-q8m064-LTLFireability-01
ltl formula formula --ltl=/tmp/628/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 754 places, 27370 transitions and 136172 arcs
pnml2lts-mc( 0/ 4): Petri net BugTracking-PT-q8 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 3.230 real 1.070 user 0.910 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/628/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/628/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/628/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/628/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 754 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 755, there are 27372 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 ~65!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 252
pnml2lts-mc( 0/ 4): unique transitions count: 767
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 308
pnml2lts-mc( 0/ 4): - cum. max stack depth: 308
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 308 states 884 transitions, fanout: 2.870
pnml2lts-mc( 0/ 4): Total exploration time 0.230 sec (0.220 sec minimum, 0.225 sec on average)
pnml2lts-mc( 0/ 4): States per second: 1339, Transitions per second: 3843
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, 52.9 B/state, compr.: 1.8%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 27880 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 1MB
pnml2lts-mc( 0/ 4): Est. total memory use: 1.0MB (~257.0MB paged-in)
ltl formula name BugTracking-PT-q8m064-LTLFireability-02
ltl formula formula --ltl=/tmp/628/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 754 places, 27370 transitions and 136172 arcs
pnml2lts-mc( 0/ 4): Petri net BugTracking-PT-q8 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 3.340 real 1.180 user 0.960 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/628/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/628/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/628/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/628/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 7 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 754 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 755, there are 27391 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 ~65!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 169
pnml2lts-mc( 0/ 4): unique transitions count: 441
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 177
pnml2lts-mc( 0/ 4): - cum. max stack depth: 177
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 177 states 463 transitions, fanout: 2.616
pnml2lts-mc( 0/ 4): Total exploration time 0.150 sec (0.150 sec minimum, 0.150 sec on average)
pnml2lts-mc( 0/ 4): States per second: 1180, Transitions per second: 3087
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, 59.9 B/state, compr.: 2.0%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 27880 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 1MB
pnml2lts-mc( 0/ 4): Est. total memory use: 1.0MB (~257.0MB paged-in)
ltl formula name BugTracking-PT-q8m064-LTLFireability-03
ltl formula formula --ltl=/tmp/628/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 754 places, 27370 transitions and 136172 arcs
pnml2lts-mc( 0/ 4): Petri net BugTracking-PT-q8 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 3.810 real 1.070 user 1.050 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/628/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/628/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/628/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/628/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 754 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 755, there are 27388 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 ~65!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 164
pnml2lts-mc( 0/ 4): unique transitions count: 443
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 169
pnml2lts-mc( 0/ 4): - cum. max stack depth: 169
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 169 states 458 transitions, fanout: 2.710
pnml2lts-mc( 0/ 4): Total exploration time 0.140 sec (0.130 sec minimum, 0.137 sec on average)
pnml2lts-mc( 0/ 4): States per second: 1207, Transitions per second: 3271
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, 68.0 B/state, compr.: 2.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 27880 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 1MB
pnml2lts-mc( 0/ 4): Est. total memory use: 1.0MB (~257.0MB paged-in)
ltl formula name BugTracking-PT-q8m064-LTLFireability-04
ltl formula formula --ltl=/tmp/628/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 754 places, 27370 transitions and 136172 arcs
pnml2lts-mc( 0/ 4): Petri net BugTracking-PT-q8 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 5.410 real 1.070 user 1.010 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/628/ltl_4_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/628/ltl_4_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/628/ltl_4_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/628/ltl_4_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): There are 753 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 755, there are 27376 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): ~1990 levels ~10000 states ~21100 transitions
pnml2lts-mc( 1/ 4): ~4005 levels ~20000 states ~42256 transitions
pnml2lts-mc( 1/ 4): ~8029 levels ~40000 states ~84456 transitions
pnml2lts-mc( 1/ 4): ~16077 levels ~80000 states ~168848 transitions
pnml2lts-mc( 1/ 4): ~32173 levels ~160000 states ~337636 transitions
pnml2lts-mc( 1/ 4): ~64367 levels ~320000 states ~675128 transitions
ltl formula name BugTracking-PT-q8m064-LTLFireability-05
ltl formula formula --ltl=/tmp/628/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 754 places, 27370 transitions and 136172 arcs
pnml2lts-mc( 0/ 4): Petri net BugTracking-PT-q8 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 3.210 real 0.960 user 1.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/628/ltl_5_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/628/ltl_5_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/628/ltl_5_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/628/ltl_5_
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 754 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 755, there are 27375 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 ~65!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 223
pnml2lts-mc( 0/ 4): unique transitions count: 599
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 239
pnml2lts-mc( 0/ 4): - cum. max stack depth: 239
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 239 states 644 transitions, fanout: 2.695
pnml2lts-mc( 0/ 4): Total exploration time 0.180 sec (0.170 sec minimum, 0.173 sec on average)
pnml2lts-mc( 0/ 4): States per second: 1328, Transitions per second: 3578
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, 66.8 B/state, compr.: 2.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 27880 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 1MB
pnml2lts-mc( 0/ 4): Est. total memory use: 1.0MB (~257.0MB paged-in)
ltl formula name BugTracking-PT-q8m064-LTLFireability-06
ltl formula formula --ltl=/tmp/628/ltl_6_
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 754 places, 27370 transitions and 136172 arcs
pnml2lts-mc( 0/ 4): Petri net BugTracking-PT-q8 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 3.370 real 1.100 user 0.980 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/628/ltl_6_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/628/ltl_6_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/628/ltl_6_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/628/ltl_6_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 754 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 755, there are 27380 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 ~65!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 278
pnml2lts-mc( 0/ 4): unique transitions count: 1734
pnml2lts-mc( 0/ 4): - self-loop count: 2
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 285
pnml2lts-mc( 0/ 4): - cum. max stack depth: 285
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 285 states 1770 transitions, fanout: 6.211
pnml2lts-mc( 0/ 4): Total exploration time 0.170 sec (0.170 sec minimum, 0.170 sec on average)
pnml2lts-mc( 0/ 4): States per second: 1676, Transitions per second: 10412
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, 46.1 B/state, compr.: 1.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 27880 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 1MB
pnml2lts-mc( 0/ 4): Est. total memory use: 1.0MB (~257.0MB paged-in)
ltl formula name BugTracking-PT-q8m064-LTLFireability-07
ltl formula formula --ltl=/tmp/628/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 754 places, 27370 transitions and 136172 arcs
pnml2lts-mc( 0/ 4): Petri net BugTracking-PT-q8 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 3.220 real 1.080 user 0.910 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/628/ltl_7_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/628/ltl_7_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/628/ltl_7_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/628/ltl_7_
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 754 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 755, there are 27372 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 ~65!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 102
pnml2lts-mc( 0/ 4): unique transitions count: 241
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 174
pnml2lts-mc( 0/ 4): - cum. max stack depth: 174
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 174 states 458 transitions, fanout: 2.632
pnml2lts-mc( 0/ 4): Total exploration time 0.150 sec (0.150 sec minimum, 0.150 sec on average)
pnml2lts-mc( 0/ 4): States per second: 1160, Transitions per second: 3053
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, 71.6 B/state, compr.: 2.4%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 27880 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 1MB
pnml2lts-mc( 0/ 4): Est. total memory use: 1.0MB (~257.0MB paged-in)
ltl formula name BugTracking-PT-q8m064-LTLFireability-08
ltl formula formula --ltl=/tmp/628/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 754 places, 27370 transitions and 136172 arcs
pnml2lts-mc( 0/ 4): Petri net BugTracking-PT-q8 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 3.350 real 1.060 user 1.010 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/628/ltl_8_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/628/ltl_8_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/628/ltl_8_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/628/ltl_8_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4): There are 753 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 755, there are 27381 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 ~65!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 180
pnml2lts-mc( 0/ 4): unique transitions count: 463
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 186
pnml2lts-mc( 0/ 4): - cum. max stack depth: 186
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 186 states 483 transitions, fanout: 2.597
pnml2lts-mc( 0/ 4): Total exploration time 0.150 sec (0.150 sec minimum, 0.150 sec on average)
pnml2lts-mc( 0/ 4): States per second: 1240, Transitions per second: 3220
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, 55.0 B/state, compr.: 1.8%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 27880 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 1MB
pnml2lts-mc( 0/ 4): Est. total memory use: 1.0MB (~257.0MB paged-in)
ltl formula name BugTracking-PT-q8m064-LTLFireability-09
ltl formula formula --ltl=/tmp/628/ltl_9_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 754 places, 27370 transitions and 136172 arcs
pnml2lts-mc( 0/ 4): Petri net BugTracking-PT-q8 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 3.310 real 1.070 user 0.980 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/628/ltl_9_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/628/ltl_9_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/628/ltl_9_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/628/ltl_9_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): There are 753 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 755, there are 27382 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): ~577 levels ~10000 states ~21636 transitions
pnml2lts-mc( 3/ 4): ~115 levels ~20000 states ~45924 transitions
pnml2lts-mc( 3/ 4): ~935 levels ~40000 states ~86124 transitions
pnml2lts-mc( 3/ 4): ~2871 levels ~80000 states ~168696 transitions
pnml2lts-mc( 0/ 4): ~9366 levels ~160000 states ~340400 transitions
pnml2lts-mc( 0/ 4): ~18741 levels ~320000 states ~680400 transitions
ltl formula name BugTracking-PT-q8m064-LTLFireability-10
ltl formula formula --ltl=/tmp/628/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 754 places, 27370 transitions and 136172 arcs
pnml2lts-mc( 0/ 4): Petri net BugTracking-PT-q8 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 3.160 real 1.240 user 1.070 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/628/ltl_10_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/628/ltl_10_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/628/ltl_10_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/628/ltl_10_
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 754 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 755, there are 27373 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 ~65!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 337
pnml2lts-mc( 0/ 4): unique transitions count: 994
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 342
pnml2lts-mc( 0/ 4): - cum. max stack depth: 342
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 342 states 1016 transitions, fanout: 2.971
pnml2lts-mc( 0/ 4): Total exploration time 0.250 sec (0.250 sec minimum, 0.250 sec on average)
pnml2lts-mc( 0/ 4): States per second: 1368, Transitions per second: 4064
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, 57.4 B/state, compr.: 1.9%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 27880 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 1MB
pnml2lts-mc( 0/ 4): Est. total memory use: 1.1MB (~257.0MB paged-in)
ltl formula name BugTracking-PT-q8m064-LTLFireability-11
ltl formula formula --ltl=/tmp/628/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 754 places, 27370 transitions and 136172 arcs
pnml2lts-mc( 0/ 4): Petri net BugTracking-PT-q8 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 3.320 real 0.970 user 1.080 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/628/ltl_11_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/628/ltl_11_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/628/ltl_11_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/628/ltl_11_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): There are 753 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 755, there are 27377 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 ~65!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 193
pnml2lts-mc( 0/ 4): unique transitions count: 516
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 198
pnml2lts-mc( 0/ 4): - cum. max stack depth: 198
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 198 states 537 transitions, fanout: 2.712
pnml2lts-mc( 0/ 4): Total exploration time 0.140 sec (0.140 sec minimum, 0.140 sec on average)
pnml2lts-mc( 0/ 4): States per second: 1414, Transitions per second: 3836
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, 50.7 B/state, compr.: 1.7%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 27880 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 1MB
pnml2lts-mc( 0/ 4): Est. total memory use: 1.0MB (~257.0MB paged-in)
ltl formula name BugTracking-PT-q8m064-LTLFireability-12
ltl formula formula --ltl=/tmp/628/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 754 places, 27370 transitions and 136172 arcs
pnml2lts-mc( 0/ 4): Petri net BugTracking-PT-q8 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 5.070 real 1.220 user 0.990 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/628/ltl_12_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/628/ltl_12_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/628/ltl_12_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/628/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 754 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 755, there are 27377 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 ~65!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 130
pnml2lts-mc( 0/ 4): unique transitions count: 331
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 135
pnml2lts-mc( 0/ 4): - cum. max stack depth: 135
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 135 states 346 transitions, fanout: 2.563
pnml2lts-mc( 0/ 4): Total exploration time 0.150 sec (0.130 sec minimum, 0.145 sec on average)
pnml2lts-mc( 0/ 4): States per second: 900, Transitions per second: 2307
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, 62.6 B/state, compr.: 2.1%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 27880 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 1MB
pnml2lts-mc( 0/ 4): Est. total memory use: 1.0MB (~257.0MB paged-in)
ltl formula name BugTracking-PT-q8m064-LTLFireability-13
ltl formula formula --ltl=/tmp/628/ltl_13_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 754 places, 27370 transitions and 136172 arcs
pnml2lts-mc( 0/ 4): Petri net BugTracking-PT-q8 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 4.870 real 1.080 user 1.030 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/628/ltl_13_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/628/ltl_13_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/628/ltl_13_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/628/ltl_13_
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 754 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 755, there are 27376 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): ~943 levels ~10000 states ~14720 transitions
pnml2lts-mc( 1/ 4): ~1848 levels ~20000 states ~29132 transitions
pnml2lts-mc( 1/ 4): ~3613 levels ~40000 states ~57996 transitions
pnml2lts-mc( 1/ 4): ~4779 levels ~80000 states ~135060 transitions
pnml2lts-mc( 1/ 4): ~4791 levels ~160000 states ~342572 transitions
pnml2lts-mc( 1/ 4): ~4900 levels ~320000 states ~794012 transitions
ltl formula name BugTracking-PT-q8m064-LTLFireability-14
ltl formula formula --ltl=/tmp/628/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 754 places, 27370 transitions and 136172 arcs
pnml2lts-mc( 0/ 4): Petri net BugTracking-PT-q8 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 3.340 real 1.260 user 1.100 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/628/ltl_14_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/628/ltl_14_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/628/ltl_14_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/628/ltl_14_
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 754 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 755, there are 27380 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 ~65!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 242
pnml2lts-mc( 0/ 4): unique transitions count: 653
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 302
pnml2lts-mc( 0/ 4): - cum. max stack depth: 302
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 302 states 777 transitions, fanout: 2.573
pnml2lts-mc( 0/ 4): Total exploration time 0.230 sec (0.230 sec minimum, 0.230 sec on average)
pnml2lts-mc( 0/ 4): States per second: 1313, Transitions per second: 3378
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, 53.9 B/state, compr.: 1.8%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 27880 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 1MB
pnml2lts-mc( 0/ 4): Est. total memory use: 1.0MB (~257.0MB paged-in)
ltl formula name BugTracking-PT-q8m064-LTLFireability-15
ltl formula formula --ltl=/tmp/628/ltl_15_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 754 places, 27370 transitions and 136172 arcs
pnml2lts-mc( 0/ 4): Petri net BugTracking-PT-q8 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 3.490 real 1.100 user 1.070 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/628/ltl_15_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/628/ltl_15_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/628/ltl_15_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/628/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 754 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 755, there are 27373 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~2500 levels ~10000 states ~36656 transitions
pnml2lts-mc( 1/ 4): ~5000 levels ~20000 states ~59736 transitions
pnml2lts-mc( 1/ 4): ~10000 levels ~40000 states ~119736 transitions
pnml2lts-mc( 1/ 4): ~20000 levels ~80000 states ~239736 transitions
pnml2lts-mc( 1/ 4): ~40000 levels ~160000 states ~479736 transitions
pnml2lts-mc( 1/ 4): ~80000 levels ~320000 states ~959736 transitions
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="BugTracking-PT-q8m064"
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 BugTracking-PT-q8m064, 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 r472-tajo-171620399500428"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BugTracking-PT-q8m064.tgz
mv BugTracking-PT-q8m064 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;