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.r223-tall-171649611600515.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 greatspnxred
Input is Medical-PT-02, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r223-tall-171649611600515
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.6M
-rw-r--r-- 1 mcc users 9.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 97K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K Apr 22 14:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Apr 22 14:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:52 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 13 14:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 132K Apr 13 14:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Apr 13 14:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 70K Apr 13 14:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 19 07:13 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 19 15:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 3.1M 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 Medical-PT-02-LTLCardinality-00
FORMULA_NAME Medical-PT-02-LTLCardinality-01
FORMULA_NAME Medical-PT-02-LTLCardinality-02
FORMULA_NAME Medical-PT-02-LTLCardinality-03
FORMULA_NAME Medical-PT-02-LTLCardinality-04
FORMULA_NAME Medical-PT-02-LTLCardinality-05
FORMULA_NAME Medical-PT-02-LTLCardinality-06
FORMULA_NAME Medical-PT-02-LTLCardinality-07
FORMULA_NAME Medical-PT-02-LTLCardinality-08
FORMULA_NAME Medical-PT-02-LTLCardinality-09
FORMULA_NAME Medical-PT-02-LTLCardinality-10
FORMULA_NAME Medical-PT-02-LTLCardinality-11
FORMULA_NAME Medical-PT-02-LTLCardinality-12
FORMULA_NAME Medical-PT-02-LTLCardinality-13
FORMULA_NAME Medical-PT-02-LTLCardinality-14
FORMULA_NAME Medical-PT-02-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716566390094

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Medical-PT-02
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-24 15:59:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-24 15:59:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 15:59:51] [INFO ] Load time of PNML (sax parser for PT used): 313 ms
[2024-05-24 15:59:51] [INFO ] Transformed 312 places.
[2024-05-24 15:59:51] [INFO ] Transformed 5431 transitions.
[2024-05-24 15:59:51] [INFO ] Parsed PT model containing 312 places and 5431 transitions and 28790 arcs in 453 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
Deduced a syphon composed of 242 places in 24 ms
Reduce places removed 242 places and 5204 transitions.
Reduce places removed 1 places and 0 transitions.
Initial state reduction rules removed 2 formulas.
FORMULA Medical-PT-02-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-02-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-02-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-02-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-02-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-02-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-02-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-02-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-02-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-02-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-02-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-02-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-02-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 3 out of 69 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 227/227 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 68 transition count 227
Applied a total of 1 rules in 18 ms. Remains 68 /69 variables (removed 1) and now considering 227/227 (removed 0) transitions.
[2024-05-24 15:59:51] [INFO ] Flow matrix only has 182 transitions (discarded 45 similar events)
// Phase 1: matrix 182 rows 68 cols
[2024-05-24 15:59:52] [INFO ] Computed 9 invariants in 12 ms
[2024-05-24 15:59:52] [INFO ] Implicit Places using invariants in 265 ms returned []
[2024-05-24 15:59:52] [INFO ] Flow matrix only has 182 transitions (discarded 45 similar events)
[2024-05-24 15:59:52] [INFO ] Invariant cache hit.
[2024-05-24 15:59:52] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-05-24 15:59:52] [INFO ] Implicit Places using invariants and state equation in 224 ms returned []
Implicit Place search using SMT with State Equation took 520 ms to find 0 implicit places.
Running 222 sub problems to find dead transitions.
[2024-05-24 15:59:52] [INFO ] Flow matrix only has 182 transitions (discarded 45 similar events)
[2024-05-24 15:59:52] [INFO ] Invariant cache hit.
[2024-05-24 15:59:52] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 222 unsolved
[2024-05-24 15:59:53] [INFO ] Deduced a trap composed of 6 places in 193 ms of which 9 ms to minimize.
Problem TDEAD213 is UNSAT
Problem TDEAD218 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 1/7 constraints. Problems are: Problem set: 2 solved, 220 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/7 constraints. Problems are: Problem set: 2 solved, 220 unsolved
At refinement iteration 3 (OVERLAPS) 4/67 variables, 3/10 constraints. Problems are: Problem set: 2 solved, 220 unsolved
[2024-05-24 15:59:54] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 1 ms to minimize.
[2024-05-24 15:59:54] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 2 ms to minimize.
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
[2024-05-24 15:59:54] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 0 ms to minimize.
Problem TDEAD156 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD170 is UNSAT
[2024-05-24 15:59:55] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 2 ms to minimize.
[2024-05-24 15:59:55] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 1 ms to minimize.
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 5/15 constraints. Problems are: Problem set: 20 solved, 202 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 0/15 constraints. Problems are: Problem set: 20 solved, 202 unsolved
At refinement iteration 6 (OVERLAPS) 182/249 variables, 67/82 constraints. Problems are: Problem set: 20 solved, 202 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/249 variables, 56/138 constraints. Problems are: Problem set: 20 solved, 202 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/249 variables, 0/138 constraints. Problems are: Problem set: 20 solved, 202 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 1/250 variables, 1/139 constraints. Problems are: Problem set: 20 solved, 202 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/250 variables, 0/139 constraints. Problems are: Problem set: 20 solved, 202 unsolved
At refinement iteration 11 (OVERLAPS) 0/250 variables, 0/139 constraints. Problems are: Problem set: 20 solved, 202 unsolved
No progress, stopping.
After SMT solving in domain Real declared 250/250 variables, and 139 constraints, problems are : Problem set: 20 solved, 202 unsolved in 6203 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 68/68 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 222/222 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 20 solved, 202 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 6/6 constraints. Problems are: Problem set: 20 solved, 202 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 4/10 constraints. Problems are: Problem set: 20 solved, 202 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/10 constraints. Problems are: Problem set: 20 solved, 202 unsolved
At refinement iteration 3 (OVERLAPS) 4/67 variables, 3/13 constraints. Problems are: Problem set: 20 solved, 202 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 2/15 constraints. Problems are: Problem set: 20 solved, 202 unsolved
[2024-05-24 15:59:59] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 1 ms to minimize.
Problem TDEAD60 is UNSAT
Problem TDEAD64 is UNSAT
[2024-05-24 15:59:59] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 0 ms to minimize.
Problem TDEAD203 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 2/17 constraints. Problems are: Problem set: 26 solved, 196 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 0/17 constraints. Problems are: Problem set: 26 solved, 196 unsolved
At refinement iteration 7 (OVERLAPS) 182/249 variables, 67/84 constraints. Problems are: Problem set: 26 solved, 196 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/249 variables, 56/140 constraints. Problems are: Problem set: 26 solved, 196 unsolved
Problem TDEAD8 is UNSAT
Problem TDEAD128 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/249 variables, 146/286 constraints. Problems are: Problem set: 28 solved, 194 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/249 variables, 0/286 constraints. Problems are: Problem set: 28 solved, 194 unsolved
At refinement iteration 11 (OVERLAPS) 1/250 variables, 1/287 constraints. Problems are: Problem set: 28 solved, 194 unsolved
Problem TDEAD177 is UNSAT
At refinement iteration 12 (INCLUDED_ONLY) 0/250 variables, 50/337 constraints. Problems are: Problem set: 29 solved, 193 unsolved
[2024-05-24 16:00:04] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 1 ms to minimize.
Problem TDEAD135 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD178 is UNSAT
At refinement iteration 13 (INCLUDED_ONLY) 0/250 variables, 1/338 constraints. Problems are: Problem set: 33 solved, 189 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/250 variables, 0/338 constraints. Problems are: Problem set: 33 solved, 189 unsolved
At refinement iteration 15 (OVERLAPS) 0/250 variables, 0/338 constraints. Problems are: Problem set: 33 solved, 189 unsolved
No progress, stopping.
After SMT solving in domain Int declared 250/250 variables, and 338 constraints, problems are : Problem set: 33 solved, 189 unsolved in 9434 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 68/68 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 196/222 constraints, Known Traps: 9/9 constraints]
After SMT, in 15926ms problems are : Problem set: 33 solved, 189 unsolved
Search for dead transitions found 33 dead transitions in 15947ms
Found 33 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 33 transitions
Dead transitions reduction (with SMT) removed 33 transitions
Starting structural reductions in LTL mode, iteration 1 : 68/69 places, 194/227 transitions.
Reduce places removed 7 places and 46 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 61 transition count 148
Reduce places removed 4 places and 26 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 11 place count 57 transition count 122
Reduce places removed 2 places and 12 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 13 place count 55 transition count 110
Reduce places removed 3 places and 16 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 16 place count 52 transition count 94
Reduce places removed 1 places and 4 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 17 place count 51 transition count 90
Reduce places removed 0 places and 5 transitions.
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 17 rules in 7 ms. Remains 51 /68 variables (removed 17) and now considering 85/194 (removed 109) transitions.
[2024-05-24 16:00:08] [INFO ] Flow matrix only has 77 transitions (discarded 8 similar events)
// Phase 1: matrix 77 rows 51 cols
[2024-05-24 16:00:08] [INFO ] Computed 10 invariants in 1 ms
[2024-05-24 16:00:08] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-24 16:00:08] [INFO ] Flow matrix only has 77 transitions (discarded 8 similar events)
[2024-05-24 16:00:08] [INFO ] Invariant cache hit.
[2024-05-24 16:00:08] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-24 16:00:08] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 133 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 51/69 places, 85/227 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 16642 ms. Remains : 51/69 places, 85/227 transitions.
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Support contains 2 out of 50 places after structural reductions.
FORMULA Medical-PT-02-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-24 16:00:08] [INFO ] Flatten gal took : 32 ms
[2024-05-24 16:00:08] [INFO ] Flatten gal took : 22 ms
[2024-05-24 16:00:08] [INFO ] Input system was already deterministic with 85 transitions.
RANDOM walk for 40001 steps (323 resets) in 683 ms. (58 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40003 steps (141 resets) in 127 ms. (312 steps per ms) remains 1/1 properties
[2024-05-24 16:00:09] [INFO ] Flow matrix only has 77 transitions (discarded 8 similar events)
// Phase 1: matrix 77 rows 50 cols
[2024-05-24 16:00:09] [INFO ] Computed 9 invariants in 4 ms
[2024-05-24 16:00:09] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp1 is UNSAT
After SMT solving in domain Real declared 3/127 variables, and 1 constraints, problems are : Problem set: 1 solved, 0 unsolved in 34 ms.
Refiners :[Positive P Invariants (semi-flows): 1/9 constraints, State Equation: 0/50 constraints, ReadFeed: 0/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 42ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 2 simplifications.
FORMULA Medical-PT-02-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 8 stabilizing places and 17 stable transitions
Graph (complete) has 231 edges and 50 vertex of which 49 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 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' '!(F(G(p0)))'
Support contains 1 out of 50 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 50/50 places, 85/85 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 50 transition count 82
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 47 transition count 82
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 46 transition count 82
Applied a total of 8 rules in 20 ms. Remains 46 /50 variables (removed 4) and now considering 82/85 (removed 3) transitions.
[2024-05-24 16:00:09] [INFO ] Flow matrix only has 73 transitions (discarded 9 similar events)
// Phase 1: matrix 73 rows 46 cols
[2024-05-24 16:00:09] [INFO ] Computed 9 invariants in 1 ms
[2024-05-24 16:00:09] [INFO ] Implicit Places using invariants in 120 ms returned []
[2024-05-24 16:00:09] [INFO ] Flow matrix only has 73 transitions (discarded 9 similar events)
[2024-05-24 16:00:09] [INFO ] Invariant cache hit.
[2024-05-24 16:00:09] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-05-24 16:00:09] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 225 ms to find 0 implicit places.
[2024-05-24 16:00:09] [INFO ] Redundant transitions in 1 ms returned []
Running 80 sub problems to find dead transitions.
[2024-05-24 16:00:09] [INFO ] Flow matrix only has 73 transitions (discarded 9 similar events)
[2024-05-24 16:00:09] [INFO ] Invariant cache hit.
[2024-05-24 16:00:09] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-24 16:00:09] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-24 16:00:10] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (OVERLAPS) 2/46 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (OVERLAPS) 73/119 variables, 46/57 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/119 variables, 39/96 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/119 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-24 16:00:10] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/119 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/119 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 10 (OVERLAPS) 0/119 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Real declared 119/119 variables, and 97 constraints, problems are : Problem set: 0 solved, 80 unsolved in 1612 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 46/46 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 80 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (OVERLAPS) 2/46 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (OVERLAPS) 73/119 variables, 46/58 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/119 variables, 39/97 constraints. Problems are: Problem set: 0 solved, 80 unsolved
Problem TDEAD30 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD42 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/119 variables, 80/177 constraints. Problems are: Problem set: 5 solved, 75 unsolved
[2024-05-24 16:00:11] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-24 16:00:12] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/119 variables, 2/179 constraints. Problems are: Problem set: 5 solved, 75 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/119 variables, 0/179 constraints. Problems are: Problem set: 5 solved, 75 unsolved
At refinement iteration 10 (OVERLAPS) 0/119 variables, 0/179 constraints. Problems are: Problem set: 5 solved, 75 unsolved
No progress, stopping.
After SMT solving in domain Int declared 119/119 variables, and 179 constraints, problems are : Problem set: 5 solved, 75 unsolved in 1552 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 46/46 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 5/5 constraints]
After SMT, in 3195ms problems are : Problem set: 5 solved, 75 unsolved
Search for dead transitions found 5 dead transitions in 3196ms
Found 5 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 5 transitions
Dead transitions reduction (with SMT) removed 5 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 46/50 places, 77/85 transitions.
Reduce places removed 2 places and 6 transitions.
Reduce places removed 1 places and 4 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 43 transition count 67
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 42 transition count 65
Reduce places removed 1 places and 5 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3 place count 41 transition count 60
Reduce places removed 1 places and 4 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 4 place count 40 transition count 56
Applied a total of 4 rules in 12 ms. Remains 40 /46 variables (removed 6) and now considering 56/77 (removed 21) transitions.
[2024-05-24 16:00:12] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
// Phase 1: matrix 50 rows 40 cols
[2024-05-24 16:00:12] [INFO ] Computed 9 invariants in 1 ms
[2024-05-24 16:00:12] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-24 16:00:12] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
[2024-05-24 16:00:12] [INFO ] Invariant cache hit.
[2024-05-24 16:00:13] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-05-24 16:00:13] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 40/50 places, 56/85 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3564 ms. Remains : 40/50 places, 56/85 transitions.
Stuttering acceptance computed with spot in 157 ms :[(NOT p0)]
Running random walk in product with property : Medical-PT-02-LTLCardinality-09
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 1 ms.
FORMULA Medical-PT-02-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Medical-PT-02-LTLCardinality-09 finished in 3789 ms.
All properties solved by simple procedures.
Total runtime 21933 ms.
ITS solved all properties within timeout

BK_STOP 1716566413241

--------------------
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="Medical-PT-02"
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 Medical-PT-02, 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 r223-tall-171649611600515"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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