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.r528-tall-171683761400570.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is ShieldPPPt-PT-003B, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r528-tall-171683761400570
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 468K
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 16:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 07:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 11 14:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K Apr 11 14:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Apr 11 14:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 11 14:40 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 56K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldPPPt-PT-003B-CTLFireability-2024-00
FORMULA_NAME ShieldPPPt-PT-003B-CTLFireability-2024-01
FORMULA_NAME ShieldPPPt-PT-003B-CTLFireability-2024-02
FORMULA_NAME ShieldPPPt-PT-003B-CTLFireability-2024-03
FORMULA_NAME ShieldPPPt-PT-003B-CTLFireability-2024-04
FORMULA_NAME ShieldPPPt-PT-003B-CTLFireability-2024-05
FORMULA_NAME ShieldPPPt-PT-003B-CTLFireability-2024-06
FORMULA_NAME ShieldPPPt-PT-003B-CTLFireability-2024-07
FORMULA_NAME ShieldPPPt-PT-003B-CTLFireability-2024-08
FORMULA_NAME ShieldPPPt-PT-003B-CTLFireability-2024-09
FORMULA_NAME ShieldPPPt-PT-003B-CTLFireability-2024-10
FORMULA_NAME ShieldPPPt-PT-003B-CTLFireability-2024-11
FORMULA_NAME ShieldPPPt-PT-003B-CTLFireability-2023-12
FORMULA_NAME ShieldPPPt-PT-003B-CTLFireability-2023-13
FORMULA_NAME ShieldPPPt-PT-003B-CTLFireability-2023-14
FORMULA_NAME ShieldPPPt-PT-003B-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1717255403234

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPt-PT-003B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 15:23:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 15:23:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 15:23:24] [INFO ] Load time of PNML (sax parser for PT used): 77 ms
[2024-06-01 15:23:24] [INFO ] Transformed 237 places.
[2024-06-01 15:23:24] [INFO ] Transformed 216 transitions.
[2024-06-01 15:23:24] [INFO ] Found NUPN structural information;
[2024-06-01 15:23:24] [INFO ] Parsed PT model containing 237 places and 216 transitions and 540 arcs in 172 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 11 ms.
Support contains 89 out of 237 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 237/237 places, 216/216 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 223 transition count 202
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 223 transition count 202
Applied a total of 28 rules in 37 ms. Remains 223 /237 variables (removed 14) and now considering 202/216 (removed 14) transitions.
// Phase 1: matrix 202 rows 223 cols
[2024-06-01 15:23:24] [INFO ] Computed 34 invariants in 11 ms
[2024-06-01 15:23:24] [INFO ] Implicit Places using invariants in 227 ms returned []
[2024-06-01 15:23:24] [INFO ] Invariant cache hit.
[2024-06-01 15:23:25] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 393 ms to find 0 implicit places.
Running 201 sub problems to find dead transitions.
[2024-06-01 15:23:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/222 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (OVERLAPS) 1/223 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-06-01 15:23:26] [INFO ] Deduced a trap composed of 25 places in 70 ms of which 15 ms to minimize.
[2024-06-01 15:23:27] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 2 ms to minimize.
[2024-06-01 15:23:27] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 0 ms to minimize.
[2024-06-01 15:23:27] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 1 ms to minimize.
[2024-06-01 15:23:27] [INFO ] Deduced a trap composed of 20 places in 21 ms of which 0 ms to minimize.
[2024-06-01 15:23:27] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 0 ms to minimize.
[2024-06-01 15:23:27] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
[2024-06-01 15:23:27] [INFO ] Deduced a trap composed of 20 places in 21 ms of which 1 ms to minimize.
[2024-06-01 15:23:27] [INFO ] Deduced a trap composed of 21 places in 18 ms of which 0 ms to minimize.
[2024-06-01 15:23:27] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 1 ms to minimize.
[2024-06-01 15:23:27] [INFO ] Deduced a trap composed of 21 places in 21 ms of which 1 ms to minimize.
[2024-06-01 15:23:27] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 1 ms to minimize.
[2024-06-01 15:23:27] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-06-01 15:23:27] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-06-01 15:23:27] [INFO ] Deduced a trap composed of 13 places in 19 ms of which 0 ms to minimize.
[2024-06-01 15:23:27] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-06-01 15:23:27] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 2 ms to minimize.
[2024-06-01 15:23:27] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
[2024-06-01 15:23:28] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-06-01 15:23:28] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/223 variables, 20/54 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-06-01 15:23:28] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-06-01 15:23:28] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-06-01 15:23:28] [INFO ] Deduced a trap composed of 19 places in 22 ms of which 1 ms to minimize.
[2024-06-01 15:23:28] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-06-01 15:23:28] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 0 ms to minimize.
[2024-06-01 15:23:28] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 0 ms to minimize.
[2024-06-01 15:23:28] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 1 ms to minimize.
[2024-06-01 15:23:28] [INFO ] Deduced a trap composed of 22 places in 25 ms of which 1 ms to minimize.
[2024-06-01 15:23:28] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 4 ms to minimize.
[2024-06-01 15:23:29] [INFO ] Deduced a trap composed of 21 places in 20 ms of which 0 ms to minimize.
[2024-06-01 15:23:29] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
[2024-06-01 15:23:29] [INFO ] Deduced a trap composed of 25 places in 21 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/223 variables, 12/66 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/223 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 5 (OVERLAPS) 202/425 variables, 223/289 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-06-01 15:23:31] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/425 variables, 1/290 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-06-01 15:23:33] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
[2024-06-01 15:23:33] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/425 variables, 2/292 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-06-01 15:23:35] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/425 variables, 1/293 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-06-01 15:23:35] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/425 variables, 1/294 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/425 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-06-01 15:23:39] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/425 variables, 1/295 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/425 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 13 (OVERLAPS) 0/425 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 201 unsolved
No progress, stopping.
After SMT solving in domain Real declared 425/425 variables, and 295 constraints, problems are : Problem set: 0 solved, 201 unsolved in 18338 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 223/223 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 38/38 constraints]
Escalating to Integer solving :Problem set: 0 solved, 201 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/222 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (OVERLAPS) 1/223 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/223 variables, 38/72 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-06-01 15:23:44] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/223 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/223 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 5 (OVERLAPS) 202/425 variables, 223/296 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/425 variables, 201/497 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-06-01 15:23:47] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 1 ms to minimize.
[2024-06-01 15:23:47] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 1 ms to minimize.
[2024-06-01 15:23:47] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2024-06-01 15:23:47] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2024-06-01 15:23:47] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 0 ms to minimize.
[2024-06-01 15:23:47] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 1 ms to minimize.
[2024-06-01 15:23:48] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 1 ms to minimize.
[2024-06-01 15:23:48] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-06-01 15:23:48] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/425 variables, 9/506 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/425 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-06-01 15:23:53] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 1 ms to minimize.
[2024-06-01 15:23:54] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 1 ms to minimize.
[2024-06-01 15:23:55] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 2 ms to minimize.
[2024-06-01 15:23:55] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/425 variables, 4/510 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/425 variables, 0/510 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 11 (OVERLAPS) 0/425 variables, 0/510 constraints. Problems are: Problem set: 0 solved, 201 unsolved
No progress, stopping.
After SMT solving in domain Int declared 425/425 variables, and 510 constraints, problems are : Problem set: 0 solved, 201 unsolved in 21148 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 223/223 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 52/52 constraints]
After SMT, in 39549ms problems are : Problem set: 0 solved, 201 unsolved
Search for dead transitions found 0 dead transitions in 39571ms
Starting structural reductions in LTL mode, iteration 1 : 223/237 places, 202/216 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40020 ms. Remains : 223/237 places, 202/216 transitions.
Support contains 89 out of 223 places after structural reductions.
[2024-06-01 15:24:04] [INFO ] Flatten gal took : 35 ms
[2024-06-01 15:24:04] [INFO ] Flatten gal took : 14 ms
[2024-06-01 15:24:04] [INFO ] Input system was already deterministic with 202 transitions.
Support contains 86 out of 223 places (down from 89) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 1202 ms. (33 steps per ms) remains 1/60 properties
BEST_FIRST walk for 40004 steps (8 resets) in 110 ms. (360 steps per ms) remains 1/1 properties
[2024-06-01 15:24:05] [INFO ] Invariant cache hit.
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, 1 unsolved
At refinement iteration 1 (OVERLAPS) 30/32 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 191/223 variables, 32/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/223 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 202/425 variables, 223/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/425 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/425 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 425/425 variables, and 257 constraints, problems are : Problem set: 0 solved, 1 unsolved in 104 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 223/223 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 30/32 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 191/223 variables, 32/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 15:24:05] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2024-06-01 15:24:05] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-06-01 15:24:05] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/223 variables, 3/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/223 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 202/425 variables, 223/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/425 variables, 1/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 15:24:05] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 8 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/425 variables, 1/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/425 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/425 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 425/425 variables, and 262 constraints, problems are : Problem set: 0 solved, 1 unsolved in 301 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 223/223 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 412ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 20 ms.
Support contains 2 out of 223 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 223/223 places, 202/202 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 54 place count 223 transition count 148
Reduce places removed 54 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 56 rules applied. Total rules applied 110 place count 169 transition count 146
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 112 place count 168 transition count 145
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 113 place count 167 transition count 145
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 14 Pre rules applied. Total rules applied 113 place count 167 transition count 131
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 141 place count 153 transition count 131
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 153 place count 141 transition count 119
Iterating global reduction 4 with 12 rules applied. Total rules applied 165 place count 141 transition count 119
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 165 place count 141 transition count 112
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 179 place count 134 transition count 112
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 4 with 94 rules applied. Total rules applied 273 place count 87 transition count 65
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 289 place count 79 transition count 65
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 297 place count 79 transition count 65
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 298 place count 78 transition count 64
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 299 place count 77 transition count 64
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 299 place count 77 transition count 62
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 303 place count 75 transition count 62
Applied a total of 303 rules in 55 ms. Remains 75 /223 variables (removed 148) and now considering 62/202 (removed 140) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 75/223 places, 62/202 transitions.
RANDOM walk for 40000 steps (8 resets) in 284 ms. (140 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 113 ms. (350 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2037451 steps, run timeout after 3001 ms. (steps per millisecond=678 ) properties seen :0 out of 1
Probabilistic random walk after 2037451 steps, saw 887135 distinct states, run finished after 3004 ms. (steps per millisecond=678 ) properties seen :0
// Phase 1: matrix 62 rows 75 cols
[2024-06-01 15:24:09] [INFO ] Computed 33 invariants in 3 ms
[2024-06-01 15:24:09] [INFO ] State equation strengthened by 4 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, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 12/19 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 37/56 variables, 18/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/56 variables, 4/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/56 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/56 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 4/60 variables, 4/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/60 variables, 4/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/60 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 8/68 variables, 4/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/68 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 33/101 variables, 24/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/101 variables, 8/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/101 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/101 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 21/122 variables, 12/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/122 variables, 5/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/122 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/122 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 1/123 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/123 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/123 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 1/124 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/124 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/124 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 10/134 variables, 6/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/134 variables, 3/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/134 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 3/137 variables, 2/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/137 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/137 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (OVERLAPS) 0/137 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 137/137 variables, and 112 constraints, problems are : Problem set: 0 solved, 1 unsolved in 65 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, State Equation: 75/75 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 12/19 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 37/56 variables, 18/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/56 variables, 4/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/56 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/56 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/56 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 4/60 variables, 4/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/60 variables, 4/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/60 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 8/68 variables, 4/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/68 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 33/101 variables, 24/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/101 variables, 8/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/101 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/101 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 21/122 variables, 12/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/122 variables, 5/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/122 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/122 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 1/123 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/123 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/123 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 1/124 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/124 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/124 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 10/134 variables, 6/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/134 variables, 3/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/134 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 3/137 variables, 2/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/137 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/137 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 0/137 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 137/137 variables, and 113 constraints, problems are : Problem set: 0 solved, 1 unsolved in 98 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, State Equation: 75/75 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 168ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 75 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 75/75 places, 62/62 transitions.
Applied a total of 0 rules in 2 ms. Remains 75 /75 variables (removed 0) and now considering 62/62 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 75/75 places, 62/62 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 75/75 places, 62/62 transitions.
Applied a total of 0 rules in 2 ms. Remains 75 /75 variables (removed 0) and now considering 62/62 (removed 0) transitions.
[2024-06-01 15:24:09] [INFO ] Invariant cache hit.
[2024-06-01 15:24:09] [INFO ] Implicit Places using invariants in 48 ms returned [58, 62]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 49 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 73/75 places, 62/62 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 71 transition count 60
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 71 transition count 60
Applied a total of 4 rules in 3 ms. Remains 71 /73 variables (removed 2) and now considering 60/62 (removed 2) transitions.
// Phase 1: matrix 60 rows 71 cols
[2024-06-01 15:24:09] [INFO ] Computed 31 invariants in 2 ms
[2024-06-01 15:24:09] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-06-01 15:24:09] [INFO ] Invariant cache hit.
[2024-06-01 15:24:09] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-01 15:24:09] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 126 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 71/75 places, 60/62 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 180 ms. Remains : 71/75 places, 60/62 transitions.
RANDOM walk for 40000 steps (8 resets) in 95 ms. (416 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (9 resets) in 46 ms. (851 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2088320 steps, run timeout after 3001 ms. (steps per millisecond=695 ) properties seen :0 out of 1
Probabilistic random walk after 2088320 steps, saw 1247386 distinct states, run finished after 3001 ms. (steps per millisecond=695 ) properties seen :0
[2024-06-01 15:24:12] [INFO ] Invariant cache hit.
[2024-06-01 15:24:12] [INFO ] State equation strengthened by 2 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, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 12/19 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 37/56 variables, 18/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/56 variables, 4/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/56 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/56 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 4/60 variables, 4/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/60 variables, 4/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/60 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 8/68 variables, 4/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/68 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 32/100 variables, 24/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/100 variables, 8/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/100 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/118 variables, 10/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/118 variables, 5/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/118 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 10/128 variables, 6/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/128 variables, 3/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/128 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 3/131 variables, 2/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/131 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/131 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/131 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 131/131 variables, and 104 constraints, problems are : Problem set: 0 solved, 1 unsolved in 70 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, State Equation: 71/71 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 12/19 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 37/56 variables, 18/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/56 variables, 4/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/56 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/56 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/56 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 4/60 variables, 4/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/60 variables, 4/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/60 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 8/68 variables, 4/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/68 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 32/100 variables, 24/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/100 variables, 8/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/100 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 18/118 variables, 10/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/118 variables, 5/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/118 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 10/128 variables, 6/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/128 variables, 3/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/128 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 3/131 variables, 2/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/131 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/131 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/131 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 131/131 variables, and 105 constraints, problems are : Problem set: 0 solved, 1 unsolved in 88 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, State Equation: 71/71 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 162ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 71 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 71/71 places, 60/60 transitions.
Applied a total of 0 rules in 3 ms. Remains 71 /71 variables (removed 0) and now considering 60/60 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 71/71 places, 60/60 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 71/71 places, 60/60 transitions.
Applied a total of 0 rules in 2 ms. Remains 71 /71 variables (removed 0) and now considering 60/60 (removed 0) transitions.
[2024-06-01 15:24:12] [INFO ] Invariant cache hit.
[2024-06-01 15:24:12] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-06-01 15:24:12] [INFO ] Invariant cache hit.
[2024-06-01 15:24:12] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-01 15:24:12] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
[2024-06-01 15:24:12] [INFO ] Redundant transitions in 1 ms returned []
Running 55 sub problems to find dead transitions.
[2024-06-01 15:24:12] [INFO ] Invariant cache hit.
[2024-06-01 15:24:12] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2024-06-01 15:24:12] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 1 ms to minimize.
[2024-06-01 15:24:12] [INFO ] Deduced a trap composed of 6 places in 18 ms of which 1 ms to minimize.
[2024-06-01 15:24:12] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 0 ms to minimize.
[2024-06-01 15:24:12] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 1 ms to minimize.
[2024-06-01 15:24:13] [INFO ] Deduced a trap composed of 6 places in 14 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 5/33 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 3 (OVERLAPS) 3/71 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2024-06-01 15:24:13] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2024-06-01 15:24:13] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-06-01 15:24:13] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 3/39 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2024-06-01 15:24:13] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 0 ms to minimize.
[2024-06-01 15:24:13] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 2/41 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/71 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 7 (OVERLAPS) 60/131 variables, 71/112 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/131 variables, 2/114 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/131 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 10 (OVERLAPS) 0/131 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 55 unsolved
No progress, stopping.
After SMT solving in domain Real declared 131/131 variables, and 114 constraints, problems are : Problem set: 0 solved, 55 unsolved in 1176 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, State Equation: 71/71 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 55/55 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 55 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 9/37 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 3 (OVERLAPS) 3/71 variables, 3/40 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 6 (OVERLAPS) 60/131 variables, 71/112 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/131 variables, 2/114 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/131 variables, 55/169 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/131 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 10 (OVERLAPS) 0/131 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 55 unsolved
No progress, stopping.
After SMT solving in domain Int declared 131/131 variables, and 169 constraints, problems are : Problem set: 0 solved, 55 unsolved in 759 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, State Equation: 71/71 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 55/55 constraints, Known Traps: 10/10 constraints]
After SMT, in 1943ms problems are : Problem set: 0 solved, 55 unsolved
Search for dead transitions found 0 dead transitions in 1944ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2067 ms. Remains : 71/71 places, 60/60 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 13 times.
Drop transitions (Partial Free agglomeration) removed 13 transitions
Iterating global reduction 0 with 13 rules applied. Total rules applied 13 place count 71 transition count 60
Applied a total of 13 rules in 6 ms. Remains 71 /71 variables (removed 0) and now considering 60/60 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 60 rows 71 cols
[2024-06-01 15:24:14] [INFO ] Computed 31 invariants in 0 ms
[2024-06-01 15:24:14] [INFO ] After 24ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 15:24:14] [INFO ] [Nat]Absence check using 31 positive place invariants in 4 ms returned sat
[2024-06-01 15:24:14] [INFO ] After 18ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-01 15:24:14] [INFO ] State equation strengthened by 11 read => feed constraints.
[2024-06-01 15:24:14] [INFO ] After 4ms SMT Verify possible using 11 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 15:24:14] [INFO ] After 10ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 15:24:14] [INFO ] After 62ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 103 ms.
[2024-06-01 15:24:14] [INFO ] Flatten gal took : 11 ms
[2024-06-01 15:24:14] [INFO ] Flatten gal took : 10 ms
[2024-06-01 15:24:14] [INFO ] Input system was already deterministic with 202 transitions.
Computed a total of 58 stabilizing places and 58 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 223/223 places, 202/202 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 206 transition count 185
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 206 transition count 185
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 205 transition count 184
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 205 transition count 184
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 204 transition count 183
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 204 transition count 183
Applied a total of 38 rules in 15 ms. Remains 204 /223 variables (removed 19) and now considering 183/202 (removed 19) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15 ms. Remains : 204/223 places, 183/202 transitions.
[2024-06-01 15:24:14] [INFO ] Flatten gal took : 8 ms
[2024-06-01 15:24:14] [INFO ] Flatten gal took : 8 ms
[2024-06-01 15:24:14] [INFO ] Input system was already deterministic with 183 transitions.
Starting structural reductions in LTL mode, iteration 0 : 223/223 places, 202/202 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 205 transition count 184
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 205 transition count 184
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 204 transition count 183
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 204 transition count 183
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 203 transition count 182
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 203 transition count 182
Applied a total of 40 rules in 14 ms. Remains 203 /223 variables (removed 20) and now considering 182/202 (removed 20) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14 ms. Remains : 203/223 places, 182/202 transitions.
[2024-06-01 15:24:14] [INFO ] Flatten gal took : 8 ms
[2024-06-01 15:24:14] [INFO ] Flatten gal took : 8 ms
[2024-06-01 15:24:14] [INFO ] Input system was already deterministic with 182 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 223/223 places, 202/202 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 54 place count 222 transition count 147
Reduce places removed 54 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 56 rules applied. Total rules applied 110 place count 168 transition count 145
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 111 place count 167 transition count 145
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 111 place count 167 transition count 130
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 141 place count 152 transition count 130
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 155 place count 138 transition count 116
Iterating global reduction 3 with 14 rules applied. Total rules applied 169 place count 138 transition count 116
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 169 place count 138 transition count 107
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 187 place count 129 transition count 107
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 3 with 78 rules applied. Total rules applied 265 place count 90 transition count 68
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 267 place count 88 transition count 66
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 268 place count 87 transition count 66
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 268 place count 87 transition count 64
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 272 place count 85 transition count 64
Applied a total of 272 rules in 21 ms. Remains 85 /223 variables (removed 138) and now considering 64/202 (removed 138) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 21 ms. Remains : 85/223 places, 64/202 transitions.
[2024-06-01 15:24:14] [INFO ] Flatten gal took : 3 ms
[2024-06-01 15:24:14] [INFO ] Flatten gal took : 4 ms
[2024-06-01 15:24:15] [INFO ] Input system was already deterministic with 64 transitions.
RANDOM walk for 405 steps (0 resets) in 6 ms. (57 steps per ms) remains 0/1 properties
FORMULA ShieldPPPt-PT-003B-CTLFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 223/223 places, 202/202 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 207 transition count 186
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 207 transition count 186
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 206 transition count 185
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 206 transition count 185
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 205 transition count 184
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 205 transition count 184
Applied a total of 36 rules in 14 ms. Remains 205 /223 variables (removed 18) and now considering 184/202 (removed 18) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14 ms. Remains : 205/223 places, 184/202 transitions.
[2024-06-01 15:24:15] [INFO ] Flatten gal took : 7 ms
[2024-06-01 15:24:15] [INFO ] Flatten gal took : 6 ms
[2024-06-01 15:24:15] [INFO ] Input system was already deterministic with 184 transitions.
Starting structural reductions in LTL mode, iteration 0 : 223/223 places, 202/202 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 206 transition count 185
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 206 transition count 185
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 205 transition count 184
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 205 transition count 184
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 204 transition count 183
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 204 transition count 183
Applied a total of 38 rules in 13 ms. Remains 204 /223 variables (removed 19) and now considering 183/202 (removed 19) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13 ms. Remains : 204/223 places, 183/202 transitions.
[2024-06-01 15:24:15] [INFO ] Flatten gal took : 6 ms
[2024-06-01 15:24:15] [INFO ] Flatten gal took : 7 ms
[2024-06-01 15:24:15] [INFO ] Input system was already deterministic with 183 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 223/223 places, 202/202 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 45 place count 222 transition count 156
Reduce places removed 45 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 47 rules applied. Total rules applied 92 place count 177 transition count 154
Reduce places removed 1 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 4 rules applied. Total rules applied 96 place count 176 transition count 151
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 99 place count 173 transition count 151
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 16 Pre rules applied. Total rules applied 99 place count 173 transition count 135
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 131 place count 157 transition count 135
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 142 place count 146 transition count 124
Iterating global reduction 4 with 11 rules applied. Total rules applied 153 place count 146 transition count 124
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 153 place count 146 transition count 118
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 165 place count 140 transition count 118
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 4 with 68 rules applied. Total rules applied 233 place count 106 transition count 84
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 235 place count 104 transition count 82
Applied a total of 235 rules in 21 ms. Remains 104 /223 variables (removed 119) and now considering 82/202 (removed 120) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 21 ms. Remains : 104/223 places, 82/202 transitions.
[2024-06-01 15:24:15] [INFO ] Flatten gal took : 4 ms
[2024-06-01 15:24:15] [INFO ] Flatten gal took : 4 ms
[2024-06-01 15:24:15] [INFO ] Input system was already deterministic with 82 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 223/223 places, 202/202 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 55 transitions
Trivial Post-agglo rules discarded 55 transitions
Performed 55 trivial Post agglomeration. Transition count delta: 55
Iterating post reduction 0 with 55 rules applied. Total rules applied 55 place count 222 transition count 146
Reduce places removed 55 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 57 rules applied. Total rules applied 112 place count 167 transition count 144
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 114 place count 166 transition count 143
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 115 place count 165 transition count 143
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 14 Pre rules applied. Total rules applied 115 place count 165 transition count 129
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 143 place count 151 transition count 129
Discarding 14 places :
Symmetric choice reduction at 4 with 14 rule applications. Total rules 157 place count 137 transition count 115
Iterating global reduction 4 with 14 rules applied. Total rules applied 171 place count 137 transition count 115
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 9 Pre rules applied. Total rules applied 171 place count 137 transition count 106
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 189 place count 128 transition count 106
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 4 with 80 rules applied. Total rules applied 269 place count 88 transition count 66
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 271 place count 86 transition count 64
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 272 place count 85 transition count 64
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 272 place count 85 transition count 62
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 276 place count 83 transition count 62
Applied a total of 276 rules in 21 ms. Remains 83 /223 variables (removed 140) and now considering 62/202 (removed 140) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 21 ms. Remains : 83/223 places, 62/202 transitions.
[2024-06-01 15:24:15] [INFO ] Flatten gal took : 2 ms
[2024-06-01 15:24:15] [INFO ] Flatten gal took : 3 ms
[2024-06-01 15:24:15] [INFO ] Input system was already deterministic with 62 transitions.
Starting structural reductions in LTL mode, iteration 0 : 223/223 places, 202/202 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 205 transition count 184
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 205 transition count 184
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 204 transition count 183
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 204 transition count 183
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 203 transition count 182
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 203 transition count 182
Applied a total of 40 rules in 14 ms. Remains 203 /223 variables (removed 20) and now considering 182/202 (removed 20) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14 ms. Remains : 203/223 places, 182/202 transitions.
[2024-06-01 15:24:15] [INFO ] Flatten gal took : 7 ms
[2024-06-01 15:24:15] [INFO ] Flatten gal took : 7 ms
[2024-06-01 15:24:15] [INFO ] Input system was already deterministic with 182 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 223/223 places, 202/202 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 50 place count 222 transition count 151
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 1 with 50 rules applied. Total rules applied 100 place count 172 transition count 151
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 100 place count 172 transition count 136
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 130 place count 157 transition count 136
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 143 place count 144 transition count 123
Iterating global reduction 2 with 13 rules applied. Total rules applied 156 place count 144 transition count 123
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 156 place count 144 transition count 114
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 174 place count 135 transition count 114
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 248 place count 98 transition count 77
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 250 place count 96 transition count 75
Applied a total of 250 rules in 18 ms. Remains 96 /223 variables (removed 127) and now considering 75/202 (removed 127) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 18 ms. Remains : 96/223 places, 75/202 transitions.
[2024-06-01 15:24:15] [INFO ] Flatten gal took : 3 ms
[2024-06-01 15:24:15] [INFO ] Flatten gal took : 4 ms
[2024-06-01 15:24:15] [INFO ] Input system was already deterministic with 75 transitions.
Starting structural reductions in LTL mode, iteration 0 : 223/223 places, 202/202 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 205 transition count 184
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 205 transition count 184
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 204 transition count 183
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 204 transition count 183
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 203 transition count 182
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 203 transition count 182
Applied a total of 40 rules in 12 ms. Remains 203 /223 variables (removed 20) and now considering 182/202 (removed 20) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 203/223 places, 182/202 transitions.
[2024-06-01 15:24:15] [INFO ] Flatten gal took : 6 ms
[2024-06-01 15:24:15] [INFO ] Flatten gal took : 7 ms
[2024-06-01 15:24:15] [INFO ] Input system was already deterministic with 182 transitions.
Starting structural reductions in LTL mode, iteration 0 : 223/223 places, 202/202 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 205 transition count 184
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 205 transition count 184
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 204 transition count 183
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 204 transition count 183
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 203 transition count 182
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 203 transition count 182
Applied a total of 40 rules in 10 ms. Remains 203 /223 variables (removed 20) and now considering 182/202 (removed 20) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 203/223 places, 182/202 transitions.
[2024-06-01 15:24:15] [INFO ] Flatten gal took : 7 ms
[2024-06-01 15:24:15] [INFO ] Flatten gal took : 7 ms
[2024-06-01 15:24:15] [INFO ] Input system was already deterministic with 182 transitions.
Starting structural reductions in LTL mode, iteration 0 : 223/223 places, 202/202 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 204 transition count 183
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 204 transition count 183
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 203 transition count 182
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 203 transition count 182
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 202 transition count 181
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 202 transition count 181
Applied a total of 42 rules in 12 ms. Remains 202 /223 variables (removed 21) and now considering 181/202 (removed 21) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 202/223 places, 181/202 transitions.
[2024-06-01 15:24:15] [INFO ] Flatten gal took : 5 ms
[2024-06-01 15:24:15] [INFO ] Flatten gal took : 6 ms
[2024-06-01 15:24:15] [INFO ] Input system was already deterministic with 181 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 223/223 places, 202/202 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 55 transitions
Trivial Post-agglo rules discarded 55 transitions
Performed 55 trivial Post agglomeration. Transition count delta: 55
Iterating post reduction 0 with 55 rules applied. Total rules applied 55 place count 222 transition count 146
Reduce places removed 55 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 57 rules applied. Total rules applied 112 place count 167 transition count 144
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 113 place count 166 transition count 144
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 113 place count 166 transition count 129
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 143 place count 151 transition count 129
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 157 place count 137 transition count 115
Iterating global reduction 3 with 14 rules applied. Total rules applied 171 place count 137 transition count 115
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 171 place count 137 transition count 106
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 189 place count 128 transition count 106
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 3 with 78 rules applied. Total rules applied 267 place count 89 transition count 67
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 268 place count 88 transition count 66
Applied a total of 268 rules in 16 ms. Remains 88 /223 variables (removed 135) and now considering 66/202 (removed 136) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 16 ms. Remains : 88/223 places, 66/202 transitions.
[2024-06-01 15:24:15] [INFO ] Flatten gal took : 3 ms
[2024-06-01 15:24:15] [INFO ] Flatten gal took : 3 ms
[2024-06-01 15:24:15] [INFO ] Input system was already deterministic with 66 transitions.
Starting structural reductions in LTL mode, iteration 0 : 223/223 places, 202/202 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 206 transition count 185
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 206 transition count 185
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 205 transition count 184
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 205 transition count 184
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 204 transition count 183
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 204 transition count 183
Applied a total of 38 rules in 11 ms. Remains 204 /223 variables (removed 19) and now considering 183/202 (removed 19) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 204/223 places, 183/202 transitions.
[2024-06-01 15:24:15] [INFO ] Flatten gal took : 6 ms
[2024-06-01 15:24:15] [INFO ] Flatten gal took : 6 ms
[2024-06-01 15:24:15] [INFO ] Input system was already deterministic with 183 transitions.
Starting structural reductions in LTL mode, iteration 0 : 223/223 places, 202/202 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 205 transition count 184
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 205 transition count 184
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 204 transition count 183
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 204 transition count 183
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 203 transition count 182
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 203 transition count 182
Applied a total of 40 rules in 10 ms. Remains 203 /223 variables (removed 20) and now considering 182/202 (removed 20) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 203/223 places, 182/202 transitions.
[2024-06-01 15:24:15] [INFO ] Flatten gal took : 5 ms
[2024-06-01 15:24:15] [INFO ] Flatten gal took : 6 ms
[2024-06-01 15:24:15] [INFO ] Input system was already deterministic with 182 transitions.
Starting structural reductions in LTL mode, iteration 0 : 223/223 places, 202/202 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 206 transition count 185
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 206 transition count 185
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 205 transition count 184
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 205 transition count 184
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 204 transition count 183
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 204 transition count 183
Applied a total of 38 rules in 10 ms. Remains 204 /223 variables (removed 19) and now considering 183/202 (removed 19) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 204/223 places, 183/202 transitions.
[2024-06-01 15:24:15] [INFO ] Flatten gal took : 5 ms
[2024-06-01 15:24:15] [INFO ] Flatten gal took : 6 ms
[2024-06-01 15:24:15] [INFO ] Input system was already deterministic with 183 transitions.
[2024-06-01 15:24:15] [INFO ] Flatten gal took : 7 ms
[2024-06-01 15:24:15] [INFO ] Flatten gal took : 7 ms
[2024-06-01 15:24:15] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2024-06-01 15:24:15] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 223 places, 202 transitions and 512 arcs took 2 ms.
Total runtime 51075 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : ShieldPPPt-PT-003B-CTLFireability-2024-00
Could not compute solution for formula : ShieldPPPt-PT-003B-CTLFireability-2024-01
Could not compute solution for formula : ShieldPPPt-PT-003B-CTLFireability-2024-03
Could not compute solution for formula : ShieldPPPt-PT-003B-CTLFireability-2024-04
Could not compute solution for formula : ShieldPPPt-PT-003B-CTLFireability-2024-05
Could not compute solution for formula : ShieldPPPt-PT-003B-CTLFireability-2024-06
Could not compute solution for formula : ShieldPPPt-PT-003B-CTLFireability-2024-07
Could not compute solution for formula : ShieldPPPt-PT-003B-CTLFireability-2024-08
Could not compute solution for formula : ShieldPPPt-PT-003B-CTLFireability-2024-09
Could not compute solution for formula : ShieldPPPt-PT-003B-CTLFireability-2024-10
Could not compute solution for formula : ShieldPPPt-PT-003B-CTLFireability-2024-11
Could not compute solution for formula : ShieldPPPt-PT-003B-CTLFireability-2023-12
Could not compute solution for formula : ShieldPPPt-PT-003B-CTLFireability-2023-13
Could not compute solution for formula : ShieldPPPt-PT-003B-CTLFireability-2023-14
Could not compute solution for formula : ShieldPPPt-PT-003B-CTLFireability-2023-15

