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-171683761600678.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 ShieldPPPt-PT-050A, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r356-tall-171683761600678
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 848K
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 07:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 07:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 23 07:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 11 15:42 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 152K Apr 11 15:42 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 11 15:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 95K Apr 11 15:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 337K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717023787206

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPt-PT-050A
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202405141337
[2024-05-29 23:03:08] [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 23:03:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 23:03:08] [INFO ] Load time of PNML (sax parser for PT used): 144 ms
[2024-05-29 23:03:08] [INFO ] Transformed 1253 places.
[2024-05-29 23:03:08] [INFO ] Transformed 903 transitions.
[2024-05-29 23:03:08] [INFO ] Found NUPN structural information;
[2024-05-29 23:03:08] [INFO ] Parsed PT model containing 1253 places and 903 transitions and 3606 arcs in 278 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 28 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
FORMULA ShieldPPPt-PT-050A-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-050A-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-050A-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-050A-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-29 23:03:09] [INFO ] Flatten gal took : 312 ms
RANDOM walk for 40000 steps (8 resets) in 2847 ms. (14 steps per ms) remains 9/12 properties
FORMULA ShieldPPPt-PT-050A-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-050A-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-050A-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-29 23:03:09] [INFO ] Flatten gal took : 150 ms
BEST_FIRST walk for 40003 steps (8 resets) in 579 ms. (68 steps per ms) remains 9/9 properties
[2024-05-29 23:03:09] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10628832218651704082.gal : 147 ms
[2024-05-29 23:03:09] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8725894607841184440.prop : 2 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/ReachabilityCardinality10628832218651704082.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8725894607841184440.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 ...329
BEST_FIRST walk for 40004 steps (8 resets) in 674 ms. (59 steps per ms) remains 9/9 properties
Loading property file /tmp/ReachabilityCardinality8725894607841184440.prop.
BEST_FIRST walk for 40003 steps (8 resets) in 504 ms. (79 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 506 ms. (78 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 444 ms. (89 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 915 ms. (43 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (8 resets) in 585 ms. (68 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 521 ms. (76 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 451 ms. (88 steps per ms) remains 9/9 properties
// Phase 1: matrix 902 rows 1253 cols
[2024-05-29 23:03:11] [INFO ] Computed 551 invariants in 20 ms
SDD proceeding with computation,9 properties remain. new max is 4
SDD size :2 after 3
SDD proceeding with computation,9 properties remain. new max is 8
SDD size :3 after 10
SDD proceeding with computation,9 properties remain. new max is 16
SDD size :10 after 24
SDD proceeding with computation,9 properties remain. new max is 32
SDD size :24 after 49
SDD proceeding with computation,9 properties remain. new max is 64
SDD size :49 after 99
Invariant property ShieldPPPt-PT-050A-ReachabilityCardinality-2024-10 does not hold.
FORMULA ShieldPPPt-PT-050A-ReachabilityCardinality-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :99 after 272
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :272 after 1122
SDD proceeding with computation,8 properties remain. new max is 256
SDD size :1122 after 269569
SDD proceeding with computation,8 properties remain. new max is 512
SDD size :269569 after 3.55359e+06
SDD proceeding with computation,8 properties remain. new max is 1024
All remaining problems are real, not stopping.
SDD size :3.55359e+06 after 1.168e+10
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 165/165 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/165 variables, 0/165 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 241/406 variables, 168/333 constraints. Problems are: Problem set: 1 solved, 8 unsolved
SDD proceeding with computation,8 properties remain. new max is 2048
SDD size :1.168e+10 after 2.54669e+18
At refinement iteration 3 (INCLUDED_ONLY) 0/406 variables, 241/574 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/406 variables, 0/574 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 847/1253 variables, 383/957 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1253 variables, 847/1804 constraints. Problems are: Problem set: 1 solved, 8 unsolved
Reachability property ShieldPPPt-PT-050A-ReachabilityCardinality-2024-12 is true.
FORMULA ShieldPPPt-PT-050A-ReachabilityCardinality-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
At refinement iteration 7 (INCLUDED_ONLY) 0/1253 variables, 0/1804 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 902/2155 variables, 1253/3057 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2155 variables, 0/3057 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 0/2155 variables, 0/3057 constraints. Problems are: Problem set: 2 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2155/2155 variables, and 3057 constraints, problems are : Problem set: 2 solved, 7 unsolved in 1519 ms.
Refiners :[Domain max(s): 1253/1253 constraints, Positive P Invariants (semi-flows): 551/551 constraints, State Equation: 1253/1253 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 135/135 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 0/135 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 208/343 variables, 141/276 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/343 variables, 208/484 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/343 variables, 0/484 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 910/1253 variables, 410/894 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1253 variables, 910/1804 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1253 variables, 0/1804 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 902/2155 variables, 1253/3057 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2155 variables, 7/3064 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2155 variables, 0/3064 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 0/2155 variables, 0/3064 constraints. Problems are: Problem set: 2 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2155/2155 variables, and 3064 constraints, problems are : Problem set: 2 solved, 7 unsolved in 3983 ms.
Refiners :[Domain max(s): 1253/1253 constraints, Positive P Invariants (semi-flows): 551/551 constraints, State Equation: 1253/1253 constraints, PredecessorRefiner: 7/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 5639ms problems are : Problem set: 2 solved, 7 unsolved
FORMULA ShieldPPPt-PT-050A-ReachabilityCardinality-2024-02 TRUE TECHNIQUES PARIKH_WALK
FORMULA ShieldPPPt-PT-050A-ReachabilityCardinality-2024-15 FALSE TECHNIQUES PARIKH_WALK
FORMULA ShieldPPPt-PT-050A-ReachabilityCardinality-2024-13 TRUE TECHNIQUES PARIKH_WALK
FORMULA ShieldPPPt-PT-050A-ReachabilityCardinality-2024-11 TRUE TECHNIQUES PARIKH_WALK
FORMULA ShieldPPPt-PT-050A-ReachabilityCardinality-2024-05 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 5 properties in 19029 ms.
Support contains 68 out of 1253 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1253/1253 places, 902/902 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1252 transition count 901
Partial Free-agglomeration rule applied 176 times.
Drop transitions (Partial Free agglomeration) removed 176 transitions
Iterating global reduction 0 with 176 rules applied. Total rules applied 178 place count 1252 transition count 901
Applied a total of 178 rules in 275 ms. Remains 1252 /1253 variables (removed 1) and now considering 901/902 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 285 ms. Remains : 1252/1253 places, 901/902 transitions.
RANDOM walk for 40000 steps (8 resets) in 961 ms. (41 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 412 ms. (96 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 544 ms. (73 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 153947 steps, run timeout after 3001 ms. (steps per millisecond=51 ) properties seen :0 out of 2
Probabilistic random walk after 153947 steps, saw 150478 distinct states, run finished after 3005 ms. (steps per millisecond=51 ) properties seen :0
// Phase 1: matrix 901 rows 1252 cols
[2024-05-29 23:03:39] [INFO ] Computed 551 invariants in 6 ms
[2024-05-29 23:03:39] [INFO ] State equation strengthened by 49 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 68/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 111/179 variables, 72/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 111/251 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1073/1252 variables, 479/730 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1252 variables, 1073/1803 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1252 variables, 0/1803 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 901/2153 variables, 1252/3055 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2153 variables, 49/3104 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2153 variables, 0/3104 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/2153 variables, 0/3104 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2153/2153 variables, and 3104 constraints, problems are : Problem set: 0 solved, 2 unsolved in 741 ms.
Refiners :[Domain max(s): 1252/1252 constraints, Positive P Invariants (semi-flows): 551/551 constraints, State Equation: 1252/1252 constraints, ReadFeed: 49/49 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/68 variables, 68/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 111/179 variables, 72/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 111/251 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1073/1252 variables, 479/730 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1252 variables, 1073/1803 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1252 variables, 0/1803 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 901/2153 variables, 1252/3055 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2153 variables, 49/3104 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2153 variables, 2/3106 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-29 23:03:41] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 8 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/2153 variables, 1/3107 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2153 variables, 0/3107 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/2153 variables, 0/3107 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2153/2153 variables, and 3107 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2166 ms.
Refiners :[Domain max(s): 1252/1252 constraints, Positive P Invariants (semi-flows): 551/551 constraints, State Equation: 1252/1252 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 2955ms problems are : Problem set: 0 solved, 2 unsolved
FORMULA ShieldPPPt-PT-050A-ReachabilityCardinality-2024-04 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 3465 ms.
Support contains 56 out of 1252 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1252/1252 places, 901/901 transitions.
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 0 with 5 rules applied. Total rules applied 5 place count 1252 transition count 901
Applied a total of 5 rules in 132 ms. Remains 1252 /1252 variables (removed 0) and now considering 901/901 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 132 ms. Remains : 1252/1252 places, 901/901 transitions.
RANDOM walk for 40000 steps (8 resets) in 529 ms. (75 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 446 ms. (89 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 222039 steps, run timeout after 3001 ms. (steps per millisecond=73 ) properties seen :0 out of 1
Probabilistic random walk after 222039 steps, saw 217207 distinct states, run finished after 3002 ms. (steps per millisecond=73 ) properties seen :0
// Phase 1: matrix 901 rows 1252 cols
[2024-05-29 23:03:49] [INFO ] Computed 551 invariants in 11 ms
[2024-05-29 23:03:49] [INFO ] State equation strengthened by 49 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 91/147 variables, 59/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 91/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/147 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1105/1252 variables, 492/698 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1252 variables, 1105/1803 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1252 variables, 0/1803 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 901/2153 variables, 1252/3055 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2153 variables, 49/3104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2153 variables, 0/3104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/2153 variables, 0/3104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2153/2153 variables, and 3104 constraints, problems are : Problem set: 0 solved, 1 unsolved in 667 ms.
Refiners :[Domain max(s): 1252/1252 constraints, Positive P Invariants (semi-flows): 551/551 constraints, State Equation: 1252/1252 constraints, ReadFeed: 49/49 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/56 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 91/147 variables, 59/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 91/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/147 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1105/1252 variables, 492/698 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1252 variables, 1105/1803 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1252 variables, 0/1803 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 901/2153 variables, 1252/3055 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2153 variables, 49/3104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2153 variables, 1/3105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-29 23:03:51] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/2153 variables, 1/3106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2153 variables, 0/3106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/2153 variables, 0/3106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2153/2153 variables, and 3106 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1396 ms.
Refiners :[Domain max(s): 1252/1252 constraints, Positive P Invariants (semi-flows): 551/551 constraints, State Equation: 1252/1252 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 2099ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1587 ms.
Support contains 56 out of 1252 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1252/1252 places, 901/901 transitions.
Applied a total of 0 rules in 58 ms. Remains 1252 /1252 variables (removed 0) and now considering 901/901 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 1252/1252 places, 901/901 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1252/1252 places, 901/901 transitions.
Applied a total of 0 rules in 81 ms. Remains 1252 /1252 variables (removed 0) and now considering 901/901 (removed 0) transitions.
[2024-05-29 23:03:53] [INFO ] Invariant cache hit.
[2024-05-29 23:03:54] [INFO ] Implicit Places using invariants in 827 ms returned [1245]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 834 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1251/1252 places, 901/901 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 1251 transition count 899
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1249 transition count 899
Applied a total of 4 rules in 90 ms. Remains 1249 /1251 variables (removed 2) and now considering 899/901 (removed 2) transitions.
// Phase 1: matrix 899 rows 1249 cols
[2024-05-29 23:03:54] [INFO ] Computed 550 invariants in 5 ms
[2024-05-29 23:03:55] [INFO ] Implicit Places using invariants in 696 ms returned [1231, 1235]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 700 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1247/1252 places, 899/901 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1245 transition count 897
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1245 transition count 897
Applied a total of 4 rules in 177 ms. Remains 1245 /1247 variables (removed 2) and now considering 897/899 (removed 2) transitions.
// Phase 1: matrix 897 rows 1245 cols
[2024-05-29 23:03:55] [INFO ] Computed 548 invariants in 3 ms
[2024-05-29 23:03:55] [INFO ] Implicit Places using invariants in 571 ms returned []
[2024-05-29 23:03:55] [INFO ] Invariant cache hit.
[2024-05-29 23:03:56] [INFO ] State equation strengthened by 47 read => feed constraints.
[2024-05-29 23:03:57] [INFO ] Implicit Places using invariants and state equation in 2002 ms returned []
Implicit Place search using SMT with State Equation took 2575 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 1245/1252 places, 897/901 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 4458 ms. Remains : 1245/1252 places, 897/901 transitions.
RANDOM walk for 40000 steps (8 resets) in 592 ms. (67 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 445 ms. (89 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 231708 steps, run timeout after 3001 ms. (steps per millisecond=77 ) properties seen :0 out of 1
Probabilistic random walk after 231708 steps, saw 226764 distinct states, run finished after 3001 ms. (steps per millisecond=77 ) properties seen :0
[2024-05-29 23:04:01] [INFO ] Invariant cache hit.
[2024-05-29 23:04:01] [INFO ] State equation strengthened by 47 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 91/147 variables, 59/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1098/1245 variables, 489/548 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1245 variables, 0/548 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 897/2142 variables, 1245/1793 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2142 variables, 47/1840 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2142 variables, 0/1840 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/2142 variables, 0/1840 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2142/2142 variables, and 1840 constraints, problems are : Problem set: 0 solved, 1 unsolved in 563 ms.
Refiners :[Positive P Invariants (semi-flows): 548/548 constraints, State Equation: 1245/1245 constraints, ReadFeed: 47/47 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/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 91/147 variables, 59/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1098/1245 variables, 489/548 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1245 variables, 0/548 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 897/2142 variables, 1245/1793 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2142 variables, 47/1840 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2142 variables, 1/1841 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2142 variables, 0/1841 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-29 23:04:03] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/2142 variables, 1/1842 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2142 variables, 0/1842 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/2142 variables, 0/1842 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2142/2142 variables, and 1842 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1587 ms.
Refiners :[Positive P Invariants (semi-flows): 548/548 constraints, State Equation: 1245/1245 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 2169ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1801 ms.
Support contains 56 out of 1245 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1245/1245 places, 897/897 transitions.
Applied a total of 0 rules in 50 ms. Remains 1245 /1245 variables (removed 0) and now considering 897/897 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 1245/1245 places, 897/897 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1245/1245 places, 897/897 transitions.
Applied a total of 0 rules in 43 ms. Remains 1245 /1245 variables (removed 0) and now considering 897/897 (removed 0) transitions.
[2024-05-29 23:04:05] [INFO ] Invariant cache hit.
[2024-05-29 23:04:05] [INFO ] Implicit Places using invariants in 560 ms returned []
[2024-05-29 23:04:05] [INFO ] Invariant cache hit.
[2024-05-29 23:04:06] [INFO ] State equation strengthened by 47 read => feed constraints.
[2024-05-29 23:04:07] [INFO ] Implicit Places using invariants and state equation in 2097 ms returned []
Implicit Place search using SMT with State Equation took 2660 ms to find 0 implicit places.
[2024-05-29 23:04:08] [INFO ] Redundant transitions in 47 ms returned []
Running 896 sub problems to find dead transitions.
[2024-05-29 23:04:08] [INFO ] Invariant cache hit.
[2024-05-29 23:04:08] [INFO ] State equation strengthened by 47 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1244 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 896 unsolved
At refinement iteration 1 (OVERLAPS) 1/1245 variables, 548/548 constraints. Problems are: Problem set: 0 solved, 896 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1245/2142 variables, and 548 constraints, problems are : Problem set: 0 solved, 896 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 548/548 constraints, State Equation: 0/1245 constraints, ReadFeed: 0/47 constraints, PredecessorRefiner: 896/896 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 896 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1244 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 896 unsolved
At refinement iteration 1 (OVERLAPS) 1/1245 variables, 548/548 constraints. Problems are: Problem set: 0 solved, 896 unsolved
[2024-05-29 23:04:57] [INFO ] Deduced a trap composed of 8 places in 71 ms of which 2 ms to minimize.
[2024-05-29 23:04:57] [INFO ] Deduced a trap composed of 8 places in 65 ms of which 2 ms to minimize.
[2024-05-29 23:04:57] [INFO ] Deduced a trap composed of 7 places in 61 ms of which 2 ms to minimize.
[2024-05-29 23:04:57] [INFO ] Deduced a trap composed of 7 places in 101 ms of which 4 ms to minimize.
[2024-05-29 23:04:58] [INFO ] Deduced a trap composed of 7 places in 72 ms of which 2 ms to minimize.
[2024-05-29 23:04:58] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 2 ms to minimize.
[2024-05-29 23:04:58] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 2 ms to minimize.
[2024-05-29 23:04:58] [INFO ] Deduced a trap composed of 7 places in 69 ms of which 1 ms to minimize.
[2024-05-29 23:04:58] [INFO ] Deduced a trap composed of 6 places in 60 ms of which 2 ms to minimize.
[2024-05-29 23:04:58] [INFO ] Deduced a trap composed of 6 places in 69 ms of which 1 ms to minimize.
[2024-05-29 23:04:58] [INFO ] Deduced a trap composed of 6 places in 73 ms of which 2 ms to minimize.
[2024-05-29 23:04:58] [INFO ] Deduced a trap composed of 6 places in 72 ms of which 1 ms to minimize.
[2024-05-29 23:04:58] [INFO ] Deduced a trap composed of 6 places in 66 ms of which 2 ms to minimize.
[2024-05-29 23:04:59] [INFO ] Deduced a trap composed of 7 places in 70 ms of which 2 ms to minimize.
[2024-05-29 23:04:59] [INFO ] Deduced a trap composed of 6 places in 75 ms of which 2 ms to minimize.
[2024-05-29 23:04:59] [INFO ] Deduced a trap composed of 6 places in 70 ms of which 2 ms to minimize.
[2024-05-29 23:04:59] [INFO ] Deduced a trap composed of 8 places in 86 ms of which 2 ms to minimize.
[2024-05-29 23:04:59] [INFO ] Deduced a trap composed of 7 places in 81 ms of which 2 ms to minimize.
[2024-05-29 23:04:59] [INFO ] Deduced a trap composed of 6 places in 82 ms of which 3 ms to minimize.
[2024-05-29 23:04:59] [INFO ] Deduced a trap composed of 7 places in 86 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1245 variables, 20/568 constraints. Problems are: Problem set: 0 solved, 896 unsolved
[2024-05-29 23:05:04] [INFO ] Deduced a trap composed of 7 places in 85 ms of which 3 ms to minimize.
[2024-05-29 23:05:04] [INFO ] Deduced a trap composed of 7 places in 85 ms of which 1 ms to minimize.
[2024-05-29 23:05:05] [INFO ] Deduced a trap composed of 7 places in 87 ms of which 2 ms to minimize.
[2024-05-29 23:05:05] [INFO ] Deduced a trap composed of 7 places in 88 ms of which 2 ms to minimize.
[2024-05-29 23:05:05] [INFO ] Deduced a trap composed of 6 places in 86 ms of which 2 ms to minimize.
[2024-05-29 23:05:05] [INFO ] Deduced a trap composed of 6 places in 89 ms of which 2 ms to minimize.
[2024-05-29 23:05:05] [INFO ] Deduced a trap composed of 7 places in 90 ms of which 3 ms to minimize.
[2024-05-29 23:05:05] [INFO ] Deduced a trap composed of 6 places in 91 ms of which 2 ms to minimize.
[2024-05-29 23:05:05] [INFO ] Deduced a trap composed of 6 places in 90 ms of which 3 ms to minimize.
[2024-05-29 23:05:05] [INFO ] Deduced a trap composed of 7 places in 93 ms of which 3 ms to minimize.
[2024-05-29 23:05:06] [INFO ] Deduced a trap composed of 7 places in 96 ms of which 6 ms to minimize.
[2024-05-29 23:05:06] [INFO ] Deduced a trap composed of 7 places in 91 ms of which 2 ms to minimize.
[2024-05-29 23:05:06] [INFO ] Deduced a trap composed of 7 places in 99 ms of which 2 ms to minimize.
[2024-05-29 23:05:06] [INFO ] Deduced a trap composed of 7 places in 102 ms of which 2 ms to minimize.
[2024-05-29 23:05:06] [INFO ] Deduced a trap composed of 8 places in 107 ms of which 2 ms to minimize.
[2024-05-29 23:05:06] [INFO ] Deduced a trap composed of 7 places in 104 ms of which 2 ms to minimize.
[2024-05-29 23:05:06] [INFO ] Deduced a trap composed of 7 places in 109 ms of which 3 ms to minimize.
[2024-05-29 23:05:07] [INFO ] Deduced a trap composed of 7 places in 106 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1245/2142 variables, and 586 constraints, problems are : Problem set: 0 solved, 896 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 548/548 constraints, State Equation: 0/1245 constraints, ReadFeed: 0/47 constraints, PredecessorRefiner: 0/896 constraints, Known Traps: 38/38 constraints]
After SMT, in 60400ms problems are : Problem set: 0 solved, 896 unsolved
Search for dead transitions found 0 dead transitions in 60412ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63173 ms. Remains : 1245/1245 places, 897/897 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 43 times.
Drop transitions (Partial Free agglomeration) removed 43 transitions
Iterating global reduction 0 with 43 rules applied. Total rules applied 43 place count 1245 transition count 897
Drop transitions (Redundant composition of simpler transitions.) removed 43 transitions
Redundant transition composition rules discarded 43 transitions
Iterating global reduction 0 with 43 rules applied. Total rules applied 86 place count 1245 transition count 854
Applied a total of 86 rules in 98 ms. Remains 1245 /1245 variables (removed 0) and now considering 854/897 (removed 43) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 854 rows 1245 cols
[2024-05-29 23:05:08] [INFO ] Computed 548 invariants in 3 ms
[2024-05-29 23:05:08] [INFO ] After 299ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 23:05:09] [INFO ] [Nat]Absence check using 548 positive place invariants in 70 ms returned sat
[2024-05-29 23:05:09] [INFO ] After 556ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-29 23:05:10] [INFO ] Deduced a trap composed of 7 places in 204 ms of which 1 ms to minimize.
[2024-05-29 23:05:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 291 ms
TRAPS : Iteration 1
[2024-05-29 23:05:10] [INFO ] After 1298ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-29 23:05:10] [INFO ] After 1807ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2024-05-29 23:05:10] [INFO ] Flatten gal took : 80 ms
[2024-05-29 23:05:10] [INFO ] Flatten gal took : 87 ms
[2024-05-29 23:05:10] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9050958685186331374.gal : 19 ms
[2024-05-29 23:05:10] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16943828766518527931.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/ReachabilityCardinality9050958685186331374.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16943828766518527931.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 ...329
Loading property file /tmp/ReachabilityCardinality16943828766518527931.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :2 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 24
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :24 after 49
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :49 after 99
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :99 after 300
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :300 after 66269
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :66269 after 796784
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :796784 after 1.2342e+07
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1.2342e+07 after 5.79666e+09
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :5.79666e+09 after 7.95865e+12
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :7.95865e+12 after 2.2145e+16
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :2.2145e+16 after 7.04361e+20
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :7.04361e+20 after 7.0084e+27
Detected timeout of ITS tools.
[2024-05-29 23:05:25] [INFO ] Flatten gal took : 51 ms
[2024-05-29 23:05:25] [INFO ] Applying decomposition
[2024-05-29 23:05:26] [INFO ] Flatten gal took : 46 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/graph3340951688248916993.txt' '-o' '/tmp/graph3340951688248916993.bin' '-w' '/tmp/graph3340951688248916993.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3340951688248916993.bin' '-l' '-1' '-v' '-w' '/tmp/graph3340951688248916993.weights' '-q' '0' '-e' '0.001'
[2024-05-29 23:05:26] [INFO ] Decomposing Gal with order
[2024-05-29 23:05:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 23:05:26] [INFO ] Removed a total of 278 redundant transitions.
[2024-05-29 23:05:26] [INFO ] Flatten gal took : 156 ms
[2024-05-29 23:05:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 32 labels/synchronizations in 158 ms.
[2024-05-29 23:05:26] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9386809089782292517.gal : 34 ms
[2024-05-29 23:05:26] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6406814084426315925.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/ReachabilityCardinality9386809089782292517.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6406814084426315925.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/ReachabilityCardinality6406814084426315925.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :7 after 7
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :7 after 7
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :7 after 7
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :7 after 7.1168e+06
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 33616 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-29 23:05:42] [INFO ] Flatten gal took : 42 ms
[2024-05-29 23:05:42] [INFO ] Applying decomposition
[2024-05-29 23:05:42] [INFO ] Flatten gal took : 41 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/graph13481067488895280254.txt' '-o' '/tmp/graph13481067488895280254.bin' '-w' '/tmp/graph13481067488895280254.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13481067488895280254.bin' '-l' '-1' '-v' '-w' '/tmp/graph13481067488895280254.weights' '-q' '0' '-e' '0.001'
[2024-05-29 23:05:42] [INFO ] Decomposing Gal with order
[2024-05-29 23:05:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 23:05:42] [INFO ] Removed a total of 150 redundant transitions.
[2024-05-29 23:05:42] [INFO ] Flatten gal took : 55 ms
[2024-05-29 23:05:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 20 labels/synchronizations in 48 ms.
[2024-05-29 23:05:42] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14522292076924683244.gal : 13 ms
[2024-05-29 23:05:42] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality367618098322086490.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/ReachabilityCardinality14522292076924683244.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality367618098322086490.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/ReachabilityCardinality367618098322086490.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 10
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :10 after 10
Invariant property ShieldPPPt-PT-050A-ReachabilityCardinality-2024-08 does not hold.
FORMULA ShieldPPPt-PT-050A-ReachabilityCardinality-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 9 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,4.05648e+179,49.7437,1185160,1107,31,2.00627e+06,238,1282,6.96628e+06,33,1000,0
Total reachable state count : 4.056481920730334085229267073794590171279e+179

Verifying 1 reachability properties.
Invariant property ShieldPPPt-PT-050A-ReachabilityCardinality-2024-08 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ShieldPPPt-PT-050A-ReachabilityCardinality-2024-08,2.425e+177,49.9853,1185160,10899,38,2.00627e+06,238,1550,6.96628e+06,54,1000,0
All properties solved without resorting to model-checking.
Total runtime 204191 ms.

BK_STOP 1717023992586

--------------------
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="ShieldPPPt-PT-050A"
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 ShieldPPPt-PT-050A, 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-171683761600678"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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