About the Execution of ITS-Tools for DES-PT-20a
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1752.647 | 146986.00 | 336330.00 | 205.30 | TTFTTTFFFFTFFTTT | 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-171624189800686.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-20a, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r092-tall-171624189800686
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 7.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K 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.3K Apr 22 14:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 22 14:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 08:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 169K Apr 12 08:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Apr 12 08:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 47K Apr 12 08:34 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 57K 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-20a-ReachabilityCardinality-2024-00
FORMULA_NAME DES-PT-20a-ReachabilityCardinality-2024-01
FORMULA_NAME DES-PT-20a-ReachabilityCardinality-2024-02
FORMULA_NAME DES-PT-20a-ReachabilityCardinality-2024-03
FORMULA_NAME DES-PT-20a-ReachabilityCardinality-2024-04
FORMULA_NAME DES-PT-20a-ReachabilityCardinality-2024-05
FORMULA_NAME DES-PT-20a-ReachabilityCardinality-2024-06
FORMULA_NAME DES-PT-20a-ReachabilityCardinality-2024-07
FORMULA_NAME DES-PT-20a-ReachabilityCardinality-2024-08
FORMULA_NAME DES-PT-20a-ReachabilityCardinality-2024-09
FORMULA_NAME DES-PT-20a-ReachabilityCardinality-2024-10
FORMULA_NAME DES-PT-20a-ReachabilityCardinality-2024-11
FORMULA_NAME DES-PT-20a-ReachabilityCardinality-2024-12
FORMULA_NAME DES-PT-20a-ReachabilityCardinality-2024-13
FORMULA_NAME DES-PT-20a-ReachabilityCardinality-2024-14
FORMULA_NAME DES-PT-20a-ReachabilityCardinality-2024-15
=== Now, execution of the tool begins
BK_START 1716347183168
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-20a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202405141337
[2024-05-22 03:06:24] [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:06:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 03:06:24] [INFO ] Load time of PNML (sax parser for PT used): 83 ms
[2024-05-22 03:06:24] [INFO ] Transformed 195 places.
[2024-05-22 03:06:24] [INFO ] Transformed 152 transitions.
[2024-05-22 03:06:24] [INFO ] Found NUPN structural information;
[2024-05-22 03:06:24] [INFO ] Parsed PT model containing 195 places and 152 transitions and 742 arcs in 184 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 30 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
FORMULA DES-PT-20a-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-20a-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-20a-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-20a-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (877 resets) in 1642 ms. (24 steps per ms) remains 9/12 properties
FORMULA DES-PT-20a-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20a-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20a-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (213 resets) in 599 ms. (66 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (218 resets) in 665 ms. (60 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (188 resets) in 259 ms. (153 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (188 resets) in 296 ms. (134 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (176 resets) in 218 ms. (182 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (180 resets) in 244 ms. (163 steps per ms) remains 9/9 properties
[2024-05-22 03:06:26] [INFO ] Flatten gal took : 312 ms
BEST_FIRST walk for 40004 steps (176 resets) in 142 ms. (279 steps per ms) remains 9/9 properties
[2024-05-22 03:06:26] [INFO ] Flatten gal took : 24 ms
BEST_FIRST walk for 40004 steps (264 resets) in 216 ms. (184 steps per ms) remains 9/9 properties
[2024-05-22 03:06:26] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7712617403299165679.gal : 33 ms
BEST_FIRST walk for 40004 steps (186 resets) in 158 ms. (251 steps per ms) remains 9/9 properties
[2024-05-22 03:06:26] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3555529088189209099.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/ReachabilityCardinality7712617403299165679.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3555529088189209099.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
Loading property file /tmp/ReachabilityCardinality3555529088189209099.prop.
// Phase 1: matrix 138 rows 195 cols
[2024-05-22 03:06:26] [INFO ] Computed 59 invariants in 27 ms
[2024-05-22 03:06:26] [INFO ] State equation strengthened by 1 read => feed constraints.
SDD proceeding with computation,9 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,9 properties remain. new max is 8
SDD size :3 after 5
SDD proceeding with computation,9 properties remain. new max is 16
SDD size :5 after 9
SDD proceeding with computation,9 properties remain. new max is 32
SDD size :9 after 11
SDD proceeding with computation,9 properties remain. new max is 64
SDD size :11 after 79
SDD proceeding with computation,9 properties remain. new max is 128
SDD size :79 after 657
SDD proceeding with computation,9 properties remain. new max is 256
SDD size :657 after 1741
SDD proceeding with computation,9 properties remain. new max is 512
SDD size :1741 after 3697
SDD proceeding with computation,9 properties remain. new max is 1024
SDD size :3697 after 121029
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 114/114 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/114 variables, 5/119 constraints. Problems are: Problem set: 0 solved, 9 unsolved
SDD proceeding with computation,9 properties remain. new max is 2048
SDD size :121029 after 566989
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 40/154 variables, 29/148 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 40/188 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/154 variables, 10/198 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 33/187 variables, 15/213 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/187 variables, 33/246 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/187 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 137/324 variables, 187/433 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/324 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/324 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (OVERLAPS) 9/333 variables, 8/442 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/333 variables, 8/450 constraints. Problems are: Problem set: 0 solved, 9 unsolved
SDD proceeding with computation,9 properties remain. new max is 4096
SDD size :566989 after 1.86423e+06
At refinement iteration 15 (INCLUDED_ONLY) 0/333 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (OVERLAPS) 0/333 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 333/333 variables, and 450 constraints, problems are : Problem set: 0 solved, 9 unsolved in 3802 ms.
Refiners :[Domain max(s): 195/195 constraints, Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 195/195 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 114/114 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/114 variables, 5/119 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-22 03:06:30] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 8 ms to minimize.
[2024-05-22 03:06:30] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 1 ms to minimize.
[2024-05-22 03:06:30] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 3/122 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/114 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 40/154 variables, 29/151 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/154 variables, 40/191 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 10/201 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-22 03:06:31] [INFO ] Deduced a trap composed of 11 places in 95 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/154 variables, 1/202 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-22 03:06:31] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/154 variables, 1/203 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/154 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 33/187 variables, 15/218 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/187 variables, 33/251 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/187 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem DES-PT-20a-ReachabilityCardinality-2024-05 is UNSAT
FORMULA DES-PT-20a-ReachabilityCardinality-2024-05 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 13 (OVERLAPS) 137/324 variables, 187/438 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/324 variables, 1/439 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/324 variables, 5/444 constraints. Problems are: Problem set: 1 solved, 8 unsolved
[2024-05-22 03:06:33] [INFO ] Deduced a trap composed of 9 places in 735 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/324 variables, 1/445 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/324 variables, 0/445 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 18 (OVERLAPS) 9/333 variables, 8/453 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/333 variables, 8/461 constraints. Problems are: Problem set: 1 solved, 8 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 333/333 variables, and 464 constraints, problems are : Problem set: 1 solved, 8 unsolved in 5018 ms.
Refiners :[Domain max(s): 195/195 constraints, Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 195/195 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 8/9 constraints, Known Traps: 6/6 constraints]
After SMT, in 9092ms problems are : Problem set: 1 solved, 8 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 99 out of 195 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 195/195 places, 138/138 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 195 transition count 137
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 3 place count 195 transition count 137
Applied a total of 3 rules in 30 ms. Remains 195 /195 variables (removed 0) and now considering 137/138 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 195/195 places, 137/138 transitions.
RANDOM walk for 40000 steps (732 resets) in 537 ms. (74 steps per ms) remains 7/8 properties
FORMULA DES-PT-20a-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (151 resets) in 185 ms. (215 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (134 resets) in 162 ms. (245 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (136 resets) in 212 ms. (187 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (137 resets) in 121 ms. (327 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (153 resets) in 143 ms. (277 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (170 resets) in 150 ms. (264 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (166 resets) in 141 ms. (281 steps per ms) remains 7/7 properties
// Phase 1: matrix 137 rows 195 cols
[2024-05-22 03:06:36] [INFO ] Computed 60 invariants in 10 ms
[2024-05-22 03:06:36] [INFO ] State equation strengthened by 2 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 98/98 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 4/102 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 45/143 variables, 30/132 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 45/177 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/143 variables, 9/186 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/143 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 44/187 variables, 17/203 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/187 variables, 44/247 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/187 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 137/324 variables, 187/434 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/324 variables, 2/436 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/324 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 8/332 variables, 8/444 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/332 variables, 8/452 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/332 variables, 0/452 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (OVERLAPS) 0/332 variables, 0/452 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 332/332 variables, and 452 constraints, problems are : Problem set: 0 solved, 7 unsolved in 1869 ms.
Refiners :[Domain max(s): 195/195 constraints, Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 195/195 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 98/98 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 4/102 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-22 03:06:38] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-05-22 03:06:38] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 2/104 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 45/143 variables, 30/134 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/143 variables, 45/179 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/143 variables, 9/188 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-22 03:06:38] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/143 variables, 1/189 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/143 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 44/187 variables, 17/206 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/187 variables, 44/250 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/187 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 137/324 variables, 187/437 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/324 variables, 2/439 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/324 variables, 3/442 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-22 03:06:39] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/324 variables, 1/443 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/324 variables, 0/443 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (OVERLAPS) 8/332 variables, 8/451 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/332 variables, 8/459 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/332 variables, 4/463 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-22 03:06:42] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 1 ms to minimize.
[2024-05-22 03:06:42] [INFO ] Deduced a trap composed of 15 places in 97 ms of which 2 ms to minimize.
[2024-05-22 03:06:43] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 1 ms to minimize.
[2024-05-22 03:06:43] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/332 variables, 4/467 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/332 variables, 0/467 constraints. Problems are: Problem set: 0 solved, 7 unsolved
SDD proceeding with computation,9 properties remain. new max is 8192
SDD size :1.86423e+06 after 1.48569e+07
At refinement iteration 22 (OVERLAPS) 0/332 variables, 0/467 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 332/332 variables, and 467 constraints, problems are : Problem set: 0 solved, 7 unsolved in 9613 ms.
Refiners :[Domain max(s): 195/195 constraints, Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 195/195 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 8/8 constraints]
After SMT, in 11520ms problems are : Problem set: 0 solved, 7 unsolved
FORMULA DES-PT-20a-ReachabilityCardinality-2024-11 FALSE TECHNIQUES PARIKH_WALK
FORMULA DES-PT-20a-ReachabilityCardinality-2024-14 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 2 properties in 4558 ms.
Support contains 82 out of 195 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 195/195 places, 137/137 transitions.
Applied a total of 0 rules in 8 ms. Remains 195 /195 variables (removed 0) and now considering 137/137 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 195/195 places, 137/137 transitions.
RANDOM walk for 40000 steps (722 resets) in 192 ms. (207 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (164 resets) in 113 ms. (350 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (130 resets) in 110 ms. (360 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (158 resets) in 130 ms. (305 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (136 resets) in 102 ms. (388 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (173 resets) in 96 ms. (412 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 535879 steps, run timeout after 3001 ms. (steps per millisecond=178 ) properties seen :0 out of 5
Probabilistic random walk after 535879 steps, saw 80300 distinct states, run finished after 3019 ms. (steps per millisecond=177 ) properties seen :0
[2024-05-22 03:06:55] [INFO ] Invariant cache hit.
[2024-05-22 03:06:55] [INFO ] State equation strengthened by 2 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 82/82 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 30/112 variables, 23/105 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 30/135 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 21/133 variables, 11/146 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/133 variables, 21/167 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/133 variables, 8/175 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/133 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 51/184 variables, 18/193 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/184 variables, 51/244 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/184 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 137/321 variables, 184/428 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/321 variables, 2/430 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/321 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 11/332 variables, 11/441 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/332 variables, 11/452 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/332 variables, 0/452 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (OVERLAPS) 0/332 variables, 0/452 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 332/332 variables, and 452 constraints, problems are : Problem set: 0 solved, 5 unsolved in 2406 ms.
Refiners :[Domain max(s): 195/195 constraints, Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 195/195 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 82/82 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 30/112 variables, 23/105 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 30/135 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 21/133 variables, 11/146 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/133 variables, 21/167 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/133 variables, 8/175 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-22 03:06:58] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/133 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/133 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 51/184 variables, 18/194 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/184 variables, 51/245 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/184 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 137/321 variables, 184/429 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/321 variables, 2/431 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/321 variables, 0/431 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 11/332 variables, 11/442 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/332 variables, 11/453 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/332 variables, 5/458 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/332 variables, 0/458 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (OVERLAPS) 0/332 variables, 0/458 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 332/332 variables, and 458 constraints, problems are : Problem set: 0 solved, 5 unsolved in 3478 ms.
Refiners :[Domain max(s): 195/195 constraints, Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 195/195 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 1/1 constraints]
After SMT, in 5926ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 0 properties in 12144 ms.
Support contains 82 out of 195 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 195/195 places, 137/137 transitions.
Applied a total of 0 rules in 20 ms. Remains 195 /195 variables (removed 0) and now considering 137/137 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 195/195 places, 137/137 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 195/195 places, 137/137 transitions.
Applied a total of 0 rules in 8 ms. Remains 195 /195 variables (removed 0) and now considering 137/137 (removed 0) transitions.
[2024-05-22 03:07:13] [INFO ] Invariant cache hit.
[2024-05-22 03:07:13] [INFO ] Implicit Places using invariants in 187 ms returned [92]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 211 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 194/195 places, 137/137 transitions.
Applied a total of 0 rules in 11 ms. Remains 194 /194 variables (removed 0) and now considering 137/137 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 232 ms. Remains : 194/195 places, 137/137 transitions.
RANDOM walk for 40000 steps (719 resets) in 197 ms. (202 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (142 resets) in 139 ms. (285 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (144 resets) in 87 ms. (454 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (148 resets) in 123 ms. (322 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (138 resets) in 72 ms. (548 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (171 resets) in 110 ms. (360 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 745645 steps, run timeout after 3001 ms. (steps per millisecond=248 ) properties seen :0 out of 5
Probabilistic random walk after 745645 steps, saw 108395 distinct states, run finished after 3001 ms. (steps per millisecond=248 ) properties seen :0
// Phase 1: matrix 137 rows 194 cols
[2024-05-22 03:07:17] [INFO ] Computed 59 invariants in 3 ms
[2024-05-22 03:07:17] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 82/82 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 30/112 variables, 23/105 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 30/135 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 20/132 variables, 10/145 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 20/165 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/132 variables, 8/173 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/132 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 51/183 variables, 18/191 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/183 variables, 51/242 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/183 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 137/320 variables, 183/425 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/320 variables, 1/426 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/320 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 11/331 variables, 11/437 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/331 variables, 11/448 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/331 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (OVERLAPS) 0/331 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 331/331 variables, and 448 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1262 ms.
Refiners :[Domain max(s): 194/194 constraints, Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 194/194 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 82/82 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 30/112 variables, 23/105 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 30/135 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 20/132 variables, 10/145 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 20/165 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/132 variables, 8/173 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-22 03:07:18] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/132 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/132 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 51/183 variables, 18/192 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/183 variables, 51/243 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/183 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 137/320 variables, 183/426 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/320 variables, 1/427 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/320 variables, 0/427 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 11/331 variables, 11/438 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/331 variables, 11/449 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/331 variables, 5/454 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/331 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (OVERLAPS) 0/331 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 331/331 variables, and 454 constraints, problems are : Problem set: 0 solved, 5 unsolved in 2953 ms.
Refiners :[Domain max(s): 194/194 constraints, Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 194/194 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 1/1 constraints]
After SMT, in 4255ms problems are : Problem set: 0 solved, 5 unsolved
FORMULA DES-PT-20a-ReachabilityCardinality-2024-12 FALSE TECHNIQUES PARIKH_WALK
FORMULA DES-PT-20a-ReachabilityCardinality-2024-09 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 2 properties in 2364 ms.
Support contains 48 out of 194 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 194/194 places, 137/137 transitions.
Applied a total of 0 rules in 12 ms. Remains 194 /194 variables (removed 0) and now considering 137/137 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 194/194 places, 137/137 transitions.
RANDOM walk for 40000 steps (707 resets) in 235 ms. (169 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (148 resets) in 131 ms. (303 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (147 resets) in 105 ms. (377 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (132 resets) in 64 ms. (615 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 697654 steps, run timeout after 3001 ms. (steps per millisecond=232 ) properties seen :0 out of 3
Probabilistic random walk after 697654 steps, saw 101337 distinct states, run finished after 3001 ms. (steps per millisecond=232 ) properties seen :0
[2024-05-22 03:07:26] [INFO ] Invariant cache hit.
[2024-05-22 03:07:26] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 32/80 variables, 19/67 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 32/99 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 29/109 variables, 14/113 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 29/142 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/109 variables, 3/145 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/109 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 69/178 variables, 23/168 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/178 variables, 69/237 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/178 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 137/315 variables, 178/415 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/315 variables, 1/416 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/315 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 16/331 variables, 16/432 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/331 variables, 16/448 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/331 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 0/331 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 331/331 variables, and 448 constraints, problems are : Problem set: 0 solved, 3 unsolved in 851 ms.
Refiners :[Domain max(s): 194/194 constraints, Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 194/194 constraints, ReadFeed: 1/1 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/48 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 32/80 variables, 19/67 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 32/99 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 29/109 variables, 14/113 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 29/142 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/109 variables, 3/145 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/109 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 69/178 variables, 23/168 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/178 variables, 69/237 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/178 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 137/315 variables, 178/415 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/315 variables, 1/416 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/315 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 16/331 variables, 16/432 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/331 variables, 16/448 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/331 variables, 3/451 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/331 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 03:07:29] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
At refinement iteration 19 (OVERLAPS) 0/331 variables, 1/452 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/331 variables, 0/452 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 0/331 variables, 0/452 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 331/331 variables, and 452 constraints, problems are : Problem set: 0 solved, 3 unsolved in 3020 ms.
Refiners :[Domain max(s): 194/194 constraints, Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 194/194 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
After SMT, in 3891ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 2470 ms.
Support contains 48 out of 194 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 194/194 places, 137/137 transitions.
Applied a total of 0 rules in 15 ms. Remains 194 /194 variables (removed 0) and now considering 137/137 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 194/194 places, 137/137 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 194/194 places, 137/137 transitions.
Applied a total of 0 rules in 6 ms. Remains 194 /194 variables (removed 0) and now considering 137/137 (removed 0) transitions.
[2024-05-22 03:07:33] [INFO ] Invariant cache hit.
[2024-05-22 03:07:33] [INFO ] Implicit Places using invariants in 157 ms returned []
[2024-05-22 03:07:33] [INFO ] Invariant cache hit.
[2024-05-22 03:07:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 03:07:33] [INFO ] Implicit Places using invariants and state equation in 246 ms returned []
Implicit Place search using SMT with State Equation took 406 ms to find 0 implicit places.
[2024-05-22 03:07:33] [INFO ] Redundant transitions in 7 ms returned []
Running 136 sub problems to find dead transitions.
[2024-05-22 03:07:33] [INFO ] Invariant cache hit.
[2024-05-22 03:07:33] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/193 variables, 193/193 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/193 variables, 13/206 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/193 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 136 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 1/194 variables, 33/239 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/194 variables, 1/240 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/194 variables, 13/253 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/194 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 7 (OVERLAPS) 137/331 variables, 194/447 constraints. Problems are: Problem set: 0 solved, 136 unsolved
SDD proceeding with computation,9 properties remain. new max is 16384
SDD size :4.5513e+07 after 5.12998e+07
At refinement iteration 8 (INCLUDED_ONLY) 0/331 variables, 1/448 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-22 03:07:36] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
[2024-05-22 03:07:37] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/331 variables, 2/450 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/331 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-22 03:07:40] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 2 ms to minimize.
[2024-05-22 03:07:40] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 2 ms to minimize.
[2024-05-22 03:07:40] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/331 variables, 3/453 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-22 03:07:42] [INFO ] Deduced a trap composed of 12 places in 77 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/331 variables, 1/454 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/331 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 14 (OVERLAPS) 0/331 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Real declared 331/331 variables, and 454 constraints, problems are : Problem set: 0 solved, 136 unsolved in 15788 ms.
Refiners :[Domain max(s): 194/194 constraints, Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 194/194 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 136 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/193 variables, 193/193 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/193 variables, 13/206 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/193 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (OVERLAPS) 1/194 variables, 33/239 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/194 variables, 1/240 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/194 variables, 13/253 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/194 variables, 6/259 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-22 03:07:50] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/194 variables, 1/260 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/194 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 9 (OVERLAPS) 137/331 variables, 194/454 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/331 variables, 1/455 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/331 variables, 136/591 constraints. Problems are: Problem set: 0 solved, 136 unsolved
SDD proceeding with computation,9 properties remain. new max is 32768
SDD size :5.12998e+07 after 6.33492e+07
At refinement iteration 12 (INCLUDED_ONLY) 0/331 variables, 0/591 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 13 (OVERLAPS) 0/331 variables, 0/591 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Int declared 331/331 variables, and 591 constraints, problems are : Problem set: 0 solved, 136 unsolved in 30020 ms.
Refiners :[Domain max(s): 194/194 constraints, Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 194/194 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 7/7 constraints]
After SMT, in 45856ms problems are : Problem set: 0 solved, 136 unsolved
Search for dead transitions found 0 dead transitions in 45858ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46288 ms. Remains : 194/194 places, 137/137 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 24 ms. Remains 194 /194 variables (removed 0) and now considering 137/137 (removed 0) transitions.
Running SMT prover for 3 properties.
[2024-05-22 03:08:19] [INFO ] Invariant cache hit.
[2024-05-22 03:08:19] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-22 03:08:19] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2024-05-22 03:08:19] [INFO ] [Nat]Absence check using 33 positive and 26 generalized place invariants in 10 ms returned sat
[2024-05-22 03:08:20] [INFO ] After 314ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2024-05-22 03:08:20] [INFO ] After 464ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2024-05-22 03:08:20] [INFO ] After 757ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2024-05-22 03:08:20] [INFO ] Flatten gal took : 13 ms
[2024-05-22 03:08:20] [INFO ] Flatten gal took : 13 ms
[2024-05-22 03:08:20] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6343788520996360637.gal : 3 ms
[2024-05-22 03:08:20] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11054861707594839146.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/ReachabilityCardinality6343788520996360637.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11054861707594839146.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/ReachabilityCardinality11054861707594839146.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 11
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :11 after 13
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :13 after 36
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :36 after 43
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :43 after 561
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :561 after 1595
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :1595 after 2941
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :15177 after 103265
SDD proceeding with computation,3 properties remain. new max is 2048
SDD size :103265 after 487061
SDD proceeding with computation,3 properties remain. new max is 4096
SDD size :487061 after 1.63996e+06
SDD proceeding with computation,3 properties remain. new max is 8192
SDD size :1.63996e+06 after 1.31344e+07
Detected timeout of ITS tools.
[2024-05-22 03:08:35] [INFO ] Flatten gal took : 12 ms
[2024-05-22 03:08:35] [INFO ] Applying decomposition
[2024-05-22 03:08:35] [INFO ] Flatten gal took : 12 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/graph16795607842779116742.txt' '-o' '/tmp/graph16795607842779116742.bin' '-w' '/tmp/graph16795607842779116742.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16795607842779116742.bin' '-l' '-1' '-v' '-w' '/tmp/graph16795607842779116742.weights' '-q' '0' '-e' '0.001'
[2024-05-22 03:08:35] [INFO ] Decomposing Gal with order
[2024-05-22 03:08:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 03:08:35] [INFO ] Removed a total of 37 redundant transitions.
[2024-05-22 03:08:35] [INFO ] Flatten gal took : 66 ms
[2024-05-22 03:08:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 23 labels/synchronizations in 16 ms.
[2024-05-22 03:08:35] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3279714967887852373.gal : 13 ms
[2024-05-22 03:08:35] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3432474354415125096.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/ReachabilityCardinality3279714967887852373.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3432474354415125096.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/ReachabilityCardinality3432474354415125096.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :3 after 5
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :5 after 9
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :9 after 12159
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :12159 after 2.14758e+08
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :2.14758e+08 after 3.41135e+08
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :3.41135e+08 after 5.51761e+08
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :9.16817e+10 after 2.8196e+11
Reachability property DES-PT-20a-ReachabilityCardinality-2024-03 is true.
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :2.95077e+12 after 3.29374e+12
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,5.96576e+12,6.61295,93400,10991,1285,229061,6382,388,269441,233,33295,0
Total reachable state count : 5965756192133
Verifying 3 reachability properties.
Reachability property DES-PT-20a-ReachabilityCardinality-2024-03 is true.
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-20a-ReachabilityCardinality-2024-03,8.3141e+07,6.88649,93660,101,176,229061,6382,548,269441,261,33295,89021
Invariant property DES-PT-20a-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
DES-PT-20a-ReachabilityCardinality-2024-08,1.66771e+10,6.94028,93660,1170,215,229061,6382,570,269441,264,33295,115742
Reachability property DES-PT-20a-ReachabilityCardinality-2024-10 is true.
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-20a-ReachabilityCardinality-2024-10,544896,6.94777,93660,154,257,229061,6382,576,269441,265,33295,116836
ITS tools runner thread asked to quit. Dying gracefully.
Over-approximation ignoring read arcs solved 0 properties in 23288 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-22 03:08:42] [INFO ] Flatten gal took : 14 ms
[2024-05-22 03:08:42] [INFO ] Applying decomposition
[2024-05-22 03:08:43] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph13798424326542972093.txt' '-o' '/tmp/graph13798424326542972093.bin' '-w' '/tmp/graph13798424326542972093.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13798424326542972093.bin' '-l' '-1' '-v' '-w' '/tmp/graph13798424326542972093.weights' '-q' '0' '-e' '0.001'
[2024-05-22 03:08:43] [INFO ] Decomposing Gal with order
[2024-05-22 03:08:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 03:08:43] [INFO ] Removed a total of 15 redundant transitions.
[2024-05-22 03:08:43] [INFO ] Flatten gal took : 16 ms
[2024-05-22 03:08:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 3 ms.
[2024-05-22 03:08:43] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8418018132330320301.gal : 3 ms
[2024-05-22 03:08:43] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14935962363465554831.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/ReachabilityCardinality8418018132330320301.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14935962363465554831.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/ReachabilityCardinality14935962363465554831.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :3 after 5
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :5 after 461
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :461 after 10755
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :10755 after 3.22605e+08
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :3.22605e+08 after 6.3379e+08
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :6.3379e+08 after 1.23875e+10
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :2.09429e+12 after 2.10177e+12
Reachability property DES-PT-20a-ReachabilityCardinality-2024-10 is true.
FORMULA DES-PT-20a-ReachabilityCardinality-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Reachability property DES-PT-20a-ReachabilityCardinality-2024-03 is true.
FORMULA DES-PT-20a-ReachabilityCardinality-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :4.85057e+12 after 5.30995e+12
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,7.96935e+12,6.75228,88180,6998,1777,233016,7100,382,155458,235,35331,0
Total reachable state count : 7969347823493
Verifying 3 reachability properties.
Reachability property DES-PT-20a-ReachabilityCardinality-2024-03 is true.
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-20a-ReachabilityCardinality-2024-03,1.52215e+06,6.97415,88444,83,150,233016,7100,542,155458,268,35331,63932
Invariant property DES-PT-20a-ReachabilityCardinality-2024-08 does not hold.
FORMULA DES-PT-20a-ReachabilityCardinality-2024-08 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-20a-ReachabilityCardinality-2024-08,48972,7.01203,88444,165,181,233016,7100,567,155458,270,35331,81013
Reachability property DES-PT-20a-ReachabilityCardinality-2024-10 is true.
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-20a-ReachabilityCardinality-2024-10,21312,7.01473,88444,117,236,233016,7100,580,155458,272,35331,81084
All properties solved without resorting to model-checking.
Total runtime 145719 ms.
BK_STOP 1716347330154
--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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-20a"
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-20a, 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-171624189800686"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-20a.tgz
mv DES-PT-20a 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 ;