BK_STOP 1717255455946

--------------------
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 CTLFireability -timeout 360 -rebuildPNML
mcc2024
ctl formula name ShieldPPPt-PT-003B-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/772/ctl_0_
ctl formula name ShieldPPPt-PT-003B-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/772/ctl_1_
ctl formula name ShieldPPPt-PT-003B-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/772/ctl_2_
ctl formula name ShieldPPPt-PT-003B-CTLFireability-2024-04
ctl formula formula --ctl=/tmp/772/ctl_3_
ctl formula name ShieldPPPt-PT-003B-CTLFireability-2024-05
ctl formula formula --ctl=/tmp/772/ctl_4_
ctl formula name ShieldPPPt-PT-003B-CTLFireability-2024-06
ctl formula formula --ctl=/tmp/772/ctl_5_
ctl formula name ShieldPPPt-PT-003B-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/772/ctl_6_
ctl formula name ShieldPPPt-PT-003B-CTLFireability-2024-08
ctl formula formula --ctl=/tmp/772/ctl_7_
ctl formula name ShieldPPPt-PT-003B-CTLFireability-2024-09
ctl formula formula --ctl=/tmp/772/ctl_8_
ctl formula name ShieldPPPt-PT-003B-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/772/ctl_9_
ctl formula name ShieldPPPt-PT-003B-CTLFireability-2024-11
ctl formula formula --ctl=/tmp/772/ctl_10_
ctl formula name ShieldPPPt-PT-003B-CTLFireability-2023-12
ctl formula formula --ctl=/tmp/772/ctl_11_
ctl formula name ShieldPPPt-PT-003B-CTLFireability-2023-13
ctl formula formula --ctl=/tmp/772/ctl_12_
ctl formula name ShieldPPPt-PT-003B-CTLFireability-2023-14
ctl formula formula --ctl=/tmp/772/ctl_13_
ctl formula name ShieldPPPt-PT-003B-CTLFireability-2023-15
ctl formula formula --ctl=/tmp/772/ctl_14_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

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="ShieldPPPt-PT-003B"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is ShieldPPPt-PT-003B, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r528-tall-171683761400570"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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