Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r161-tall-174881261100288.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is PolyORBLF-PT-S04J04T06, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r161-tall-174881261100288
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.9M
-rw-r--r-- 1 mcc users 21K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 136K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 21K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 117K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 8.3K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 41K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 13K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 41K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 241K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 123K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 563K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.2K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 10 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 2.5M May 29 14:32 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME StableMarking

=== Now, execution of the tool begins

BK_START 1748858518693

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=PolyORBLF-PT-S04J04T06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
StableMarking PT
Running Version 202505121319
[2025-06-02 10:01:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2025-06-02 10:01:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 10:02:00] [INFO ] Load time of PNML (sax parser for PT used): 218 ms
[2025-06-02 10:02:00] [INFO ] Transformed 554 places.
[2025-06-02 10:02:00] [INFO ] Transformed 2998 transitions.
[2025-06-02 10:02:00] [INFO ] Parsed PT model containing 554 places and 2998 transitions and 20754 arcs in 345 ms.
Ensure Unique test removed 1626 transitions
Reduce redundant transitions removed 1626 transitions.
RANDOM walk for 40003 steps (9 resets) in 2234 ms. (17 steps per ms) remains 2/554 properties
[2025-06-02 10:02:01] [INFO ] Flatten gal took : 417 ms
BEST_FIRST walk for 40002 steps (9 resets) in 293 ms. (136 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40001 steps (8 resets) in 239 ms. (166 steps per ms) remains 1/1 properties
[2025-06-02 10:02:01] [INFO ] Flow matrix only has 1348 transitions (discarded 24 similar events)
// Phase 1: matrix 1348 rows 554 cols
[2025-06-02 10:02:01] [INFO ] Flatten gal took : 172 ms
[2025-06-02 10:02:01] [INFO ] Computed 50 invariants in 86 ms
[2025-06-02 10:02:01] [INFO ] State equation strengthened by 120 read => feed constraints.
[2025-06-02 10:02:01] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14165477241697325187.gal : 99 ms
[2025-06-02 10:02:01] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11179783751143049065.prop : 1 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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14165477241697325187.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11179783751143049065.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.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Loading property file /tmp/ReachabilityCardinality11179783751143049065.prop.
At refinement iteration 1 (OVERLAPS) 271/272 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/272 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 94/366 variables, 13/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/366 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 184/550 variables, 30/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/550 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/552 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/552 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 6
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :6 after 7
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :7 after 12
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :12 after 14
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :14 after 25
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :25 after 31
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :31 after 29703
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1900/1902 variables, and 601 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1875 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 34/34 constraints, State Equation: 552/554 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 271/272 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/272 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 94/366 variables, 13/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/366 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 184/550 variables, 30/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:02:04] [INFO ] Deduced a trap composed of 75 places in 402 ms of which 249 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :29703 after 38187
[2025-06-02 10:02:04] [INFO ] Deduced a trap composed of 75 places in 172 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:02:04] [INFO ] Deduced a trap composed of 75 places in 106 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:02:04] [INFO ] Deduced a trap composed of 75 places in 62 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/550 variables, 4/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/550 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/552 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/552 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :38187 after 42091
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1900/1902 variables, and 605 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2652 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 34/34 constraints, State Equation: 552/554 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4699ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 324 ms.
Support contains 1 out of 554 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 554/554 places, 1372/1372 transitions.
Ensure Unique test removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 57 rules applied. Total rules applied 57 place count 550 transition count 1319
Reduce places removed 53 places and 0 transitions.
Iterating post reduction 1 with 53 rules applied. Total rules applied 110 place count 497 transition count 1319
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 60 Pre rules applied. Total rules applied 110 place count 497 transition count 1259
Deduced a syphon composed of 60 places in 2 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 230 place count 437 transition count 1259
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 2 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 350 place count 377 transition count 1199
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :42091 after 259085
Free-agglomeration rule (complex) applied 12 times.
Iterating global reduction 2 with 12 rules applied. Total rules applied 362 place count 377 transition count 1187
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 374 place count 365 transition count 1187
Applied a total of 374 rules in 252 ms. Remains 365 /554 variables (removed 189) and now considering 1187/1372 (removed 185) transitions.
Running 1183 sub problems to find dead transitions.
[2025-06-02 10:02:06] [INFO ] Flow matrix only has 1163 transitions (discarded 24 similar events)
// Phase 1: matrix 1163 rows 365 cols
[2025-06-02 10:02:06] [INFO ] Computed 46 invariants in 44 ms
[2025-06-02 10:02:06] [INFO ] State equation strengthened by 120 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :259085 after 271091
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :271091 after 280856
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :280856 after 807861
At refinement iteration 0 (INCLUDED_ONLY) 0/361 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1183 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/361 variables, 23/37 constraints. Problems are: Problem set: 0 solved, 1183 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:02:16] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:02:18] [INFO ] Deduced a trap composed of 26 places in 87 ms of which 7 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :807861 after 1.55071e+06
At refinement iteration 2 (INCLUDED_ONLY) 0/361 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 1183 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 361/1528 variables, and 39 constraints, problems are : Problem set: 0 solved, 1183 unsolved in 20051 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 23/31 constraints, State Equation: 0/365 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1183/703 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1183 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/361 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1183 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/361 variables, 23/37 constraints. Problems are: Problem set: 0 solved, 1183 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/361 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 1183 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:02:29] [INFO ] Deduced a trap composed of 28 places in 214 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:02:30] [INFO ] Deduced a trap composed of 44 places in 79 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:02:30] [INFO ] Deduced a trap composed of 44 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:02:30] [INFO ] Deduced a trap composed of 46 places in 56 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:02:30] [INFO ] Deduced a trap composed of 44 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:02:31] [INFO ] Deduced a trap composed of 44 places in 67 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:02:31] [INFO ] Deduced a trap composed of 44 places in 42 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 7/46 constraints. Problems are: Problem set: 0 solved, 1183 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:02:40] [INFO ] Deduced a trap composed of 30 places in 173 ms of which 10 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :1.55071e+06 after 1.74042e+06
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 361/1528 variables, and 47 constraints, problems are : Problem set: 0 solved, 1183 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 23/31 constraints, State Equation: 0/365 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 480/703 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41937ms problems are : Problem set: 0 solved, 1183 unsolved
Search for dead transitions found 0 dead transitions in 41963ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42241 ms. Remains : 365/554 places, 1187/1372 transitions.
RANDOM walk for 41099 steps (5 resets) in 507 ms. (80 steps per ms) remains 0/1 properties
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Able to resolve query StableMarking after proving 554 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK BESTFIRST_WALK TOPOLOGICAL
Total runtime 48964 ms.

BK_STOP 1748858568952

--------------------
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
+ [[ StableMarking = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution StableMarking -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ 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.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination StableMarking -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800

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="PolyORBLF-PT-S04J04T06"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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-5832"
echo " Executing tool itstools"
echo " Input is PolyORBLF-PT-S04J04T06, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r161-tall-174881261100288"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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