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-171690533300867.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-b04, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r536-tall-171690533300867
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.1M
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 19 16:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 11 15:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 134K Apr 11 15:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 19 07:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 19 15:31 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-b04-LTLCardinality-00
FORMULA_NAME Szymanski-PT-b04-LTLCardinality-01
FORMULA_NAME Szymanski-PT-b04-LTLCardinality-02
FORMULA_NAME Szymanski-PT-b04-LTLCardinality-03
FORMULA_NAME Szymanski-PT-b04-LTLCardinality-04
FORMULA_NAME Szymanski-PT-b04-LTLCardinality-05
FORMULA_NAME Szymanski-PT-b04-LTLCardinality-06
FORMULA_NAME Szymanski-PT-b04-LTLCardinality-07
FORMULA_NAME Szymanski-PT-b04-LTLCardinality-08
FORMULA_NAME Szymanski-PT-b04-LTLCardinality-09
FORMULA_NAME Szymanski-PT-b04-LTLCardinality-10
FORMULA_NAME Szymanski-PT-b04-LTLCardinality-11
FORMULA_NAME Szymanski-PT-b04-LTLCardinality-12
FORMULA_NAME Szymanski-PT-b04-LTLCardinality-13
FORMULA_NAME Szymanski-PT-b04-LTLCardinality-14
FORMULA_NAME Szymanski-PT-b04-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717282881217

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Szymanski-PT-b04
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 23:01:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 23:01:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 23:01:22] [INFO ] Load time of PNML (sax parser for PT used): 326 ms
[2024-06-01 23:01:22] [INFO ] Transformed 568 places.
[2024-06-01 23:01:22] [INFO ] Transformed 8320 transitions.
[2024-06-01 23:01:22] [INFO ] Parsed PT model containing 568 places and 8320 transitions and 33408 arcs in 472 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 260 places in 19 ms
Reduce places removed 260 places and 256 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA Szymanski-PT-b04-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b04-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b04-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b04-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b04-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b04-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b04-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b04-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b04-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b04-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 16 out of 308 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 308/308 places, 8064/8064 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 307 transition count 8064
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 306 transition count 7936
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 306 transition count 7936
Applied a total of 3 rules in 210 ms. Remains 306 /308 variables (removed 2) and now considering 7936/8064 (removed 128) transitions.
[2024-06-01 23:01:23] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 306 cols
[2024-06-01 23:01:23] [INFO ] Computed 2 invariants in 57 ms
[2024-06-01 23:01:24] [INFO ] Implicit Places using invariants in 864 ms returned []
[2024-06-01 23:01:24] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-06-01 23:01:24] [INFO ] Invariant cache hit.
[2024-06-01 23:01:25] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-06-01 23:01:38] [INFO ] Implicit Places using invariants and state equation in 14220 ms returned []
Implicit Place search using SMT with State Equation took 15124 ms to find 0 implicit places.
Running 7934 sub problems to find dead transitions.
[2024-06-01 23:01:38] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-06-01 23:01:38] [INFO ] Invariant cache hit.
[2024-06-01 23:01:38] [INFO ] State equation strengthened by 147 read => feed constraints.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 305/3038 variables, and 0 constraints, problems are : Problem set: 0 solved, 7934 unsolved in 30164 ms.
Refiners :[Positive P Invariants (semi-flows): 0/2 constraints, State Equation: 0/306 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 7934/7934 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7934 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 305/3038 variables, and 0 constraints, problems are : Problem set: 0 solved, 7934 unsolved in 30096 ms.
Refiners :[Positive P Invariants (semi-flows): 0/2 constraints, State Equation: 0/306 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 0/7934 constraints, Known Traps: 0/0 constraints]
After SMT, in 90240ms problems are : Problem set: 0 solved, 7934 unsolved
Search for dead transitions found 0 dead transitions in 90362ms
Starting structural reductions in LTL mode, iteration 1 : 306/308 places, 7936/8064 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 105756 ms. Remains : 306/308 places, 7936/8064 transitions.
Support contains 16 out of 306 places after structural reductions.
[2024-06-01 23:03:09] [INFO ] Flatten gal took : 550 ms
[2024-06-01 23:03:09] [INFO ] Flatten gal took : 228 ms
[2024-06-01 23:03:10] [INFO ] Input system was already deterministic with 7936 transitions.
RANDOM walk for 40002 steps (8 resets) in 2043 ms. (19 steps per ms) remains 5/11 properties
BEST_FIRST walk for 40004 steps (12 resets) in 120 ms. (330 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 80 ms. (493 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 114 ms. (347 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (13 resets) in 117 ms. (339 steps per ms) remains 4/4 properties
[2024-06-01 23:03:11] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-06-01 23:03:11] [INFO ] Invariant cache hit.
[2024-06-01 23:03:11] [INFO ] State equation strengthened by 147 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 298/306 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 2732/3038 variables, 306/308 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3038 variables, 147/455 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3038 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 0/3038 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3038/3038 variables, and 455 constraints, problems are : Problem set: 0 solved, 4 unsolved in 754 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 306/306 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem AtomicPropp0 is UNSAT
At refinement iteration 1 (OVERLAPS) 298/306 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-06-01 23:03:12] [INFO ] Deduced a trap composed of 47 places in 629 ms of which 22 ms to minimize.
[2024-06-01 23:03:13] [INFO ] Deduced a trap composed of 67 places in 559 ms of which 2 ms to minimize.
[2024-06-01 23:03:13] [INFO ] Deduced a trap composed of 79 places in 539 ms of which 3 ms to minimize.
[2024-06-01 23:03:14] [INFO ] Deduced a trap composed of 111 places in 527 ms of which 4 ms to minimize.
[2024-06-01 23:03:14] [INFO ] Deduced a trap composed of 109 places in 514 ms of which 2 ms to minimize.
[2024-06-01 23:03:15] [INFO ] Deduced a trap composed of 145 places in 506 ms of which 2 ms to minimize.
[2024-06-01 23:03:16] [INFO ] Deduced a trap composed of 137 places in 565 ms of which 2 ms to minimize.
[2024-06-01 23:03:16] [INFO ] Deduced a trap composed of 133 places in 571 ms of which 3 ms to minimize.
[2024-06-01 23:03:17] [INFO ] Deduced a trap composed of 135 places in 530 ms of which 3 ms to minimize.
SMT process timed out in 5896ms, After SMT, problems are : Problem set: 1 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 6 out of 306 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 306/306 places, 7936/7936 transitions.
Graph (complete) has 9096 edges and 306 vertex of which 305 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.14 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 128 transitions
Reduce isomorphic transitions removed 128 transitions.
Iterating post reduction 0 with 128 rules applied. Total rules applied 129 place count 305 transition count 7808
Applied a total of 129 rules in 379 ms. Remains 305 /306 variables (removed 1) and now considering 7808/7936 (removed 128) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 380 ms. Remains : 305/306 places, 7808/7936 transitions.
RANDOM walk for 40002 steps (8 resets) in 248 ms. (160 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 109 ms. (363 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 84 ms. (470 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 143916 steps, run timeout after 3001 ms. (steps per millisecond=47 ) properties seen :0 out of 3
Probabilistic random walk after 143916 steps, saw 55248 distinct states, run finished after 3004 ms. (steps per millisecond=47 ) properties seen :0
[2024-06-01 23:03:20] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
// Phase 1: matrix 2604 rows 305 cols
[2024-06-01 23:03:20] [INFO ] Computed 3 invariants in 23 ms
[2024-06-01 23:03:20] [INFO ] State equation strengthened by 147 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 299/305 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/305 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 2604/2909 variables, 305/308 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2909 variables, 147/455 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2909 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/2909 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2909/2909 variables, and 455 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1337 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 299/305 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 23:03:22] [INFO ] Deduced a trap composed of 89 places in 531 ms of which 2 ms to minimize.
[2024-06-01 23:03:23] [INFO ] Deduced a trap composed of 89 places in 572 ms of which 2 ms to minimize.
[2024-06-01 23:03:23] [INFO ] Deduced a trap composed of 161 places in 547 ms of which 2 ms to minimize.
[2024-06-01 23:03:24] [INFO ] Deduced a trap composed of 137 places in 542 ms of which 2 ms to minimize.
[2024-06-01 23:03:24] [INFO ] Deduced a trap composed of 142 places in 508 ms of which 2 ms to minimize.
[2024-06-01 23:03:25] [INFO ] Deduced a trap composed of 92 places in 511 ms of which 3 ms to minimize.
[2024-06-01 23:03:26] [INFO ] Deduced a trap composed of 36 places in 553 ms of which 2 ms to minimize.
[2024-06-01 23:03:26] [INFO ] Deduced a trap composed of 47 places in 497 ms of which 2 ms to minimize.
[2024-06-01 23:03:27] [INFO ] Deduced a trap composed of 134 places in 522 ms of which 2 ms to minimize.
[2024-06-01 23:03:27] [INFO ] Deduced a trap composed of 140 places in 507 ms of which 2 ms to minimize.
[2024-06-01 23:03:28] [INFO ] Deduced a trap composed of 199 places in 515 ms of which 10 ms to minimize.
[2024-06-01 23:03:28] [INFO ] Deduced a trap composed of 75 places in 551 ms of which 2 ms to minimize.
[2024-06-01 23:03:29] [INFO ] Deduced a trap composed of 135 places in 562 ms of which 3 ms to minimize.
[2024-06-01 23:03:29] [INFO ] Deduced a trap composed of 133 places in 492 ms of which 2 ms to minimize.
[2024-06-01 23:03:30] [INFO ] Deduced a trap composed of 192 places in 551 ms of which 3 ms to minimize.
[2024-06-01 23:03:30] [INFO ] Deduced a trap composed of 195 places in 553 ms of which 3 ms to minimize.
[2024-06-01 23:03:31] [INFO ] Deduced a trap composed of 192 places in 537 ms of which 3 ms to minimize.
[2024-06-01 23:03:31] [INFO ] Deduced a trap composed of 193 places in 550 ms of which 2 ms to minimize.
[2024-06-01 23:03:32] [INFO ] Deduced a trap composed of 140 places in 225 ms of which 1 ms to minimize.
[2024-06-01 23:03:32] [INFO ] Deduced a trap composed of 137 places in 213 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/305 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 23:03:32] [INFO ] Deduced a trap composed of 135 places in 459 ms of which 2 ms to minimize.
[2024-06-01 23:03:33] [INFO ] Deduced a trap composed of 132 places in 492 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/305 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/305 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 2604/2909 variables, 305/330 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2909 variables, 147/477 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2909 variables, 3/480 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 23:04:06] [INFO ] Deduced a trap composed of 78 places in 491 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2909/2909 variables, and 481 constraints, problems are : Problem set: 0 solved, 3 unsolved in 45013 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 23/23 constraints]
After SMT, in 46422ms problems are : Problem set: 0 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 6 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 212 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 213 ms. Remains : 305/305 places, 7808/7808 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 246 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
[2024-06-01 23:04:07] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-06-01 23:04:07] [INFO ] Invariant cache hit.
[2024-06-01 23:04:08] [INFO ] Implicit Places using invariants in 581 ms returned []
[2024-06-01 23:04:08] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-06-01 23:04:08] [INFO ] Invariant cache hit.
[2024-06-01 23:04:08] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-06-01 23:04:32] [INFO ] Implicit Places using invariants and state equation in 24645 ms returned []
Implicit Place search using SMT with State Equation took 25230 ms to find 0 implicit places.
[2024-06-01 23:04:33] [INFO ] Redundant transitions in 856 ms returned []
Running 7806 sub problems to find dead transitions.
[2024-06-01 23:04:33] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-06-01 23:04:33] [INFO ] Invariant cache hit.
[2024-06-01 23:04:33] [INFO ] State equation strengthened by 147 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 7806 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 305/2909 variables, and 3 constraints, problems are : Problem set: 0 solved, 7806 unsolved in 30099 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/305 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 7806/7806 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7806 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 7806 unsolved
[2024-06-01 23:05:35] [INFO ] Deduced a trap composed of 138 places in 479 ms of which 5 ms to minimize.
[2024-06-01 23:05:37] [INFO ] Deduced a trap composed of 31 places in 452 ms of which 2 ms to minimize.
[2024-06-01 23:05:38] [INFO ] Deduced a trap composed of 106 places in 426 ms of which 5 ms to minimize.
[2024-06-01 23:05:38] [INFO ] Deduced a trap composed of 104 places in 609 ms of which 17 ms to minimize.
[2024-06-01 23:05:39] [INFO ] Deduced a trap composed of 37 places in 467 ms of which 15 ms to minimize.
[2024-06-01 23:05:39] [INFO ] Deduced a trap composed of 59 places in 408 ms of which 2 ms to minimize.
[2024-06-01 23:05:40] [INFO ] Deduced a trap composed of 42 places in 420 ms of which 39 ms to minimize.
[2024-06-01 23:05:40] [INFO ] Deduced a trap composed of 50 places in 396 ms of which 1 ms to minimize.
[2024-06-01 23:05:40] [INFO ] Deduced a trap composed of 42 places in 348 ms of which 2 ms to minimize.
[2024-06-01 23:05:41] [INFO ] Deduced a trap composed of 47 places in 490 ms of which 48 ms to minimize.
[2024-06-01 23:05:41] [INFO ] Deduced a trap composed of 62 places in 575 ms of which 15 ms to minimize.
[2024-06-01 23:05:42] [INFO ] Deduced a trap composed of 78 places in 786 ms of which 17 ms to minimize.
[2024-06-01 23:05:43] [INFO ] Deduced a trap composed of 48 places in 515 ms of which 16 ms to minimize.
[2024-06-01 23:05:43] [INFO ] Deduced a trap composed of 75 places in 623 ms of which 9 ms to minimize.
[2024-06-01 23:05:44] [INFO ] Deduced a trap composed of 42 places in 552 ms of which 79 ms to minimize.
[2024-06-01 23:05:45] [INFO ] Deduced a trap composed of 47 places in 463 ms of which 9 ms to minimize.
[2024-06-01 23:05:45] [INFO ] Deduced a trap composed of 50 places in 536 ms of which 22 ms to minimize.
[2024-06-01 23:05:46] [INFO ] Deduced a trap composed of 97 places in 596 ms of which 26 ms to minimize.
[2024-06-01 23:05:47] [INFO ] Deduced a trap composed of 64 places in 529 ms of which 20 ms to minimize.
[2024-06-01 23:05:47] [INFO ] Deduced a trap composed of 72 places in 829 ms of which 28 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/305 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 7806 unsolved
[2024-06-01 23:05:52] [INFO ] Deduced a trap composed of 44 places in 554 ms of which 19 ms to minimize.
[2024-06-01 23:05:53] [INFO ] Deduced a trap composed of 57 places in 581 ms of which 10 ms to minimize.
[2024-06-01 23:05:53] [INFO ] Deduced a trap composed of 57 places in 428 ms of which 2 ms to minimize.
[2024-06-01 23:05:54] [INFO ] Deduced a trap composed of 72 places in 400 ms of which 2 ms to minimize.
[2024-06-01 23:05:54] [INFO ] Deduced a trap composed of 115 places in 409 ms of which 4 ms to minimize.
[2024-06-01 23:05:55] [INFO ] Deduced a trap composed of 114 places in 408 ms of which 2 ms to minimize.
[2024-06-01 23:05:55] [INFO ] Deduced a trap composed of 101 places in 369 ms of which 2 ms to minimize.
[2024-06-01 23:05:55] [INFO ] Deduced a trap composed of 114 places in 371 ms of which 2 ms to minimize.
[2024-06-01 23:05:56] [INFO ] Deduced a trap composed of 113 places in 384 ms of which 2 ms to minimize.
[2024-06-01 23:05:57] [INFO ] Deduced a trap composed of 125 places in 479 ms of which 2 ms to minimize.
[2024-06-01 23:05:57] [INFO ] Deduced a trap composed of 58 places in 404 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 305/2909 variables, and 34 constraints, problems are : Problem set: 0 solved, 7806 unsolved in 30105 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/305 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 0/7806 constraints, Known Traps: 31/31 constraints]
After SMT, in 88370ms problems are : Problem set: 0 solved, 7806 unsolved
Search for dead transitions found 0 dead transitions in 88449ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 114818 ms. Remains : 305/305 places, 7808/7808 transitions.
Successfully simplified 1 atomic propositions for a total of 6 simplifications.
Computed a total of 11 stabilizing places and 2304 stable transitions
Graph (complete) has 12425 edges and 306 vertex of which 305 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.57 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 7936/7936 transitions.
Applied a total of 0 rules in 29 ms. Remains 306 /306 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2024-06-01 23:06:02] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 306 cols
[2024-06-01 23:06:02] [INFO ] Computed 2 invariants in 16 ms
[2024-06-01 23:06:03] [INFO ] Implicit Places using invariants in 623 ms returned []
[2024-06-01 23:06:03] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-06-01 23:06:03] [INFO ] Invariant cache hit.
[2024-06-01 23:06:03] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-06-01 23:06:34] [INFO ] Performed 101/306 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-06-01 23:06:50] [INFO ] Implicit Places using invariants and state equation in 47187 ms returned []
Implicit Place search using SMT with State Equation took 47850 ms to find 0 implicit places.
Running 7934 sub problems to find dead transitions.
[2024-06-01 23:06:50] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-06-01 23:06:50] [INFO ] Invariant cache hit.
[2024-06-01 23:06:50] [INFO ] State equation strengthened by 147 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 305/3038 variables, and 0 constraints, problems are : Problem set: 0 solved, 7934 unsolved in 30124 ms.
Refiners :[Positive P Invariants (semi-flows): 0/2 constraints, State Equation: 0/306 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 7934/7934 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7934 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 305/3038 variables, and 0 constraints, problems are : Problem set: 0 solved, 7934 unsolved in 30096 ms.
Refiners :[Positive P Invariants (semi-flows): 0/2 constraints, State Equation: 0/306 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 0/7934 constraints, Known Traps: 0/0 constraints]
After SMT, in 90831ms problems are : Problem set: 0 solved, 7934 unsolved
Search for dead transitions found 0 dead transitions in 90966ms
Finished structural reductions in LTL mode , in 1 iterations and 138904 ms. Remains : 306/306 places, 7936/7936 transitions.
Stuttering acceptance computed with spot in 199 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Szymanski-PT-b04-LTLCardinality-02
Product exploration explored 100000 steps with 50000 reset in 720 ms.
Product exploration explored 100000 steps with 50000 reset in 616 ms.
Computed a total of 11 stabilizing places and 2304 stable transitions
Graph (complete) has 12425 edges and 306 vertex of which 305 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.14 ms
Computed a total of 11 stabilizing places and 2304 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 14 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Szymanski-PT-b04-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Szymanski-PT-b04-LTLCardinality-02 finished in 140610 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0||F(p1)))))'
Support contains 3 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 7936/7936 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 305 transition count 7936
Applied a total of 1 rules in 65 ms. Remains 305 /306 variables (removed 1) and now considering 7936/7936 (removed 0) transitions.
[2024-06-01 23:08:23] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2024-06-01 23:08:23] [INFO ] Computed 1 invariants in 18 ms
[2024-06-01 23:08:23] [INFO ] Implicit Places using invariants in 589 ms returned []
[2024-06-01 23:08:23] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-06-01 23:08:23] [INFO ] Invariant cache hit.
[2024-06-01 23:08:24] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-06-01 23:08:55] [INFO ] Performed 302/305 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-06-01 23:08:56] [INFO ] Implicit Places using invariants and state equation in 32798 ms returned []
Implicit Place search using SMT with State Equation took 33390 ms to find 0 implicit places.
Running 7934 sub problems to find dead transitions.
[2024-06-01 23:08:56] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-06-01 23:08:56] [INFO ] Invariant cache hit.
[2024-06-01 23:08:56] [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 30124 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 30125 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 88693ms problems are : Problem set: 0 solved, 7934 unsolved
Search for dead transitions found 0 dead transitions in 88761ms
Starting structural reductions in LTL mode, iteration 1 : 305/306 places, 7936/7936 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 122235 ms. Remains : 305/306 places, 7936/7936 transitions.
Stuttering acceptance computed with spot in 1825 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Szymanski-PT-b04-LTLCardinality-04
Stuttering criterion allowed to conclude after 650 steps with 0 reset in 142 ms.
FORMULA Szymanski-PT-b04-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Szymanski-PT-b04-LTLCardinality-04 finished in 124239 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||G(p1))))'
Support contains 4 out of 306 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 306/306 places, 7936/7936 transitions.
Graph (complete) has 12425 edges and 306 vertex of which 305 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.27 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 810 ms. Remains 305 /306 variables (removed 1) and now considering 7936/7936 (removed 0) transitions.
[2024-06-01 23:10:28] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-06-01 23:10:28] [INFO ] Invariant cache hit.
[2024-06-01 23:10:29] [INFO ] Implicit Places using invariants in 1536 ms returned []
[2024-06-01 23:10:29] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-06-01 23:10:29] [INFO ] Invariant cache hit.
Could not compute solution for formula : Szymanski-PT-b04-LTLCardinality-00
FORMULA Szymanski-PT-b04-LTLCardinality-01 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA Szymanski-PT-b04-LTLCardinality-02 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA Szymanski-PT-b04-LTLCardinality-03 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA Szymanski-PT-b04-LTLCardinality-04 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : Szymanski-PT-b04-LTLCardinality-05
FORMULA Szymanski-PT-b04-LTLCardinality-06 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA Szymanski-PT-b04-LTLCardinality-07 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA Szymanski-PT-b04-LTLCardinality-08 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA Szymanski-PT-b04-LTLCardinality-09 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : Szymanski-PT-b04-LTLCardinality-10
FORMULA Szymanski-PT-b04-LTLCardinality-11 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA Szymanski-PT-b04-LTLCardinality-12 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA Szymanski-PT-b04-LTLCardinality-13 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA Szymanski-PT-b04-LTLCardinality-14 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : Szymanski-PT-b04-LTLCardinality-15

