About the Execution of ITS-Tools for Dekker-PT-050
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 823.876 | 72460.00 | 174677.00 | 357.40 | FFFTTTTTFTTFFTFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r133-smll-167819410000031.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is Dekker-PT-050, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r133-smll-167819410000031
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 7.3K Feb 26 01:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 26 01:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 26 01:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 26 01:49 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Feb 25 15:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 02:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 128K Feb 26 02:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Feb 26 02:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 98K Feb 26 02:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:56 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 1.5M Mar 5 18:22 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 Dekker-PT-050-ReachabilityFireability-00
FORMULA_NAME Dekker-PT-050-ReachabilityFireability-01
FORMULA_NAME Dekker-PT-050-ReachabilityFireability-02
FORMULA_NAME Dekker-PT-050-ReachabilityFireability-03
FORMULA_NAME Dekker-PT-050-ReachabilityFireability-04
FORMULA_NAME Dekker-PT-050-ReachabilityFireability-05
FORMULA_NAME Dekker-PT-050-ReachabilityFireability-06
FORMULA_NAME Dekker-PT-050-ReachabilityFireability-07
FORMULA_NAME Dekker-PT-050-ReachabilityFireability-08
FORMULA_NAME Dekker-PT-050-ReachabilityFireability-09
FORMULA_NAME Dekker-PT-050-ReachabilityFireability-10
FORMULA_NAME Dekker-PT-050-ReachabilityFireability-11
FORMULA_NAME Dekker-PT-050-ReachabilityFireability-12
FORMULA_NAME Dekker-PT-050-ReachabilityFireability-13
FORMULA_NAME Dekker-PT-050-ReachabilityFireability-14
FORMULA_NAME Dekker-PT-050-ReachabilityFireability-15
=== Now, execution of the tool begins
BK_START 1678257659452
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Dekker-PT-050
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202303021504
[2023-03-08 06:41:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-08 06:41:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 06:41:02] [INFO ] Load time of PNML (sax parser for PT used): 346 ms
[2023-03-08 06:41:02] [INFO ] Transformed 250 places.
[2023-03-08 06:41:03] [INFO ] Transformed 2600 transitions.
[2023-03-08 06:41:03] [INFO ] Found NUPN structural information;
[2023-03-08 06:41:03] [INFO ] Parsed PT model containing 250 places and 2600 transitions and 20100 arcs in 563 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 48 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
FORMULA Dekker-PT-050-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-050-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-050-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-050-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-050-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-050-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-08 06:41:04] [INFO ] Flatten gal took : 459 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1168 ms. (steps per millisecond=8 ) properties (out of 10) seen :8
FORMULA Dekker-PT-050-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Dekker-PT-050-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Dekker-PT-050-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Dekker-PT-050-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Dekker-PT-050-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Dekker-PT-050-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Dekker-PT-050-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Dekker-PT-050-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2023-03-08 06:41:04] [INFO ] Flatten gal took : 294 ms
[2023-03-08 06:41:04] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15981869638615171864.gal : 122 ms
[2023-03-08 06:41:04] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2310804366590334387.prop : 19 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.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15981869638615171864.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2310804366590334387.prop' '--nowitness' '--gen-order' 'FOLLOW'
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 291 ms. (steps per millisecond=34 ) properties (out of 2) seen :0
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 229 ms. (steps per millisecond=43 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-08 06:41:05] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 250 cols
[2023-03-08 06:41:05] [INFO ] Computed 150 place invariants in 31 ms
Loading property file /tmp/ReachabilityCardinality2310804366590334387.prop.
[2023-03-08 06:41:05] [INFO ] After 527ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
SDD proceeding with computation,10 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,10 properties remain. new max is 8
SDD size :4 after 16
SDD proceeding with computation,10 properties remain. new max is 16
SDD size :16 after 128
SDD proceeding with computation,10 properties remain. new max is 32
SDD size :128 after 8192
SDD proceeding with computation,10 properties remain. new max is 64
SDD size :8192 after 1.67772e+07
[2023-03-08 06:41:06] [INFO ] [Nat]Absence check using 100 positive place invariants in 42 ms returned sat
[2023-03-08 06:41:06] [INFO ] [Nat]Absence check using 100 positive and 50 generalized place invariants in 20 ms returned sat
[2023-03-08 06:41:07] [INFO ] After 798ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 06:41:07] [INFO ] State equation strengthened by 50 read => feed constraints.
[2023-03-08 06:41:07] [INFO ] After 461ms SMT Verify possible using 50 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-08 06:41:08] [INFO ] Deduced a trap composed of 4 places in 476 ms of which 12 ms to minimize.
[2023-03-08 06:41:08] [INFO ] Deduced a trap composed of 4 places in 389 ms of which 1 ms to minimize.
[2023-03-08 06:41:08] [INFO ] Deduced a trap composed of 5 places in 247 ms of which 1 ms to minimize.
[2023-03-08 06:41:09] [INFO ] Deduced a trap composed of 4 places in 432 ms of which 4 ms to minimize.
[2023-03-08 06:41:09] [INFO ] Deduced a trap composed of 4 places in 358 ms of which 1 ms to minimize.
[2023-03-08 06:41:10] [INFO ] Deduced a trap composed of 4 places in 149 ms of which 1 ms to minimize.
[2023-03-08 06:41:10] [INFO ] Deduced a trap composed of 4 places in 148 ms of which 2 ms to minimize.
[2023-03-08 06:41:10] [INFO ] Deduced a trap composed of 4 places in 236 ms of which 0 ms to minimize.
[2023-03-08 06:41:10] [INFO ] Deduced a trap composed of 4 places in 95 ms of which 1 ms to minimize.
[2023-03-08 06:41:11] [INFO ] Deduced a trap composed of 4 places in 679 ms of which 0 ms to minimize.
[2023-03-08 06:41:11] [INFO ] Deduced a trap composed of 4 places in 481 ms of which 1 ms to minimize.
[2023-03-08 06:41:12] [INFO ] Deduced a trap composed of 6 places in 472 ms of which 32 ms to minimize.
[2023-03-08 06:41:12] [INFO ] Deduced a trap composed of 4 places in 345 ms of which 1 ms to minimize.
[2023-03-08 06:41:12] [INFO ] Deduced a trap composed of 4 places in 90 ms of which 1 ms to minimize.
[2023-03-08 06:41:12] [INFO ] Deduced a trap composed of 6 places in 93 ms of which 0 ms to minimize.
[2023-03-08 06:41:13] [INFO ] Deduced a trap composed of 4 places in 90 ms of which 0 ms to minimize.
[2023-03-08 06:41:13] [INFO ] Deduced a trap composed of 6 places in 80 ms of which 1 ms to minimize.
[2023-03-08 06:41:13] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 1 ms to minimize.
[2023-03-08 06:41:13] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 0 ms to minimize.
[2023-03-08 06:41:13] [INFO ] Deduced a trap composed of 6 places in 97 ms of which 0 ms to minimize.
[2023-03-08 06:41:13] [INFO ] Deduced a trap composed of 4 places in 99 ms of which 0 ms to minimize.
[2023-03-08 06:41:13] [INFO ] Deduced a trap composed of 4 places in 90 ms of which 1 ms to minimize.
[2023-03-08 06:41:13] [INFO ] Deduced a trap composed of 4 places in 123 ms of which 0 ms to minimize.
[2023-03-08 06:41:13] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 1 ms to minimize.
[2023-03-08 06:41:13] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 0 ms to minimize.
[2023-03-08 06:41:14] [INFO ] Deduced a trap composed of 4 places in 114 ms of which 0 ms to minimize.
[2023-03-08 06:41:14] [INFO ] Deduced a trap composed of 6 places in 87 ms of which 0 ms to minimize.
[2023-03-08 06:41:14] [INFO ] Deduced a trap composed of 5 places in 82 ms of which 1 ms to minimize.
[2023-03-08 06:41:14] [INFO ] Deduced a trap composed of 5 places in 53 ms of which 2 ms to minimize.
[2023-03-08 06:41:14] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 1 ms to minimize.
[2023-03-08 06:41:14] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 1 ms to minimize.
[2023-03-08 06:41:14] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
[2023-03-08 06:41:14] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 0 ms to minimize.
[2023-03-08 06:41:14] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 1 ms to minimize.
[2023-03-08 06:41:14] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 7 ms to minimize.
[2023-03-08 06:41:14] [INFO ] Trap strengthening (SAT) tested/added 36/35 trap constraints in 7018 ms
[2023-03-08 06:41:15] [INFO ] Deduced a trap composed of 4 places in 260 ms of which 0 ms to minimize.
[2023-03-08 06:41:15] [INFO ] Deduced a trap composed of 4 places in 261 ms of which 1 ms to minimize.
[2023-03-08 06:41:15] [INFO ] Deduced a trap composed of 4 places in 247 ms of which 1 ms to minimize.
[2023-03-08 06:41:16] [INFO ] Deduced a trap composed of 4 places in 248 ms of which 1 ms to minimize.
[2023-03-08 06:41:16] [INFO ] Deduced a trap composed of 4 places in 268 ms of which 2 ms to minimize.
[2023-03-08 06:41:16] [INFO ] Deduced a trap composed of 5 places in 226 ms of which 0 ms to minimize.
[2023-03-08 06:41:16] [INFO ] Deduced a trap composed of 4 places in 276 ms of which 1 ms to minimize.
[2023-03-08 06:41:17] [INFO ] Deduced a trap composed of 4 places in 262 ms of which 1 ms to minimize.
[2023-03-08 06:41:17] [INFO ] Deduced a trap composed of 6 places in 262 ms of which 1 ms to minimize.
[2023-03-08 06:41:17] [INFO ] Deduced a trap composed of 4 places in 239 ms of which 1 ms to minimize.
[2023-03-08 06:41:17] [INFO ] Deduced a trap composed of 4 places in 208 ms of which 0 ms to minimize.
[2023-03-08 06:41:18] [INFO ] Deduced a trap composed of 6 places in 200 ms of which 1 ms to minimize.
[2023-03-08 06:41:18] [INFO ] Deduced a trap composed of 4 places in 237 ms of which 0 ms to minimize.
[2023-03-08 06:41:18] [INFO ] Deduced a trap composed of 4 places in 195 ms of which 1 ms to minimize.
[2023-03-08 06:41:18] [INFO ] Deduced a trap composed of 4 places in 179 ms of which 0 ms to minimize.
[2023-03-08 06:41:19] [INFO ] Deduced a trap composed of 4 places in 177 ms of which 2 ms to minimize.
[2023-03-08 06:41:19] [INFO ] Deduced a trap composed of 4 places in 167 ms of which 0 ms to minimize.
[2023-03-08 06:41:19] [INFO ] Deduced a trap composed of 4 places in 160 ms of which 0 ms to minimize.
[2023-03-08 06:41:19] [INFO ] Deduced a trap composed of 4 places in 169 ms of which 1 ms to minimize.
[2023-03-08 06:41:19] [INFO ] Deduced a trap composed of 4 places in 142 ms of which 1 ms to minimize.
[2023-03-08 06:41:20] [INFO ] Deduced a trap composed of 5 places in 177 ms of which 19 ms to minimize.
[2023-03-08 06:41:20] [INFO ] Deduced a trap composed of 4 places in 147 ms of which 1 ms to minimize.
[2023-03-08 06:41:20] [INFO ] Deduced a trap composed of 4 places in 137 ms of which 1 ms to minimize.
[2023-03-08 06:41:20] [INFO ] Deduced a trap composed of 4 places in 114 ms of which 1 ms to minimize.
[2023-03-08 06:41:20] [INFO ] Deduced a trap composed of 4 places in 108 ms of which 1 ms to minimize.
[2023-03-08 06:41:20] [INFO ] Deduced a trap composed of 4 places in 103 ms of which 1 ms to minimize.
[2023-03-08 06:41:20] [INFO ] Deduced a trap composed of 4 places in 105 ms of which 1 ms to minimize.
[2023-03-08 06:41:20] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 0 ms to minimize.
[2023-03-08 06:41:21] [INFO ] Deduced a trap composed of 6 places in 80 ms of which 1 ms to minimize.
[2023-03-08 06:41:21] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 1 ms to minimize.
[2023-03-08 06:41:21] [INFO ] Deduced a trap composed of 6 places in 65 ms of which 1 ms to minimize.
[2023-03-08 06:41:21] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 1 ms to minimize.
[2023-03-08 06:41:21] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 1 ms to minimize.
[2023-03-08 06:41:21] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 1 ms to minimize.
[2023-03-08 06:41:21] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 0 ms to minimize.
[2023-03-08 06:41:21] [INFO ] Trap strengthening (SAT) tested/added 36/35 trap constraints in 6524 ms
[2023-03-08 06:41:21] [INFO ] After 14398ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 385 ms.
[2023-03-08 06:41:21] [INFO ] After 16023ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 29 ms.
Support contains 134 out of 250 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 250/250 places, 2600/2600 transitions.
Applied a total of 0 rules in 319 ms. Remains 250 /250 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 323 ms. Remains : 250/250 places, 2600/2600 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 542 ms. (steps per millisecond=18 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 252 ms. (steps per millisecond=39 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 184773 steps, run timeout after 3001 ms. (steps per millisecond=61 ) properties seen :{}
Probabilistic random walk after 184773 steps, saw 153135 distinct states, run finished after 3003 ms. (steps per millisecond=61 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-08 06:41:26] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2023-03-08 06:41:26] [INFO ] Invariant cache hit.
[2023-03-08 06:41:26] [INFO ] After 100ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 06:41:26] [INFO ] [Nat]Absence check using 100 positive place invariants in 25 ms returned sat
[2023-03-08 06:41:26] [INFO ] [Nat]Absence check using 100 positive and 50 generalized place invariants in 15 ms returned sat
[2023-03-08 06:41:27] [INFO ] After 638ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 06:41:27] [INFO ] State equation strengthened by 50 read => feed constraints.
[2023-03-08 06:41:27] [INFO ] After 447ms SMT Verify possible using 50 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-08 06:41:28] [INFO ] Deduced a trap composed of 4 places in 139 ms of which 1 ms to minimize.
[2023-03-08 06:41:28] [INFO ] Deduced a trap composed of 4 places in 133 ms of which 1 ms to minimize.
[2023-03-08 06:41:28] [INFO ] Deduced a trap composed of 4 places in 147 ms of which 1 ms to minimize.
[2023-03-08 06:41:28] [INFO ] Deduced a trap composed of 4 places in 109 ms of which 1 ms to minimize.
[2023-03-08 06:41:28] [INFO ] Deduced a trap composed of 6 places in 52 ms of which 1 ms to minimize.
[2023-03-08 06:41:28] [INFO ] Deduced a trap composed of 6 places in 66 ms of which 0 ms to minimize.
[2023-03-08 06:41:28] [INFO ] Deduced a trap composed of 5 places in 60 ms of which 0 ms to minimize.
[2023-03-08 06:41:28] [INFO ] Deduced a trap composed of 5 places in 54 ms of which 1 ms to minimize.
[2023-03-08 06:41:28] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 0 ms to minimize.
[2023-03-08 06:41:28] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 0 ms to minimize.
[2023-03-08 06:41:29] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 1 ms to minimize.
[2023-03-08 06:41:29] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 1 ms to minimize.
[2023-03-08 06:41:29] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
[2023-03-08 06:41:29] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1260 ms
[2023-03-08 06:41:29] [INFO ] Deduced a trap composed of 5 places in 240 ms of which 0 ms to minimize.
[2023-03-08 06:41:29] [INFO ] Deduced a trap composed of 6 places in 264 ms of which 1 ms to minimize.
[2023-03-08 06:41:30] [INFO ] Deduced a trap composed of 4 places in 227 ms of which 1 ms to minimize.
[2023-03-08 06:41:30] [INFO ] Deduced a trap composed of 4 places in 164 ms of which 0 ms to minimize.
[2023-03-08 06:41:30] [INFO ] Deduced a trap composed of 4 places in 208 ms of which 0 ms to minimize.
[2023-03-08 06:41:30] [INFO ] Deduced a trap composed of 5 places in 244 ms of which 1 ms to minimize.
[2023-03-08 06:41:31] [INFO ] Deduced a trap composed of 6 places in 194 ms of which 1 ms to minimize.
[2023-03-08 06:41:31] [INFO ] Deduced a trap composed of 6 places in 208 ms of which 1 ms to minimize.
[2023-03-08 06:41:31] [INFO ] Deduced a trap composed of 4 places in 205 ms of which 1 ms to minimize.
[2023-03-08 06:41:31] [INFO ] Deduced a trap composed of 4 places in 179 ms of which 2 ms to minimize.
[2023-03-08 06:41:31] [INFO ] Deduced a trap composed of 4 places in 187 ms of which 1 ms to minimize.
[2023-03-08 06:41:32] [INFO ] Deduced a trap composed of 6 places in 222 ms of which 1 ms to minimize.
[2023-03-08 06:41:32] [INFO ] Deduced a trap composed of 4 places in 156 ms of which 1 ms to minimize.
[2023-03-08 06:41:32] [INFO ] Deduced a trap composed of 4 places in 150 ms of which 0 ms to minimize.
[2023-03-08 06:41:32] [INFO ] Deduced a trap composed of 4 places in 145 ms of which 0 ms to minimize.
[2023-03-08 06:41:32] [INFO ] Deduced a trap composed of 6 places in 140 ms of which 1 ms to minimize.
[2023-03-08 06:41:33] [INFO ] Deduced a trap composed of 4 places in 181 ms of which 0 ms to minimize.
[2023-03-08 06:41:33] [INFO ] Deduced a trap composed of 6 places in 138 ms of which 1 ms to minimize.
[2023-03-08 06:41:33] [INFO ] Deduced a trap composed of 4 places in 123 ms of which 0 ms to minimize.
[2023-03-08 06:41:33] [INFO ] Deduced a trap composed of 4 places in 118 ms of which 1 ms to minimize.
[2023-03-08 06:41:33] [INFO ] Deduced a trap composed of 4 places in 113 ms of which 0 ms to minimize.
[2023-03-08 06:41:33] [INFO ] Deduced a trap composed of 6 places in 107 ms of which 1 ms to minimize.
[2023-03-08 06:41:33] [INFO ] Deduced a trap composed of 4 places in 100 ms of which 1 ms to minimize.
[2023-03-08 06:41:34] [INFO ] Deduced a trap composed of 4 places in 95 ms of which 1 ms to minimize.
[2023-03-08 06:41:34] [INFO ] Deduced a trap composed of 4 places in 89 ms of which 1 ms to minimize.
[2023-03-08 06:41:34] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 1 ms to minimize.
[2023-03-08 06:41:34] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 1 ms to minimize.
[2023-03-08 06:41:34] [INFO ] Deduced a trap composed of 5 places in 69 ms of which 0 ms to minimize.
[2023-03-08 06:41:34] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 0 ms to minimize.
[2023-03-08 06:41:34] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
[2023-03-08 06:41:34] [INFO ] Trap strengthening (SAT) tested/added 31/30 trap constraints in 5210 ms
[2023-03-08 06:41:34] [INFO ] After 7388ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 503 ms.
[2023-03-08 06:41:35] [INFO ] After 8714ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 14 ms.
Support contains 134 out of 250 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 250/250 places, 2600/2600 transitions.
Applied a total of 0 rules in 104 ms. Remains 250 /250 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 105 ms. Remains : 250/250 places, 2600/2600 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 250/250 places, 2600/2600 transitions.
Applied a total of 0 rules in 117 ms. Remains 250 /250 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2023-03-08 06:41:35] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2023-03-08 06:41:35] [INFO ] Invariant cache hit.
[2023-03-08 06:41:35] [INFO ] Implicit Places using invariants in 257 ms returned [100, 103, 106, 109, 112, 115, 118, 121, 124, 127, 130, 133, 136, 139, 142, 145, 148, 151, 154, 157, 160, 163, 166, 169, 172, 175, 178, 181, 184, 187, 190, 193, 196, 199, 202, 205, 208, 211, 214, 217, 220, 223, 226, 229, 232, 235, 238, 241, 244, 247]
Discarding 50 places :
Implicit Place search using SMT only with invariants took 264 ms to find 50 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 200/250 places, 2600/2600 transitions.
Applied a total of 0 rules in 104 ms. Remains 200 /200 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 487 ms. Remains : 200/250 places, 2600/2600 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 252 ms. (steps per millisecond=39 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 156 ms. (steps per millisecond=64 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 181305 steps, run timeout after 3001 ms. (steps per millisecond=60 ) properties seen :{}
Probabilistic random walk after 181305 steps, saw 150205 distinct states, run finished after 3002 ms. (steps per millisecond=60 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-08 06:41:39] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 200 cols
[2023-03-08 06:41:39] [INFO ] Computed 100 place invariants in 9 ms
[2023-03-08 06:41:39] [INFO ] After 102ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 06:41:39] [INFO ] [Nat]Absence check using 100 positive place invariants in 35 ms returned sat
[2023-03-08 06:41:40] [INFO ] After 641ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 06:41:40] [INFO ] State equation strengthened by 50 read => feed constraints.
[2023-03-08 06:41:40] [INFO ] After 507ms SMT Verify possible using 50 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-08 06:41:41] [INFO ] Deduced a trap composed of 4 places in 152 ms of which 0 ms to minimize.
[2023-03-08 06:41:41] [INFO ] Deduced a trap composed of 4 places in 138 ms of which 0 ms to minimize.
[2023-03-08 06:41:41] [INFO ] Deduced a trap composed of 4 places in 128 ms of which 1 ms to minimize.
[2023-03-08 06:41:41] [INFO ] Deduced a trap composed of 4 places in 124 ms of which 1 ms to minimize.
[2023-03-08 06:41:41] [INFO ] Deduced a trap composed of 4 places in 115 ms of which 0 ms to minimize.
[2023-03-08 06:41:41] [INFO ] Deduced a trap composed of 4 places in 114 ms of which 0 ms to minimize.
[2023-03-08 06:41:42] [INFO ] Deduced a trap composed of 4 places in 113 ms of which 0 ms to minimize.
[2023-03-08 06:41:42] [INFO ] Deduced a trap composed of 4 places in 105 ms of which 0 ms to minimize.
[2023-03-08 06:41:42] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 0 ms to minimize.
[2023-03-08 06:41:42] [INFO ] Deduced a trap composed of 4 places in 99 ms of which 1 ms to minimize.
[2023-03-08 06:41:42] [INFO ] Deduced a trap composed of 4 places in 96 ms of which 1 ms to minimize.
[2023-03-08 06:41:42] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1491 ms
[2023-03-08 06:41:42] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1492 ms
[2023-03-08 06:41:43] [INFO ] Deduced a trap composed of 4 places in 249 ms of which 1 ms to minimize.
[2023-03-08 06:41:43] [INFO ] Deduced a trap composed of 4 places in 240 ms of which 1 ms to minimize.
[2023-03-08 06:41:43] [INFO ] Deduced a trap composed of 4 places in 271 ms of which 1 ms to minimize.
[2023-03-08 06:41:43] [INFO ] Deduced a trap composed of 4 places in 229 ms of which 1 ms to minimize.
[2023-03-08 06:41:44] [INFO ] Deduced a trap composed of 4 places in 224 ms of which 0 ms to minimize.
[2023-03-08 06:41:44] [INFO ] Deduced a trap composed of 4 places in 216 ms of which 1 ms to minimize.
[2023-03-08 06:41:44] [INFO ] Deduced a trap composed of 4 places in 204 ms of which 1 ms to minimize.
[2023-03-08 06:41:44] [INFO ] Deduced a trap composed of 4 places in 196 ms of which 1 ms to minimize.
[2023-03-08 06:41:44] [INFO ] Deduced a trap composed of 4 places in 203 ms of which 0 ms to minimize.
[2023-03-08 06:41:45] [INFO ] Deduced a trap composed of 4 places in 188 ms of which 0 ms to minimize.
[2023-03-08 06:41:45] [INFO ] Deduced a trap composed of 4 places in 182 ms of which 0 ms to minimize.
[2023-03-08 06:41:45] [INFO ] Trap strengthening procedure interrupted after too many repetitions 2611 ms
[2023-03-08 06:41:45] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2612 ms
[2023-03-08 06:41:45] [INFO ] After 5087ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 476 ms.
[2023-03-08 06:41:45] [INFO ] After 6393ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 2 ms.
Support contains 134 out of 200 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 200/200 places, 2600/2600 transitions.
Applied a total of 0 rules in 64 ms. Remains 200 /200 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 200/200 places, 2600/2600 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 200/200 places, 2600/2600 transitions.
Applied a total of 0 rules in 63 ms. Remains 200 /200 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2023-03-08 06:41:46] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2023-03-08 06:41:46] [INFO ] Invariant cache hit.
[2023-03-08 06:41:46] [INFO ] Implicit Places using invariants in 182 ms returned []
[2023-03-08 06:41:46] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2023-03-08 06:41:46] [INFO ] Invariant cache hit.
[2023-03-08 06:41:46] [INFO ] State equation strengthened by 50 read => feed constraints.
[2023-03-08 06:41:46] [INFO ] Implicit Places using invariants and state equation in 383 ms returned []
Implicit Place search using SMT with State Equation took 568 ms to find 0 implicit places.
[2023-03-08 06:41:46] [INFO ] Redundant transitions in 237 ms returned []
[2023-03-08 06:41:46] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2023-03-08 06:41:46] [INFO ] Invariant cache hit.
[2023-03-08 06:41:49] [INFO ] Dead Transitions using invariants and state equation in 2447 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3326 ms. Remains : 200/200 places, 2600/2600 transitions.
Ensure Unique test removed 2400 transitions
Reduce isomorphic transitions removed 2400 transitions.
Iterating post reduction 0 with 2400 rules applied. Total rules applied 2400 place count 200 transition count 200
Free-agglomeration rule applied 12 times.
Iterating global reduction 1 with 12 rules applied. Total rules applied 2412 place count 200 transition count 188
Ensure Unique test removed 12 places
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 2448 place count 176 transition count 176
Applied a total of 2448 rules in 59 ms. Remains 176 /200 variables (removed 24) and now considering 176/2600 (removed 2424) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 176 rows 176 cols
[2023-03-08 06:41:49] [INFO ] Computed 88 place invariants in 4 ms
[2023-03-08 06:41:49] [INFO ] After 69ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 06:41:49] [INFO ] [Nat]Absence check using 88 positive place invariants in 16 ms returned sat
[2023-03-08 06:41:49] [INFO ] After 395ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 06:41:50] [INFO ] After 732ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 334 ms.
[2023-03-08 06:41:50] [INFO ] After 1160ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-03-08 06:41:50] [INFO ] Flatten gal took : 11 ms
[2023-03-08 06:41:50] [INFO ] Flatten gal took : 9 ms
[2023-03-08 06:41:50] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15870163837751108176.gal : 3 ms
[2023-03-08 06:41:50] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4690352968461357924.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.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15870163837751108176.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4690352968461357924.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.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality4690352968461357924.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :9 after 162
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :162 after 26244
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :26244 after 4.59165e+08
Reachability property Dekker-PT-050-ReachabilityFireability-05 is true.
Detected timeout of ITS tools.
[2023-03-08 06:42:05] [INFO ] Flatten gal took : 9 ms
[2023-03-08 06:42:05] [INFO ] Applying decomposition
[2023-03-08 06:42:05] [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.202303021504/bin/convert-linux64' '-i' '/tmp/graph15608937307283401068.txt' '-o' '/tmp/graph15608937307283401068.bin' '-w' '/tmp/graph15608937307283401068.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph15608937307283401068.bin' '-l' '-1' '-v' '-w' '/tmp/graph15608937307283401068.weights' '-q' '0' '-e' '0.001'
[2023-03-08 06:42:06] [INFO ] Decomposing Gal with order
[2023-03-08 06:42:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-08 06:42:06] [INFO ] Removed a total of 38 redundant transitions.
[2023-03-08 06:42:06] [INFO ] Flatten gal took : 118 ms
[2023-03-08 06:42:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 76 labels/synchronizations in 12 ms.
[2023-03-08 06:42:06] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5595117399849208951.gal : 6 ms
[2023-03-08 06:42:06] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12809843845684338535.prop : 19 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.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality5595117399849208951.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12809843845684338535.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality12809843845684338535.prop.
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.53309e+21,0.077774,5228,58,7,167,19,286,6,19,19,0
Total reachable state count : 5533088635588575596544
Verifying 1 reachability properties.
Invariant property Dekker-PT-050-ReachabilityFireability-01 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
Dekker-PT-050-ReachabilityFireability-01,3.4588e+18,0.590532,33532,31654,7,89654,19,652,97244,24,19,19548
ITS tools runner thread asked to quit. Dying gracefully.
ITS runner failed with exception null
java.lang.InterruptedException
at java.base/java.lang.Object.wait(Native Method)
at java.base/java.lang.Thread.join(Thread.java:1304)
at java.base/java.lang.Thread.join(Thread.java:1372)
at fr.lip6.move.gal.application.runner.AbstractRunner.join(AbstractRunner.java:27)
at fr.lip6.move.gal.application.runner.its.ITSRunner.join(ITSRunner.java:177)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.verifyWithSDD(GlobalPropertySolver.java:675)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.lambda$2(ReachabilitySolver.java:63)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-08 06:42:07] [INFO ] Flatten gal took : 531 ms
[2023-03-08 06:42:07] [INFO ] Applying decomposition
[2023-03-08 06:42:07] [INFO ] Flatten gal took : 247 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph14188626591282891706.txt' '-o' '/tmp/graph14188626591282891706.bin' '-w' '/tmp/graph14188626591282891706.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph14188626591282891706.bin' '-l' '-1' '-v' '-w' '/tmp/graph14188626591282891706.weights' '-q' '0' '-e' '0.001'
[2023-03-08 06:42:08] [INFO ] Decomposing Gal with order
[2023-03-08 06:42:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-08 06:42:08] [INFO ] Removed a total of 8327 redundant transitions.
[2023-03-08 06:42:09] [INFO ] Flatten gal took : 295 ms
[2023-03-08 06:42:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 60 ms.
[2023-03-08 06:42:09] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12926343278117605701.gal : 19 ms
[2023-03-08 06:42:09] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3660582596084434336.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.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12926343278117605701.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3660582596084434336.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality3660582596084434336.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 128
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :128 after 1.1259e+15
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :1.1259e+15 after 2.81475e+15
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,2.92734e+16,1.08708,14672,119,15,13794,1361,3150,16292,53,1815,0
Total reachable state count : 29273397577908224
Verifying 2 reachability properties.
Invariant property Dekker-PT-050-ReachabilityFireability-01 does not hold.
FORMULA Dekker-PT-050-ReachabilityFireability-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
Dekker-PT-050-ReachabilityFireability-01,1.75914e+12,1.31276,20480,7951,16,41528,1361,3517,46872,62,1815,19295
Reachability property Dekker-PT-050-ReachabilityFireability-05 is true.
FORMULA Dekker-PT-050-ReachabilityFireability-05 TRUE 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
Dekker-PT-050-ReachabilityFireability-05,3.51844e+13,1.3431,21008,67,14,41760,1361,3782,47023,64,1815,19787
All properties solved without resorting to model-checking.
Total runtime 68086 ms.
BK_STOP 1678257731912
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Dekker-PT-050"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is Dekker-PT-050, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r133-smll-167819410000031"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Dekker-PT-050.tgz
mv Dekker-PT-050 execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;