Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r156-tall-174881254100487.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-S04J06T06, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r156-tall-174881254100487
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.3M
-rw-r--r-- 1 mcc users 21K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 124K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 31K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 152K 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 6.3K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 9.3K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 40K 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 55K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 35K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 194K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 179K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 769K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.8K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.0K 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.6M 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

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

=== Now, execution of the tool begins

BK_START 1749006153012

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-PT-S04J06T06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202505121319
[2025-06-04 03:02:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-04 03:02:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-04 03:02:34] [INFO ] Load time of PNML (sax parser for PT used): 225 ms
[2025-06-04 03:02:34] [INFO ] Transformed 618 places.
[2025-06-04 03:02:34] [INFO ] Transformed 3190 transitions.
[2025-06-04 03:02:34] [INFO ] Parsed PT model containing 618 places and 3190 transitions and 21570 arcs in 361 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 55 ms.
Working with output stream class java.io.PrintStream
[2025-06-04 03:02:34] [INFO ] Reduced 1326 identical enabling conditions.
[2025-06-04 03:02:34] [INFO ] Reduced 1326 identical enabling conditions.
[2025-06-04 03:02:34] [INFO ] Reduced 264 identical enabling conditions.
[2025-06-04 03:02:34] [INFO ] Reduced 264 identical enabling conditions.
[2025-06-04 03:02:34] [INFO ] Reduced 1326 identical enabling conditions.
[2025-06-04 03:02:34] [INFO ] Reduced 36 identical enabling conditions.
[2025-06-04 03:02:34] [INFO ] Reduced 36 identical enabling conditions.
Ensure Unique test removed 1626 transitions
Reduce redundant transitions removed 1626 transitions.
RANDOM walk for 40000 steps (9 resets) in 2463 ms. (16 steps per ms) remains 13/16 properties
FORMULA PolyORBLF-PT-S04J06T06-ReachabilityFireability-2025-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S04J06T06-ReachabilityFireability-2025-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S04J06T06-ReachabilityFireability-2025-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2025-06-04 03:02:35] [INFO ] Flatten gal took : 399 ms
[2025-06-04 03:02:36] [INFO ] Flatten gal took : 243 ms
[2025-06-04 03:02:36] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality52951279013402863.gal : 84 ms
[2025-06-04 03:02:36] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality801739756693295451.prop : 44 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/ReachabilityCardinality52951279013402863.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality801739756693295451.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 ...325
BEST_FIRST walk for 40002 steps (8 resets) in 2488 ms. (16 steps per ms) remains 13/13 properties
Loading property file /tmp/ReachabilityCardinality801739756693295451.prop.
BEST_FIRST walk for 40003 steps (10 resets) in 2582 ms. (15 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (8 resets) in 1974 ms. (20 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (8 resets) in 964 ms. (41 steps per ms) remains 13/13 properties
SDD proceeding with computation,13 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,13 properties remain. new max is 8
SDD size :3 after 6
SDD proceeding with computation,13 properties remain. new max is 16
SDD size :6 after 7
SDD proceeding with computation,13 properties remain. new max is 32
SDD size :7 after 13
SDD proceeding with computation,13 properties remain. new max is 64
SDD size :13 after 15
SDD proceeding with computation,13 properties remain. new max is 128
SDD size :15 after 28
SDD proceeding with computation,13 properties remain. new max is 256
SDD size :28 after 119
BEST_FIRST walk for 40004 steps (8 resets) in 2777 ms. (14 steps per ms) remains 13/13 properties
SDD proceeding with computation,13 properties remain. new max is 512
SDD size :119 after 2723
SDD proceeding with computation,13 properties remain. new max is 1024
SDD size :2723 after 3618
BEST_FIRST walk for 40002 steps (24 resets) in 6379 ms. (6 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (8 resets) in 1868 ms. (21 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 327 ms. (121 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (8 resets) in 420 ms. (95 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 470 ms. (84 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 295 ms. (135 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 489 ms. (81 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 363 ms. (109 steps per ms) remains 13/13 properties
[2025-06-04 03:02:42] [INFO ] Flow matrix only has 1540 transitions (discarded 24 similar events)
// Phase 1: matrix 1540 rows 618 cols
[2025-06-04 03:02:42] [INFO ] Computed 54 invariants in 120 ms
[2025-06-04 03:02:42] [INFO ] State equation strengthened by 120 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
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/601 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Problem PolyORBLF-PT-S04J06T06-ReachabilityFireability-2025-08 is UNSAT
FORMULA PolyORBLF-PT-S04J06T06-ReachabilityFireability-2025-08 FALSE TECHNIQUES SMT_REFINEMENT
Problem PolyORBLF-PT-S04J06T06-ReachabilityFireability-2025-09 is UNSAT
FORMULA PolyORBLF-PT-S04J06T06-ReachabilityFireability-2025-09 FALSE TECHNIQUES SMT_REFINEMENT
Problem PolyORBLF-PT-S04J06T06-ReachabilityFireability-2025-11 is UNSAT
FORMULA PolyORBLF-PT-S04J06T06-ReachabilityFireability-2025-11 TRUE TECHNIQUES SMT_REFINEMENT
Problem PolyORBLF-PT-S04J06T06-ReachabilityFireability-2025-12 is UNSAT
FORMULA PolyORBLF-PT-S04J06T06-ReachabilityFireability-2025-12 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (INCLUDED_ONLY) 0/601 variables, 22/40 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/601 variables, 0/40 constraints. Problems are: Problem set: 4 solved, 9 unsolved
Problem PolyORBLF-PT-S04J06T06-ReachabilityFireability-2025-00 is UNSAT
FORMULA PolyORBLF-PT-S04J06T06-ReachabilityFireability-2025-00 TRUE TECHNIQUES SMT_REFINEMENT
Problem PolyORBLF-PT-S04J06T06-ReachabilityFireability-2025-02 is UNSAT
FORMULA PolyORBLF-PT-S04J06T06-ReachabilityFireability-2025-02 FALSE TECHNIQUES SMT_REFINEMENT
Problem PolyORBLF-PT-S04J06T06-ReachabilityFireability-2025-04 is UNSAT
FORMULA PolyORBLF-PT-S04J06T06-ReachabilityFireability-2025-04 FALSE TECHNIQUES SMT_REFINEMENT
Problem PolyORBLF-PT-S04J06T06-ReachabilityFireability-2025-05 is UNSAT
FORMULA PolyORBLF-PT-S04J06T06-ReachabilityFireability-2025-05 TRUE TECHNIQUES SMT_REFINEMENT
Problem PolyORBLF-PT-S04J06T06-ReachabilityFireability-2025-06 is UNSAT
FORMULA PolyORBLF-PT-S04J06T06-ReachabilityFireability-2025-06 TRUE TECHNIQUES SMT_REFINEMENT
Problem PolyORBLF-PT-S04J06T06-ReachabilityFireability-2025-07 is UNSAT
FORMULA PolyORBLF-PT-S04J06T06-ReachabilityFireability-2025-07 TRUE TECHNIQUES SMT_REFINEMENT
Problem PolyORBLF-PT-S04J06T06-ReachabilityFireability-2025-13 is UNSAT
FORMULA PolyORBLF-PT-S04J06T06-ReachabilityFireability-2025-13 TRUE TECHNIQUES SMT_REFINEMENT
Problem PolyORBLF-PT-S04J06T06-ReachabilityFireability-2025-15 is UNSAT
FORMULA PolyORBLF-PT-S04J06T06-ReachabilityFireability-2025-15 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (OVERLAPS) 17/618 variables, 14/54 constraints. Problems are: Problem set: 12 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/618 variables, 0/54 constraints. Problems are: Problem set: 12 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2158/2158 variables, and 672 constraints, problems are : Problem set: 12 solved, 1 unsolved in 5032 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 36/36 constraints, State Equation: 618/618 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 9/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 12 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/294 variables, 0/0 constraints. Problems are: Problem set: 12 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 74/368 variables, 16/16 constraints. Problems are: Problem set: 12 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/368 variables, 2/18 constraints. Problems are: Problem set: 12 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/368 variables, 0/18 constraints. Problems are: Problem set: 12 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 238/606 variables, 27/45 constraints. Problems are: Problem set: 12 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:02:49] [INFO ] Deduced a trap composed of 83 places in 821 ms of which 158 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:02:51] [INFO ] Deduced a trap composed of 83 places in 1692 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:02:51] [INFO ] Deduced a trap composed of 83 places in 823 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/606 variables, 3/48 constraints. Problems are: Problem set: 12 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/606 variables, 0/48 constraints. Problems are: Problem set: 12 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/608 variables, 2/50 constraints. Problems are: Problem set: 12 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 608/2158 variables, and 50 constraints, problems are : Problem set: 12 solved, 1 unsolved in 5065 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 29/36 constraints, State Equation: 0/618 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10400ms problems are : Problem set: 12 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 294 out of 618 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 618/618 places, 1564/1564 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 618 transition count 1552
Reduce places removed 12 places and 0 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Iterating post reduction 1 with 24 rules applied. Total rules applied 36 place count 606 transition count 1540
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 48 place count 594 transition count 1540
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 48 place count 594 transition count 1534
Deduced a syphon composed of 6 places in 3 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 60 place count 588 transition count 1534
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 19 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 72 place count 582 transition count 1528
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 78 place count 582 transition count 1522
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 84 place count 576 transition count 1522
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 90 place count 576 transition count 1522
Applied a total of 90 rules in 611 ms. Remains 576 /618 variables (removed 42) and now considering 1522/1564 (removed 42) transitions.
Running 1518 sub problems to find dead transitions.
[2025-06-04 03:02:53] [INFO ] Flow matrix only has 1498 transitions (discarded 24 similar events)
// Phase 1: matrix 1498 rows 576 cols
[2025-06-04 03:02:53] [INFO ] Computed 54 invariants in 123 ms
[2025-06-04 03:02:53] [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.
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,13 properties remain. new max is 2048
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 size :3618 after 162411
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.
SDD proceeding with computation,13 properties remain. new max is 4096
SDD size :162411 after 173413
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
SDD proceeding with computation,13 properties remain. new max is 8192
SDD size :173413 after 280285
SDD proceeding with computation,13 properties remain. new max is 16384
SDD size :280285 after 432505
At refinement iteration 0 (INCLUDED_ONLY) 0/568 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1518 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/568 variables, 27/45 constraints. Problems are: Problem set: 0 solved, 1518 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 568/2074 variables, and 45 constraints, problems are : Problem set: 0 solved, 1518 unsolved in 20062 ms.
Refiners :[Positive P Invariants (semi-flows): 18/20 constraints, Generalized P Invariants (flows): 27/34 constraints, State Equation: 0/576 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1518/1104 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1518 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/568 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1518 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/568 variables, 27/45 constraints. Problems are: Problem set: 0 solved, 1518 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 568/2074 variables, and 45 constraints, problems are : Problem set: 0 solved, 1518 unsolved in 20051 ms.
Refiners :[Positive P Invariants (semi-flows): 18/20 constraints, Generalized P Invariants (flows): 27/34 constraints, State Equation: 0/576 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 414/1104 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 42648ms problems are : Problem set: 0 solved, 1518 unsolved
Search for dead transitions found 0 dead transitions in 42657ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43299 ms. Remains : 576/618 places, 1522/1564 transitions.
RANDOM walk for 40000 steps (8 resets) in 615 ms. (64 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 2447 ms. (16 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 114198 steps, run timeout after 3001 ms. (steps per millisecond=38 ) properties seen :0 out of 1
Probabilistic random walk after 114198 steps, saw 75490 distinct states, run finished after 3006 ms. (steps per millisecond=37 ) properties seen :0
[2025-06-04 03:03:39] [INFO ] Flow matrix only has 1498 transitions (discarded 24 similar events)
[2025-06-04 03:03:39] [INFO ] Invariant cache hit.
[2025-06-04 03:03:39] [INFO ] State equation strengthened by 120 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/294 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/294 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 84/378 variables, 18/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/378 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/378 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 187/565 variables, 26/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/565 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/567 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/567 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 9/576 variables, 6/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/576 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1498/2074 variables, 576/630 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2074 variables, 120/750 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2074 variables, 0/750 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/2074 variables, 0/750 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2074/2074 variables, and 750 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3297 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 34/34 constraints, State Equation: 576/576 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/294 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/294 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 84/378 variables, 18/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/378 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/378 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 187/565 variables, 26/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:03:45] [INFO ] Deduced a trap composed of 76 places in 77 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/565 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/565 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/567 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:03:46] [INFO ] Deduced a trap composed of 76 places in 60 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/567 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/567 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 9/576 variables, 6/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/576 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1498/2074 variables, 576/632 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2074 variables, 120/752 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2074 variables, 0/752 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/2074 variables, 0/752 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2074/2074 variables, and 752 constraints, problems are : Problem set: 0 solved, 1 unsolved in 7208 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 34/34 constraints, State Equation: 576/576 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10525ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 108 ms.
Support contains 294 out of 576 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 576/576 places, 1522/1522 transitions.
Applied a total of 0 rules in 35 ms. Remains 576 /576 variables (removed 0) and now considering 1522/1522 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 576/576 places, 1522/1522 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 576/576 places, 1522/1522 transitions.
Applied a total of 0 rules in 34 ms. Remains 576 /576 variables (removed 0) and now considering 1522/1522 (removed 0) transitions.
[2025-06-04 03:03:50] [INFO ] Flow matrix only has 1498 transitions (discarded 24 similar events)
[2025-06-04 03:03:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 03:03:51] [INFO ] Implicit Places using invariants in 951 ms returned []
[2025-06-04 03:03:51] [INFO ] Flow matrix only has 1498 transitions (discarded 24 similar events)
[2025-06-04 03:03:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 03:03:52] [INFO ] State equation strengthened by 120 read => feed constraints.
SDD proceeding with computation,13 properties remain. new max is 32768
SDD size :432505 after 499865
[2025-06-04 03:04:12] [INFO ] Implicit Places using invariants and state equation in 21382 ms returned []
Implicit Place search using SMT with State Equation took 22362 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 03:04:12] [INFO ] Redundant transitions in 139 ms returned []
Running 1518 sub problems to find dead transitions.
[2025-06-04 03:04:12] [INFO ] Flow matrix only has 1498 transitions (discarded 24 similar events)
[2025-06-04 03:04:12] [INFO ] Invariant cache hit.
[2025-06-04 03:04:12] [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.
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.
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 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/568 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1518 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/568 variables, 27/45 constraints. Problems are: Problem set: 0 solved, 1518 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 568/2074 variables, and 45 constraints, problems are : Problem set: 0 solved, 1518 unsolved in 30066 ms.
Refiners :[Positive P Invariants (semi-flows): 18/20 constraints, Generalized P Invariants (flows): 27/34 constraints, State Equation: 0/576 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1518/1104 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1518 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/568 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1518 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/568 variables, 27/45 constraints. Problems are: Problem set: 0 solved, 1518 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:04:55] [INFO ] Deduced a trap composed of 76 places in 226 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:04:55] [INFO ] Deduced a trap composed of 76 places in 181 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:04:55] [INFO ] Deduced a trap composed of 76 places in 118 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:04:56] [INFO ] Deduced a trap composed of 76 places in 118 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:04:56] [INFO ] Deduced a trap composed of 302 places in 488 ms of which 122 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:04:57] [INFO ] Deduced a trap composed of 15 places in 415 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:04:57] [INFO ] Deduced a trap composed of 310 places in 501 ms of which 123 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:04:58] [INFO ] Deduced a trap composed of 259 places in 382 ms of which 107 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:04:58] [INFO ] Deduced a trap composed of 76 places in 60 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:04:58] [INFO ] Deduced a trap composed of 259 places in 410 ms of which 110 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:04:59] [INFO ] Deduced a trap composed of 306 places in 422 ms of which 122 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:05:00] [INFO ] Deduced a trap composed of 104 places in 377 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:05:00] [INFO ] Deduced a trap composed of 109 places in 307 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:05:01] [INFO ] Deduced a trap composed of 312 places in 472 ms of which 127 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:05:03] [INFO ] Deduced a trap composed of 302 places in 396 ms of which 83 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:05:04] [INFO ] Deduced a trap composed of 302 places in 445 ms of which 116 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:05:06] [INFO ] Deduced a trap composed of 306 places in 442 ms of which 114 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:05:07] [INFO ] Deduced a trap composed of 314 places in 448 ms of which 120 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:05:07] [INFO ] Deduced a trap composed of 312 places in 415 ms of which 116 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:05:08] [INFO ] Deduced a trap composed of 42 places in 369 ms of which 53 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/568 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 1518 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 568/2074 variables, and 65 constraints, problems are : Problem set: 0 solved, 1518 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 18/20 constraints, Generalized P Invariants (flows): 27/34 constraints, State Equation: 0/576 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 414/1104 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61939ms problems are : Problem set: 0 solved, 1518 unsolved
Search for dead transitions found 0 dead transitions in 61943ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 84542 ms. Remains : 576/576 places, 1522/1522 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 576 transition count 1498
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 36 place count 570 transition count 1510
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 1 with 24 rules applied. Total rules applied 60 place count 570 transition count 1486
Applied a total of 60 rules in 75 ms. Remains 570 /576 variables (removed 6) and now considering 1486/1522 (removed 36) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1486 rows 570 cols
[2025-06-04 03:05:14] [INFO ] Computed 54 invariants in 39 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-04 03:05:15] [INFO ] [Real]Absence check using 18 positive place invariants in 5 ms returned sat
[2025-06-04 03:05:15] [INFO ] [Real]Absence check using 18 positive and 36 generalized place invariants in 34 ms returned sat
[2025-06-04 03:05:15] [INFO ] After 167ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-04 03:05:15] [INFO ] [Nat]Absence check using 18 positive place invariants in 4 ms returned sat
[2025-06-04 03:05:15] [INFO ] [Nat]Absence check using 18 positive and 36 generalized place invariants in 33 ms returned sat
[2025-06-04 03:05:17] [INFO ] After 2592ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:05:18] [INFO ] Deduced a trap composed of 75 places in 112 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:05:18] [INFO ] Deduced a trap composed of 75 places in 56 ms of which 6 ms to minimize.
[2025-06-04 03:05:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 391 ms
TRAPS : Iteration 1
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:05:19] [INFO ] Deduced a trap composed of 75 places in 60 ms of which 4 ms to minimize.
[2025-06-04 03:05:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 176 ms
TRAPS : Iteration 2
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:05:20] [INFO ] Deduced a trap composed of 75 places in 60 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:05:20] [INFO ] Deduced a trap composed of 75 places in 59 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:05:21] [INFO ] Deduced a trap composed of 75 places in 73 ms of which 4 ms to minimize.
[2025-06-04 03:05:22] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2116 ms
TRAPS : Iteration 3
[2025-06-04 03:05:22] [INFO ] After 7219ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-04 03:05:22] [INFO ] After 7618ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2025-06-04 03:05:22] [INFO ] Flatten gal took : 71 ms
[2025-06-04 03:05:22] [INFO ] Flatten gal took : 71 ms
[2025-06-04 03:05:22] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10219989302903415469.gal : 10 ms
[2025-06-04 03:05:22] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10903260284212077069.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/ReachabilityCardinality10219989302903415469.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10903260284212077069.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
Loading property file /tmp/ReachabilityCardinality10903260284212077069.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :4 after 8
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :8 after 41
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :41 after 249
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :249 after 2001
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :2001 after 2359
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :2359 after 2748
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :2748 after 3189
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :3189 after 3734
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :3734 after 178737
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :178737 after 187359
Detected timeout of ITS tools.
[2025-06-04 03:05:38] [INFO ] Flatten gal took : 68 ms
[2025-06-04 03:05:38] [INFO ] Applying decomposition
[2025-06-04 03:05:38] [INFO ] Flatten gal took : 65 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph5971872691605904821.txt' '-o' '/tmp/graph5971872691605904821.bin' '-w' '/tmp/graph5971872691605904821.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5971872691605904821.bin' '-l' '-1' '-v' '-w' '/tmp/graph5971872691605904821.weights' '-q' '0' '-e' '0.001'
[2025-06-04 03:05:38] [INFO ] Decomposing Gal with order
[2025-06-04 03:05:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 03:05:38] [INFO ] Removed a total of 897 redundant transitions.
[2025-06-04 03:05:39] [INFO ] Flatten gal took : 353 ms
[2025-06-04 03:05:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 334 labels/synchronizations in 72 ms.
[2025-06-04 03:05:39] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15977777853797997350.gal : 27 ms
[2025-06-04 03:05:39] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10592143307961645605.prop : 4 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/ReachabilityCardinality15977777853797997350.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10592143307961645605.prop' '--nowitness'

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 ...309
Loading property file /tmp/ReachabilityCardinality10592143307961645605.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 2
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :2 after 2
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :2 after 2
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :2 after 2
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :2 after 48
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 39463 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-04 03:05:54] [INFO ] Flatten gal took : 63 ms
[2025-06-04 03:05:54] [INFO ] Applying decomposition
[2025-06-04 03:05:54] [INFO ] Flatten gal took : 62 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph7887638217333760176.txt' '-o' '/tmp/graph7887638217333760176.bin' '-w' '/tmp/graph7887638217333760176.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph7887638217333760176.bin' '-l' '-1' '-v' '-w' '/tmp/graph7887638217333760176.weights' '-q' '0' '-e' '0.001'
[2025-06-04 03:05:54] [INFO ] Decomposing Gal with order
[2025-06-04 03:05:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 03:05:54] [INFO ] Removed a total of 1122 redundant transitions.
[2025-06-04 03:05:55] [INFO ] Flatten gal took : 145 ms
[2025-06-04 03:05:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 274 labels/synchronizations in 39 ms.
[2025-06-04 03:05:55] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8879705073432801736.gal : 14 ms
[2025-06-04 03:05:55] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14782207296599701683.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8879705073432801736.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14782207296599701683.prop' '--nowitness'

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 ...308
Loading property file /tmp/ReachabilityCardinality14782207296599701683.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :5 after 5
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :5 after 51
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :51 after 51
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :51 after 1850
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1850 after 63773
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :63773 after 184141
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :184141 after 205693
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :205693 after 205693
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :205693 after 205693
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :205693 after 205693
SDD proceeding with computation,1 properties remain. new max is 262144
SDD size :205693 after 1.25132e+06
SDD proceeding with computation,1 properties remain. new max is 524288
SDD size :1.25132e+06 after 9.78738e+06
SDD proceeding with computation,1 properties remain. new max is 1048576
SDD size :9.78738e+06 after 1.47076e+07
SDD proceeding with computation,1 properties remain. new max is 2097152
SDD size :1.47076e+07 after 1.47448e+08
Detected timeout of ITS tools.
[2025-06-04 03:37:31] [INFO ] Flatten gal took : 703 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin4253729175579502553
[2025-06-04 03:37:32] [INFO ] Too many transitions (1522) to apply POR reductions. Disabling POR matrices.
[2025-06-04 03:37:32] [INFO ] Applying decomposition
[2025-06-04 03:37:32] [INFO ] Built C files in 585ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4253729175579502553
Running compilation step : cd /tmp/ltsmin4253729175579502553;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2025-06-04 03:37:32] [INFO ] Flatten gal took : 591 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph12983131910794230449.txt' '-o' '/tmp/graph12983131910794230449.bin' '-w' '/tmp/graph12983131910794230449.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12983131910794230449.bin' '-l' '-1' '-v' '-w' '/tmp/graph12983131910794230449.weights' '-q' '0' '-e' '0.001'
[2025-06-04 03:37:35] [INFO ] Decomposing Gal with order
[2025-06-04 03:37:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 03:37:35] [INFO ] Removed a total of 860 redundant transitions.
Compilation finished in 5033 ms.
Running link step : cd /tmp/ltsmin4253729175579502553;'gcc' '-shared' '-o' 'gal.so' 'model.o'
[2025-06-04 03:37:37] [INFO ] Flatten gal took : 2431 ms
Link finished in 110 ms.
Running LTSmin : cd /tmp/ltsmin4253729175579502553;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'PolyORBLFPTS04J06T06ReachabilityFireability202501==true'
[2025-06-04 03:37:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 455 labels/synchronizations in 1722 ms.
[2025-06-04 03:37:42] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability2016617552550081092.gal : 208 ms
[2025-06-04 03:37:42] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability1879209165382646895.prop : 45 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/ReachabilityFireability2016617552550081092.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability1879209165382646895.prop' '--nowitness'

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 ...307
Loading property file /tmp/ReachabilityFireability1879209165382646895.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1 after 16
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :16 after 16
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :16 after 16
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :16 after 1088
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :1088 after 195486
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :195486 after 569097
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :1.83166e+06 after 1.94333e+07
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :1.94333e+07 after 1.94377e+07

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is PolyORBLF-PT-S04J06T06, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r156-tall-174881254100487"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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