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-171654455700153.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-S02J06T06, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r299-tajo-171654455700153
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 22K Apr 11 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 124K Apr 11 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 17K Apr 11 16:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 101K Apr 11 16:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 9.9K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 41K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 46K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 24K Apr 11 17:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 113K Apr 11 17:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 43K Apr 11 17:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 216K Apr 11 17:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.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 601K 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 1717141576911

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-S02J06T06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
StableMarking PT
Running Version 202405141337
[2024-05-31 07:46:18] [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:46:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 07:46:18] [INFO ] Load time of PNML (sax parser for PT used): 162 ms
[2024-05-31 07:46:18] [INFO ] Transformed 536 places.
[2024-05-31 07:46:18] [INFO ] Transformed 1064 transitions.
[2024-05-31 07:46:18] [INFO ] Parsed PT model containing 536 places and 1064 transitions and 4866 arcs in 326 ms.
Ensure Unique test removed 96 transitions
Reduce redundant transitions removed 96 transitions.
[2024-05-31 07:46:19] [INFO ] Flatten gal took : 290 ms
RANDOM walk for 40000 steps (13 resets) in 2593 ms. (15 steps per ms) remains 14/536 properties
[2024-05-31 07:46:19] [INFO ] Flatten gal took : 103 ms
[2024-05-31 07:46:19] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10355160015051697724.gal : 86 ms
[2024-05-31 07:46:19] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality454779810092821390.prop : 3 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/ReachabilityCardinality10355160015051697724.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality454779810092821390.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40002 steps (11 resets) in 522 ms. (76 steps per ms) remains 14/14 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 ...328
BEST_FIRST walk for 40003 steps (9 resets) in 374 ms. (106 steps per ms) remains 14/14 properties
Loading property file /tmp/ReachabilityCardinality454779810092821390.prop.
BEST_FIRST walk for 40004 steps (10 resets) in 253 ms. (157 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (12 resets) in 269 ms. (148 steps per ms) remains 14/14 properties
SDD proceeding with computation,14 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,14 properties remain. new max is 8
SDD size :4 after 7
SDD proceeding with computation,14 properties remain. new max is 16
SDD size :7 after 11
SDD proceeding with computation,14 properties remain. new max is 32
SDD size :11 after 23
BEST_FIRST walk for 40003 steps (12 resets) in 299 ms. (133 steps per ms) remains 14/14 properties
SDD proceeding with computation,14 properties remain. new max is 64
SDD size :23 after 53
BEST_FIRST walk for 40003 steps (11 resets) in 316 ms. (126 steps per ms) remains 14/14 properties
SDD proceeding with computation,14 properties remain. new max is 128
SDD size :53 after 74
BEST_FIRST walk for 40001 steps (12 resets) in 229 ms. (173 steps per ms) remains 14/14 properties
SDD proceeding with computation,14 properties remain. new max is 256
SDD size :74 after 83
BEST_FIRST walk for 40002 steps (13 resets) in 267 ms. (149 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (9 resets) in 248 ms. (160 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (9 resets) in 265 ms. (150 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (11 resets) in 260 ms. (153 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40001 steps (12 resets) in 167 ms. (238 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (9 resets) in 217 ms. (183 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (12 resets) in 212 ms. (187 steps per ms) remains 14/14 properties
[2024-05-31 07:46:20] [INFO ] Flow matrix only has 956 transitions (discarded 12 similar events)
// Phase 1: matrix 956 rows 536 cols
[2024-05-31 07:46:20] [INFO ] Computed 50 invariants in 52 ms
[2024-05-31 07:46:21] [INFO ] State equation strengthened by 72 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 36/50 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 350/400 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/400 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 63/463 variables, 15/24 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/463 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 70/533 variables, 24/48 constraints. Problems are: Problem set: 0 solved, 14 unsolved
SDD proceeding with computation,14 properties remain. new max is 512
SDD size :83 after 701
At refinement iteration 8 (INCLUDED_ONLY) 0/533 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (OVERLAPS) 1/534 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/534 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 14 unsolved
SDD proceeding with computation,14 properties remain. new max is 1024
SDD size :701 after 785
SDD proceeding with computation,14 properties remain. new max is 2048
SDD size :785 after 1469
At refinement iteration 11 (OVERLAPS) 956/1490 variables, 534/583 constraints. Problems are: Problem set: 0 solved, 14 unsolved
SDD proceeding with computation,14 properties remain. new max is 4096
SDD size :1469 after 1791
At refinement iteration 12 (INCLUDED_ONLY) 0/1490 variables, 72/655 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1490 variables, 0/655 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 14 (OVERLAPS) 2/1492 variables, 2/657 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1492 variables, 1/658 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1492 variables, 0/658 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 17 (OVERLAPS) 0/1492 variables, 0/658 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1492/1492 variables, and 658 constraints, problems are : Problem set: 0 solved, 14 unsolved in 2475 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 536/536 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 36/50 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 14 unsolved
SDD proceeding with computation,14 properties remain. new max is 8192
SDD size :1791 after 3575
At refinement iteration 3 (OVERLAPS) 350/400 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/400 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 63/463 variables, 15/24 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-05-31 07:46:24] [INFO ] Deduced a trap composed of 142 places in 220 ms of which 32 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/463 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/463 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (OVERLAPS) 70/533 variables, 24/49 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-05-31 07:46:24] [INFO ] Deduced a trap composed of 74 places in 105 ms of which 3 ms to minimize.
[2024-05-31 07:46:26] [INFO ] Deduced a trap composed of 74 places in 1859 ms of which 2 ms to minimize.
[2024-05-31 07:46:26] [INFO ] Deduced a trap composed of 73 places in 64 ms of which 1 ms to minimize.
[2024-05-31 07:46:26] [INFO ] Deduced a trap composed of 74 places in 75 ms of which 1 ms to minimize.
[2024-05-31 07:46:26] [INFO ] Deduced a trap composed of 74 places in 54 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/533 variables, 5/54 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-05-31 07:46:27] [INFO ] Deduced a trap composed of 284 places in 323 ms of which 3 ms to minimize.
[2024-05-31 07:46:27] [INFO ] Deduced a trap composed of 239 places in 229 ms of which 3 ms to minimize.
[2024-05-31 07:46:28] [INFO ] Deduced a trap composed of 78 places in 256 ms of which 3 ms to minimize.
[2024-05-31 07:46:28] [INFO ] Deduced a trap composed of 252 places in 259 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 533/1492 variables, and 58 constraints, problems are : Problem set: 0 solved, 14 unsolved in 5012 ms.
Refiners :[Positive P Invariants (semi-flows): 17/19 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 0/536 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/14 constraints, Known Traps: 10/10 constraints]
After SMT, in 7599ms problems are : Problem set: 0 solved, 14 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 14 out of 536 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 536/536 places, 968/968 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 56 rules applied. Total rules applied 56 place count 534 transition count 914
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 110 place count 480 transition count 914
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 60 Pre rules applied. Total rules applied 110 place count 480 transition count 854
Deduced a syphon composed of 60 places in 9 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 230 place count 420 transition count 854
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 326 place count 372 transition count 806
Free-agglomeration rule (complex) applied 12 times.
Iterating global reduction 2 with 12 rules applied. Total rules applied 338 place count 372 transition count 794
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 350 place count 360 transition count 794
Applied a total of 350 rules in 331 ms. Remains 360 /536 variables (removed 176) and now considering 794/968 (removed 174) transitions.
Running 792 sub problems to find dead transitions.
[2024-05-31 07:46:28] [INFO ] Flow matrix only has 782 transitions (discarded 12 similar events)
// Phase 1: matrix 782 rows 360 cols
[2024-05-31 07:46:28] [INFO ] Computed 48 invariants in 23 ms
[2024-05-31 07:46:28] [INFO ] State equation strengthened by 72 read => feed constraints.
SDD proceeding with computation,14 properties remain. new max is 16384
SDD size :3575 after 15532
At refinement iteration 0 (INCLUDED_ONLY) 0/358 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 792 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/358 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 792 unsolved
[2024-05-31 07:46:35] [INFO ] Deduced a trap composed of 25 places in 169 ms of which 2 ms to minimize.
[2024-05-31 07:46:35] [INFO ] Deduced a trap composed of 45 places in 60 ms of which 2 ms to minimize.
[2024-05-31 07:46:35] [INFO ] Deduced a trap composed of 44 places in 54 ms of which 2 ms to minimize.
[2024-05-31 07:46:35] [INFO ] Deduced a trap composed of 45 places in 33 ms of which 1 ms to minimize.
[2024-05-31 07:46:35] [INFO ] Deduced a trap composed of 45 places in 31 ms of which 1 ms to minimize.
[2024-05-31 07:46:35] [INFO ] Deduced a trap composed of 45 places in 30 ms of which 0 ms to minimize.
[2024-05-31 07:46:35] [INFO ] Deduced a trap composed of 44 places in 32 ms of which 0 ms to minimize.
[2024-05-31 07:46:35] [INFO ] Deduced a trap composed of 114 places in 151 ms of which 2 ms to minimize.
[2024-05-31 07:46:36] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 2 ms to minimize.
[2024-05-31 07:46:36] [INFO ] Deduced a trap composed of 50 places in 123 ms of which 2 ms to minimize.
[2024-05-31 07:46:39] [INFO ] Deduced a trap composed of 105 places in 159 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/358 variables, 11/51 constraints. Problems are: Problem set: 0 solved, 792 unsolved
SDD proceeding with computation,14 properties remain. new max is 32768
SDD size :15532 after 49641
[2024-05-31 07:46:43] [INFO ] Deduced a trap composed of 132 places in 165 ms of which 3 ms to minimize.
[2024-05-31 07:46:44] [INFO ] Deduced a trap composed of 144 places in 147 ms of which 3 ms to minimize.
[2024-05-31 07:46:44] [INFO ] Deduced a trap composed of 120 places in 151 ms of which 3 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 3 (INCLUDED_ONLY) 0/358 variables, 3/54 constraints. Problems are: Problem set: 0 solved, 792 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 358/1142 variables, and 54 constraints, problems are : Problem set: 0 solved, 792 unsolved in 20037 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 27/35 constraints, State Equation: 0/360 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 792/792 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 792 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/358 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 792 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/358 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 792 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/358 variables, 14/54 constraints. Problems are: Problem set: 0 solved, 792 unsolved
[2024-05-31 07:46:53] [INFO ] Deduced a trap composed of 3 places in 93 ms of which 1 ms to minimize.
[2024-05-31 07:46:53] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-05-31 07:46:53] [INFO ] Deduced a trap composed of 154 places in 139 ms of which 3 ms to minimize.
[2024-05-31 07:46:53] [INFO ] Deduced a trap composed of 174 places in 156 ms of which 2 ms to minimize.
SDD proceeding with computation,14 properties remain. new max is 65536
[2024-05-31 07:46:54] [INFO ] Deduced a trap composed of 204 places in 238 ms of which 2 ms to minimize.
SDD size :49641 after 288686
[2024-05-31 07:46:55] [INFO ] Deduced a trap composed of 2 places in 76 ms of which 1 ms to minimize.
[2024-05-31 07:46:55] [INFO ] Deduced a trap composed of 108 places in 160 ms of which 2 ms to minimize.
[2024-05-31 07:46:56] [INFO ] Deduced a trap composed of 194 places in 151 ms of which 2 ms to minimize.
[2024-05-31 07:46:56] [INFO ] Deduced a trap composed of 194 places in 146 ms of which 2 ms to minimize.
[2024-05-31 07:46:56] [INFO ] Deduced a trap composed of 200 places in 152 ms of which 3 ms to minimize.
[2024-05-31 07:46:57] [INFO ] Deduced a trap composed of 197 places in 154 ms of which 6 ms to minimize.
[2024-05-31 07:46:57] [INFO ] Deduced a trap composed of 190 places in 159 ms of which 2 ms to minimize.
[2024-05-31 07:46:57] [INFO ] Deduced a trap composed of 180 places in 161 ms of which 3 ms to minimize.
[2024-05-31 07:46:57] [INFO ] Deduced a trap composed of 179 places in 165 ms of which 2 ms to minimize.
[2024-05-31 07:46:57] [INFO ] Deduced a trap composed of 187 places in 157 ms of which 2 ms to minimize.
[2024-05-31 07:46:58] [INFO ] Deduced a trap composed of 204 places in 139 ms of which 3 ms to minimize.
[2024-05-31 07:46:59] [INFO ] Deduced a trap composed of 201 places in 137 ms of which 3 ms to minimize.
[2024-05-31 07:46:59] [INFO ] Deduced a trap composed of 212 places in 139 ms of which 2 ms to minimize.
[2024-05-31 07:47:00] [INFO ] Deduced a trap composed of 201 places in 153 ms of which 2 ms to minimize.
[2024-05-31 07:47:01] [INFO ] Deduced a trap composed of 200 places in 153 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/358 variables, 20/74 constraints. Problems are: Problem set: 0 solved, 792 unsolved
[2024-05-31 07:47:05] [INFO ] Deduced a trap composed of 213 places in 286 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 358/1142 variables, and 75 constraints, problems are : Problem set: 0 solved, 792 unsolved in 20044 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 27/35 constraints, State Equation: 0/360 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/792 constraints, Known Traps: 35/35 constraints]
After SMT, in 41656ms problems are : Problem set: 0 solved, 792 unsolved
Search for dead transitions found 0 dead transitions in 41688ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42058 ms. Remains : 360/536 places, 794/968 transitions.
RANDOM walk for 4000000 steps (2313 resets) in 37209 ms. (107 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000003 steps (912 resets) in 15213 ms. (262 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000001 steps (956 resets) in 14552 ms. (274 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000003 steps (960 resets) in 15069 ms. (265 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000001 steps (893 resets) in 14928 ms. (267 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000003 steps (890 resets) in 15383 ms. (260 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000002 steps (938 resets) in 15117 ms. (264 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000004 steps (974 resets) in 14441 ms. (276 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000003 steps (886 resets) in 15050 ms. (265 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000002 steps (954 resets) in 14738 ms. (271 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000004 steps (1005 resets) in 17608 ms. (227 steps per ms) remains 14/14 properties
BEST_FIRST walk for 3590257 steps (883 resets) in 18538 ms. (193 steps per ms) remains 14/14 properties
SDD proceeding with computation,14 properties remain. new max is 131072
SDD size :288686 after 600633
BEST_FIRST walk for 3819659 steps (886 resets) in 18544 ms. (205 steps per ms) remains 14/14 properties
BEST_FIRST walk for 3765825 steps (892 resets) in 18705 ms. (201 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000003 steps (913 resets) in 14237 ms. (280 steps per ms) remains 14/14 properties
SDD proceeding with computation,14 properties remain. new max is 262144
SDD size :600633 after 2.10632e+06
Interrupted probabilistic random walk after 7169372 steps, run timeout after 210001 ms. (steps per millisecond=34 ) properties seen :0 out of 14
Probabilistic random walk after 7169372 steps, saw 3267750 distinct states, run finished after 210021 ms. (steps per millisecond=34 ) properties seen :0
[2024-05-31 07:51:51] [INFO ] Flow matrix only has 782 transitions (discarded 12 similar events)
[2024-05-31 07:51:51] [INFO ] Invariant cache hit.
[2024-05-31 07:51:51] [INFO ] State equation strengthened by 72 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 171/185 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/185 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 34/219 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/219 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 2/221 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/221 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 132/353 variables, 30/42 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/353 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (OVERLAPS) 5/358 variables, 5/47 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/358 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 11 (OVERLAPS) 782/1140 variables, 358/405 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1140 variables, 72/477 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1140 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 14 (OVERLAPS) 2/1142 variables, 2/479 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1142 variables, 1/480 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1142 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 17 (OVERLAPS) 0/1142 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1142/1142 variables, and 480 constraints, problems are : Problem set: 0 solved, 14 unsolved in 1913 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 35/35 constraints, State Equation: 360/360 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 171/185 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/185 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 34/219 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/219 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 2/221 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/221 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 132/353 variables, 30/42 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-05-31 07:51:54] [INFO ] Deduced a trap composed of 45 places in 363 ms of which 3 ms to minimize.
[2024-05-31 07:51:55] [INFO ] Deduced a trap composed of 45 places in 351 ms of which 2 ms to minimize.
[2024-05-31 07:51:55] [INFO ] Deduced a trap composed of 44 places in 230 ms of which 2 ms to minimize.
[2024-05-31 07:51:55] [INFO ] Deduced a trap composed of 44 places in 163 ms of which 2 ms to minimize.
[2024-05-31 07:51:55] [INFO ] Deduced a trap composed of 185 places in 179 ms of which 2 ms to minimize.
[2024-05-31 07:51:56] [INFO ] Deduced a trap composed of 44 places in 218 ms of which 3 ms to minimize.
[2024-05-31 07:51:56] [INFO ] Deduced a trap composed of 145 places in 235 ms of which 2 ms to minimize.
[2024-05-31 07:51:56] [INFO ] Deduced a trap composed of 138 places in 174 ms of which 2 ms to minimize.
[2024-05-31 07:51:56] [INFO ] Deduced a trap composed of 44 places in 206 ms of which 3 ms to minimize.
[2024-05-31 07:51:57] [INFO ] Deduced a trap composed of 118 places in 226 ms of which 2 ms to minimize.
[2024-05-31 07:51:57] [INFO ] Deduced a trap composed of 150 places in 191 ms of which 10 ms to minimize.
[2024-05-31 07:51:57] [INFO ] Deduced a trap composed of 158 places in 335 ms of which 2 ms to minimize.
[2024-05-31 07:51:58] [INFO ] Deduced a trap composed of 167 places in 383 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/353 variables, 13/55 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/353 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (OVERLAPS) 5/358 variables, 5/60 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/358 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 12 (OVERLAPS) 782/1140 variables, 358/418 constraints. Problems are: Problem set: 0 solved, 14 unsolved
SDD proceeding with computation,14 properties remain. new max is 524288
SDD size :2.10632e+06 after 3.82168e+06
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1140/1142 variables, and 490 constraints, problems are : Problem set: 0 solved, 14 unsolved in 45012 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 35/35 constraints, State Equation: 358/360 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 0/14 constraints, Known Traps: 13/13 constraints]
After SMT, in 46966ms problems are : Problem set: 0 solved, 14 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 14 out of 360 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 360/360 places, 794/794 transitions.
Applied a total of 0 rules in 59 ms. Remains 360 /360 variables (removed 0) and now considering 794/794 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60 ms. Remains : 360/360 places, 794/794 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 360/360 places, 794/794 transitions.
Applied a total of 0 rules in 31 ms. Remains 360 /360 variables (removed 0) and now considering 794/794 (removed 0) transitions.
[2024-05-31 07:52:38] [INFO ] Flow matrix only has 782 transitions (discarded 12 similar events)
[2024-05-31 07:52:38] [INFO ] Invariant cache hit.
[2024-05-31 07:52:39] [INFO ] Implicit Places using invariants in 491 ms returned [71, 78, 159, 169, 204, 337]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 499 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 354/360 places, 794/794 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 351 transition count 791
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 351 transition count 791
Applied a total of 6 rules in 37 ms. Remains 351 /354 variables (removed 3) and now considering 791/794 (removed 3) transitions.
[2024-05-31 07:52:39] [INFO ] Flow matrix only has 779 transitions (discarded 12 similar events)
// Phase 1: matrix 779 rows 351 cols
[2024-05-31 07:52:39] [INFO ] Computed 42 invariants in 14 ms
[2024-05-31 07:52:39] [INFO ] Implicit Places using invariants in 384 ms returned []
[2024-05-31 07:52:39] [INFO ] Flow matrix only has 779 transitions (discarded 12 similar events)
[2024-05-31 07:52:39] [INFO ] Invariant cache hit.
[2024-05-31 07:52:40] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-31 07:52:43] [INFO ] Implicit Places using invariants and state equation in 4236 ms returned []
Implicit Place search using SMT with State Equation took 4624 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 351/360 places, 791/794 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 5192 ms. Remains : 351/360 places, 791/794 transitions.
RANDOM walk for 4000000 steps (2333 resets) in 30494 ms. (131 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000001 steps (929 resets) in 14398 ms. (277 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000003 steps (1001 resets) in 14930 ms. (267 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000001 steps (937 resets) in 14271 ms. (280 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000003 steps (955 resets) in 14295 ms. (279 steps per ms) remains 14/14 properties
BEST_FIRST walk for 3834868 steps (845 resets) in 18997 ms. (201 steps per ms) remains 14/14 properties
BEST_FIRST walk for 3914703 steps (896 resets) in 18723 ms. (209 steps per ms) remains 14/14 properties
BEST_FIRST walk for 3793626 steps (897 resets) in 18789 ms. (201 steps per ms) remains 14/14 properties
BEST_FIRST walk for 3907227 steps (941 resets) in 19755 ms. (197 steps per ms) remains 14/14 properties
BEST_FIRST walk for 3772277 steps (914 resets) in 18862 ms. (199 steps per ms) remains 14/14 properties
BEST_FIRST walk for 3489296 steps (774 resets) in 17970 ms. (194 steps per ms) remains 14/14 properties
BEST_FIRST walk for 3915525 steps (972 resets) in 18899 ms. (207 steps per ms) remains 14/14 properties
BEST_FIRST walk for 3745960 steps (846 resets) in 19109 ms. (196 steps per ms) remains 14/14 properties
BEST_FIRST walk for 3783743 steps (887 resets) in 18751 ms. (201 steps per ms) remains 14/14 properties
BEST_FIRST walk for 3910434 steps (902 resets) in 18336 ms. (213 steps per ms) remains 14/14 properties
Detected timeout of ITS tools.
[2024-05-31 07:56:20] [INFO ] Flatten gal took : 75 ms
[2024-05-31 07:56:20] [INFO ] Applying decomposition
[2024-05-31 07:56:20] [INFO ] Flatten gal took : 74 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph5852533015149696863.txt' '-o' '/tmp/graph5852533015149696863.bin' '-w' '/tmp/graph5852533015149696863.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5852533015149696863.bin' '-l' '-1' '-v' '-w' '/tmp/graph5852533015149696863.weights' '-q' '0' '-e' '0.001'
[2024-05-31 07:56:20] [INFO ] Decomposing Gal with order
[2024-05-31 07:56:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 07:56:20] [INFO ] Removed a total of 713 redundant transitions.
[2024-05-31 07:56:20] [INFO ] Flatten gal took : 246 ms
[2024-05-31 07:56:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 216 labels/synchronizations in 57 ms.
[2024-05-31 07:56:20] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9879480980889672617.gal : 26 ms
[2024-05-31 07:56:20] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2608792321411366805.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/ReachabilityCardinality9879480980889672617.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2608792321411366805.prop' '--nowitness'

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 ...307
Loading property file /tmp/ReachabilityCardinality2608792321411366805.prop.
SDD proceeding with computation,14 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,14 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,14 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,14 properties remain. new max is 32
SDD size :1 after 1
SDD proceeding with computation,14 properties remain. new max is 64
SDD size :1 after 1
SDD proceeding with computation,14 properties remain. new max is 128
SDD size :1 after 1
SDD proceeding with computation,14 properties remain. new max is 256
SDD size :1 after 1
SDD proceeding with computation,14 properties remain. new max is 512
SDD size :1 after 5
SDD proceeding with computation,14 properties remain. new max is 1024
SDD size :5 after 15
SDD proceeding with computation,14 properties remain. new max is 2048
SDD size :15 after 18
SDD proceeding with computation,14 properties remain. new max is 4096
SDD size :18 after 77
SDD proceeding with computation,14 properties remain. new max is 8192
SDD size :77 after 475
SDD proceeding with computation,14 properties remain. new max is 16384
SDD size :475 after 475
SDD proceeding with computation,14 properties remain. new max is 32768
SDD size :475 after 3597
SDD proceeding with computation,14 properties remain. new max is 65536
SDD size :3597 after 28111
SDD proceeding with computation,14 properties remain. new max is 131072
SDD size :28111 after 351285
SDD proceeding with computation,14 properties remain. new max is 262144
SDD size :351285 after 1.85592e+06
Interrupted probabilistic random walk after 9610073 steps, run timeout after 222001 ms. (steps per millisecond=43 ) properties seen :0 out of 14
Probabilistic random walk after 9610073 steps, saw 4066558 distinct states, run finished after 222001 ms. (steps per millisecond=43 ) properties seen :0
[2024-05-31 07:57:40] [INFO ] Flow matrix only has 779 transitions (discarded 12 similar events)
[2024-05-31 07:57:40] [INFO ] Invariant cache hit.
[2024-05-31 07:57:40] [INFO ] State equation strengthened by 72 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 212/226 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/226 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 30/256 variables, 12/17 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/256 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 90/346 variables, 21/38 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/346 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 2/348 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/348 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (OVERLAPS) 1/349 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/349 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 11 (OVERLAPS) 779/1128 variables, 349/390 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1128 variables, 72/462 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1128 variables, 0/462 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 14 (OVERLAPS) 2/1130 variables, 2/464 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1130 variables, 1/465 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1130 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 17 (OVERLAPS) 0/1130 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1130/1130 variables, and 465 constraints, problems are : Problem set: 0 solved, 14 unsolved in 1371 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 351/351 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 212/226 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/226 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 30/256 variables, 12/17 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/256 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 90/346 variables, 21/38 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-05-31 07:57:42] [INFO ] Deduced a trap composed of 45 places in 110 ms of which 2 ms to minimize.
[2024-05-31 07:57:42] [INFO ] Deduced a trap composed of 44 places in 65 ms of which 2 ms to minimize.
[2024-05-31 07:57:42] [INFO ] Deduced a trap composed of 44 places in 59 ms of which 2 ms to minimize.
[2024-05-31 07:57:42] [INFO ] Deduced a trap composed of 45 places in 49 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/346 variables, 4/42 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/346 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (OVERLAPS) 2/348 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/348 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (OVERLAPS) 1/349 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/349 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 12 (OVERLAPS) 779/1128 variables, 349/394 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1128 variables, 72/466 constraints. Problems are: Problem set: 0 solved, 14 unsolved
Problem smplace_362 is UNSAT
FORMULA StableMarking TRUE TECHNIQUES RANDOM_WALK SMT_REFINEMENT TOPOLOGICAL
SMT process timed out in 19501ms, After SMT, problems are : Problem set: 0 solved, 14 unsolved
Fused 14 Parikh solutions to 12 different solutions.
SDD proceeding with computation,14 properties remain. new max is 524288
SDD size :1.85592e+06 after 7.66132e+06
Parikh walk visited 0 properties in 67037 ms.
Support contains 14 out of 351 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 791/791 transitions.
Applied a total of 0 rules in 18 ms. Remains 351 /351 variables (removed 0) and now considering 791/791 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 351/351 places, 791/791 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 791/791 transitions.
Applied a total of 0 rules in 20 ms. Remains 351 /351 variables (removed 0) and now considering 791/791 (removed 0) transitions.
[2024-05-31 07:59:07] [INFO ] Flow matrix only has 779 transitions (discarded 12 similar events)
[2024-05-31 07:59:07] [INFO ] Invariant cache hit.
[2024-05-31 07:59:07] [INFO ] Implicit Places using invariants in 361 ms returned []
[2024-05-31 07:59:07] [INFO ] Flow matrix only has 779 transitions (discarded 12 similar events)
[2024-05-31 07:59:07] [INFO ] Invariant cache hit.
[2024-05-31 07:59:08] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-31 07:59:11] [INFO ] Implicit Places using invariants and state equation in 3903 ms returned []
Implicit Place search using SMT with State Equation took 4266 ms to find 0 implicit places.
[2024-05-31 07:59:11] [INFO ] Redundant transitions in 46 ms returned []
Running 789 sub problems to find dead transitions.
[2024-05-31 07:59:11] [INFO ] Flow matrix only has 779 transitions (discarded 12 similar events)
[2024-05-31 07:59:11] [INFO ] Invariant cache hit.
[2024-05-31 07:59:11] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/349 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 789 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/349 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 789 unsolved
[2024-05-31 07:59:16] [INFO ] Deduced a trap composed of 45 places in 61 ms of which 2 ms to minimize.
[2024-05-31 07:59:16] [INFO ] Deduced a trap composed of 45 places in 46 ms of which 0 ms to minimize.
[2024-05-31 07:59:16] [INFO ] Deduced a trap composed of 44 places in 46 ms of which 1 ms to minimize.
[2024-05-31 07:59:16] [INFO ] Deduced a trap composed of 44 places in 34 ms of which 1 ms to minimize.
[2024-05-31 07:59:17] [INFO ] Deduced a trap composed of 45 places in 31 ms of which 1 ms to minimize.
[2024-05-31 07:59:17] [INFO ] Deduced a trap composed of 44 places in 137 ms of which 2 ms to minimize.
[2024-05-31 07:59:17] [INFO ] Deduced a trap composed of 114 places in 241 ms of which 3 ms to minimize.
[2024-05-31 07:59:18] [INFO ] Deduced a trap composed of 15 places in 198 ms of which 2 ms to minimize.
[2024-05-31 07:59:19] [INFO ] Deduced a trap composed of 37 places in 265 ms of which 2 ms to minimize.
[2024-05-31 07:59:19] [INFO ] Deduced a trap composed of 52 places in 256 ms of which 2 ms to minimize.
[2024-05-31 07:59:21] [INFO ] Deduced a trap composed of 212 places in 233 ms of which 2 ms to minimize.
[2024-05-31 07:59:22] [INFO ] Deduced a trap composed of 144 places in 208 ms of which 2 ms to minimize.
[2024-05-31 07:59:22] [INFO ] Deduced a trap composed of 133 places in 211 ms of which 2 ms to minimize.
[2024-05-31 07:59:23] [INFO ] Deduced a trap composed of 146 places in 206 ms of which 2 ms to minimize.
[2024-05-31 07:59:23] [INFO ] Deduced a trap composed of 129 places in 217 ms of which 2 ms to minimize.
[2024-05-31 07:59:24] [INFO ] Deduced a trap composed of 116 places in 202 ms of which 2 ms to minimize.
[2024-05-31 07:59:24] [INFO ] Deduced a trap composed of 133 places in 154 ms of which 2 ms to minimize.
[2024-05-31 07:59:24] [INFO ] Deduced a trap composed of 135 places in 157 ms of which 2 ms to minimize.
[2024-05-31 07:59:26] [INFO ] Deduced a trap composed of 125 places in 209 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/349 variables, 19/59 constraints. Problems are: Problem set: 0 solved, 789 unsolved
[2024-05-31 07:59:26] [INFO ] Deduced a trap composed of 25 places in 117 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/349 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 789 unsolved
[2024-05-31 07:59:39] [INFO ] Deduced a trap composed of 134 places in 139 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/349 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 789 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 349/1130 variables, and 61 constraints, problems are : Problem set: 0 solved, 789 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/351 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 789/789 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 789 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/349 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 789 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/349 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 789 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/349 variables, 21/61 constraints. Problems are: Problem set: 0 solved, 789 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/349 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 789 unsolved
Problem TDEAD684 is UNSAT
Problem TDEAD687 is UNSAT
Problem TDEAD688 is UNSAT
Problem TDEAD689 is UNSAT
Problem TDEAD690 is UNSAT
Problem TDEAD691 is UNSAT
Problem TDEAD692 is UNSAT
Problem TDEAD693 is UNSAT
Problem TDEAD694 is UNSAT
Problem TDEAD695 is UNSAT
Problem TDEAD696 is UNSAT
Problem TDEAD703 is UNSAT
Problem TDEAD704 is UNSAT
Problem TDEAD705 is UNSAT
Problem TDEAD706 is UNSAT
Problem TDEAD708 is UNSAT
Problem TDEAD709 is UNSAT
Problem TDEAD710 is UNSAT
Problem TDEAD711 is UNSAT
Problem TDEAD712 is UNSAT
Problem TDEAD713 is UNSAT
Problem TDEAD714 is UNSAT
Problem TDEAD719 is UNSAT
Problem TDEAD721 is UNSAT
Problem TDEAD722 is UNSAT
Problem TDEAD723 is UNSAT
Problem TDEAD724 is UNSAT
Problem TDEAD725 is UNSAT
Problem TDEAD726 is UNSAT
Problem TDEAD727 is UNSAT
Problem TDEAD729 is UNSAT
Problem TDEAD731 is UNSAT
Problem TDEAD732 is UNSAT
Problem TDEAD733 is UNSAT
Problem TDEAD734 is UNSAT
Problem TDEAD735 is UNSAT
Problem TDEAD736 is UNSAT
Problem TDEAD737 is UNSAT
Problem TDEAD739 is UNSAT
Problem TDEAD740 is UNSAT
Problem TDEAD741 is UNSAT
Problem TDEAD742 is UNSAT
Problem TDEAD744 is UNSAT
Problem TDEAD746 is UNSAT
Problem TDEAD759 is UNSAT
Problem TDEAD760 is UNSAT
Problem TDEAD762 is UNSAT
Problem TDEAD763 is UNSAT
Problem TDEAD765 is UNSAT
Problem TDEAD766 is UNSAT
Problem TDEAD767 is UNSAT
Problem TDEAD769 is UNSAT
Problem TDEAD770 is UNSAT
Problem TDEAD771 is UNSAT
Problem TDEAD772 is UNSAT
Problem TDEAD773 is UNSAT
Problem TDEAD774 is UNSAT
Problem TDEAD775 is UNSAT
Problem TDEAD776 is UNSAT
Problem TDEAD778 is UNSAT
Problem TDEAD779 is UNSAT
Problem TDEAD781 is UNSAT
Problem TDEAD782 is UNSAT
Problem TDEAD783 is UNSAT
Problem TDEAD784 is UNSAT
Problem TDEAD785 is UNSAT
At refinement iteration 4 (OVERLAPS) 2/351 variables, 2/63 constraints. Problems are: Problem set: 66 solved, 723 unsolved
[2024-05-31 08:00:03] [INFO ] Deduced a trap composed of 113 places in 180 ms of which 3 ms to minimize.
[2024-05-31 08:00:09] [INFO ] Deduced a trap composed of 117 places in 197 ms of which 3 ms to minimize.
[2024-05-31 08:00:09] [INFO ] Deduced a trap composed of 43 places in 149 ms of which 2 ms to minimize.
[2024-05-31 08:00:10] [INFO ] Deduced a trap composed of 40 places in 171 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 351/1130 variables, and 67 constraints, problems are : Problem set: 66 solved, 723 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 0/351 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/789 constraints, Known Traps: 25/25 constraints]
After SMT, in 61369ms problems are : Problem set: 66 solved, 723 unsolved
Search for dead transitions found 66 dead transitions in 61380ms
Found 66 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 66 transitions
Dead transitions reduction (with SMT) removed 66 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 351/351 places, 725/791 transitions.
Reduce places removed 0 places and 12 transitions.
Graph (complete) has 2143 edges and 351 vertex of which 14 are kept as prefixes of interest. Removing 337 places using SCC suffix rule.15 ms
Discarding 337 places :
Also discarding 701 output transitions
Drop transitions (Output transitions of discarded places.) removed 701 transitions
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 14 transition count 12
Reduce places removed 0 places and 12 transitions.
Deduced a syphon composed of 14 places in 0 ms
Applied a total of 1 rules in 26 ms. Remains 14 /351 variables (removed 337) and now considering 0/725 (removed 725) transitions.
[2024-05-31 08:00:12] [INFO ] Computed 0 invariants in 0 ms
[2024-05-31 08:00:12] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-31 08:00:12] [INFO ] Invariant cache hit.
[2024-05-31 08:00:12] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 14/351 places, 0/791 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 65793 ms. Remains : 14/351 places, 0/791 transitions.
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
FORMULA StableMarking TRUE TECHNIQUES RANDOM_WALK SMT_REFINEMENT TOPOLOGICAL INITIAL_STATE
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 834896 ms.

BK_STOP 1717142413128

--------------------
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-S02J06T06"
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-S02J06T06, 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-171654455700153"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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