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

About the Execution of LTSMin+red for ClientsAndServers-PT-N2000P0

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16196.048 3594590.00 14298578.00 825.60 FTTTFFTTTTTTTFFF 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.r073-smll-167814399400350.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 ClientsAndServers-PT-N2000P0, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r073-smll-167814399400350
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 7.1K Feb 26 13:15 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Feb 26 13:15 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Feb 26 13:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 26 13:14 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.8K Feb 25 15:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 15:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 13:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 140K Feb 26 13:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Feb 26 13:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Feb 26 13:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 15:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 8 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 9.2K 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 ClientsAndServers-PT-N2000P0-ReachabilityCardinality-00
FORMULA_NAME ClientsAndServers-PT-N2000P0-ReachabilityCardinality-01
FORMULA_NAME ClientsAndServers-PT-N2000P0-ReachabilityCardinality-02
FORMULA_NAME ClientsAndServers-PT-N2000P0-ReachabilityCardinality-03
FORMULA_NAME ClientsAndServers-PT-N2000P0-ReachabilityCardinality-04
FORMULA_NAME ClientsAndServers-PT-N2000P0-ReachabilityCardinality-05
FORMULA_NAME ClientsAndServers-PT-N2000P0-ReachabilityCardinality-06
FORMULA_NAME ClientsAndServers-PT-N2000P0-ReachabilityCardinality-07
FORMULA_NAME ClientsAndServers-PT-N2000P0-ReachabilityCardinality-08
FORMULA_NAME ClientsAndServers-PT-N2000P0-ReachabilityCardinality-09
FORMULA_NAME ClientsAndServers-PT-N2000P0-ReachabilityCardinality-10
FORMULA_NAME ClientsAndServers-PT-N2000P0-ReachabilityCardinality-11
FORMULA_NAME ClientsAndServers-PT-N2000P0-ReachabilityCardinality-12
FORMULA_NAME ClientsAndServers-PT-N2000P0-ReachabilityCardinality-13
FORMULA_NAME ClientsAndServers-PT-N2000P0-ReachabilityCardinality-14
FORMULA_NAME ClientsAndServers-PT-N2000P0-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678439492286

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=ClientsAndServers-PT-N2000P0
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-10 09:11:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-10 09:11:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 09:11:35] [INFO ] Load time of PNML (sax parser for PT used): 34 ms
[2023-03-10 09:11:35] [INFO ] Transformed 25 places.
[2023-03-10 09:11:35] [INFO ] Transformed 18 transitions.
[2023-03-10 09:11:35] [INFO ] Parsed PT model containing 25 places and 18 transitions and 54 arcs in 145 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 29 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 16001 steps, including 0 resets, run finished after 27 ms. (steps per millisecond=592 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=18 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=30 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=23 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=22 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=30 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=29 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=20 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=20 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 16) seen :0
Interrupted probabilistic random walk after 104288 steps, run timeout after 3001 ms. (steps per millisecond=34 ) properties seen :{6=1}
Probabilistic random walk after 104288 steps, saw 76190 distinct states, run finished after 3004 ms. (steps per millisecond=34 ) properties seen :1
FORMULA ClientsAndServers-PT-N2000P0-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 15 properties.
// Phase 1: matrix 18 rows 25 cols
[2023-03-10 09:11:39] [INFO ] Computed 8 place invariants in 5 ms
[2023-03-10 09:11:39] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-10 09:11:39] [INFO ] [Real]Absence check using 5 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-10 09:11:39] [INFO ] After 266ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:12
[2023-03-10 09:11:39] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-10 09:11:39] [INFO ] [Nat]Absence check using 5 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-10 09:11:39] [INFO ] After 75ms SMT Verify possible using state equation in natural domain returned unsat :8 sat :7
[2023-03-10 09:11:39] [INFO ] After 161ms SMT Verify possible using trap constraints in natural domain returned unsat :8 sat :7
Attempting to minimize the solution found.
Minimization took 78 ms.
[2023-03-10 09:11:39] [INFO ] After 370ms SMT Verify possible using all constraints in natural domain returned unsat :8 sat :7
FORMULA ClientsAndServers-PT-N2000P0-ReachabilityCardinality-15 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ClientsAndServers-PT-N2000P0-ReachabilityCardinality-13 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ClientsAndServers-PT-N2000P0-ReachabilityCardinality-08 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ClientsAndServers-PT-N2000P0-ReachabilityCardinality-07 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ClientsAndServers-PT-N2000P0-ReachabilityCardinality-04 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ClientsAndServers-PT-N2000P0-ReachabilityCardinality-03 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ClientsAndServers-PT-N2000P0-ReachabilityCardinality-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ClientsAndServers-PT-N2000P0-ReachabilityCardinality-00 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 15 Parikh solutions to 7 different solutions.
FORMULA ClientsAndServers-PT-N2000P0-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ClientsAndServers-PT-N2000P0-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ClientsAndServers-PT-N2000P0-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ClientsAndServers-PT-N2000P0-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ClientsAndServers-PT-N2000P0-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ClientsAndServers-PT-N2000P0-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 6 properties in 11238 ms.
Support contains 12 out of 25 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 23 transition count 18
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 2 place count 23 transition count 16
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 6 place count 21 transition count 16
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 1 with 2 rules applied. Total rules applied 8 place count 20 transition count 15
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 20 transition count 14
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 10 place count 19 transition count 14
Applied a total of 10 rules in 27 ms. Remains 19 /25 variables (removed 6) and now considering 14/18 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 19/25 places, 14/18 transitions.
Incomplete random walk after 16001 steps, including 0 resets, run finished after 10 ms. (steps per millisecond=1600 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2008182 steps, run timeout after 3001 ms. (steps per millisecond=669 ) properties seen :{}
Probabilistic random walk after 2008182 steps, saw 1133209 distinct states, run finished after 3002 ms. (steps per millisecond=668 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 14 rows 19 cols
[2023-03-10 09:11:54] [INFO ] Computed 6 place invariants in 2 ms
[2023-03-10 09:11:54] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 09:11:54] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-10 09:11:54] [INFO ] [Nat]Absence check using 5 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-10 09:11:54] [INFO ] After 19ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 09:11:54] [INFO ] After 28ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-03-10 09:11:54] [INFO ] After 73ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 36250 steps, including 0 resets, run visited all 1 properties in 67 ms. (steps per millisecond=541 )
FORMULA ClientsAndServers-PT-N2000P0-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 66 ms.
All properties solved without resorting to model-checking.
Total runtime 19059 ms.
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --invariant=/tmp/461/inv_0_ --invariant=/tmp/461/inv_1_ --invariant=/tmp/461/inv_2_ --invariant=/tmp/461/inv_3_ --invariant=/tmp/461/inv_4_ --invariant=/tmp/461/inv_5_ --invariant=/tmp/461/inv_6_ --invariant=/tmp/461/inv_7_ --invariant=/tmp/461/inv_8_ --invariant=/tmp/461/inv_9_ --invariant=/tmp/461/inv_10_ --invariant=/tmp/461/inv_11_ --invariant=/tmp/461/inv_12_ --invariant=/tmp/461/inv_13_ --invariant=/tmp/461/inv_14_ --invariant=/tmp/461/inv_15_ --inv-par
TIME LIMIT: Killed by timeout after 3570 seconds
MemTotal: 16393216 kB
MemFree: 164988 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16284196 kB
Could not compute solution for formula : ClientsAndServers-PT-N2000P0-ReachabilityCardinality-00
Could not compute solution for formula : ClientsAndServers-PT-N2000P0-ReachabilityCardinality-01
Could not compute solution for formula : ClientsAndServers-PT-N2000P0-ReachabilityCardinality-02
Could not compute solution for formula : ClientsAndServers-PT-N2000P0-ReachabilityCardinality-03
Could not compute solution for formula : ClientsAndServers-PT-N2000P0-ReachabilityCardinality-04
Could not compute solution for formula : ClientsAndServers-PT-N2000P0-ReachabilityCardinality-05
Could not compute solution for formula : ClientsAndServers-PT-N2000P0-ReachabilityCardinality-06
Could not compute solution for formula : ClientsAndServers-PT-N2000P0-ReachabilityCardinality-07
Could not compute solution for formula : ClientsAndServers-PT-N2000P0-ReachabilityCardinality-08
Could not compute solution for formula : ClientsAndServers-PT-N2000P0-ReachabilityCardinality-09
Could not compute solution for formula : ClientsAndServers-PT-N2000P0-ReachabilityCardinality-10
Could not compute solution for formula : ClientsAndServers-PT-N2000P0-ReachabilityCardinality-11
Could not compute solution for formula : ClientsAndServers-PT-N2000P0-ReachabilityCardinality-12
Could not compute solution for formula : ClientsAndServers-PT-N2000P0-ReachabilityCardinality-13
Could not compute solution for formula : ClientsAndServers-PT-N2000P0-ReachabilityCardinality-14
Could not compute solution for formula : ClientsAndServers-PT-N2000P0-ReachabilityCardinality-15

