About the Execution of LTSMin+red for Anderson-PT-09
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1526.031 | 103877.00 | 163923.00 | 396.40 | ????????????F??? | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r464-smll-171620118400353.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is Anderson-PT-09, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r464-smll-171620118400353
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 71K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 15:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 19 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 17:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 15:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 155K Apr 12 15:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Apr 12 15:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 41K Apr 12 15:40 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:27 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 927K May 18 16:42 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME Anderson-PT-09-CTLCardinality-2024-00
FORMULA_NAME Anderson-PT-09-CTLCardinality-2024-01
FORMULA_NAME Anderson-PT-09-CTLCardinality-2024-02
FORMULA_NAME Anderson-PT-09-CTLCardinality-2024-03
FORMULA_NAME Anderson-PT-09-CTLCardinality-2024-04
FORMULA_NAME Anderson-PT-09-CTLCardinality-2024-05
FORMULA_NAME Anderson-PT-09-CTLCardinality-2024-06
FORMULA_NAME Anderson-PT-09-CTLCardinality-2024-07
FORMULA_NAME Anderson-PT-09-CTLCardinality-2024-08
FORMULA_NAME Anderson-PT-09-CTLCardinality-2024-09
FORMULA_NAME Anderson-PT-09-CTLCardinality-2024-10
FORMULA_NAME Anderson-PT-09-CTLCardinality-2024-11
FORMULA_NAME Anderson-PT-09-CTLCardinality-2023-12
FORMULA_NAME Anderson-PT-09-CTLCardinality-2023-13
FORMULA_NAME Anderson-PT-09-CTLCardinality-2023-14
FORMULA_NAME Anderson-PT-09-CTLCardinality-2023-15
=== Now, execution of the tool begins
BK_START 1717257356929
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Anderson-PT-09
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 15:55:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 15:55:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 15:56:00] [INFO ] Load time of PNML (sax parser for PT used): 425 ms
[2024-06-01 15:56:00] [INFO ] Transformed 505 places.
[2024-06-01 15:56:00] [INFO ] Transformed 1845 transitions.
[2024-06-01 15:56:00] [INFO ] Found NUPN structural information;
[2024-06-01 15:56:00] [INFO ] Parsed PT model containing 505 places and 1845 transitions and 7092 arcs in 699 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 37 ms.
FORMULA Anderson-PT-09-CTLCardinality-2023-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 124 out of 505 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 505/505 places, 1845/1845 transitions.
Discarding 94 places :
Symmetric choice reduction at 0 with 94 rule applications. Total rules 94 place count 411 transition count 903
Iterating global reduction 0 with 94 rules applied. Total rules applied 188 place count 411 transition count 903
Applied a total of 188 rules in 196 ms. Remains 411 /505 variables (removed 94) and now considering 903/1845 (removed 942) transitions.
// Phase 1: matrix 903 rows 411 cols
[2024-06-01 15:56:00] [INFO ] Computed 21 invariants in 86 ms
[2024-06-01 15:56:01] [INFO ] Implicit Places using invariants in 1267 ms returned []
[2024-06-01 15:56:01] [INFO ] Invariant cache hit.
[2024-06-01 15:56:03] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-01 15:56:05] [INFO ] Implicit Places using invariants and state equation in 3464 ms returned []
Implicit Place search using SMT with State Equation took 4830 ms to find 0 implicit places.
Running 894 sub problems to find dead transitions.
[2024-06-01 15:56:05] [INFO ] Invariant cache hit.
[2024-06-01 15:56:05] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/411 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 894 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/411 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 894 unsolved
[2024-06-01 15:56:22] [INFO ] Deduced a trap composed of 125 places in 674 ms of which 72 ms to minimize.
[2024-06-01 15:56:22] [INFO ] Deduced a trap composed of 182 places in 589 ms of which 7 ms to minimize.
[2024-06-01 15:56:23] [INFO ] Deduced a trap composed of 148 places in 478 ms of which 7 ms to minimize.
[2024-06-01 15:56:24] [INFO ] Deduced a trap composed of 276 places in 527 ms of which 18 ms to minimize.
[2024-06-01 15:56:24] [INFO ] Deduced a trap composed of 219 places in 323 ms of which 4 ms to minimize.
[2024-06-01 15:56:25] [INFO ] Deduced a trap composed of 278 places in 487 ms of which 6 ms to minimize.
[2024-06-01 15:56:25] [INFO ] Deduced a trap composed of 110 places in 493 ms of which 5 ms to minimize.
[2024-06-01 15:56:26] [INFO ] Deduced a trap composed of 124 places in 485 ms of which 7 ms to minimize.
[2024-06-01 15:56:26] [INFO ] Deduced a trap composed of 115 places in 429 ms of which 6 ms to minimize.
[2024-06-01 15:56:27] [INFO ] Deduced a trap composed of 179 places in 539 ms of which 7 ms to minimize.
[2024-06-01 15:56:27] [INFO ] Deduced a trap composed of 128 places in 373 ms of which 4 ms to minimize.
[2024-06-01 15:56:28] [INFO ] Deduced a trap composed of 76 places in 310 ms of which 4 ms to minimize.
[2024-06-01 15:56:28] [INFO ] Deduced a trap composed of 93 places in 294 ms of which 4 ms to minimize.
[2024-06-01 15:56:28] [INFO ] Deduced a trap composed of 248 places in 359 ms of which 4 ms to minimize.
[2024-06-01 15:56:29] [INFO ] Deduced a trap composed of 165 places in 438 ms of which 5 ms to minimize.
[2024-06-01 15:56:29] [INFO ] Deduced a trap composed of 163 places in 575 ms of which 6 ms to minimize.
[2024-06-01 15:56:30] [INFO ] Deduced a trap composed of 214 places in 562 ms of which 7 ms to minimize.
[2024-06-01 15:56:31] [INFO ] Deduced a trap composed of 90 places in 545 ms of which 6 ms to minimize.
[2024-06-01 15:56:31] [INFO ] Deduced a trap composed of 205 places in 558 ms of which 6 ms to minimize.
[2024-06-01 15:56:32] [INFO ] Deduced a trap composed of 99 places in 561 ms of which 7 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/411 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 894 unsolved
[2024-06-01 15:56:34] [INFO ] Deduced a trap composed of 165 places in 566 ms of which 6 ms to minimize.
[2024-06-01 15:56:35] [INFO ] Deduced a trap composed of 146 places in 538 ms of which 6 ms to minimize.
[2024-06-01 15:56:35] [INFO ] Deduced a trap composed of 242 places in 558 ms of which 6 ms to minimize.
[2024-06-01 15:56:36] [INFO ] Deduced a trap composed of 196 places in 563 ms of which 7 ms to minimize.
[2024-06-01 15:56:36] [INFO ] Deduced a trap composed of 259 places in 568 ms of which 7 ms to minimize.
[2024-06-01 15:56:37] [INFO ] Deduced a trap composed of 170 places in 548 ms of which 7 ms to minimize.
SMT process timed out in 32100ms, After SMT, problems are : Problem set: 0 solved, 894 unsolved
Search for dead transitions found 0 dead transitions in 32150ms
Starting structural reductions in LTL mode, iteration 1 : 411/505 places, 903/1845 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37228 ms. Remains : 411/505 places, 903/1845 transitions.
Support contains 124 out of 411 places after structural reductions.
[2024-06-01 15:56:38] [INFO ] Flatten gal took : 218 ms
[2024-06-01 15:56:38] [INFO ] Flatten gal took : 139 ms
[2024-06-01 15:56:38] [INFO ] Input system was already deterministic with 903 transitions.
Support contains 115 out of 411 places (down from 124) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 3248 ms. (12 steps per ms) remains 9/74 properties
BEST_FIRST walk for 40002 steps (8 resets) in 583 ms. (68 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 401 ms. (99 steps per ms) remains 8/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 284 ms. (140 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 275 ms. (144 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 172 ms. (231 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 234 ms. (170 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (8 resets) in 141 ms. (281 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (8 resets) in 100 ms. (396 steps per ms) remains 6/7 properties
[2024-06-01 15:56:40] [INFO ] Invariant cache hit.
[2024-06-01 15:56:40] [INFO ] State equation strengthened by 72 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 346/362 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/362 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 31/393 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/393 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 18/411 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/411 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 903/1314 variables, 411/432 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1314 variables, 72/504 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1314 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 0/1314 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1314/1314 variables, and 504 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1159 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 411/411 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 346/362 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/362 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 31/393 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/393 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp48 is UNSAT
At refinement iteration 5 (OVERLAPS) 18/411 variables, 11/21 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/411 variables, 0/21 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 903/1314 variables, 411/432 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1314 variables, 72/504 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1314 variables, 4/508 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1314 variables, 0/508 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 0/1314 variables, 0/508 constraints. Problems are: Problem set: 2 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1314/1314 variables, and 508 constraints, problems are : Problem set: 2 solved, 4 unsolved in 1864 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 411/411 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 4/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 3064ms problems are : Problem set: 2 solved, 4 unsolved
Parikh walk visited 0 properties in 1167 ms.
Support contains 6 out of 411 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 411/411 places, 903/903 transitions.
Performed 68 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 68 Pre rules applied. Total rules applied 0 place count 411 transition count 835
Deduced a syphon composed of 68 places in 1 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 0 with 136 rules applied. Total rules applied 136 place count 343 transition count 835
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 181 place count 298 transition count 502
Iterating global reduction 0 with 45 rules applied. Total rules applied 226 place count 298 transition count 502
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 234 place count 294 transition count 498
Applied a total of 234 rules in 113 ms. Remains 294 /411 variables (removed 117) and now considering 498/903 (removed 405) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 113 ms. Remains : 294/411 places, 498/903 transitions.
RANDOM walk for 40000 steps (8 resets) in 540 ms. (73 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 438 ms. (91 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 238 ms. (167 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 174 ms. (228 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 165 ms. (240 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 184891 steps, run timeout after 3001 ms. (steps per millisecond=61 ) properties seen :2 out of 4
Probabilistic random walk after 184891 steps, saw 131602 distinct states, run finished after 3007 ms. (steps per millisecond=61 ) properties seen :2
// Phase 1: matrix 498 rows 294 cols
[2024-06-01 15:56:48] [INFO ] Computed 21 invariants in 10 ms
[2024-06-01 15:56:48] [INFO ] State equation strengthened by 72 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 265/269 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/269 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 15/284 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/284 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 10/294 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/294 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 498/792 variables, 294/315 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/792 variables, 72/387 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/792 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/792 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 792/792 variables, and 387 constraints, problems are : Problem set: 0 solved, 2 unsolved in 381 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 294/294 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 265/269 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/269 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 15/284 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/284 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 10/294 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/294 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 498/792 variables, 294/315 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/792 variables, 72/387 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/792 variables, 2/389 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/792 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/792 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 792/792 variables, and 389 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1053 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 294/294 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 1458ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 161 ms.
Support contains 4 out of 294 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 294/294 places, 498/498 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 292 transition count 496
Applied a total of 4 rules in 62 ms. Remains 292 /294 variables (removed 2) and now considering 496/498 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 292/294 places, 496/498 transitions.
RANDOM walk for 40000 steps (8 resets) in 365 ms. (109 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 138 ms. (287 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (8 resets) in 240 ms. (165 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 722000 steps, run timeout after 3001 ms. (steps per millisecond=240 ) properties seen :1 out of 2
Probabilistic random walk after 722000 steps, saw 486803 distinct states, run finished after 3001 ms. (steps per millisecond=240 ) properties seen :1
// Phase 1: matrix 496 rows 292 cols
[2024-06-01 15:56:53] [INFO ] Computed 21 invariants in 14 ms
[2024-06-01 15:56:53] [INFO ] State equation strengthened by 72 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 263/266 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/266 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 16/282 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/282 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/292 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/292 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 496/788 variables, 292/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/788 variables, 72/385 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/788 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/788 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 788/788 variables, and 385 constraints, problems are : Problem set: 0 solved, 1 unsolved in 302 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 292/292 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 263/266 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/266 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 16/282 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/282 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/292 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/292 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 496/788 variables, 292/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/788 variables, 72/385 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/788 variables, 1/386 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 15:56:54] [INFO ] Deduced a trap composed of 148 places in 362 ms of which 5 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/788 variables, 1/387 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/788 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/788 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 788/788 variables, and 387 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1303 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 292/292 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 1638ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 292 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 292/292 places, 496/496 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 291 transition count 495
Applied a total of 2 rules in 52 ms. Remains 291 /292 variables (removed 1) and now considering 495/496 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 291/292 places, 495/496 transitions.
RANDOM walk for 40000 steps (8 resets) in 370 ms. (107 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (8 resets) in 123 ms. (322 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 912913 steps, run timeout after 3001 ms. (steps per millisecond=304 ) properties seen :0 out of 1
Probabilistic random walk after 912913 steps, saw 610801 distinct states, run finished after 3001 ms. (steps per millisecond=304 ) properties seen :0
// Phase 1: matrix 495 rows 291 cols
[2024-06-01 15:56:58] [INFO ] Computed 21 invariants in 7 ms
[2024-06-01 15:56:58] [INFO ] State equation strengthened by 72 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 262/265 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/265 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 16/281 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/281 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/291 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/291 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 495/786 variables, 291/312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/786 variables, 72/384 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/786 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/786 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 786/786 variables, and 384 constraints, problems are : Problem set: 0 solved, 1 unsolved in 359 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 291/291 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 262/265 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/265 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 16/281 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 15:56:59] [INFO ] Deduced a trap composed of 245 places in 225 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/281 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/281 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 10/291 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/291 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 495/786 variables, 291/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/786 variables, 72/385 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/786 variables, 1/386 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/786 variables, 0/386 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/786 variables, 0/386 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 786/786 variables, and 386 constraints, problems are : Problem set: 0 solved, 1 unsolved in 722 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 291/291 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 1119ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 13 ms.
Support contains 3 out of 291 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 291/291 places, 495/495 transitions.
Applied a total of 0 rules in 19 ms. Remains 291 /291 variables (removed 0) and now considering 495/495 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 291/291 places, 495/495 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 291/291 places, 495/495 transitions.
Applied a total of 0 rules in 18 ms. Remains 291 /291 variables (removed 0) and now considering 495/495 (removed 0) transitions.
[2024-06-01 15:56:59] [INFO ] Invariant cache hit.
[2024-06-01 15:57:00] [INFO ] Implicit Places using invariants in 488 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 500 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 290/291 places, 495/495 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 79 transitions
Trivial Post-agglo rules discarded 79 transitions
Performed 79 trivial Post agglomeration. Transition count delta: 79
Iterating post reduction 0 with 79 rules applied. Total rules applied 79 place count 290 transition count 416
Reduce places removed 79 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 80 rules applied. Total rules applied 159 place count 211 transition count 415
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 160 place count 210 transition count 415
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 161 place count 210 transition count 414
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 162 place count 209 transition count 414
Applied a total of 162 rules in 38 ms. Remains 209 /290 variables (removed 81) and now considering 414/495 (removed 81) transitions.
// Phase 1: matrix 414 rows 209 cols
[2024-06-01 15:57:00] [INFO ] Computed 20 invariants in 3 ms
[2024-06-01 15:57:00] [INFO ] Implicit Places using invariants in 267 ms returned []
[2024-06-01 15:57:00] [INFO ] Invariant cache hit.
[2024-06-01 15:57:00] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-01 15:57:01] [INFO ] Implicit Places using invariants and state equation in 988 ms returned []
Implicit Place search using SMT with State Equation took 1258 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 209/291 places, 414/495 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1815 ms. Remains : 209/291 places, 414/495 transitions.
RANDOM walk for 40000 steps (8 resets) in 102 ms. (388 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (8 resets) in 62 ms. (634 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1021001 steps, run timeout after 3001 ms. (steps per millisecond=340 ) properties seen :0 out of 1
Probabilistic random walk after 1021001 steps, saw 652144 distinct states, run finished after 3001 ms. (steps per millisecond=340 ) properties seen :0
[2024-06-01 15:57:04] [INFO ] Invariant cache hit.
[2024-06-01 15:57:04] [INFO ] State equation strengthened by 72 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 190/193 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/193 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 7/200 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 9/209 variables, 9/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/209 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 414/623 variables, 209/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/623 variables, 72/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/623 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/623 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 623/623 variables, and 301 constraints, problems are : Problem set: 0 solved, 1 unsolved in 224 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 209/209 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 190/193 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/193 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 7/200 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 9/209 variables, 9/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/209 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 414/623 variables, 209/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/623 variables, 72/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/623 variables, 1/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/623 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/623 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 623/623 variables, and 302 constraints, problems are : Problem set: 0 solved, 1 unsolved in 355 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 209/209 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 597ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 10 ms.
Support contains 3 out of 209 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 209/209 places, 414/414 transitions.
Applied a total of 0 rules in 16 ms. Remains 209 /209 variables (removed 0) and now considering 414/414 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 209/209 places, 414/414 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 209/209 places, 414/414 transitions.
Applied a total of 0 rules in 15 ms. Remains 209 /209 variables (removed 0) and now considering 414/414 (removed 0) transitions.
[2024-06-01 15:57:05] [INFO ] Invariant cache hit.
[2024-06-01 15:57:05] [INFO ] Implicit Places using invariants in 423 ms returned []
[2024-06-01 15:57:05] [INFO ] Invariant cache hit.
[2024-06-01 15:57:05] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-01 15:57:06] [INFO ] Implicit Places using invariants and state equation in 1281 ms returned []
Implicit Place search using SMT with State Equation took 1714 ms to find 0 implicit places.
[2024-06-01 15:57:06] [INFO ] Redundant transitions in 40 ms returned []
Running 405 sub problems to find dead transitions.
[2024-06-01 15:57:06] [INFO ] Invariant cache hit.
[2024-06-01 15:57:06] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/209 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/209 variables, 9/20 constraints. Problems are: Problem set: 0 solved, 405 unsolved
[2024-06-01 15:57:11] [INFO ] Deduced a trap composed of 80 places in 284 ms of which 4 ms to minimize.
[2024-06-01 15:57:11] [INFO ] Deduced a trap composed of 78 places in 276 ms of which 3 ms to minimize.
[2024-06-01 15:57:12] [INFO ] Deduced a trap composed of 87 places in 267 ms of which 4 ms to minimize.
[2024-06-01 15:57:14] [INFO ] Deduced a trap composed of 58 places in 214 ms of which 4 ms to minimize.
[2024-06-01 15:57:14] [INFO ] Deduced a trap composed of 66 places in 257 ms of which 4 ms to minimize.
[2024-06-01 15:57:14] [INFO ] Deduced a trap composed of 65 places in 286 ms of which 6 ms to minimize.
[2024-06-01 15:57:15] [INFO ] Deduced a trap composed of 70 places in 210 ms of which 8 ms to minimize.
[2024-06-01 15:57:15] [INFO ] Deduced a trap composed of 58 places in 224 ms of which 4 ms to minimize.
[2024-06-01 15:57:15] [INFO ] Deduced a trap composed of 50 places in 279 ms of which 3 ms to minimize.
[2024-06-01 15:57:15] [INFO ] Deduced a trap composed of 52 places in 272 ms of which 3 ms to minimize.
[2024-06-01 15:57:16] [INFO ] Deduced a trap composed of 54 places in 262 ms of which 4 ms to minimize.
[2024-06-01 15:57:16] [INFO ] Deduced a trap composed of 66 places in 282 ms of which 4 ms to minimize.
[2024-06-01 15:57:16] [INFO ] Deduced a trap composed of 66 places in 335 ms of which 11 ms to minimize.
[2024-06-01 15:57:17] [INFO ] Deduced a trap composed of 68 places in 268 ms of which 4 ms to minimize.
[2024-06-01 15:57:17] [INFO ] Deduced a trap composed of 62 places in 281 ms of which 3 ms to minimize.
[2024-06-01 15:57:17] [INFO ] Deduced a trap composed of 75 places in 273 ms of which 4 ms to minimize.
[2024-06-01 15:57:17] [INFO ] Deduced a trap composed of 68 places in 275 ms of which 3 ms to minimize.
[2024-06-01 15:57:18] [INFO ] Deduced a trap composed of 63 places in 274 ms of which 3 ms to minimize.
[2024-06-01 15:57:18] [INFO ] Deduced a trap composed of 56 places in 280 ms of which 4 ms to minimize.
[2024-06-01 15:57:18] [INFO ] Deduced a trap composed of 56 places in 234 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/209 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 405 unsolved
[2024-06-01 15:57:19] [INFO ] Deduced a trap composed of 58 places in 272 ms of which 4 ms to minimize.
[2024-06-01 15:57:20] [INFO ] Deduced a trap composed of 93 places in 287 ms of which 4 ms to minimize.
[2024-06-01 15:57:20] [INFO ] Deduced a trap composed of 72 places in 284 ms of which 5 ms to minimize.
[2024-06-01 15:57:22] [INFO ] Deduced a trap composed of 98 places in 278 ms of which 3 ms to minimize.
[2024-06-01 15:57:22] [INFO ] Deduced a trap composed of 88 places in 282 ms of which 4 ms to minimize.
[2024-06-01 15:57:22] [INFO ] Deduced a trap composed of 80 places in 273 ms of which 3 ms to minimize.
[2024-06-01 15:57:22] [INFO ] Deduced a trap composed of 67 places in 279 ms of which 4 ms to minimize.
[2024-06-01 15:57:23] [INFO ] Deduced a trap composed of 93 places in 265 ms of which 4 ms to minimize.
[2024-06-01 15:57:24] [INFO ] Deduced a trap composed of 80 places in 206 ms of which 4 ms to minimize.
[2024-06-01 15:57:25] [INFO ] Deduced a trap composed of 90 places in 264 ms of which 4 ms to minimize.
[2024-06-01 15:57:25] [INFO ] Deduced a trap composed of 65 places in 276 ms of which 5 ms to minimize.
[2024-06-01 15:57:25] [INFO ] Deduced a trap composed of 93 places in 260 ms of which 4 ms to minimize.
[2024-06-01 15:57:26] [INFO ] Deduced a trap composed of 60 places in 279 ms of which 4 ms to minimize.
[2024-06-01 15:57:26] [INFO ] Deduced a trap composed of 77 places in 278 ms of which 4 ms to minimize.
[2024-06-01 15:57:27] [INFO ] Deduced a trap composed of 70 places in 261 ms of which 4 ms to minimize.
[2024-06-01 15:57:27] [INFO ] Deduced a trap composed of 58 places in 267 ms of which 4 ms to minimize.
[2024-06-01 15:57:27] [INFO ] Deduced a trap composed of 70 places in 242 ms of which 4 ms to minimize.
[2024-06-01 15:57:28] [INFO ] Deduced a trap composed of 60 places in 254 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/209 variables, 18/58 constraints. Problems are: Problem set: 0 solved, 405 unsolved
[2024-06-01 15:57:32] [INFO ] Deduced a trap composed of 70 places in 263 ms of which 4 ms to minimize.
[2024-06-01 15:57:32] [INFO ] Deduced a trap composed of 76 places in 285 ms of which 3 ms to minimize.
[2024-06-01 15:57:33] [INFO ] Deduced a trap composed of 72 places in 272 ms of which 4 ms to minimize.
[2024-06-01 15:57:34] [INFO ] Deduced a trap composed of 62 places in 132 ms of which 3 ms to minimize.
[2024-06-01 15:57:34] [INFO ] Deduced a trap composed of 54 places in 174 ms of which 2 ms to minimize.
[2024-06-01 15:57:34] [INFO ] Deduced a trap composed of 74 places in 165 ms of which 3 ms to minimize.
[2024-06-01 15:57:34] [INFO ] Deduced a trap composed of 74 places in 173 ms of which 4 ms to minimize.
[2024-06-01 15:57:35] [INFO ] Deduced a trap composed of 71 places in 253 ms of which 4 ms to minimize.
[2024-06-01 15:57:35] [INFO ] Deduced a trap composed of 90 places in 195 ms of which 3 ms to minimize.
[2024-06-01 15:57:35] [INFO ] Deduced a trap composed of 75 places in 162 ms of which 2 ms to minimize.
[2024-06-01 15:57:35] [INFO ] Deduced a trap composed of 102 places in 153 ms of which 3 ms to minimize.
[2024-06-01 15:57:35] [INFO ] Deduced a trap composed of 70 places in 167 ms of which 2 ms to minimize.
[2024-06-01 15:57:36] [INFO ] Deduced a trap composed of 74 places in 155 ms of which 2 ms to minimize.
[2024-06-01 15:57:36] [INFO ] Deduced a trap composed of 66 places in 159 ms of which 2 ms to minimize.
[2024-06-01 15:57:36] [INFO ] Deduced a trap composed of 65 places in 201 ms of which 3 ms to minimize.
[2024-06-01 15:57:36] [INFO ] Deduced a trap composed of 74 places in 276 ms of which 4 ms to minimize.
[2024-06-01 15:57:36] [INFO ] Deduced a trap composed of 65 places in 189 ms of which 3 ms to minimize.
[2024-06-01 15:57:37] [INFO ] Deduced a trap composed of 63 places in 156 ms of which 2 ms to minimize.
[2024-06-01 15:57:37] [INFO ] Deduced a trap composed of 79 places in 149 ms of which 2 ms to minimize.
[2024-06-01 15:57:37] [INFO ] Deduced a trap composed of 80 places in 241 ms of which 4 ms to minimize.
SMT process timed out in 30760ms, After SMT, problems are : Problem set: 0 solved, 405 unsolved
Search for dead transitions found 0 dead transitions in 30769ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32550 ms. Remains : 209/209 places, 414/414 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 80 Pre rules applied. Total rules applied 0 place count 209 transition count 334
Deduced a syphon composed of 80 places in 0 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 0 with 160 rules applied. Total rules applied 160 place count 129 transition count 334
Applied a total of 160 rules in 29 ms. Remains 129 /209 variables (removed 80) and now considering 334/414 (removed 80) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 334 rows 129 cols
[2024-06-01 15:57:37] [INFO ] Computed 20 invariants in 5 ms
[2024-06-01 15:57:37] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 15:57:37] [INFO ] [Nat]Absence check using 12 positive place invariants in 20 ms returned sat
[2024-06-01 15:57:37] [INFO ] [Nat]Absence check using 12 positive and 8 generalized place invariants in 15 ms returned sat
[2024-06-01 15:57:37] [INFO ] After 190ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 15:57:38] [INFO ] After 229ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 15:57:38] [INFO ] After 369ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 509 ms.
Successfully simplified 2 atomic propositions for a total of 15 simplifications.
[2024-06-01 15:57:38] [INFO ] Flatten gal took : 92 ms
[2024-06-01 15:57:38] [INFO ] Flatten gal took : 85 ms
[2024-06-01 15:57:38] [INFO ] Input system was already deterministic with 903 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 411/411 places, 903/903 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 363 transition count 551
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 363 transition count 551
Applied a total of 96 rules in 14 ms. Remains 363 /411 variables (removed 48) and now considering 551/903 (removed 352) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14 ms. Remains : 363/411 places, 551/903 transitions.
[2024-06-01 15:57:38] [INFO ] Flatten gal took : 26 ms
[2024-06-01 15:57:38] [INFO ] Flatten gal took : 27 ms
[2024-06-01 15:57:38] [INFO ] Input system was already deterministic with 551 transitions.
Starting structural reductions in LTL mode, iteration 0 : 411/411 places, 903/903 transitions.
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 49 place count 362 transition count 566
Iterating global reduction 0 with 49 rules applied. Total rules applied 98 place count 362 transition count 566
Applied a total of 98 rules in 14 ms. Remains 362 /411 variables (removed 49) and now considering 566/903 (removed 337) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15 ms. Remains : 362/411 places, 566/903 transitions.
[2024-06-01 15:57:38] [INFO ] Flatten gal took : 26 ms
[2024-06-01 15:57:38] [INFO ] Flatten gal took : 27 ms
[2024-06-01 15:57:38] [INFO ] Input system was already deterministic with 566 transitions.
Starting structural reductions in LTL mode, iteration 0 : 411/411 places, 903/903 transitions.
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 49 place count 362 transition count 566
Iterating global reduction 0 with 49 rules applied. Total rules applied 98 place count 362 transition count 566
Applied a total of 98 rules in 14 ms. Remains 362 /411 variables (removed 49) and now considering 566/903 (removed 337) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14 ms. Remains : 362/411 places, 566/903 transitions.
[2024-06-01 15:57:38] [INFO ] Flatten gal took : 25 ms
[2024-06-01 15:57:38] [INFO ] Flatten gal took : 27 ms
[2024-06-01 15:57:38] [INFO ] Input system was already deterministic with 566 transitions.
Starting structural reductions in LTL mode, iteration 0 : 411/411 places, 903/903 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 45 place count 366 transition count 586
Iterating global reduction 0 with 45 rules applied. Total rules applied 90 place count 366 transition count 586
Applied a total of 90 rules in 18 ms. Remains 366 /411 variables (removed 45) and now considering 586/903 (removed 317) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19 ms. Remains : 366/411 places, 586/903 transitions.
[2024-06-01 15:57:38] [INFO ] Flatten gal took : 24 ms
[2024-06-01 15:57:38] [INFO ] Flatten gal took : 27 ms
[2024-06-01 15:57:38] [INFO ] Input system was already deterministic with 586 transitions.
Starting structural reductions in LTL mode, iteration 0 : 411/411 places, 903/903 transitions.
Discarding 44 places :
Symmetric choice reduction at 0 with 44 rule applications. Total rules 44 place count 367 transition count 571
Iterating global reduction 0 with 44 rules applied. Total rules applied 88 place count 367 transition count 571
Applied a total of 88 rules in 14 ms. Remains 367 /411 variables (removed 44) and now considering 571/903 (removed 332) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14 ms. Remains : 367/411 places, 571/903 transitions.
[2024-06-01 15:57:39] [INFO ] Flatten gal took : 24 ms
[2024-06-01 15:57:39] [INFO ] Flatten gal took : 26 ms
[2024-06-01 15:57:39] [INFO ] Input system was already deterministic with 571 transitions.
Starting structural reductions in LTL mode, iteration 0 : 411/411 places, 903/903 transitions.
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 49 place count 362 transition count 550
Iterating global reduction 0 with 49 rules applied. Total rules applied 98 place count 362 transition count 550
Applied a total of 98 rules in 14 ms. Remains 362 /411 variables (removed 49) and now considering 550/903 (removed 353) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15 ms. Remains : 362/411 places, 550/903 transitions.
[2024-06-01 15:57:39] [INFO ] Flatten gal took : 21 ms
[2024-06-01 15:57:39] [INFO ] Flatten gal took : 24 ms
[2024-06-01 15:57:39] [INFO ] Input system was already deterministic with 550 transitions.
Starting structural reductions in LTL mode, iteration 0 : 411/411 places, 903/903 transitions.
Discarding 50 places :
Symmetric choice reduction at 0 with 50 rule applications. Total rules 50 place count 361 transition count 549
Iterating global reduction 0 with 50 rules applied. Total rules applied 100 place count 361 transition count 549
Applied a total of 100 rules in 14 ms. Remains 361 /411 variables (removed 50) and now considering 549/903 (removed 354) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14 ms. Remains : 361/411 places, 549/903 transitions.
[2024-06-01 15:57:39] [INFO ] Flatten gal took : 27 ms
[2024-06-01 15:57:39] [INFO ] Flatten gal took : 24 ms
[2024-06-01 15:57:39] [INFO ] Input system was already deterministic with 549 transitions.
Starting structural reductions in LTL mode, iteration 0 : 411/411 places, 903/903 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 363 transition count 567
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 363 transition count 567
Applied a total of 96 rules in 15 ms. Remains 363 /411 variables (removed 48) and now considering 567/903 (removed 336) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15 ms. Remains : 363/411 places, 567/903 transitions.
[2024-06-01 15:57:39] [INFO ] Flatten gal took : 20 ms
[2024-06-01 15:57:39] [INFO ] Flatten gal took : 21 ms
[2024-06-01 15:57:39] [INFO ] Input system was already deterministic with 567 transitions.
Starting structural reductions in LTL mode, iteration 0 : 411/411 places, 903/903 transitions.
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 49 place count 362 transition count 550
Iterating global reduction 0 with 49 rules applied. Total rules applied 98 place count 362 transition count 550
Applied a total of 98 rules in 14 ms. Remains 362 /411 variables (removed 49) and now considering 550/903 (removed 353) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14 ms. Remains : 362/411 places, 550/903 transitions.
[2024-06-01 15:57:39] [INFO ] Flatten gal took : 17 ms
[2024-06-01 15:57:39] [INFO ] Flatten gal took : 20 ms
[2024-06-01 15:57:39] [INFO ] Input system was already deterministic with 550 transitions.
Starting structural reductions in LTL mode, iteration 0 : 411/411 places, 903/903 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 363 transition count 567
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 363 transition count 567
Applied a total of 96 rules in 14 ms. Remains 363 /411 variables (removed 48) and now considering 567/903 (removed 336) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14 ms. Remains : 363/411 places, 567/903 transitions.
[2024-06-01 15:57:39] [INFO ] Flatten gal took : 19 ms
[2024-06-01 15:57:39] [INFO ] Flatten gal took : 21 ms
[2024-06-01 15:57:39] [INFO ] Input system was already deterministic with 567 transitions.
Starting structural reductions in LTL mode, iteration 0 : 411/411 places, 903/903 transitions.
Discarding 50 places :
Symmetric choice reduction at 0 with 50 rule applications. Total rules 50 place count 361 transition count 549
Iterating global reduction 0 with 50 rules applied. Total rules applied 100 place count 361 transition count 549
Applied a total of 100 rules in 15 ms. Remains 361 /411 variables (removed 50) and now considering 549/903 (removed 354) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15 ms. Remains : 361/411 places, 549/903 transitions.
[2024-06-01 15:57:39] [INFO ] Flatten gal took : 18 ms
[2024-06-01 15:57:39] [INFO ] Flatten gal took : 20 ms
[2024-06-01 15:57:39] [INFO ] Input system was already deterministic with 549 transitions.
Starting structural reductions in LTL mode, iteration 0 : 411/411 places, 903/903 transitions.
Discarding 43 places :
Symmetric choice reduction at 0 with 43 rule applications. Total rules 43 place count 368 transition count 588
Iterating global reduction 0 with 43 rules applied. Total rules applied 86 place count 368 transition count 588
Applied a total of 86 rules in 13 ms. Remains 368 /411 variables (removed 43) and now considering 588/903 (removed 315) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13 ms. Remains : 368/411 places, 588/903 transitions.
[2024-06-01 15:57:39] [INFO ] Flatten gal took : 19 ms
[2024-06-01 15:57:39] [INFO ] Flatten gal took : 20 ms
[2024-06-01 15:57:39] [INFO ] Input system was already deterministic with 588 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 411/411 places, 903/903 transitions.
Performed 62 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 62 Pre rules applied. Total rules applied 0 place count 411 transition count 841
Deduced a syphon composed of 62 places in 1 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 0 with 124 rules applied. Total rules applied 124 place count 349 transition count 841
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 163 place count 310 transition count 546
Iterating global reduction 0 with 39 rules applied. Total rules applied 202 place count 310 transition count 546
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 218 place count 302 transition count 538
Applied a total of 218 rules in 50 ms. Remains 302 /411 variables (removed 109) and now considering 538/903 (removed 365) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 50 ms. Remains : 302/411 places, 538/903 transitions.
[2024-06-01 15:57:40] [INFO ] Flatten gal took : 17 ms
[2024-06-01 15:57:40] [INFO ] Flatten gal took : 18 ms
[2024-06-01 15:57:40] [INFO ] Input system was already deterministic with 538 transitions.
Starting structural reductions in LTL mode, iteration 0 : 411/411 places, 903/903 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 363 transition count 567
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 363 transition count 567
Applied a total of 96 rules in 14 ms. Remains 363 /411 variables (removed 48) and now considering 567/903 (removed 336) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14 ms. Remains : 363/411 places, 567/903 transitions.
[2024-06-01 15:57:40] [INFO ] Flatten gal took : 18 ms
[2024-06-01 15:57:40] [INFO ] Flatten gal took : 19 ms
[2024-06-01 15:57:40] [INFO ] Input system was already deterministic with 567 transitions.
Starting structural reductions in LTL mode, iteration 0 : 411/411 places, 903/903 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 45 place count 366 transition count 586
Iterating global reduction 0 with 45 rules applied. Total rules applied 90 place count 366 transition count 586
Applied a total of 90 rules in 14 ms. Remains 366 /411 variables (removed 45) and now considering 586/903 (removed 317) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14 ms. Remains : 366/411 places, 586/903 transitions.
[2024-06-01 15:57:40] [INFO ] Flatten gal took : 19 ms
[2024-06-01 15:57:40] [INFO ] Flatten gal took : 19 ms
[2024-06-01 15:57:40] [INFO ] Input system was already deterministic with 586 transitions.
[2024-06-01 15:57:40] [INFO ] Flatten gal took : 30 ms
[2024-06-01 15:57:40] [INFO ] Flatten gal took : 31 ms
[2024-06-01 15:57:40] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 5 ms.
[2024-06-01 15:57:40] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 411 places, 903 transitions and 3406 arcs took 8 ms.
Total runtime 100973 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=
[--mu-opt] [--saturation=
[--sat-granularity=
[--guidance=
[--action=
[--trace=
[--mu=
[--ctl=
[--save-levels=STRING] [--pg-solve] [--attr=
[--saturating-attractor] [--write-strategy=
[--check-strategy] [--interactive-play] [--player]
[--pg-write=
[--edge-label=
[--mucalc=
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por=
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=
[--cw-max-cols=
[--mh-timeout=
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=
[--ldd32-cache=
[--cache-ratio=
[--min-free-nodes=
[--fdd-reorder=
[--vset-cache-diff=
[--next-union] [--peak-nodes] [--maxsum=
[--block-size=
[--debug=
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS]
Could not compute solution for formula : Anderson-PT-09-CTLCardinality-2024-00
Could not compute solution for formula : Anderson-PT-09-CTLCardinality-2024-01
Could not compute solution for formula : Anderson-PT-09-CTLCardinality-2024-02
Could not compute solution for formula : Anderson-PT-09-CTLCardinality-2024-03
Could not compute solution for formula : Anderson-PT-09-CTLCardinality-2024-04
Could not compute solution for formula : Anderson-PT-09-CTLCardinality-2024-05
Could not compute solution for formula : Anderson-PT-09-CTLCardinality-2024-06
Could not compute solution for formula : Anderson-PT-09-CTLCardinality-2024-07
Could not compute solution for formula : Anderson-PT-09-CTLCardinality-2024-08
Could not compute solution for formula : Anderson-PT-09-CTLCardinality-2024-09
Could not compute solution for formula : Anderson-PT-09-CTLCardinality-2024-10
Could not compute solution for formula : Anderson-PT-09-CTLCardinality-2024-11
Could not compute solution for formula : Anderson-PT-09-CTLCardinality-2023-13
Could not compute solution for formula : Anderson-PT-09-CTLCardinality-2023-14
Could not compute solution for formula : Anderson-PT-09-CTLCardinality-2023-15
BK_STOP 1717257460806
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -timeout 360 -rebuildPNML
mcc2024
ctl formula name Anderson-PT-09-CTLCardinality-2024-00
ctl formula formula --ctl=/tmp/854/ctl_0_
ctl formula name Anderson-PT-09-CTLCardinality-2024-01
ctl formula formula --ctl=/tmp/854/ctl_1_
ctl formula name Anderson-PT-09-CTLCardinality-2024-02
ctl formula formula --ctl=/tmp/854/ctl_2_
ctl formula name Anderson-PT-09-CTLCardinality-2024-03
ctl formula formula --ctl=/tmp/854/ctl_3_
ctl formula name Anderson-PT-09-CTLCardinality-2024-04
ctl formula formula --ctl=/tmp/854/ctl_4_
ctl formula name Anderson-PT-09-CTLCardinality-2024-05
ctl formula formula --ctl=/tmp/854/ctl_5_
ctl formula name Anderson-PT-09-CTLCardinality-2024-06
ctl formula formula --ctl=/tmp/854/ctl_6_
ctl formula name Anderson-PT-09-CTLCardinality-2024-07
ctl formula formula --ctl=/tmp/854/ctl_7_
ctl formula name Anderson-PT-09-CTLCardinality-2024-08
ctl formula formula --ctl=/tmp/854/ctl_8_
ctl formula name Anderson-PT-09-CTLCardinality-2024-09
ctl formula formula --ctl=/tmp/854/ctl_9_
ctl formula name Anderson-PT-09-CTLCardinality-2024-10
ctl formula formula --ctl=/tmp/854/ctl_10_
ctl formula name Anderson-PT-09-CTLCardinality-2024-11
ctl formula formula --ctl=/tmp/854/ctl_11_
ctl formula name Anderson-PT-09-CTLCardinality-2023-13
ctl formula formula --ctl=/tmp/854/ctl_12_
ctl formula name Anderson-PT-09-CTLCardinality-2023-14
ctl formula formula --ctl=/tmp/854/ctl_13_
ctl formula name Anderson-PT-09-CTLCardinality-2023-15
ctl formula formula --ctl=/tmp/854/ctl_14_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc
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="Anderson-PT-09"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is Anderson-PT-09, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r464-smll-171620118400353"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Anderson-PT-09.tgz
mv Anderson-PT-09 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;