MCC'2026- Execution of r146-tall-177961074100373

About the Execution of ITS-Tools for GPPP-PT-C1000N0000001000

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
687.508	68341.00	75953.00	552.60	3998 10 1 1 2000 3000 2000 2000 2000 4 7000 10 10 10 2000 10	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.r146-tall-177961074100373.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 GPPP-PT-C1000N0000001000, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r146-tall-177961074100373
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 7.1K Mar 7 11:24 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Mar 7 11:24 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Mar 7 11:24 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Mar 7 11:24 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.9K Mar 15 10:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 15 10:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Mar 15 10:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 15 10:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Mar 7 11:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 127K Mar 7 11:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Mar 7 11:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 93K Mar 7 11:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 10:34 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 10:34 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 17 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 1 Mar 3 18:30 large_marking
-rw-r--r-- 1 mcc users 21K 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 GPPP-PT-C1000N0000001000-UpperBounds-00
FORMULA_NAME GPPP-PT-C1000N0000001000-UpperBounds-01
FORMULA_NAME GPPP-PT-C1000N0000001000-UpperBounds-02
FORMULA_NAME GPPP-PT-C1000N0000001000-UpperBounds-03
FORMULA_NAME GPPP-PT-C1000N0000001000-UpperBounds-04
FORMULA_NAME GPPP-PT-C1000N0000001000-UpperBounds-05
FORMULA_NAME GPPP-PT-C1000N0000001000-UpperBounds-06
FORMULA_NAME GPPP-PT-C1000N0000001000-UpperBounds-07
FORMULA_NAME GPPP-PT-C1000N0000001000-UpperBounds-08
FORMULA_NAME GPPP-PT-C1000N0000001000-UpperBounds-09
FORMULA_NAME GPPP-PT-C1000N0000001000-UpperBounds-10
FORMULA_NAME GPPP-PT-C1000N0000001000-UpperBounds-11
FORMULA_NAME GPPP-PT-C1000N0000001000-UpperBounds-12
FORMULA_NAME GPPP-PT-C1000N0000001000-UpperBounds-13
FORMULA_NAME GPPP-PT-C1000N0000001000-UpperBounds-14
FORMULA_NAME GPPP-PT-C1000N0000001000-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1779724181382

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=GPPP-PT-C1000N0000001000
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202604301425
[2026-05-25 15:49:42] [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-25 15:49:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 15:49:42] [INFO ] Load time of PNML (sax parser for PT used): 49 ms
[2026-05-25 15:49:42] [INFO ] Transformed 33 places.
[2026-05-25 15:49:42] [INFO ] Transformed 22 transitions.
[2026-05-25 15:49:42] [INFO ] Parsed PT model containing 33 places and 22 transitions and 83 arcs in 136 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 1, 0, 0, 0, 2000, 0, 2000, 0, 0, 0, 0, 0, 2000, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 1, 0, 0, 0, 2000, 0, 2000, 0, 0, 0, 0, 0, 2000, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15161122884574151417.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10605863269459826374.kers'
[2026-05-25 15:49:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15161122884574151417.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10605863269459826374.kers]
Culling duplicate invariants (modulo rational): removing 6 columns.
Culled 6 columns in 0 ms.
// Phase 1: matrix 22 rows 27 cols 71 entries
Finished phase 1 with 13 SingleSign rule and 8 generalized
[2026-05-25 15:49:42] [INFO ] Computed 12 invariants in 0 ms
Computed 12 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-10605863269459826374.kers
Total runtime 1 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 1, 0, 0, 0, 2000, 0, 2000, 0, 0, 0, 0, 0, 2000, 0] Max Struct:[4500, 9000, 1, 6000, 2000, 3000, 2000, 2000, 2000, 4500, 7000, 2000, 2000, 7000, 2000, 2000]
FORMULA GPPP-PT-C1000N0000001000-UpperBounds-14 2000 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C1000N0000001000-UpperBounds-08 2000 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C1000N0000001000-UpperBounds-06 2000 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C1000N0000001000-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 12008 steps (2 resets) in 11 ms. (1000 steps per ms)
FORMULA GPPP-PT-C1000N0000001000-UpperBounds-10 7000 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA GPPP-PT-C1000N0000001000-UpperBounds-05 3000 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 100009 steps (20 resets) in 121 ms. (819 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[102, 6, 1, 376, 400, 3, 7, 7, 7, 7] Max Struct:[4500, 9000, 6000, 2000, 2000, 4500, 2000, 2000, 7000, 2000]
[2026-05-25 15:49:42] [INFO ] Invariant cache hit.
[2026-05-25 15:49:43] [INFO ] [Real]Absence check using 7 positive place invariants in 7 ms returned sat
[2026-05-25 15:49:43] [INFO ] [Real]Absence check using 7 positive and 5 generalized place invariants in 10 ms returned sat
[2026-05-25 15:49:43] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2026-05-25 15:49:43] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 15:49:43] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2026-05-25 15:49:43] [INFO ] [Nat]Absence check using 7 positive and 5 generalized place invariants in 2 ms returned sat
[2026-05-25 15:49:43] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2026-05-25 15:49:43] [INFO ] Computed and/alt/rep : 21/49/21 causal constraints (skipped 0 transitions) in 5 ms.
[2026-05-25 15:49:43] [INFO ] Added : 3 causal constraints over 1 iterations in 20 ms. Result :sat
Minimization took 235 ms.
[2026-05-25 15:49:43] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2026-05-25 15:49:43] [INFO ] [Real]Absence check using 7 positive and 5 generalized place invariants in 4 ms returned sat
[2026-05-25 15:49:43] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2026-05-25 15:49:43] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 15:49:43] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2026-05-25 15:49:43] [INFO ] [Nat]Absence check using 7 positive and 5 generalized place invariants in 4 ms returned sat
[2026-05-25 15:49:43] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2026-05-25 15:49:43] [INFO ] Computed and/alt/rep : 21/49/21 causal constraints (skipped 0 transitions) in 2 ms.
[2026-05-25 15:49:43] [INFO ] Added : 14 causal constraints over 3 iterations in 25 ms. Result :sat
Minimization took 27 ms.
[2026-05-25 15:49:43] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2026-05-25 15:49:43] [INFO ] [Real]Absence check using 7 positive and 5 generalized place invariants in 1 ms returned sat
[2026-05-25 15:49:43] [INFO ] [Real]Absence check using state equation in 17 ms returned unsat
[2026-05-25 15:49:43] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2026-05-25 15:49:43] [INFO ] [Real]Absence check using 7 positive and 5 generalized place invariants in 1 ms returned sat
[2026-05-25 15:49:43] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2026-05-25 15:49:43] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 15:49:43] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2026-05-25 15:49:43] [INFO ] [Nat]Absence check using 7 positive and 5 generalized place invariants in 2 ms returned sat
[2026-05-25 15:49:43] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2026-05-25 15:49:43] [INFO ] Computed and/alt/rep : 21/49/21 causal constraints (skipped 0 transitions) in 2 ms.
[2026-05-25 15:49:43] [INFO ] Added : 15 causal constraints over 3 iterations in 22 ms. Result :sat
Minimization took 89 ms.
[2026-05-25 15:49:43] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned sat
[2026-05-25 15:49:43] [INFO ] [Real]Absence check using 7 positive and 5 generalized place invariants in 2 ms returned sat
[2026-05-25 15:49:43] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2026-05-25 15:49:43] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 15:49:43] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2026-05-25 15:49:43] [INFO ] [Nat]Absence check using 7 positive and 5 generalized place invariants in 2 ms returned sat
[2026-05-25 15:49:44] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2026-05-25 15:49:44] [INFO ] Computed and/alt/rep : 21/49/21 causal constraints (skipped 0 transitions) in 3 ms.
[2026-05-25 15:49:44] [INFO ] Added : 14 causal constraints over 3 iterations in 19 ms. Result :sat
Minimization took 14 ms.
[2026-05-25 15:49:44] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2026-05-25 15:49:44] [INFO ] [Real]Absence check using 7 positive and 5 generalized place invariants in 1 ms returned sat
[2026-05-25 15:49:44] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2026-05-25 15:49:44] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 15:49:44] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2026-05-25 15:49:45] [INFO ] SMT solver returned unknown. Retrying;
[2026-05-25 15:49:45] [INFO ] [Nat]Absence check using 7 positive and 5 generalized place invariants in 1528 ms returned unknown
[2026-05-25 15:49:45] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2026-05-25 15:49:45] [INFO ] [Real]Absence check using 7 positive and 5 generalized place invariants in 6 ms returned sat
[2026-05-25 15:49:45] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2026-05-25 15:49:45] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 15:49:45] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2026-05-25 15:49:45] [INFO ] [Nat]Absence check using 7 positive and 5 generalized place invariants in 2 ms returned sat
[2026-05-25 15:49:45] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2026-05-25 15:49:45] [INFO ] Computed and/alt/rep : 21/49/21 causal constraints (skipped 0 transitions) in 1 ms.
[2026-05-25 15:49:45] [INFO ] Added : 17 causal constraints over 4 iterations in 32 ms. Result :sat
Minimization took 42 ms.
[2026-05-25 15:49:45] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2026-05-25 15:49:45] [INFO ] [Real]Absence check using 7 positive and 5 generalized place invariants in 3 ms returned sat
[2026-05-25 15:49:45] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2026-05-25 15:49:45] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 15:49:45] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2026-05-25 15:49:45] [INFO ] [Nat]Absence check using 7 positive and 5 generalized place invariants in 2 ms returned sat
[2026-05-25 15:49:45] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2026-05-25 15:49:45] [INFO ] Computed and/alt/rep : 21/49/21 causal constraints (skipped 0 transitions) in 1 ms.
[2026-05-25 15:49:45] [INFO ] Added : 16 causal constraints over 4 iterations in 29 ms. Result :sat
Minimization took 29 ms.
[2026-05-25 15:49:46] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2026-05-25 15:49:46] [INFO ] [Real]Absence check using 7 positive and 5 generalized place invariants in 1 ms returned sat
[2026-05-25 15:49:46] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2026-05-25 15:49:46] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 15:49:46] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2026-05-25 15:49:46] [INFO ] [Nat]Absence check using 7 positive and 5 generalized place invariants in 1 ms returned sat
[2026-05-25 15:49:46] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2026-05-25 15:49:46] [INFO ] Computed and/alt/rep : 21/49/21 causal constraints (skipped 0 transitions) in 2 ms.
[2026-05-25 15:49:46] [INFO ] Added : 20 causal constraints over 4 iterations in 18 ms. Result :sat
Minimization took 45 ms.
[2026-05-25 15:49:46] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2026-05-25 15:49:46] [INFO ] [Real]Absence check using 7 positive and 5 generalized place invariants in 2 ms returned sat
[2026-05-25 15:49:46] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2026-05-25 15:49:46] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 15:49:46] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2026-05-25 15:49:46] [INFO ] [Nat]Absence check using 7 positive and 5 generalized place invariants in 13 ms returned sat
[2026-05-25 15:49:46] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2026-05-25 15:49:46] [INFO ] Computed and/alt/rep : 21/49/21 causal constraints (skipped 0 transitions) in 2 ms.
[2026-05-25 15:49:46] [INFO ] Added : 19 causal constraints over 4 iterations in 26 ms. Result :sat
Minimization took 16 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[102, 6, 1, 376, 400, 3, 7, 7, 7, 7] Max Struct:[4500, 9000, 1, 2000, 2000, 4500, 2000, 2000, 7000, 2000]
FORMULA GPPP-PT-C1000N0000001000-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C1000N0000001000-UpperBounds-07 2000 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA GPPP-PT-C1000N0000001000-UpperBounds-04 2000 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3998, 10, 4, 10, 10, 10, 10] Max Struct:[4500, 9000, 4500, 2000, 2000, 7000, 2000]
Support contains 7 out of 33 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 33/33 places, 22/22 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 31 transition count 21
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 29 transition count 20
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 28 transition count 19
Applied a total of 8 rules in 28 ms. Remains 28 /33 variables (removed 5) and now considering 19/22 (removed 3) transitions.
Running 18 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6350267809655244488.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13779189229286115437.kers'
[2026-05-25 15:49:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6350267809655244488.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13779189229286115437.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 19 rows 23 cols 60 entries
Finished phase 1 with 14 SingleSign rule and 4 generalized
[2026-05-25 15:49:56] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-13779189229286115437.kers
Total runtime 0 ms.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (OVERLAPS) 1/28 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 18 unsolved
Problem TDEAD18 is UNSAT
At refinement iteration 4 (OVERLAPS) 19/47 variables, 28/38 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/47 variables, 0/38 constraints. Problems are: Problem set: 1 solved, 17 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/47 variables, 0/38 constraints. Problems are: Problem set: 1 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 47/47 variables, and 38 constraints, problems are : Problem set: 1 solved, 17 unsolved in 256 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 28/28 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 7/7 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 1/27 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 1/28 variables, 2/10 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/28 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 19/47 variables, 28/38 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/47 variables, 17/55 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/47 variables, 0/55 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 9 (OVERLAPS) 0/47 variables, 0/55 constraints. Problems are: Problem set: 1 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 47/47 variables, and 55 constraints, problems are : Problem set: 1 solved, 17 unsolved in 7504 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 28/28 constraints, PredecessorRefiner: 17/18 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7788ms problems are : Problem set: 1 solved, 17 unsolved
Search for dead transitions found 1 dead transitions in 7801ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 1 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 28/33 places, 18/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 28 /28 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7856 ms. Remains : 28/33 places, 18/22 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2763768655636926475.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5677323638791146049.kers'
[2026-05-25 15:50:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2763768655636926475.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5677323638791146049.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 18 rows 23 cols 56 entries
Finished phase 1 with 13 SingleSign rule and 4 generalized
[2026-05-25 15:50:04] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-5677323638791146049.kers
Total runtime 0 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[3998, 10, 4, 10, 10, 10, 10] Max Struct:[4500, 9000, 4500, 2000, 2000, 7000, 2000]
RANDOM walk for 1001612 steps (82 resets) in 221 ms. (4511 steps per ms)
BEST_FIRST walk for 7000006 steps (88 resets) in 2162 ms. (3236 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3998, 10, 4, 10, 10, 10, 10] Max Struct:[4500, 9000, 4500, 2000, 2000, 7000, 2000]
[2026-05-25 15:50:06] [INFO ] Invariant cache hit.
[2026-05-25 15:50:06] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2026-05-25 15:50:06] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2026-05-25 15:50:06] [INFO ] [Real]Absence check using state equation in 8 ms returned unsat
[2026-05-25 15:50:06] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2026-05-25 15:50:06] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2026-05-25 15:50:06] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2026-05-25 15:50:06] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 15:50:06] [INFO ] [Nat]Absence check using 8 positive place invariants in 7 ms returned sat
[2026-05-25 15:50:11] [INFO ] SMT solver returned unknown. Retrying;
[2026-05-25 15:50:15] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 9003 ms returned unknown
[2026-05-25 15:50:15] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2026-05-25 15:50:15] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 3 ms returned sat
[2026-05-25 15:50:15] [INFO ] [Real]Absence check using state equation in 9 ms returned unsat
[2026-05-25 15:50:15] [INFO ] [Real]Absence check using 8 positive place invariants in 1 ms returned sat
[2026-05-25 15:50:15] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 2 ms returned sat
[2026-05-25 15:50:15] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2026-05-25 15:50:15] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 15:50:15] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2026-05-25 15:50:20] [INFO ] SMT solver returned unknown. Retrying;
[2026-05-25 15:50:21] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 5826 ms returned unsat
[2026-05-25 15:50:21] [INFO ] [Real]Absence check using 8 positive place invariants in 1 ms returned sat
[2026-05-25 15:50:21] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 6 ms returned sat
[2026-05-25 15:50:21] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2026-05-25 15:50:21] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 15:50:21] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2026-05-25 15:50:26] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 4234 ms returned unsat
[2026-05-25 15:50:26] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2026-05-25 15:50:26] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 3 ms returned sat
[2026-05-25 15:50:26] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2026-05-25 15:50:26] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 15:50:26] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2026-05-25 15:50:30] [INFO ] SMT solver returned unknown. Retrying;
[2026-05-25 15:50:33] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 7505 ms returned unsat
[2026-05-25 15:50:33] [INFO ] [Real]Absence check using 8 positive place invariants in 1 ms returned sat
[2026-05-25 15:50:33] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 2 ms returned sat
[2026-05-25 15:50:33] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2026-05-25 15:50:33] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 15:50:33] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2026-05-25 15:50:38] [INFO ] SMT solver returned unknown. Retrying;
[2026-05-25 15:50:39] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 5686 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[3998, 10, 4, 10, 10, 10, 10] Max Struct:[3998, 9000, 4, 10, 10, 10, 10]
FORMULA GPPP-PT-C1000N0000001000-UpperBounds-15 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C1000N0000001000-UpperBounds-13 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C1000N0000001000-UpperBounds-12 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C1000N0000001000-UpperBounds-11 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C1000N0000001000-UpperBounds-09 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C1000N0000001000-UpperBounds-00 3998 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[10] Max Struct:[9000]
Support contains 1 out of 28 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 28/28 places, 18/18 transitions.
Graph (complete) has 68 edges and 28 vertex of which 27 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 27 transition count 17
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 26 transition count 17
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 26 transition count 16
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 25 transition count 16
Applied a total of 5 rules in 17 ms. Remains 25 /28 variables (removed 3) and now considering 16/18 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 25/28 places, 16/18 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18416424878770985838.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14746807551558602334.kers'
[2026-05-25 15:50:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18416424878770985838.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14746807551558602334.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 16 rows 20 cols 51 entries
Finished phase 1 with 11 SingleSign rule and 4 generalized
[2026-05-25 15:50:39] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-14746807551558602334.kers
Total runtime 0 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[10] Max Struct:[9000]
RANDOM walk for 1000155 steps (82 resets) in 202 ms. (4926 steps per ms)
BEST_FIRST walk for 1000000 steps (2 resets) in 309 ms. (3225 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[10] Max Struct:[9000]
[2026-05-25 15:50:39] [INFO ] Invariant cache hit.
[2026-05-25 15:50:39] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2026-05-25 15:50:39] [INFO ] [Real]Absence check using 7 positive and 3 generalized place invariants in 4 ms returned sat
[2026-05-25 15:50:39] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2026-05-25 15:50:39] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 15:50:39] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2026-05-25 15:50:40] [INFO ] [Nat]Absence check using 7 positive and 3 generalized place invariants in 5 ms returned sat
[2026-05-25 15:50:49] [INFO ] [Nat]Absence check using state equation in 9007 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[10] Max Struct:[9000]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[10] Max Struct:[9000]
Support contains 1 out of 25 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 16/16 transitions.
Applied a total of 0 rules in 5 ms. Remains 25 /25 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 25/25 places, 16/16 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 16/16 transitions.
Applied a total of 0 rules in 2 ms. Remains 25 /25 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2026-05-25 15:50:49] [INFO ] Invariant cache hit.
[2026-05-25 15:50:49] [INFO ] Implicit Places using invariants in 43 ms returned [0, 3, 15]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 44 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 22/25 places, 16/16 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 7 rules applied. Total rules applied 7 place count 18 transition count 13
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 9 place count 18 transition count 11
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 11 place count 16 transition count 11
Applied a total of 11 rules in 2 ms. Remains 16 /22 variables (removed 6) and now considering 11/16 (removed 5) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11241789763446913525.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17543922447815159866.kers'
[2026-05-25 15:50:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11241789763446913525.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17543922447815159866.kers]
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 11 rows 13 cols 38 entries
Finished phase 1 with 5 SingleSign rule and 5 generalized
[2026-05-25 15:50:49] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-17543922447815159866.kers
Total runtime 0 ms.
[2026-05-25 15:50:49] [INFO ] Implicit Places using invariants in 41 ms returned []
[2026-05-25 15:50:49] [INFO ] Invariant cache hit.
[2026-05-25 15:50:49] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 16/25 places, 11/16 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 121 ms. Remains : 16/25 places, 11/16 transitions.
[2026-05-25 15:50:49] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[10] Max Struct:[9000]
RANDOM walk for 1001287 steps (123 resets) in 198 ms. (5031 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 273 ms. (3649 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[10] Max Struct:[9000]
[2026-05-25 15:50:49] [INFO ] Invariant cache hit.
[2026-05-25 15:50:49] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2026-05-25 15:50:49] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2026-05-25 15:50:49] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2026-05-25 15:50:49] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 15:50:49] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2026-05-25 15:50:49] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2026-05-25 15:50:49] [INFO ] [Nat]Absence check using state equation in 11 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[10] Max Struct:[10]
FORMULA GPPP-PT-C1000N0000001000-UpperBounds-01 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 67174 ms.

BK_STOP 1779724249723

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
++ perl -pe 's/.*\.//g'
+ 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="GPPP-PT-C1000N0000001000"
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 GPPP-PT-C1000N0000001000, 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 r146-tall-177961074100373"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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