fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r201-smll-167840347700366
Last Updated
May 14, 2023

About the Execution of LTSMin+red for HealthRecord-PT-17

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
456.455 450234.00 1765846.00 473.60 TFTFFFFTTFFTFTFF normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r201-smll-167840347700366.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 ltsminxred
Input is HealthRecord-PT-17, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r201-smll-167840347700366
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 604K
-rw-r--r-- 1 mcc users 6.1K Feb 26 17:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Feb 26 17:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 26 17:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 26 17:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:14 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:14 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 17:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 114K Feb 26 17:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Feb 26 17:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Feb 26 17:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:14 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 175K 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-17-ReachabilityCardinality-00
FORMULA_NAME HealthRecord-PT-17-ReachabilityCardinality-01
FORMULA_NAME HealthRecord-PT-17-ReachabilityCardinality-02
FORMULA_NAME HealthRecord-PT-17-ReachabilityCardinality-03
FORMULA_NAME HealthRecord-PT-17-ReachabilityCardinality-04
FORMULA_NAME HealthRecord-PT-17-ReachabilityCardinality-05
FORMULA_NAME HealthRecord-PT-17-ReachabilityCardinality-06
FORMULA_NAME HealthRecord-PT-17-ReachabilityCardinality-07
FORMULA_NAME HealthRecord-PT-17-ReachabilityCardinality-08
FORMULA_NAME HealthRecord-PT-17-ReachabilityCardinality-09
FORMULA_NAME HealthRecord-PT-17-ReachabilityCardinality-10
FORMULA_NAME HealthRecord-PT-17-ReachabilityCardinality-11
FORMULA_NAME HealthRecord-PT-17-ReachabilityCardinality-12
FORMULA_NAME HealthRecord-PT-17-ReachabilityCardinality-13
FORMULA_NAME HealthRecord-PT-17-ReachabilityCardinality-14
FORMULA_NAME HealthRecord-PT-17-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678646302333

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=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HealthRecord-PT-17
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 18:38:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-12 18:38:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 18:38:25] [INFO ] Load time of PNML (sax parser for PT used): 129 ms
[2023-03-12 18:38:25] [INFO ] Transformed 624 places.
[2023-03-12 18:38:25] [INFO ] Transformed 828 transitions.
[2023-03-12 18:38:25] [INFO ] Found NUPN structural information;
[2023-03-12 18:38:25] [INFO ] Parsed PT model containing 624 places and 828 transitions and 1879 arcs in 247 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 25 ms.
Working with output stream class java.io.PrintStream
FORMULA HealthRecord-PT-17-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-17-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-17-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-17-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 86 resets, run finished after 730 ms. (steps per millisecond=13 ) properties (out of 12) seen :4
FORMULA HealthRecord-PT-17-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-17-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-17-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-17-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 14 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 164 ms. (steps per millisecond=60 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 14 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 14 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 828 rows 624 cols
[2023-03-12 18:38:26] [INFO ] Computed 18 place invariants in 23 ms
[2023-03-12 18:38:27] [INFO ] After 679ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-12 18:38:27] [INFO ] [Nat]Absence check using 10 positive place invariants in 39 ms returned sat
[2023-03-12 18:38:27] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 19 ms returned sat
[2023-03-12 18:38:28] [INFO ] After 856ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :5
[2023-03-12 18:38:29] [INFO ] Deduced a trap composed of 128 places in 283 ms of which 9 ms to minimize.
[2023-03-12 18:38:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 378 ms
[2023-03-12 18:38:29] [INFO ] Deduced a trap composed of 131 places in 186 ms of which 1 ms to minimize.
[2023-03-12 18:38:30] [INFO ] Deduced a trap composed of 130 places in 179 ms of which 1 ms to minimize.
[2023-03-12 18:38:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 496 ms
[2023-03-12 18:38:30] [INFO ] After 2158ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :5
Attempting to minimize the solution found.
Minimization took 284 ms.
[2023-03-12 18:38:30] [INFO ] After 3189ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :5
FORMULA HealthRecord-PT-17-ReachabilityCardinality-15 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA HealthRecord-PT-17-ReachabilityCardinality-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA HealthRecord-PT-17-ReachabilityCardinality-07 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 8 Parikh solutions to 5 different solutions.
FORMULA HealthRecord-PT-17-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-17-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 2 properties in 96 ms.
Support contains 73 out of 624 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 624/624 places, 828/828 transitions.
Graph (trivial) has 587 edges and 624 vertex of which 48 / 624 are part of one of the 17 SCC in 7 ms
Free SCC test removed 31 places
Drop transitions removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Graph (complete) has 1246 edges and 593 vertex of which 584 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.4 ms
Discarding 9 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 212 transitions
Trivial Post-agglo rules discarded 212 transitions
Performed 212 trivial Post agglomeration. Transition count delta: 212
Iterating post reduction 0 with 212 rules applied. Total rules applied 214 place count 584 transition count 564
Reduce places removed 212 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 233 rules applied. Total rules applied 447 place count 372 transition count 543
Reduce places removed 8 places and 0 transitions.
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Iterating post reduction 2 with 37 rules applied. Total rules applied 484 place count 364 transition count 514
Reduce places removed 29 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 31 rules applied. Total rules applied 515 place count 335 transition count 512
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 516 place count 334 transition count 512
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 10 Pre rules applied. Total rules applied 516 place count 334 transition count 502
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 5 with 20 rules applied. Total rules applied 536 place count 324 transition count 502
Discarding 72 places :
Symmetric choice reduction at 5 with 72 rule applications. Total rules 608 place count 252 transition count 374
Iterating global reduction 5 with 72 rules applied. Total rules applied 680 place count 252 transition count 374
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 682 place count 252 transition count 372
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 693 place count 241 transition count 351
Iterating global reduction 6 with 11 rules applied. Total rules applied 704 place count 241 transition count 351
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 706 place count 239 transition count 349
Iterating global reduction 6 with 2 rules applied. Total rules applied 708 place count 239 transition count 349
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 709 place count 238 transition count 347
Iterating global reduction 6 with 1 rules applied. Total rules applied 710 place count 238 transition count 347
Performed 35 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 35 places in 2 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 6 with 70 rules applied. Total rules applied 780 place count 203 transition count 311
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 781 place count 203 transition count 310
Performed 15 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 15 places in 2 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 7 with 30 rules applied. Total rules applied 811 place count 188 transition count 388
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 819 place count 188 transition count 380
Drop transitions removed 29 transitions
Redundant transition composition rules discarded 29 transitions
Iterating global reduction 8 with 29 rules applied. Total rules applied 848 place count 188 transition count 351
Free-agglomeration rule applied 21 times.
Iterating global reduction 8 with 21 rules applied. Total rules applied 869 place count 188 transition count 330
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 8 with 21 rules applied. Total rules applied 890 place count 167 transition count 330
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 892 place count 167 transition count 328
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 9 with 1 rules applied. Total rules applied 893 place count 167 transition count 328
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 894 place count 166 transition count 328
Applied a total of 894 rules in 265 ms. Remains 166 /624 variables (removed 458) and now considering 328/828 (removed 500) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 266 ms. Remains : 166/624 places, 328/828 transitions.
Incomplete random walk after 10000 steps, including 307 resets, run finished after 204 ms. (steps per millisecond=49 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 58 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 63 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 633319 steps, run timeout after 3001 ms. (steps per millisecond=211 ) properties seen :{}
Probabilistic random walk after 633319 steps, saw 118681 distinct states, run finished after 3006 ms. (steps per millisecond=210 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-12 18:38:34] [INFO ] Flow matrix only has 323 transitions (discarded 5 similar events)
// Phase 1: matrix 323 rows 166 cols
[2023-03-12 18:38:34] [INFO ] Computed 11 place invariants in 4 ms
[2023-03-12 18:38:34] [INFO ] After 144ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 18:38:34] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-12 18:38:34] [INFO ] [Nat]Absence check using 3 positive and 8 generalized place invariants in 12 ms returned sat
[2023-03-12 18:38:34] [INFO ] After 232ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 18:38:34] [INFO ] State equation strengthened by 17 read => feed constraints.
[2023-03-12 18:38:34] [INFO ] After 121ms SMT Verify possible using 17 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-12 18:38:35] [INFO ] Deduced a trap composed of 31 places in 101 ms of which 3 ms to minimize.
[2023-03-12 18:38:35] [INFO ] Deduced a trap composed of 32 places in 106 ms of which 1 ms to minimize.
[2023-03-12 18:38:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 257 ms
[2023-03-12 18:38:35] [INFO ] After 510ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 116 ms.
[2023-03-12 18:38:35] [INFO ] After 983ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 9 ms.
Support contains 73 out of 166 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 166/166 places, 328/328 transitions.
Applied a total of 0 rules in 14 ms. Remains 166 /166 variables (removed 0) and now considering 328/328 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 166/166 places, 328/328 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 166/166 places, 328/328 transitions.
Applied a total of 0 rules in 10 ms. Remains 166 /166 variables (removed 0) and now considering 328/328 (removed 0) transitions.
[2023-03-12 18:38:35] [INFO ] Flow matrix only has 323 transitions (discarded 5 similar events)
[2023-03-12 18:38:35] [INFO ] Invariant cache hit.
[2023-03-12 18:38:35] [INFO ] Implicit Places using invariants in 118 ms returned []
[2023-03-12 18:38:35] [INFO ] Flow matrix only has 323 transitions (discarded 5 similar events)
[2023-03-12 18:38:35] [INFO ] Invariant cache hit.
[2023-03-12 18:38:35] [INFO ] State equation strengthened by 17 read => feed constraints.
[2023-03-12 18:38:35] [INFO ] Implicit Places using invariants and state equation in 292 ms returned []
Implicit Place search using SMT with State Equation took 413 ms to find 0 implicit places.
[2023-03-12 18:38:35] [INFO ] Redundant transitions in 25 ms returned []
[2023-03-12 18:38:35] [INFO ] Flow matrix only has 323 transitions (discarded 5 similar events)
[2023-03-12 18:38:35] [INFO ] Invariant cache hit.
[2023-03-12 18:38:36] [INFO ] Dead Transitions using invariants and state equation in 324 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 807 ms. Remains : 166/166 places, 328/328 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 166 transition count 323
Drop transitions removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 1 with 18 rules applied. Total rules applied 23 place count 166 transition count 305
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 166 transition count 305
Applied a total of 24 rules in 27 ms. Remains 166 /166 variables (removed 0) and now considering 305/328 (removed 23) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 305 rows 166 cols
[2023-03-12 18:38:36] [INFO ] Computed 11 place invariants in 2 ms
[2023-03-12 18:38:36] [INFO ] After 174ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 18:38:36] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-12 18:38:36] [INFO ] [Nat]Absence check using 3 positive and 8 generalized place invariants in 13 ms returned sat
[2023-03-12 18:38:36] [INFO ] After 240ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 18:38:37] [INFO ] Deduced a trap composed of 41 places in 69 ms of which 3 ms to minimize.
[2023-03-12 18:38:37] [INFO ] Deduced a trap composed of 25 places in 99 ms of which 1 ms to minimize.
[2023-03-12 18:38:37] [INFO ] Deduced a trap composed of 35 places in 88 ms of which 0 ms to minimize.
[2023-03-12 18:38:37] [INFO ] Deduced a trap composed of 36 places in 92 ms of which 0 ms to minimize.
[2023-03-12 18:38:37] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 423 ms
[2023-03-12 18:38:37] [INFO ] After 774ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 97 ms.
[2023-03-12 18:38:37] [INFO ] After 1006ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2023-03-12 18:38:37] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 12 ms.
[2023-03-12 18:38:37] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 166 places, 328 transitions and 1156 arcs took 2 ms.
[2023-03-12 18:38:37] [INFO ] Flatten gal took : 94 ms
Total runtime 13067 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --invariant=/tmp/517/inv_0_ --invariant=/tmp/517/inv_1_ --invariant=/tmp/517/inv_2_ --inv-par
FORMULA HealthRecord-PT-17-ReachabilityCardinality-08 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA HealthRecord-PT-17-ReachabilityCardinality-11 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA HealthRecord-PT-17-ReachabilityCardinality-14 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN

