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.r101-tall-167814475400471.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 DES-PT-40b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r101-tall-167814475400471
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 484K
-rw-r--r-- 1 mcc users 5.8K Feb 26 15:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Feb 26 15:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 26 15:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 67K Feb 26 15:36 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 15:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.8K Feb 26 15:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 64K Feb 26 15:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 26 15:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 26 15:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Feb 25 15:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:51 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 115K 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 DES-PT-40b-ReachabilityFireability-00
FORMULA_NAME DES-PT-40b-ReachabilityFireability-01
FORMULA_NAME DES-PT-40b-ReachabilityFireability-02
FORMULA_NAME DES-PT-40b-ReachabilityFireability-03
FORMULA_NAME DES-PT-40b-ReachabilityFireability-04
FORMULA_NAME DES-PT-40b-ReachabilityFireability-05
FORMULA_NAME DES-PT-40b-ReachabilityFireability-06
FORMULA_NAME DES-PT-40b-ReachabilityFireability-07
FORMULA_NAME DES-PT-40b-ReachabilityFireability-08
FORMULA_NAME DES-PT-40b-ReachabilityFireability-09
FORMULA_NAME DES-PT-40b-ReachabilityFireability-10
FORMULA_NAME DES-PT-40b-ReachabilityFireability-11
FORMULA_NAME DES-PT-40b-ReachabilityFireability-12
FORMULA_NAME DES-PT-40b-ReachabilityFireability-13
FORMULA_NAME DES-PT-40b-ReachabilityFireability-14
FORMULA_NAME DES-PT-40b-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678275528831

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=DES-PT-40b
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202303021504
[2023-03-08 11:38:50] [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 11:38:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 11:38:50] [INFO ] Load time of PNML (sax parser for PT used): 60 ms
[2023-03-08 11:38:50] [INFO ] Transformed 439 places.
[2023-03-08 11:38:50] [INFO ] Transformed 390 transitions.
[2023-03-08 11:38:50] [INFO ] Found NUPN structural information;
[2023-03-08 11:38:50] [INFO ] Parsed PT model containing 439 places and 390 transitions and 1303 arcs in 125 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 75 resets, run finished after 416 ms. (steps per millisecond=24 ) properties (out of 16) seen :8
FORMULA DES-PT-40b-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-40b-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-40b-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-40b-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-40b-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-40b-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-40b-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-40b-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 8) seen :0
[2023-03-08 11:38:51] [INFO ] Flatten gal took : 89 ms
[2023-03-08 11:38:51] [INFO ] Flatten gal took : 48 ms
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 8) seen :0
[2023-03-08 11:38:51] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11727986113636705154.gal : 23 ms
[2023-03-08 11:38:51] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8032213709066939528.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality11727986113636705154.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8032213709066939528.prop' '--nowitness' '--gen-order' 'FOLLOW'
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 8) 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 10000 steps, including 10 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 8) seen :0
Loading property file /tmp/ReachabilityCardinality8032213709066939528.prop.
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :3 after 4
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :4 after 5
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :5 after 13
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :13 after 19
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :19 after 113
SDD proceeding with computation,8 properties remain. new max is 256
SDD size :113 after 132
SDD proceeding with computation,8 properties remain. new max is 512
SDD size :132 after 443
SDD proceeding with computation,8 properties remain. new max is 1024
SDD size :443 after 69745
SDD proceeding with computation,8 properties remain. new max is 2048
SDD size :69745 after 395085
// Phase 1: matrix 390 rows 439 cols
[2023-03-08 11:38:51] [INFO ] Computed 65 place invariants in 43 ms
SDD proceeding with computation,8 properties remain. new max is 4096
SDD size :395085 after 2.19755e+07
[2023-03-08 11:38:51] [INFO ] After 284ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-08 11:38:52] [INFO ] [Nat]Absence check using 39 positive place invariants in 13 ms returned sat
[2023-03-08 11:38:52] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 26 ms returned sat
[2023-03-08 11:38:56] [INFO ] After 2633ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-08 11:38:57] [INFO ] Deduced a trap composed of 8 places in 241 ms of which 8 ms to minimize.
[2023-03-08 11:38:57] [INFO ] Deduced a trap composed of 26 places in 267 ms of which 1 ms to minimize.
[2023-03-08 11:38:57] [INFO ] Deduced a trap composed of 14 places in 110 ms of which 1 ms to minimize.
[2023-03-08 11:38:57] [INFO ] Deduced a trap composed of 15 places in 114 ms of which 1 ms to minimize.
[2023-03-08 11:38:57] [INFO ] Deduced a trap composed of 7 places in 124 ms of which 0 ms to minimize.
[2023-03-08 11:38:58] [INFO ] Deduced a trap composed of 35 places in 107 ms of which 0 ms to minimize.
[2023-03-08 11:38:58] [INFO ] Deduced a trap composed of 40 places in 151 ms of which 1 ms to minimize.
[2023-03-08 11:38:58] [INFO ] Deduced a trap composed of 36 places in 70 ms of which 0 ms to minimize.
[2023-03-08 11:38:59] [INFO ] Deduced a trap composed of 32 places in 96 ms of which 2 ms to minimize.
[2023-03-08 11:38:59] [INFO ] Deduced a trap composed of 24 places in 166 ms of which 1 ms to minimize.
[2023-03-08 11:38:59] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2522 ms
[2023-03-08 11:38:59] [INFO ] Deduced a trap composed of 12 places in 129 ms of which 1 ms to minimize.
[2023-03-08 11:38:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 164 ms
[2023-03-08 11:38:59] [INFO ] Deduced a trap composed of 31 places in 48 ms of which 1 ms to minimize.
[2023-03-08 11:38:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 89 ms
[2023-03-08 11:39:00] [INFO ] Deduced a trap composed of 18 places in 85 ms of which 0 ms to minimize.
[2023-03-08 11:39:00] [INFO ] Deduced a trap composed of 32 places in 81 ms of which 1 ms to minimize.
[2023-03-08 11:39:01] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2023-03-08 11:39:01] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 721 ms
[2023-03-08 11:39:02] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 1 ms to minimize.
[2023-03-08 11:39:02] [INFO ] Deduced a trap composed of 14 places in 85 ms of which 1 ms to minimize.
[2023-03-08 11:39:02] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 0 ms to minimize.
[2023-03-08 11:39:02] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 0 ms to minimize.
[2023-03-08 11:39:02] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 625 ms
[2023-03-08 11:39:03] [INFO ] Deduced a trap composed of 30 places in 130 ms of which 1 ms to minimize.
[2023-03-08 11:39:03] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 0 ms to minimize.
[2023-03-08 11:39:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 299 ms
[2023-03-08 11:39:03] [INFO ] After 9138ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :7
Attempting to minimize the solution found.
Minimization took 2376 ms.
[2023-03-08 11:39:05] [INFO ] After 13703ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :7
FORMULA DES-PT-40b-ReachabilityFireability-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 8 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 1115 ms.
Support contains 74 out of 439 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 439/439 places, 390/390 transitions.
Graph (complete) has 978 edges and 439 vertex of which 428 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.2 ms
Discarding 11 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 428 transition count 372
Reduce places removed 11 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 14 rules applied. Total rules applied 28 place count 417 transition count 369
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 31 place count 414 transition count 369
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 31 place count 414 transition count 360
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 49 place count 405 transition count 360
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 65 place count 389 transition count 344
Iterating global reduction 3 with 16 rules applied. Total rules applied 81 place count 389 transition count 344
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 91 place count 379 transition count 334
Iterating global reduction 3 with 10 rules applied. Total rules applied 101 place count 379 transition count 334
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 110 place count 379 transition count 325
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 110 place count 379 transition count 324
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 112 place count 378 transition count 324
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 45
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 4 with 90 rules applied. Total rules applied 202 place count 333 transition count 279
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 204 place count 332 transition count 279
Free-agglomeration rule applied 6 times.
Iterating global reduction 4 with 6 rules applied. Total rules applied 210 place count 332 transition count 273
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 216 place count 326 transition count 273
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 217 place count 326 transition count 272
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 218 place count 326 transition count 271
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 219 place count 325 transition count 271
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 220 place count 324 transition count 270
Applied a total of 220 rules in 168 ms. Remains 324 /439 variables (removed 115) and now considering 270/390 (removed 120) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 168 ms. Remains : 324/439 places, 270/390 transitions.
Incomplete random walk after 10000 steps, including 148 resets, run finished after 161 ms. (steps per millisecond=62 ) properties (out of 7) seen :1
FORMULA DES-PT-40b-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 28 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 270 rows 324 cols
[2023-03-08 11:39:07] [INFO ] Computed 61 place invariants in 6 ms
[2023-03-08 11:39:07] [INFO ] After 79ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-08 11:39:07] [INFO ] [Nat]Absence check using 37 positive place invariants in 10 ms returned sat
[2023-03-08 11:39:07] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 98 ms returned sat
[2023-03-08 11:39:08] [INFO ] After 525ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-08 11:39:08] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-08 11:39:08] [INFO ] After 322ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-08 11:39:08] [INFO ] Deduced a trap composed of 5 places in 56 ms of which 1 ms to minimize.
[2023-03-08 11:39:08] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
[2023-03-08 11:39:08] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 0 ms to minimize.
[2023-03-08 11:39:08] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 172 ms
[2023-03-08 11:39:08] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 0 ms to minimize.
[2023-03-08 11:39:08] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 0 ms to minimize.
[2023-03-08 11:39:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 121 ms
[2023-03-08 11:39:09] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 0 ms to minimize.
[2023-03-08 11:39:09] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2023-03-08 11:39:09] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 0 ms to minimize.
[2023-03-08 11:39:09] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 1 ms to minimize.
[2023-03-08 11:39:09] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
[2023-03-08 11:39:09] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2023-03-08 11:39:09] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 4 ms to minimize.
[2023-03-08 11:39:09] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 0 ms to minimize.
[2023-03-08 11:39:09] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 432 ms
[2023-03-08 11:39:09] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 0 ms to minimize.
[2023-03-08 11:39:09] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 0 ms to minimize.
[2023-03-08 11:39:09] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 1 ms to minimize.
[2023-03-08 11:39:09] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 237 ms
[2023-03-08 11:39:10] [INFO ] Deduced a trap composed of 11 places in 83 ms of which 1 ms to minimize.
[2023-03-08 11:39:10] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 2 ms to minimize.
[2023-03-08 11:39:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 213 ms
[2023-03-08 11:39:10] [INFO ] After 1815ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 444 ms.
[2023-03-08 11:39:10] [INFO ] After 3011ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 456 ms.
Support contains 43 out of 324 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 324/324 places, 270/270 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 324 transition count 268
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 322 transition count 268
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 34 place count 307 transition count 253
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 36 place count 307 transition count 251
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 38 place count 305 transition count 251
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 39 place count 305 transition count 250
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 40 place count 305 transition count 249
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 42 place count 304 transition count 248
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 43 place count 303 transition count 247
Applied a total of 43 rules in 83 ms. Remains 303 /324 variables (removed 21) and now considering 247/270 (removed 23) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83 ms. Remains : 303/324 places, 247/270 transitions.
Incomplete random walk after 10000 steps, including 190 resets, run finished after 154 ms. (steps per millisecond=64 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 53 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 643957 steps, run timeout after 3001 ms. (steps per millisecond=214 ) properties seen :{0=1, 5=1}
Probabilistic random walk after 643957 steps, saw 133678 distinct states, run finished after 3002 ms. (steps per millisecond=214 ) properties seen :2
FORMULA DES-PT-40b-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA DES-PT-40b-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 4 properties.
// Phase 1: matrix 247 rows 303 cols
[2023-03-08 11:39:14] [INFO ] Computed 61 place invariants in 11 ms
[2023-03-08 11:39:14] [INFO ] [Real]Absence check using 37 positive place invariants in 5 ms returned sat
[2023-03-08 11:39:14] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 11 ms returned sat
[2023-03-08 11:39:14] [INFO ] After 88ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-08 11:39:14] [INFO ] [Nat]Absence check using 37 positive place invariants in 5 ms returned sat
[2023-03-08 11:39:14] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 106 ms returned sat
[2023-03-08 11:39:15] [INFO ] After 382ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-08 11:39:15] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-08 11:39:15] [INFO ] After 247ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-08 11:39:15] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 0 ms to minimize.
[2023-03-08 11:39:15] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 1 ms to minimize.
[2023-03-08 11:39:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 152 ms
[2023-03-08 11:39:15] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 0 ms to minimize.
[2023-03-08 11:39:15] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 0 ms to minimize.
[2023-03-08 11:39:15] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 0 ms to minimize.
[2023-03-08 11:39:15] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 210 ms
[2023-03-08 11:39:16] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 0 ms to minimize.
[2023-03-08 11:39:16] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 0 ms to minimize.
[2023-03-08 11:39:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 134 ms
[2023-03-08 11:39:16] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 1 ms to minimize.
[2023-03-08 11:39:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 85 ms
[2023-03-08 11:39:16] [INFO ] After 1058ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 256 ms.
[2023-03-08 11:39:16] [INFO ] After 1913ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 253 ms.
Support contains 39 out of 303 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 303/303 places, 247/247 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 10 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 302 transition count 246
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 301 transition count 245
Applied a total of 3 rules in 33 ms. Remains 301 /303 variables (removed 2) and now considering 245/247 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 301/303 places, 245/247 transitions.
Incomplete random walk after 10000 steps, including 190 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 30 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 770686 steps, run timeout after 3001 ms. (steps per millisecond=256 ) properties seen :{2=1}
Probabilistic random walk after 770686 steps, saw 166591 distinct states, run finished after 3001 ms. (steps per millisecond=256 ) properties seen :1
FORMULA DES-PT-40b-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 3 properties.
// Phase 1: matrix 245 rows 301 cols
[2023-03-08 11:39:20] [INFO ] Computed 61 place invariants in 28 ms
[2023-03-08 11:39:20] [INFO ] [Real]Absence check using 37 positive place invariants in 14 ms returned sat
[2023-03-08 11:39:20] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 14 ms returned sat
[2023-03-08 11:39:20] [INFO ] After 294ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-08 11:39:20] [INFO ] [Nat]Absence check using 37 positive place invariants in 6 ms returned sat
[2023-03-08 11:39:20] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 70 ms returned sat
[2023-03-08 11:39:21] [INFO ] After 389ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-08 11:39:21] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-08 11:39:21] [INFO ] After 219ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-08 11:39:21] [INFO ] Deduced a trap composed of 5 places in 558 ms of which 1 ms to minimize.
[2023-03-08 11:39:21] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 1 ms to minimize.
[2023-03-08 11:39:22] [INFO ] Deduced a trap composed of 17 places in 84 ms of which 1 ms to minimize.
[2023-03-08 11:39:22] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 782 ms
[2023-03-08 11:39:22] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2023-03-08 11:39:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 76 ms
[2023-03-08 11:39:22] [INFO ] Deduced a trap composed of 10 places in 63 ms of which 0 ms to minimize.
[2023-03-08 11:39:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 88 ms
[2023-03-08 11:39:22] [INFO ] After 1333ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 198 ms.
[2023-03-08 11:39:22] [INFO ] After 2142ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 122 ms.
Support contains 17 out of 301 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 301/301 places, 245/245 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 301 transition count 244
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 300 transition count 244
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 300 transition count 242
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 298 transition count 242
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 16 place count 293 transition count 237
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 17 place count 292 transition count 236
Iterating global reduction 2 with 1 rules applied. Total rules applied 18 place count 292 transition count 236
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 19 place count 292 transition count 235
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 20 place count 291 transition count 235
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 23 place count 291 transition count 232
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 27 place count 288 transition count 231
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 28 place count 287 transition count 230
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 29 place count 286 transition count 230
Applied a total of 29 rules in 81 ms. Remains 286 /301 variables (removed 15) and now considering 230/245 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 81 ms. Remains : 286/301 places, 230/245 transitions.
Incomplete random walk after 10000 steps, including 235 resets, run finished after 224 ms. (steps per millisecond=44 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 49 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 993245 steps, run timeout after 3001 ms. (steps per millisecond=330 ) properties seen :{}
Probabilistic random walk after 993245 steps, saw 125275 distinct states, run finished after 3004 ms. (steps per millisecond=330 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 230 rows 286 cols
[2023-03-08 11:39:26] [INFO ] Computed 60 place invariants in 7 ms
[2023-03-08 11:39:26] [INFO ] [Real]Absence check using 36 positive place invariants in 7 ms returned sat
[2023-03-08 11:39:26] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 13 ms returned sat
[2023-03-08 11:39:26] [INFO ] After 197ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-08 11:39:26] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-08 11:39:26] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 69 ms returned sat
[2023-03-08 11:39:26] [INFO ] After 403ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-08 11:39:26] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-08 11:39:27] [INFO ] After 514ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-08 11:39:27] [INFO ] Deduced a trap composed of 11 places in 106 ms of which 0 ms to minimize.
[2023-03-08 11:39:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 130 ms
[2023-03-08 11:39:27] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 0 ms to minimize.
[2023-03-08 11:39:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 75 ms
[2023-03-08 11:39:27] [INFO ] After 961ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 178 ms.
[2023-03-08 11:39:28] [INFO ] After 1753ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 34 ms.
Support contains 17 out of 286 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 286/286 places, 230/230 transitions.
Applied a total of 0 rules in 7 ms. Remains 286 /286 variables (removed 0) and now considering 230/230 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 286/286 places, 230/230 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 286/286 places, 230/230 transitions.
Applied a total of 0 rules in 5 ms. Remains 286 /286 variables (removed 0) and now considering 230/230 (removed 0) transitions.
[2023-03-08 11:39:28] [INFO ] Invariant cache hit.
[2023-03-08 11:39:28] [INFO ] Implicit Places using invariants in 210 ms returned []
[2023-03-08 11:39:28] [INFO ] Invariant cache hit.
[2023-03-08 11:39:28] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-08 11:39:28] [INFO ] Implicit Places using invariants and state equation in 271 ms returned []
Implicit Place search using SMT with State Equation took 496 ms to find 0 implicit places.
[2023-03-08 11:39:28] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-08 11:39:28] [INFO ] Invariant cache hit.
[2023-03-08 11:39:28] [INFO ] Dead Transitions using invariants and state equation in 118 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 645 ms. Remains : 286/286 places, 230/230 transitions.
Applied a total of 0 rules in 15 ms. Remains 286 /286 variables (removed 0) and now considering 230/230 (removed 0) transitions.
Running SMT prover for 3 properties.
[2023-03-08 11:39:28] [INFO ] Invariant cache hit.
[2023-03-08 11:39:28] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-08 11:39:29] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 11 ms returned sat
[2023-03-08 11:39:29] [INFO ] After 179ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-08 11:39:29] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-08 11:39:29] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 134 ms returned sat
[2023-03-08 11:39:29] [INFO ] After 263ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-08 11:39:29] [INFO ] Deduced a trap composed of 5 places in 75 ms of which 0 ms to minimize.
[2023-03-08 11:39:29] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 0 ms to minimize.
[2023-03-08 11:39:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 147 ms
[2023-03-08 11:39:29] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 1 ms to minimize.
[2023-03-08 11:39:29] [INFO ] Deduced a trap composed of 6 places in 70 ms of which 0 ms to minimize.
[2023-03-08 11:39:30] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 1 ms to minimize.
[2023-03-08 11:39:30] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 0 ms to minimize.
[2023-03-08 11:39:30] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 2 ms to minimize.
[2023-03-08 11:39:30] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 489 ms
[2023-03-08 11:39:30] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 3 ms to minimize.
[2023-03-08 11:39:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 92 ms
[2023-03-08 11:39:30] [INFO ] After 1155ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 161 ms.
[2023-03-08 11:39:30] [INFO ] After 1556ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2023-03-08 11:39:30] [INFO ] Flatten gal took : 23 ms
[2023-03-08 11:39:30] [INFO ] Flatten gal took : 19 ms
[2023-03-08 11:39:30] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15515763216517952712.gal : 8 ms
[2023-03-08 11:39:30] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11133527466542846480.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/ReachabilityCardinality15515763216517952712.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11133527466542846480.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 ...330
Loading property file /tmp/ReachabilityCardinality11133527466542846480.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :2 after 6
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :6 after 42
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :42 after 266
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :266 after 322
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :322 after 350
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :350 after 11360
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :11360 after 12890
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :12890 after 386546
SDD proceeding with computation,3 properties remain. new max is 2048
SDD size :1.20577e+06 after 1.50601e+06
SDD proceeding with computation,3 properties remain. new max is 4096
SDD size :1.50601e+06 after 5.47145e+06
SDD proceeding with computation,3 properties remain. new max is 8192
SDD size :9.61927e+06 after 3.1208e+09
SDD proceeding with computation,3 properties remain. new max is 16384
SDD size :3.1208e+09 after 3.47663e+09
SDD proceeding with computation,3 properties remain. new max is 32768
SDD size :3.47663e+09 after 6.47343e+09
Detected timeout of ITS tools.
[2023-03-08 11:39:45] [INFO ] Flatten gal took : 23 ms
[2023-03-08 11:39:45] [INFO ] Applying decomposition
[2023-03-08 11:39:45] [INFO ] Flatten gal took : 17 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/graph7321656809658640591.txt' '-o' '/tmp/graph7321656809658640591.bin' '-w' '/tmp/graph7321656809658640591.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph7321656809658640591.bin' '-l' '-1' '-v' '-w' '/tmp/graph7321656809658640591.weights' '-q' '0' '-e' '0.001'
[2023-03-08 11:39:45] [INFO ] Decomposing Gal with order
[2023-03-08 11:39:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-08 11:39:46] [INFO ] Removed a total of 21 redundant transitions.
[2023-03-08 11:39:46] [INFO ] Flatten gal took : 95 ms
[2023-03-08 11:39:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 7 ms.
[2023-03-08 11:39:46] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11706440341557485742.gal : 4 ms
[2023-03-08 11:39:46] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16514926681284173254.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.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality11706440341557485742.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16514926681284173254.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 ...309
Loading property file /tmp/ReachabilityCardinality16514926681284173254.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 21
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :21 after 105
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :105 after 506
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :506 after 668
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :2034 after 14474
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :247934 after 2.81322e+09
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :2.81322e+09 after 7.80227e+09
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :7.80227e+09 after 1.36984e+10
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :2.23916e+13 after 2.60414e+13
SDD proceeding with computation,3 properties remain. new max is 2048
SDD size :5.89874e+13 after 6.26373e+13
Reachability property DES-PT-40b-ReachabilityFireability-11 is true.
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3500741560945557635
[2023-03-08 11:40:01] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3500741560945557635
Running compilation step : cd /tmp/ltsmin3500741560945557635;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 442 ms.
Running link step : cd /tmp/ltsmin3500741560945557635;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin3500741560945557635;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'DESPT40bReachabilityFireability04==true'
WARNING : LTS min runner thread was asked to interrupt. 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 11:40:16] [INFO ] Flatten gal took : 43 ms
[2023-03-08 11:40:16] [INFO ] Applying decomposition
[2023-03-08 11:40:16] [INFO ] Flatten gal took : 46 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph11902883832096700036.txt' '-o' '/tmp/graph11902883832096700036.bin' '-w' '/tmp/graph11902883832096700036.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph11902883832096700036.bin' '-l' '-1' '-v' '-w' '/tmp/graph11902883832096700036.weights' '-q' '0' '-e' '0.001'
[2023-03-08 11:40:16] [INFO ] Decomposing Gal with order
[2023-03-08 11:40:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-08 11:40:16] [INFO ] Removed a total of 30 redundant transitions.
[2023-03-08 11:40:16] [INFO ] Flatten gal took : 28 ms
[2023-03-08 11:40:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 4 ms.
[2023-03-08 11:40:16] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8725773404663191887.gal : 21 ms
[2023-03-08 11:40:16] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6281455901437181423.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/ReachabilityCardinality8725773404663191887.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6281455901437181423.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 ...307
Loading property file /tmp/ReachabilityCardinality6281455901437181423.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :1 after 109
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :109 after 43309
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :43309 after 8.36977e+06
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :1.62035e+13 after 1.93016e+14
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :1.93016e+14 after 6.11157e+17
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :6.11157e+17 after 1.05895e+18
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :1.05895e+18 after 1.73059e+18
SDD proceeding with computation,3 properties remain. new max is 2048
SDD size :1.73059e+18 after 2.73806e+18
SDD proceeding with computation,8 properties remain. new max is 8192
SDD size :2.19755e+07 after 1.81701e+08
SDD proceeding with computation,3 properties remain. new max is 4096
SDD size :3.75899e+21 after 3.78491e+21
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,3.60418e+22,126.804,606800,34918,3282,1.57203e+06,27736,840,1.02949e+06,419,168933,0
Total reachable state count : 36041768221653007060992

Verifying 3 reachability properties.
Reachability property DES-PT-40b-ReachabilityFireability-04 is true.
FORMULA DES-PT-40b-ReachabilityFireability-04 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
DES-PT-40b-ReachabilityFireability-04,1.18603e+17,126.9,606800,1287,537,1.57203e+06,27736,846,1.02949e+06,423,168933,0
Reachability property DES-PT-40b-ReachabilityFireability-07 does not hold.
FORMULA DES-PT-40b-ReachabilityFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
No reachable states exhibit your property : DES-PT-40b-ReachabilityFireability-07

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-40b-ReachabilityFireability-07,0,128.352,606800,1,0,1.57203e+06,27736,887,1.02949e+06,432,168933,137299
Reachability property DES-PT-40b-ReachabilityFireability-11 is true.
FORMULA DES-PT-40b-ReachabilityFireability-11 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
DES-PT-40b-ReachabilityFireability-11,1.01823e+20,128.359,606800,4170,768,1.57203e+06,27736,895,1.02949e+06,434,168933,137299
All properties solved without resorting to model-checking.
Total runtime 214803 ms.

BK_STOP 1678275746334

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ 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="DES-PT-40b"
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 DES-PT-40b, 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 r101-tall-167814475400471"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-40b.tgz
mv DES-PT-40b execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;