Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r047-tajo-171620398100387.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is BugTracking-PT-q8m002, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r047-tajo-171620398100387
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 11K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 15:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 17:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.7K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 79K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 19 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 19 15:23 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 16M May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716296312521

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BugTracking-PT-q8m002
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 12:58:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-21 12:58:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 12:58:35] [INFO ] Load time of PNML (sax parser for PT used): 1023 ms
[2024-05-21 12:58:35] [INFO ] Transformed 754 places.
[2024-05-21 12:58:35] [INFO ] Transformed 27370 transitions.
[2024-05-21 12:58:35] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 1338 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 44 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 474 places in 173 ms
Reduce places removed 474 places and 23466 transitions.
Initial state reduction rules removed 2 formulas.
FORMULA BugTracking-PT-q8m002-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m002-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m002-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m002-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m002-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m002-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m002-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m002-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m002-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m002-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m002-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 6 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 3904/3904 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 278 transition count 3904
Applied a total of 2 rules in 91 ms. Remains 278 /280 variables (removed 2) and now considering 3904/3904 (removed 0) transitions.
[2024-05-21 12:58:36] [INFO ] Flow matrix only has 3729 transitions (discarded 175 similar events)
// Phase 1: matrix 3729 rows 278 cols
[2024-05-21 12:58:36] [INFO ] Computed 8 invariants in 68 ms
[2024-05-21 12:58:37] [INFO ] Implicit Places using invariants in 1061 ms returned []
[2024-05-21 12:58:37] [INFO ] Flow matrix only has 3729 transitions (discarded 175 similar events)
[2024-05-21 12:58:37] [INFO ] Invariant cache hit.
[2024-05-21 12:58:38] [INFO ] State equation strengthened by 303 read => feed constraints.
[2024-05-21 12:58:41] [INFO ] Implicit Places using invariants and state equation in 4342 ms returned []
Implicit Place search using SMT with State Equation took 5451 ms to find 0 implicit places.
Running 3902 sub problems to find dead transitions.
[2024-05-21 12:58:42] [INFO ] Flow matrix only has 3729 transitions (discarded 175 similar events)
[2024-05-21 12:58:42] [INFO ] Invariant cache hit.
[2024-05-21 12:58:42] [INFO ] State equation strengthened by 303 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/277 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3902 unsolved
[2024-05-21 12:59:52] [INFO ] Deduced a trap composed of 10 places in 474 ms of which 36 ms to minimize.
[2024-05-21 12:59:53] [INFO ] Deduced a trap composed of 18 places in 378 ms of which 2 ms to minimize.
[2024-05-21 12:59:53] [INFO ] Deduced a trap composed of 14 places in 280 ms of which 2 ms to minimize.
[2024-05-21 12:59:53] [INFO ] Deduced a trap composed of 7 places in 92 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 277/4007 variables, and 12 constraints, problems are : Problem set: 0 solved, 3902 unsolved in 30134 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/278 constraints, ReadFeed: 0/303 constraints, PredecessorRefiner: 3902/2705 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3902 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/277 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3902 unsolved
Problem TDEAD808 is UNSAT
Problem TDEAD809 is UNSAT
Problem TDEAD810 is UNSAT
Problem TDEAD811 is UNSAT
Problem TDEAD812 is UNSAT
Problem TDEAD813 is UNSAT
Problem TDEAD817 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/277 variables, 4/12 constraints. Problems are: Problem set: 7 solved, 3895 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 277/4007 variables, and 12 constraints, problems are : Problem set: 7 solved, 3895 unsolved in 30079 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/278 constraints, ReadFeed: 0/303 constraints, PredecessorRefiner: 1197/2705 constraints, Known Traps: 4/4 constraints]
After SMT, in 110482ms problems are : Problem set: 7 solved, 3895 unsolved
Search for dead transitions found 7 dead transitions in 110598ms
Found 7 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 7 transitions
Dead transitions reduction (with SMT) removed 7 transitions
Starting structural reductions in LTL mode, iteration 1 : 278/280 places, 3897/3904 transitions.
Reduce places removed 1 places and 25 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 277 transition count 3872
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 276 transition count 3847
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 276 transition count 3847
Applied a total of 3 rules in 80 ms. Remains 276 /278 variables (removed 2) and now considering 3847/3897 (removed 50) transitions.
[2024-05-21 13:00:32] [INFO ] Flow matrix only has 3675 transitions (discarded 172 similar events)
// Phase 1: matrix 3675 rows 276 cols
[2024-05-21 13:00:32] [INFO ] Computed 8 invariants in 40 ms
[2024-05-21 13:00:33] [INFO ] Implicit Places using invariants in 630 ms returned []
[2024-05-21 13:00:33] [INFO ] Flow matrix only has 3675 transitions (discarded 172 similar events)
[2024-05-21 13:00:33] [INFO ] Invariant cache hit.
[2024-05-21 13:00:34] [INFO ] State equation strengthened by 297 read => feed constraints.
[2024-05-21 13:00:36] [INFO ] Implicit Places using invariants and state equation in 3015 ms returned []
Implicit Place search using SMT with State Equation took 3661 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 276/280 places, 3847/3904 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 119950 ms. Remains : 276/280 places, 3847/3904 transitions.
Support contains 6 out of 276 places after structural reductions.
[2024-05-21 13:00:37] [INFO ] Flatten gal took : 505 ms
[2024-05-21 13:00:37] [INFO ] Flatten gal took : 206 ms
[2024-05-21 13:00:38] [INFO ] Input system was already deterministic with 3847 transitions.
RANDOM walk for 40001 steps (810 resets) in 2504 ms. (15 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40004 steps (247 resets) in 295 ms. (135 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (269 resets) in 214 ms. (186 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (257 resets) in 209 ms. (190 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (241 resets) in 253 ms. (157 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (205 resets) in 247 ms. (161 steps per ms) remains 5/5 properties
[2024-05-21 13:00:39] [INFO ] Flow matrix only has 3675 transitions (discarded 172 similar events)
[2024-05-21 13:00:39] [INFO ] Invariant cache hit.
[2024-05-21 13:00:39] [INFO ] State equation strengthened by 297 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp4 is UNSAT
At refinement iteration 1 (OVERLAPS) 39/44 variables, 2/2 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/2 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1105/1149 variables, 44/46 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1149 variables, 97/143 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1149 variables, 0/143 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 2547/3696 variables, 128/271 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3696 variables, 2/273 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3696 variables, 166/439 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3696 variables, 0/439 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 3/3699 variables, 1/440 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3699 variables, 1/441 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3699 variables, 0/441 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 226/3925 variables, 78/519 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3925 variables, 1/520 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3925 variables, 34/554 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3925 variables, 0/554 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 2/3927 variables, 1/555 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3927 variables, 0/555 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 24/3951 variables, 25/580 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3951 variables, 1/581 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3951 variables, 0/581 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 0/3951 variables, 0/581 constraints. Problems are: Problem set: 2 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3951/3951 variables, and 581 constraints, problems are : Problem set: 2 solved, 3 unsolved in 2004 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 276/276 constraints, ReadFeed: 297/297 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 88/91 variables, 3/3 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 2/5 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 0/5 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 3518/3609 variables, 95/100 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3609 variables, 3/103 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3609 variables, 260/363 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3609 variables, 1/364 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3609 variables, 0/364 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 7/3616 variables, 2/366 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3616 variables, 2/368 constraints. Problems are: Problem set: 2 solved, 3 unsolved
[2024-05-21 13:00:42] [INFO ] Deduced a trap composed of 12 places in 135 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/3616 variables, 1/369 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3616 variables, 0/369 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 175/3791 variables, 148/517 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3791 variables, 1/518 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3791 variables, 11/529 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3791 variables, 2/531 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3791 variables, 0/531 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 145/3936 variables, 14/545 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3936 variables, 24/569 constraints. Problems are: Problem set: 2 solved, 3 unsolved
[2024-05-21 13:00:44] [INFO ] Deduced a trap composed of 24 places in 321 ms of which 1 ms to minimize.
Problem AtomicPropp0 is UNSAT
At refinement iteration 20 (INCLUDED_ONLY) 0/3936 variables, 1/570 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3936 variables, 0/570 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 2/3938 variables, 1/571 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3938 variables, 0/571 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 13/3951 variables, 14/585 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/3951 variables, 1/586 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/3951 variables, 0/586 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 0/3951 variables, 0/586 constraints. Problems are: Problem set: 3 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3951/3951 variables, and 586 constraints, problems are : Problem set: 3 solved, 2 unsolved in 3757 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 276/276 constraints, ReadFeed: 297/297 constraints, PredecessorRefiner: 3/5 constraints, Known Traps: 2/2 constraints]
After SMT, in 5812ms problems are : Problem set: 3 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1534 ms.
Support contains 2 out of 276 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 276/276 places, 3847/3847 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 275 transition count 3814
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 275 transition count 3814
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 6 place count 273 transition count 3820
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 273 transition count 3814
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 18 place count 267 transition count 3814
Applied a total of 18 rules in 290 ms. Remains 267 /276 variables (removed 9) and now considering 3814/3847 (removed 33) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 291 ms. Remains : 267/276 places, 3814/3847 transitions.
RANDOM walk for 40000 steps (13 resets) in 747 ms. (53 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (15 resets) in 472 ms. (84 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (18 resets) in 205 ms. (194 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 100902 steps, run timeout after 3001 ms. (steps per millisecond=33 ) properties seen :0 out of 2
Probabilistic random walk after 100902 steps, saw 35243 distinct states, run finished after 3011 ms. (steps per millisecond=33 ) properties seen :0
[2024-05-21 13:00:50] [INFO ] Flow matrix only has 3645 transitions (discarded 169 similar events)
// Phase 1: matrix 3645 rows 267 cols
[2024-05-21 13:00:50] [INFO ] Computed 8 invariants in 39 ms
[2024-05-21 13:00:50] [INFO ] State equation strengthened by 277 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 60/62 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 3429/3491 variables, 66/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3491 variables, 2/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3491 variables, 213/284 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3491 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 5/3496 variables, 2/286 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3496 variables, 1/287 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3496 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 389/3885 variables, 181/468 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3885 variables, 2/470 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3885 variables, 56/526 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3885 variables, 0/526 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 27/3912 variables, 17/543 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3912 variables, 2/545 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3912 variables, 7/552 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3912 variables, 0/552 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/3912 variables, 0/552 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3912/3912 variables, and 552 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2892 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 267/267 constraints, ReadFeed: 277/277 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 60/62 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 3429/3491 variables, 66/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3491 variables, 2/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3491 variables, 213/284 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3491 variables, 1/285 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3491 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 5/3496 variables, 2/287 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3496 variables, 1/288 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3496 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 389/3885 variables, 181/469 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3885 variables, 2/471 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3885 variables, 56/527 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3885 variables, 1/528 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 13:00:55] [INFO ] Deduced a trap composed of 57 places in 731 ms of which 27 ms to minimize.
[2024-05-21 13:00:56] [INFO ] Deduced a trap composed of 56 places in 681 ms of which 2 ms to minimize.
[2024-05-21 13:00:57] [INFO ] Deduced a trap composed of 10 places in 667 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/3885 variables, 3/531 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3885 variables, 0/531 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 27/3912 variables, 17/548 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3912 variables, 2/550 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3912 variables, 7/557 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3912 variables, 0/557 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/3912 variables, 0/557 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3912/3912 variables, and 557 constraints, problems are : Problem set: 0 solved, 2 unsolved in 4614 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 267/267 constraints, ReadFeed: 277/277 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints]
After SMT, in 7653ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 227 ms.
Support contains 2 out of 267 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 267/267 places, 3814/3814 transitions.
Applied a total of 0 rules in 93 ms. Remains 267 /267 variables (removed 0) and now considering 3814/3814 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 93 ms. Remains : 267/267 places, 3814/3814 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 267/267 places, 3814/3814 transitions.
Applied a total of 0 rules in 78 ms. Remains 267 /267 variables (removed 0) and now considering 3814/3814 (removed 0) transitions.
[2024-05-21 13:00:58] [INFO ] Flow matrix only has 3645 transitions (discarded 169 similar events)
[2024-05-21 13:00:58] [INFO ] Invariant cache hit.
[2024-05-21 13:00:59] [INFO ] Implicit Places using invariants in 480 ms returned []
[2024-05-21 13:00:59] [INFO ] Flow matrix only has 3645 transitions (discarded 169 similar events)
[2024-05-21 13:00:59] [INFO ] Invariant cache hit.
[2024-05-21 13:00:59] [INFO ] State equation strengthened by 277 read => feed constraints.
[2024-05-21 13:01:00] [INFO ] Implicit Places using invariants and state equation in 1956 ms returned []
Implicit Place search using SMT with State Equation took 2445 ms to find 0 implicit places.
[2024-05-21 13:01:01] [INFO ] Redundant transitions in 292 ms returned []
Running 3813 sub problems to find dead transitions.
[2024-05-21 13:01:01] [INFO ] Flow matrix only has 3645 transitions (discarded 169 similar events)
[2024-05-21 13:01:01] [INFO ] Invariant cache hit.
[2024-05-21 13:01:01] [INFO ] State equation strengthened by 277 read => feed constraints.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running BugTracking-PT-q8m002

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 754
TRANSITIONS: 27370
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.906s, Sys 0.065s]


SAVING FILE /home/mcc/execution/model (.net / .def) ...
EXPORT TIME: [User 0.120s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 648
MODEL NAME: /home/mcc/execution/model
754 places, 27370 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.

BK_TIME_CONFINEMENT_REACHED

--------------------
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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BugTracking-PT-q8m002"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is BugTracking-PT-q8m002, 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 r047-tajo-171620398100387"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BugTracking-PT-q8m002.tgz
mv BugTracking-PT-q8m002 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 ;