BK_STOP 1678646752567

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
mcc2023
rfs formula name HealthRecord-PT-17-ReachabilityCardinality-08
rfs formula type EF
rfs formula formula --invariant=/tmp/517/inv_0_
rfs formula name HealthRecord-PT-17-ReachabilityCardinality-11
rfs formula type EF
rfs formula formula --invariant=/tmp/517/inv_1_
rfs formula name HealthRecord-PT-17-ReachabilityCardinality-14
rfs formula type AG
rfs formula formula --invariant=/tmp/517/inv_2_
pnml2lts-sym: Exploration order is bfs-prev
pnml2lts-sym: Saturation strategy is sat
pnml2lts-sym: Guided search strategy is unguided
pnml2lts-sym: Attractor strategy is default
pnml2lts-sym: opening model.pnml
pnml2lts-sym: Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-sym: Petri net has 166 places, 328 transitions and 1156 arcs
pnml2lts-sym: Petri net HealthRecord_PT_17 analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-sym: Initializing regrouping layer
pnml2lts-sym: Regroup specification: bs,w2W,ru,hf
pnml2lts-sym: Regroup Boost's Sloan
pnml2lts-sym: Regroup over-approximate must-write to may-write
pnml2lts-sym: Regroup Row sUbsume
pnml2lts-sym: Reqroup Horizontal Flip
pnml2lts-sym: Regrouping: 328->280 groups
pnml2lts-sym: Regrouping took 0.070 real 0.070 user 0.000 sys
pnml2lts-sym: state vector length is 166; there are 280 groups
pnml2lts-sym: Creating a multi-core ListDD domain.
pnml2lts-sym: Sylvan allocates 15.000 GB virtual memory for nodes table and operation cache.
pnml2lts-sym: Initial nodes table and operation cache requires 60.00 MB.
pnml2lts-sym: Using GBgetTransitionsShortR2W as next-state function
pnml2lts-sym: got initial state
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/517/inv_1_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/517/inv_0_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/517/inv_2_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym: all invariants violated
pnml2lts-sym: exiting now
pnml2lts-sym: invariant detection took 432.960 real 1729.090 user 0.840 sys
pnml2lts-sym: max token count: 1

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-17"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is HealthRecord-PT-17, 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 r201-smll-167840347700366"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/HealthRecord-PT-17.tgz
mv HealthRecord-PT-17 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 ;