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.r197-smll-167840344100318.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 HealthRecord-PT-11, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r197-smll-167840344100318
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 8.3K Feb 26 18:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K Feb 26 18:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 26 18:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 26 18:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:13 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:13 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:13 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K Feb 26 18:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Feb 26 18:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K Feb 26 18:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K Feb 26 18:10 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:13 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:13 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 70K 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 HealthRecord-PT-11-ReachabilityCardinality-00
FORMULA_NAME HealthRecord-PT-11-ReachabilityCardinality-01
FORMULA_NAME HealthRecord-PT-11-ReachabilityCardinality-02
FORMULA_NAME HealthRecord-PT-11-ReachabilityCardinality-03
FORMULA_NAME HealthRecord-PT-11-ReachabilityCardinality-04
FORMULA_NAME HealthRecord-PT-11-ReachabilityCardinality-05
FORMULA_NAME HealthRecord-PT-11-ReachabilityCardinality-06
FORMULA_NAME HealthRecord-PT-11-ReachabilityCardinality-07
FORMULA_NAME HealthRecord-PT-11-ReachabilityCardinality-08
FORMULA_NAME HealthRecord-PT-11-ReachabilityCardinality-09
FORMULA_NAME HealthRecord-PT-11-ReachabilityCardinality-10
FORMULA_NAME HealthRecord-PT-11-ReachabilityCardinality-11
FORMULA_NAME HealthRecord-PT-11-ReachabilityCardinality-12
FORMULA_NAME HealthRecord-PT-11-ReachabilityCardinality-13
FORMULA_NAME HealthRecord-PT-11-ReachabilityCardinality-14
FORMULA_NAME HealthRecord-PT-11-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678513355917

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=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HealthRecord-PT-11
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202303021504
[2023-03-11 05:42:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-11 05:42:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 05:42:39] [INFO ] Load time of PNML (sax parser for PT used): 189 ms
[2023-03-11 05:42:39] [INFO ] Transformed 159 places.
[2023-03-11 05:42:39] [INFO ] Transformed 334 transitions.
[2023-03-11 05:42:39] [INFO ] Found NUPN structural information;
[2023-03-11 05:42:39] [INFO ] Parsed PT model containing 159 places and 334 transitions and 879 arcs in 298 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 20 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 27 transitions
Reduce redundant transitions removed 27 transitions.
FORMULA HealthRecord-PT-11-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-11-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-11-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-11 05:42:40] [INFO ] Flatten gal took : 241 ms
[2023-03-11 05:42:40] [INFO ] Flatten gal took : 127 ms
Incomplete random walk after 10000 steps, including 662 resets, run finished after 1048 ms. (steps per millisecond=9 ) properties (out of 13) seen :1
FORMULA HealthRecord-PT-11-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2023-03-11 05:42:40] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2609881219335021292.gal : 57 ms
[2023-03-11 05:42:40] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1632688893699955636.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/ReachabilityCardinality2609881219335021292.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1632688893699955636.prop' '--nowitness' '--gen-order' 'FOLLOW'
Incomplete Best-First random walk after 10001 steps, including 97 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 12) 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 ...328
Loading property file /tmp/ReachabilityCardinality1632688893699955636.prop.
Incomplete Best-First random walk after 10001 steps, including 99 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 12) seen :0
SDD proceeding with computation,13 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,13 properties remain. new max is 8
SDD size :4 after 13
SDD proceeding with computation,13 properties remain. new max is 16
SDD size :13 after 17
SDD proceeding with computation,13 properties remain. new max is 32
SDD size :17 after 865
Incomplete Best-First random walk after 10000 steps, including 93 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 103 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 12) seen :0
SDD proceeding with computation,13 properties remain. new max is 64
SDD size :865 after 11665
Incomplete Best-First random walk after 10000 steps, including 125 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 12) seen :0
SDD proceeding with computation,13 properties remain. new max is 128
SDD size :11665 after 14257
Incomplete Best-First random walk after 10001 steps, including 103 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 12) seen :0
SDD proceeding with computation,13 properties remain. new max is 256
SDD size :14257 after 21889
Incomplete Best-First random walk after 10001 steps, including 103 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 98 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 99 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 94 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 100 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 165 ms. (steps per millisecond=60 ) properties (out of 12) seen :0
Reachability property HealthRecord-PT-11-ReachabilityCardinality-04 is true.
FORMULA HealthRecord-PT-11-ReachabilityCardinality-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Invariant property HealthRecord-PT-11-ReachabilityCardinality-03 does not hold.
SDD proceeding with computation,11 properties remain. new max is 256
SDD size :21889 after 96097
SDD proceeding with computation,11 properties remain. new max is 512
SDD size :96097 after 102793
SDD proceeding with computation,11 properties remain. new max is 1024
SDD size :102793 after 115105
SDD proceeding with computation,11 properties remain. new max is 2048
SDD size :115105 after 174181
SDD proceeding with computation,11 properties remain. new max is 4096
SDD size :174181 after 506497
Interrupted probabilistic random walk after 1143584 steps, run timeout after 6001 ms. (steps per millisecond=190 ) properties seen :{0=1, 6=1}
Probabilistic random walk after 1143584 steps, saw 152937 distinct states, run finished after 6003 ms. (steps per millisecond=190 ) properties seen :2
FORMULA HealthRecord-PT-11-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA HealthRecord-PT-11-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 10 properties.
[2023-03-11 05:42:47] [INFO ] Flow matrix only has 295 transitions (discarded 12 similar events)
// Phase 1: matrix 295 rows 159 cols
[2023-03-11 05:42:47] [INFO ] Computed 18 place invariants in 25 ms
[2023-03-11 05:42:47] [INFO ] [Real]Absence check using 10 positive place invariants in 33 ms returned sat
[2023-03-11 05:42:47] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 16 ms returned sat
[2023-03-11 05:42:48] [INFO ] After 189ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:9
[2023-03-11 05:42:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 05:42:48] [INFO ] After 16ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1 real:9
[2023-03-11 05:42:48] [INFO ] After 52ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:9
Attempting to minimize the solution found.
Minimization took 26 ms.
[2023-03-11 05:42:48] [INFO ] After 652ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:9
[2023-03-11 05:42:48] [INFO ] [Nat]Absence check using 10 positive place invariants in 10 ms returned sat
[2023-03-11 05:42:48] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 13 ms returned sat
[2023-03-11 05:42:48] [INFO ] After 396ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-11 05:42:49] [INFO ] After 378ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :10
[2023-03-11 05:42:49] [INFO ] Deduced a trap composed of 30 places in 105 ms of which 1 ms to minimize.
[2023-03-11 05:42:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 151 ms
[2023-03-11 05:42:49] [INFO ] Deduced a trap composed of 39 places in 93 ms of which 1 ms to minimize.
[2023-03-11 05:42:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 129 ms
[2023-03-11 05:42:49] [INFO ] Deduced a trap composed of 39 places in 100 ms of which 1 ms to minimize.
[2023-03-11 05:42:49] [INFO ] Deduced a trap composed of 39 places in 102 ms of which 1 ms to minimize.
[2023-03-11 05:42:50] [INFO ] Deduced a trap composed of 39 places in 99 ms of which 0 ms to minimize.
[2023-03-11 05:42:50] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 382 ms
[2023-03-11 05:42:50] [INFO ] Deduced a trap composed of 30 places in 108 ms of which 1 ms to minimize.
[2023-03-11 05:42:50] [INFO ] Deduced a trap composed of 38 places in 85 ms of which 1 ms to minimize.
[2023-03-11 05:42:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 255 ms
[2023-03-11 05:42:50] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 0 ms to minimize.
[2023-03-11 05:42:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 68 ms
[2023-03-11 05:42:50] [INFO ] Deduced a trap composed of 30 places in 82 ms of which 1 ms to minimize.
[2023-03-11 05:42:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 109 ms
[2023-03-11 05:42:50] [INFO ] Deduced a trap composed of 47 places in 89 ms of which 1 ms to minimize.
[2023-03-11 05:42:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 113 ms
[2023-03-11 05:42:50] [INFO ] After 1952ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 286 ms.
[2023-03-11 05:42:51] [INFO ] After 2864ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Parikh walk visited 0 properties in 46 ms.
Support contains 93 out of 159 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 159/159 places, 307/307 transitions.
Graph (trivial) has 54 edges and 159 vertex of which 4 / 159 are part of one of the 2 SCC in 6 ms
Free SCC test removed 2 places
Drop transitions removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Graph (complete) has 673 edges and 157 vertex of which 152 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.4 ms
Discarding 5 places :
Also discarding 0 output transitions
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 30 place count 124 transition count 235
Iterating global reduction 0 with 28 rules applied. Total rules applied 58 place count 124 transition count 235
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 0 with 2 rules applied. Total rules applied 60 place count 123 transition count 235
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 62 place count 123 transition count 233
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 64 place count 122 transition count 232
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 65 place count 122 transition count 231
Partial Free-agglomeration rule applied 11 times.
Drop transitions removed 11 transitions
Iterating global reduction 0 with 11 rules applied. Total rules applied 76 place count 122 transition count 231
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 77 place count 122 transition count 231
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 78 place count 122 transition count 230
Applied a total of 78 rules in 137 ms. Remains 122 /159 variables (removed 37) and now considering 230/307 (removed 77) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 138 ms. Remains : 122/159 places, 230/307 transitions.
Incomplete random walk after 10000 steps, including 566 resets, run finished after 281 ms. (steps per millisecond=35 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 98 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 92 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 113 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 94 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 91 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 86 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 94 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 93 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 156 ms. (steps per millisecond=64 ) properties (out of 9) seen :0
SDD proceeding with computation,11 properties remain. new max is 8192
SDD size :506497 after 2.55835e+06
Interrupted probabilistic random walk after 567272 steps, run timeout after 3001 ms. (steps per millisecond=189 ) properties seen :{}
Probabilistic random walk after 567272 steps, saw 83973 distinct states, run finished after 3003 ms. (steps per millisecond=188 ) properties seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 230 rows 122 cols
[2023-03-11 05:42:55] [INFO ] Computed 13 place invariants in 4 ms
[2023-03-11 05:42:55] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-11 05:42:55] [INFO ] [Real]Absence check using 5 positive and 8 generalized place invariants in 8 ms returned sat
[2023-03-11 05:42:55] [INFO ] After 86ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:7
[2023-03-11 05:42:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 05:42:55] [INFO ] After 21ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-11 05:42:55] [INFO ] After 210ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-11 05:42:55] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-11 05:42:55] [INFO ] [Nat]Absence check using 5 positive and 8 generalized place invariants in 8 ms returned sat
[2023-03-11 05:42:55] [INFO ] After 254ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-11 05:42:56] [INFO ] After 179ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2023-03-11 05:42:56] [INFO ] Deduced a trap composed of 39 places in 57 ms of which 1 ms to minimize.
[2023-03-11 05:42:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 74 ms
[2023-03-11 05:42:56] [INFO ] Deduced a trap composed of 32 places in 55 ms of which 0 ms to minimize.
[2023-03-11 05:42:56] [INFO ] Deduced a trap composed of 31 places in 50 ms of which 1 ms to minimize.
[2023-03-11 05:42:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 131 ms
[2023-03-11 05:42:56] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 0 ms to minimize.
[2023-03-11 05:42:56] [INFO ] Deduced a trap composed of 21 places in 80 ms of which 1 ms to minimize.
[2023-03-11 05:42:56] [INFO ] Deduced a trap composed of 31 places in 56 ms of which 0 ms to minimize.
[2023-03-11 05:42:56] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 237 ms
[2023-03-11 05:42:56] [INFO ] Deduced a trap composed of 37 places in 72 ms of which 0 ms to minimize.
[2023-03-11 05:42:56] [INFO ] Deduced a trap composed of 37 places in 64 ms of which 1 ms to minimize.
[2023-03-11 05:42:56] [INFO ] Deduced a trap composed of 37 places in 66 ms of which 0 ms to minimize.
[2023-03-11 05:42:56] [INFO ] Deduced a trap composed of 37 places in 68 ms of which 1 ms to minimize.
[2023-03-11 05:42:56] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 321 ms
[2023-03-11 05:42:57] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 1 ms to minimize.
[2023-03-11 05:42:57] [INFO ] Deduced a trap composed of 27 places in 61 ms of which 1 ms to minimize.
[2023-03-11 05:42:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 153 ms
[2023-03-11 05:42:57] [INFO ] After 1291ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 179 ms.
[2023-03-11 05:42:57] [INFO ] After 1844ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
FORMULA HealthRecord-PT-11-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-11-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-11-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 3 properties in 26 ms.
Support contains 61 out of 122 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 122/122 places, 230/230 transitions.
Graph (trivial) has 44 edges and 122 vertex of which 2 / 122 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 545 edges and 121 vertex of which 119 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 119 transition count 227
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 118 transition count 227
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 118 transition count 226
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 117 transition count 226
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 21 place count 102 transition count 196
Iterating global reduction 2 with 15 rules applied. Total rules applied 36 place count 102 transition count 196
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 38 place count 100 transition count 192
Iterating global reduction 2 with 2 rules applied. Total rules applied 40 place count 100 transition count 192
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 41 place count 100 transition count 191
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 43 place count 99 transition count 190
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 47 place count 97 transition count 197
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 49 place count 97 transition count 195
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 55 place count 97 transition count 195
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 56 place count 97 transition count 194
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 57 place count 96 transition count 193
Iterating global reduction 3 with 1 rules applied. Total rules applied 58 place count 96 transition count 193
Applied a total of 58 rules in 66 ms. Remains 96 /122 variables (removed 26) and now considering 193/230 (removed 37) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67 ms. Remains : 96/122 places, 193/230 transitions.
Incomplete random walk after 10000 steps, including 654 resets, run finished after 197 ms. (steps per millisecond=50 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 112 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 106 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 115 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 102 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 110 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 753924 steps, run timeout after 3001 ms. (steps per millisecond=251 ) properties seen :{0=1, 1=1, 2=1, 3=1}
Probabilistic random walk after 753924 steps, saw 113203 distinct states, run finished after 3001 ms. (steps per millisecond=251 ) properties seen :4
FORMULA HealthRecord-PT-11-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA HealthRecord-PT-11-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA HealthRecord-PT-11-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA HealthRecord-PT-11-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 2 properties.
[2023-03-11 05:43:01] [INFO ] Flow matrix only has 192 transitions (discarded 1 similar events)
// Phase 1: matrix 192 rows 96 cols
[2023-03-11 05:43:01] [INFO ] Computed 11 place invariants in 2 ms
[2023-03-11 05:43:01] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 05:43:01] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-11 05:43:01] [INFO ] [Nat]Absence check using 3 positive and 8 generalized place invariants in 7 ms returned sat
[2023-03-11 05:43:01] [INFO ] After 91ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 05:43:01] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-11 05:43:01] [INFO ] After 32ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-11 05:43:01] [INFO ] Deduced a trap composed of 26 places in 67 ms of which 0 ms to minimize.
[2023-03-11 05:43:01] [INFO ] Deduced a trap composed of 29 places in 65 ms of which 1 ms to minimize.
[2023-03-11 05:43:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 155 ms
[2023-03-11 05:43:01] [INFO ] After 222ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 31 ms.
[2023-03-11 05:43:01] [INFO ] After 398ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 3 ms.
Support contains 26 out of 96 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 193/193 transitions.
Graph (trivial) has 55 edges and 96 vertex of which 2 / 96 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 429 edges and 95 vertex of which 94 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 22 place count 74 transition count 151
Iterating global reduction 0 with 20 rules applied. Total rules applied 42 place count 74 transition count 151
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 45 place count 74 transition count 148
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 46 place count 73 transition count 146
Iterating global reduction 1 with 1 rules applied. Total rules applied 47 place count 73 transition count 146
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 53 place count 70 transition count 148
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 1 with 7 rules applied. Total rules applied 60 place count 70 transition count 148
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 61 place count 69 transition count 146
Iterating global reduction 1 with 1 rules applied. Total rules applied 62 place count 69 transition count 146
Applied a total of 62 rules in 27 ms. Remains 69 /96 variables (removed 27) and now considering 146/193 (removed 47) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 69/96 places, 146/193 transitions.
Incomplete random walk after 10000 steps, including 813 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 129 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 140 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 2) seen :0
Finished probabilistic random walk after 1523273 steps, run visited all 2 properties in 2170 ms. (steps per millisecond=701 )
Probabilistic random walk after 1523273 steps, saw 218254 distinct states, run finished after 2171 ms. (steps per millisecond=701 ) properties seen :2
FORMULA HealthRecord-PT-11-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA HealthRecord-PT-11-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
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)
All properties solved without resorting to model-checking.
Total runtime 24919 ms.

BK_STOP 1678513385042

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="HealthRecord-PT-11"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is HealthRecord-PT-11, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r197-smll-167840344100318"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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