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.r299-tajo-171654455700163.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 itstools
Input is PolyORBLF-PT-S02J06T10, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r299-tajo-171654455700163
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.2M
-rw-r--r-- 1 mcc users 34K Apr 11 17:11 CTLCardinality.txt
-rw-r--r-- 1 mcc users 179K Apr 11 17:11 CTLCardinality.xml
-rw-r--r-- 1 mcc users 35K Apr 11 17:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 170K 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 14K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 50K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 26K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 92K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 48K Apr 11 17:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 223K Apr 11 17:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 38K Apr 11 17:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 191K Apr 11 17:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 8.2K 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 1.1M 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

FORMULA_NAME StableMarking

=== Now, execution of the tool begins

BK_START 1717141625106

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=PolyORBLF-PT-S02J06T10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
StableMarking PT
Running Version 202405141337
[2024-05-31 07:47:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2024-05-31 07:47:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 07:47:06] [INFO ] Load time of PNML (sax parser for PT used): 150 ms
[2024-05-31 07:47:06] [INFO ] Transformed 844 places.
[2024-05-31 07:47:06] [INFO ] Transformed 1812 transitions.
[2024-05-31 07:47:06] [INFO ] Parsed PT model containing 844 places and 1812 transitions and 8302 arcs in 269 ms.
Ensure Unique test removed 160 transitions
Reduce redundant transitions removed 160 transitions.
[2024-05-31 07:47:07] [INFO ] Flatten gal took : 329 ms
RANDOM walk for 40000 steps (9 resets) in 3091 ms. (12 steps per ms) remains 22/844 properties
[2024-05-31 07:47:07] [INFO ] Flatten gal took : 138 ms
BEST_FIRST walk for 4002 steps (8 resets) in 109 ms. (36 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (8 resets) in 88 ms. (44 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (8 resets) in 125 ms. (31 steps per ms) remains 22/22 properties
[2024-05-31 07:47:07] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4655052992712987711.gal : 117 ms
BEST_FIRST walk for 4004 steps (8 resets) in 115 ms. (34 steps per ms) remains 22/22 properties
[2024-05-31 07:47:07] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10917301994736737747.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4655052992712987711.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10917301994736737747.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 4001 steps (8 resets) in 82 ms. (48 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (9 resets) in 95 ms. (41 steps per ms) remains 22/22 properties

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
BEST_FIRST walk for 4002 steps (8 resets) in 48 ms. (81 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (8 resets) in 39 ms. (100 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (8 resets) in 47 ms. (83 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4000 steps (8 resets) in 31 ms. (125 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 40 ms. (97 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (8 resets) in 31 ms. (125 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (8 resets) in 43 ms. (90 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4000 steps (8 resets) in 69 ms. (57 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (8 resets) in 64 ms. (61 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 42 ms. (93 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 60 ms. (65 steps per ms) remains 22/22 properties
Loading property file /tmp/ReachabilityCardinality10917301994736737747.prop.
BEST_FIRST walk for 4003 steps (8 resets) in 62 ms. (63 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (8 resets) in 27 ms. (142 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (8 resets) in 25 ms. (153 steps per ms) remains 22/22 properties
[2024-05-31 07:47:08] [INFO ] Flow matrix only has 1632 transitions (discarded 20 similar events)
// Phase 1: matrix 1632 rows 844 cols
[2024-05-31 07:47:08] [INFO ] Computed 58 invariants in 93 ms
[2024-05-31 07:47:08] [INFO ] State equation strengthened by 120 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
SDD proceeding with computation,22 properties remain. new max is 4
SDD size :1 after 3
At refinement iteration 1 (OVERLAPS) 370/392 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 22 unsolved
SDD proceeding with computation,22 properties remain. new max is 8
SDD size :3 after 6
SDD proceeding with computation,22 properties remain. new max is 16
SDD size :6 after 7
SDD proceeding with computation,22 properties remain. new max is 32
SDD size :7 after 23
SDD proceeding with computation,22 properties remain. new max is 64
SDD size :23 after 53
At refinement iteration 2 (INCLUDED_ONLY) 0/392 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 22 unsolved
SDD proceeding with computation,22 properties remain. new max is 128
SDD size :53 after 67
At refinement iteration 3 (OVERLAPS) 165/557 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/557 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (OVERLAPS) 2/559 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/559 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (OVERLAPS) 282/841 variables, 40/56 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/841 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 9 (OVERLAPS) 1/842 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 22 unsolved
SDD proceeding with computation,22 properties remain. new max is 256
SDD size :67 after 473
At refinement iteration 10 (INCLUDED_ONLY) 0/842 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 22 unsolved
SDD proceeding with computation,22 properties remain. new max is 512
SDD size :473 after 488
SDD proceeding with computation,22 properties remain. new max is 1024
SDD size :488 after 517
SDD proceeding with computation,22 properties remain. new max is 2048
SDD size :517 after 1993
SDD proceeding with computation,22 properties remain. new max is 4096
SDD size :1993 after 2133
At refinement iteration 11 (OVERLAPS) 1632/2474 variables, 842/899 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2474 variables, 120/1019 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2474 variables, 0/1019 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 14 (OVERLAPS) 2/2476 variables, 2/1021 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2476 variables, 1/1022 constraints. Problems are: Problem set: 0 solved, 22 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2476/2476 variables, and 1022 constraints, problems are : Problem set: 0 solved, 22 unsolved in 5043 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 45/45 constraints, State Equation: 844/844 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 22 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 370/392 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 22 unsolved
SDD proceeding with computation,22 properties remain. new max is 8192
SDD size :2133 after 2673
At refinement iteration 2 (INCLUDED_ONLY) 0/392 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (OVERLAPS) 165/557 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/557 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (OVERLAPS) 2/559 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/559 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (OVERLAPS) 282/841 variables, 40/56 constraints. Problems are: Problem set: 0 solved, 22 unsolved
[2024-05-31 07:47:17] [INFO ] Deduced a trap composed of 74 places in 332 ms of which 49 ms to minimize.
[2024-05-31 07:47:17] [INFO ] Deduced a trap composed of 73 places in 232 ms of which 13 ms to minimize.
[2024-05-31 07:47:17] [INFO ] Deduced a trap composed of 73 places in 171 ms of which 3 ms to minimize.
[2024-05-31 07:47:17] [INFO ] Deduced a trap composed of 74 places in 125 ms of which 3 ms to minimize.
[2024-05-31 07:47:18] [INFO ] Deduced a trap composed of 74 places in 119 ms of which 2 ms to minimize.
[2024-05-31 07:47:18] [INFO ] Deduced a trap composed of 73 places in 83 ms of which 1 ms to minimize.
SDD proceeding with computation,22 properties remain. new max is 16384
SDD size :2673 after 5409
[2024-05-31 07:47:18] [INFO ] Deduced a trap composed of 159 places in 390 ms of which 5 ms to minimize.
[2024-05-31 07:47:18] [INFO ] Deduced a trap composed of 73 places in 49 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 841/2476 variables, and 64 constraints, problems are : Problem set: 0 solved, 22 unsolved in 5020 ms.
Refiners :[Positive P Invariants (semi-flows): 11/13 constraints, Generalized P Invariants (flows): 45/45 constraints, State Equation: 0/844 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/22 constraints, Known Traps: 8/8 constraints]
After SMT, in 10289ms problems are : Problem set: 0 solved, 22 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 22 out of 844 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 844/844 places, 1652/1652 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 90 transitions
Trivial Post-agglo rules discarded 90 transitions
Performed 90 trivial Post agglomeration. Transition count delta: 90
Iterating post reduction 0 with 92 rules applied. Total rules applied 92 place count 842 transition count 1562
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 1 with 90 rules applied. Total rules applied 182 place count 752 transition count 1562
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 182 place count 752 transition count 1462
Deduced a syphon composed of 100 places in 2 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 382 place count 652 transition count 1462
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 2 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 542 place count 572 transition count 1382
Free-agglomeration rule (complex) applied 20 times.
Iterating global reduction 2 with 20 rules applied. Total rules applied 562 place count 572 transition count 1362
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 582 place count 552 transition count 1362
Applied a total of 582 rules in 326 ms. Remains 552 /844 variables (removed 292) and now considering 1362/1652 (removed 290) transitions.
Running 1360 sub problems to find dead transitions.
[2024-05-31 07:47:19] [INFO ] Flow matrix only has 1342 transitions (discarded 20 similar events)
// Phase 1: matrix 1342 rows 552 cols
[2024-05-31 07:47:19] [INFO ] Computed 56 invariants in 28 ms
[2024-05-31 07:47:19] [INFO ] State equation strengthened by 120 read => feed constraints.
SDD proceeding with computation,22 properties remain. new max is 32768
SDD size :5409 after 16833
At refinement iteration 0 (INCLUDED_ONLY) 0/550 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1360 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/550 variables, 37/54 constraints. Problems are: Problem set: 0 solved, 1360 unsolved
[2024-05-31 07:47:33] [INFO ] Deduced a trap composed of 23 places in 180 ms of which 3 ms to minimize.
[2024-05-31 07:47:33] [INFO ] Deduced a trap composed of 44 places in 80 ms of which 1 ms to minimize.
[2024-05-31 07:47:33] [INFO ] Deduced a trap composed of 44 places in 62 ms of which 1 ms to minimize.
[2024-05-31 07:47:33] [INFO ] Deduced a trap composed of 44 places in 103 ms of which 1 ms to minimize.
[2024-05-31 07:47:33] [INFO ] Deduced a trap composed of 44 places in 54 ms of which 1 ms to minimize.
[2024-05-31 07:47:34] [INFO ] Deduced a trap composed of 44 places in 33 ms of which 0 ms to minimize.
[2024-05-31 07:47:34] [INFO ] Deduced a trap composed of 46 places in 31 ms of which 1 ms to minimize.
[2024-05-31 07:47:34] [INFO ] Deduced a trap composed of 44 places in 31 ms of which 1 ms to minimize.
[2024-05-31 07:47:34] [INFO ] Deduced a trap composed of 44 places in 31 ms of which 1 ms to minimize.
[2024-05-31 07:47:34] [INFO ] Deduced a trap composed of 44 places in 32 ms of which 0 ms to minimize.
[2024-05-31 07:47:34] [INFO ] Deduced a trap composed of 44 places in 36 ms of which 1 ms to minimize.
[2024-05-31 07:47:35] [INFO ] Deduced a trap composed of 47 places in 276 ms of which 3 ms to minimize.
[2024-05-31 07:47:35] [INFO ] Deduced a trap composed of 79 places in 273 ms of which 4 ms to minimize.
[2024-05-31 07:47:35] [INFO ] Deduced a trap composed of 186 places in 277 ms of which 3 ms to minimize.
SDD proceeding with computation,22 properties remain. new max is 65536
SDD size :16833 after 67139
[2024-05-31 07:47:40] [INFO ] Deduced a trap composed of 332 places in 343 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 550/1894 variables, and 69 constraints, problems are : Problem set: 0 solved, 1360 unsolved in 20043 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 37/39 constraints, State Equation: 0/552 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1360/1360 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1360 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/550 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1360 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/550 variables, 37/54 constraints. Problems are: Problem set: 0 solved, 1360 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/550 variables, 15/69 constraints. Problems are: Problem set: 0 solved, 1360 unsolved
[2024-05-31 07:47:55] [INFO ] Deduced a trap composed of 38 places in 187 ms of which 3 ms to minimize.
SDD proceeding with computation,22 properties remain. new max is 131072
SDD size :67139 after 460542
[2024-05-31 07:48:00] [INFO ] Deduced a trap composed of 37 places in 347 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 550/1894 variables, and 71 constraints, problems are : Problem set: 0 solved, 1360 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 37/39 constraints, State Equation: 0/552 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1360 constraints, Known Traps: 17/17 constraints]
After SMT, in 43813ms problems are : Problem set: 0 solved, 1360 unsolved
Search for dead transitions found 0 dead transitions in 43852ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44216 ms. Remains : 552/844 places, 1362/1652 transitions.
RANDOM walk for 4000000 steps (1425 resets) in 51852 ms. (77 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400003 steps (51 resets) in 2062 ms. (193 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400002 steps (46 resets) in 2074 ms. (192 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400003 steps (52 resets) in 2429 ms. (164 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400003 steps (46 resets) in 2078 ms. (192 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400003 steps (44 resets) in 2320 ms. (172 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400003 steps (45 resets) in 2184 ms. (183 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400003 steps (51 resets) in 2333 ms. (171 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400003 steps (55 resets) in 2360 ms. (169 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400001 steps (58 resets) in 2347 ms. (170 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400002 steps (49 resets) in 2094 ms. (190 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400003 steps (39 resets) in 2117 ms. (188 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400002 steps (52 resets) in 2311 ms. (173 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400003 steps (48 resets) in 2159 ms. (185 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400003 steps (53 resets) in 2260 ms. (176 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400003 steps (57 resets) in 2460 ms. (162 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400004 steps (54 resets) in 2259 ms. (176 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400001 steps (46 resets) in 2510 ms. (159 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400004 steps (53 resets) in 2377 ms. (168 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400002 steps (58 resets) in 2010 ms. (198 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400003 steps (49 resets) in 2390 ms. (167 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400004 steps (55 resets) in 2404 ms. (166 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400004 steps (67 resets) in 2348 ms. (170 steps per ms) remains 22/22 properties
SDD proceeding with computation,22 properties remain. new max is 262144
SDD size :460542 after 3.23162e+06
Interrupted probabilistic random walk after 2064188 steps, run timeout after 90001 ms. (steps per millisecond=22 ) properties seen :0 out of 22
Probabilistic random walk after 2064188 steps, saw 1303231 distinct states, run finished after 90007 ms. (steps per millisecond=22 ) properties seen :0
[2024-05-31 07:50:03] [INFO ] Flow matrix only has 1342 transitions (discarded 20 similar events)
[2024-05-31 07:50:03] [INFO ] Invariant cache hit.
[2024-05-31 07:50:03] [INFO ] State equation strengthened by 120 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 358/380 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/380 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/380 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (OVERLAPS) 22/402 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/402 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (OVERLAPS) 7/409 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/409 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 8 (OVERLAPS) 120/529 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/529 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 10 (OVERLAPS) 11/540 variables, 5/45 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/540 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 12 (OVERLAPS) 10/550 variables, 10/55 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/550 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 14 (OVERLAPS) 1342/1892 variables, 550/605 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1892 variables, 120/725 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1892 variables, 0/725 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 17 (OVERLAPS) 2/1894 variables, 2/727 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1894 variables, 1/728 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1894 variables, 0/728 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 20 (OVERLAPS) 0/1894 variables, 0/728 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1894/1894 variables, and 728 constraints, problems are : Problem set: 0 solved, 22 unsolved in 4038 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 552/552 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 22 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 358/380 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/380 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 22 unsolved
SDD proceeding with computation,22 properties remain. new max is 524288
SDD size :3.23162e+06 after 1.96125e+07
At refinement iteration 3 (INCLUDED_ONLY) 0/380 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (OVERLAPS) 22/402 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/402 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (OVERLAPS) 7/409 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/409 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 8 (OVERLAPS) 120/529 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 22 unsolved
[2024-05-31 07:50:28] [INFO ] Deduced a trap composed of 44 places in 128 ms of which 2 ms to minimize.
[2024-05-31 07:50:28] [INFO ] Deduced a trap composed of 45 places in 152 ms of which 2 ms to minimize.
[2024-05-31 07:50:28] [INFO ] Deduced a trap composed of 44 places in 123 ms of which 1 ms to minimize.
[2024-05-31 07:50:28] [INFO ] Deduced a trap composed of 46 places in 81 ms of which 1 ms to minimize.
[2024-05-31 07:50:28] [INFO ] Deduced a trap composed of 44 places in 49 ms of which 1 ms to minimize.
[2024-05-31 07:50:28] [INFO ] Deduced a trap composed of 44 places in 33 ms of which 1 ms to minimize.
[2024-05-31 07:50:28] [INFO ] Deduced a trap composed of 44 places in 115 ms of which 1 ms to minimize.
[2024-05-31 07:50:28] [INFO ] Deduced a trap composed of 44 places in 71 ms of which 1 ms to minimize.
[2024-05-31 07:50:28] [INFO ] Deduced a trap composed of 45 places in 37 ms of which 1 ms to minimize.
[2024-05-31 07:50:29] [INFO ] Deduced a trap composed of 44 places in 53 ms of which 4 ms to minimize.
[2024-05-31 07:50:29] [INFO ] Deduced a trap composed of 230 places in 374 ms of which 3 ms to minimize.
[2024-05-31 07:50:29] [INFO ] Deduced a trap composed of 205 places in 295 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/529 variables, 12/52 constraints. Problems are: Problem set: 0 solved, 22 unsolved
[2024-05-31 07:50:31] [INFO ] Deduced a trap composed of 264 places in 352 ms of which 3 ms to minimize.
[2024-05-31 07:50:31] [INFO ] Deduced a trap composed of 248 places in 322 ms of which 3 ms to minimize.
[2024-05-31 07:50:32] [INFO ] Deduced a trap composed of 236 places in 349 ms of which 16 ms to minimize.
[2024-05-31 07:50:32] [INFO ] Deduced a trap composed of 232 places in 326 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/529 variables, 4/56 constraints. Problems are: Problem set: 0 solved, 22 unsolved
[2024-05-31 07:50:35] [INFO ] Deduced a trap composed of 214 places in 351 ms of which 4 ms to minimize.
[2024-05-31 07:50:35] [INFO ] Deduced a trap composed of 265 places in 316 ms of which 4 ms to minimize.
[2024-05-31 07:50:36] [INFO ] Deduced a trap composed of 255 places in 341 ms of which 3 ms to minimize.
[2024-05-31 07:50:36] [INFO ] Deduced a trap composed of 183 places in 276 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/529 variables, 4/60 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/529 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 13 (OVERLAPS) 11/540 variables, 5/65 constraints. Problems are: Problem set: 0 solved, 22 unsolved
[2024-05-31 07:50:39] [INFO ] Deduced a trap composed of 241 places in 402 ms of which 4 ms to minimize.
[2024-05-31 07:50:39] [INFO ] Deduced a trap composed of 285 places in 374 ms of which 4 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/540 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 22 unsolved
[2024-05-31 07:50:40] [INFO ] Deduced a trap composed of 96 places in 323 ms of which 3 ms to minimize.
[2024-05-31 07:50:40] [INFO ] Deduced a trap composed of 96 places in 313 ms of which 4 ms to minimize.
[2024-05-31 07:50:41] [INFO ] Deduced a trap composed of 96 places in 312 ms of which 3 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/540 variables, 3/70 constraints. Problems are: Problem set: 0 solved, 22 unsolved
[2024-05-31 07:50:42] [INFO ] Deduced a trap composed of 96 places in 309 ms of which 16 ms to minimize.
[2024-05-31 07:50:42] [INFO ] Deduced a trap composed of 96 places in 284 ms of which 4 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/540 variables, 2/72 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/540 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 18 (OVERLAPS) 10/550 variables, 10/82 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/550 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 20 (OVERLAPS) 1342/1892 variables, 550/632 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1892 variables, 120/752 constraints. Problems are: Problem set: 0 solved, 22 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1892/1894 variables, and 774 constraints, problems are : Problem set: 0 solved, 22 unsolved in 45035 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 550/552 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 27/27 constraints]
After SMT, in 49099ms problems are : Problem set: 0 solved, 22 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 22 out of 552 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 552/552 places, 1362/1362 transitions.
Applied a total of 0 rules in 77 ms. Remains 552 /552 variables (removed 0) and now considering 1362/1362 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77 ms. Remains : 552/552 places, 1362/1362 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 552/552 places, 1362/1362 transitions.
Applied a total of 0 rules in 56 ms. Remains 552 /552 variables (removed 0) and now considering 1362/1362 (removed 0) transitions.
[2024-05-31 07:50:52] [INFO ] Flow matrix only has 1342 transitions (discarded 20 similar events)
[2024-05-31 07:50:52] [INFO ] Invariant cache hit.
[2024-05-31 07:50:53] [INFO ] Implicit Places using invariants in 813 ms returned [66, 133, 165, 292, 338, 367, 370, 408, 519, 550]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 824 ms to find 10 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 542/552 places, 1362/1362 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 533 transition count 1353
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 533 transition count 1353
Applied a total of 18 rules in 93 ms. Remains 533 /542 variables (removed 9) and now considering 1353/1362 (removed 9) transitions.
[2024-05-31 07:50:53] [INFO ] Flow matrix only has 1333 transitions (discarded 20 similar events)
// Phase 1: matrix 1333 rows 533 cols
[2024-05-31 07:50:53] [INFO ] Computed 46 invariants in 53 ms
[2024-05-31 07:50:54] [INFO ] Implicit Places using invariants in 945 ms returned []
[2024-05-31 07:50:54] [INFO ] Flow matrix only has 1333 transitions (discarded 20 similar events)
[2024-05-31 07:50:54] [INFO ] Invariant cache hit.
[2024-05-31 07:50:55] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-31 07:51:08] [INFO ] Implicit Places using invariants and state equation in 14277 ms returned []
Implicit Place search using SMT with State Equation took 15227 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 533/552 places, 1353/1362 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 16201 ms. Remains : 533/552 places, 1353/1362 transitions.
RANDOM walk for 4000000 steps (1380 resets) in 67976 ms. (58 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400003 steps (60 resets) in 3797 ms. (105 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400001 steps (49 resets) in 4323 ms. (92 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400003 steps (48 resets) in 5389 ms. (74 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400003 steps (56 resets) in 4227 ms. (94 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400002 steps (47 resets) in 3600 ms. (111 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400004 steps (49 resets) in 3637 ms. (109 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400002 steps (43 resets) in 3511 ms. (113 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400003 steps (49 resets) in 4534 ms. (88 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400002 steps (44 resets) in 4917 ms. (81 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400003 steps (63 resets) in 3804 ms. (105 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400004 steps (43 resets) in 4529 ms. (88 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400002 steps (41 resets) in 4275 ms. (93 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400002 steps (60 resets) in 4441 ms. (90 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400002 steps (59 resets) in 4343 ms. (92 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400003 steps (51 resets) in 5008 ms. (79 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400002 steps (58 resets) in 3892 ms. (102 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400001 steps (58 resets) in 3282 ms. (121 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400002 steps (55 resets) in 3914 ms. (102 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400002 steps (46 resets) in 4195 ms. (95 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400002 steps (63 resets) in 3621 ms. (110 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400004 steps (55 resets) in 3438 ms. (116 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400003 steps (50 resets) in 4110 ms. (97 steps per ms) remains 22/22 properties
SDD proceeding with computation,22 properties remain. new max is 1048576
SDD size :1.96125e+07 after 4.67835e+07
Interrupted probabilistic random walk after 2663784 steps, run timeout after 150001 ms. (steps per millisecond=17 ) properties seen :0 out of 22
Probabilistic random walk after 2663784 steps, saw 1547521 distinct states, run finished after 150001 ms. (steps per millisecond=17 ) properties seen :0
[2024-05-31 07:54:29] [INFO ] Flow matrix only has 1333 transitions (discarded 20 similar events)
[2024-05-31 07:54:29] [INFO ] Invariant cache hit.
[2024-05-31 07:54:29] [INFO ] State equation strengthened by 120 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 286/308 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (OVERLAPS) 88/396 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/396 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (OVERLAPS) 10/406 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/406 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (OVERLAPS) 124/530 variables, 24/44 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/530 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 9 (OVERLAPS) 1/531 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/531 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 11 (OVERLAPS) 1333/1864 variables, 531/576 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1864 variables, 120/696 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1864 variables, 0/696 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 14 (OVERLAPS) 2/1866 variables, 2/698 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1866 variables, 1/699 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1866 variables, 0/699 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 17 (OVERLAPS) 0/1866 variables, 0/699 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1866/1866 variables, and 699 constraints, problems are : Problem set: 0 solved, 22 unsolved in 3355 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 533/533 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 22 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 286/308 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (OVERLAPS) 88/396 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/396 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (OVERLAPS) 10/406 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/406 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (OVERLAPS) 124/530 variables, 24/44 constraints. Problems are: Problem set: 0 solved, 22 unsolved
[2024-05-31 07:54:34] [INFO ] Deduced a trap composed of 44 places in 228 ms of which 2 ms to minimize.
[2024-05-31 07:54:34] [INFO ] Deduced a trap composed of 44 places in 132 ms of which 2 ms to minimize.
[2024-05-31 07:54:34] [INFO ] Deduced a trap composed of 44 places in 113 ms of which 2 ms to minimize.
[2024-05-31 07:54:34] [INFO ] Deduced a trap composed of 44 places in 106 ms of which 2 ms to minimize.
[2024-05-31 07:54:34] [INFO ] Deduced a trap composed of 44 places in 111 ms of which 9 ms to minimize.
[2024-05-31 07:54:34] [INFO ] Deduced a trap composed of 44 places in 83 ms of which 1 ms to minimize.
[2024-05-31 07:54:34] [INFO ] Deduced a trap composed of 44 places in 57 ms of which 1 ms to minimize.
[2024-05-31 07:54:34] [INFO ] Deduced a trap composed of 44 places in 63 ms of which 1 ms to minimize.
[2024-05-31 07:54:35] [INFO ] Deduced a trap composed of 45 places in 62 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/530 variables, 9/53 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/530 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 10 (OVERLAPS) 1/531 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 22 unsolved
[2024-05-31 07:54:35] [INFO ] Deduced a trap composed of 44 places in 62 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/531 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/531 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 13 (OVERLAPS) 1333/1864 variables, 531/586 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1864 variables, 120/706 constraints. Problems are: Problem set: 0 solved, 22 unsolved
Problem smplace_81 is UNSAT
FORMULA StableMarking TRUE TECHNIQUES RANDOM_WALK SMT_REFINEMENT TOPOLOGICAL
SMT process timed out in 17124ms, After SMT, problems are : Problem set: 0 solved, 22 unsolved
Fused 22 Parikh solutions to 20 different solutions.
Parikh walk visited 0 properties in 13630 ms.
Support contains 22 out of 533 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 533/533 places, 1353/1353 transitions.
Applied a total of 0 rules in 28 ms. Remains 533 /533 variables (removed 0) and now considering 1353/1353 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 533/533 places, 1353/1353 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 533/533 places, 1353/1353 transitions.
Applied a total of 0 rules in 27 ms. Remains 533 /533 variables (removed 0) and now considering 1353/1353 (removed 0) transitions.
[2024-05-31 07:54:59] [INFO ] Flow matrix only has 1333 transitions (discarded 20 similar events)
[2024-05-31 07:54:59] [INFO ] Invariant cache hit.
[2024-05-31 07:55:00] [INFO ] Implicit Places using invariants in 553 ms returned []
[2024-05-31 07:55:00] [INFO ] Flow matrix only has 1333 transitions (discarded 20 similar events)
[2024-05-31 07:55:00] [INFO ] Invariant cache hit.
[2024-05-31 07:55:01] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-31 07:55:15] [INFO ] Implicit Places using invariants and state equation in 14975 ms returned []
Implicit Place search using SMT with State Equation took 15537 ms to find 0 implicit places.
[2024-05-31 07:55:15] [INFO ] Redundant transitions in 165 ms returned []
Running 1351 sub problems to find dead transitions.
[2024-05-31 07:55:15] [INFO ] Flow matrix only has 1333 transitions (discarded 20 similar events)
[2024-05-31 07:55:15] [INFO ] Invariant cache hit.
[2024-05-31 07:55:15] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/531 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/531 variables, 27/44 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
[2024-05-31 07:55:28] [INFO ] Deduced a trap composed of 44 places in 284 ms of which 3 ms to minimize.
[2024-05-31 07:55:28] [INFO ] Deduced a trap composed of 79 places in 164 ms of which 2 ms to minimize.
[2024-05-31 07:55:29] [INFO ] Deduced a trap composed of 35 places in 201 ms of which 3 ms to minimize.
[2024-05-31 07:55:29] [INFO ] Deduced a trap composed of 44 places in 56 ms of which 1 ms to minimize.
[2024-05-31 07:55:29] [INFO ] Deduced a trap composed of 44 places in 745 ms of which 1 ms to minimize.
[2024-05-31 07:55:30] [INFO ] Deduced a trap composed of 45 places in 841 ms of which 1 ms to minimize.
[2024-05-31 07:55:30] [INFO ] Deduced a trap composed of 45 places in 56 ms of which 1 ms to minimize.
[2024-05-31 07:55:30] [INFO ] Deduced a trap composed of 45 places in 55 ms of which 1 ms to minimize.
[2024-05-31 07:55:31] [INFO ] Deduced a trap composed of 44 places in 43 ms of which 1 ms to minimize.
[2024-05-31 07:55:31] [INFO ] Deduced a trap composed of 44 places in 42 ms of which 1 ms to minimize.
[2024-05-31 07:55:31] [INFO ] Deduced a trap composed of 44 places in 42 ms of which 0 ms to minimize.
[2024-05-31 07:55:31] [INFO ] Deduced a trap composed of 45 places in 43 ms of which 1 ms to minimize.
[2024-05-31 07:55:31] [INFO ] Deduced a trap composed of 82 places in 249 ms of which 3 ms to minimize.
[2024-05-31 07:55:33] [INFO ] Deduced a trap composed of 186 places in 250 ms of which 4 ms to minimize.
[2024-05-31 07:55:36] [INFO ] Deduced a trap composed of 332 places in 239 ms of which 2 ms to minimize.
[2024-05-31 07:55:40] [INFO ] Deduced a trap composed of 178 places in 237 ms of which 3 ms to minimize.
[2024-05-31 07:55:41] [INFO ] Deduced a trap composed of 188 places in 253 ms of which 3 ms to minimize.
[2024-05-31 07:55:41] [INFO ] Deduced a trap composed of 243 places in 270 ms of which 3 ms to minimize.
[2024-05-31 07:55:41] [INFO ] Deduced a trap composed of 37 places in 129 ms of which 2 ms to minimize.
[2024-05-31 07:55:42] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/531 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
[2024-05-31 07:55:49] [INFO ] Deduced a trap composed of 200 places in 246 ms of which 3 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 531/1866 variables, and 65 constraints, problems are : Problem set: 0 solved, 1351 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/533 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1351/1351 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1351 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/531 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/531 variables, 27/44 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/531 variables, 21/65 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 531/1866 variables, and 65 constraints, problems are : Problem set: 0 solved, 1351 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/533 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1351 constraints, Known Traps: 21/21 constraints]
After SMT, in 63860ms problems are : Problem set: 0 solved, 1351 unsolved
Search for dead transitions found 0 dead transitions in 63894ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 79661 ms. Remains : 533/533 places, 1353/1353 transitions.
RANDOM walk for 400000 steps (141 resets) in 13000 ms. (30 steps per ms) remains 22/22 properties
Running SMT prover for 22 properties.
[2024-05-31 07:56:22] [INFO ] Flow matrix only has 1333 transitions (discarded 20 similar events)
[2024-05-31 07:56:23] [INFO ] Invariant cache hit.
[2024-05-31 07:56:23] [INFO ] [Real]Absence check using 17 positive place invariants in 4 ms returned sat
[2024-05-31 07:56:23] [INFO ] [Real]Absence check using 17 positive and 29 generalized place invariants in 30 ms returned sat
[2024-05-31 07:56:25] [INFO ] After 1873ms SMT Verify possible using state equation in real domain returned unsat :2 sat :20
[2024-05-31 07:56:25] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-31 07:56:25] [INFO ] After 816ms SMT Verify possible using 120 Read/Feed constraints in real domain returned unsat :2 sat :20
TRAPS : Iteration 0
[2024-05-31 07:56:27] [INFO ] After 2407ms SMT Verify possible using trap constraints in real domain returned unsat :2 sat :0 real:20
[2024-05-31 07:56:27] [INFO ] After 4408ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:20
[2024-05-31 07:56:27] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2024-05-31 07:56:27] [INFO ] [Nat]Absence check using 17 positive and 29 generalized place invariants in 82 ms returned sat
Detected timeout of ITS tools.
[2024-05-31 07:57:10] [INFO ] After 42471ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :19
[2024-05-31 07:57:14] [INFO ] After 3846ms SMT Verify possible using 120 Read/Feed constraints in natural domain returned unsat :2 sat :19
TRAPS : Iteration 0
[2024-05-31 07:57:21] [INFO ] Deduced a trap composed of 23 places in 346 ms of which 5 ms to minimize.
[2024-05-31 07:57:21] [INFO ] Deduced a trap composed of 205 places in 324 ms of which 3 ms to minimize.
[2024-05-31 07:57:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1307 ms
[2024-05-31 07:57:22] [INFO ] Deduced a trap composed of 45 places in 41 ms of which 1 ms to minimize.
[2024-05-31 07:57:23] [INFO ] Deduced a trap composed of 45 places in 66 ms of which 1 ms to minimize.
[2024-05-31 07:57:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1054 ms
[2024-05-31 07:57:24] [INFO ] Deduced a trap composed of 204 places in 386 ms of which 4 ms to minimize.
[2024-05-31 07:57:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 484 ms
TRAPS : Iteration 1
[2024-05-31 07:57:39] [INFO ] After 29379ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :19
[2024-05-31 07:57:42] [INFO ] After 75340ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :19
Successfully simplified 2 atomic propositions for a total of 2 simplifications.
FORMULA StableMarking TRUE TECHNIQUES RANDOM_WALK SMT_REFINEMENT TOPOLOGICAL INITIAL_STATE
Total runtime 636378 ms.

BK_STOP 1717142262833

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ StableMarking = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution StableMarking -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination StableMarking -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is PolyORBLF-PT-S02J06T10, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r299-tajo-171654455700163"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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