Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r289-tajo-171654445600294.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...........................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is PolyORBLF-PT-S04J06T06, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r289-tajo-171654445600294
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.8M
-rw-r--r-- 1 mcc users 19K Apr 11 17:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 111K Apr 11 17:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 16K Apr 11 17:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 100K Apr 11 17:07 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 8.2K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 36K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 22K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 82K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 33K Apr 11 17:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 180K Apr 11 17:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 90K Apr 11 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 427K Apr 11 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.7K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 2.6M May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716867028431

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-PT-S04J06T06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 03:30:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-28 03:30:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 03:30:30] [INFO ] Load time of PNML (sax parser for PT used): 396 ms
[2024-05-28 03:30:30] [INFO ] Transformed 618 places.
[2024-05-28 03:30:30] [INFO ] Transformed 3190 transitions.
[2024-05-28 03:30:30] [INFO ] Parsed PT model containing 618 places and 3190 transitions and 21570 arcs in 637 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 81 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 1626 transitions
Reduce redundant transitions removed 1626 transitions.
RANDOM walk for 40000 steps (9 resets) in 2073 ms. (19 steps per ms) remains 12/16 properties
FORMULA PolyORBLF-PT-S04J06T06-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S04J06T06-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S04J06T06-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S04J06T06-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40002 steps (8 resets) in 1052 ms. (37 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 804 ms. (49 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (8 resets) in 1181 ms. (33 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (8 resets) in 688 ms. (58 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (9 resets) in 180 ms. (221 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 218 ms. (182 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 218 ms. (182 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (9 resets) in 479 ms. (83 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (8 resets) in 334 ms. (119 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 292 ms. (136 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (8 resets) in 312 ms. (127 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 275 ms. (144 steps per ms) remains 12/12 properties
[2024-05-28 03:30:33] [INFO ] Flow matrix only has 1540 transitions (discarded 24 similar events)
// Phase 1: matrix 1540 rows 618 cols
[2024-05-28 03:30:33] [INFO ] Computed 54 invariants in 93 ms
[2024-05-28 03:30:33] [INFO ] State equation strengthened by 120 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/505 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/505 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/505 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Problem PolyORBLF-PT-S04J06T06-ReachabilityCardinality-2024-06 is UNSAT
FORMULA PolyORBLF-PT-S04J06T06-ReachabilityCardinality-2024-06 FALSE TECHNIQUES SMT_REFINEMENT
Problem PolyORBLF-PT-S04J06T06-ReachabilityCardinality-2024-07 is UNSAT
FORMULA PolyORBLF-PT-S04J06T06-ReachabilityCardinality-2024-07 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (OVERLAPS) 53/558 variables, 8/26 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/558 variables, 4/30 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/558 variables, 0/30 constraints. Problems are: Problem set: 2 solved, 10 unsolved
Problem PolyORBLF-PT-S04J06T06-ReachabilityCardinality-2024-00 is UNSAT
FORMULA PolyORBLF-PT-S04J06T06-ReachabilityCardinality-2024-00 TRUE TECHNIQUES SMT_REFINEMENT
Problem PolyORBLF-PT-S04J06T06-ReachabilityCardinality-2024-04 is UNSAT
FORMULA PolyORBLF-PT-S04J06T06-ReachabilityCardinality-2024-04 FALSE TECHNIQUES SMT_REFINEMENT
Problem PolyORBLF-PT-S04J06T06-ReachabilityCardinality-2024-05 is UNSAT
FORMULA PolyORBLF-PT-S04J06T06-ReachabilityCardinality-2024-05 FALSE TECHNIQUES SMT_REFINEMENT
Problem PolyORBLF-PT-S04J06T06-ReachabilityCardinality-2024-09 is UNSAT
FORMULA PolyORBLF-PT-S04J06T06-ReachabilityCardinality-2024-09 FALSE TECHNIQUES SMT_REFINEMENT
Problem PolyORBLF-PT-S04J06T06-ReachabilityCardinality-2024-12 is UNSAT
FORMULA PolyORBLF-PT-S04J06T06-ReachabilityCardinality-2024-12 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 6 (OVERLAPS) 60/618 variables, 24/54 constraints. Problems are: Problem set: 7 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/618 variables, 0/54 constraints. Problems are: Problem set: 7 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 1540/2158 variables, 618/672 constraints. Problems are: Problem set: 7 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2158 variables, 120/792 constraints. Problems are: Problem set: 7 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2158 variables, 0/792 constraints. Problems are: Problem set: 7 solved, 5 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2158/2158 variables, and 792 constraints, problems are : Problem set: 7 solved, 5 unsolved in 5121 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 36/36 constraints, State Equation: 618/618 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 12/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 7 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 7 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 195/258 variables, 11/11 constraints. Problems are: Problem set: 7 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/258 variables, 0/11 constraints. Problems are: Problem set: 7 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 16/274 variables, 4/15 constraints. Problems are: Problem set: 7 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/274 variables, 0/15 constraints. Problems are: Problem set: 7 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 335/609 variables, 32/47 constraints. Problems are: Problem set: 7 solved, 5 unsolved
[2024-05-28 03:30:39] [INFO ] Deduced a trap composed of 83 places in 228 ms of which 21 ms to minimize.
[2024-05-28 03:30:40] [INFO ] Deduced a trap composed of 84 places in 152 ms of which 1 ms to minimize.
[2024-05-28 03:30:40] [INFO ] Deduced a trap composed of 83 places in 126 ms of which 2 ms to minimize.
[2024-05-28 03:30:40] [INFO ] Deduced a trap composed of 84 places in 80 ms of which 1 ms to minimize.
[2024-05-28 03:30:40] [INFO ] Deduced a trap composed of 83 places in 123 ms of which 1 ms to minimize.
[2024-05-28 03:30:40] [INFO ] Deduced a trap composed of 84 places in 151 ms of which 1 ms to minimize.
Problem PolyORBLF-PT-S04J06T06-ReachabilityCardinality-2024-11 is UNSAT
FORMULA PolyORBLF-PT-S04J06T06-ReachabilityCardinality-2024-11 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 6 (INCLUDED_ONLY) 0/609 variables, 6/53 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/609 variables, 0/53 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 2/611 variables, 2/55 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/611 variables, 0/55 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 5/616 variables, 4/59 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/616 variables, 0/59 constraints. Problems are: Problem set: 8 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2156/2158 variables, and 675 constraints, problems are : Problem set: 8 solved, 4 unsolved in 5023 ms.
Refiners :[Positive P Invariants (semi-flows): 17/18 constraints, Generalized P Invariants (flows): 36/36 constraints, State Equation: 616/618 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/9 constraints, Known Traps: 6/6 constraints]
After SMT, in 10753ms problems are : Problem set: 8 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 34 out of 618 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 618/618 places, 1564/1564 transitions.
Ensure Unique test removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 51 rules applied. Total rules applied 51 place count 614 transition count 1517
Reduce places removed 47 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 50 rules applied. Total rules applied 101 place count 567 transition count 1514
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 104 place count 564 transition count 1514
Performed 67 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 67 Pre rules applied. Total rules applied 104 place count 564 transition count 1447
Deduced a syphon composed of 67 places in 3 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 3 with 134 rules applied. Total rules applied 238 place count 497 transition count 1447
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 239 place count 496 transition count 1446
Iterating global reduction 3 with 1 rules applied. Total rules applied 240 place count 496 transition count 1446
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
Deduced a syphon composed of 46 places in 2 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 3 with 92 rules applied. Total rules applied 332 place count 450 transition count 1400
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 3 with 9 rules applied. Total rules applied 341 place count 450 transition count 1391
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 350 place count 441 transition count 1391
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 352 place count 441 transition count 1391
Applied a total of 352 rules in 632 ms. Remains 441 /618 variables (removed 177) and now considering 1391/1564 (removed 173) transitions.
Running 1387 sub problems to find dead transitions.
[2024-05-28 03:30:44] [INFO ] Flow matrix only has 1367 transitions (discarded 24 similar events)
// Phase 1: matrix 1367 rows 441 cols
[2024-05-28 03:30:44] [INFO ] Computed 50 invariants in 61 ms
[2024-05-28 03:30:44] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/437 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1387 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/437 variables, 24/41 constraints. Problems are: Problem set: 0 solved, 1387 unsolved
[2024-05-28 03:31:01] [INFO ] Deduced a trap composed of 3 places in 77 ms of which 2 ms to minimize.
[2024-05-28 03:31:03] [INFO ] Deduced a trap composed of 37 places in 213 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 437/1808 variables, and 43 constraints, problems are : Problem set: 0 solved, 1387 unsolved in 20051 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 24/33 constraints, State Equation: 0/441 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1387/1387 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1387 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/437 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1387 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/437 variables, 24/41 constraints. Problems are: Problem set: 0 solved, 1387 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/437 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 1387 unsolved
[2024-05-28 03:31:14] [INFO ] Deduced a trap composed of 29 places in 314 ms of which 3 ms to minimize.
[2024-05-28 03:31:15] [INFO ] Deduced a trap composed of 54 places in 77 ms of which 1 ms to minimize.
[2024-05-28 03:31:15] [INFO ] Deduced a trap composed of 54 places in 73 ms of which 1 ms to minimize.
[2024-05-28 03:31:15] [INFO ] Deduced a trap composed of 56 places in 77 ms of which 2 ms to minimize.
[2024-05-28 03:31:18] [INFO ] Deduced a trap composed of 56 places in 66 ms of which 1 ms to minimize.
[2024-05-28 03:31:18] [INFO ] Deduced a trap composed of 53 places in 62 ms of which 1 ms to minimize.
[2024-05-28 03:31:18] [INFO ] Deduced a trap composed of 20 places in 169 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/437 variables, 7/50 constraints. Problems are: Problem set: 0 solved, 1387 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 437/1808 variables, and 50 constraints, problems are : Problem set: 0 solved, 1387 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 24/33 constraints, State Equation: 0/441 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1387 constraints, Known Traps: 9/9 constraints]
After SMT, in 47653ms problems are : Problem set: 0 solved, 1387 unsolved
Search for dead transitions found 0 dead transitions in 47702ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48381 ms. Remains : 441/618 places, 1391/1564 transitions.
RANDOM walk for 40000 steps (9 resets) in 615 ms. (64 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 173 ms. (229 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (9 resets) in 254 ms. (156 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (9 resets) in 242 ms. (164 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 205 ms. (194 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 107166 steps, run timeout after 3001 ms. (steps per millisecond=35 ) properties seen :0 out of 4
Probabilistic random walk after 107166 steps, saw 76684 distinct states, run finished after 3005 ms. (steps per millisecond=35 ) properties seen :0
[2024-05-28 03:31:35] [INFO ] Flow matrix only has 1367 transitions (discarded 24 similar events)
[2024-05-28 03:31:35] [INFO ] Invariant cache hit.
[2024-05-28 03:31:35] [INFO ] State equation strengthened by 120 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 159/193 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/193 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 16/209 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 214/423 variables, 27/41 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/423 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 2/425 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/425 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 14/439 variables, 6/49 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/439 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 1367/1806 variables, 439/488 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1806 variables, 120/608 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1806 variables, 0/608 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 2/1808 variables, 2/610 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1808 variables, 1/611 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1808 variables, 0/611 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 0/1808 variables, 0/611 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1808/1808 variables, and 611 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2783 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 33/33 constraints, State Equation: 441/441 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 159/193 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/193 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 16/209 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 214/423 variables, 27/41 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/423 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 2/425 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/425 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 14/439 variables, 6/49 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 03:31:39] [INFO ] Deduced a trap composed of 54 places in 86 ms of which 2 ms to minimize.
[2024-05-28 03:31:39] [INFO ] Deduced a trap composed of 53 places in 48 ms of which 1 ms to minimize.
[2024-05-28 03:31:39] [INFO ] Deduced a trap composed of 56 places in 80 ms of which 2 ms to minimize.
[2024-05-28 03:31:39] [INFO ] Deduced a trap composed of 54 places in 60 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/439 variables, 4/53 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/439 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 1367/1806 variables, 439/492 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1806 variables, 120/612 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem PolyORBLF-PT-S04J06T06-ReachabilityCardinality-2024-10 is UNSAT
FORMULA PolyORBLF-PT-S04J06T06-ReachabilityCardinality-2024-10 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 14 (INCLUDED_ONLY) 0/1806 variables, 4/616 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1806 variables, 0/616 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 2/1808 variables, 2/618 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1808 variables, 1/619 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1808 variables, 0/619 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 0/1808 variables, 0/619 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1808/1808 variables, and 619 constraints, problems are : Problem set: 1 solved, 3 unsolved in 44471 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 33/33 constraints, State Equation: 441/441 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 4/4 constraints]
After SMT, in 47288ms problems are : Problem set: 1 solved, 3 unsolved
Parikh walk visited 0 properties in 4685 ms.
Support contains 33 out of 441 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 441/441 places, 1391/1391 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 440 transition count 1390
Applied a total of 2 rules in 84 ms. Remains 440 /441 variables (removed 1) and now considering 1390/1391 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 84 ms. Remains : 440/441 places, 1390/1391 transitions.
RANDOM walk for 40000 steps (10 resets) in 662 ms. (60 steps per ms) remains 2/3 properties
FORMULA PolyORBLF-PT-S04J06T06-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40002 steps (10 resets) in 338 ms. (118 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (9 resets) in 247 ms. (161 steps per ms) remains 2/2 properties
[2024-05-28 03:32:28] [INFO ] Flow matrix only has 1366 transitions (discarded 24 similar events)
// Phase 1: matrix 1366 rows 440 cols
[2024-05-28 03:32:28] [INFO ] Computed 50 invariants in 31 ms
[2024-05-28 03:32:28] [INFO ] State equation strengthened by 120 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 67/79 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 8/87 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 315/402 variables, 19/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/402 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 15/417 variables, 12/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/417 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 21/438 variables, 13/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/438 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1366/1804 variables, 438/487 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1804 variables, 120/607 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1804 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 2/1806 variables, 2/609 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1806 variables, 1/610 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1806 variables, 0/610 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/1806 variables, 0/610 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1806/1806 variables, and 610 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2157 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 32/32 constraints, State Equation: 440/440 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 67/79 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 8/87 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 315/402 variables, 19/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/402 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 15/417 variables, 12/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/417 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 21/438 variables, 13/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 03:32:30] [INFO ] Deduced a trap composed of 53 places in 130 ms of which 2 ms to minimize.
[2024-05-28 03:32:31] [INFO ] Deduced a trap composed of 57 places in 126 ms of which 2 ms to minimize.
[2024-05-28 03:32:31] [INFO ] Deduced a trap composed of 55 places in 79 ms of which 2 ms to minimize.
[2024-05-28 03:32:31] [INFO ] Deduced a trap composed of 53 places in 48 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/438 variables, 4/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/438 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 1366/1804 variables, 438/491 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1804 variables, 120/611 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1804 variables, 2/613 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1804 variables, 0/613 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 2/1806 variables, 2/615 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1806 variables, 1/616 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1806 variables, 0/616 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/1806 variables, 0/616 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1806/1806 variables, and 616 constraints, problems are : Problem set: 0 solved, 2 unsolved in 19864 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 32/32 constraints, State Equation: 440/440 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 4/4 constraints]
After SMT, in 22123ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 1203 ms.
Support contains 12 out of 440 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 440/440 places, 1390/1390 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 440 transition count 1389
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 439 transition count 1389
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 2 place count 439 transition count 1383
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 14 place count 433 transition count 1383
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 24 place count 428 transition count 1378
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 25 place count 428 transition count 1377
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 26 place count 427 transition count 1377
Applied a total of 26 rules in 75 ms. Remains 427 /440 variables (removed 13) and now considering 1377/1390 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 76 ms. Remains : 427/440 places, 1377/1390 transitions.
RANDOM walk for 40000 steps (8 resets) in 529 ms. (75 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (11 resets) in 207 ms. (192 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 175 ms. (227 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 129685 steps, run timeout after 3001 ms. (steps per millisecond=43 ) properties seen :0 out of 2
Probabilistic random walk after 129685 steps, saw 91745 distinct states, run finished after 3001 ms. (steps per millisecond=43 ) properties seen :0
[2024-05-28 03:32:55] [INFO ] Flow matrix only has 1353 transitions (discarded 24 similar events)
// Phase 1: matrix 1353 rows 427 cols
[2024-05-28 03:32:55] [INFO ] Computed 50 invariants in 26 ms
[2024-05-28 03:32:55] [INFO ] State equation strengthened by 120 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 64/76 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 12/88 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 293/381 variables, 16/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/381 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 15/396 variables, 11/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/396 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 29/425 variables, 16/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/425 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1353/1778 variables, 425/474 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1778 variables, 120/594 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1778 variables, 0/594 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 2/1780 variables, 2/596 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1780 variables, 1/597 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1780 variables, 0/597 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/1780 variables, 0/597 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1780/1780 variables, and 597 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1816 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 32/32 constraints, State Equation: 427/427 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 64/76 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 12/88 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 293/381 variables, 16/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/381 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 15/396 variables, 11/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/396 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 29/425 variables, 16/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 03:32:57] [INFO ] Deduced a trap composed of 52 places in 80 ms of which 2 ms to minimize.
[2024-05-28 03:32:57] [INFO ] Deduced a trap composed of 53 places in 46 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/425 variables, 2/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/425 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 1353/1778 variables, 425/476 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1778 variables, 120/596 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1778 variables, 2/598 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1778/1780 variables, and 598 constraints, problems are : Problem set: 0 solved, 2 unsolved in 37362 ms.
Refiners :[Positive P Invariants (semi-flows): 17/18 constraints, Generalized P Invariants (flows): 32/32 constraints, State Equation: 425/427 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 39227ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 1183 ms.
Support contains 12 out of 427 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 427/427 places, 1377/1377 transitions.
Applied a total of 0 rules in 41 ms. Remains 427 /427 variables (removed 0) and now considering 1377/1377 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 427/427 places, 1377/1377 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 427/427 places, 1377/1377 transitions.
Applied a total of 0 rules in 36 ms. Remains 427 /427 variables (removed 0) and now considering 1377/1377 (removed 0) transitions.
[2024-05-28 03:33:35] [INFO ] Flow matrix only has 1353 transitions (discarded 24 similar events)
[2024-05-28 03:33:35] [INFO ] Invariant cache hit.
[2024-05-28 03:33:36] [INFO ] Implicit Places using invariants in 691 ms returned [97, 138, 229, 252, 335, 382]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 700 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 421/427 places, 1377/1377 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 418 transition count 1374
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 418 transition count 1374
Applied a total of 6 rules in 60 ms. Remains 418 /421 variables (removed 3) and now considering 1374/1377 (removed 3) transitions.
[2024-05-28 03:33:36] [INFO ] Flow matrix only has 1350 transitions (discarded 24 similar events)
// Phase 1: matrix 1350 rows 418 cols
[2024-05-28 03:33:36] [INFO ] Computed 44 invariants in 22 ms
[2024-05-28 03:33:36] [INFO ] Implicit Places using invariants in 582 ms returned []
[2024-05-28 03:33:36] [INFO ] Flow matrix only has 1350 transitions (discarded 24 similar events)
[2024-05-28 03:33:36] [INFO ] Invariant cache hit.
[2024-05-28 03:33:37] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 03:33:46] [INFO ] Implicit Places using invariants and state equation in 9495 ms returned []
Implicit Place search using SMT with State Equation took 10093 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 418/427 places, 1374/1377 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 10889 ms. Remains : 418/427 places, 1374/1377 transitions.
RANDOM walk for 40001 steps (9 resets) in 465 ms. (85 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (9 resets) in 180 ms. (221 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (9 resets) in 163 ms. (243 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 146539 steps, run timeout after 3001 ms. (steps per millisecond=48 ) properties seen :0 out of 2
Probabilistic random walk after 146539 steps, saw 101341 distinct states, run finished after 3001 ms. (steps per millisecond=48 ) properties seen :0
[2024-05-28 03:33:49] [INFO ] Flow matrix only has 1350 transitions (discarded 24 similar events)
[2024-05-28 03:33:49] [INFO ] Invariant cache hit.
[2024-05-28 03:33:49] [INFO ] State equation strengthened by 120 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 171/183 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/183 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 45/228 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/228 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 12/240 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 163/403 variables, 22/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/403 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 5/408 variables, 5/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/408 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 8/416 variables, 3/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/416 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 1350/1766 variables, 416/459 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1766 variables, 120/579 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1766 variables, 0/579 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 2/1768 variables, 2/581 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1768 variables, 1/582 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1768 variables, 0/582 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/1768 variables, 0/582 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1768/1768 variables, and 582 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1361 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 418/418 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 171/183 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/183 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 45/228 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/228 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 12/240 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 163/403 variables, 22/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/403 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 5/408 variables, 5/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/408 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 8/416 variables, 3/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 03:33:51] [INFO ] Deduced a trap composed of 53 places in 63 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/416 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/416 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 1350/1766 variables, 416/460 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1766 variables, 120/580 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1766 variables, 2/582 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1766/1768 variables, and 582 constraints, problems are : Problem set: 0 solved, 2 unsolved in 57110 ms.
Refiners :[Positive P Invariants (semi-flows): 18/19 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 416/418 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 58487ms problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 12 out of 418 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 418/418 places, 1374/1374 transitions.
Applied a total of 0 rules in 53 ms. Remains 418 /418 variables (removed 0) and now considering 1374/1374 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 418/418 places, 1374/1374 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 418/418 places, 1374/1374 transitions.
Applied a total of 0 rules in 37 ms. Remains 418 /418 variables (removed 0) and now considering 1374/1374 (removed 0) transitions.
[2024-05-28 03:34:48] [INFO ] Flow matrix only has 1350 transitions (discarded 24 similar events)
[2024-05-28 03:34:48] [INFO ] Invariant cache hit.
[2024-05-28 03:34:48] [INFO ] Implicit Places using invariants in 614 ms returned []
[2024-05-28 03:34:48] [INFO ] Flow matrix only has 1350 transitions (discarded 24 similar events)
[2024-05-28 03:34:48] [INFO ] Invariant cache hit.
[2024-05-28 03:34:49] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 03:34:58] [INFO ] Implicit Places using invariants and state equation in 9760 ms returned []
Implicit Place search using SMT with State Equation took 10381 ms to find 0 implicit places.
[2024-05-28 03:34:58] [INFO ] Redundant transitions in 103 ms returned []
Running 1370 sub problems to find dead transitions.
[2024-05-28 03:34:58] [INFO ] Flow matrix only has 1350 transitions (discarded 24 similar events)
[2024-05-28 03:34:58] [INFO ] Invariant cache hit.
[2024-05-28 03:34:58] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/414 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 1370 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/414 variables, 21/40 constraints. Problems are: Problem set: 0 solved, 1370 unsolved
[2024-05-28 03:35:17] [INFO ] Deduced a trap composed of 20 places in 323 ms of which 2 ms to minimize.
[2024-05-28 03:35:17] [INFO ] Deduced a trap composed of 52 places in 185 ms of which 2 ms to minimize.
[2024-05-28 03:35:18] [INFO ] Deduced a trap composed of 52 places in 233 ms of which 2 ms to minimize.
[2024-05-28 03:35:18] [INFO ] Deduced a trap composed of 85 places in 184 ms of which 2 ms to minimize.
[2024-05-28 03:35:18] [INFO ] Deduced a trap composed of 53 places in 41 ms of which 1 ms to minimize.
[2024-05-28 03:35:18] [INFO ] Deduced a trap composed of 15 places in 175 ms of which 2 ms to minimize.
[2024-05-28 03:35:18] [INFO ] Deduced a trap composed of 53 places in 54 ms of which 1 ms to minimize.
[2024-05-28 03:35:18] [INFO ] Deduced a trap composed of 27 places in 197 ms of which 2 ms to minimize.
[2024-05-28 03:35:19] [INFO ] Deduced a trap composed of 53 places in 52 ms of which 2 ms to minimize.
[2024-05-28 03:35:19] [INFO ] Deduced a trap composed of 51 places in 81 ms of which 2 ms to minimize.
[2024-05-28 03:35:19] [INFO ] Deduced a trap composed of 59 places in 441 ms of which 5 ms to minimize.
[2024-05-28 03:35:19] [INFO ] Deduced a trap composed of 55 places in 343 ms of which 3 ms to minimize.
[2024-05-28 03:35:21] [INFO ] Deduced a trap composed of 133 places in 339 ms of which 4 ms to minimize.
[2024-05-28 03:35:22] [INFO ] Deduced a trap composed of 149 places in 391 ms of which 4 ms to minimize.
[2024-05-28 03:35:27] [INFO ] Deduced a trap composed of 235 places in 309 ms of which 3 ms to minimize.
[2024-05-28 03:35:28] [INFO ] Deduced a trap composed of 130 places in 239 ms of which 2 ms to minimize.
[2024-05-28 03:35:28] [INFO ] Deduced a trap composed of 149 places in 222 ms of which 3 ms to minimize.
[2024-05-28 03:35:29] [INFO ] Deduced a trap composed of 163 places in 307 ms of which 3 ms to minimize.
[2024-05-28 03:35:29] [INFO ] Deduced a trap composed of 165 places in 293 ms of which 2 ms to minimize.
[2024-05-28 03:35:30] [INFO ] Deduced a trap composed of 204 places in 320 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/414 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1370 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 414/1768 variables, and 60 constraints, problems are : Problem set: 0 solved, 1370 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 21/25 constraints, State Equation: 0/418 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1370/1370 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1370 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/414 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 1370 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/414 variables, 21/40 constraints. Problems are: Problem set: 0 solved, 1370 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/414 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1370 unsolved
[2024-05-28 03:35:45] [INFO ] Deduced a trap composed of 202 places in 255 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/414 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 1370 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 414/1768 variables, and 61 constraints, problems are : Problem set: 0 solved, 1370 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 21/25 constraints, State Equation: 0/418 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1370 constraints, Known Traps: 21/21 constraints]
After SMT, in 67362ms problems are : Problem set: 0 solved, 1370 unsolved
Search for dead transitions found 0 dead transitions in 67375ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77915 ms. Remains : 418/418 places, 1374/1374 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 418 transition count 1350
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -48
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 412 transition count 1398
Drop transitions (Redundant composition of simpler transitions.) removed 42 transitions
Redundant transition composition rules discarded 42 transitions
Iterating global reduction 1 with 42 rules applied. Total rules applied 78 place count 412 transition count 1356
Free-agglomeration rule applied 6 times.
Iterating global reduction 1 with 6 rules applied. Total rules applied 84 place count 412 transition count 1350
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 90 place count 406 transition count 1350
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 2 with 6 rules applied. Total rules applied 96 place count 406 transition count 1344
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 102 place count 400 transition count 1344
Applied a total of 102 rules in 139 ms. Remains 400 /418 variables (removed 18) and now considering 1344/1374 (removed 30) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 1344 rows 400 cols
[2024-05-28 03:36:06] [INFO ] Computed 44 invariants in 21 ms
[2024-05-28 03:36:06] [INFO ] After 226ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-28 03:36:06] [INFO ] [Nat]Absence check using 19 positive place invariants in 9 ms returned sat
[2024-05-28 03:36:06] [INFO ] [Nat]Absence check using 19 positive and 25 generalized place invariants in 41 ms returned sat
[2024-05-28 03:36:08] [INFO ] After 1931ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-28 03:36:09] [INFO ] Deduced a trap composed of 49 places in 53 ms of which 1 ms to minimize.
[2024-05-28 03:36:09] [INFO ] Deduced a trap composed of 50 places in 73 ms of which 1 ms to minimize.
[2024-05-28 03:36:10] [INFO ] Deduced a trap composed of 48 places in 69 ms of which 1 ms to minimize.
[2024-05-28 03:36:10] [INFO ] Deduced a trap composed of 50 places in 65 ms of which 1 ms to minimize.
[2024-05-28 03:36:11] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2280 ms
TRAPS : Iteration 1
[2024-05-28 03:36:13] [INFO ] Deduced a trap composed of 50 places in 80 ms of which 2 ms to minimize.
[2024-05-28 03:36:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 487 ms
TRAPS : Iteration 2
[2024-05-28 03:36:15] [INFO ] Deduced a trap composed of 49 places in 65 ms of which 1 ms to minimize.
[2024-05-28 03:36:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 199 ms
TRAPS : Iteration 3
[2024-05-28 03:36:16] [INFO ] After 9786ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-28 03:36:17] [INFO ] After 11209ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 11627 ms.
[2024-05-28 03:36:17] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 4 ms.
[2024-05-28 03:36:17] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 418 places, 1374 transitions and 7949 arcs took 19 ms.
[2024-05-28 03:36:18] [INFO ] Flatten gal took : 196 ms
Total runtime 348543 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running PolyORBLF-PT-S04J06T06

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/412/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 418
TRANSITIONS: 1374
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.044s, Sys 0.003s]


SAVING FILE /home/mcc/execution/412/model (.net / .def) ...
EXPORT TIME: [User 0.002s, Sys 0.003s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 805
MODEL NAME: /home/mcc/execution/412/model
418 places, 1374 transitions.

No place bound informations found.
No place bound informations found.
No place bound informations found.
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML

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="ReachabilityCardinality"
export BK_TOOL="greatspnxred"
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-5568"
echo " Executing tool greatspnxred"
echo " Input is PolyORBLF-PT-S04J06T06, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r289-tajo-171654445600294"
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 [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;