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.r356-tall-171683760700255.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 itstools
Input is ShieldIIPt-PT-005B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r356-tall-171683760700255
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 588K
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 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.6K Apr 23 07:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 07:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K May 19 19:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 20:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 139K Apr 12 20:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Apr 12 20:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Apr 12 20:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:52 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 83K 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 ShieldIIPt-PT-005B-ReachabilityFireability-2024-00
FORMULA_NAME ShieldIIPt-PT-005B-ReachabilityFireability-2024-01
FORMULA_NAME ShieldIIPt-PT-005B-ReachabilityFireability-2024-02
FORMULA_NAME ShieldIIPt-PT-005B-ReachabilityFireability-2024-03
FORMULA_NAME ShieldIIPt-PT-005B-ReachabilityFireability-2024-04
FORMULA_NAME ShieldIIPt-PT-005B-ReachabilityFireability-2024-05
FORMULA_NAME ShieldIIPt-PT-005B-ReachabilityFireability-2024-06
FORMULA_NAME ShieldIIPt-PT-005B-ReachabilityFireability-2024-07
FORMULA_NAME ShieldIIPt-PT-005B-ReachabilityFireability-2024-08
FORMULA_NAME ShieldIIPt-PT-005B-ReachabilityFireability-2024-09
FORMULA_NAME ShieldIIPt-PT-005B-ReachabilityFireability-2024-10
FORMULA_NAME ShieldIIPt-PT-005B-ReachabilityFireability-2024-11
FORMULA_NAME ShieldIIPt-PT-005B-ReachabilityFireability-2024-12
FORMULA_NAME ShieldIIPt-PT-005B-ReachabilityFireability-2024-13
FORMULA_NAME ShieldIIPt-PT-005B-ReachabilityFireability-2024-14
FORMULA_NAME ShieldIIPt-PT-005B-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716930260095

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-005B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202405141337
[2024-05-28 21:04:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-28 21:04:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 21:04:21] [INFO ] Load time of PNML (sax parser for PT used): 79 ms
[2024-05-28 21:04:21] [INFO ] Transformed 353 places.
[2024-05-28 21:04:21] [INFO ] Transformed 328 transitions.
[2024-05-28 21:04:21] [INFO ] Found NUPN structural information;
[2024-05-28 21:04:21] [INFO ] Parsed PT model containing 353 places and 328 transitions and 816 arcs in 178 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
[2024-05-28 21:04:21] [INFO ] Flatten gal took : 138 ms
[2024-05-28 21:04:22] [INFO ] Flatten gal took : 35 ms
[2024-05-28 21:04:22] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4064453790770027340.gal : 22 ms
RANDOM walk for 40000 steps (8 resets) in 1653 ms. (24 steps per ms) remains 6/16 properties
[2024-05-28 21:04:22] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1962473820219470089.prop : 6 ms
FORMULA ShieldIIPt-PT-005B-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-005B-ReachabilityFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-005B-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-005B-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-005B-ReachabilityFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4064453790770027340.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1962473820219470089.prop' '--nowitness' '--gen-order' 'FOLLOW'
FORMULA ShieldIIPt-PT-005B-ReachabilityFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-005B-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-005B-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-005B-ReachabilityFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-005B-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality1962473820219470089.prop.
BEST_FIRST walk for 40004 steps (8 resets) in 421 ms. (94 steps per ms) remains 6/6 properties
SDD proceeding with computation,16 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,16 properties remain. new max is 8
SDD size :5 after 7
SDD proceeding with computation,16 properties remain. new max is 16
SDD size :7 after 14
SDD proceeding with computation,16 properties remain. new max is 32
SDD size :14 after 77
SDD proceeding with computation,16 properties remain. new max is 64
SDD size :77 after 1672
SDD proceeding with computation,16 properties remain. new max is 128
SDD size :1672 after 1.38945e+06
SDD proceeding with computation,16 properties remain. new max is 256
SDD size :1.38945e+06 after 2.19908e+10
Reachability property ShieldIIPt-PT-005B-ReachabilityFireability-2024-15 is true.
FORMULA ShieldIIPt-PT-005B-ReachabilityFireability-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Invariant property ShieldIIPt-PT-005B-ReachabilityFireability-2024-07 does not hold.
SDD proceeding with computation,14 properties remain. new max is 256
BEST_FIRST walk for 40003 steps (8 resets) in 666 ms. (59 steps per ms) remains 6/6 properties
SDD size :6.79223e+14 after 1.1441e+15
BEST_FIRST walk for 40004 steps (8 resets) in 407 ms. (98 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 137 ms. (289 steps per ms) remains 5/6 properties
FORMULA ShieldIIPt-PT-005B-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 76 ms. (519 steps per ms) remains 4/5 properties
// Phase 1: matrix 328 rows 353 cols
[2024-05-28 21:04:22] [INFO ] Computed 46 invariants in 12 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 67/67 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem ShieldIIPt-PT-005B-ReachabilityFireability-2024-00 is UNSAT
FORMULA ShieldIIPt-PT-005B-ReachabilityFireability-2024-00 FALSE TECHNIQUES SMT_REFINEMENT
Problem ShieldIIPt-PT-005B-ReachabilityFireability-2024-14 is UNSAT
FORMULA ShieldIIPt-PT-005B-ReachabilityFireability-2024-14 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 280/347 variables, 44/111 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/347 variables, 280/391 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/347 variables, 0/391 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 6/353 variables, 2/393 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/353 variables, 6/399 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/353 variables, 0/399 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 328/681 variables, 353/752 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/681 variables, 0/752 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/681 variables, 0/752 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 681/681 variables, and 752 constraints, problems are : Problem set: 2 solved, 2 unsolved in 629 ms.
Refiners :[Domain max(s): 353/353 constraints, Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 353/353 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 43/43 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/43 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 269/312 variables, 39/82 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/312 variables, 269/351 constraints. Problems are: Problem set: 2 solved, 2 unsolved
[2024-05-28 21:04:23] [INFO ] Deduced a trap composed of 30 places in 158 ms of which 61 ms to minimize.
[2024-05-28 21:04:23] [INFO ] Deduced a trap composed of 14 places in 77 ms of which 2 ms to minimize.
[2024-05-28 21:04:24] [INFO ] Deduced a trap composed of 21 places in 73 ms of which 1 ms to minimize.
[2024-05-28 21:04:24] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 1 ms to minimize.
[2024-05-28 21:04:24] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 2 ms to minimize.
[2024-05-28 21:04:24] [INFO ] Deduced a trap composed of 36 places in 69 ms of which 2 ms to minimize.
[2024-05-28 21:04:24] [INFO ] Deduced a trap composed of 28 places in 62 ms of which 1 ms to minimize.
[2024-05-28 21:04:24] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 1 ms to minimize.
[2024-05-28 21:04:24] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 1 ms to minimize.
[2024-05-28 21:04:24] [INFO ] Deduced a trap composed of 22 places in 90 ms of which 1 ms to minimize.
[2024-05-28 21:04:24] [INFO ] Deduced a trap composed of 35 places in 65 ms of which 2 ms to minimize.
[2024-05-28 21:04:24] [INFO ] Deduced a trap composed of 29 places in 72 ms of which 1 ms to minimize.
[2024-05-28 21:04:24] [INFO ] Deduced a trap composed of 34 places in 62 ms of which 2 ms to minimize.
[2024-05-28 21:04:24] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
[2024-05-28 21:04:24] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
[2024-05-28 21:04:24] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 1 ms to minimize.
[2024-05-28 21:04:25] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 17/368 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 0/368 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 41/353 variables, 7/375 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/353 variables, 41/416 constraints. Problems are: Problem set: 2 solved, 2 unsolved
[2024-05-28 21:04:25] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 1 ms to minimize.
[2024-05-28 21:04:25] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-05-28 21:04:25] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/353 variables, 3/419 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/353 variables, 0/419 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 328/681 variables, 353/772 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/681 variables, 2/774 constraints. Problems are: Problem set: 2 solved, 2 unsolved
[2024-05-28 21:04:25] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
[2024-05-28 21:04:25] [INFO ] Deduced a trap composed of 29 places in 63 ms of which 3 ms to minimize.
[2024-05-28 21:04:25] [INFO ] Deduced a trap composed of 28 places in 54 ms of which 2 ms to minimize.
[2024-05-28 21:04:25] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2024-05-28 21:04:25] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 1 ms to minimize.
[2024-05-28 21:04:25] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 1 ms to minimize.
[2024-05-28 21:04:26] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2024-05-28 21:04:26] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
[2024-05-28 21:04:26] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-05-28 21:04:26] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2024-05-28 21:04:26] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
[2024-05-28 21:04:26] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-05-28 21:04:26] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
[2024-05-28 21:04:26] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 4 ms to minimize.
[2024-05-28 21:04:26] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-05-28 21:04:26] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/681 variables, 16/790 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/681 variables, 0/790 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/681 variables, 0/790 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 681/681 variables, and 790 constraints, problems are : Problem set: 2 solved, 2 unsolved in 3385 ms.
Refiners :[Domain max(s): 353/353 constraints, Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 353/353 constraints, PredecessorRefiner: 2/4 constraints, Known Traps: 36/36 constraints]
After SMT, in 4120ms problems are : Problem set: 2 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 377 ms.
Support contains 43 out of 353 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 353/353 places, 328/328 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 52 rules applied. Total rules applied 52 place count 353 transition count 276
Reduce places removed 52 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 54 rules applied. Total rules applied 106 place count 301 transition count 274
Reduce places removed 1 places and 0 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Iterating post reduction 2 with 17 rules applied. Total rules applied 123 place count 300 transition count 258
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 3 with 16 rules applied. Total rules applied 139 place count 284 transition count 258
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 20 Pre rules applied. Total rules applied 139 place count 284 transition count 238
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 4 with 40 rules applied. Total rules applied 179 place count 264 transition count 238
Discarding 28 places :
Symmetric choice reduction at 4 with 28 rule applications. Total rules 207 place count 236 transition count 210
Iterating global reduction 4 with 28 rules applied. Total rules applied 235 place count 236 transition count 210
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 235 place count 236 transition count 202
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 251 place count 228 transition count 202
Performed 63 Post agglomeration using F-continuation condition.Transition count delta: 63
Deduced a syphon composed of 63 places in 0 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 4 with 126 rules applied. Total rules applied 377 place count 165 transition count 139
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 387 place count 160 transition count 141
Free-agglomeration rule applied 4 times.
Iterating global reduction 4 with 4 rules applied. Total rules applied 391 place count 160 transition count 137
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 395 place count 156 transition count 137
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 398 place count 156 transition count 137
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 399 place count 156 transition count 137
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 400 place count 155 transition count 136
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 401 place count 154 transition count 136
Applied a total of 401 rules in 119 ms. Remains 154 /353 variables (removed 199) and now considering 136/328 (removed 192) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 141 ms. Remains : 154/353 places, 136/328 transitions.
RANDOM walk for 40000 steps (8 resets) in 462 ms. (86 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 163 ms. (243 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 98 ms. (404 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 586210 steps, run timeout after 3001 ms. (steps per millisecond=195 ) properties seen :0 out of 2
Probabilistic random walk after 586210 steps, saw 308693 distinct states, run finished after 3004 ms. (steps per millisecond=195 ) properties seen :0
// Phase 1: matrix 136 rows 154 cols
[2024-05-28 21:04:30] [INFO ] Computed 45 invariants in 2 ms
[2024-05-28 21:04:30] [INFO ] State equation strengthened by 11 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 98/141 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/141 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/145 variables, 2/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/145 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 136/281 variables, 145/186 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/281 variables, 11/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/281 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 9/290 variables, 9/206 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/290 variables, 4/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/290 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 290/290 variables, and 210 constraints, problems are : Problem set: 0 solved, 2 unsolved in 156 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 154/154 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 98/141 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 21:04:31] [INFO ] Deduced a trap composed of 8 places in 55 ms of which 0 ms to minimize.
[2024-05-28 21:04:31] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 0 ms to minimize.
[2024-05-28 21:04:31] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-05-28 21:04:31] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 1 ms to minimize.
[2024-05-28 21:04:31] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/141 variables, 5/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 4/145 variables, 2/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 21:04:31] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/145 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 21:04:31] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 136/281 variables, 145/193 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/281 variables, 11/204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/281 variables, 1/205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 21:04:31] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 0 ms to minimize.
[2024-05-28 21:04:31] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 0 ms to minimize.
[2024-05-28 21:04:31] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 1 ms to minimize.
[2024-05-28 21:04:31] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/281 variables, 4/209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/281 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 9/290 variables, 9/218 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/290 variables, 4/222 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/290 variables, 1/223 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/290 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 21:04:31] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
At refinement iteration 17 (OVERLAPS) 0/290 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/290 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/290 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 290/290 variables, and 224 constraints, problems are : Problem set: 0 solved, 2 unsolved in 978 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 154/154 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 12/12 constraints]
After SMT, in 1146ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 147 ms.
Support contains 43 out of 154 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 154/154 places, 136/136 transitions.
Applied a total of 0 rules in 5 ms. Remains 154 /154 variables (removed 0) and now considering 136/136 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 154/154 places, 136/136 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 154/154 places, 136/136 transitions.
Applied a total of 0 rules in 4 ms. Remains 154 /154 variables (removed 0) and now considering 136/136 (removed 0) transitions.
[2024-05-28 21:04:32] [INFO ] Invariant cache hit.
[2024-05-28 21:04:32] [INFO ] Implicit Places using invariants in 110 ms returned []
[2024-05-28 21:04:32] [INFO ] Invariant cache hit.
[2024-05-28 21:04:32] [INFO ] State equation strengthened by 11 read => feed constraints.
[2024-05-28 21:04:32] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 230 ms to find 0 implicit places.
[2024-05-28 21:04:32] [INFO ] Redundant transitions in 2 ms returned []
Running 134 sub problems to find dead transitions.
[2024-05-28 21:04:32] [INFO ] Invariant cache hit.
[2024-05-28 21:04:32] [INFO ] State equation strengthened by 11 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/152 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 2 (OVERLAPS) 2/154 variables, 38/45 constraints. Problems are: Problem set: 0 solved, 134 unsolved
[2024-05-28 21:04:33] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-05-28 21:04:33] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 0 ms to minimize.
[2024-05-28 21:04:33] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-28 21:04:33] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 1 ms to minimize.
[2024-05-28 21:04:33] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2024-05-28 21:04:33] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 1 ms to minimize.
[2024-05-28 21:04:33] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 1 ms to minimize.
[2024-05-28 21:04:33] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 1 ms to minimize.
[2024-05-28 21:04:33] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 1 ms to minimize.
[2024-05-28 21:04:33] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
[2024-05-28 21:04:33] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
[2024-05-28 21:04:33] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 1 ms to minimize.
[2024-05-28 21:04:33] [INFO ] Deduced a trap composed of 14 places in 20 ms of which 0 ms to minimize.
[2024-05-28 21:04:33] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2024-05-28 21:04:33] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 1 ms to minimize.
[2024-05-28 21:04:33] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 2 ms to minimize.
[2024-05-28 21:04:33] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 1 ms to minimize.
[2024-05-28 21:04:33] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 1 ms to minimize.
[2024-05-28 21:04:33] [INFO ] Deduced a trap composed of 11 places in 19 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 19/64 constraints. Problems are: Problem set: 0 solved, 134 unsolved
[2024-05-28 21:04:34] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-05-28 21:04:34] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/154 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 6 (OVERLAPS) 136/290 variables, 154/220 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/290 variables, 11/231 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/290 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 9 (OVERLAPS) 0/290 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 134 unsolved
No progress, stopping.
After SMT solving in domain Real declared 290/290 variables, and 231 constraints, problems are : Problem set: 0 solved, 134 unsolved in 6308 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 154/154 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 134/134 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 134 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/152 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 3 (OVERLAPS) 2/154 variables, 38/48 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 18/66 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/154 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 6 (OVERLAPS) 136/290 variables, 154/220 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/290 variables, 11/231 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/290 variables, 134/365 constraints. Problems are: Problem set: 0 solved, 134 unsolved
[2024-05-28 21:04:40] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 0 ms to minimize.
[2024-05-28 21:04:40] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
[2024-05-28 21:04:40] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 1 ms to minimize.
[2024-05-28 21:04:41] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2024-05-28 21:04:41] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/290 variables, 5/370 constraints. Problems are: Problem set: 0 solved, 134 unsolved
[2024-05-28 21:04:42] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 1 ms to minimize.
[2024-05-28 21:04:42] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
[2024-05-28 21:04:42] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 2 ms to minimize.
[2024-05-28 21:04:42] [INFO ] Deduced a trap composed of 6 places in 44 ms of which 1 ms to minimize.
[2024-05-28 21:04:42] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 5/375 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/290 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 12 (OVERLAPS) 0/290 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 134 unsolved
No progress, stopping.
After SMT solving in domain Int declared 290/290 variables, and 375 constraints, problems are : Problem set: 0 solved, 134 unsolved in 8089 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 154/154 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 134/134 constraints, Known Traps: 31/31 constraints]
After SMT, in 14444ms problems are : Problem set: 0 solved, 134 unsolved
Search for dead transitions found 0 dead transitions in 14446ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14694 ms. Remains : 154/154 places, 136/136 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 154 transition count 136
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 154 transition count 135
Applied a total of 5 rules in 12 ms. Remains 154 /154 variables (removed 0) and now considering 135/136 (removed 1) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 135 rows 154 cols
[2024-05-28 21:04:46] [INFO ] Computed 45 invariants in 13 ms
[2024-05-28 21:04:46] [INFO ] After 83ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-28 21:04:46] [INFO ] [Nat]Absence check using 45 positive place invariants in 17 ms returned sat
[2024-05-28 21:04:47] [INFO ] After 94ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-28 21:04:47] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-28 21:04:47] [INFO ] After 47ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-28 21:04:47] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-05-28 21:04:47] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 1 ms to minimize.
[2024-05-28 21:04:47] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
[2024-05-28 21:04:47] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 1 ms to minimize.
[2024-05-28 21:04:47] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 0 ms to minimize.
[2024-05-28 21:04:47] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 1 ms to minimize.
[2024-05-28 21:04:47] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 248 ms
[2024-05-28 21:04:47] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 1 ms to minimize.
[2024-05-28 21:04:47] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2024-05-28 21:04:47] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2024-05-28 21:04:47] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 0 ms to minimize.
[2024-05-28 21:04:47] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-05-28 21:04:47] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 1 ms to minimize.
[2024-05-28 21:04:47] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-05-28 21:04:47] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 309 ms
TRAPS : Iteration 1
[2024-05-28 21:04:47] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-05-28 21:04:47] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 0 ms to minimize.
[2024-05-28 21:04:47] [INFO ] Deduced a trap composed of 13 places in 21 ms of which 1 ms to minimize.
[2024-05-28 21:04:47] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 0 ms to minimize.
[2024-05-28 21:04:47] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 149 ms
[2024-05-28 21:04:48] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
[2024-05-28 21:04:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 49 ms
TRAPS : Iteration 2
[2024-05-28 21:04:48] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
[2024-05-28 21:04:48] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
[2024-05-28 21:04:48] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 0 ms to minimize.
[2024-05-28 21:04:48] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 121 ms
TRAPS : Iteration 3
[2024-05-28 21:04:48] [INFO ] After 1232ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-28 21:04:48] [INFO ] After 1511ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2024-05-28 21:04:48] [INFO ] Flatten gal took : 10 ms
[2024-05-28 21:04:48] [INFO ] Flatten gal took : 10 ms
[2024-05-28 21:04:48] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13002355849702785773.gal : 3 ms
[2024-05-28 21:04:48] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17354241545220047400.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13002355849702785773.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17354241545220047400.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality17354241545220047400.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :5 after 6
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :6 after 18
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :18 after 54
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :54 after 4111
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :16442 after 85849
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :85849 after 87991
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :87991 after 141729
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :141729 after 2.21032e+06
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :2.21032e+06 after 3.98991e+07
Detected timeout of ITS tools.
[2024-05-28 21:05:03] [INFO ] Flatten gal took : 10 ms
[2024-05-28 21:05:03] [INFO ] Applying decomposition
[2024-05-28 21:05:03] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph14131152059256150925.txt' '-o' '/tmp/graph14131152059256150925.bin' '-w' '/tmp/graph14131152059256150925.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14131152059256150925.bin' '-l' '-1' '-v' '-w' '/tmp/graph14131152059256150925.weights' '-q' '0' '-e' '0.001'
[2024-05-28 21:05:03] [INFO ] Decomposing Gal with order
[2024-05-28 21:05:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 21:05:03] [INFO ] Removed a total of 40 redundant transitions.
[2024-05-28 21:05:03] [INFO ] Flatten gal took : 42 ms
[2024-05-28 21:05:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 9 ms.
[2024-05-28 21:05:03] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6291052008815115479.gal : 5 ms
[2024-05-28 21:05:03] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9717941032082714183.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6291052008815115479.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9717941032082714183.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality9717941032082714183.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :1 after 9
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :9 after 1589
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :1589 after 32884
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :32884 after 1.77055e+07
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :1.77055e+07 after 6.04395e+16
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,1.36016e+19,10.7297,238068,596,106,352743,1835,553,1.42692e+06,105,16737,0
Total reachable state count : 13601591649375729902

Verifying 2 reachability properties.
Invariant property ShieldIIPt-PT-005B-ReachabilityFireability-2024-02 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ShieldIIPt-PT-005B-ReachabilityFireability-2024-02,6.72284e+16,10.7469,238068,379,83,352743,1835,583,1.42692e+06,114,16737,1351
Reachability property ShieldIIPt-PT-005B-ReachabilityFireability-2024-11 does not hold.
No reachable states exhibit your property : ShieldIIPt-PT-005B-ReachabilityFireability-2024-11

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ShieldIIPt-PT-005B-ReachabilityFireability-2024-11,0,10.7502,238068,1,0,352743,1835,628,1.42692e+06,116,16737,2306
FORMULA ShieldIIPt-PT-005B-ReachabilityFireability-2024-11 FALSE TECHNIQUES OVER_APPROXIMATION
Over-approximation ignoring read arcs solved -1 properties in 27763 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-28 21:05:14] [INFO ] Flatten gal took : 14 ms
[2024-05-28 21:05:14] [INFO ] Applying decomposition
[2024-05-28 21:05:14] [INFO ] Flatten gal took : 18 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph4451069487522392713.txt' '-o' '/tmp/graph4451069487522392713.bin' '-w' '/tmp/graph4451069487522392713.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4451069487522392713.bin' '-l' '-1' '-v' '-w' '/tmp/graph4451069487522392713.weights' '-q' '0' '-e' '0.001'
[2024-05-28 21:05:14] [INFO ] Decomposing Gal with order
[2024-05-28 21:05:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 21:05:14] [INFO ] Removed a total of 30 redundant transitions.
[2024-05-28 21:05:14] [INFO ] Flatten gal took : 24 ms
[2024-05-28 21:05:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-28 21:05:14] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12661723881051968991.gal : 7 ms
[2024-05-28 21:05:14] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5470418754925823160.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12661723881051968991.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5470418754925823160.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality5470418754925823160.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :9 after 1272
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1272 after 15096
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :1.2389e+14 after 1.06793e+15
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,3.77124e+30,26.721,370412,2765,35,490236,333,743,1.79578e+06,55,1093,0
Total reachable state count : 3771238132840753733787168276480

Verifying 1 reachability properties.
Invariant property ShieldIIPt-PT-005B-ReachabilityFireability-2024-02 does not hold.
FORMULA ShieldIIPt-PT-005B-ReachabilityFireability-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ShieldIIPt-PT-005B-ReachabilityFireability-2024-02,1.33642e+27,26.867,370412,2061,36,490236,333,771,1.79578e+06,61,1093,8456
All properties solved without resorting to model-checking.
Total runtime 80323 ms.

BK_STOP 1716930341644

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//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//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="ShieldIIPt-PT-005B"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="itstools"
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 itstools"
echo " Input is ShieldIIPt-PT-005B, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r356-tall-171683760700255"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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