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.r484-smll-171624276100508.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 DNAwalker-PT-18lozangeBlock, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r484-smll-171624276100508
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.1M
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 74K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 19 15:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 19 07:16 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:13 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 126K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 100K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K 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 15 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1.6M 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 DNAwalker-PT-18lozangeBlock-LTLFireability-00
FORMULA_NAME DNAwalker-PT-18lozangeBlock-LTLFireability-01
FORMULA_NAME DNAwalker-PT-18lozangeBlock-LTLFireability-02
FORMULA_NAME DNAwalker-PT-18lozangeBlock-LTLFireability-03
FORMULA_NAME DNAwalker-PT-18lozangeBlock-LTLFireability-04
FORMULA_NAME DNAwalker-PT-18lozangeBlock-LTLFireability-05
FORMULA_NAME DNAwalker-PT-18lozangeBlock-LTLFireability-06
FORMULA_NAME DNAwalker-PT-18lozangeBlock-LTLFireability-07
FORMULA_NAME DNAwalker-PT-18lozangeBlock-LTLFireability-08
FORMULA_NAME DNAwalker-PT-18lozangeBlock-LTLFireability-09
FORMULA_NAME DNAwalker-PT-18lozangeBlock-LTLFireability-10
FORMULA_NAME DNAwalker-PT-18lozangeBlock-LTLFireability-11
FORMULA_NAME DNAwalker-PT-18lozangeBlock-LTLFireability-12
FORMULA_NAME DNAwalker-PT-18lozangeBlock-LTLFireability-13
FORMULA_NAME DNAwalker-PT-18lozangeBlock-LTLFireability-14
FORMULA_NAME DNAwalker-PT-18lozangeBlock-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717334595203

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DNAwalker-PT-18lozangeBlock
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 13:23:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-02 13:23:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 13:23:20] [INFO ] Load time of PNML (sax parser for PT used): 584 ms
[2024-06-02 13:23:20] [INFO ] Transformed 164 places.
[2024-06-02 13:23:20] [INFO ] Transformed 3697 transitions.
[2024-06-02 13:23:20] [INFO ] Parsed PT model containing 164 places and 3697 transitions and 10898 arcs in 2971 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 19 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA DNAwalker-PT-18lozangeBlock-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DNAwalker-PT-18lozangeBlock-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DNAwalker-PT-18lozangeBlock-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DNAwalker-PT-18lozangeBlock-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DNAwalker-PT-18lozangeBlock-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 42 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 3697/3697 transitions.
Applied a total of 0 rules in 95 ms. Remains 164 /164 variables (removed 0) and now considering 3697/3697 (removed 0) transitions.
Running 3563 sub problems to find dead transitions.
// Phase 1: matrix 3697 rows 164 cols
[2024-06-02 13:23:21] [INFO ] Computed 0 invariants in 91 ms
[2024-06-02 13:23:21] [INFO ] State equation strengthened by 2651 read => feed constraints.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 100/3861 variables, and 0 constraints, problems are : Problem set: 0 solved, 3563 unsolved in 20202 ms.
Refiners :[State Equation: 0/164 constraints, ReadFeed: 0/2651 constraints, PredecessorRefiner: 3563/3563 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3563 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3563 unsolved
SMT process timed out in 53544ms, After SMT, problems are : Problem set: 0 solved, 3563 unsolved
Search for dead transitions found 0 dead transitions in 53716ms
[2024-06-02 13:24:14] [INFO ] Invariant cache hit.
[2024-06-02 13:24:14] [INFO ] Implicit Places using invariants in 237 ms returned []
[2024-06-02 13:24:14] [INFO ] Invariant cache hit.
[2024-06-02 13:24:16] [INFO ] State equation strengthened by 2651 read => feed constraints.
[2024-06-02 13:24:49] [INFO ] Performed 2/164 implicitness test of which 0 returned IMPLICIT in 32 seconds.
[2024-06-02 13:25:19] [INFO ] Performed 37/164 implicitness test of which 0 returned IMPLICIT in 62 seconds.
[2024-06-02 13:25:54] [INFO ] Performed 71/164 implicitness test of which 0 returned IMPLICIT in 97 seconds.
[2024-06-02 13:26:31] [INFO ] Performed 93/164 implicitness test of which 0 returned IMPLICIT in 133 seconds.
[2024-06-02 13:26:31] [INFO ] Timeout of Implicit test with SMT after 133 seconds.
[2024-06-02 13:26:31] [INFO ] Implicit Places using invariants and state equation in 136582 ms returned []
Implicit Place search using SMT with State Equation took 136826 ms to find 0 implicit places.
Running 3563 sub problems to find dead transitions.
[2024-06-02 13:26:31] [INFO ] Invariant cache hit.
[2024-06-02 13:26:31] [INFO ] State equation strengthened by 2651 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3563 unsolved
SMT process timed out in 42238ms, After SMT, problems are : Problem set: 0 solved, 3563 unsolved
Search for dead transitions found 0 dead transitions in 42313ms
Finished structural reductions in LTL mode , in 1 iterations and 233060 ms. Remains : 164/164 places, 3697/3697 transitions.
Support contains 42 out of 164 places after structural reductions.
[2024-06-02 13:27:14] [INFO ] Flatten gal took : 470 ms
[2024-06-02 13:27:14] [INFO ] Flatten gal took : 196 ms
[2024-06-02 13:27:15] [INFO ] Input system was already deterministic with 3697 transitions.
Support contains 39 out of 164 places (down from 42) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 25 to 24
RANDOM walk for 40000 steps (386 resets) in 3561 ms. (11 steps per ms) remains 2/24 properties
BEST_FIRST walk for 40004 steps (8 resets) in 272 ms. (146 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 173 ms. (229 steps per ms) remains 2/2 properties
[2024-06-02 13:27:16] [INFO ] Invariant cache hit.
[2024-06-02 13:27:16] [INFO ] State equation strengthened by 2651 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 653/661 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/661 variables, 278/286 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/661 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 2979/3640 variables, 87/373 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3640/3861 variables, and 2664 constraints, problems are : Problem set: 0 solved, 2 unsolved in 4798 ms.
Refiners :[State Equation: 95/164 constraints, ReadFeed: 2569/2651 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/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 653/661 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/661 variables, 278/286 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/661 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 2979/3640 variables, 87/373 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3640/3861 variables, and 2664 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3785 ms.
Refiners :[State Equation: 95/164 constraints, ReadFeed: 2569/2651 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 8728ms problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 8 out of 164 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 164/164 places, 3697/3697 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 65 transitions
Reduce isomorphic transitions removed 65 transitions.
Iterating post reduction 0 with 65 rules applied. Total rules applied 65 place count 164 transition count 3632
Reduce places removed 58 places and 58 transitions.
Iterating global reduction 1 with 58 rules applied. Total rules applied 123 place count 106 transition count 3574
Applied a total of 123 rules in 333 ms. Remains 106 /164 variables (removed 58) and now considering 3574/3697 (removed 123) transitions.
Running 3549 sub problems to find dead transitions.
// Phase 1: matrix 3574 rows 106 cols
[2024-06-02 13:27:25] [INFO ] Computed 0 invariants in 25 ms
[2024-06-02 13:27:25] [INFO ] State equation strengthened by 278 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3549 unsolved
SMT process timed out in 30670ms, After SMT, problems are : Problem set: 0 solved, 3549 unsolved
Search for dead transitions found 0 dead transitions in 30717ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31062 ms. Remains : 106/164 places, 3574/3697 transitions.
RANDOM walk for 40000 steps (604 resets) in 2006 ms. (19 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (22 resets) in 248 ms. (160 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (20 resets) in 204 ms. (195 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 139491 steps, run timeout after 3001 ms. (steps per millisecond=46 ) properties seen :0 out of 2
Probabilistic random walk after 139491 steps, saw 36870 distinct states, run finished after 3007 ms. (steps per millisecond=46 ) properties seen :0
[2024-06-02 13:27:59] [INFO ] Invariant cache hit.
[2024-06-02 13:27:59] [INFO ] State equation strengthened by 278 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 653/661 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/661 variables, 278/286 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/661 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 2918/3579 variables, 87/373 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3579 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 101/3680 variables, 11/384 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3680 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/3680 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3680/3680 variables, and 384 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3364 ms.
Refiners :[State Equation: 106/106 constraints, ReadFeed: 278/278 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/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 653/661 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/661 variables, 278/286 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/661 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 2918/3579 variables, 87/373 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3579 variables, 2/375 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3579 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3680/3680 variables, and 386 constraints, problems are : Problem set: 0 solved, 2 unsolved in 20849 ms.
Refiners :[State Equation: 106/106 constraints, ReadFeed: 278/278 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 24243ms problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 8 out of 106 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 106/106 places, 3574/3574 transitions.
Applied a total of 0 rules in 61 ms. Remains 106 /106 variables (removed 0) and now considering 3574/3574 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 106/106 places, 3574/3574 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 106/106 places, 3574/3574 transitions.
Applied a total of 0 rules in 92 ms. Remains 106 /106 variables (removed 0) and now considering 3574/3574 (removed 0) transitions.
[2024-06-02 13:28:24] [INFO ] Invariant cache hit.
[2024-06-02 13:28:24] [INFO ] Implicit Places using invariants in 363 ms returned []
[2024-06-02 13:28:24] [INFO ] Invariant cache hit.
[2024-06-02 13:28:25] [INFO ] State equation strengthened by 278 read => feed constraints.
[2024-06-02 13:28:56] [INFO ] Performed 50/106 implicitness test of which 1 returned IMPLICIT in 30 seconds.
[2024-06-02 13:29:18] [INFO ] Implicit Places using invariants and state equation in 53476 ms returned [0]
Discarding 1 places :
Drop transitions (Empty/Sink Transition effects.) removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Implicit Place search using SMT with State Equation took 53860 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 105/106 places, 3555/3574 transitions.
Applied a total of 0 rules in 81 ms. Remains 105 /105 variables (removed 0) and now considering 3555/3555 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 54035 ms. Remains : 105/106 places, 3555/3574 transitions.
FORMULA DNAwalker-PT-18lozangeBlock-LTLFireability-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 164 stabilizing places and 3696 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p1)||p0)))'
Support contains 4 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 3697/3697 transitions.
Applied a total of 0 rules in 15 ms. Remains 164 /164 variables (removed 0) and now considering 3697/3697 (removed 0) transitions.
Running 3563 sub problems to find dead transitions.
// Phase 1: matrix 3697 rows 164 cols
[2024-06-02 13:29:18] [INFO ] Computed 0 invariants in 18 ms
[2024-06-02 13:29:18] [INFO ] State equation strengthened by 2651 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3563 unsolved
SMT process timed out in 30879ms, After SMT, problems are : Problem set: 0 solved, 3563 unsolved
Search for dead transitions found 0 dead transitions in 30930ms
[2024-06-02 13:29:49] [INFO ] Invariant cache hit.
[2024-06-02 13:29:49] [INFO ] Implicit Places using invariants in 318 ms returned []
[2024-06-02 13:29:49] [INFO ] Invariant cache hit.
[2024-06-02 13:29:51] [INFO ] State equation strengthened by 2651 read => feed constraints.
[2024-06-02 13:30:22] [INFO ] Performed 5/164 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-06-02 13:30:57] [INFO ] Performed 33/164 implicitness test of which 0 returned IMPLICIT in 65 seconds.
[2024-06-02 13:31:27] [INFO ] Performed 51/164 implicitness test of which 0 returned IMPLICIT in 95 seconds.
[2024-06-02 13:32:01] [INFO ] Performed 71/164 implicitness test of which 0 returned IMPLICIT in 129 seconds.
[2024-06-02 13:32:01] [INFO ] Timeout of Implicit test with SMT after 129 seconds.
[2024-06-02 13:32:01] [INFO ] Implicit Places using invariants and state equation in 131786 ms returned []
Implicit Place search using SMT with State Equation took 132106 ms to find 0 implicit places.
Running 3563 sub problems to find dead transitions.
[2024-06-02 13:32:01] [INFO ] Invariant cache hit.
[2024-06-02 13:32:01] [INFO ] State equation strengthened by 2651 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3563 unsolved
SMT process timed out in 40915ms, After SMT, problems are : Problem set: 0 solved, 3563 unsolved
Search for dead transitions found 0 dead transitions in 40955ms
Finished structural reductions in LTL mode , in 1 iterations and 204023 ms. Remains : 164/164 places, 3697/3697 transitions.
Stuttering acceptance computed with spot in 427 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DNAwalker-PT-18lozangeBlock-LTLFireability-00
Product exploration explored 100000 steps with 50000 reset in 1632 ms.
Product exploration explored 100000 steps with 50000 reset in 1112 ms.
Computed a total of 164 stabilizing places and 3696 stable transitions
Computed a total of 164 stabilizing places and 3696 stable transitions
Detected a total of 164/164 stabilizing places and 3696/3697 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 23 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DNAwalker-PT-18lozangeBlock-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DNAwalker-PT-18lozangeBlock-LTLFireability-00 finished in 207418 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)&&X(F(p1))))'
Support contains 6 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 3697/3697 transitions.
Applied a total of 0 rules in 9 ms. Remains 164 /164 variables (removed 0) and now considering 3697/3697 (removed 0) transitions.
Running 3563 sub problems to find dead transitions.
[2024-06-02 13:32:46] [INFO ] Invariant cache hit.
[2024-06-02 13:32:46] [INFO ] State equation strengthened by 2651 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3563 unsolved
SMT process timed out in 30202ms, After SMT, problems are : Problem set: 0 solved, 3563 unsolved
Search for dead transitions found 0 dead transitions in 30242ms
[2024-06-02 13:33:16] [INFO ] Invariant cache hit.
[2024-06-02 13:33:16] [INFO ] Implicit Places using invariants in 340 ms returned []
[2024-06-02 13:33:16] [INFO ] Invariant cache hit.
[2024-06-02 13:33:17] [INFO ] State equation strengthened by 2651 read => feed constraints.
[2024-06-02 13:33:49] [INFO ] Performed 5/164 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-06-02 13:34:20] [INFO ] Performed 27/164 implicitness test of which 0 returned IMPLICIT in 62 seconds.
[2024-06-02 13:34:58] [INFO ] Performed 51/164 implicitness test of which 0 returned IMPLICIT in 99 seconds.
[2024-06-02 13:35:33] [INFO ] Performed 75/164 implicitness test of which 0 returned IMPLICIT in 134 seconds.
[2024-06-02 13:35:33] [INFO ] Timeout of Implicit test with SMT after 134 seconds.
[2024-06-02 13:35:33] [INFO ] Implicit Places using invariants and state equation in 136837 ms returned []
Implicit Place search using SMT with State Equation took 137178 ms to find 0 implicit places.
Running 3563 sub problems to find dead transitions.
[2024-06-02 13:35:33] [INFO ] Invariant cache hit.
[2024-06-02 13:35:33] [INFO ] State equation strengthened by 2651 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3563 unsolved
SMT process timed out in 40437ms, After SMT, problems are : Problem set: 0 solved, 3563 unsolved
Search for dead transitions found 0 dead transitions in 40483ms
Finished structural reductions in LTL mode , in 1 iterations and 207931 ms. Remains : 164/164 places, 3697/3697 transitions.
Stuttering acceptance computed with spot in 231 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : DNAwalker-PT-18lozangeBlock-LTLFireability-01
Product exploration explored 100000 steps with 0 reset in 417 ms.
Product exploration explored 100000 steps with 0 reset in 343 ms.
Computed a total of 164 stabilizing places and 3696 stable transitions
Computed a total of 164 stabilizing places and 3696 stable transitions
Detected a total of 164/164 stabilizing places and 3696/3697 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X p0), (X p1), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 605 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[true, (NOT p0)]
RANDOM walk for 40000 steps (383 resets) in 1253 ms. (31 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 323 ms. (123 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 230657 steps, run timeout after 3001 ms. (steps per millisecond=76 ) properties seen :0 out of 1
Probabilistic random walk after 230657 steps, saw 45062 distinct states, run finished after 3001 ms. (steps per millisecond=76 ) properties seen :0
[2024-06-02 13:36:19] [INFO ] Invariant cache hit.
[2024-06-02 13:36:19] [INFO ] State equation strengthened by 2651 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 331/335 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/335 variables, 139/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/335 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 3248/3583 variables, 84/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3583/3861 variables, and 2622 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2857 ms.
Refiners :[State Equation: 88/164 constraints, ReadFeed: 2534/2651 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 331/335 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/335 variables, 139/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/335 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 3248/3583 variables, 84/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3583/3861 variables, and 2622 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2417 ms.
Refiners :[State Equation: 88/164 constraints, ReadFeed: 2534/2651 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 5361ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 164 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 164/164 places, 3697/3697 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 65 transitions
Reduce isomorphic transitions removed 65 transitions.
Iterating post reduction 0 with 65 rules applied. Total rules applied 65 place count 164 transition count 3632
Reduce places removed 61 places and 61 transitions.
Iterating global reduction 1 with 61 rules applied. Total rules applied 126 place count 103 transition count 3571
Applied a total of 126 rules in 177 ms. Remains 103 /164 variables (removed 61) and now considering 3571/3697 (removed 126) transitions.
Running 3547 sub problems to find dead transitions.
// Phase 1: matrix 3571 rows 103 cols
[2024-06-02 13:36:24] [INFO ] Computed 0 invariants in 22 ms
[2024-06-02 13:36:24] [INFO ] State equation strengthened by 139 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3547 unsolved
SMT process timed out in 30939ms, After SMT, problems are : Problem set: 0 solved, 3547 unsolved
Search for dead transitions found 0 dead transitions in 31006ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31195 ms. Remains : 103/164 places, 3571/3697 transitions.
RANDOM walk for 40000 steps (626 resets) in 727 ms. (54 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (27 resets) in 165 ms. (240 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 123515 steps, run timeout after 3001 ms. (steps per millisecond=41 ) properties seen :0 out of 1
Probabilistic random walk after 123515 steps, saw 34438 distinct states, run finished after 3001 ms. (steps per millisecond=41 ) properties seen :0
[2024-06-02 13:36:59] [INFO ] Invariant cache hit.
[2024-06-02 13:36:59] [INFO ] State equation strengthened by 139 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 331/335 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/335 variables, 139/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/335 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 3188/3523 variables, 84/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3523 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 151/3674 variables, 15/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3674 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/3674 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3674/3674 variables, and 242 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1830 ms.
Refiners :[State Equation: 103/103 constraints, ReadFeed: 139/139 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 331/335 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/335 variables, 139/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/335 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 3188/3523 variables, 84/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3523 variables, 1/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3523 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3674/3674 variables, and 243 constraints, problems are : Problem set: 0 solved, 1 unsolved in 10182 ms.
Refiners :[State Equation: 103/103 constraints, ReadFeed: 139/139 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 12033ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 3571/3571 transitions.
Applied a total of 0 rules in 45 ms. Remains 103 /103 variables (removed 0) and now considering 3571/3571 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 103/103 places, 3571/3571 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 3571/3571 transitions.
Applied a total of 0 rules in 45 ms. Remains 103 /103 variables (removed 0) and now considering 3571/3571 (removed 0) transitions.
[2024-06-02 13:37:11] [INFO ] Invariant cache hit.
[2024-06-02 13:37:11] [INFO ] Implicit Places using invariants in 398 ms returned []
[2024-06-02 13:37:11] [INFO ] Invariant cache hit.
[2024-06-02 13:37:12] [INFO ] State equation strengthened by 139 read => feed constraints.
[2024-06-02 13:37:43] [INFO ] Performed 56/103 implicitness test of which 1 returned IMPLICIT in 31 seconds.
[2024-06-02 13:38:06] [INFO ] Implicit Places using invariants and state equation in 54414 ms returned [0]
Discarding 1 places :
Drop transitions (Empty/Sink Transition effects.) removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Implicit Place search using SMT with State Equation took 54828 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 102/103 places, 3551/3571 transitions.
Applied a total of 0 rules in 44 ms. Remains 102 /102 variables (removed 0) and now considering 3551/3551 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 54918 ms. Remains : 102/103 places, 3551/3571 transitions.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X p0), (X p1), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 8 factoid took 555 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[true, (NOT p0)]
Support contains 4 out of 164 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 164/164 places, 3697/3697 transitions.
Applied a total of 0 rules in 98 ms. Remains 164 /164 variables (removed 0) and now considering 3697/3697 (removed 0) transitions.
Running 3563 sub problems to find dead transitions.
// Phase 1: matrix 3697 rows 164 cols
[2024-06-02 13:38:06] [INFO ] Computed 0 invariants in 18 ms
[2024-06-02 13:38:07] [INFO ] State equation strengthened by 2651 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3563 unsolved
SMT process timed out in 31092ms, After SMT, problems are : Problem set: 0 solved, 3563 unsolved
Search for dead transitions found 0 dead transitions in 31138ms
[2024-06-02 13:38:38] [INFO ] Invariant cache hit.
[2024-06-02 13:38:38] [INFO ] Implicit Places using invariants in 423 ms returned []
[2024-06-02 13:38:38] [INFO ] Invariant cache hit.
[2024-06-02 13:38:39] [INFO ] State equation strengthened by 2651 read => feed constraints.
FORMULA DNAwalker-PT-18lozangeBlock-LTLFireability-00 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA DNAwalker-PT-18lozangeBlock-LTLFireability-01 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA DNAwalker-PT-18lozangeBlock-LTLFireability-02 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA DNAwalker-PT-18lozangeBlock-LTLFireability-03 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA DNAwalker-PT-18lozangeBlock-LTLFireability-04 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : DNAwalker-PT-18lozangeBlock-LTLFireability-05
FORMULA DNAwalker-PT-18lozangeBlock-LTLFireability-06 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA DNAwalker-PT-18lozangeBlock-LTLFireability-07 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA DNAwalker-PT-18lozangeBlock-LTLFireability-08 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : DNAwalker-PT-18lozangeBlock-LTLFireability-09
FORMULA DNAwalker-PT-18lozangeBlock-LTLFireability-10 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA DNAwalker-PT-18lozangeBlock-LTLFireability-11 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : DNAwalker-PT-18lozangeBlock-LTLFireability-12
FORMULA DNAwalker-PT-18lozangeBlock-LTLFireability-13 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA DNAwalker-PT-18lozangeBlock-LTLFireability-14 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA DNAwalker-PT-18lozangeBlock-LTLFireability-15 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717336214761

--------------------
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 DNAwalker-PT-18lozangeBlock-LTLFireability-00
ltl formula formula --ltl=/tmp/760/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 164 places, 3697 transitions and 10898 arcs
pnml2lts-mc( 0/ 4): Petri net DNAwalker-PT-18lozangeBlock analyzed
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/760/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.880 real 0.150 user 0.150 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/760/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/760/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/760/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 266 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 165, there are 3700 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: 135
pnml2lts-mc( 0/ 4): unique states count: 135
pnml2lts-mc( 0/ 4): unique transitions count: 134
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 305
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 152
pnml2lts-mc( 0/ 4): - cum. max stack depth: 8
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 152 states 540 transitions, fanout: 3.553
pnml2lts-mc( 0/ 4): Total exploration time 0.020 sec (0.010 sec minimum, 0.015 sec on average)
pnml2lts-mc( 0/ 4): States per second: 7600, Transitions per second: 27000
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.4 B/state, compr.: 6.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 3758 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 DNAwalker-PT-18lozangeBlock-LTLFireability-01
ltl formula formula --ltl=/tmp/760/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 164 places, 3697 transitions and 10898 arcs
pnml2lts-mc( 0/ 4): Petri net DNAwalker-PT-18lozangeBlock analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/760/ltl_1_
pnml2lts-mc( 0/ 4): Loading Petri net took 0.590 real 0.150 user 0.130 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/760/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/760/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/760/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 266 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 165, there are 3701 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: 135
pnml2lts-mc( 0/ 4): unique states count: 135
pnml2lts-mc( 0/ 4): unique transitions count: 134
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 249
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 150
pnml2lts-mc( 0/ 4): - cum. max stack depth: 7
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 150 states 540 transitions, fanout: 3.600
pnml2lts-mc( 0/ 4): Total exploration time 0.020 sec (0.010 sec minimum, 0.012 sec on average)
pnml2lts-mc( 0/ 4): States per second: 7500, Transitions per second: 27000
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.4 B/state, compr.: 6.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 3758 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 DNAwalker-PT-18lozangeBlock-LTLFireability-02
ltl formula formula --ltl=/tmp/760/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 164 places, 3697 transitions and 10898 arcs
pnml2lts-mc( 0/ 4): Petri net DNAwalker-PT-18lozangeBlock analyzed
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/760/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/760/ltl_2_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.460 real 0.140 user 0.150 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/760/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/760/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4): There are 265 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 165, there are 3710 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 ~47!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 168
pnml2lts-mc( 0/ 4): unique transitions count: 17355
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: 171
pnml2lts-mc( 0/ 4): - cum. max stack depth: 171
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 171 states 17761 transitions, fanout: 103.865
pnml2lts-mc( 0/ 4): Total exploration time 0.110 sec (0.110 sec minimum, 0.110 sec on average)
pnml2lts-mc( 0/ 4): States per second: 1555, Transitions per second: 161464
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.3MB, 17.5 B/state, compr.: 2.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 3758 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.3MB (~256.0MB paged-in)
ltl formula name DNAwalker-PT-18lozangeBlock-LTLFireability-03
ltl formula formula --ltl=/tmp/760/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 164 places, 3697 transitions and 10898 arcs
pnml2lts-mc( 0/ 4): Petri net DNAwalker-PT-18lozangeBlock analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.430 real 0.140 user 0.150 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/760/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/760/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/760/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/760/ltl_3_
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 266 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 165, there are 3705 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 ~59!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 207
pnml2lts-mc( 0/ 4): unique transitions count: 19900
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: 210
pnml2lts-mc( 0/ 4): - cum. max stack depth: 210
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 210 states 20708 transitions, fanout: 98.610
pnml2lts-mc( 0/ 4): Total exploration time 0.100 sec (0.100 sec minimum, 0.100 sec on average)
pnml2lts-mc( 0/ 4): States per second: 2100, Transitions per second: 207080
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.3MB, 17.5 B/state, compr.: 2.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 3758 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.3MB (~256.0MB paged-in)
ltl formula name DNAwalker-PT-18lozangeBlock-LTLFireability-04
ltl formula formula --ltl=/tmp/760/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 164 places, 3697 transitions and 10898 arcs
pnml2lts-mc( 0/ 4): Petri net DNAwalker-PT-18lozangeBlock analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.430 real 0.140 user 0.150 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/760/ltl_4_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/760/ltl_4_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/760/ltl_4_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/760/ltl_4_
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 266 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 165, there are 3701 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, 280.0 B/state, compr.: 42.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 3758 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 DNAwalker-PT-18lozangeBlock-LTLFireability-05
ltl formula formula --ltl=/tmp/760/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 164 places, 3697 transitions and 10898 arcs
pnml2lts-mc( 0/ 4): Petri net DNAwalker-PT-18lozangeBlock analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.500 real 0.130 user 0.140 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/760/ltl_5_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/760/ltl_5_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/760/ltl_5_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/760/ltl_5_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4): There are 265 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 165, there are 3710 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): ~112 levels ~10000 states ~71428 transitions
pnml2lts-mc( 0/ 4): ~78 levels ~20000 states ~135740 transitions
pnml2lts-mc( 1/ 4): ~112 levels ~40000 states ~236788 transitions
pnml2lts-mc( 1/ 4): ~112 levels ~80000 states ~504196 transitions
pnml2lts-mc( 1/ 4): ~112 levels ~160000 states ~1011124 transitions
pnml2lts-mc( 1/ 4): ~133 levels ~320000 states ~1860392 transitions
pnml2lts-mc( 1/ 4): ~133 levels ~640000 states ~2926128 transitions
pnml2lts-mc( 1/ 4): ~133 levels ~1280000 states ~5144972 transitions
pnml2lts-mc( 1/ 4): ~133 levels ~2560000 states ~9880024 transitions
ltl formula name DNAwalker-PT-18lozangeBlock-LTLFireability-06
ltl formula formula --ltl=/tmp/760/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 164 places, 3697 transitions and 10898 arcs
pnml2lts-mc( 0/ 4): Petri net DNAwalker-PT-18lozangeBlock analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.540 real 0.100 user 0.190 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/760/ltl_6_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/760/ltl_6_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/760/ltl_6_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/760/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 266 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 165, there are 3701 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, 280.0 B/state, compr.: 42.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 3758 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 DNAwalker-PT-18lozangeBlock-LTLFireability-07
ltl formula formula --ltl=/tmp/760/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 164 places, 3697 transitions and 10898 arcs
pnml2lts-mc( 0/ 4): Petri net DNAwalker-PT-18lozangeBlock analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.440 real 0.140 user 0.140 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/760/ltl_7_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/760/ltl_7_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/760/ltl_7_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/760/ltl_7_
pnml2lts-mc( 0/ 4): buchi has 7 states
pnml2lts-mc( 0/ 4): There are 265 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 165, there are 3716 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: 241
pnml2lts-mc( 0/ 4): unique transitions count: 21083
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: 244
pnml2lts-mc( 0/ 4): - cum. max stack depth: 244
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 244 states 21489 transitions, fanout: 88.070
pnml2lts-mc( 0/ 4): Total exploration time 0.110 sec (0.110 sec minimum, 0.110 sec on average)
pnml2lts-mc( 0/ 4): States per second: 2218, Transitions per second: 195355
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.3MB, 17.3 B/state, compr.: 2.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 3758 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.3MB (~256.0MB paged-in)
ltl formula name DNAwalker-PT-18lozangeBlock-LTLFireability-08
ltl formula formula --ltl=/tmp/760/ltl_8_
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 164 places, 3697 transitions and 10898 arcs
pnml2lts-mc( 0/ 4): Petri net DNAwalker-PT-18lozangeBlock analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.440 real 0.130 user 0.150 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/760/ltl_8_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/760/ltl_8_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/760/ltl_8_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/760/ltl_8_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4): There are 265 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 165, there are 3714 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 ~39!
pnml2lts-mc( 1/ 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: 14470
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: 142
pnml2lts-mc( 0/ 4): - cum. max stack depth: 142
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 142 states 15278 transitions, fanout: 107.592
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: 2029, Transitions per second: 218257
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.2MB, 17.0 B/state, compr.: 2.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 3758 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.2MB (~256.0MB paged-in)
ltl formula name DNAwalker-PT-18lozangeBlock-LTLFireability-09
ltl formula formula --ltl=/tmp/760/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 164 places, 3697 transitions and 10898 arcs
pnml2lts-mc( 0/ 4): Petri net DNAwalker-PT-18lozangeBlock analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.430 real 0.110 user 0.160 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/760/ltl_9_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/760/ltl_9_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/760/ltl_9_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/760/ltl_9_
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 266 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 165, there are 3700 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): ~120 levels ~10000 states ~68268 transitions
pnml2lts-mc( 0/ 4): ~121 levels ~20000 states ~124072 transitions
pnml2lts-mc( 0/ 4): ~122 levels ~40000 states ~230748 transitions
pnml2lts-mc( 0/ 4): ~122 levels ~80000 states ~484360 transitions
pnml2lts-mc( 0/ 4): ~122 levels ~160000 states ~981112 transitions
pnml2lts-mc( 0/ 4): ~132 levels ~320000 states ~1861596 transitions
pnml2lts-mc( 0/ 4): ~132 levels ~640000 states ~3614344 transitions
pnml2lts-mc( 0/ 4): ~132 levels ~1280000 states ~7438340 transitions
pnml2lts-mc( 0/ 4): ~132 levels ~2560000 states ~15825208 transitions
pnml2lts-mc( 0/ 4): ~132 levels ~5120000 states ~33415828 transitions
ltl formula name DNAwalker-PT-18lozangeBlock-LTLFireability-10
ltl formula formula --ltl=/tmp/760/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 164 places, 3697 transitions and 10898 arcs
pnml2lts-mc( 0/ 4): Petri net DNAwalker-PT-18lozangeBlock analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.600 real 0.180 user 0.180 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/760/ltl_10_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/760/ltl_10_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/760/ltl_10_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/760/ltl_10_
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 266 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 165, there are 3703 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 ~40!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 149
pnml2lts-mc( 0/ 4): unique transitions count: 15526
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: 152
pnml2lts-mc( 0/ 4): - cum. max stack depth: 152
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 152 states 15932 transitions, fanout: 104.816
pnml2lts-mc( 0/ 4): Total exploration time 0.090 sec (0.090 sec minimum, 0.090 sec on average)
pnml2lts-mc( 0/ 4): States per second: 1689, Transitions per second: 177022
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.3MB, 17.3 B/state, compr.: 2.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 3758 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.3MB (~256.0MB paged-in)
ltl formula name DNAwalker-PT-18lozangeBlock-LTLFireability-11
ltl formula formula --ltl=/tmp/760/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 164 places, 3697 transitions and 10898 arcs
pnml2lts-mc( 0/ 4): Petri net DNAwalker-PT-18lozangeBlock analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.430 real 0.130 user 0.150 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/760/ltl_11_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/760/ltl_11_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/760/ltl_11_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/760/ltl_11_
pnml2lts-mc( 0/ 4): buchi has 1 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 266 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 165, there are 3698 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 ~33!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 144
pnml2lts-mc( 0/ 4): unique transitions count: 14948
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: 147
pnml2lts-mc( 0/ 4): - cum. max stack depth: 147
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 147 states 15354 transitions, fanout: 104.449
pnml2lts-mc( 0/ 4): Total exploration time 0.080 sec (0.080 sec minimum, 0.080 sec on average)
pnml2lts-mc( 0/ 4): States per second: 1838, Transitions per second: 191925
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.3MB, 17.7 B/state, compr.: 2.7%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 3758 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.3MB (~256.0MB paged-in)
ltl formula name DNAwalker-PT-18lozangeBlock-LTLFireability-12
ltl formula formula --ltl=/tmp/760/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 164 places, 3697 transitions and 10898 arcs
pnml2lts-mc( 0/ 4): Petri net DNAwalker-PT-18lozangeBlock analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.520 real 0.160 user 0.150 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/760/ltl_12_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/760/ltl_12_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/760/ltl_12_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/760/ltl_12_
pnml2lts-mc( 0/ 4): buchi has 9 states
pnml2lts-mc( 0/ 4): There are 265 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 165, there are 3721 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): ~117 levels ~10000 states ~73292 transitions
pnml2lts-mc( 1/ 4): ~125 levels ~20000 states ~125596 transitions
pnml2lts-mc( 1/ 4): ~125 levels ~40000 states ~213312 transitions
pnml2lts-mc( 1/ 4): ~128 levels ~80000 states ~407620 transitions
pnml2lts-mc( 1/ 4): ~128 levels ~160000 states ~849708 transitions
pnml2lts-mc( 1/ 4): ~128 levels ~320000 states ~1653512 transitions
pnml2lts-mc( 1/ 4): ~129 levels ~640000 states ~3272408 transitions
pnml2lts-mc( 1/ 4): ~129 levels ~1280000 states ~6742576 transitions
pnml2lts-mc( 1/ 4): ~129 levels ~2560000 states ~13955432 transitions
ltl formula name DNAwalker-PT-18lozangeBlock-LTLFireability-13
ltl formula formula --ltl=/tmp/760/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 164 places, 3697 transitions and 10898 arcs
pnml2lts-mc( 0/ 4): Petri net DNAwalker-PT-18lozangeBlock analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.530 real 0.160 user 0.140 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/760/ltl_13_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/760/ltl_13_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/760/ltl_13_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/760/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 266 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 165, there are 3702 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 ~32!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 140
pnml2lts-mc( 0/ 4): unique transitions count: 14910
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: 143
pnml2lts-mc( 0/ 4): - cum. max stack depth: 143
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 143 states 16120 transitions, fanout: 112.727
pnml2lts-mc( 0/ 4): Total exploration time 0.080 sec (0.080 sec minimum, 0.080 sec on average)
pnml2lts-mc( 0/ 4): States per second: 1788, Transitions per second: 201500
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.2MB, 16.9 B/state, compr.: 2.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 3758 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.2MB (~256.0MB paged-in)
ltl formula name DNAwalker-PT-18lozangeBlock-LTLFireability-14
ltl formula formula --ltl=/tmp/760/ltl_14_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 164 places, 3697 transitions and 10898 arcs
pnml2lts-mc( 0/ 4): Petri net DNAwalker-PT-18lozangeBlock analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.420 real 0.130 user 0.160 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/760/ltl_14_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/760/ltl_14_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/760/ltl_14_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/760/ltl_14_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 266 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 165, there are 3699 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 ~26!
pnml2lts-mc( 3/ 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: 11703
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: 105
pnml2lts-mc( 0/ 4): - cum. max stack depth: 105
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 105 states 12109 transitions, fanout: 115.324
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: 1500, Transitions per second: 172986
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.2MB, 17.4 B/state, compr.: 2.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 3758 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.2MB (~256.0MB paged-in)
ltl formula name DNAwalker-PT-18lozangeBlock-LTLFireability-15
ltl formula formula --ltl=/tmp/760/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 164 places, 3697 transitions and 10898 arcs
pnml2lts-mc( 0/ 4): Petri net DNAwalker-PT-18lozangeBlock analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.420 real 0.170 user 0.100 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/760/ltl_15_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/760/ltl_15_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/760/ltl_15_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/760/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 266 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 165, there are 3700 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 ~38!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 142
pnml2lts-mc( 0/ 4): unique transitions count: 14936
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: 145
pnml2lts-mc( 0/ 4): - cum. max stack depth: 145
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 145 states 15342 transitions, fanout: 105.807
pnml2lts-mc( 0/ 4): Total exploration time 0.080 sec (0.080 sec minimum, 0.080 sec on average)
pnml2lts-mc( 0/ 4): States per second: 1812, Transitions per second: 191775
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.2MB, 17.1 B/state, compr.: 2.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 3758 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.2MB (~256.0MB paged-in)

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DNAwalker-PT-18lozangeBlock"
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 DNAwalker-PT-18lozangeBlock, 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 r484-smll-171624276100508"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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