BK_STOP 1678443086876

--------------------
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 ClientsAndServers-PT-N2000P0-ReachabilityCardinality-00
rfs formula type EF
rfs formula formula --invariant=/tmp/461/inv_0_
rfs formula name ClientsAndServers-PT-N2000P0-ReachabilityCardinality-01
rfs formula type EF
rfs formula formula --invariant=/tmp/461/inv_1_
rfs formula name ClientsAndServers-PT-N2000P0-ReachabilityCardinality-02
rfs formula type AG
rfs formula formula --invariant=/tmp/461/inv_2_
rfs formula name ClientsAndServers-PT-N2000P0-ReachabilityCardinality-03
rfs formula type AG
rfs formula formula --invariant=/tmp/461/inv_3_
rfs formula name ClientsAndServers-PT-N2000P0-ReachabilityCardinality-04
rfs formula type EF
rfs formula formula --invariant=/tmp/461/inv_4_
rfs formula name ClientsAndServers-PT-N2000P0-ReachabilityCardinality-05
rfs formula type AG
rfs formula formula --invariant=/tmp/461/inv_5_
rfs formula name ClientsAndServers-PT-N2000P0-ReachabilityCardinality-06
rfs formula type EF
rfs formula formula --invariant=/tmp/461/inv_6_
rfs formula name ClientsAndServers-PT-N2000P0-ReachabilityCardinality-07
rfs formula type AG
rfs formula formula --invariant=/tmp/461/inv_7_
rfs formula name ClientsAndServers-PT-N2000P0-ReachabilityCardinality-08
rfs formula type AG
rfs formula formula --invariant=/tmp/461/inv_8_
rfs formula name ClientsAndServers-PT-N2000P0-ReachabilityCardinality-09
rfs formula type EF
rfs formula formula --invariant=/tmp/461/inv_9_
rfs formula name ClientsAndServers-PT-N2000P0-ReachabilityCardinality-10
rfs formula type EF
rfs formula formula --invariant=/tmp/461/inv_10_
rfs formula name ClientsAndServers-PT-N2000P0-ReachabilityCardinality-11
rfs formula type EF
rfs formula formula --invariant=/tmp/461/inv_11_
rfs formula name ClientsAndServers-PT-N2000P0-ReachabilityCardinality-12
rfs formula type EF
rfs formula formula --invariant=/tmp/461/inv_12_
rfs formula name ClientsAndServers-PT-N2000P0-ReachabilityCardinality-13
rfs formula type EF
rfs formula formula --invariant=/tmp/461/inv_13_
rfs formula name ClientsAndServers-PT-N2000P0-ReachabilityCardinality-14
rfs formula type AG
rfs formula formula --invariant=/tmp/461/inv_14_
rfs formula name ClientsAndServers-PT-N2000P0-ReachabilityCardinality-15
rfs formula type EF
rfs formula formula --invariant=/tmp/461/inv_15_
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 25 places, 18 transitions and 54 arcs
pnml2lts-sym: Petri net ClientsAndServers-PT-N2000P0 analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.000 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: 18->18 groups
pnml2lts-sym: Regrouping took 0.000 real 0.000 user 0.000 sys
pnml2lts-sym: state vector length is 25; there are 18 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: 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: 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: 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: 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: 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
Killing (15) : 467
Killing (9) : 467

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="ClientsAndServers-PT-N2000P0"
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 ClientsAndServers-PT-N2000P0, 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 r073-smll-167814399400350"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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