About the Execution of ITS-Tools for DES-PT-20b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 2855.159 | 1926524.00 | 2169539.00 | 5435.10 | TFFFTFFFFTFTTTTT | 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.r092-tall-171624189800694.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 DES-PT-20b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r092-tall-171624189800694
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 15:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 18:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 08:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 144K Apr 12 08:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Apr 12 08:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Apr 12 08:23 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Apr 22 14:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 91K May 18 16:42 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 DES-PT-20b-ReachabilityCardinality-2024-00
FORMULA_NAME DES-PT-20b-ReachabilityCardinality-2024-01
FORMULA_NAME DES-PT-20b-ReachabilityCardinality-2024-02
FORMULA_NAME DES-PT-20b-ReachabilityCardinality-2024-03
FORMULA_NAME DES-PT-20b-ReachabilityCardinality-2024-04
FORMULA_NAME DES-PT-20b-ReachabilityCardinality-2024-05
FORMULA_NAME DES-PT-20b-ReachabilityCardinality-2024-06
FORMULA_NAME DES-PT-20b-ReachabilityCardinality-2024-07
FORMULA_NAME DES-PT-20b-ReachabilityCardinality-2024-08
FORMULA_NAME DES-PT-20b-ReachabilityCardinality-2024-09
FORMULA_NAME DES-PT-20b-ReachabilityCardinality-2024-10
FORMULA_NAME DES-PT-20b-ReachabilityCardinality-2024-11
FORMULA_NAME DES-PT-20b-ReachabilityCardinality-2024-12
FORMULA_NAME DES-PT-20b-ReachabilityCardinality-2024-13
FORMULA_NAME DES-PT-20b-ReachabilityCardinality-2024-14
FORMULA_NAME DES-PT-20b-ReachabilityCardinality-2024-15
=== Now, execution of the tool begins
BK_START 1716348160185
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-20b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202405141337
[2024-05-22 03:22:41] [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-22 03:22:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 03:22:41] [INFO ] Load time of PNML (sax parser for PT used): 87 ms
[2024-05-22 03:22:41] [INFO ] Transformed 360 places.
[2024-05-22 03:22:41] [INFO ] Transformed 311 transitions.
[2024-05-22 03:22:41] [INFO ] Found NUPN structural information;
[2024-05-22 03:22:41] [INFO ] Parsed PT model containing 360 places and 311 transitions and 987 arcs in 187 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 20 ms.
Working with output stream class java.io.PrintStream
FORMULA DES-PT-20b-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-20b-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-20b-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-22 03:22:42] [INFO ] Flatten gal took : 123 ms
[2024-05-22 03:22:42] [INFO ] Flatten gal took : 74 ms
[2024-05-22 03:22:42] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9332159189219079097.gal : 22 ms
[2024-05-22 03:22:42] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2208360695469912537.prop : 7 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/ReachabilityCardinality9332159189219079097.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2208360695469912537.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 ...328
RANDOM walk for 40000 steps (338 resets) in 2057 ms. (19 steps per ms) remains 3/13 properties
FORMULA DES-PT-20b-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20b-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20b-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20b-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20b-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20b-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20b-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20b-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20b-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20b-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Loading property file /tmp/ReachabilityCardinality2208360695469912537.prop.
SDD proceeding with computation,13 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,13 properties remain. new max is 8
SDD size :3 after 4
SDD proceeding with computation,13 properties remain. new max is 16
SDD size :4 after 16
SDD proceeding with computation,13 properties remain. new max is 32
SDD size :16 after 19
SDD proceeding with computation,13 properties remain. new max is 64
SDD size :19 after 35
SDD proceeding with computation,13 properties remain. new max is 128
SDD size :35 after 169
SDD proceeding with computation,13 properties remain. new max is 256
SDD size :169 after 235
BEST_FIRST walk for 40003 steps (56 resets) in 776 ms. (51 steps per ms) remains 3/3 properties
SDD proceeding with computation,13 properties remain. new max is 512
SDD size :235 after 1349
BEST_FIRST walk for 40004 steps (49 resets) in 266 ms. (149 steps per ms) remains 3/3 properties
SDD proceeding with computation,13 properties remain. new max is 1024
SDD size :1349 after 22055
BEST_FIRST walk for 40004 steps (45 resets) in 143 ms. (277 steps per ms) remains 3/3 properties
Reachability property DES-PT-20b-ReachabilityCardinality-2024-15 is true.
Reachability property DES-PT-20b-ReachabilityCardinality-2024-13 is true.
SDD proceeding with computation,11 properties remain. new max is 1024
SDD size :22055 after 206107
// Phase 1: matrix 311 rows 360 cols
[2024-05-22 03:22:42] [INFO ] Computed 65 invariants in 32 ms
Invariant property DES-PT-20b-ReachabilityCardinality-2024-08 does not hold.
SDD proceeding with computation,10 properties remain. new max is 1024
SDD size :206107 after 326743
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Invariant property DES-PT-20b-ReachabilityCardinality-2024-06 does not hold.
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Invariant property DES-PT-20b-ReachabilityCardinality-2024-02 does not hold.
SDD proceeding with computation,8 properties remain. new max is 1024
SDD size :326743 after 1.80704e+08
At refinement iteration 2 (OVERLAPS) 229/268 variables, 34/73 constraints. Problems are: Problem set: 0 solved, 3 unsolved
SDD proceeding with computation,8 properties remain. new max is 2048
SDD size :1.80704e+08 after 1.80917e+08
At refinement iteration 3 (INCLUDED_ONLY) 0/268 variables, 229/302 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/268 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 27/295 variables, 5/307 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/295 variables, 27/334 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/295 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 65/360 variables, 26/360 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/360 variables, 65/425 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/360 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 311/671 variables, 360/785 constraints. Problems are: Problem set: 0 solved, 3 unsolved
SDD proceeding with computation,8 properties remain. new max is 4096
SDD size :1.80917e+08 after 1.84846e+08
At refinement iteration 12 (INCLUDED_ONLY) 0/671 variables, 0/785 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/671 variables, 0/785 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 671/671 variables, and 785 constraints, problems are : Problem set: 0 solved, 3 unsolved in 618 ms.
Refiners :[Domain max(s): 360/360 constraints, Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 360/360 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 229/268 variables, 34/73 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/268 variables, 229/302 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/268 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 27/295 variables, 5/307 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/295 variables, 27/334 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/295 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 65/360 variables, 26/360 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/360 variables, 65/425 constraints. Problems are: Problem set: 0 solved, 3 unsolved
SDD proceeding with computation,8 properties remain. new max is 8192
SDD size :1.84846e+08 after 4.20252e+08
At refinement iteration 10 (INCLUDED_ONLY) 0/360 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 311/671 variables, 360/785 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Reachability property DES-PT-20b-ReachabilityCardinality-2024-14 is true.
At refinement iteration 12 (INCLUDED_ONLY) 0/671 variables, 3/788 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 03:22:44] [INFO ] Deduced a trap composed of 32 places in 154 ms of which 27 ms to minimize.
[2024-05-22 03:22:45] [INFO ] Deduced a trap composed of 15 places in 115 ms of which 2 ms to minimize.
[2024-05-22 03:22:45] [INFO ] Deduced a trap composed of 19 places in 120 ms of which 3 ms to minimize.
[2024-05-22 03:22:45] [INFO ] Deduced a trap composed of 27 places in 183 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/671 variables, 4/792 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/671 variables, 0/792 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/671 variables, 0/792 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 671/671 variables, and 792 constraints, problems are : Problem set: 0 solved, 3 unsolved in 4309 ms.
Refiners :[Domain max(s): 360/360 constraints, Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 360/360 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 4/4 constraints]
After SMT, in 5013ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 4812 ms.
Support contains 39 out of 360 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 360/360 places, 311/311 transitions.
Graph (complete) has 741 edges and 360 vertex of which 349 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.2 ms
Discarding 11 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 349 transition count 290
Reduce places removed 14 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 17 rules applied. Total rules applied 34 place count 335 transition count 287
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 37 place count 332 transition count 287
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 37 place count 332 transition count 279
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 53 place count 324 transition count 279
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 69 place count 308 transition count 263
Iterating global reduction 3 with 16 rules applied. Total rules applied 85 place count 308 transition count 263
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 97 place count 296 transition count 251
Iterating global reduction 3 with 12 rules applied. Total rules applied 109 place count 296 transition count 251
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 119 place count 296 transition count 241
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 119 place count 296 transition count 239
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 123 place count 294 transition count 239
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 1 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 4 with 128 rules applied. Total rules applied 251 place count 230 transition count 175
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 253 place count 229 transition count 175
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 254 place count 229 transition count 174
Free-agglomeration rule applied 6 times.
Iterating global reduction 4 with 6 rules applied. Total rules applied 260 place count 229 transition count 168
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 266 place count 223 transition count 168
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 267 place count 222 transition count 167
Applied a total of 267 rules in 132 ms. Remains 222 /360 variables (removed 138) and now considering 167/311 (removed 144) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 142 ms. Remains : 222/360 places, 167/311 transitions.
RANDOM walk for 40000 steps (628 resets) in 925 ms. (43 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (120 resets) in 164 ms. (242 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (103 resets) in 107 ms. (370 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (110 resets) in 120 ms. (330 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 1055255 steps, run timeout after 3001 ms. (steps per millisecond=351 ) properties seen :0 out of 3
Probabilistic random walk after 1055255 steps, saw 139863 distinct states, run finished after 3008 ms. (steps per millisecond=350 ) properties seen :0
// Phase 1: matrix 167 rows 222 cols
[2024-05-22 03:22:56] [INFO ] Computed 61 invariants in 9 ms
[2024-05-22 03:22:56] [INFO ] State equation strengthened by 3 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 81/120 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 6/126 variables, 3/35 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 78/204 variables, 24/59 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/204 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 2/206 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/206 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 167/373 variables, 206/267 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/373 variables, 3/270 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/373 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 16/389 variables, 16/286 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/389 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/389 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 389/389 variables, and 286 constraints, problems are : Problem set: 0 solved, 3 unsolved in 288 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 222/222 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 81/120 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 03:22:56] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2024-05-22 03:22:56] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 03:22:56] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 6/126 variables, 3/38 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 78/204 variables, 24/62 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/204 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 2/206 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 03:22:56] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 1 ms to minimize.
[2024-05-22 03:22:56] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/206 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/206 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 167/373 variables, 206/272 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/373 variables, 3/275 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/373 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 16/389 variables, 16/291 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/389 variables, 3/294 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/389 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 0/389 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 389/389 variables, and 294 constraints, problems are : Problem set: 0 solved, 3 unsolved in 790 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 222/222 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 5/5 constraints]
After SMT, in 1103ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 2828 ms.
Support contains 39 out of 222 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 222/222 places, 167/167 transitions.
Applied a total of 0 rules in 11 ms. Remains 222 /222 variables (removed 0) and now considering 167/167 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 222/222 places, 167/167 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 222/222 places, 167/167 transitions.
Applied a total of 0 rules in 7 ms. Remains 222 /222 variables (removed 0) and now considering 167/167 (removed 0) transitions.
[2024-05-22 03:23:00] [INFO ] Invariant cache hit.
[2024-05-22 03:23:00] [INFO ] Implicit Places using invariants in 144 ms returned []
[2024-05-22 03:23:00] [INFO ] Invariant cache hit.
[2024-05-22 03:23:00] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-22 03:23:00] [INFO ] Implicit Places using invariants and state equation in 305 ms returned []
Implicit Place search using SMT with State Equation took 460 ms to find 0 implicit places.
[2024-05-22 03:23:00] [INFO ] Redundant transitions in 9 ms returned []
Running 164 sub problems to find dead transitions.
[2024-05-22 03:23:00] [INFO ] Invariant cache hit.
[2024-05-22 03:23:00] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/219 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/219 variables, 13/19 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/219 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 3 (OVERLAPS) 2/221 variables, 31/50 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/221 variables, 11/61 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/221 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 6 (OVERLAPS) 167/388 variables, 221/282 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/388 variables, 3/285 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-05-22 03:23:05] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/388 variables, 1/286 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/388 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 10 (OVERLAPS) 1/389 variables, 1/287 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/389 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 164 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 0/389 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 164 unsolved
No progress, stopping.
After SMT solving in domain Real declared 389/389 variables, and 287 constraints, problems are : Problem set: 0 solved, 164 unsolved in 12473 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 222/222 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 164 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/219 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/219 variables, 13/19 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/219 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 3 (OVERLAPS) 2/221 variables, 31/50 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/221 variables, 11/61 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/221 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-05-22 03:23:13] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-05-22 03:23:14] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 1 ms to minimize.
[2024-05-22 03:23:14] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/221 variables, 3/65 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-05-22 03:23:14] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/221 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-05-22 03:23:16] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/221 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/221 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 10 (OVERLAPS) 167/388 variables, 221/288 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/388 variables, 3/291 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/388 variables, 164/455 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-05-22 03:23:19] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/388 variables, 1/456 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-05-22 03:23:23] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 1 ms to minimize.
[2024-05-22 03:23:24] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 1 ms to minimize.
[2024-05-22 03:23:24] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/388 variables, 3/459 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/388 variables, 0/459 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 16 (OVERLAPS) 1/389 variables, 1/460 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-05-22 03:23:40] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 2 ms to minimize.
[2024-05-22 03:23:41] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 1 ms to minimize.
[2024-05-22 03:23:41] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 389/389 variables, and 463 constraints, problems are : Problem set: 0 solved, 164 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 222/222 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 13/13 constraints]
After SMT, in 42565ms problems are : Problem set: 0 solved, 164 unsolved
Search for dead transitions found 0 dead transitions in 42569ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43053 ms. Remains : 222/222 places, 167/167 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (complete) has 679 edges and 222 vertex of which 221 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 6 ms. Remains 221 /222 variables (removed 1) and now considering 167/167 (removed 0) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 167 rows 221 cols
[2024-05-22 03:23:43] [INFO ] Computed 60 invariants in 13 ms
[2024-05-22 03:23:43] [INFO ] After 69ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-22 03:23:43] [INFO ] [Nat]Absence check using 35 positive place invariants in 14 ms returned sat
[2024-05-22 03:23:43] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 16 ms returned sat
[2024-05-22 03:23:43] [INFO ] After 160ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2024-05-22 03:23:43] [INFO ] Deduced a trap composed of 25 places in 68 ms of which 1 ms to minimize.
[2024-05-22 03:23:43] [INFO ] Deduced a trap composed of 28 places in 49 ms of which 1 ms to minimize.
[2024-05-22 03:23:43] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
[2024-05-22 03:23:43] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2024-05-22 03:23:43] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2024-05-22 03:23:43] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 317 ms
[2024-05-22 03:23:43] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
[2024-05-22 03:23:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 57 ms
TRAPS : Iteration 1
[2024-05-22 03:23:44] [INFO ] Deduced a trap composed of 7 places in 68 ms of which 1 ms to minimize.
[2024-05-22 03:23:44] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
[2024-05-22 03:23:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 136 ms
TRAPS : Iteration 2
[2024-05-22 03:23:44] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 1 ms to minimize.
[2024-05-22 03:23:44] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 1 ms to minimize.
[2024-05-22 03:23:44] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2024-05-22 03:23:44] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 5 ms to minimize.
[2024-05-22 03:23:44] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 2 ms to minimize.
[2024-05-22 03:23:44] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 2 ms to minimize.
[2024-05-22 03:23:44] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 1 ms to minimize.
[2024-05-22 03:23:44] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
[2024-05-22 03:23:44] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 584 ms
TRAPS : Iteration 3
[2024-05-22 03:23:44] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2024-05-22 03:23:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 43 ms
TRAPS : Iteration 4
[2024-05-22 03:23:45] [INFO ] After 1974ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2024-05-22 03:23:45] [INFO ] After 2177ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2024-05-22 03:23:45] [INFO ] Flatten gal took : 18 ms
[2024-05-22 03:23:45] [INFO ] Flatten gal took : 16 ms
[2024-05-22 03:23:45] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2977031007222958945.gal : 2 ms
[2024-05-22 03:23:45] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14605087614783119458.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/ReachabilityCardinality2977031007222958945.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14605087614783119458.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/ReachabilityCardinality14605087614783119458.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :5 after 12
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :12 after 17
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :17 after 154
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :154 after 226
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :226 after 1321
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :1321 after 110450
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :110450 after 169140
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :169140 after 403716
SDD proceeding with computation,3 properties remain. new max is 2048
SDD size :1.06562e+07 after 1.42017e+07
SDD proceeding with computation,3 properties remain. new max is 4096
SDD size :1.9179e+07 after 4.05323e+07
SDD proceeding with computation,3 properties remain. new max is 8192
SDD size :4.05323e+07 after 3.85223e+09
SDD proceeding with computation,3 properties remain. new max is 16384
SDD size :3.85223e+09 after 6.48604e+09
SDD proceeding with computation,3 properties remain. new max is 32768
SDD size :6.48604e+09 after 2.41691e+10
Detected timeout of ITS tools.
[2024-05-22 03:24:00] [INFO ] Flatten gal took : 14 ms
[2024-05-22 03:24:00] [INFO ] Applying decomposition
[2024-05-22 03:24:00] [INFO ] Flatten gal took : 14 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/graph17318622631824160675.txt' '-o' '/tmp/graph17318622631824160675.bin' '-w' '/tmp/graph17318622631824160675.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17318622631824160675.bin' '-l' '-1' '-v' '-w' '/tmp/graph17318622631824160675.weights' '-q' '0' '-e' '0.001'
[2024-05-22 03:24:00] [INFO ] Decomposing Gal with order
[2024-05-22 03:24:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 03:24:00] [INFO ] Removed a total of 29 redundant transitions.
[2024-05-22 03:24:00] [INFO ] Flatten gal took : 75 ms
[2024-05-22 03:24:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 9 ms.
[2024-05-22 03:24:00] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8550921039107882748.gal : 5 ms
[2024-05-22 03:24:00] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12266151854785601787.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/ReachabilityCardinality8550921039107882748.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12266151854785601787.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/ReachabilityCardinality12266151854785601787.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 10
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :10 after 18
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :18 after 162
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :162 after 190668
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :190668 after 5.37911e+06
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :5.37911e+06 after 1.49146e+10
Invariant property DES-PT-20b-ReachabilityCardinality-2024-07 does not hold.
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :1.49146e+10 after 2.94263e+10
Invariant property DES-PT-20b-ReachabilityCardinality-2024-05 does not hold.
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :2.94263e+10 after 1.27102e+11
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :4.67831e+13 after 5.31131e+13
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 32879 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-22 03:24:15] [INFO ] Flatten gal took : 19 ms
[2024-05-22 03:24:15] [INFO ] Applying decomposition
[2024-05-22 03:24:15] [INFO ] Flatten gal took : 15 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/graph4616059314624858779.txt' '-o' '/tmp/graph4616059314624858779.bin' '-w' '/tmp/graph4616059314624858779.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4616059314624858779.bin' '-l' '-1' '-v' '-w' '/tmp/graph4616059314624858779.weights' '-q' '0' '-e' '0.001'
[2024-05-22 03:24:16] [INFO ] Decomposing Gal with order
[2024-05-22 03:24:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 03:24:16] [INFO ] Removed a total of 31 redundant transitions.
[2024-05-22 03:24:16] [INFO ] Flatten gal took : 26 ms
[2024-05-22 03:24:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 8 ms.
[2024-05-22 03:24:16] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11427579156585886792.gal : 6 ms
[2024-05-22 03:24:16] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8890842647878017869.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/ReachabilityCardinality11427579156585886792.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8890842647878017869.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/ReachabilityCardinality8890842647878017869.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :1 after 4
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :4 after 149
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :149 after 49445
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :49445 after 3.52964e+09
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :3.52964e+09 after 1.08096e+13
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :2.26274e+17 after 2.95142e+17
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :1.9388e+20 after 1.93882e+20
Invariant property DES-PT-20b-ReachabilityCardinality-2024-07 does not hold.
FORMULA DES-PT-20b-ReachabilityCardinality-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1.60919e+21 after 1.60921e+21
Detected timeout of ITS tools.
[2024-05-22 03:54:16] [INFO ] Flatten gal took : 10 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin2025604711826399776
[2024-05-22 03:54:16] [INFO ] Applying decomposition
[2024-05-22 03:54:16] [INFO ] Flatten gal took : 8 ms
[2024-05-22 03:54:16] [INFO ] Computing symmetric may disable matrix : 167 transitions.
[2024-05-22 03:54:16] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 03:54:16] [INFO ] Computing symmetric may enable matrix : 167 transitions.
[2024-05-22 03:54:16] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
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/graph14760638266107395584.txt' '-o' '/tmp/graph14760638266107395584.bin' '-w' '/tmp/graph14760638266107395584.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14760638266107395584.bin' '-l' '-1' '-v' '-w' '/tmp/graph14760638266107395584.weights' '-q' '0' '-e' '0.001'
[2024-05-22 03:54:16] [INFO ] Decomposing Gal with order
[2024-05-22 03:54:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 03:54:16] [INFO ] Computing Do-Not-Accords matrix : 167 transitions.
[2024-05-22 03:54:16] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 03:54:16] [INFO ] Removed a total of 36 redundant transitions.
[2024-05-22 03:54:16] [INFO ] Flatten gal took : 13 ms
[2024-05-22 03:54:16] [INFO ] Built C files in 86ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2025604711826399776
[2024-05-22 03:54:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 4 ms.
[2024-05-22 03:54:16] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8010403953490899559.gal : 2 ms
Running compilation step : cd /tmp/ltsmin2025604711826399776;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '360' '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-22 03:54:16] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13396944221238539428.prop : 10 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/ReachabilityCardinality8010403953490899559.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13396944221238539428.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/ReachabilityCardinality13396944221238539428.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 14
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :14 after 162
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :162 after 170
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :170 after 746
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :746 after 490204
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :2.81911e+06 after 3.31122e+09
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :3.31122e+09 after 9.53053e+09
Invariant property DES-PT-20b-ReachabilityCardinality-2024-05 does not hold.
FORMULA DES-PT-20b-ReachabilityCardinality-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :9.53053e+09 after 1.88595e+10
Compilation finished in 602 ms.
Running link step : cd /tmp/ltsmin2025604711826399776;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin2025604711826399776;'/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' 'DESPT20bReachabilityCardinality202401==true'
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1.48806e+13 after 2.33821e+13
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :6.70545e+13 after 6.9027e+13
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,1.51514e+14,12.8575,129764,20162,1761,340262,9257,537,268519,259,53847,0
Total reachable state count : 151513812689933
Verifying 2 reachability properties.
Invariant property DES-PT-20b-ReachabilityCardinality-2024-01 does not hold.
FORMULA DES-PT-20b-ReachabilityCardinality-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DES-PT-20b-ReachabilityCardinality-2024-01,6.75611e+12,13.533,129764,4491,795,340262,9257,576,268519,276,53847,164715
Invariant property DES-PT-20b-ReachabilityCardinality-2024-05 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
DES-PT-20b-ReachabilityCardinality-2024-05,5.51901e+06,13.5395,129764,313,240,340262,9257,581,268519,276,53847,165513
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 1925308 ms.
BK_STOP 1716350086709
--------------------
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="DES-PT-20b"
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 DES-PT-20b, 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 r092-tall-171624189800694"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-20b.tgz
mv DES-PT-20b 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 '
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 ;