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-171620398200411.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-q8m016, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r047-tajo-171620398200411
=====================================================================

--------------------
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 101K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 19 15:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 17:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.9K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 80K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Apr 12 02:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K Apr 12 02:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 19 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 19 15:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 16M May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716298339321

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-q8m016
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 13:32:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-21 13:32:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 13:32:21] [INFO ] Load time of PNML (sax parser for PT used): 999 ms
[2024-05-21 13:32:21] [INFO ] Transformed 754 places.
[2024-05-21 13:32:22] [INFO ] Transformed 27370 transitions.
[2024-05-21 13:32:22] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 1325 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 32 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 474 places in 101 ms
Reduce places removed 474 places and 23466 transitions.
FORMULA BugTracking-PT-q8m016-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m016-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m016-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m016-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m016-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m016-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m016-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m016-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m016-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 14 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 3904/3904 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 279 transition count 3904
Applied a total of 1 rules in 102 ms. Remains 279 /280 variables (removed 1) and now considering 3904/3904 (removed 0) transitions.
[2024-05-21 13:32:22] [INFO ] Flow matrix only has 3729 transitions (discarded 175 similar events)
// Phase 1: matrix 3729 rows 279 cols
[2024-05-21 13:32:22] [INFO ] Computed 9 invariants in 50 ms
[2024-05-21 13:32:23] [INFO ] Implicit Places using invariants in 883 ms returned []
[2024-05-21 13:32:23] [INFO ] Flow matrix only has 3729 transitions (discarded 175 similar events)
[2024-05-21 13:32:23] [INFO ] Invariant cache hit.
[2024-05-21 13:32:24] [INFO ] State equation strengthened by 303 read => feed constraints.
[2024-05-21 13:32:27] [INFO ] Implicit Places using invariants and state equation in 3302 ms returned []
Implicit Place search using SMT with State Equation took 4255 ms to find 0 implicit places.
Running 3902 sub problems to find dead transitions.
[2024-05-21 13:32:27] [INFO ] Flow matrix only has 3729 transitions (discarded 175 similar events)
[2024-05-21 13:32:27] [INFO ] Invariant cache hit.
[2024-05-21 13:32:27] [INFO ] State equation strengthened by 303 read => feed constraints.
SMT process timed out in 73684ms, After SMT, problems are : Problem set: 0 solved, 3902 unsolved
Search for dead transitions found 0 dead transitions in 73886ms
Starting structural reductions in LTL mode, iteration 1 : 279/280 places, 3904/3904 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 78323 ms. Remains : 279/280 places, 3904/3904 transitions.
Support contains 14 out of 279 places after structural reductions.
[2024-05-21 13:33:42] [INFO ] Flatten gal took : 435 ms
[2024-05-21 13:33:42] [INFO ] Flatten gal took : 297 ms
[2024-05-21 13:33:43] [INFO ] Input system was already deterministic with 3904 transitions.
RANDOM walk for 40013 steps (160 resets) in 2575 ms. (15 steps per ms) remains 8/11 properties
BEST_FIRST walk for 40004 steps (25 resets) in 173 ms. (229 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (23 resets) in 146 ms. (272 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (26 resets) in 155 ms. (256 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (25 resets) in 259 ms. (153 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (22 resets) in 148 ms. (268 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (26 resets) in 218 ms. (182 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (22 resets) in 180 ms. (221 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (30 resets) in 138 ms. (287 steps per ms) remains 8/8 properties
[2024-05-21 13:33:44] [INFO ] Flow matrix only has 3729 transitions (discarded 175 similar events)
[2024-05-21 13:33:44] [INFO ] Invariant cache hit.
[2024-05-21 13:33:44] [INFO ] State equation strengthened by 303 read => feed constraints.
Problem AtomicPropp1 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 7 unsolved
Problem AtomicPropp9 is UNSAT
At refinement iteration 1 (OVERLAPS) 77/87 variables, 4/4 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 0/4 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 2938/3025 variables, 87/91 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3025 variables, 101/192 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3025 variables, 0/192 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 976/4001 variables, 185/377 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4001 variables, 3/380 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/4001 variables, 202/582 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4001 variables, 0/582 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 3/4004 variables, 2/584 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4004 variables, 3/587 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4004 variables, 0/587 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 4/4008 variables, 4/591 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4008 variables, 0/591 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 0/4008 variables, 0/591 constraints. Problems are: Problem set: 2 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4008/4008 variables, and 591 constraints, problems are : Problem set: 2 solved, 6 unsolved in 2166 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 279/279 constraints, ReadFeed: 303/303 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 60/67 variables, 2/2 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/2 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 1814/1881 variables, 67/69 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1881 variables, 6/75 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1881 variables, 0/75 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 2056/3937 variables, 143/218 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3937 variables, 4/222 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3937 variables, 296/518 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3937 variables, 6/524 constraints. Problems are: Problem set: 2 solved, 6 unsolved
[2024-05-21 13:33:48] [INFO ] Deduced a trap composed of 12 places in 257 ms of which 38 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/3937 variables, 1/525 constraints. Problems are: Problem set: 2 solved, 6 unsolved
[2024-05-21 13:33:49] [INFO ] Deduced a trap composed of 26 places in 476 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/3937 variables, 1/526 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3937 variables, 0/526 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 8/3945 variables, 3/529 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3945 variables, 4/533 constraints. Problems are: Problem set: 2 solved, 6 unsolved
[2024-05-21 13:33:50] [INFO ] Deduced a trap composed of 17 places in 174 ms of which 1 ms to minimize.
Problem AtomicPropp0 is UNSAT
[2024-05-21 13:33:51] [INFO ] Deduced a trap composed of 11 places in 420 ms of which 1 ms to minimize.
Problem AtomicPropp5 is UNSAT
[2024-05-21 13:33:51] [INFO ] Deduced a trap composed of 12 places in 370 ms of which 1 ms to minimize.
[2024-05-21 13:33:52] [INFO ] Deduced a trap composed of 12 places in 247 ms of which 4 ms to minimize.
SMT process timed out in 7418ms, After SMT, problems are : Problem set: 2 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 5 out of 279 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 279/279 places, 3904/3904 transitions.
Graph (complete) has 4615 edges and 279 vertex of which 278 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.26 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 277 transition count 3871
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 277 transition count 3871
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 7 place count 275 transition count 3877
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 275 transition count 3871
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 19 place count 269 transition count 3871
Applied a total of 19 rules in 489 ms. Remains 269 /279 variables (removed 10) and now considering 3871/3904 (removed 33) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 503 ms. Remains : 269/279 places, 3871/3904 transitions.
RANDOM walk for 40011 steps (8 resets) in 383 ms. (104 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 255 ms. (156 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 197 ms. (202 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 164 ms. (242 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 161 ms. (246 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 95463 steps, run timeout after 3001 ms. (steps per millisecond=31 ) properties seen :0 out of 4
Probabilistic random walk after 95463 steps, saw 31564 distinct states, run finished after 3013 ms. (steps per millisecond=31 ) properties seen :0
[2024-05-21 13:33:56] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2024-05-21 13:33:56] [INFO ] Computed 8 invariants in 16 ms
[2024-05-21 13:33:56] [INFO ] State equation strengthened by 283 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, 4 unsolved
At refinement iteration 1 (OVERLAPS) 60/65 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1785/1850 variables, 65/67 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1850 variables, 4/71 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1850 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 2023/3873 variables, 112/183 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3873 variables, 3/186 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3873 variables, 276/462 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3873 variables, 0/462 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 5/3878 variables, 2/464 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3878 variables, 1/465 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3878 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 90/3968 variables, 91/556 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3968 variables, 1/557 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3968 variables, 3/560 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3968 variables, 0/560 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 0/3968 variables, 0/560 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3968/3968 variables, and 560 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1796 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 269/269 constraints, ReadFeed: 283/283 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 60/65 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1785/1850 variables, 65/67 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1850 variables, 4/71 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1850 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 2023/3873 variables, 112/183 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3873 variables, 3/186 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3873 variables, 276/462 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3873 variables, 3/465 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 13:33:59] [INFO ] Deduced a trap composed of 26 places in 303 ms of which 1 ms to minimize.
[2024-05-21 13:33:59] [INFO ] Deduced a trap composed of 27 places in 277 ms of which 14 ms to minimize.
Problem AtomicPropp4 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/3873 variables, 2/467 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3873 variables, 0/467 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 5/3878 variables, 2/469 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3878 variables, 1/470 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3878 variables, 0/470 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 90/3968 variables, 91/561 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3968 variables, 1/562 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3968 variables, 3/565 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3968 variables, 1/566 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3968 variables, 0/566 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 0/3968 variables, 0/566 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3968/3968 variables, and 566 constraints, problems are : Problem set: 1 solved, 3 unsolved in 3122 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 269/269 constraints, ReadFeed: 283/283 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 2/2 constraints]
After SMT, in 5020ms problems are : Problem set: 1 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1779 ms.
Support contains 4 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 89 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 89 ms. Remains : 269/269 places, 3871/3871 transitions.
RANDOM walk for 40016 steps (8 resets) in 412 ms. (96 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 211 ms. (188 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 147 ms. (270 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 122 ms. (325 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 112207 steps, run timeout after 3001 ms. (steps per millisecond=37 ) properties seen :0 out of 3
Probabilistic random walk after 112207 steps, saw 36857 distinct states, run finished after 3001 ms. (steps per millisecond=37 ) properties seen :0
[2024-05-21 13:34:06] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2024-05-21 13:34:06] [INFO ] Invariant cache hit.
[2024-05-21 13:34:06] [INFO ] State equation strengthened by 283 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 60/64 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1751/1815 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1815 variables, 3/69 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1815 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 1017/2832 variables, 77/146 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2832 variables, 2/148 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2832 variables, 204/352 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2832 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 1/2833 variables, 1/353 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2833 variables, 1/354 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2833 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 1066/3899 variables, 90/444 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3899 variables, 1/445 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3899 variables, 63/508 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3899 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 4/3903 variables, 1/509 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3903 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 65/3968 variables, 37/546 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3968 variables, 1/547 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3968 variables, 13/560 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3968 variables, 0/560 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (OVERLAPS) 0/3968 variables, 0/560 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3968/3968 variables, and 560 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1655 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 269/269 constraints, ReadFeed: 283/283 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 60/64 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1751/1815 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1815 variables, 3/69 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1815 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 1017/2832 variables, 77/146 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2832 variables, 2/148 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2832 variables, 204/352 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2832 variables, 2/354 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2832 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 1/2833 variables, 1/355 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2833 variables, 1/356 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2833 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 1066/3899 variables, 90/446 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3899 variables, 1/447 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3899 variables, 63/510 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3899 variables, 1/511 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3899 variables, 0/511 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 4/3903 variables, 1/512 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3903 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 65/3968 variables, 37/549 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3968 variables, 1/550 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3968 variables, 13/563 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3968 variables, 0/563 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (OVERLAPS) 0/3968 variables, 0/563 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3968/3968 variables, and 563 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2800 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 269/269 constraints, ReadFeed: 283/283 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 4484ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 587 ms.
Support contains 4 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 80 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80 ms. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 78 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2024-05-21 13:34:11] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2024-05-21 13:34:11] [INFO ] Invariant cache hit.
[2024-05-21 13:34:12] [INFO ] Implicit Places using invariants in 505 ms returned []
[2024-05-21 13:34:12] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2024-05-21 13:34:12] [INFO ] Invariant cache hit.
[2024-05-21 13:34:12] [INFO ] State equation strengthened by 283 read => feed constraints.
[2024-05-21 13:34:14] [INFO ] Implicit Places using invariants and state equation in 2249 ms returned []
Implicit Place search using SMT with State Equation took 2760 ms to find 0 implicit places.
[2024-05-21 13:34:14] [INFO ] Redundant transitions in 285 ms returned []
Running 3870 sub problems to find dead transitions.
[2024-05-21 13:34:14] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2024-05-21 13:34:14] [INFO ] Invariant cache hit.
[2024-05-21 13:34:14] [INFO ] State equation strengthened by 283 read => feed constraints.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running BugTracking-PT-q8m016

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.702s, Sys 0.054s]


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


----------------------------------------------------------------------
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: 628
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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
MEDDLY ERROR: Insufficient memory

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-q8m016"
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-q8m016, 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-171620398200411"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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