fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r356-tall-171683761200487
Last Updated
July 7, 2024

About the Execution of ITS-Tools for ShieldPPPs-PT-040A

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16205.867 3600000.00 6234305.00 7633.50 TTTFT?TTTTTTTTFT normal

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-171683761200487.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-040A, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r356-tall-171683761200487
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 784K
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K 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.9K May 19 07:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 16:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 19:10 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 13 12:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 113K Apr 13 12:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Apr 13 12:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K Apr 13 12:21 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 355K 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-040A-ReachabilityFireability-2024-00
FORMULA_NAME ShieldPPPs-PT-040A-ReachabilityFireability-2024-01
FORMULA_NAME ShieldPPPs-PT-040A-ReachabilityFireability-2024-02
FORMULA_NAME ShieldPPPs-PT-040A-ReachabilityFireability-2024-03
FORMULA_NAME ShieldPPPs-PT-040A-ReachabilityFireability-2024-04
FORMULA_NAME ShieldPPPs-PT-040A-ReachabilityFireability-2024-05
FORMULA_NAME ShieldPPPs-PT-040A-ReachabilityFireability-2024-06
FORMULA_NAME ShieldPPPs-PT-040A-ReachabilityFireability-2024-07
FORMULA_NAME ShieldPPPs-PT-040A-ReachabilityFireability-2024-08
FORMULA_NAME ShieldPPPs-PT-040A-ReachabilityFireability-2024-09
FORMULA_NAME ShieldPPPs-PT-040A-ReachabilityFireability-2024-10
FORMULA_NAME ShieldPPPs-PT-040A-ReachabilityFireability-2024-11
FORMULA_NAME ShieldPPPs-PT-040A-ReachabilityFireability-2024-12
FORMULA_NAME ShieldPPPs-PT-040A-ReachabilityFireability-2024-13
FORMULA_NAME ShieldPPPs-PT-040A-ReachabilityFireability-2024-14
FORMULA_NAME ShieldPPPs-PT-040A-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716983637241

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPs-PT-040A
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202405141337
[2024-05-29 11:53:58] [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-29 11:53:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 11:53:58] [INFO ] Load time of PNML (sax parser for PT used): 142 ms
[2024-05-29 11:53:58] [INFO ] Transformed 1243 places.
[2024-05-29 11:53:58] [INFO ] Transformed 1043 transitions.
[2024-05-29 11:53:58] [INFO ] Found NUPN structural information;
[2024-05-29 11:53:58] [INFO ] Parsed PT model containing 1243 places and 1043 transitions and 4006 arcs in 286 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (12 resets) in 2558 ms. (15 steps per ms) remains 5/16 properties
FORMULA ShieldPPPs-PT-040A-ReachabilityFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-040A-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-040A-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-040A-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-040A-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-040A-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-040A-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-040A-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-040A-ReachabilityFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-040A-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-040A-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-29 11:53:59] [INFO ] Flatten gal took : 479 ms
BEST_FIRST walk for 40004 steps (8 resets) in 816 ms. (48 steps per ms) remains 5/5 properties
[2024-05-29 11:53:59] [INFO ] Flatten gal took : 136 ms
[2024-05-29 11:54:00] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17121803768528630666.gal : 125 ms
BEST_FIRST walk for 40004 steps (8 resets) in 811 ms. (49 steps per ms) remains 5/5 properties
[2024-05-29 11:54:00] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18288861107093584060.prop : 12 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/ReachabilityCardinality17121803768528630666.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality18288861107093584060.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
BEST_FIRST walk for 40004 steps (8 resets) in 716 ms. (55 steps per ms) remains 5/5 properties
Loading property file /tmp/ReachabilityCardinality18288861107093584060.prop.
BEST_FIRST walk for 40004 steps (8 resets) in 365 ms. (109 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 690 ms. (57 steps per ms) remains 5/5 properties
// Phase 1: matrix 1043 rows 1243 cols
[2024-05-29 11:54:00] [INFO ] Computed 441 invariants in 59 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/178 variables, 178/178 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/178 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 5 unsolved
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :2 after 3
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :3 after 8
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :8 after 17
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :17 after 34
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :34 after 67
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :67 after 126
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :126 after 533
At refinement iteration 2 (OVERLAPS) 325/503 variables, 158/336 constraints. Problems are: Problem set: 0 solved, 5 unsolved
SDD proceeding with computation,5 properties remain. new max is 512
SDD size :533 after 3758
SDD proceeding with computation,5 properties remain. new max is 1024
SDD size :3758 after 1.05546e+06
At refinement iteration 3 (INCLUDED_ONLY) 0/503 variables, 325/661 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/503 variables, 0/661 constraints. Problems are: Problem set: 0 solved, 5 unsolved
SDD proceeding with computation,5 properties remain. new max is 2048
SDD size :1.05546e+06 after 1.24088e+06
At refinement iteration 5 (OVERLAPS) 740/1243 variables, 283/944 constraints. Problems are: Problem set: 0 solved, 5 unsolved
SDD proceeding with computation,5 properties remain. new max is 4096
SDD size :1.24088e+06 after 2.16513e+06
At refinement iteration 6 (INCLUDED_ONLY) 0/1243 variables, 740/1684 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1243 variables, 0/1684 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 1043/2286 variables, 1243/2927 constraints. Problems are: Problem set: 0 solved, 5 unsolved
SDD proceeding with computation,5 properties remain. new max is 8192
SDD size :2.16513e+06 after 1.24061e+07
At refinement iteration 9 (INCLUDED_ONLY) 0/2286 variables, 0/2927 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 0/2286 variables, 0/2927 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2286/2286 variables, and 2927 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1904 ms.
Refiners :[Domain max(s): 1243/1243 constraints, Positive P Invariants (semi-flows): 441/441 constraints, State Equation: 1243/1243 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/178 variables, 178/178 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/178 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 325/503 variables, 158/336 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/503 variables, 325/661 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/503 variables, 0/661 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 740/1243 variables, 283/944 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1243 variables, 740/1684 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1243 variables, 0/1684 constraints. Problems are: Problem set: 0 solved, 5 unsolved
SDD proceeding with computation,5 properties remain. new max is 16384
SDD size :1.24061e+07 after 1.2457e+09
At refinement iteration 8 (OVERLAPS) 1043/2286 variables, 1243/2927 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2286 variables, 5/2932 constraints. Problems are: Problem set: 0 solved, 5 unsolved
SDD proceeding with computation,5 properties remain. new max is 32768
SDD size :1.2457e+09 after 4.77673e+10
At refinement iteration 10 (INCLUDED_ONLY) 0/2286 variables, 0/2932 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 0/2286 variables, 0/2932 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2286/2286 variables, and 2932 constraints, problems are : Problem set: 0 solved, 5 unsolved in 4739 ms.
Refiners :[Domain max(s): 1243/1243 constraints, Positive P Invariants (semi-flows): 441/441 constraints, State Equation: 1243/1243 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 6923ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 3 different solutions.
FORMULA ShieldPPPs-PT-040A-ReachabilityFireability-2024-07 TRUE TECHNIQUES PARIKH_WALK
FORMULA ShieldPPPs-PT-040A-ReachabilityFireability-2024-01 TRUE TECHNIQUES PARIKH_WALK
SDD proceeding with computation,5 properties remain. new max is 65536
SDD size :4.77673e+10 after 4.77379e+11
Parikh walk visited 2 properties in 5986 ms.
Support contains 91 out of 1243 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1243/1243 places, 1043/1043 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1241 transition count 1041
Partial Free-agglomeration rule applied 307 times.
Drop transitions (Partial Free agglomeration) removed 307 transitions
Iterating global reduction 0 with 307 rules applied. Total rules applied 311 place count 1241 transition count 1041
Applied a total of 311 rules in 394 ms. Remains 1241 /1243 variables (removed 2) and now considering 1041/1043 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 417 ms. Remains : 1241/1243 places, 1041/1043 transitions.
RANDOM walk for 40000 steps (8 resets) in 1485 ms. (26 steps per ms) remains 2/3 properties
FORMULA ShieldPPPs-PT-040A-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 396 ms. (100 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 506 ms. (78 steps per ms) remains 2/2 properties
// Phase 1: matrix 1041 rows 1241 cols
[2024-05-29 11:54:14] [INFO ] Computed 441 invariants in 25 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 84/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 186/270 variables, 82/166 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/270 variables, 186/352 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/270 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 924/1194 variables, 335/687 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1194 variables, 924/1611 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1194 variables, 0/1611 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 47/1241 variables, 24/1635 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1241 variables, 47/1682 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1241 variables, 0/1682 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1041/2282 variables, 1241/2923 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2282 variables, 0/2923 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/2282 variables, 0/2923 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2282/2282 variables, and 2923 constraints, problems are : Problem set: 0 solved, 2 unsolved in 757 ms.
Refiners :[Domain max(s): 1241/1241 constraints, Positive P Invariants (semi-flows): 417/417 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 1241/1241 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/84 variables, 84/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 186/270 variables, 82/166 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/270 variables, 186/352 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-29 11:54:15] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/270 variables, 1/353 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/270 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 924/1194 variables, 335/688 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1194 variables, 924/1612 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-29 11:54:16] [INFO ] Deduced a trap composed of 10 places in 243 ms of which 2 ms to minimize.
[2024-05-29 11:54:16] [INFO ] Deduced a trap composed of 7 places in 56 ms of which 1 ms to minimize.
[2024-05-29 11:54:16] [INFO ] Deduced a trap composed of 5 places in 47 ms of which 1 ms to minimize.
[2024-05-29 11:54:16] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
[2024-05-29 11:54:16] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 1 ms to minimize.
[2024-05-29 11:54:16] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1194 variables, 6/1618 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1194 variables, 0/1618 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 47/1241 variables, 24/1642 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1241 variables, 47/1689 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-29 11:54:17] [INFO ] Deduced a trap composed of 11 places in 572 ms of which 1 ms to minimize.
[2024-05-29 11:54:17] [INFO ] Deduced a trap composed of 6 places in 145 ms of which 1 ms to minimize.
[2024-05-29 11:54:17] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 1 ms to minimize.
[2024-05-29 11:54:17] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 1 ms to minimize.
[2024-05-29 11:54:17] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1241 variables, 5/1694 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1241 variables, 0/1694 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 1041/2282 variables, 1241/2935 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2282 variables, 2/2937 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,5 properties remain. new max is 131072
SDD size :4.77379e+11 after 2.3499e+15
[2024-05-29 11:54:24] [INFO ] Deduced a trap composed of 6 places in 76 ms of which 2 ms to minimize.
[2024-05-29 11:54:25] [INFO ] Deduced a trap composed of 7 places in 461 ms of which 2 ms to minimize.
[2024-05-29 11:54:25] [INFO ] Deduced a trap composed of 6 places in 71 ms of which 2 ms to minimize.
[2024-05-29 11:54:25] [INFO ] Deduced a trap composed of 5 places in 89 ms of which 1 ms to minimize.
[2024-05-29 11:54:25] [INFO ] Deduced a trap composed of 7 places in 68 ms of which 2 ms to minimize.
[2024-05-29 11:54:26] [INFO ] Deduced a trap composed of 5 places in 82 ms of which 1 ms to minimize.
[2024-05-29 11:54:26] [INFO ] Deduced a trap composed of 5 places in 75 ms of which 1 ms to minimize.
[2024-05-29 11:54:26] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 1 ms to minimize.
[2024-05-29 11:54:26] [INFO ] Deduced a trap composed of 5 places in 51 ms of which 1 ms to minimize.
[2024-05-29 11:54:26] [INFO ] Deduced a trap composed of 7 places in 59 ms of which 1 ms to minimize.
[2024-05-29 11:54:26] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 1 ms to minimize.
[2024-05-29 11:54:27] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 1 ms to minimize.
[2024-05-29 11:54:27] [INFO ] Deduced a trap composed of 6 places in 51 ms of which 1 ms to minimize.
[2024-05-29 11:54:27] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 1 ms to minimize.
[2024-05-29 11:54:27] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 1 ms to minimize.
[2024-05-29 11:54:27] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 0 ms to minimize.
[2024-05-29 11:54:27] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/2282 variables, 17/2954 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2282 variables, 0/2954 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/2282 variables, 0/2954 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2282/2282 variables, and 2954 constraints, problems are : Problem set: 0 solved, 2 unsolved in 13875 ms.
Refiners :[Domain max(s): 1241/1241 constraints, Positive P Invariants (semi-flows): 417/417 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 1241/1241 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 29/29 constraints]
After SMT, in 14695ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1775 ms.
Support contains 84 out of 1241 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1241/1241 places, 1041/1041 transitions.
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 1241 transition count 1041
Applied a total of 3 rules in 100 ms. Remains 1241 /1241 variables (removed 0) and now considering 1041/1041 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 102 ms. Remains : 1241/1241 places, 1041/1041 transitions.
RANDOM walk for 40000 steps (8 resets) in 782 ms. (51 steps per ms) remains 1/2 properties
FORMULA ShieldPPPs-PT-040A-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 401 ms. (99 steps per ms) remains 1/1 properties
// Phase 1: matrix 1041 rows 1241 cols
[2024-05-29 11:54:31] [INFO ] Computed 441 invariants in 15 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 101/144 variables, 42/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/144 variables, 101/186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1050/1194 variables, 375/561 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1194 variables, 1050/1611 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1194 variables, 0/1611 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 47/1241 variables, 24/1635 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1241 variables, 47/1682 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1241 variables, 0/1682 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1041/2282 variables, 1241/2923 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2282 variables, 0/2923 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/2282 variables, 0/2923 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2282/2282 variables, and 2923 constraints, problems are : Problem set: 0 solved, 1 unsolved in 789 ms.
Refiners :[Domain max(s): 1241/1241 constraints, Positive P Invariants (semi-flows): 417/417 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 1241/1241 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 101/144 variables, 42/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/144 variables, 101/186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1050/1194 variables, 375/561 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1194 variables, 1050/1611 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-29 11:54:32] [INFO ] Deduced a trap composed of 5 places in 76 ms of which 1 ms to minimize.
[2024-05-29 11:54:32] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 1 ms to minimize.
[2024-05-29 11:54:33] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 1 ms to minimize.
[2024-05-29 11:54:33] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 1 ms to minimize.
[2024-05-29 11:54:33] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 8 ms to minimize.
[2024-05-29 11:54:33] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 1 ms to minimize.
[2024-05-29 11:54:33] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 1 ms to minimize.
[2024-05-29 11:54:33] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 1 ms to minimize.
[2024-05-29 11:54:33] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1194 variables, 9/1620 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1194 variables, 0/1620 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 47/1241 variables, 24/1644 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1241 variables, 47/1691 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-29 11:54:33] [INFO ] Deduced a trap composed of 5 places in 47 ms of which 0 ms to minimize.
[2024-05-29 11:54:33] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 1 ms to minimize.
[2024-05-29 11:54:33] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1241 variables, 3/1694 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1241 variables, 0/1694 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1041/2282 variables, 1241/2935 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2282 variables, 1/2936 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,5 properties remain. new max is 262144
SDD size :2.3499e+15 after 2.04542e+16
[2024-05-29 11:54:48] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 1 ms to minimize.
[2024-05-29 11:54:48] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 1 ms to minimize.
[2024-05-29 11:54:48] [INFO ] Deduced a trap composed of 5 places in 65 ms of which 1 ms to minimize.
[2024-05-29 11:54:48] [INFO ] Deduced a trap composed of 5 places in 72 ms of which 1 ms to minimize.
[2024-05-29 11:54:49] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 1 ms to minimize.
[2024-05-29 11:54:49] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 1 ms to minimize.
[2024-05-29 11:54:49] [INFO ] Deduced a trap composed of 5 places in 48 ms of which 5 ms to minimize.
[2024-05-29 11:54:49] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 37 ms to minimize.
[2024-05-29 11:54:55] [INFO ] Deduced a trap composed of 5 places in 49 ms of which 1 ms to minimize.
[2024-05-29 11:54:55] [INFO ] Deduced a trap composed of 6 places in 47 ms of which 2 ms to minimize.
[2024-05-29 11:54:56] [INFO ] Deduced a trap composed of 5 places in 52 ms of which 1 ms to minimize.
[2024-05-29 11:54:56] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 1 ms to minimize.
[2024-05-29 11:54:56] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
[2024-05-29 11:54:56] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 1 ms to minimize.
[2024-05-29 11:54:56] [INFO ] Deduced a trap composed of 5 places in 45 ms of which 12 ms to minimize.
[2024-05-29 11:54:56] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 0 ms to minimize.
[2024-05-29 11:54:57] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/2282 variables, 17/2953 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2282 variables, 0/2953 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/2282 variables, 0/2953 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2282/2282 variables, and 2953 constraints, problems are : Problem set: 0 solved, 1 unsolved in 25750 ms.
Refiners :[Domain max(s): 1241/1241 constraints, Positive P Invariants (semi-flows): 417/417 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 1241/1241 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 29/29 constraints]
After SMT, in 26572ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 739 ms.
Support contains 43 out of 1241 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1241/1241 places, 1041/1041 transitions.
Partial Free-agglomeration rule applied 19 times.
Drop transitions (Partial Free agglomeration) removed 19 transitions
Iterating global reduction 0 with 19 rules applied. Total rules applied 19 place count 1241 transition count 1041
Applied a total of 19 rules in 69 ms. Remains 1241 /1241 variables (removed 0) and now considering 1041/1041 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69 ms. Remains : 1241/1241 places, 1041/1041 transitions.
RANDOM walk for 40000 steps (8 resets) in 703 ms. (56 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 388 ms. (102 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 219347 steps, run timeout after 3001 ms. (steps per millisecond=73 ) properties seen :0 out of 1
Probabilistic random walk after 219347 steps, saw 203438 distinct states, run finished after 3004 ms. (steps per millisecond=73 ) properties seen :0
// Phase 1: matrix 1041 rows 1241 cols
[2024-05-29 11:55:02] [INFO ] Computed 441 invariants in 15 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 99/142 variables, 41/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 99/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1047/1189 variables, 373/556 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1189 variables, 1047/1603 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1189 variables, 0/1603 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 52/1241 variables, 27/1630 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1241 variables, 52/1682 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1241 variables, 0/1682 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1041/2282 variables, 1241/2923 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2282 variables, 0/2923 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/2282 variables, 0/2923 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2282/2282 variables, and 2923 constraints, problems are : Problem set: 0 solved, 1 unsolved in 676 ms.
Refiners :[Domain max(s): 1241/1241 constraints, Positive P Invariants (semi-flows): 414/414 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 1241/1241 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 99/142 variables, 41/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 99/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1047/1189 variables, 373/556 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1189 variables, 1047/1603 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-29 11:55:03] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 0 ms to minimize.
[2024-05-29 11:55:03] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 0 ms to minimize.
[2024-05-29 11:55:03] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1189 variables, 3/1606 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1189 variables, 0/1606 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 52/1241 variables, 27/1633 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1241 variables, 52/1685 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1241 variables, 0/1685 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1041/2282 variables, 1241/2926 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2282 variables, 1/2927 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-29 11:55:06] [INFO ] Deduced a trap composed of 5 places in 59 ms of which 1 ms to minimize.
[2024-05-29 11:55:06] [INFO ] Deduced a trap composed of 7 places in 56 ms of which 1 ms to minimize.
[2024-05-29 11:55:07] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 4 ms to minimize.
[2024-05-29 11:55:07] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 0 ms to minimize.
[2024-05-29 11:55:07] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/2282 variables, 5/2932 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2282 variables, 0/2932 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/2282 variables, 0/2932 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2282/2282 variables, and 2932 constraints, problems are : Problem set: 0 solved, 1 unsolved in 5419 ms.
Refiners :[Domain max(s): 1241/1241 constraints, Positive P Invariants (semi-flows): 414/414 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 1241/1241 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 8/8 constraints]
After SMT, in 6126ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1842 ms.
Support contains 43 out of 1241 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1241/1241 places, 1041/1041 transitions.
Applied a total of 0 rules in 64 ms. Remains 1241 /1241 variables (removed 0) and now considering 1041/1041 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 78 ms. Remains : 1241/1241 places, 1041/1041 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1241/1241 places, 1041/1041 transitions.
Applied a total of 0 rules in 45 ms. Remains 1241 /1241 variables (removed 0) and now considering 1041/1041 (removed 0) transitions.
[2024-05-29 11:55:10] [INFO ] Invariant cache hit.
[2024-05-29 11:55:11] [INFO ] Implicit Places using invariants in 843 ms returned []
[2024-05-29 11:55:11] [INFO ] Invariant cache hit.
[2024-05-29 11:55:12] [INFO ] Implicit Places using invariants and state equation in 1484 ms returned []
Implicit Place search using SMT with State Equation took 2363 ms to find 0 implicit places.
[2024-05-29 11:55:12] [INFO ] Redundant transitions in 56 ms returned []
Running 1040 sub problems to find dead transitions.
[2024-05-29 11:55:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1240 variables, 1240/1240 constraints. Problems are: Problem set: 0 solved, 1040 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1240 variables, 27/1267 constraints. Problems are: Problem set: 0 solved, 1040 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1240/2282 variables, and 1267 constraints, problems are : Problem set: 0 solved, 1040 unsolved in 30054 ms.
Refiners :[Domain max(s): 1240/1241 constraints, Positive P Invariants (semi-flows): 0/414 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 0/1241 constraints, PredecessorRefiner: 1040/1040 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1040 unsolved
SDD proceeding with computation,5 properties remain. new max is 524288
SDD size :2.04542e+16 after 8.81059e+19
At refinement iteration 0 (INCLUDED_ONLY) 0/1240 variables, 1240/1240 constraints. Problems are: Problem set: 0 solved, 1040 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1240 variables, 27/1267 constraints. Problems are: Problem set: 0 solved, 1040 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1240 variables, 0/1267 constraints. Problems are: Problem set: 0 solved, 1040 unsolved
At refinement iteration 3 (OVERLAPS) 1/1241 variables, 414/1681 constraints. Problems are: Problem set: 0 solved, 1040 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1241 variables, 1/1682 constraints. Problems are: Problem set: 0 solved, 1040 unsolved
[2024-05-29 11:56:03] [INFO ] Deduced a trap composed of 5 places in 157 ms of which 3 ms to minimize.
[2024-05-29 11:56:03] [INFO ] Deduced a trap composed of 5 places in 177 ms of which 3 ms to minimize.
[2024-05-29 11:56:03] [INFO ] Deduced a trap composed of 6 places in 165 ms of which 3 ms to minimize.
[2024-05-29 11:56:03] [INFO ] Deduced a trap composed of 5 places in 165 ms of which 2 ms to minimize.
[2024-05-29 11:56:05] [INFO ] Deduced a trap composed of 5 places in 1176 ms of which 2 ms to minimize.
[2024-05-29 11:56:05] [INFO ] Deduced a trap composed of 5 places in 477 ms of which 2 ms to minimize.
[2024-05-29 11:56:05] [INFO ] Deduced a trap composed of 6 places in 152 ms of which 3 ms to minimize.
[2024-05-29 11:56:05] [INFO ] Deduced a trap composed of 5 places in 144 ms of which 2 ms to minimize.
[2024-05-29 11:56:06] [INFO ] Deduced a trap composed of 5 places in 138 ms of which 3 ms to minimize.
[2024-05-29 11:56:06] [INFO ] Deduced a trap composed of 6 places in 131 ms of which 3 ms to minimize.
[2024-05-29 11:56:06] [INFO ] Deduced a trap composed of 5 places in 134 ms of which 2 ms to minimize.
[2024-05-29 11:56:06] [INFO ] Deduced a trap composed of 6 places in 130 ms of which 2 ms to minimize.
[2024-05-29 11:56:06] [INFO ] Deduced a trap composed of 7 places in 130 ms of which 2 ms to minimize.
[2024-05-29 11:56:06] [INFO ] Deduced a trap composed of 5 places in 135 ms of which 2 ms to minimize.
[2024-05-29 11:56:06] [INFO ] Deduced a trap composed of 7 places in 129 ms of which 2 ms to minimize.
[2024-05-29 11:56:07] [INFO ] Deduced a trap composed of 5 places in 136 ms of which 2 ms to minimize.
[2024-05-29 11:56:07] [INFO ] Deduced a trap composed of 5 places in 133 ms of which 2 ms to minimize.
[2024-05-29 11:56:07] [INFO ] Deduced a trap composed of 5 places in 133 ms of which 3 ms to minimize.
[2024-05-29 11:56:07] [INFO ] Deduced a trap composed of 7 places in 116 ms of which 2 ms to minimize.
[2024-05-29 11:56:07] [INFO ] Deduced a trap composed of 7 places in 125 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1241 variables, 20/1702 constraints. Problems are: Problem set: 0 solved, 1040 unsolved
[2024-05-29 11:56:08] [INFO ] Deduced a trap composed of 5 places in 123 ms of which 2 ms to minimize.
[2024-05-29 11:56:08] [INFO ] Deduced a trap composed of 6 places in 120 ms of which 2 ms to minimize.
[2024-05-29 11:56:08] [INFO ] Deduced a trap composed of 5 places in 116 ms of which 2 ms to minimize.
[2024-05-29 11:56:08] [INFO ] Deduced a trap composed of 5 places in 115 ms of which 2 ms to minimize.
[2024-05-29 11:56:08] [INFO ] Deduced a trap composed of 6 places in 111 ms of which 2 ms to minimize.
[2024-05-29 11:56:08] [INFO ] Deduced a trap composed of 6 places in 114 ms of which 3 ms to minimize.
[2024-05-29 11:56:08] [INFO ] Deduced a trap composed of 5 places in 109 ms of which 2 ms to minimize.
[2024-05-29 11:56:08] [INFO ] Deduced a trap composed of 5 places in 110 ms of which 2 ms to minimize.
[2024-05-29 11:56:09] [INFO ] Deduced a trap composed of 6 places in 110 ms of which 2 ms to minimize.
[2024-05-29 11:56:09] [INFO ] Deduced a trap composed of 5 places in 113 ms of which 3 ms to minimize.
[2024-05-29 11:56:09] [INFO ] Deduced a trap composed of 7 places in 110 ms of which 2 ms to minimize.
[2024-05-29 11:56:09] [INFO ] Deduced a trap composed of 5 places in 105 ms of which 2 ms to minimize.
[2024-05-29 11:56:09] [INFO ] Deduced a trap composed of 5 places in 112 ms of which 2 ms to minimize.
[2024-05-29 11:56:09] [INFO ] Deduced a trap composed of 5 places in 105 ms of which 2 ms to minimize.
[2024-05-29 11:56:09] [INFO ] Deduced a trap composed of 5 places in 102 ms of which 2 ms to minimize.
[2024-05-29 11:56:09] [INFO ] Deduced a trap composed of 5 places in 103 ms of which 2 ms to minimize.
[2024-05-29 11:56:10] [INFO ] Deduced a trap composed of 5 places in 97 ms of which 2 ms to minimize.
[2024-05-29 11:56:10] [INFO ] Deduced a trap composed of 6 places in 101 ms of which 3 ms to minimize.
[2024-05-29 11:56:10] [INFO ] Deduced a trap composed of 6 places in 98 ms of which 2 ms to minimize.
[2024-05-29 11:56:10] [INFO ] Deduced a trap composed of 5 places in 96 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1241 variables, 20/1722 constraints. Problems are: Problem set: 0 solved, 1040 unsolved
[2024-05-29 11:56:10] [INFO ] Deduced a trap composed of 5 places in 88 ms of which 2 ms to minimize.
[2024-05-29 11:56:10] [INFO ] Deduced a trap composed of 5 places in 92 ms of which 2 ms to minimize.
[2024-05-29 11:56:10] [INFO ] Deduced a trap composed of 6 places in 86 ms of which 2 ms to minimize.
[2024-05-29 11:56:11] [INFO ] Deduced a trap composed of 5 places in 90 ms of which 2 ms to minimize.
[2024-05-29 11:56:11] [INFO ] Deduced a trap composed of 5 places in 86 ms of which 1 ms to minimize.
[2024-05-29 11:56:11] [INFO ] Deduced a trap composed of 6 places in 84 ms of which 2 ms to minimize.
[2024-05-29 11:56:11] [INFO ] Deduced a trap composed of 6 places in 83 ms of which 2 ms to minimize.
[2024-05-29 11:56:11] [INFO ] Deduced a trap composed of 6 places in 94 ms of which 2 ms to minimize.
[2024-05-29 11:56:11] [INFO ] Deduced a trap composed of 5 places in 82 ms of which 2 ms to minimize.
[2024-05-29 11:56:11] [INFO ] Deduced a trap composed of 7 places in 82 ms of which 2 ms to minimize.
[2024-05-29 11:56:11] [INFO ] Deduced a trap composed of 5 places in 74 ms of which 2 ms to minimize.
[2024-05-29 11:56:11] [INFO ] Deduced a trap composed of 6 places in 81 ms of which 1 ms to minimize.
[2024-05-29 11:56:12] [INFO ] Deduced a trap composed of 5 places in 79 ms of which 2 ms to minimize.
[2024-05-29 11:56:12] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 1 ms to minimize.
[2024-05-29 11:56:12] [INFO ] Deduced a trap composed of 5 places in 113 ms of which 2 ms to minimize.
[2024-05-29 11:56:12] [INFO ] Deduced a trap composed of 5 places in 64 ms of which 2 ms to minimize.
[2024-05-29 11:56:12] [INFO ] Deduced a trap composed of 5 places in 71 ms of which 2 ms to minimize.
[2024-05-29 11:56:12] [INFO ] Deduced a trap composed of 5 places in 89 ms of which 1 ms to minimize.
[2024-05-29 11:56:12] [INFO ] Deduced a trap composed of 5 places in 105 ms of which 2 ms to minimize.
[2024-05-29 11:56:12] [INFO ] Deduced a trap composed of 5 places in 63 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1241 variables, 20/1742 constraints. Problems are: Problem set: 0 solved, 1040 unsolved
[2024-05-29 11:56:13] [INFO ] Deduced a trap composed of 7 places in 62 ms of which 2 ms to minimize.
[2024-05-29 11:56:13] [INFO ] Deduced a trap composed of 7 places in 73 ms of which 1 ms to minimize.
[2024-05-29 11:56:13] [INFO ] Deduced a trap composed of 7 places in 74 ms of which 1 ms to minimize.
[2024-05-29 11:56:13] [INFO ] Deduced a trap composed of 7 places in 73 ms of which 2 ms to minimize.
[2024-05-29 11:56:13] [INFO ] Deduced a trap composed of 6 places in 73 ms of which 2 ms to minimize.
[2024-05-29 11:56:13] [INFO ] Deduced a trap composed of 7 places in 74 ms of which 1 ms to minimize.
[2024-05-29 11:56:13] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 1 ms to minimize.
SMT process timed out in 60554ms, After SMT, problems are : Problem set: 0 solved, 1040 unsolved
Search for dead transitions found 0 dead transitions in 60566ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63047 ms. Remains : 1241/1241 places, 1041/1041 transitions.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-29 11:56:13] [INFO ] Flatten gal took : 70 ms
[2024-05-29 11:56:13] [INFO ] Applying decomposition
[2024-05-29 11:56:13] [INFO ] Flatten gal took : 58 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/graph1601663737640414074.txt' '-o' '/tmp/graph1601663737640414074.bin' '-w' '/tmp/graph1601663737640414074.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1601663737640414074.bin' '-l' '-1' '-v' '-w' '/tmp/graph1601663737640414074.weights' '-q' '0' '-e' '0.001'
[2024-05-29 11:56:14] [INFO ] Decomposing Gal with order
[2024-05-29 11:56:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 11:56:14] [INFO ] Removed a total of 240 redundant transitions.
[2024-05-29 11:56:14] [INFO ] Flatten gal took : 122 ms
[2024-05-29 11:56:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 484 labels/synchronizations in 105 ms.
[2024-05-29 11:56:14] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15589355898024617257.gal : 26 ms
[2024-05-29 11:56:14] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14373025462001712150.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/ReachabilityCardinality15589355898024617257.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14373025462001712150.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 ...309
Loading property file /tmp/ReachabilityCardinality14373025462001712150.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 26
ITS-tools command line returned an error code 137
[2024-05-29 12:08:53] [INFO ] Flatten gal took : 70 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin6470168291292544528
[2024-05-29 12:08:53] [INFO ] Applying decomposition
[2024-05-29 12:08:53] [INFO ] Computing symmetric may disable matrix : 1041 transitions.
[2024-05-29 12:08:53] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 12:08:53] [INFO ] Computing symmetric may enable matrix : 1041 transitions.
[2024-05-29 12:08:53] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 12:08:53] [INFO ] Flatten gal took : 50 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/graph1269108679219073835.txt' '-o' '/tmp/graph1269108679219073835.bin' '-w' '/tmp/graph1269108679219073835.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1269108679219073835.bin' '-l' '-1' '-v' '-w' '/tmp/graph1269108679219073835.weights' '-q' '0' '-e' '0.001'
[2024-05-29 12:08:53] [INFO ] Decomposing Gal with order
[2024-05-29 12:08:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 12:08:53] [INFO ] Computing Do-Not-Accords matrix : 1041 transitions.
[2024-05-29 12:08:53] [INFO ] Removed a total of 558 redundant transitions.
[2024-05-29 12:08:53] [INFO ] Computation of Completed DNA matrix. took 43 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 12:08:53] [INFO ] Flatten gal took : 75 ms
[2024-05-29 12:08:53] [INFO ] Built C files in 440ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6470168291292544528
Running compilation step : cd /tmp/ltsmin6470168291292544528;'/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 12:08:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 960 labels/synchronizations in 72 ms.
[2024-05-29 12:08:54] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability8698893754807121470.gal : 18 ms
[2024-05-29 12:08:54] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability17711235953231817218.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/ReachabilityFireability8698893754807121470.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability17711235953231817218.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/ReachabilityFireability17711235953231817218.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 30
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :30 after 30
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :30 after 30
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :30 after 30
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :30 after 30
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :30 after 30
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :30 after 2.32186e+28
Compilation finished in 4242 ms.
Running link step : cd /tmp/ltsmin6470168291292544528;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 74 ms.
Running LTSmin : cd /tmp/ltsmin6470168291292544528;'/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' 'ShieldPPPsPT040AReachabilityFireability202405==true'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 2/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.285: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.285: Initializing POR dependencies: labels 1042, guards 1041
pins2lts-mc-linux64( 4/ 8), 0.303: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.308: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.338: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.338: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.355: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.375: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.396: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 37.935: Forcing use of the an ignoring proviso (closed-set)
pins2lts-mc-linux64( 1/ 8), 38.059: "ShieldPPPsPT040AReachabilityFireability202405==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 5/ 8), 38.059: "ShieldPPPsPT040AReachabilityFireability202405==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 38.060: "ShieldPPPsPT040AReachabilityFireability202405==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 38.060: "ShieldPPPsPT040AReachabilityFireability202405==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 3/ 8), 38.059: "ShieldPPPsPT040AReachabilityFireability202405==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 4/ 8), 38.059: "ShieldPPPsPT040AReachabilityFireability202405==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 7/ 8), 38.059: "ShieldPPPsPT040AReachabilityFireability202405==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 6/ 8), 38.059: "ShieldPPPsPT040AReachabilityFireability202405==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 38.063: There are 1042 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 38.063: State length is 1241, there are 1041 groups
pins2lts-mc-linux64( 0/ 8), 38.063: Running bfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 38.063: Using a non-indexing tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 38.063: Successor permutation: none
pins2lts-mc-linux64( 0/ 8), 38.063: Visible groups: 0 / 1041, labels: 1 / 1042
pins2lts-mc-linux64( 0/ 8), 38.063: POR cycle proviso: closed-set
pins2lts-mc-linux64( 0/ 8), 38.063: Global bits: 0, count bits: 0, local bits: 0
pins2lts-mc-linux64( 5/ 8), 38.246: ~5 levels ~960 states ~3960 transitions
pins2lts-mc-linux64( 7/ 8), 38.373: ~9 levels ~1920 states ~7880 transitions
pins2lts-mc-linux64( 7/ 8), 38.564: ~10 levels ~3840 states ~16256 transitions
pins2lts-mc-linux64( 7/ 8), 38.989: ~11 levels ~7680 states ~35312 transitions
pins2lts-mc-linux64( 7/ 8), 39.822: ~12 levels ~15360 states ~75408 transitions
pins2lts-mc-linux64( 7/ 8), 41.325: ~13 levels ~30720 states ~160968 transitions
pins2lts-mc-linux64( 7/ 8), 44.371: ~14 levels ~61440 states ~338736 transitions
pins2lts-mc-linux64( 7/ 8), 50.868: ~15 levels ~122880 states ~722888 transitions
pins2lts-mc-linux64( 7/ 8), 63.440: ~16 levels ~245760 states ~1509808 transitions
pins2lts-mc-linux64( 7/ 8), 88.895: ~17 levels ~491520 states ~3138832 transitions
pins2lts-mc-linux64( 7/ 8), 141.603: ~18 levels ~983040 states ~6632840 transitions
pins2lts-mc-linux64( 7/ 8), 244.068: ~20 levels ~1966080 states ~13419480 transitions
pins2lts-mc-linux64( 7/ 8), 469.432: ~21 levels ~3932160 states ~28577248 transitions
pins2lts-mc-linux64( 5/ 8), 796.872: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 797.013:
pins2lts-mc-linux64( 0/ 8), 797.013: mean standard work distribution: 5.2% (states) 4.2% (transitions)
pins2lts-mc-linux64( 0/ 8), 797.013:
pins2lts-mc-linux64( 0/ 8), 797.013: Explored 6283650 states 47276295 transitions, fanout: 7.524
pins2lts-mc-linux64( 0/ 8), 797.013: Total exploration time 758.940 sec (758.810 sec minimum, 758.878 sec on average)
pins2lts-mc-linux64( 0/ 8), 797.013: States per second: 8280, Transitions per second: 62293
pins2lts-mc-linux64( 0/ 8), 797.013: Ignoring proviso: 3047961
pins2lts-mc-linux64( 0/ 8), 797.013:
pins2lts-mc-linux64( 0/ 8), 797.013: Queue width: 8B, total height: 5329870, memory: 40.66MB
pins2lts-mc-linux64( 0/ 8), 797.013: Tree memory: 344.6MB, 31.1 B/state, compr.: 0.6%
pins2lts-mc-linux64( 0/ 8), 797.013: Tree fill ratio (roots/leafs): 8.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 797.013: Stored 1175 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 797.013: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 797.013: Est. total memory use: 385.3MB (~1064.7MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin6470168291292544528;'/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' 'ShieldPPPsPT040AReachabilityFireability202405==true'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin6470168291292544528;'/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' 'ShieldPPPsPT040AReachabilityFireability202405==true'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:241)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:176)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:114)
at java.base/java.lang.Thread.run(Thread.java:840)
ITS-tools command line returned an error code 137
[2024-05-29 12:25:35] [INFO ] Applying decomposition
[2024-05-29 12:25:35] [INFO ] Flatten gal took : 51 ms
[2024-05-29 12:25:35] [INFO ] Decomposing Gal with order
[2024-05-29 12:25:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 12:25:35] [INFO ] Removed a total of 842 redundant transitions.
[2024-05-29 12:25:35] [INFO ] Flatten gal took : 81 ms
[2024-05-29 12:25:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 724 labels/synchronizations in 53 ms.
[2024-05-29 12:25:36] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability12250263627688138706.gal : 17 ms
[2024-05-29 12:25:36] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability13221483495505746927.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/ReachabilityFireability12250263627688138706.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability13221483495505746927.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 ...309
Loading property file /tmp/ReachabilityFireability13221483495505746927.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :2 after 2
ITS-tools command line returned an error code 137
[2024-05-29 12:33:21] [INFO ] Flatten gal took : 46 ms
[2024-05-29 12:33:21] [INFO ] Input system was already deterministic with 1041 transitions.
[2024-05-29 12:33:21] [INFO ] Transformed 1241 places.
[2024-05-29 12:33:21] [INFO ] Transformed 1041 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 12:33:21] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability922956270237358984.gal : 6 ms
[2024-05-29 12:33:21] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability12752904313015296161.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/ReachabilityFireability922956270237358984.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability12752904313015296161.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/ReachabilityFireability12752904313015296161.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 8
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :8 after 33
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :33 after 55
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :55 after 289
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :289 after 2484
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :2484 after 12725
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :12725 after 102952
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :102952 after 9.73353e+06
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :9.73353e+06 after 1.86962e+07
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1.86962e+07 after 2.05849e+08
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :2.05849e+08 after 5.99105e+10
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :5.99105e+10 after 1.00631e+11
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :1.00631e+11 after 3.01919e+14
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :3.01919e+14 after 3.63019e+14
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :3.63019e+14 after 2.05805e+16
SDD proceeding with computation,1 properties remain. new max is 262144
SDD size :2.05805e+16 after 2.75802e+18
SDD proceeding with computation,1 properties remain. new max is 524288
SDD size :2.75802e+18 after 6.78878e+18
SDD proceeding with computation,1 properties remain. new max is 1048576
SDD size :6.78878e+18 after 8.50604e+18
SDD proceeding with computation,1 properties remain. new max is 2097152
SDD size :8.50604e+18 after 5.89859e+22

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
+ [[ 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//
++ 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 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="ShieldPPPs-PT-040A"
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 ShieldPPPs-PT-040A, 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-171683761200487"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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