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.r210-smll-177969942000197.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 PhilosophersDyn-COL-03, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r210-smll-177969942000197
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 408K
-rw-r--r-- 1 mcc users 7.6K Mar 5 13:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Mar 5 13:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Mar 5 13:10 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Mar 5 13:10 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.0K Mar 16 08:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 16 08:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 16 08:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 16 08:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.5K Mar 5 13:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 74K Mar 5 13:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Mar 5 13:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K Mar 5 13:10 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 16 08:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 16 08:39 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 equiv_pt
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 31K 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 positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1779934898278

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PhilosophersDyn-COL-03
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
UpperBounds COL
Running Version 202604301425
[2026-05-28 02:21:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-28 02:21:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-28 02:21:40] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2026-05-28 02:21:41] [WARNING] Using fallBack plugin, rng conformance not checked
[2026-05-28 02:21:42] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1227 ms
[2026-05-28 02:21:42] [INFO ] Imported 8 HL places and 7 HL transitions for a total of 30 PT places and 87.0 transition bindings in 38 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 15 ms.
Reduction of identical properties reduced properties to check from 16 to 6
[2026-05-28 02:21:42] [INFO ] Built PT skeleton of HLPN with 8 places and 7 transitions 33 arcs in 9 ms.
[2026-05-28 02:21:42] [INFO ] Skeletonized 6 HLPN properties in 0 ms.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16360519311515705852.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1936489579098091448.kers'
[2026-05-28 02:21:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16360519311515705852.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1936489579098091448.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 7 rows 7 cols 21 entries
Finished phase 1 with 3 SingleSign rule and 2 generalized
[2026-05-28 02:21:42] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1936489579098091448.kers
Total runtime 1 ms.
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[0, 0, 0, 3, 0, 0] Max Struct:[3, 3, 3, 3, 3, 3]
FORMULA PhilosophersDyn-COL-03-UpperBounds-12 3 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PhilosophersDyn-COL-03-UpperBounds-13 3 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PhilosophersDyn-COL-03-UpperBounds-05 3 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2026-05-28 02:21:42] [INFO ] Invariant cache hit.
[2026-05-28 02:21:42] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2026-05-28 02:21:42] [INFO ] [Real]Absence check using 1 positive and 2 generalized place invariants in 9 ms returned sat
[2026-05-28 02:21:42] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2026-05-28 02:21:42] [INFO ] State equation strengthened by 4 read => feed constraints.
[2026-05-28 02:21:42] [INFO ] [Real]Added 4 Read/Feed constraints in 4 ms returned sat
[2026-05-28 02:21:42] [INFO ] Solution in real domain found non-integer solution.
[2026-05-28 02:21:42] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2026-05-28 02:21:42] [INFO ] [Nat]Absence check using 1 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-28 02:21:42] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2026-05-28 02:21:42] [INFO ] [Nat]Added 4 Read/Feed constraints in 3 ms returned sat
[2026-05-28 02:21:42] [INFO ] Computed and/alt/rep : 6/25/6 causal constraints (skipped 0 transitions) in 5 ms.
[2026-05-28 02:21:42] [INFO ] Added : 4 causal constraints over 2 iterations in 42 ms. Result :sat
Minimization took 130 ms.
[2026-05-28 02:21:42] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-28 02:21:42] [INFO ] [Real]Absence check using 1 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-28 02:21:42] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2026-05-28 02:21:42] [INFO ] Solution in real domain found non-integer solution.
[2026-05-28 02:21:42] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-28 02:21:42] [INFO ] [Nat]Absence check using 1 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-28 02:21:42] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2026-05-28 02:21:42] [INFO ] [Nat]Added 4 Read/Feed constraints in 2 ms returned sat
[2026-05-28 02:21:42] [INFO ] Computed and/alt/rep : 6/25/6 causal constraints (skipped 0 transitions) in 3 ms.
[2026-05-28 02:21:42] [INFO ] Added : 5 causal constraints over 2 iterations in 18 ms. Result :sat
Minimization took 26 ms.
[2026-05-28 02:21:43] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2026-05-28 02:21:43] [INFO ] [Real]Absence check using 1 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-28 02:21:43] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2026-05-28 02:21:43] [INFO ] [Real]Added 4 Read/Feed constraints in 4 ms returned sat
[2026-05-28 02:21:43] [INFO ] Solution in real domain found non-integer solution.
[2026-05-28 02:21:43] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-28 02:21:43] [INFO ] [Nat]Absence check using 1 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-28 02:21:43] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2026-05-28 02:21:43] [INFO ] [Nat]Added 4 Read/Feed constraints in 2 ms returned sat
[2026-05-28 02:21:43] [INFO ] Computed and/alt/rep : 6/25/6 causal constraints (skipped 0 transitions) in 3 ms.
[2026-05-28 02:21:43] [INFO ] Added : 4 causal constraints over 2 iterations in 17 ms. Result :sat
Minimization took 10 ms.
[2026-05-28 02:21:43] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-28 02:21:43] [INFO ] [Real]Absence check using 1 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-28 02:21:43] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2026-05-28 02:21:43] [INFO ] [Real]Added 4 Read/Feed constraints in 2 ms returned sat
[2026-05-28 02:21:43] [INFO ] Solution in real domain found non-integer solution.
[2026-05-28 02:21:43] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2026-05-28 02:21:43] [INFO ] [Nat]Absence check using 1 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-28 02:21:43] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2026-05-28 02:21:43] [INFO ] [Nat]Added 4 Read/Feed constraints in 3 ms returned sat
[2026-05-28 02:21:43] [INFO ] Computed and/alt/rep : 6/25/6 causal constraints (skipped 0 transitions) in 2 ms.
[2026-05-28 02:21:43] [INFO ] Added : 0 causal constraints over 0 iterations in 8 ms. Result :sat
Minimization took 9 ms.
[2026-05-28 02:21:43] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-28 02:21:43] [INFO ] [Real]Absence check using 1 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-28 02:21:43] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2026-05-28 02:21:43] [INFO ] Solution in real domain found non-integer solution.
[2026-05-28 02:21:43] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-28 02:21:43] [INFO ] [Nat]Absence check using 1 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-28 02:21:43] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2026-05-28 02:21:43] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2026-05-28 02:21:43] [INFO ] Computed and/alt/rep : 6/25/6 causal constraints (skipped 0 transitions) in 2 ms.
[2026-05-28 02:21:43] [INFO ] Added : 5 causal constraints over 2 iterations in 24 ms. Result :sat
Minimization took 9 ms.
Current structural bounds on expressions (after SMT on skeleton) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[3, 3, 3, 3, 3]
Domain [Philosopher(3), Philosopher(3)] of place Neighbourhood breaks symmetries in sort Philosopher
[2026-05-28 02:21:43] [INFO ] Unfolded HLPN to a Petri net with 30 places and 84 transitions 564 arcs in 40 ms.
[2026-05-28 02:21:43] [INFO ] Unfolded 5 HLPN properties in 0 ms.
Ensure Unique test removed 3 transitions
Reduce redundant transitions removed 3 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[3, 3, 3, 3, 3]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[3, 3, 3, 3, 3]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16345844621242671171.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5833264029122584634.kers'
[2026-05-28 02:21:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16345844621242671171.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5833264029122584634.kers]
Normalized transition count is 57 out of 81 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 57 rows 30 cols 264 entries
Finished phase 1 with 15 SingleSign rule and 4 generalized
[2026-05-28 02:21:43] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-5833264029122584634.kers
Total runtime 1 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[3, 3, 3, 3, 3]
RANDOM walk for 10000 steps (1441 resets) in 103 ms. (96 steps per ms)
FORMULA PhilosophersDyn-COL-03-UpperBounds-10 3 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PhilosophersDyn-COL-03-UpperBounds-14 3 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PhilosophersDyn-COL-03-UpperBounds-15 3 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PhilosophersDyn-COL-03-UpperBounds-07 3 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PhilosophersDyn-COL-03-UpperBounds-03 3 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PhilosophersDyn-COL-03-UpperBounds-04 3 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PhilosophersDyn-COL-03-UpperBounds-06 3 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PhilosophersDyn-COL-03-UpperBounds-08 3 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PhilosophersDyn-COL-03-UpperBounds-09 3 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PhilosophersDyn-COL-03-UpperBounds-00 3 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 20002 steps (663 resets) in 105 ms. (188 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2, 2] Max Struct:[3, 3]
[2026-05-28 02:21:43] [INFO ] Flow matrix only has 57 transitions (discarded 24 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5699779370182427643.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16257197707085631424.kers'
[2026-05-28 02:21:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5699779370182427643.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16257197707085631424.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 57 rows 30 cols 264 entries
Finished phase 1 with 15 SingleSign rule and 4 generalized
[2026-05-28 02:21:43] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-16257197707085631424.kers
Total runtime 1 ms.
[2026-05-28 02:21:43] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2026-05-28 02:21:43] [INFO ] [Real]Absence check using 10 positive and 1 generalized place invariants in 2 ms returned sat
[2026-05-28 02:21:43] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2026-05-28 02:21:43] [INFO ] State equation strengthened by 36 read => feed constraints.
[2026-05-28 02:21:43] [INFO ] [Real]Added 36 Read/Feed constraints in 15 ms returned sat
[2026-05-28 02:21:43] [INFO ] Solution in real domain found non-integer solution.
[2026-05-28 02:21:43] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2026-05-28 02:21:43] [INFO ] [Nat]Absence check using 10 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-28 02:21:43] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2026-05-28 02:21:43] [INFO ] [Nat]Added 36 Read/Feed constraints in 15 ms returned sat
[2026-05-28 02:21:43] [INFO ] Computed and/alt/rep : 6/45/6 causal constraints (skipped 48 transitions) in 19 ms.
[2026-05-28 02:21:43] [INFO ] Added : 0 causal constraints over 0 iterations in 35 ms. Result :sat
Minimization took 17 ms.
[2026-05-28 02:21:44] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2026-05-28 02:21:44] [INFO ] [Real]Absence check using 10 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-28 02:21:44] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2026-05-28 02:21:44] [INFO ] [Real]Added 36 Read/Feed constraints in 14 ms returned sat
[2026-05-28 02:21:44] [INFO ] Solution in real domain found non-integer solution.
[2026-05-28 02:21:44] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2026-05-28 02:21:44] [INFO ] [Nat]Absence check using 10 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-28 02:21:44] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2026-05-28 02:21:44] [INFO ] [Nat]Added 36 Read/Feed constraints in 13 ms returned sat
[2026-05-28 02:21:44] [INFO ] Computed and/alt/rep : 6/45/6 causal constraints (skipped 48 transitions) in 14 ms.
[2026-05-28 02:21:44] [INFO ] Added : 6 causal constraints over 2 iterations in 55 ms. Result :sat
Minimization took 34 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2, 2] Max Struct:[3, 3]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2, 2] Max Struct:[3, 3]
Support contains 6 out of 30 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 81/81 transitions.
Applied a total of 0 rules in 23 ms. Remains 30 /30 variables (removed 0) and now considering 81/81 (removed 0) transitions.
Running 78 sub problems to find dead transitions.
[2026-05-28 02:21:44] [INFO ] Flow matrix only has 57 transitions (discarded 24 similar events)
[2026-05-28 02:21:44] [INFO ] Invariant cache hit.
[2026-05-28 02:21:44] [INFO ] State equation strengthened by 36 read => feed constraints.
Problem TDEAD3 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD52 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 10/10 constraints. Problems are: Problem set: 20 solved, 58 unsolved
Problem TDEAD11 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD56 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 1/11 constraints. Problems are: Problem set: 30 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/11 constraints. Problems are: Problem set: 30 solved, 48 unsolved
At refinement iteration 3 (OVERLAPS) 57/87 variables, 30/41 constraints. Problems are: Problem set: 30 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 36/77 constraints. Problems are: Problem set: 30 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 0/77 constraints. Problems are: Problem set: 30 solved, 48 unsolved
At refinement iteration 6 (OVERLAPS) 0/87 variables, 0/77 constraints. Problems are: Problem set: 30 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Real declared 87/87 variables, and 77 constraints, problems are : Problem set: 30 solved, 48 unsolved in 1979 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 30/30 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 30 solved, 48 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 10/10 constraints. Problems are: Problem set: 30 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 1/11 constraints. Problems are: Problem set: 30 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/11 constraints. Problems are: Problem set: 30 solved, 48 unsolved
At refinement iteration 3 (OVERLAPS) 57/87 variables, 30/41 constraints. Problems are: Problem set: 30 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 36/77 constraints. Problems are: Problem set: 30 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 48/125 constraints. Problems are: Problem set: 30 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/87 variables, 0/125 constraints. Problems are: Problem set: 30 solved, 48 unsolved
At refinement iteration 7 (OVERLAPS) 0/87 variables, 0/125 constraints. Problems are: Problem set: 30 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Int declared 87/87 variables, and 125 constraints, problems are : Problem set: 30 solved, 48 unsolved in 2873 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 30/30 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 48/78 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5030ms problems are : Problem set: 30 solved, 48 unsolved
Search for dead transitions found 30 dead transitions in 5045ms
Found 30 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 30 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 30 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 30/30 places, 51/81 transitions.
Applied a total of 0 rules in 4 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5114 ms. Remains : 30/30 places, 51/81 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6125227440700223165.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6685358138361122573.kers'
[2026-05-28 02:21:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6125227440700223165.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6685358138361122573.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 51 rows 30 cols 243 entries
Finished phase 1 with 12 SingleSign rule and 7 generalized
[2026-05-28 02:21:49] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-6685358138361122573.kers
Total runtime 1 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[2, 2] Max Struct:[3, 3]
RANDOM walk for 1000000 steps (143431 resets) in 1822 ms. (548 steps per ms)
BEST_FIRST walk for 2000001 steps (73139 resets) in 1211 ms. (1650 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2, 2] Max Struct:[3, 3]
[2026-05-28 02:21:52] [INFO ] Invariant cache hit.
[2026-05-28 02:21:52] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2026-05-28 02:21:52] [INFO ] [Real]Absence check using 5 positive and 6 generalized place invariants in 2 ms returned sat
[2026-05-28 02:21:52] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2026-05-28 02:21:52] [INFO ] State equation strengthened by 30 read => feed constraints.
[2026-05-28 02:21:52] [INFO ] [Real]Added 30 Read/Feed constraints in 8 ms returned sat
[2026-05-28 02:21:52] [INFO ] Solution in real domain found non-integer solution.
[2026-05-28 02:21:52] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2026-05-28 02:21:52] [INFO ] [Nat]Absence check using 5 positive and 6 generalized place invariants in 3 ms returned sat
[2026-05-28 02:21:52] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2026-05-28 02:21:52] [INFO ] [Nat]Added 30 Read/Feed constraints in 7 ms returned sat
[2026-05-28 02:21:52] [INFO ] Computed and/alt/rep : 15/123/15 causal constraints (skipped 33 transitions) in 9 ms.
[2026-05-28 02:21:52] [INFO ] Added : 3 causal constraints over 1 iterations in 25 ms. Result :sat
Minimization took 16 ms.
[2026-05-28 02:21:52] [INFO ] [Real]Absence check using 5 positive place invariants in 11 ms returned sat
[2026-05-28 02:21:52] [INFO ] [Real]Absence check using 5 positive and 6 generalized place invariants in 4 ms returned sat
[2026-05-28 02:21:52] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2026-05-28 02:21:52] [INFO ] [Real]Added 30 Read/Feed constraints in 17 ms returned sat
[2026-05-28 02:21:52] [INFO ] Solution in real domain found non-integer solution.
[2026-05-28 02:21:52] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2026-05-28 02:21:52] [INFO ] [Nat]Absence check using 5 positive and 6 generalized place invariants in 3 ms returned sat
[2026-05-28 02:21:52] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2026-05-28 02:21:52] [INFO ] [Nat]Added 30 Read/Feed constraints in 10 ms returned sat
[2026-05-28 02:21:52] [INFO ] Computed and/alt/rep : 15/123/15 causal constraints (skipped 33 transitions) in 7 ms.
[2026-05-28 02:21:52] [INFO ] Added : 7 causal constraints over 2 iterations in 31 ms. Result :sat
Minimization took 21 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2, 2] Max Struct:[3, 3]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2, 2] Max Struct:[3, 3]
Support contains 6 out of 30 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 4 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 30/30 places, 51/51 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 3 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2026-05-28 02:21:52] [INFO ] Invariant cache hit.
[2026-05-28 02:21:53] [INFO ] Implicit Places using invariants in 74 ms returned []
[2026-05-28 02:21:53] [INFO ] Invariant cache hit.
[2026-05-28 02:21:53] [INFO ] State equation strengthened by 30 read => feed constraints.
[2026-05-28 02:21:53] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 212 ms to find 0 implicit places.
[2026-05-28 02:21:53] [INFO ] Redundant transitions in 1 ms returned []
Running 48 sub problems to find dead transitions.
[2026-05-28 02:21:53] [INFO ] Invariant cache hit.
[2026-05-28 02:21:53] [INFO ] State equation strengthened by 30 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (OVERLAPS) 51/81 variables, 30/42 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 30/72 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/81 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 8 (OVERLAPS) 0/81 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Real declared 81/81 variables, and 73 constraints, problems are : Problem set: 0 solved, 48 unsolved in 2196 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 30/30 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 48 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (OVERLAPS) 51/81 variables, 30/43 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 30/73 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 48/121 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/81 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/81 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/81 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 10 (OVERLAPS) 0/81 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Int declared 81/81 variables, and 123 constraints, problems are : Problem set: 0 solved, 48 unsolved in 3946 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 30/30 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6179ms problems are : Problem set: 0 solved, 48 unsolved
Search for dead transitions found 0 dead transitions in 6180ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6402 ms. Remains : 30/30 places, 51/51 transitions.
[2026-05-28 02:21:59] [INFO ] Flatten gal took : 57 ms
[2026-05-28 02:21:59] [INFO ] Flatten gal took : 42 ms
[2026-05-28 02:21:59] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13537650317391439294.gal : 17 ms
[2026-05-28 02:21:59] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15573725359388113441.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13537650317391439294.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15573725359388113441.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 ...330
Loading property file /tmp/ReachabilityCardinality15573725359388113441.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :4 after 19
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :19 after 27
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :27 after 53
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :53 after 84
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,325,0.070205,4780,2,501,10,2475,10,0,185,2376,0
Total reachable state count : 325

