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-171683761100462.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 ShieldPPPs-PT-020B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r356-tall-171683761100462
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 844K
-rw-r--r-- 1 mcc users 7.8K 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 6.0K 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.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 16:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 13 11:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 110K Apr 13 11:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 13 11:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 102K Apr 13 11:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:53 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 349K 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 ShieldPPPs-PT-020B-ReachabilityCardinality-2024-00
FORMULA_NAME ShieldPPPs-PT-020B-ReachabilityCardinality-2024-01
FORMULA_NAME ShieldPPPs-PT-020B-ReachabilityCardinality-2024-02
FORMULA_NAME ShieldPPPs-PT-020B-ReachabilityCardinality-2024-03
FORMULA_NAME ShieldPPPs-PT-020B-ReachabilityCardinality-2024-04
FORMULA_NAME ShieldPPPs-PT-020B-ReachabilityCardinality-2024-05
FORMULA_NAME ShieldPPPs-PT-020B-ReachabilityCardinality-2024-06
FORMULA_NAME ShieldPPPs-PT-020B-ReachabilityCardinality-2024-07
FORMULA_NAME ShieldPPPs-PT-020B-ReachabilityCardinality-2024-08
FORMULA_NAME ShieldPPPs-PT-020B-ReachabilityCardinality-2024-09
FORMULA_NAME ShieldPPPs-PT-020B-ReachabilityCardinality-2024-10
FORMULA_NAME ShieldPPPs-PT-020B-ReachabilityCardinality-2024-11
FORMULA_NAME ShieldPPPs-PT-020B-ReachabilityCardinality-2024-12
FORMULA_NAME ShieldPPPs-PT-020B-ReachabilityCardinality-2024-13
FORMULA_NAME ShieldPPPs-PT-020B-ReachabilityCardinality-2024-14
FORMULA_NAME ShieldPPPs-PT-020B-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716975434244

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPs-PT-020B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202405141337
[2024-05-29 09:37:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-29 09:37:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 09:37:15] [INFO ] Load time of PNML (sax parser for PT used): 145 ms
[2024-05-29 09:37:15] [INFO ] Transformed 1363 places.
[2024-05-29 09:37:15] [INFO ] Transformed 1263 transitions.
[2024-05-29 09:37:15] [INFO ] Found NUPN structural information;
[2024-05-29 09:37:15] [INFO ] Parsed PT model containing 1363 places and 1263 transitions and 3486 arcs in 289 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 16 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldPPPs-PT-020B-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (12 resets) in 2671 ms. (14 steps per ms) remains 4/15 properties
FORMULA ShieldPPPs-PT-020B-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-020B-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-020B-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-020B-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-020B-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-020B-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-020B-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-020B-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-020B-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-020B-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-020B-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-29 09:37:16] [INFO ] Flatten gal took : 309 ms
BEST_FIRST walk for 40004 steps (8 resets) in 330 ms. (120 steps per ms) remains 4/4 properties
[2024-05-29 09:37:16] [INFO ] Flatten gal took : 158 ms
BEST_FIRST walk for 40004 steps (8 resets) in 375 ms. (106 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 194 ms. (205 steps per ms) remains 4/4 properties
[2024-05-29 09:37:16] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13740638122065736280.gal : 99 ms
[2024-05-29 09:37:16] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9541647701924670579.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/ReachabilityCardinality13740638122065736280.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9541647701924670579.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

BEST_FIRST walk for 40004 steps (8 resets) in 860 ms. (46 steps per ms) remains 4/4 properties
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
// Phase 1: matrix 1263 rows 1363 cols
Loading property file /tmp/ReachabilityCardinality9541647701924670579.prop.
[2024-05-29 09:37:17] [INFO ] Computed 221 invariants in 38 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 83/83 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 1232/1315 variables, 213/296 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1315 variables, 1232/1528 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1315 variables, 0/1528 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 48/1363 variables, 8/1536 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1363 variables, 48/1584 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :36 after 370
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :370 after 438
At refinement iteration 7 (INCLUDED_ONLY) 0/1363 variables, 0/1584 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :438 after 586
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :586 after 1.09114e+08
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :1.09114e+08 after 2.32761e+14
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :2.32761e+14 after 1.24355e+32
At refinement iteration 8 (OVERLAPS) 1263/2626 variables, 1363/2947 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2626 variables, 0/2947 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/2626 variables, 0/2947 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2626/2626 variables, and 2947 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1507 ms.
Refiners :[Domain max(s): 1363/1363 constraints, Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 1363/1363 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 83/83 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 1232/1315 variables, 213/296 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1315 variables, 1232/1528 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-29 09:37:19] [INFO ] Deduced a trap composed of 25 places in 368 ms of which 58 ms to minimize.
[2024-05-29 09:37:19] [INFO ] Deduced a trap composed of 23 places in 299 ms of which 11 ms to minimize.
[2024-05-29 09:37:20] [INFO ] Deduced a trap composed of 25 places in 293 ms of which 5 ms to minimize.
[2024-05-29 09:37:20] [INFO ] Deduced a trap composed of 29 places in 242 ms of which 5 ms to minimize.
[2024-05-29 09:37:20] [INFO ] Deduced a trap composed of 32 places in 240 ms of which 5 ms to minimize.
[2024-05-29 09:37:20] [INFO ] Deduced a trap composed of 22 places in 238 ms of which 5 ms to minimize.
[2024-05-29 09:37:21] [INFO ] Deduced a trap composed of 25 places in 270 ms of which 4 ms to minimize.
[2024-05-29 09:37:21] [INFO ] Deduced a trap composed of 18 places in 235 ms of which 4 ms to minimize.
[2024-05-29 09:37:21] [INFO ] Deduced a trap composed of 27 places in 231 ms of which 4 ms to minimize.
[2024-05-29 09:37:21] [INFO ] Deduced a trap composed of 25 places in 231 ms of which 4 ms to minimize.
[2024-05-29 09:37:22] [INFO ] Deduced a trap composed of 24 places in 215 ms of which 4 ms to minimize.
[2024-05-29 09:37:22] [INFO ] Deduced a trap composed of 24 places in 219 ms of which 4 ms to minimize.
[2024-05-29 09:37:22] [INFO ] Deduced a trap composed of 20 places in 220 ms of which 4 ms to minimize.
[2024-05-29 09:37:22] [INFO ] Deduced a trap composed of 24 places in 217 ms of which 6 ms to minimize.
[2024-05-29 09:37:23] [INFO ] Deduced a trap composed of 43 places in 199 ms of which 4 ms to minimize.
[2024-05-29 09:37:23] [INFO ] Deduced a trap composed of 20 places in 206 ms of which 4 ms to minimize.
[2024-05-29 09:37:23] [INFO ] Deduced a trap composed of 32 places in 189 ms of which 5 ms to minimize.
[2024-05-29 09:37:23] [INFO ] Deduced a trap composed of 34 places in 162 ms of which 3 ms to minimize.
SMT process timed out in 6727ms, After SMT, problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 83 out of 1363 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1363/1363 places, 1263/1263 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 113 transitions
Trivial Post-agglo rules discarded 113 transitions
Performed 113 trivial Post agglomeration. Transition count delta: 113
Iterating post reduction 0 with 113 rules applied. Total rules applied 113 place count 1363 transition count 1150
Reduce places removed 113 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 1 with 123 rules applied. Total rules applied 236 place count 1250 transition count 1140
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 246 place count 1240 transition count 1140
Performed 97 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 97 Pre rules applied. Total rules applied 246 place count 1240 transition count 1043
Deduced a syphon composed of 97 places in 4 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 3 with 194 rules applied. Total rules applied 440 place count 1143 transition count 1043
Discarding 125 places :
Symmetric choice reduction at 3 with 125 rule applications. Total rules 565 place count 1018 transition count 918
Iterating global reduction 3 with 125 rules applied. Total rules applied 690 place count 1018 transition count 918
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 41 Pre rules applied. Total rules applied 690 place count 1018 transition count 877
Deduced a syphon composed of 41 places in 3 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 3 with 82 rules applied. Total rules applied 772 place count 977 transition count 877
Performed 263 Post agglomeration using F-continuation condition.Transition count delta: 263
Deduced a syphon composed of 263 places in 2 ms
Reduce places removed 263 places and 0 transitions.
Iterating global reduction 3 with 526 rules applied. Total rules applied 1298 place count 714 transition count 614
Partial Free-agglomeration rule applied 142 times.
Drop transitions (Partial Free agglomeration) removed 142 transitions
Iterating global reduction 3 with 142 rules applied. Total rules applied 1440 place count 714 transition count 614
Applied a total of 1440 rules in 413 ms. Remains 714 /1363 variables (removed 649) and now considering 614/1263 (removed 649) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 422 ms. Remains : 714/1363 places, 614/1263 transitions.
RANDOM walk for 40000 steps (14 resets) in 1783 ms. (22 steps per ms) remains 3/4 properties
FORMULA ShieldPPPs-PT-020B-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 207 ms. (192 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 176 ms. (226 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 175 ms. (227 steps per ms) remains 3/3 properties
// Phase 1: matrix 614 rows 714 cols
[2024-05-29 09:37:24] [INFO ] Computed 221 invariants in 11 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 616/678 variables, 206/206 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/678 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 20/698 variables, 7/213 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/698 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 16/714 variables, 8/221 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/714 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 614/1328 variables, 714/935 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1328 variables, 0/935 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/1328 variables, 0/935 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1328/1328 variables, and 935 constraints, problems are : Problem set: 0 solved, 3 unsolved in 546 ms.
Refiners :[Positive P Invariants (semi-flows): 213/213 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 714/714 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 616/678 variables, 206/206 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-29 09:37:25] [INFO ] Deduced a trap composed of 6 places in 52 ms of which 1 ms to minimize.
[2024-05-29 09:37:25] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 1 ms to minimize.
[2024-05-29 09:37:25] [INFO ] Deduced a trap composed of 8 places in 65 ms of which 1 ms to minimize.
[2024-05-29 09:37:25] [INFO ] Deduced a trap composed of 8 places in 69 ms of which 2 ms to minimize.
[2024-05-29 09:37:25] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 1 ms to minimize.
[2024-05-29 09:37:26] [INFO ] Deduced a trap composed of 10 places in 83 ms of which 2 ms to minimize.
[2024-05-29 09:37:26] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 1 ms to minimize.
[2024-05-29 09:37:26] [INFO ] Deduced a trap composed of 8 places in 65 ms of which 1 ms to minimize.
[2024-05-29 09:37:26] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 1 ms to minimize.
[2024-05-29 09:37:26] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 1 ms to minimize.
[2024-05-29 09:37:26] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 2 ms to minimize.
[2024-05-29 09:37:26] [INFO ] Deduced a trap composed of 8 places in 62 ms of which 2 ms to minimize.
[2024-05-29 09:37:26] [INFO ] Deduced a trap composed of 10 places in 63 ms of which 2 ms to minimize.
[2024-05-29 09:37:26] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 2 ms to minimize.
[2024-05-29 09:37:26] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 1 ms to minimize.
[2024-05-29 09:37:26] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 5 ms to minimize.
[2024-05-29 09:37:26] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 2 ms to minimize.
[2024-05-29 09:37:27] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 2 ms to minimize.
[2024-05-29 09:37:27] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 1 ms to minimize.
[2024-05-29 09:37:27] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/678 variables, 20/226 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-29 09:37:27] [INFO ] Deduced a trap composed of 5 places in 51 ms of which 2 ms to minimize.
[2024-05-29 09:37:27] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 2 ms to minimize.
[2024-05-29 09:37:27] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 2 ms to minimize.
[2024-05-29 09:37:27] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 2 ms to minimize.
[2024-05-29 09:37:27] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 1 ms to minimize.
[2024-05-29 09:37:27] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/678 variables, 6/232 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/678 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 20/698 variables, 7/239 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/698 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 16/714 variables, 8/247 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/714 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 614/1328 variables, 714/961 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1328 variables, 3/964 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-29 09:37:28] [INFO ] Deduced a trap composed of 8 places in 90 ms of which 2 ms to minimize.
[2024-05-29 09:37:29] [INFO ] Deduced a trap composed of 11 places in 85 ms of which 2 ms to minimize.
[2024-05-29 09:37:29] [INFO ] Deduced a trap composed of 7 places in 100 ms of which 2 ms to minimize.
[2024-05-29 09:37:29] [INFO ] Deduced a trap composed of 9 places in 102 ms of which 2 ms to minimize.
[2024-05-29 09:37:29] [INFO ] Deduced a trap composed of 12 places in 92 ms of which 2 ms to minimize.
[2024-05-29 09:37:29] [INFO ] Deduced a trap composed of 10 places in 85 ms of which 2 ms to minimize.
[2024-05-29 09:37:29] [INFO ] Deduced a trap composed of 14 places in 87 ms of which 3 ms to minimize.
[2024-05-29 09:37:29] [INFO ] Deduced a trap composed of 11 places in 82 ms of which 2 ms to minimize.
[2024-05-29 09:37:30] [INFO ] Deduced a trap composed of 10 places in 88 ms of which 2 ms to minimize.
[2024-05-29 09:37:30] [INFO ] Deduced a trap composed of 13 places in 82 ms of which 2 ms to minimize.
[2024-05-29 09:37:30] [INFO ] Deduced a trap composed of 10 places in 87 ms of which 2 ms to minimize.
[2024-05-29 09:37:30] [INFO ] Deduced a trap composed of 12 places in 89 ms of which 9 ms to minimize.
[2024-05-29 09:37:30] [INFO ] Deduced a trap composed of 12 places in 79 ms of which 2 ms to minimize.
[2024-05-29 09:37:30] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 1 ms to minimize.
[2024-05-29 09:37:30] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 1 ms to minimize.
[2024-05-29 09:37:31] [INFO ] Deduced a trap composed of 13 places in 82 ms of which 1 ms to minimize.
[2024-05-29 09:37:31] [INFO ] Deduced a trap composed of 8 places in 66 ms of which 2 ms to minimize.
[2024-05-29 09:37:31] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 1 ms to minimize.
[2024-05-29 09:37:31] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 2 ms to minimize.
[2024-05-29 09:37:31] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1328 variables, 20/984 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-29 09:37:32] [INFO ] Deduced a trap composed of 5 places in 89 ms of which 2 ms to minimize.
[2024-05-29 09:37:32] [INFO ] Deduced a trap composed of 14 places in 87 ms of which 2 ms to minimize.
[2024-05-29 09:37:32] [INFO ] Deduced a trap composed of 12 places in 74 ms of which 1 ms to minimize.
[2024-05-29 09:37:32] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1328 variables, 4/988 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1328 variables, 0/988 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-29 09:37:32] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 2 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/1328 variables, 1/989 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1328 variables, 0/989 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 0/1328 variables, 0/989 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1328/1328 variables, and 989 constraints, problems are : Problem set: 0 solved, 3 unsolved in 8032 ms.
Refiners :[Positive P Invariants (semi-flows): 213/213 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 714/714 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 51/51 constraints]
After SMT, in 8623ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 1201 ms.
Support contains 62 out of 714 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 714/714 places, 614/614 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 714 transition count 608
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 708 transition count 608
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 12 place count 708 transition count 603
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 22 place count 703 transition count 603
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 2 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 52 place count 688 transition count 588
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 56 place count 688 transition count 588
Applied a total of 56 rules in 106 ms. Remains 688 /714 variables (removed 26) and now considering 588/614 (removed 26) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 106 ms. Remains : 688/714 places, 588/614 transitions.
RANDOM walk for 40000 steps (15 resets) in 719 ms. (55 steps per ms) remains 2/3 properties
FORMULA ShieldPPPs-PT-020B-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 195 ms. (204 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 196 ms. (203 steps per ms) remains 2/2 properties
// Phase 1: matrix 588 rows 688 cols
[2024-05-29 09:37:35] [INFO ] Computed 221 invariants in 8 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 604/654 variables, 207/207 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/654 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 22/676 variables, 8/215 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/676 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 12/688 variables, 6/221 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/688 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 588/1276 variables, 688/909 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1276 variables, 0/909 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/1276 variables, 0/909 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1276/1276 variables, and 909 constraints, problems are : Problem set: 0 solved, 2 unsolved in 569 ms.
Refiners :[Positive P Invariants (semi-flows): 215/215 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 688/688 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/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 604/654 variables, 207/207 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-29 09:37:36] [INFO ] Deduced a trap composed of 7 places in 85 ms of which 2 ms to minimize.
[2024-05-29 09:37:36] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 1 ms to minimize.
[2024-05-29 09:37:36] [INFO ] Deduced a trap composed of 6 places in 70 ms of which 2 ms to minimize.
[2024-05-29 09:37:36] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 1 ms to minimize.
[2024-05-29 09:37:36] [INFO ] Deduced a trap composed of 8 places in 72 ms of which 1 ms to minimize.
[2024-05-29 09:37:36] [INFO ] Deduced a trap composed of 6 places in 66 ms of which 2 ms to minimize.
[2024-05-29 09:37:36] [INFO ] Deduced a trap composed of 8 places in 66 ms of which 1 ms to minimize.
[2024-05-29 09:37:36] [INFO ] Deduced a trap composed of 5 places in 73 ms of which 1 ms to minimize.
[2024-05-29 09:37:36] [INFO ] Deduced a trap composed of 7 places in 72 ms of which 2 ms to minimize.
[2024-05-29 09:37:36] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 1 ms to minimize.
[2024-05-29 09:37:36] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 1 ms to minimize.
[2024-05-29 09:37:36] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 2 ms to minimize.
[2024-05-29 09:37:37] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 2 ms to minimize.
[2024-05-29 09:37:37] [INFO ] Deduced a trap composed of 6 places in 59 ms of which 1 ms to minimize.
[2024-05-29 09:37:37] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 2 ms to minimize.
[2024-05-29 09:37:37] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 2 ms to minimize.
[2024-05-29 09:37:37] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 1 ms to minimize.
[2024-05-29 09:37:37] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 1 ms to minimize.
[2024-05-29 09:37:37] [INFO ] Deduced a trap composed of 8 places in 62 ms of which 1 ms to minimize.
[2024-05-29 09:37:37] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/654 variables, 20/227 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-29 09:37:37] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 1 ms to minimize.
[2024-05-29 09:37:37] [INFO ] Deduced a trap composed of 8 places in 64 ms of which 1 ms to minimize.
[2024-05-29 09:37:37] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 1 ms to minimize.
[2024-05-29 09:37:37] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 1 ms to minimize.
[2024-05-29 09:37:37] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 1 ms to minimize.
[2024-05-29 09:37:38] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 1 ms to minimize.
[2024-05-29 09:37:38] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 1 ms to minimize.
[2024-05-29 09:37:38] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 1 ms to minimize.
[2024-05-29 09:37:38] [INFO ] Deduced a trap composed of 10 places in 79 ms of which 2 ms to minimize.
[2024-05-29 09:37:38] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 2 ms to minimize.
[2024-05-29 09:37:38] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 1 ms to minimize.
[2024-05-29 09:37:38] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 1 ms to minimize.
[2024-05-29 09:37:38] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/654 variables, 13/240 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/654 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 22/676 variables, 8/248 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-29 09:37:38] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 1 ms to minimize.
[2024-05-29 09:37:38] [INFO ] Deduced a trap composed of 7 places in 61 ms of which 1 ms to minimize.
[2024-05-29 09:37:38] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 1 ms to minimize.
[2024-05-29 09:37:38] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
[2024-05-29 09:37:38] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/676 variables, 5/253 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/676 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 12/688 variables, 6/259 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-29 09:37:39] [INFO ] Deduced a trap composed of 8 places in 64 ms of which 1 ms to minimize.
[2024-05-29 09:37:39] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 1 ms to minimize.
[2024-05-29 09:37:39] [INFO ] Deduced a trap composed of 5 places in 60 ms of which 1 ms to minimize.
[2024-05-29 09:37:39] [INFO ] Deduced a trap composed of 11 places in 66 ms of which 2 ms to minimize.
[2024-05-29 09:37:39] [INFO ] Deduced a trap composed of 8 places in 54 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/688 variables, 5/264 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/688 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 588/1276 variables, 688/952 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1276 variables, 2/954 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-29 09:37:40] [INFO ] Deduced a trap composed of 7 places in 77 ms of which 1 ms to minimize.
[2024-05-29 09:37:40] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 2 ms to minimize.
[2024-05-29 09:37:40] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 2 ms to minimize.
[2024-05-29 09:37:40] [INFO ] Deduced a trap composed of 6 places in 81 ms of which 1 ms to minimize.
[2024-05-29 09:37:41] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 1 ms to minimize.
[2024-05-29 09:37:41] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 1 ms to minimize.
[2024-05-29 09:37:41] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 1 ms to minimize.
[2024-05-29 09:37:41] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 1 ms to minimize.
[2024-05-29 09:37:41] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
[2024-05-29 09:37:41] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 1 ms to minimize.
[2024-05-29 09:37:41] [INFO ] Deduced a trap composed of 6 places in 50 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1276 variables, 11/965 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1276 variables, 0/965 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/1276 variables, 0/965 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1276/1276 variables, and 965 constraints, problems are : Problem set: 0 solved, 2 unsolved in 6311 ms.
Refiners :[Positive P Invariants (semi-flows): 215/215 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 688/688 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 54/54 constraints]
After SMT, in 6913ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 530 ms.
Support contains 50 out of 688 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 688/688 places, 588/588 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 688 transition count 587
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 687 transition count 587
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 3 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 20 place count 678 transition count 578
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 24 place count 678 transition count 578
Applied a total of 24 rules in 89 ms. Remains 678 /688 variables (removed 10) and now considering 578/588 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 89 ms. Remains : 678/688 places, 578/588 transitions.
RANDOM walk for 40000 steps (15 resets) in 454 ms. (87 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 188 ms. (211 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 129 ms. (307 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 239945 steps, run timeout after 3001 ms. (steps per millisecond=79 ) properties seen :0 out of 2
Probabilistic random walk after 239945 steps, saw 92154 distinct states, run finished after 3004 ms. (steps per millisecond=79 ) properties seen :0
// Phase 1: matrix 578 rows 678 cols
[2024-05-29 09:37:46] [INFO ] Computed 221 invariants in 11 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 590/640 variables, 205/205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/640 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 22/662 variables, 8/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/662 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 16/678 variables, 8/221 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/678 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 578/1256 variables, 678/899 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1256 variables, 0/899 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/1256 variables, 0/899 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1256/1256 variables, and 899 constraints, problems are : Problem set: 0 solved, 2 unsolved in 437 ms.
Refiners :[Positive P Invariants (semi-flows): 213/213 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 678/678 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/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 590/640 variables, 205/205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-29 09:37:46] [INFO ] Deduced a trap composed of 6 places in 93 ms of which 2 ms to minimize.
[2024-05-29 09:37:46] [INFO ] Deduced a trap composed of 7 places in 84 ms of which 1 ms to minimize.
[2024-05-29 09:37:46] [INFO ] Deduced a trap composed of 8 places in 86 ms of which 2 ms to minimize.
[2024-05-29 09:37:47] [INFO ] Deduced a trap composed of 8 places in 81 ms of which 2 ms to minimize.
[2024-05-29 09:37:47] [INFO ] Deduced a trap composed of 8 places in 83 ms of which 2 ms to minimize.
[2024-05-29 09:37:47] [INFO ] Deduced a trap composed of 12 places in 77 ms of which 2 ms to minimize.
[2024-05-29 09:37:47] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 2 ms to minimize.
[2024-05-29 09:37:47] [INFO ] Deduced a trap composed of 10 places in 78 ms of which 2 ms to minimize.
[2024-05-29 09:37:47] [INFO ] Deduced a trap composed of 11 places in 83 ms of which 2 ms to minimize.
[2024-05-29 09:37:47] [INFO ] Deduced a trap composed of 12 places in 81 ms of which 2 ms to minimize.
[2024-05-29 09:37:47] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 1 ms to minimize.
[2024-05-29 09:37:47] [INFO ] Deduced a trap composed of 7 places in 80 ms of which 2 ms to minimize.
[2024-05-29 09:37:47] [INFO ] Deduced a trap composed of 8 places in 85 ms of which 1 ms to minimize.
[2024-05-29 09:37:47] [INFO ] Deduced a trap composed of 6 places in 71 ms of which 1 ms to minimize.
[2024-05-29 09:37:47] [INFO ] Deduced a trap composed of 7 places in 69 ms of which 1 ms to minimize.
[2024-05-29 09:37:48] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 1 ms to minimize.
[2024-05-29 09:37:48] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 3 ms to minimize.
[2024-05-29 09:37:48] [INFO ] Deduced a trap composed of 8 places in 65 ms of which 2 ms to minimize.
[2024-05-29 09:37:48] [INFO ] Deduced a trap composed of 7 places in 69 ms of which 2 ms to minimize.
[2024-05-29 09:37:48] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/640 variables, 20/225 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-29 09:37:48] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 1 ms to minimize.
[2024-05-29 09:37:48] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 1 ms to minimize.
[2024-05-29 09:37:48] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 1 ms to minimize.
[2024-05-29 09:37:48] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 1 ms to minimize.
[2024-05-29 09:37:48] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 1 ms to minimize.
[2024-05-29 09:37:48] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 1 ms to minimize.
[2024-05-29 09:37:48] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 1 ms to minimize.
[2024-05-29 09:37:48] [INFO ] Deduced a trap composed of 6 places in 44 ms of which 1 ms to minimize.
[2024-05-29 09:37:48] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 1 ms to minimize.
[2024-05-29 09:37:49] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 0 ms to minimize.
[2024-05-29 09:37:49] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2024-05-29 09:37:49] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/640 variables, 12/237 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-29 09:37:49] [INFO ] Deduced a trap composed of 6 places in 53 ms of which 1 ms to minimize.
[2024-05-29 09:37:49] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 1 ms to minimize.
[2024-05-29 09:37:49] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/640 variables, 3/240 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-29 09:37:49] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2024-05-29 09:37:49] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 1 ms to minimize.
[2024-05-29 09:37:49] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 1 ms to minimize.
[2024-05-29 09:37:49] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 1 ms to minimize.
[2024-05-29 09:37:49] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/640 variables, 5/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/640 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 22/662 variables, 8/253 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/662 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 16/678 variables, 8/261 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-29 09:37:49] [INFO ] Deduced a trap composed of 6 places in 45 ms of which 1 ms to minimize.
[2024-05-29 09:37:49] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/678 variables, 2/263 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-29 09:37:49] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 1 ms to minimize.
[2024-05-29 09:37:50] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 1 ms to minimize.
[2024-05-29 09:37:50] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/678 variables, 3/266 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/678 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 578/1256 variables, 678/944 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1256 variables, 2/946 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-29 09:37:50] [INFO ] Deduced a trap composed of 8 places in 61 ms of which 1 ms to minimize.
[2024-05-29 09:37:51] [INFO ] Deduced a trap composed of 7 places in 61 ms of which 1 ms to minimize.
[2024-05-29 09:37:51] [INFO ] Deduced a trap composed of 7 places in 59 ms of which 1 ms to minimize.
[2024-05-29 09:37:51] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 2 ms to minimize.
[2024-05-29 09:37:51] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 1 ms to minimize.
[2024-05-29 09:37:51] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 2 ms to minimize.
[2024-05-29 09:37:51] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 1 ms to minimize.
[2024-05-29 09:37:51] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 1 ms to minimize.
[2024-05-29 09:37:51] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 1 ms to minimize.
[2024-05-29 09:37:51] [INFO ] Deduced a trap composed of 8 places in 58 ms of which 1 ms to minimize.
[2024-05-29 09:37:51] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 1 ms to minimize.
[2024-05-29 09:37:52] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2024-05-29 09:37:52] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 2 ms to minimize.
[2024-05-29 09:37:52] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 2 ms to minimize.
[2024-05-29 09:37:52] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 1 ms to minimize.
[2024-05-29 09:37:52] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 1 ms to minimize.
[2024-05-29 09:37:52] [INFO ] Deduced a trap composed of 8 places in 61 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1256 variables, 17/963 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1256 variables, 0/963 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/1256 variables, 0/963 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1256/1256 variables, and 963 constraints, problems are : Problem set: 0 solved, 2 unsolved in 7108 ms.
Refiners :[Positive P Invariants (semi-flows): 213/213 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 678/678 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 62/62 constraints]
After SMT, in 7576ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1005 ms.
Support contains 50 out of 678 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 678/678 places, 578/578 transitions.
Applied a total of 0 rules in 17 ms. Remains 678 /678 variables (removed 0) and now considering 578/578 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 678/678 places, 578/578 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 678/678 places, 578/578 transitions.
Applied a total of 0 rules in 17 ms. Remains 678 /678 variables (removed 0) and now considering 578/578 (removed 0) transitions.
[2024-05-29 09:37:54] [INFO ] Invariant cache hit.
[2024-05-29 09:37:55] [INFO ] Implicit Places using invariants in 348 ms returned []
[2024-05-29 09:37:55] [INFO ] Invariant cache hit.
[2024-05-29 09:37:55] [INFO ] Implicit Places using invariants and state equation in 621 ms returned []
Implicit Place search using SMT with State Equation took 983 ms to find 0 implicit places.
[2024-05-29 09:37:55] [INFO ] Redundant transitions in 26 ms returned []
Running 577 sub problems to find dead transitions.
[2024-05-29 09:37:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/677 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/677 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 2 (OVERLAPS) 1/678 variables, 213/221 constraints. Problems are: Problem set: 0 solved, 577 unsolved
[2024-05-29 09:38:06] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 2 ms to minimize.
[2024-05-29 09:38:07] [INFO ] Deduced a trap composed of 9 places in 527 ms of which 2 ms to minimize.
[2024-05-29 09:38:07] [INFO ] Deduced a trap composed of 10 places in 74 ms of which 1 ms to minimize.
[2024-05-29 09:38:08] [INFO ] Deduced a trap composed of 10 places in 624 ms of which 2 ms to minimize.
[2024-05-29 09:38:08] [INFO ] Deduced a trap composed of 6 places in 62 ms of which 1 ms to minimize.
[2024-05-29 09:38:08] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 1 ms to minimize.
[2024-05-29 09:38:08] [INFO ] Deduced a trap composed of 11 places in 66 ms of which 2 ms to minimize.
[2024-05-29 09:38:08] [INFO ] Deduced a trap composed of 6 places in 71 ms of which 1 ms to minimize.
[2024-05-29 09:38:08] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 1 ms to minimize.
[2024-05-29 09:38:08] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 2 ms to minimize.
[2024-05-29 09:38:08] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 1 ms to minimize.
[2024-05-29 09:38:08] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 1 ms to minimize.
[2024-05-29 09:38:08] [INFO ] Deduced a trap composed of 8 places in 175 ms of which 1 ms to minimize.
[2024-05-29 09:38:08] [INFO ] Deduced a trap composed of 8 places in 60 ms of which 1 ms to minimize.
[2024-05-29 09:38:09] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-05-29 09:38:09] [INFO ] Deduced a trap composed of 6 places in 52 ms of which 1 ms to minimize.
[2024-05-29 09:38:09] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 1 ms to minimize.
[2024-05-29 09:38:09] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 1 ms to minimize.
[2024-05-29 09:38:09] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 1 ms to minimize.
[2024-05-29 09:38:09] [INFO ] Deduced a trap composed of 8 places in 108 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/678 variables, 20/241 constraints. Problems are: Problem set: 0 solved, 577 unsolved
[2024-05-29 09:38:15] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 1 ms to minimize.
[2024-05-29 09:38:15] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 1 ms to minimize.
[2024-05-29 09:38:15] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
[2024-05-29 09:38:15] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 1 ms to minimize.
[2024-05-29 09:38:16] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 1 ms to minimize.
[2024-05-29 09:38:16] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 1 ms to minimize.
[2024-05-29 09:38:16] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 1 ms to minimize.
[2024-05-29 09:38:16] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 1 ms to minimize.
[2024-05-29 09:38:16] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 1 ms to minimize.
[2024-05-29 09:38:16] [INFO ] Deduced a trap composed of 6 places in 58 ms of which 1 ms to minimize.
[2024-05-29 09:38:16] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 1 ms to minimize.
[2024-05-29 09:38:16] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 1 ms to minimize.
[2024-05-29 09:38:16] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 1 ms to minimize.
[2024-05-29 09:38:16] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 1 ms to minimize.
[2024-05-29 09:38:16] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 1 ms to minimize.
[2024-05-29 09:38:16] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 1 ms to minimize.
[2024-05-29 09:38:16] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
[2024-05-29 09:38:16] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 1 ms to minimize.
[2024-05-29 09:38:16] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 1 ms to minimize.
[2024-05-29 09:38:17] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/678 variables, 20/261 constraints. Problems are: Problem set: 0 solved, 577 unsolved
[2024-05-29 09:38:17] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 0 ms to minimize.
[2024-05-29 09:38:17] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 0 ms to minimize.
[2024-05-29 09:38:17] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 0 ms to minimize.
[2024-05-29 09:38:17] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 1 ms to minimize.
[2024-05-29 09:38:18] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 1 ms to minimize.
[2024-05-29 09:38:18] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 1 ms to minimize.
[2024-05-29 09:38:18] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 2 ms to minimize.
[2024-05-29 09:38:18] [INFO ] Deduced a trap composed of 8 places in 56 ms of which 1 ms to minimize.
[2024-05-29 09:38:18] [INFO ] Deduced a trap composed of 8 places in 58 ms of which 1 ms to minimize.
[2024-05-29 09:38:18] [INFO ] Deduced a trap composed of 8 places in 57 ms of which 1 ms to minimize.
[2024-05-29 09:38:18] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 1 ms to minimize.
[2024-05-29 09:38:18] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
[2024-05-29 09:38:18] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
[2024-05-29 09:38:18] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 1 ms to minimize.
[2024-05-29 09:38:18] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 1 ms to minimize.
[2024-05-29 09:38:18] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 0 ms to minimize.
[2024-05-29 09:38:18] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 1 ms to minimize.
[2024-05-29 09:38:19] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
[2024-05-29 09:38:19] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-29 09:38:19] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/678 variables, 20/281 constraints. Problems are: Problem set: 0 solved, 577 unsolved
[2024-05-29 09:38:19] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 1 ms to minimize.
[2024-05-29 09:38:20] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
[2024-05-29 09:38:20] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-05-29 09:38:20] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 8 ms to minimize.
[2024-05-29 09:38:20] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2024-05-29 09:38:20] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
[2024-05-29 09:38:20] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 1 ms to minimize.
[2024-05-29 09:38:20] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 1 ms to minimize.
[2024-05-29 09:38:20] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 1 ms to minimize.
[2024-05-29 09:38:20] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 2 ms to minimize.
[2024-05-29 09:38:20] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 3 ms to minimize.
[2024-05-29 09:38:20] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 1 ms to minimize.
[2024-05-29 09:38:20] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
[2024-05-29 09:38:21] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 1 ms to minimize.
[2024-05-29 09:38:22] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 0 ms to minimize.
[2024-05-29 09:38:22] [INFO ] Deduced a trap composed of 10 places in 18 ms of which 1 ms to minimize.
[2024-05-29 09:38:22] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 1 ms to minimize.
[2024-05-29 09:38:22] [INFO ] Deduced a trap composed of 11 places in 18 ms of which 0 ms to minimize.
[2024-05-29 09:38:22] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
[2024-05-29 09:38:22] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/678 variables, 20/301 constraints. Problems are: Problem set: 0 solved, 577 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 678/1256 variables, and 301 constraints, problems are : Problem set: 0 solved, 577 unsolved in 30053 ms.
Refiners :[Positive P Invariants (semi-flows): 213/213 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/678 constraints, PredecessorRefiner: 577/577 constraints, Known Traps: 80/80 constraints]
Escalating to Integer solving :Problem set: 0 solved, 577 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/677 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/677 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 2 (OVERLAPS) 1/678 variables, 213/221 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/678 variables, 80/301 constraints. Problems are: Problem set: 0 solved, 577 unsolved
[2024-05-29 09:38:32] [INFO ] Deduced a trap composed of 8 places in 55 ms of which 1 ms to minimize.
[2024-05-29 09:38:32] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 1 ms to minimize.
[2024-05-29 09:38:34] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 0 ms to minimize.
[2024-05-29 09:38:34] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 0 ms to minimize.
[2024-05-29 09:38:34] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2024-05-29 09:38:34] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 0 ms to minimize.
[2024-05-29 09:38:34] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 0 ms to minimize.
[2024-05-29 09:38:34] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 0 ms to minimize.
[2024-05-29 09:38:34] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 1 ms to minimize.
[2024-05-29 09:38:35] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 0 ms to minimize.
[2024-05-29 09:38:35] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 0 ms to minimize.
[2024-05-29 09:38:35] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 1 ms to minimize.
[2024-05-29 09:38:35] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 1 ms to minimize.
[2024-05-29 09:38:35] [INFO ] Deduced a trap composed of 8 places in 18 ms of which 0 ms to minimize.
[2024-05-29 09:38:35] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 0 ms to minimize.
[2024-05-29 09:38:35] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
[2024-05-29 09:38:35] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 0 ms to minimize.
[2024-05-29 09:38:35] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 0 ms to minimize.
[2024-05-29 09:38:36] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
[2024-05-29 09:38:36] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/678 variables, 20/321 constraints. Problems are: Problem set: 0 solved, 577 unsolved
[2024-05-29 09:38:36] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 1 ms to minimize.
[2024-05-29 09:38:37] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 1 ms to minimize.
[2024-05-29 09:38:37] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 1 ms to minimize.
[2024-05-29 09:38:40] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
[2024-05-29 09:38:40] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-05-29 09:38:40] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 0 ms to minimize.
[2024-05-29 09:38:40] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 1 ms to minimize.
[2024-05-29 09:38:40] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 0 ms to minimize.
[2024-05-29 09:38:40] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 0 ms to minimize.
[2024-05-29 09:38:40] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 1 ms to minimize.
[2024-05-29 09:38:40] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 1 ms to minimize.
[2024-05-29 09:38:40] [INFO ] Deduced a trap composed of 6 places in 43 ms of which 1 ms to minimize.
[2024-05-29 09:38:40] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 0 ms to minimize.
[2024-05-29 09:38:40] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
[2024-05-29 09:38:41] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 0 ms to minimize.
[2024-05-29 09:38:41] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 1 ms to minimize.
[2024-05-29 09:38:41] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 0 ms to minimize.
[2024-05-29 09:38:41] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 0 ms to minimize.
[2024-05-29 09:38:41] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 1 ms to minimize.
[2024-05-29 09:38:41] [INFO ] Deduced a trap composed of 46 places in 49 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/678 variables, 20/341 constraints. Problems are: Problem set: 0 solved, 577 unsolved
[2024-05-29 09:38:46] [INFO ] Deduced a trap composed of 6 places in 53 ms of which 0 ms to minimize.
[2024-05-29 09:38:46] [INFO ] Deduced a trap composed of 57 places in 50 ms of which 1 ms to minimize.
[2024-05-29 09:38:46] [INFO ] Deduced a trap composed of 11 places in 19 ms of which 0 ms to minimize.
[2024-05-29 09:38:46] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 0 ms to minimize.
[2024-05-29 09:38:47] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 0 ms to minimize.
[2024-05-29 09:38:47] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-29 09:38:47] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 1 ms to minimize.
[2024-05-29 09:38:47] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
[2024-05-29 09:38:47] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 1 ms to minimize.
[2024-05-29 09:38:47] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 0 ms to minimize.
[2024-05-29 09:38:47] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-05-29 09:38:47] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 0 ms to minimize.
[2024-05-29 09:38:47] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 0 ms to minimize.
[2024-05-29 09:38:47] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-05-29 09:38:47] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
[2024-05-29 09:38:47] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 1 ms to minimize.
[2024-05-29 09:38:47] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 1 ms to minimize.
[2024-05-29 09:38:48] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 0 ms to minimize.
[2024-05-29 09:38:48] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 1 ms to minimize.
[2024-05-29 09:38:48] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/678 variables, 20/361 constraints. Problems are: Problem set: 0 solved, 577 unsolved
[2024-05-29 09:38:52] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 0 ms to minimize.
[2024-05-29 09:38:52] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 0 ms to minimize.
[2024-05-29 09:38:53] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2024-05-29 09:38:54] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 1 ms to minimize.
[2024-05-29 09:38:54] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
[2024-05-29 09:38:54] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 1 ms to minimize.
[2024-05-29 09:38:54] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 0 ms to minimize.
[2024-05-29 09:38:54] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 1 ms to minimize.
[2024-05-29 09:38:54] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 0 ms to minimize.
[2024-05-29 09:38:54] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 1 ms to minimize.
[2024-05-29 09:38:54] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
[2024-05-29 09:38:55] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 0 ms to minimize.
[2024-05-29 09:38:55] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 1 ms to minimize.
[2024-05-29 09:38:55] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 1 ms to minimize.
[2024-05-29 09:38:55] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2024-05-29 09:38:55] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 1 ms to minimize.
[2024-05-29 09:38:55] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/678 variables, 17/378 constraints. Problems are: Problem set: 0 solved, 577 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 678/1256 variables, and 378 constraints, problems are : Problem set: 0 solved, 577 unsolved in 30059 ms.
Refiners :[Positive P Invariants (semi-flows): 213/213 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/678 constraints, PredecessorRefiner: 0/577 constraints, Known Traps: 157/157 constraints]
After SMT, in 60240ms problems are : Problem set: 0 solved, 577 unsolved
Search for dead transitions found 0 dead transitions in 60248ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61290 ms. Remains : 678/678 places, 578/578 transitions.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-29 09:38:56] [INFO ] Flatten gal took : 57 ms
[2024-05-29 09:38:56] [INFO ] Applying decomposition
[2024-05-29 09:38:56] [INFO ] Flatten gal took : 63 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/graph2186854986291725038.txt' '-o' '/tmp/graph2186854986291725038.bin' '-w' '/tmp/graph2186854986291725038.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2186854986291725038.bin' '-l' '-1' '-v' '-w' '/tmp/graph2186854986291725038.weights' '-q' '0' '-e' '0.001'
[2024-05-29 09:38:56] [INFO ] Decomposing Gal with order
[2024-05-29 09:38:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 09:38:56] [INFO ] Removed a total of 180 redundant transitions.
[2024-05-29 09:38:56] [INFO ] Flatten gal took : 167 ms
[2024-05-29 09:38:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 10 ms.
[2024-05-29 09:38:56] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5802058444434988346.gal : 31 ms
[2024-05-29 09:38:56] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18300955614365107790.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/ReachabilityCardinality5802058444434988346.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality18300955614365107790.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/ReachabilityCardinality18300955614365107790.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 1
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :1 after 1.28256e+06
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :1.28256e+06 after 1.08259e+29
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :8.20805e+56 after 3.74518e+57
Invariant property ShieldPPPs-PT-020B-ReachabilityCardinality-2024-14 does not hold.
FORMULA ShieldPPPs-PT-020B-ReachabilityCardinality-2024-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :3.74518e+57 after 1.27447e+59
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1.27447e+59 after 9.96837e+60
ITS-tools command line returned an error code 137
[2024-05-29 09:47:18] [INFO ] Flatten gal took : 28 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin2866054782118494067
[2024-05-29 09:47:18] [INFO ] Applying decomposition
[2024-05-29 09:47:18] [INFO ] Computing symmetric may disable matrix : 578 transitions.
[2024-05-29 09:47:18] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 09:47:18] [INFO ] Computing symmetric may enable matrix : 578 transitions.
[2024-05-29 09:47:18] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 09:47:18] [INFO ] Flatten gal took : 56 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/graph10190664832701261361.txt' '-o' '/tmp/graph10190664832701261361.bin' '-w' '/tmp/graph10190664832701261361.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10190664832701261361.bin' '-l' '-1' '-v' '-w' '/tmp/graph10190664832701261361.weights' '-q' '0' '-e' '0.001'
[2024-05-29 09:47:18] [INFO ] Computing Do-Not-Accords matrix : 578 transitions.
[2024-05-29 09:47:18] [INFO ] Decomposing Gal with order
[2024-05-29 09:47:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 09:47:18] [INFO ] Computation of Completed DNA matrix. took 17 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 09:47:18] [INFO ] Built C files in 177ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2866054782118494067
Running compilation step : cd /tmp/ltsmin2866054782118494067;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-29 09:47:18] [INFO ] Removed a total of 294 redundant transitions.
[2024-05-29 09:47:18] [INFO ] Flatten gal took : 79 ms
[2024-05-29 09:47:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 416 labels/synchronizations in 80 ms.
[2024-05-29 09:47:18] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5133835867554841394.gal : 21 ms
[2024-05-29 09:47:18] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2899903394911827452.prop : 0 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/ReachabilityCardinality5133835867554841394.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2899903394911827452.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/ReachabilityCardinality2899903394911827452.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 121
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :121 after 1771
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1771 after 5731
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :5731 after 2.73813e+06
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :5.64155e+10 after 3.4765e+13
Compilation finished in 2028 ms.
Running link step : cd /tmp/ltsmin2866054782118494067;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 53 ms.
Running LTSmin : cd /tmp/ltsmin2866054782118494067;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldPPPsPT020BReachabilityCardinality202401==true'
ITS-tools command line returned an error code 137
[2024-05-29 10:10:37] [INFO ] Applying decomposition
[2024-05-29 10:10:37] [INFO ] Flatten gal took : 69 ms
[2024-05-29 10:10:37] [INFO ] Decomposing Gal with order
[2024-05-29 10:10:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 10:10:37] [INFO ] Removed a total of 382 redundant transitions.
[2024-05-29 10:10:37] [INFO ] Flatten gal took : 104 ms
[2024-05-29 10:10:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 599 labels/synchronizations in 277 ms.
[2024-05-29 10:10:38] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3084048374172321088.gal : 48 ms
[2024-05-29 10:10:38] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12465634236228374483.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/ReachabilityCardinality3084048374172321088.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12465634236228374483.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/ReachabilityCardinality12465634236228374483.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :2 after 8
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :8 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 868
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :868 after 10372
WARNING : LTSmin timed out (>1800 s) on command cd /tmp/ltsmin2866054782118494067;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldPPPsPT020BReachabilityCardinality202401==true'
Retrying LTSmin with larger timeout 28800 s
Running LTSmin : cd /tmp/ltsmin2866054782118494067;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldPPPsPT020BReachabilityCardinality202401==true'
ITS-tools command line returned an error code 137
[2024-05-29 10:27:50] [INFO ] Flatten gal took : 63 ms
[2024-05-29 10:27:50] [INFO ] Input system was already deterministic with 578 transitions.
[2024-05-29 10:27:50] [INFO ] Transformed 678 places.
[2024-05-29 10:27:50] [INFO ] Transformed 578 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-29 10:27:50] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6809034246377693098.gal : 3 ms
[2024-05-29 10:27:50] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6544539046121513025.prop : 0 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/ReachabilityCardinality6809034246377693098.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6544539046121513025.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--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 ...373
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/ReachabilityCardinality6544539046121513025.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :4 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 15
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :15 after 54
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :54 after 487
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :487 after 4087
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :4087 after 35047
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :35047 after 38681
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :38681 after 45549
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :45549 after 723196
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :723196 after 989401
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :989401 after 1.18505e+10
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :1.18505e+10 after 1.188e+10
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :1.188e+10 after 1.18458e+12
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :1.18458e+12 after 1.3467e+12
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :1.3467e+12 after 1.97851e+13
SDD proceeding with computation,1 properties remain. new max is 262144
SDD size :1.97851e+13 after 9.73148e+14

BK_TIME_CONFINEMENT_REACHED

--------------------
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
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -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="ShieldPPPs-PT-020B"
export BK_EXAMINATION="ReachabilityCardinality"
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 ShieldPPPs-PT-020B, examination is ReachabilityCardinality"
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-171683761100462"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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