BK_STOP 1717284338842

--------------------
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 LTLCardinality -timeout 360 -rebuildPNML
mcc2024
ltl formula name Szymanski-PT-b04-LTLCardinality-00
ltl formula formula --ltl=/tmp/871/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-b04 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.840 real 0.240 user 0.310 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/871/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/871/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/871/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/871/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( 1/ 4): ~277 levels ~10000 states ~55828 transitions
pnml2lts-mc( 1/ 4): ~285 levels ~20000 states ~117380 transitions
pnml2lts-mc( 0/ 4): ~557 levels ~40000 states ~139548 transitions
pnml2lts-mc( 0/ 4): ~4101 levels ~80000 states ~315716 transitions
pnml2lts-mc( 1/ 4): ~4625 levels ~160000 states ~987380 transitions
pnml2lts-mc( 2/ 4): ~23418 levels ~320000 states ~1566924 transitions
pnml2lts-mc( 1/ 4): ~18479 levels ~640000 states ~4135420 transitions
pnml2lts-mc( 2/ 4): ~86710 levels ~1280000 states ~7469068 transitions
pnml2lts-mc( 1/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 217067
pnml2lts-mc( 0/ 4): unique states count: 1454594
pnml2lts-mc( 0/ 4): unique transitions count: 9156954
pnml2lts-mc( 0/ 4): - self-loop count: 105183
pnml2lts-mc( 0/ 4): - claim dead count: 3428431
pnml2lts-mc( 0/ 4): - claim found count: 2712387
pnml2lts-mc( 0/ 4): - claim success count: 1454727
pnml2lts-mc( 0/ 4): - cum. max stack depth: 357079
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 1454784 states 9158057 transitions, fanout: 6.295
pnml2lts-mc( 0/ 4): Total exploration time 217.750 sec (217.710 sec minimum, 217.723 sec on average)
pnml2lts-mc( 0/ 4): States per second: 6681, Transitions per second: 42058
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 83.6MB, 34.1 B/state, compr.: 1.5%
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: 83.6MB (~256.0MB paged-in)
ltl formula name Szymanski-PT-b04-LTLCardinality-01
ltl formula formula --ltl=/tmp/871/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 568 places, 8320 transitions and 33408 arcs
pnml2lts-mc( 0/ 4): Petri net Szymanski-PT-b04 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.870 real 0.340 user 0.270 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/871/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/871/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/871/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/871/ltl_1_
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 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):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~50!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 182
pnml2lts-mc( 0/ 4): unique transitions count: 834
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: 188
pnml2lts-mc( 0/ 4): - cum. max stack depth: 188
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 188 states 862 transitions, fanout: 4.585
pnml2lts-mc( 0/ 4): Total exploration time 0.050 sec (0.050 sec minimum, 0.050 sec on average)
pnml2lts-mc( 0/ 4): States per second: 3760, Transitions per second: 17240
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, 42.4 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.0MB (~256.0MB paged-in)
ltl formula name Szymanski-PT-b04-LTLCardinality-02
ltl formula formula --ltl=/tmp/871/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-b04 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.810 real 0.270 user 0.280 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/871/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/871/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/871/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/871/ltl_2_
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): 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: 10
pnml2lts-mc( 0/ 4): - cum. max stack depth: 8
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 10 states 12 transitions, fanout: 1.200
pnml2lts-mc( 0/ 4): Total exploration time 0.010 sec (0.000 sec minimum, 0.002 sec on average)
pnml2lts-mc( 0/ 4): States per second: 1000, Transitions per second: 1200
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-b04-LTLCardinality-03
ltl formula formula --ltl=/tmp/871/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-b04 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.950 real 0.310 user 0.320 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/871/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/871/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/871/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/871/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 310 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( 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: 8
pnml2lts-mc( 0/ 4): - cum. max stack depth: 7
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 8 states 12 transitions, fanout: 1.500
pnml2lts-mc( 0/ 4): Total exploration time 0.010 sec (0.010 sec minimum, 0.010 sec on average)
pnml2lts-mc( 0/ 4): States per second: 800, Transitions per second: 1200
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, 106.7 B/state, compr.: 4.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.0MB (~256.0MB paged-in)
ltl formula name Szymanski-PT-b04-LTLCardinality-04
ltl formula formula --ltl=/tmp/871/ltl_4_
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-b04 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.820 real 0.330 user 0.230 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/871/ltl_4_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/871/ltl_4_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/871/ltl_4_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/871/ltl_4_
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 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 ~44!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 172
pnml2lts-mc( 0/ 4): unique transitions count: 714
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: 177
pnml2lts-mc( 0/ 4): - cum. max stack depth: 177
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 177 states 732 transitions, fanout: 4.136
pnml2lts-mc( 0/ 4): Total exploration time 0.040 sec (0.040 sec minimum, 0.040 sec on average)
pnml2lts-mc( 0/ 4): States per second: 4425, Transitions per second: 18300
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, 43.1 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.0MB (~256.0MB paged-in)
ltl formula name Szymanski-PT-b04-LTLCardinality-05
ltl formula formula --ltl=/tmp/871/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-b04 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.820 real 0.260 user 0.300 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/871/ltl_5_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/871/ltl_5_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/871/ltl_5_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/871/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 310 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 569, there are 8329 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): ~313 levels ~10000 states ~56548 transitions
pnml2lts-mc( 3/ 4): ~313 levels ~20000 states ~116656 transitions
pnml2lts-mc( 3/ 4): ~355 levels ~40000 states ~250448 transitions
pnml2lts-mc( 3/ 4): ~355 levels ~80000 states ~514992 transitions
pnml2lts-mc( 3/ 4): ~374 levels ~160000 states ~1058224 transitions
pnml2lts-mc( 1/ 4): ~1540 levels ~320000 states ~2126140 transitions
pnml2lts-mc( 0/ 4): ~748 levels ~640000 states ~4329656 transitions
pnml2lts-mc( 3/ 4): ~812 levels ~1280000 states ~9364176 transitions
ltl formula name Szymanski-PT-b04-LTLCardinality-06
ltl formula formula --ltl=/tmp/871/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-b04 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.890 real 0.340 user 0.240 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/871/ltl_6_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/871/ltl_6_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/871/ltl_6_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/871/ltl_6_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): There are 309 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( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 1
pnml2lts-mc( 0/ 4): unique states count: 1
pnml2lts-mc( 0/ 4): unique transitions count: 0
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 4
pnml2lts-mc( 0/ 4): - cum. max stack depth: 4
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 4 states 4 transitions, fanout: 1.000
pnml2lts-mc( 0/ 4): Total exploration time 0.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, 128.0 B/state, compr.: 5.6%
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-b04-LTLCardinality-07
ltl formula formula --ltl=/tmp/871/ltl_7_
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 568 places, 8320 transitions and 33408 arcs
pnml2lts-mc( 0/ 4): Petri net Szymanski-PT-b04 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.790 real 0.320 user 0.260 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/871/ltl_7_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/871/ltl_7_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/871/ltl_7_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/871/ltl_7_
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 8327 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: 8
pnml2lts-mc( 0/ 4): - cum. max stack depth: 7
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 8 states 12 transitions, fanout: 1.500
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-b04-LTLCardinality-08
ltl formula formula --ltl=/tmp/871/ltl_8_
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-b04 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.830 real 0.280 user 0.280 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/871/ltl_8_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/871/ltl_8_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/871/ltl_8_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/871/ltl_8_
pnml2lts-mc( 0/ 4): buchi has 4 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 ~40!
pnml2lts-mc( 2/ 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: 720
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: 175
pnml2lts-mc( 0/ 4): - cum. max stack depth: 175
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 175 states 748 transitions, fanout: 4.274
pnml2lts-mc( 0/ 4): Total exploration time 0.040 sec (0.040 sec minimum, 0.040 sec on average)
pnml2lts-mc( 0/ 4): States per second: 4375, Transitions per second: 18700
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 45.6 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.0MB (~256.0MB paged-in)
ltl formula name Szymanski-PT-b04-LTLCardinality-09
ltl formula formula --ltl=/tmp/871/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 568 places, 8320 transitions and 33408 arcs
pnml2lts-mc( 0/ 4): Petri net Szymanski-PT-b04 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.810 real 0.300 user 0.240 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/871/ltl_9_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/871/ltl_9_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/871/ltl_9_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/871/ltl_9_
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 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( 3/ 4):
pnml2lts-mc( 3/ 4): Accepting cycle FOUND at depth ~71!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 28
pnml2lts-mc( 0/ 4): unique states count: 315
pnml2lts-mc( 0/ 4): unique transitions count: 1241
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 8
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 325
pnml2lts-mc( 0/ 4): - cum. max stack depth: 295
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 325 states 1273 transitions, fanout: 3.917
pnml2lts-mc( 0/ 4): Total exploration time 0.070 sec (0.070 sec minimum, 0.070 sec on average)
pnml2lts-mc( 0/ 4): States per second: 4643, Transitions per second: 18186
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.2 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-b04-LTLCardinality-10
ltl formula formula --ltl=/tmp/871/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-b04 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.850 real 0.240 user 0.310 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/871/ltl_10_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/871/ltl_10_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/871/ltl_10_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/871/ltl_10_
pnml2lts-mc( 0/ 4): buchi has 8 states
pnml2lts-mc( 0/ 4): There are 309 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 569, there are 8345 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): ~293 levels ~10000 states ~56084 transitions
pnml2lts-mc( 3/ 4): ~176 levels ~20000 states ~112060 transitions
pnml2lts-mc( 3/ 4): ~176 levels ~40000 states ~231964 transitions
pnml2lts-mc( 3/ 4): ~181 levels ~80000 states ~487036 transitions
pnml2lts-mc( 3/ 4): ~394 levels ~160000 states ~999220 transitions
pnml2lts-mc( 3/ 4): ~468 levels ~320000 states ~2036876 transitions
pnml2lts-mc( 2/ 4): ~15555 levels ~640000 states ~3866956 transitions
pnml2lts-mc( 2/ 4): ~15602 levels ~1280000 states ~8430516 transitions
ltl formula name Szymanski-PT-b04-LTLCardinality-11
ltl formula formula --ltl=/tmp/871/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-b04 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.850 real 0.330 user 0.230 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/871/ltl_11_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/871/ltl_11_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/871/ltl_11_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/871/ltl_11_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4): There are 309 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 569, there are 8340 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 1
pnml2lts-mc( 0/ 4): unique states count: 1
pnml2lts-mc( 0/ 4): unique transitions count: 0
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 4
pnml2lts-mc( 0/ 4): - cum. max stack depth: 4
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 4 states 4 transitions, fanout: 1.000
pnml2lts-mc( 0/ 4): Total exploration time 0.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, 128.0 B/state, compr.: 5.6%
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-b04-LTLCardinality-12
ltl formula formula --ltl=/tmp/871/ltl_12_
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-b04 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.840 real 0.300 user 0.250 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/871/ltl_12_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/871/ltl_12_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/871/ltl_12_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/871/ltl_12_
pnml2lts-mc( 0/ 4): buchi has 8 states
pnml2lts-mc( 0/ 4): There are 309 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 569, there are 8339 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: 9
pnml2lts-mc( 0/ 4): unique states count: 9
pnml2lts-mc( 0/ 4): unique transitions count: 10
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 8
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 20
pnml2lts-mc( 0/ 4): - cum. max stack depth: 12
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 20 states 36 transitions, fanout: 1.800
pnml2lts-mc( 0/ 4): Total exploration time 0.010 sec (0.010 sec minimum, 0.010 sec on average)
pnml2lts-mc( 0/ 4): States per second: 2000, Transitions per second: 3600
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, 75.6 B/state, compr.: 3.3%
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-b04-LTLCardinality-13
ltl formula formula --ltl=/tmp/871/ltl_13_
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-b04 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.820 real 0.260 user 0.290 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/871/ltl_13_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/871/ltl_13_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/871/ltl_13_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/871/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 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( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 1
pnml2lts-mc( 0/ 4): unique states count: 1
pnml2lts-mc( 0/ 4): unique transitions count: 0
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 4
pnml2lts-mc( 0/ 4): - cum. max stack depth: 4
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 4 states 4 transitions, fanout: 1.000
pnml2lts-mc( 0/ 4): Total exploration time 0.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, 128.0 B/state, compr.: 5.6%
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-b04-LTLCardinality-14
ltl formula formula --ltl=/tmp/871/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-b04 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.790 real 0.340 user 0.260 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/871/ltl_14_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/871/ltl_14_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/871/ltl_14_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/871/ltl_14_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 310 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 569, there are 8329 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 ~36!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 139
pnml2lts-mc( 0/ 4): unique transitions count: 1304
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: 145
pnml2lts-mc( 0/ 4): - cum. max stack depth: 145
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 145 states 1344 transitions, fanout: 9.269
pnml2lts-mc( 0/ 4): Total exploration time 0.030 sec (0.030 sec minimum, 0.030 sec on average)
pnml2lts-mc( 0/ 4): States per second: 4833, Transitions per second: 44800
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, 41.3 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.0MB (~256.0MB paged-in)
ltl formula name Szymanski-PT-b04-LTLCardinality-15
ltl formula formula --ltl=/tmp/871/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 568 places, 8320 transitions and 33408 arcs
pnml2lts-mc( 0/ 4): Petri net Szymanski-PT-b04 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.840 real 0.270 user 0.280 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/871/ltl_15_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/871/ltl_15_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/871/ltl_15_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/871/ltl_15_
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( 0/ 4): ~266 levels ~10000 states ~36716 transitions
pnml2lts-mc( 0/ 4): ~308 levels ~20000 states ~85820 transitions
pnml2lts-mc( 0/ 4): ~308 levels ~40000 states ~187092 transitions
pnml2lts-mc( 0/ 4): ~336 levels ~80000 states ~391092 transitions
pnml2lts-mc( 1/ 4): ~655 levels ~160000 states ~1002868 transitions
pnml2lts-mc( 3/ 4): ~8773 levels ~320000 states ~1989656 transitions
pnml2lts-mc( 0/ 4): ~3568 levels ~640000 states ~3523760 transitions
pnml2lts-mc( 0/ 4): ~20851 levels ~1280000 states ~7598380 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="Szymanski-PT-b04"
export BK_EXAMINATION="LTLCardinality"
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-b04, examination is LTLCardinality"
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-171690533300867"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Szymanski-PT-b04.tgz
mv Szymanski-PT-b04 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;