Verifying 4 reachability properties.
Reachability property MAX0 does not hold.
No reachable states exhibit your property : MAX0

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX0,0,0.071245,4916,1,0,10,2475,10,0,191,2376,0
Invariant property MIN0 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,0,0.072205,4988,1,0,10,2475,10,0,196,2376,0
Reachability property MAX1 does not hold.
No reachable states exhibit your property : MAX1

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX1,0,0.07352,4988,1,0,10,2475,10,0,201,2376,0
Invariant property MIN1 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN1,0,0.074455,4988,1,0,10,2475,10,0,206,2376,0
RANDOM walk for 40000 steps (5800 resets) in 1590 ms. (25 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (1363 resets) in 242 ms. (164 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (1406 resets) in 229 ms. (173 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (1542 resets) in 197 ms. (202 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (1517 resets) in 165 ms. (240 steps per ms) remains 4/4 properties
Probably explored full state space saw : 325 states, properties seen :0
Probabilistic random walk after 1090 steps, saw 325 distinct states, run finished after 28 ms. (steps per millisecond=38 ) properties seen :0
Explored full state space saw : 325 states, properties seen :0
Exhaustive walk after 1090 steps, saw 325 distinct states, run finished after 8 ms. (steps per millisecond=136 ) properties seen :0
FORMULA PhilosophersDyn-COL-03-UpperBounds-02 2 TECHNIQUES REACHABILITY_MIN
FORMULA PhilosophersDyn-COL-03-UpperBounds-01 2 TECHNIQUES REACHABILITY_MIN
FORMULA PhilosophersDyn-COL-03-UpperBounds-11 2 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (after reachability check) : Max Seen:[] Max Struct:[]
[2026-05-28 02:22:00] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[] Max Struct:[]
RANDOM walk for 1000000 steps (143276 resets) in 1468 ms. (680 steps per ms)
BEST_FIRST walk for 0 steps (0 resets) in 0 ms. (0 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 21140 ms.

BK_STOP 1779934921720

--------------------
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
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -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 UpperBounds -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="PhilosophersDyn-COL-03"
export BK_EXAMINATION="UpperBounds"
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 PhilosophersDyn-COL-03, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r210-smll-177969942000197"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PhilosophersDyn-COL-03.tgz
mv PhilosophersDyn-COL-03 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "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 [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "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 "UpperBounds.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 '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
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 ;