fond
Model Checking Contest 2026
16th edition, Hamburg, Germany, June 23, 2026
Execution of r114-smll-177955740400055
Last Updated
Jun 17, 2026

About the Execution of ITS-Tools for DoubleLock-PT-p3s2

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
2216.695 80754.00 183661.00 300.40 FTFFTFTTFTTTFTTF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r114-smll-177955740400055.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5973
Executing tool itstools
Input is DoubleLock-PT-p3s2, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r114-smll-177955740400055
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 764K
-rw-r--r-- 1 mcc users 6.7K Mar 6 18:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Mar 6 18:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Mar 6 18:09 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Mar 6 18:09 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 15 09:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 15 09:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 09:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 09:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Mar 6 18:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 130K Mar 6 18:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Mar 6 18:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Mar 6 18:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 09:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 09:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 330K Mar 3 18:30 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME DoubleLock-PT-p3s2-ReachabilityFireability-2024-00
FORMULA_NAME DoubleLock-PT-p3s2-ReachabilityFireability-2024-01
FORMULA_NAME DoubleLock-PT-p3s2-ReachabilityFireability-2024-02
FORMULA_NAME DoubleLock-PT-p3s2-ReachabilityFireability-2024-03
FORMULA_NAME DoubleLock-PT-p3s2-ReachabilityFireability-2024-04
FORMULA_NAME DoubleLock-PT-p3s2-ReachabilityFireability-2024-05
FORMULA_NAME DoubleLock-PT-p3s2-ReachabilityFireability-2024-06
FORMULA_NAME DoubleLock-PT-p3s2-ReachabilityFireability-2024-07
FORMULA_NAME DoubleLock-PT-p3s2-ReachabilityFireability-2024-08
FORMULA_NAME DoubleLock-PT-p3s2-ReachabilityFireability-2024-09
FORMULA_NAME DoubleLock-PT-p3s2-ReachabilityFireability-2024-10
FORMULA_NAME DoubleLock-PT-p3s2-ReachabilityFireability-2024-11
FORMULA_NAME DoubleLock-PT-p3s2-ReachabilityFireability-2024-12
FORMULA_NAME DoubleLock-PT-p3s2-ReachabilityFireability-2024-13
FORMULA_NAME DoubleLock-PT-p3s2-ReachabilityFireability-2024-14
FORMULA_NAME DoubleLock-PT-p3s2-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1779626851483

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleLock-PT-p3s2
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202604301425
[2026-05-24 12:47:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-24 12:47:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 12:47:34] [INFO ] Load time of PNML (sax parser for PT used): 317 ms
[2026-05-24 12:47:34] [INFO ] Transformed 112 places.
[2026-05-24 12:47:34] [INFO ] Transformed 744 transitions.
[2026-05-24 12:47:34] [INFO ] Parsed PT model containing 112 places and 744 transitions and 3008 arcs in 578 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 31 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 20 places in 10 ms
Reduce places removed 20 places and 32 transitions.
FORMULA DoubleLock-PT-p3s2-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleLock-PT-p3s2-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleLock-PT-p3s2-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40013 steps (479 resets) in 1812 ms. (22 steps per ms) remains 11/13 properties
FORMULA DoubleLock-PT-p3s2-ReachabilityFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleLock-PT-p3s2-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (105 resets) in 807 ms. (49 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (101 resets) in 281 ms. (141 steps per ms) remains 11/11 properties
[2026-05-24 12:47:35] [INFO ] Flatten gal took : 304 ms
BEST_FIRST walk for 40003 steps (99 resets) in 511 ms. (78 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (108 resets) in 131 ms. (303 steps per ms) remains 11/11 properties
[2026-05-24 12:47:35] [INFO ] Flatten gal took : 154 ms
BEST_FIRST walk for 40004 steps (99 resets) in 416 ms. (95 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (96 resets) in 502 ms. (79 steps per ms) remains 11/11 properties
[2026-05-24 12:47:36] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality699374859006910034.gal : 162 ms
BEST_FIRST walk for 40003 steps (74 resets) in 604 ms. (66 steps per ms) remains 11/11 properties
[2026-05-24 12:47:36] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13645890982245012804.prop : 14 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.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality699374859006910034.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13645890982245012804.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
BEST_FIRST walk for 40003 steps (95 resets) in 913 ms. (43 steps per ms) remains 11/11 properties
Loading property file /tmp/ReachabilityCardinality13645890982245012804.prop.
SDD proceeding with computation,11 properties remain. new max is 4
SDD size :1 after 11
SDD proceeding with computation,11 properties remain. new max is 8
SDD size :11 after 65
SDD proceeding with computation,11 properties remain. new max is 16
SDD size :65 after 413
BEST_FIRST walk for 40004 steps (89 resets) in 387 ms. (103 steps per ms) remains 10/11 properties
FORMULA DoubleLock-PT-p3s2-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
SDD proceeding with computation,11 properties remain. new max is 32
SDD size :413 after 982
BEST_FIRST walk for 40003 steps (105 resets) in 79 ms. (500 steps per ms) remains 10/10 properties
SDD proceeding with computation,11 properties remain. new max is 64
SDD size :982 after 4796
BEST_FIRST walk for 40004 steps (91 resets) in 74 ms. (533 steps per ms) remains 10/10 properties
SDD proceeding with computation,11 properties remain. new max is 128
SDD size :4796 after 56527
SDD proceeding with computation,11 properties remain. new max is 256
SDD size :56527 after 215947
[2026-05-24 12:47:36] [INFO ] Flow matrix only has 515 transitions (discarded 197 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10975218119365161608.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11503859205255295870.kers'
[2026-05-24 12:47:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10975218119365161608.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11503859205255295870.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 515 rows 91 cols 1966 entries
Finished phase 1 with 88 SingleSign rule and 0 generalized
[2026-05-24 12:47:36] [INFO ] Computed 4 invariants in 2 ms
Computed 4 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-11503859205255295870.kers
Total runtime 5 ms.
SDD proceeding with computation,11 properties remain. new max is 512
SDD size :215947 after 533977
[2026-05-24 12:47:36] [INFO ] State equation strengthened by 47 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem DoubleLock-PT-p3s2-ReachabilityFireability-2024-01 is UNSAT
FORMULA DoubleLock-PT-p3s2-ReachabilityFireability-2024-01 TRUE TECHNIQUES SMT_REFINEMENT
Problem DoubleLock-PT-p3s2-ReachabilityFireability-2024-06 is UNSAT
FORMULA DoubleLock-PT-p3s2-ReachabilityFireability-2024-06 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 18/88 variables, 3/3 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 0/3 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 1/89 variables, 1/4 constraints. Problems are: Problem set: 2 solved, 8 unsolved
SDD proceeding with computation,11 properties remain. new max is 1024
SDD size :533977 after 1.16893e+06
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/4 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 515/604 variables, 89/93 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/604 variables, 47/140 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/604 variables, 0/140 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 3/607 variables, 3/143 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/607 variables, 0/143 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 0/607 variables, 0/143 constraints. Problems are: Problem set: 2 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 607/607 variables, and 143 constraints, problems are : Problem set: 2 solved, 8 unsolved in 1161 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 92/92 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 10/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 23/88 variables, 3/3 constraints. Problems are: Problem set: 2 solved, 8 unsolved
Problem DoubleLock-PT-p3s2-ReachabilityFireability-2024-00 is UNSAT
FORMULA DoubleLock-PT-p3s2-ReachabilityFireability-2024-00 FALSE TECHNIQUES SMT_REFINEMENT
Problem DoubleLock-PT-p3s2-ReachabilityFireability-2024-02 is UNSAT
FORMULA DoubleLock-PT-p3s2-ReachabilityFireability-2024-02 FALSE TECHNIQUES SMT_REFINEMENT
Problem DoubleLock-PT-p3s2-ReachabilityFireability-2024-03 is UNSAT
FORMULA DoubleLock-PT-p3s2-ReachabilityFireability-2024-03 FALSE TECHNIQUES SMT_REFINEMENT
Problem DoubleLock-PT-p3s2-ReachabilityFireability-2024-04 is UNSAT
FORMULA DoubleLock-PT-p3s2-ReachabilityFireability-2024-04 TRUE TECHNIQUES SMT_REFINEMENT
Problem DoubleLock-PT-p3s2-ReachabilityFireability-2024-05 is UNSAT
FORMULA DoubleLock-PT-p3s2-ReachabilityFireability-2024-05 FALSE TECHNIQUES SMT_REFINEMENT
Problem DoubleLock-PT-p3s2-ReachabilityFireability-2024-12 is UNSAT
FORMULA DoubleLock-PT-p3s2-ReachabilityFireability-2024-12 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 4/7 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 0/7 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 1/89 variables, 1/8 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/89 variables, 0/8 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 515/604 variables, 89/97 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/604 variables, 47/144 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/604 variables, 0/144 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 3/607 variables, 3/147 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/607 variables, 1/148 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/607 variables, 0/148 constraints. Problems are: Problem set: 8 solved, 2 unsolved
SDD proceeding with computation,11 properties remain. new max is 2048
SDD size :1.16893e+06 after 2.43748e+06
At refinement iteration 12 (OVERLAPS) 0/607 variables, 0/148 constraints. Problems are: Problem set: 8 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 607/607 variables, and 148 constraints, problems are : Problem set: 8 solved, 2 unsolved in 1738 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 92/92 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3110ms problems are : Problem set: 8 solved, 2 unsolved
Parikh walk visited 0 properties in 581 ms.
Support contains 40 out of 92 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 92/92 places, 712/712 transitions.
Graph (complete) has 1229 edges and 92 vertex of which 89 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.13 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 89 transition count 708
Applied a total of 5 rules in 118 ms. Remains 89 /92 variables (removed 3) and now considering 708/712 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 131 ms. Remains : 89/92 places, 708/712 transitions.
RANDOM walk for 40009 steps (472 resets) in 150 ms. (264 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (98 resets) in 435 ms. (91 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (91 resets) in 107 ms. (370 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 487821 steps, run timeout after 3001 ms. (steps per millisecond=162 ) properties seen :1 out of 2
Probabilistic random walk after 487821 steps, saw 342885 distinct states, run finished after 3009 ms. (steps per millisecond=162 ) properties seen :1
FORMULA DoubleLock-PT-p3s2-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
[2026-05-24 12:47:43] [INFO ] Flow matrix only has 511 transitions (discarded 197 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2402745104810734385.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4008742472724568914.kers'
[2026-05-24 12:47:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2402745104810734385.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4008742472724568914.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 511 rows 89 cols 1934 entries
Finished phase 1 with 86 SingleSign rule and 1 generalized
[2026-05-24 12:47:43] [INFO ] Computed 2 invariants in 2 ms
Computed 2 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-4008742472724568914.kers
Total runtime 3 ms.
[2026-05-24 12:47:43] [INFO ] State equation strengthened by 47 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/45 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 13/58 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 489/547 variables, 58/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/547 variables, 31/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/547 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 53/600 variables, 31/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/600 variables, 16/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/600 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/600 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 600/600 variables, and 138 constraints, problems are : Problem set: 0 solved, 1 unsolved in 303 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/45 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 13/58 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 489/547 variables, 58/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/547 variables, 31/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/547 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 53/600 variables, 31/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/600 variables, 16/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/600 variables, 1/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/600 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/600 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 600/600 variables, and 139 constraints, problems are : Problem set: 0 solved, 1 unsolved in 548 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 878ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 37 ms.
Support contains 40 out of 89 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 89/89 places, 708/708 transitions.
Applied a total of 0 rules in 23 ms. Remains 89 /89 variables (removed 0) and now considering 708/708 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 89/89 places, 708/708 transitions.
RANDOM walk for 40003 steps (474 resets) in 107 ms. (370 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (100 resets) in 261 ms. (152 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 561596 steps, run timeout after 3001 ms. (steps per millisecond=187 ) properties seen :0 out of 1
Probabilistic random walk after 561596 steps, saw 401758 distinct states, run finished after 3001 ms. (steps per millisecond=187 ) properties seen :0
[2026-05-24 12:47:48] [INFO ] Flow matrix only has 511 transitions (discarded 197 similar events)
[2026-05-24 12:47:48] [INFO ] Invariant cache hit.
[2026-05-24 12:47:48] [INFO ] State equation strengthened by 47 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/45 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 13/58 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 489/547 variables, 58/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/547 variables, 31/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/547 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 53/600 variables, 31/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/600 variables, 16/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/600 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/600 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 600/600 variables, and 138 constraints, problems are : Problem set: 0 solved, 1 unsolved in 350 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/45 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 13/58 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 489/547 variables, 58/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/547 variables, 31/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/547 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 53/600 variables, 31/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/600 variables, 16/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/600 variables, 1/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/600 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/600 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 600/600 variables, and 139 constraints, problems are : Problem set: 0 solved, 1 unsolved in 546 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 912ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 37 ms.
Support contains 40 out of 89 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 89/89 places, 708/708 transitions.
Applied a total of 0 rules in 21 ms. Remains 89 /89 variables (removed 0) and now considering 708/708 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 89/89 places, 708/708 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 89/89 places, 708/708 transitions.
Applied a total of 0 rules in 20 ms. Remains 89 /89 variables (removed 0) and now considering 708/708 (removed 0) transitions.
[2026-05-24 12:47:49] [INFO ] Flow matrix only has 511 transitions (discarded 197 similar events)
[2026-05-24 12:47:49] [INFO ] Invariant cache hit.
[2026-05-24 12:47:49] [INFO ] Implicit Places using invariants in 114 ms returned []
[2026-05-24 12:47:49] [INFO ] Flow matrix only has 511 transitions (discarded 197 similar events)
[2026-05-24 12:47:49] [INFO ] Invariant cache hit.
[2026-05-24 12:47:49] [INFO ] State equation strengthened by 47 read => feed constraints.
[2026-05-24 12:47:49] [INFO ] Implicit Places using invariants and state equation in 369 ms returned []
Implicit Place search using SMT with State Equation took 498 ms to find 0 implicit places.
[2026-05-24 12:47:49] [INFO ] Redundant transitions in 58 ms returned []
Running 706 sub problems to find dead transitions.
[2026-05-24 12:47:49] [INFO ] Flow matrix only has 511 transitions (discarded 197 similar events)
[2026-05-24 12:47:49] [INFO ] Invariant cache hit.
[2026-05-24 12:47:49] [INFO ] State equation strengthened by 47 read => feed constraints.
SDD proceeding with computation,11 properties remain. new max is 4096
SDD size :2.43748e+06 after 4.9729e+06
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 706 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 706 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 706 unsolved
At refinement iteration 3 (OVERLAPS) 511/600 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 706 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/600 variables, 47/138 constraints. Problems are: Problem set: 0 solved, 706 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/600 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 706 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 6 (OVERLAPS) 0/600 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 706 unsolved
No progress, stopping.
After SMT solving in domain Real declared 600/600 variables, and 138 constraints, problems are : Problem set: 0 solved, 706 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 706/706 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 706 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 706 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 706 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 706 unsolved
At refinement iteration 3 (OVERLAPS) 511/600 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 706 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/600 variables, 47/138 constraints. Problems are: Problem set: 0 solved, 706 unsolved
SDD proceeding with computation,11 properties remain. new max is 8192
SDD size :4.9729e+06 after 1.00429e+07
Problem TDEAD460 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD469 is UNSAT
Problem TDEAD470 is UNSAT
Problem TDEAD471 is UNSAT
Problem TDEAD472 is UNSAT
Problem TDEAD476 is UNSAT
Problem TDEAD477 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD482 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD495 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD503 is UNSAT
Problem TDEAD504 is UNSAT
Problem TDEAD505 is UNSAT
Problem TDEAD506 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD512 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD514 is UNSAT
Problem TDEAD515 is UNSAT
Problem TDEAD516 is UNSAT
Problem TDEAD517 is UNSAT
Problem TDEAD518 is UNSAT
Problem TDEAD519 is UNSAT
Problem TDEAD520 is UNSAT
Problem TDEAD521 is UNSAT
Problem TDEAD522 is UNSAT
Problem TDEAD523 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD525 is UNSAT
Problem TDEAD526 is UNSAT
Problem TDEAD530 is UNSAT
Problem TDEAD531 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD536 is UNSAT
Problem TDEAD540 is UNSAT
Problem TDEAD543 is UNSAT
Problem TDEAD544 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD553 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD558 is UNSAT
Problem TDEAD559 is UNSAT
Problem TDEAD560 is UNSAT
Problem TDEAD561 is UNSAT
Problem TDEAD562 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD565 is UNSAT
Problem TDEAD566 is UNSAT
Problem TDEAD567 is UNSAT
Problem TDEAD568 is UNSAT
Problem TDEAD569 is UNSAT
Problem TDEAD570 is UNSAT
Problem TDEAD571 is UNSAT
Problem TDEAD572 is UNSAT
Problem TDEAD573 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD575 is UNSAT
Problem TDEAD576 is UNSAT
Problem TDEAD577 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD579 is UNSAT
Problem TDEAD580 is UNSAT
Problem TDEAD584 is UNSAT
Problem TDEAD585 is UNSAT
Problem TDEAD589 is UNSAT
Problem TDEAD590 is UNSAT
Problem TDEAD594 is UNSAT
Problem TDEAD597 is UNSAT
Problem TDEAD598 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD603 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD608 is UNSAT
Problem TDEAD610 is UNSAT
Problem TDEAD611 is UNSAT
Problem TDEAD612 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD614 is UNSAT
Problem TDEAD615 is UNSAT
Problem TDEAD616 is UNSAT
Problem TDEAD617 is UNSAT
Problem TDEAD618 is UNSAT
Problem TDEAD619 is UNSAT
Problem TDEAD620 is UNSAT
Problem TDEAD621 is UNSAT
Problem TDEAD622 is UNSAT
Problem TDEAD623 is UNSAT
Problem TDEAD624 is UNSAT
Problem TDEAD625 is UNSAT
Problem TDEAD626 is UNSAT
Problem TDEAD627 is UNSAT
Problem TDEAD628 is UNSAT
Problem TDEAD629 is UNSAT
Problem TDEAD630 is UNSAT
Problem TDEAD631 is UNSAT
Problem TDEAD632 is UNSAT
Problem TDEAD633 is UNSAT
Problem TDEAD634 is UNSAT
Problem TDEAD638 is UNSAT
Problem TDEAD639 is UNSAT
Problem TDEAD643 is UNSAT
Problem TDEAD644 is UNSAT
Problem TDEAD648 is UNSAT
Problem TDEAD651 is UNSAT
Problem TDEAD652 is UNSAT
Problem TDEAD656 is UNSAT
Problem TDEAD657 is UNSAT
Problem TDEAD661 is UNSAT
Problem TDEAD662 is UNSAT
Problem TDEAD664 is UNSAT
Problem TDEAD665 is UNSAT
Problem TDEAD666 is UNSAT
Problem TDEAD667 is UNSAT
Problem TDEAD668 is UNSAT
Problem TDEAD669 is UNSAT
Problem TDEAD670 is UNSAT
Problem TDEAD671 is UNSAT
Problem TDEAD672 is UNSAT
Problem TDEAD673 is UNSAT
Problem TDEAD674 is UNSAT
Problem TDEAD675 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/600 variables, 706/844 constraints. Problems are: Problem set: 144 solved, 562 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 600/600 variables, and 844 constraints, problems are : Problem set: 144 solved, 562 unsolved in 30054 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 706/706 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60573ms problems are : Problem set: 144 solved, 562 unsolved
Search for dead transitions found 144 dead transitions in 60580ms
Found 144 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 144 transitions
Dead transitions reduction (with SMT) removed 144 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 89/89 places, 564/708 transitions.
Graph (complete) has 966 edges and 89 vertex of which 85 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Discarding 4 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 16 ms. Remains 85 /89 variables (removed 4) and now considering 564/564 (removed 0) transitions.
[2026-05-24 12:48:50] [INFO ] Flow matrix only has 385 transitions (discarded 179 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9910933829209079876.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1649451042629671458.kers'
[2026-05-24 12:48:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9910933829209079876.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1649451042629671458.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 385 rows 85 cols 1430 entries
Finished phase 1 with 84 SingleSign rule and 0 generalized
[2026-05-24 12:48:50] [INFO ] Computed 1 invariants in 2 ms
Computed 1 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-1649451042629671458.kers
Total runtime 3 ms.
[2026-05-24 12:48:50] [INFO ] Implicit Places using invariants in 85 ms returned []
[2026-05-24 12:48:50] [INFO ] Flow matrix only has 385 transitions (discarded 179 similar events)
[2026-05-24 12:48:50] [INFO ] Invariant cache hit.
[2026-05-24 12:48:50] [INFO ] State equation strengthened by 41 read => feed constraints.
[2026-05-24 12:48:50] [INFO ] Implicit Places using invariants and state equation in 300 ms returned []
Implicit Place search using SMT with State Equation took 389 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 85/89 places, 564/708 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 61612 ms. Remains : 85/89 places, 564/708 transitions.
RANDOM walk for 40010 steps (470 resets) in 102 ms. (388 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (98 resets) in 185 ms. (215 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 295045 steps, run visited all 1 properties in 1361 ms. (steps per millisecond=216 )
Probabilistic random walk after 295045 steps, saw 206867 distinct states, run finished after 1369 ms. (steps per millisecond=215 ) properties seen :1
FORMULA DoubleLock-PT-p3s2-ReachabilityFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
All properties solved without resorting to model-checking.
Total runtime 78238 ms.

BK_STOP 1779626932237

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ 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.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5973"
echo " Executing tool itstools"
echo " Input is DoubleLock-PT-p3s2, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r114-smll-177955740400055"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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