About the Execution of GreatSPN+red for Szymanski-PT-b04
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16002.752 | 3600000.00 | 5850539.00 | 7694.20 | 4 1 1 1 1 1 0 1 4 1 1 1 0 1 1 ? | 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.r399-tall-171690531300869.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 greatspnxred
Input is Szymanski-PT-b04, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r399-tall-171690531300869
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.1M
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 19 16:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 11 15:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 134K Apr 11 15:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 19 07:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 19 15:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 3.7M 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 positive values
NUM_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME Szymanski-PT-b04-UpperBounds-00
FORMULA_NAME Szymanski-PT-b04-UpperBounds-01
FORMULA_NAME Szymanski-PT-b04-UpperBounds-02
FORMULA_NAME Szymanski-PT-b04-UpperBounds-03
FORMULA_NAME Szymanski-PT-b04-UpperBounds-04
FORMULA_NAME Szymanski-PT-b04-UpperBounds-05
FORMULA_NAME Szymanski-PT-b04-UpperBounds-06
FORMULA_NAME Szymanski-PT-b04-UpperBounds-07
FORMULA_NAME Szymanski-PT-b04-UpperBounds-08
FORMULA_NAME Szymanski-PT-b04-UpperBounds-09
FORMULA_NAME Szymanski-PT-b04-UpperBounds-10
FORMULA_NAME Szymanski-PT-b04-UpperBounds-11
FORMULA_NAME Szymanski-PT-b04-UpperBounds-12
FORMULA_NAME Szymanski-PT-b04-UpperBounds-13
FORMULA_NAME Szymanski-PT-b04-UpperBounds-14
FORMULA_NAME Szymanski-PT-b04-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1717097273168
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Szymanski-PT-b04
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-30 19:27:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-30 19:27:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 19:27:54] [INFO ] Load time of PNML (sax parser for PT used): 310 ms
[2024-05-30 19:27:54] [INFO ] Transformed 568 places.
[2024-05-30 19:27:54] [INFO ] Transformed 8320 transitions.
[2024-05-30 19:27:54] [INFO ] Parsed PT model containing 568 places and 8320 transitions and 33408 arcs in 443 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Deduced a syphon composed of 260 places in 19 ms
Reduce places removed 260 places and 256 transitions.
FORMULA Szymanski-PT-b04-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b04-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-30 19:27:54] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
// Phase 1: matrix 2733 rows 308 cols
[2024-05-30 19:27:54] [INFO ] Computed 3 invariants in 66 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[9, 1, 1, 1, 1, 1, 1, 9, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10001 steps (2 resets) in 77 ms. (128 steps per ms)
FORMULA Szymanski-PT-b04-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Szymanski-PT-b04-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Szymanski-PT-b04-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Szymanski-PT-b04-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Szymanski-PT-b04-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Szymanski-PT-b04-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 90007 steps (24 resets) in 212 ms. (422 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4, 0, 0, 0, 4, 0, 0, 0] Max Struct:[9, 1, 1, 1, 9, 1, 1, 1]
[2024-05-30 19:27:55] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
[2024-05-30 19:27:55] [INFO ] Invariant cache hit.
[2024-05-30 19:27:55] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2024-05-30 19:27:55] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 11 ms returned sat
[2024-05-30 19:27:55] [INFO ] [Real]Absence check using state equation in 454 ms returned sat
[2024-05-30 19:27:56] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-30 19:27:56] [INFO ] [Real]Added 147 Read/Feed constraints in 182 ms returned sat
[2024-05-30 19:27:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 19:27:56] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-30 19:27:56] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-30 19:27:56] [INFO ] [Nat]Absence check using state equation in 400 ms returned sat
[2024-05-30 19:27:57] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-30 19:27:57] [INFO ] [Nat]Added 147 Read/Feed constraints in 1040 ms returned unknown
[2024-05-30 19:27:57] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-30 19:27:57] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-30 19:27:58] [INFO ] [Real]Absence check using state equation in 406 ms returned sat
[2024-05-30 19:27:58] [INFO ] [Real]Added 147 Read/Feed constraints in 73 ms returned sat
[2024-05-30 19:27:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 19:27:58] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-30 19:27:58] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-30 19:27:58] [INFO ] [Nat]Absence check using state equation in 445 ms returned sat
[2024-05-30 19:27:59] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-30 19:28:00] [INFO ] [Nat]Added 147 Read/Feed constraints in 1045 ms returned unknown
[2024-05-30 19:28:00] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-30 19:28:00] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-30 19:28:00] [INFO ] [Real]Absence check using state equation in 406 ms returned sat
[2024-05-30 19:28:00] [INFO ] [Real]Added 147 Read/Feed constraints in 127 ms returned sat
[2024-05-30 19:28:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 19:28:00] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-30 19:28:00] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-30 19:28:01] [INFO ] [Nat]Absence check using state equation in 398 ms returned sat
[2024-05-30 19:28:01] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-30 19:28:02] [INFO ] [Nat]Added 147 Read/Feed constraints in 1059 ms returned unknown
[2024-05-30 19:28:02] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-30 19:28:02] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-30 19:28:02] [INFO ] [Real]Absence check using state equation in 372 ms returned sat
[2024-05-30 19:28:03] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-30 19:28:03] [INFO ] [Real]Added 147 Read/Feed constraints in 615 ms returned sat
[2024-05-30 19:28:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 19:28:03] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-30 19:28:03] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-30 19:28:03] [INFO ] [Nat]Absence check using state equation in 376 ms returned sat
[2024-05-30 19:28:04] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-30 19:28:04] [INFO ] [Nat]Added 147 Read/Feed constraints in 1044 ms returned unknown
[2024-05-30 19:28:04] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-30 19:28:04] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-30 19:28:05] [INFO ] [Real]Absence check using state equation in 377 ms returned unsat
[2024-05-30 19:28:05] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-30 19:28:05] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-30 19:28:05] [INFO ] [Real]Absence check using state equation in 438 ms returned sat
[2024-05-30 19:28:05] [INFO ] [Real]Added 147 Read/Feed constraints in 159 ms returned sat
[2024-05-30 19:28:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 19:28:06] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-30 19:28:06] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-30 19:28:06] [INFO ] [Nat]Absence check using state equation in 438 ms returned sat
[2024-05-30 19:28:07] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-30 19:28:07] [INFO ] [Nat]Added 147 Read/Feed constraints in 976 ms returned sat
[2024-05-30 19:28:08] [INFO ] Deduced a trap composed of 135 places in 617 ms of which 36 ms to minimize.
[2024-05-30 19:28:08] [INFO ] Deduced a trap composed of 134 places in 613 ms of which 3 ms to minimize.
[2024-05-30 19:28:09] [INFO ] Deduced a trap composed of 138 places in 578 ms of which 2 ms to minimize.
[2024-05-30 19:28:10] [INFO ] Deduced a trap composed of 130 places in 548 ms of which 2 ms to minimize.
[2024-05-30 19:28:10] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2690 ms
[2024-05-30 19:28:10] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2722 transitions) in 603 ms.
[2024-05-30 19:28:11] [INFO ] Added : 0 causal constraints over 0 iterations in 798 ms. Result :sat
Minimization took 30 ms.
[2024-05-30 19:28:11] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-30 19:28:11] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-30 19:28:11] [INFO ] [Real]Absence check using state equation in 449 ms returned sat
[2024-05-30 19:28:11] [INFO ] [Real]Added 147 Read/Feed constraints in 347 ms returned sat
[2024-05-30 19:28:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 19:28:12] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-30 19:28:12] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-30 19:28:12] [INFO ] [Nat]Absence check using state equation in 443 ms returned sat
[2024-05-30 19:28:13] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-30 19:28:13] [INFO ] [Nat]Added 147 Read/Feed constraints in 1051 ms returned unknown
[2024-05-30 19:28:13] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-30 19:28:13] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-30 19:28:14] [INFO ] [Real]Absence check using state equation in 511 ms returned sat
[2024-05-30 19:28:14] [INFO ] [Real]Added 147 Read/Feed constraints in 364 ms returned sat
[2024-05-30 19:28:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 19:28:14] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-30 19:28:14] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 6 ms returned sat
[2024-05-30 19:28:15] [INFO ] [Nat]Absence check using state equation in 758 ms returned sat
[2024-05-30 19:28:16] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-30 19:28:16] [INFO ] [Nat]Added 147 Read/Feed constraints in 1041 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[4, 0, 0, 0, 4, 0, 0, 0] Max Struct:[9, 1, 1, 1, 4, 1, 1, 1]
FORMULA Szymanski-PT-b04-UpperBounds-08 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4, 0, 0, 0, 0, 0, 0] Max Struct:[9, 1, 1, 1, 1, 1, 1]
Support contains 7 out of 308 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 8064/8064 transitions.
Graph (complete) has 9195 edges and 308 vertex of which 306 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.17 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 128 transitions
Reduce isomorphic transitions removed 128 transitions.
Iterating post reduction 0 with 128 rules applied. Total rules applied 129 place count 306 transition count 7936
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 130 place count 305 transition count 7808
Iterating global reduction 1 with 1 rules applied. Total rules applied 131 place count 305 transition count 7808
Applied a total of 131 rules in 428 ms. Remains 305 /308 variables (removed 3) and now considering 7808/8064 (removed 256) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 443 ms. Remains : 305/308 places, 7808/8064 transitions.
[2024-05-30 19:28:16] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
// Phase 1: matrix 2604 rows 305 cols
[2024-05-30 19:28:17] [INFO ] Computed 3 invariants in 26 ms
Current structural bounds on expressions (after invariants) : Max Seen:[4, 0, 0, 0, 0, 0, 0] Max Struct:[5, 1, 1, 1, 1, 1, 1]
RANDOM walk for 1000002 steps (2 resets) in 1770 ms. (564 steps per ms)
BEST_FIRST walk for 7000006 steps (14 resets) in 5974 ms. (1171 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4, 0, 0, 0, 0, 0, 0] Max Struct:[5, 1, 1, 1, 1, 1, 1]
[2024-05-30 19:28:24] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-05-30 19:28:24] [INFO ] Invariant cache hit.
[2024-05-30 19:28:24] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-30 19:28:25] [INFO ] [Real]Absence check using state equation in 384 ms returned sat
[2024-05-30 19:28:25] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-30 19:28:25] [INFO ] [Real]Added 147 Read/Feed constraints in 138 ms returned sat
[2024-05-30 19:28:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 19:28:25] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-30 19:28:25] [INFO ] [Nat]Absence check using state equation in 361 ms returned sat
[2024-05-30 19:28:30] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-30 19:28:34] [INFO ] [Nat]Added 147 Read/Feed constraints in 9044 ms returned unknown
[2024-05-30 19:28:34] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-30 19:28:35] [INFO ] [Real]Absence check using state equation in 356 ms returned sat
[2024-05-30 19:28:35] [INFO ] [Real]Added 147 Read/Feed constraints in 89 ms returned sat
[2024-05-30 19:28:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 19:28:35] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-30 19:28:35] [INFO ] [Nat]Absence check using state equation in 342 ms returned sat
[2024-05-30 19:28:37] [INFO ] [Nat]Added 147 Read/Feed constraints in 1717 ms returned sat
[2024-05-30 19:28:38] [INFO ] Deduced a trap composed of 138 places in 357 ms of which 5 ms to minimize.
[2024-05-30 19:28:38] [INFO ] Deduced a trap composed of 137 places in 356 ms of which 2 ms to minimize.
[2024-05-30 19:28:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 890 ms
[2024-05-30 19:28:39] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2593 transitions) in 801 ms.
[2024-05-30 19:28:39] [INFO ] Added : 0 causal constraints over 0 iterations in 960 ms. Result :sat
Minimization took 4904 ms.
[2024-05-30 19:28:44] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-30 19:28:44] [INFO ] [Real]Absence check using state equation in 391 ms returned sat
[2024-05-30 19:28:44] [INFO ] [Real]Added 147 Read/Feed constraints in 90 ms returned sat
[2024-05-30 19:28:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 19:28:45] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-30 19:28:45] [INFO ] [Nat]Absence check using state equation in 371 ms returned sat
[2024-05-30 19:28:45] [INFO ] [Nat]Added 147 Read/Feed constraints in 435 ms returned sat
[2024-05-30 19:28:46] [INFO ] Deduced a trap composed of 78 places in 525 ms of which 2 ms to minimize.
[2024-05-30 19:28:47] [INFO ] Deduced a trap composed of 129 places in 499 ms of which 3 ms to minimize.
[2024-05-30 19:28:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1194 ms
[2024-05-30 19:28:47] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2593 transitions) in 321 ms.
[2024-05-30 19:28:47] [INFO ] Added : 0 causal constraints over 0 iterations in 494 ms. Result :sat
Minimization took 5221 ms.
[2024-05-30 19:28:52] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-30 19:28:53] [INFO ] [Real]Absence check using state equation in 409 ms returned sat
[2024-05-30 19:28:53] [INFO ] [Real]Added 147 Read/Feed constraints in 75 ms returned sat
[2024-05-30 19:28:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 19:28:53] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-30 19:28:53] [INFO ] [Nat]Absence check using state equation in 385 ms returned sat
[2024-05-30 19:28:56] [INFO ] [Nat]Added 147 Read/Feed constraints in 2293 ms returned sat
[2024-05-30 19:28:56] [INFO ] Deduced a trap composed of 137 places in 377 ms of which 2 ms to minimize.
[2024-05-30 19:28:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 492 ms
[2024-05-30 19:28:56] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2593 transitions) in 310 ms.
[2024-05-30 19:28:57] [INFO ] Added : 0 causal constraints over 0 iterations in 466 ms. Result :sat
Minimization took 5069 ms.
[2024-05-30 19:29:02] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-30 19:29:02] [INFO ] [Real]Absence check using state equation in 350 ms returned sat
[2024-05-30 19:29:02] [INFO ] [Real]Added 147 Read/Feed constraints in 86 ms returned sat
[2024-05-30 19:29:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 19:29:02] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-30 19:29:03] [INFO ] [Nat]Absence check using state equation in 393 ms returned sat
[2024-05-30 19:29:05] [INFO ] [Nat]Added 147 Read/Feed constraints in 1903 ms returned sat
[2024-05-30 19:29:05] [INFO ] Deduced a trap composed of 137 places in 512 ms of which 2 ms to minimize.
[2024-05-30 19:29:06] [INFO ] Deduced a trap composed of 129 places in 517 ms of which 2 ms to minimize.
[2024-05-30 19:29:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1242 ms
[2024-05-30 19:29:06] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2593 transitions) in 302 ms.
[2024-05-30 19:29:06] [INFO ] Added : 0 causal constraints over 0 iterations in 472 ms. Result :sat
Minimization took 4984 ms.
[2024-05-30 19:29:11] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-30 19:29:12] [INFO ] [Real]Absence check using state equation in 350 ms returned sat
[2024-05-30 19:29:12] [INFO ] [Real]Added 147 Read/Feed constraints in 155 ms returned sat
[2024-05-30 19:29:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 19:29:12] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-30 19:29:12] [INFO ] [Nat]Absence check using state equation in 358 ms returned sat
[2024-05-30 19:29:14] [INFO ] [Nat]Added 147 Read/Feed constraints in 1642 ms returned sat
[2024-05-30 19:29:15] [INFO ] Deduced a trap composed of 135 places in 512 ms of which 2 ms to minimize.
[2024-05-30 19:29:15] [INFO ] Deduced a trap composed of 136 places in 555 ms of which 2 ms to minimize.
[2024-05-30 19:29:16] [INFO ] Deduced a trap composed of 132 places in 508 ms of which 2 ms to minimize.
[2024-05-30 19:29:16] [INFO ] Deduced a trap composed of 137 places in 510 ms of which 2 ms to minimize.
[2024-05-30 19:29:17] [INFO ] Deduced a trap composed of 132 places in 564 ms of which 2 ms to minimize.
[2024-05-30 19:29:17] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 3089 ms
[2024-05-30 19:29:17] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2593 transitions) in 322 ms.
[2024-05-30 19:29:18] [INFO ] Added : 0 causal constraints over 0 iterations in 473 ms. Result :sat
Minimization took 4968 ms.
[2024-05-30 19:29:23] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-30 19:29:23] [INFO ] [Real]Absence check using state equation in 364 ms returned sat
[2024-05-30 19:29:23] [INFO ] [Real]Added 147 Read/Feed constraints in 77 ms returned sat
[2024-05-30 19:29:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 19:29:23] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-30 19:29:24] [INFO ] [Nat]Absence check using state equation in 356 ms returned sat
[2024-05-30 19:29:25] [INFO ] [Nat]Added 147 Read/Feed constraints in 1028 ms returned sat
[2024-05-30 19:29:25] [INFO ] Deduced a trap composed of 111 places in 523 ms of which 2 ms to minimize.
[2024-05-30 19:29:26] [INFO ] Deduced a trap composed of 78 places in 509 ms of which 2 ms to minimize.
[2024-05-30 19:29:26] [INFO ] Deduced a trap composed of 84 places in 499 ms of which 2 ms to minimize.
[2024-05-30 19:29:27] [INFO ] Deduced a trap composed of 140 places in 493 ms of which 2 ms to minimize.
[2024-05-30 19:29:27] [INFO ] Deduced a trap composed of 135 places in 512 ms of which 2 ms to minimize.
[2024-05-30 19:29:28] [INFO ] Deduced a trap composed of 132 places in 509 ms of which 4 ms to minimize.
[2024-05-30 19:29:28] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 3714 ms
[2024-05-30 19:29:29] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2593 transitions) in 300 ms.
[2024-05-30 19:29:29] [INFO ] Added : 0 causal constraints over 0 iterations in 459 ms. Result :sat
Minimization took 4964 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[4, 0, 0, 0, 0, 0, 0] Max Struct:[5, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4, 0, 0, 0, 0, 0, 0] Max Struct:[5, 1, 1, 1, 1, 1, 1]
Support contains 7 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 295 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 296 ms. Remains : 305/305 places, 7808/7808 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 308 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
[2024-05-30 19:29:34] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-05-30 19:29:34] [INFO ] Invariant cache hit.
[2024-05-30 19:29:35] [INFO ] Implicit Places using invariants in 585 ms returned []
[2024-05-30 19:29:35] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-05-30 19:29:35] [INFO ] Invariant cache hit.
[2024-05-30 19:29:35] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-30 19:30:02] [INFO ] Implicit Places using invariants and state equation in 27495 ms returned []
Implicit Place search using SMT with State Equation took 28082 ms to find 0 implicit places.
[2024-05-30 19:30:03] [INFO ] Redundant transitions in 929 ms returned []
Running 7806 sub problems to find dead transitions.
[2024-05-30 19:30:03] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-05-30 19:30:03] [INFO ] Invariant cache hit.
[2024-05-30 19:30:04] [INFO ] State equation strengthened by 147 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 7806 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 305/2909 variables, and 3 constraints, problems are : Problem set: 0 solved, 7806 unsolved in 30212 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/305 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 7806/7806 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7806 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 7806 unsolved
[2024-05-30 19:31:05] [INFO ] Deduced a trap composed of 138 places in 428 ms of which 3 ms to minimize.
[2024-05-30 19:31:07] [INFO ] Deduced a trap composed of 31 places in 462 ms of which 2 ms to minimize.
[2024-05-30 19:31:07] [INFO ] Deduced a trap composed of 106 places in 418 ms of which 2 ms to minimize.
[2024-05-30 19:31:08] [INFO ] Deduced a trap composed of 104 places in 439 ms of which 2 ms to minimize.
[2024-05-30 19:31:08] [INFO ] Deduced a trap composed of 37 places in 387 ms of which 1 ms to minimize.
[2024-05-30 19:31:08] [INFO ] Deduced a trap composed of 59 places in 386 ms of which 2 ms to minimize.
[2024-05-30 19:31:09] [INFO ] Deduced a trap composed of 42 places in 389 ms of which 2 ms to minimize.
[2024-05-30 19:31:09] [INFO ] Deduced a trap composed of 50 places in 358 ms of which 2 ms to minimize.
[2024-05-30 19:31:10] [INFO ] Deduced a trap composed of 42 places in 367 ms of which 2 ms to minimize.
[2024-05-30 19:31:10] [INFO ] Deduced a trap composed of 47 places in 359 ms of which 2 ms to minimize.
[2024-05-30 19:31:10] [INFO ] Deduced a trap composed of 62 places in 454 ms of which 2 ms to minimize.
[2024-05-30 19:31:11] [INFO ] Deduced a trap composed of 78 places in 461 ms of which 2 ms to minimize.
[2024-05-30 19:31:11] [INFO ] Deduced a trap composed of 48 places in 432 ms of which 5 ms to minimize.
[2024-05-30 19:31:12] [INFO ] Deduced a trap composed of 75 places in 359 ms of which 2 ms to minimize.
[2024-05-30 19:31:12] [INFO ] Deduced a trap composed of 42 places in 315 ms of which 2 ms to minimize.
[2024-05-30 19:31:12] [INFO ] Deduced a trap composed of 47 places in 268 ms of which 2 ms to minimize.
[2024-05-30 19:31:13] [INFO ] Deduced a trap composed of 50 places in 461 ms of which 2 ms to minimize.
[2024-05-30 19:31:13] [INFO ] Deduced a trap composed of 97 places in 466 ms of which 2 ms to minimize.
[2024-05-30 19:31:14] [INFO ] Deduced a trap composed of 64 places in 389 ms of which 2 ms to minimize.
[2024-05-30 19:31:14] [INFO ] Deduced a trap composed of 72 places in 429 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/305 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 7806 unsolved
[2024-05-30 19:31:19] [INFO ] Deduced a trap composed of 44 places in 447 ms of which 2 ms to minimize.
[2024-05-30 19:31:19] [INFO ] Deduced a trap composed of 57 places in 425 ms of which 2 ms to minimize.
[2024-05-30 19:31:20] [INFO ] Deduced a trap composed of 57 places in 435 ms of which 2 ms to minimize.
[2024-05-30 19:31:20] [INFO ] Deduced a trap composed of 72 places in 376 ms of which 2 ms to minimize.
[2024-05-30 19:31:21] [INFO ] Deduced a trap composed of 115 places in 447 ms of which 2 ms to minimize.
[2024-05-30 19:31:21] [INFO ] Deduced a trap composed of 114 places in 441 ms of which 2 ms to minimize.
[2024-05-30 19:31:22] [INFO ] Deduced a trap composed of 101 places in 400 ms of which 2 ms to minimize.
[2024-05-30 19:31:22] [INFO ] Deduced a trap composed of 114 places in 418 ms of which 2 ms to minimize.
[2024-05-30 19:31:22] [INFO ] Deduced a trap composed of 113 places in 428 ms of which 2 ms to minimize.
[2024-05-30 19:31:24] [INFO ] Deduced a trap composed of 125 places in 448 ms of which 1 ms to minimize.
[2024-05-30 19:31:24] [INFO ] Deduced a trap composed of 58 places in 423 ms of which 2 ms to minimize.
[2024-05-30 19:31:30] [INFO ] Deduced a trap composed of 86 places in 385 ms of which 2 ms to minimize.
[2024-05-30 19:31:30] [INFO ] Deduced a trap composed of 78 places in 299 ms of which 2 ms to minimize.
[2024-05-30 19:31:31] [INFO ] Deduced a trap composed of 120 places in 421 ms of which 4 ms to minimize.
[2024-05-30 19:31:31] [INFO ] Deduced a trap composed of 134 places in 261 ms of which 1 ms to minimize.
SMT process timed out in 87720ms, After SMT, problems are : Problem set: 0 solved, 7806 unsolved
Search for dead transitions found 0 dead transitions in 87805ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 117175 ms. Remains : 305/305 places, 7808/7808 transitions.
RANDOM walk for 40009 steps (8 resets) in 717 ms. (55 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 249 ms. (160 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (8 resets) in 122 ms. (325 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 146 ms. (272 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (8 resets) in 253 ms. (157 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (8 resets) in 93 ms. (425 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (8 resets) in 94 ms. (421 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 87 ms. (454 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 214 ms. (186 steps per ms) remains 12/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 123 ms. (322 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 115 ms. (344 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 98 ms. (404 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 63 ms. (625 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 97 ms. (408 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 83 ms. (476 steps per ms) remains 12/12 properties
[2024-05-30 19:31:32] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-05-30 19:31:32] [INFO ] Invariant cache hit.
[2024-05-30 19:31:32] [INFO ] State equation strengthened by 147 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 280/286 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-30 19:31:33] [INFO ] Deduced a trap composed of 75 places in 409 ms of which 2 ms to minimize.
Problem MAX0 is UNSAT
Problem MIN0 is UNSAT
[2024-05-30 19:31:33] [INFO ] Deduced a trap composed of 132 places in 387 ms of which 2 ms to minimize.
[2024-05-30 19:31:34] [INFO ] Deduced a trap composed of 137 places in 458 ms of which 2 ms to minimize.
[2024-05-30 19:31:34] [INFO ] Deduced a trap composed of 131 places in 451 ms of which 2 ms to minimize.
[2024-05-30 19:31:34] [INFO ] Deduced a trap composed of 130 places in 453 ms of which 2 ms to minimize.
[2024-05-30 19:31:35] [INFO ] Deduced a trap composed of 131 places in 447 ms of which 2 ms to minimize.
[2024-05-30 19:31:35] [INFO ] Deduced a trap composed of 134 places in 381 ms of which 2 ms to minimize.
[2024-05-30 19:31:36] [INFO ] Deduced a trap composed of 195 places in 367 ms of which 2 ms to minimize.
[2024-05-30 19:31:36] [INFO ] Deduced a trap composed of 74 places in 415 ms of which 2 ms to minimize.
[2024-05-30 19:31:37] [INFO ] Deduced a trap composed of 138 places in 402 ms of which 2 ms to minimize.
[2024-05-30 19:31:37] [INFO ] Deduced a trap composed of 74 places in 339 ms of which 2 ms to minimize.
[2024-05-30 19:31:37] [INFO ] Deduced a trap composed of 58 places in 311 ms of which 3 ms to minimize.
SMT process timed out in 5097ms, After SMT, problems are : Problem set: 0 solved, 12 unsolved
Fused 12 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 212 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 213 ms. Remains : 305/305 places, 7808/7808 transitions.
RANDOM walk for 40006 steps (8 resets) in 170 ms. (233 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 69 ms. (571 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 57 ms. (689 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 54 ms. (727 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 66 ms. (597 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 71 ms. (555 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 78 ms. (506 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 88 ms. (449 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 59 ms. (666 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 63 ms. (625 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 63 ms. (625 steps per ms) remains 10/10 properties
Interrupted probabilistic random walk after 136961 steps, run timeout after 3001 ms. (steps per millisecond=45 ) properties seen :0 out of 10
Probabilistic random walk after 136961 steps, saw 54220 distinct states, run finished after 3004 ms. (steps per millisecond=45 ) properties seen :0
[2024-05-30 19:31:41] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-05-30 19:31:41] [INFO ] Invariant cache hit.
[2024-05-30 19:31:41] [INFO ] State equation strengthened by 147 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 251/256 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 30/286 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-30 19:31:42] [INFO ] Deduced a trap composed of 72 places in 455 ms of which 2 ms to minimize.
[2024-05-30 19:31:42] [INFO ] Deduced a trap composed of 101 places in 407 ms of which 2 ms to minimize.
[2024-05-30 19:31:42] [INFO ] Deduced a trap composed of 131 places in 403 ms of which 2 ms to minimize.
[2024-05-30 19:31:43] [INFO ] Deduced a trap composed of 74 places in 412 ms of which 2 ms to minimize.
[2024-05-30 19:31:43] [INFO ] Deduced a trap composed of 134 places in 384 ms of which 2 ms to minimize.
[2024-05-30 19:31:44] [INFO ] Deduced a trap composed of 134 places in 375 ms of which 2 ms to minimize.
[2024-05-30 19:31:44] [INFO ] Deduced a trap composed of 103 places in 388 ms of which 1 ms to minimize.
[2024-05-30 19:31:44] [INFO ] Deduced a trap composed of 195 places in 385 ms of which 2 ms to minimize.
[2024-05-30 19:31:45] [INFO ] Deduced a trap composed of 132 places in 396 ms of which 2 ms to minimize.
[2024-05-30 19:31:45] [INFO ] Deduced a trap composed of 45 places in 431 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 19/305 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/305 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 2604/2909 variables, 305/318 constraints. Problems are: Problem set: 0 solved, 10 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/2909 variables, 147/465 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2909 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (OVERLAPS) 0/2909 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2909/2909 variables, and 465 constraints, problems are : Problem set: 0 solved, 10 unsolved in 17538 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 251/256 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 30/286 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-30 19:31:59] [INFO ] Deduced a trap composed of 131 places in 394 ms of which 2 ms to minimize.
[2024-05-30 19:31:59] [INFO ] Deduced a trap composed of 140 places in 214 ms of which 1 ms to minimize.
[2024-05-30 19:32:00] [INFO ] Deduced a trap composed of 138 places in 358 ms of which 2 ms to minimize.
[2024-05-30 19:32:00] [INFO ] Deduced a trap composed of 59 places in 322 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/286 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 19/305 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/305 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 2604/2909 variables, 305/322 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2909 variables, 147/469 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2909 variables, 10/479 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2909 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (OVERLAPS) 0/2909 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2909/2909 variables, and 479 constraints, problems are : Problem set: 0 solved, 10 unsolved in 9078 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 14/14 constraints]
After SMT, in 26645ms problems are : Problem set: 0 solved, 10 unsolved
Fused 10 Parikh solutions to 5 different solutions.
Parikh walk visited 4 properties in 1498 ms.
Support contains 3 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 188 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 188 ms. Remains : 305/305 places, 7808/7808 transitions.
RANDOM walk for 40005 steps (8 resets) in 154 ms. (258 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 56 ms. (701 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 57 ms. (689 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 51 ms. (769 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (8 resets) in 49 ms. (800 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (8 resets) in 53 ms. (740 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 50 ms. (784 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 144497 steps, run timeout after 3001 ms. (steps per millisecond=48 ) properties seen :0 out of 6
Probabilistic random walk after 144497 steps, saw 55316 distinct states, run finished after 3001 ms. (steps per millisecond=48 ) properties seen :0
[2024-05-30 19:32:12] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-05-30 19:32:12] [INFO ] Invariant cache hit.
[2024-05-30 19:32:12] [INFO ] State equation strengthened by 147 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 253/256 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 30/286 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-30 19:32:13] [INFO ] Deduced a trap composed of 48 places in 419 ms of which 2 ms to minimize.
[2024-05-30 19:32:13] [INFO ] Deduced a trap composed of 75 places in 455 ms of which 2 ms to minimize.
[2024-05-30 19:32:14] [INFO ] Deduced a trap composed of 57 places in 403 ms of which 2 ms to minimize.
[2024-05-30 19:32:14] [INFO ] Deduced a trap composed of 72 places in 388 ms of which 2 ms to minimize.
[2024-05-30 19:32:15] [INFO ] Deduced a trap composed of 131 places in 430 ms of which 2 ms to minimize.
[2024-05-30 19:32:15] [INFO ] Deduced a trap composed of 130 places in 442 ms of which 2 ms to minimize.
[2024-05-30 19:32:16] [INFO ] Deduced a trap composed of 88 places in 460 ms of which 2 ms to minimize.
[2024-05-30 19:32:16] [INFO ] Deduced a trap composed of 145 places in 442 ms of which 2 ms to minimize.
[2024-05-30 19:32:16] [INFO ] Deduced a trap composed of 134 places in 390 ms of which 2 ms to minimize.
[2024-05-30 19:32:17] [INFO ] Deduced a trap composed of 133 places in 380 ms of which 2 ms to minimize.
[2024-05-30 19:32:17] [INFO ] Deduced a trap composed of 129 places in 395 ms of which 2 ms to minimize.
[2024-05-30 19:32:18] [INFO ] Deduced a trap composed of 79 places in 294 ms of which 2 ms to minimize.
[2024-05-30 19:32:18] [INFO ] Deduced a trap composed of 103 places in 275 ms of which 2 ms to minimize.
[2024-05-30 19:32:18] [INFO ] Deduced a trap composed of 78 places in 262 ms of which 1 ms to minimize.
[2024-05-30 19:32:19] [INFO ] Deduced a trap composed of 138 places in 393 ms of which 2 ms to minimize.
[2024-05-30 19:32:19] [INFO ] Deduced a trap composed of 66 places in 386 ms of which 2 ms to minimize.
[2024-05-30 19:32:19] [INFO ] Deduced a trap composed of 64 places in 347 ms of which 2 ms to minimize.
[2024-05-30 19:32:20] [INFO ] Deduced a trap composed of 108 places in 309 ms of which 2 ms to minimize.
[2024-05-30 19:32:20] [INFO ] Deduced a trap composed of 137 places in 214 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 19/21 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 19/305 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/305 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 2604/2909 variables, 305/327 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2909 variables, 147/474 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2909 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 0/2909 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2909/2909 variables, and 474 constraints, problems are : Problem set: 0 solved, 6 unsolved in 13584 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 253/256 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 30/286 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 19/21 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-30 19:32:26] [INFO ] Deduced a trap composed of 103 places in 324 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/286 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 19/305 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/305 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 2604/2909 variables, 305/328 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2909 variables, 147/475 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2909 variables, 6/481 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2909 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 0/2909 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2909/2909 variables, and 481 constraints, problems are : Problem set: 0 solved, 6 unsolved in 7378 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 20/20 constraints]
After SMT, in 21001ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 3 different solutions.
Parikh walk visited 2 properties in 634 ms.
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 186 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 187 ms. Remains : 305/305 places, 7808/7808 transitions.
RANDOM walk for 40004 steps (8 resets) in 138 ms. (287 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 81 ms. (487 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 70 ms. (563 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 232 ms. (171 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 58 ms. (678 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 152805 steps, run timeout after 3001 ms. (steps per millisecond=50 ) properties seen :0 out of 4
Probabilistic random walk after 152805 steps, saw 56694 distinct states, run finished after 3001 ms. (steps per millisecond=50 ) properties seen :0
[2024-05-30 19:32:37] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-05-30 19:32:37] [INFO ] Invariant cache hit.
[2024-05-30 19:32:37] [INFO ] State equation strengthened by 147 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 254/256 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 30/286 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-30 19:32:38] [INFO ] Deduced a trap composed of 48 places in 423 ms of which 2 ms to minimize.
[2024-05-30 19:32:38] [INFO ] Deduced a trap composed of 72 places in 408 ms of which 2 ms to minimize.
[2024-05-30 19:32:39] [INFO ] Deduced a trap composed of 75 places in 399 ms of which 1 ms to minimize.
[2024-05-30 19:32:39] [INFO ] Deduced a trap composed of 131 places in 411 ms of which 2 ms to minimize.
[2024-05-30 19:32:40] [INFO ] Deduced a trap composed of 78 places in 410 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 19/305 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/305 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 2604/2909 variables, 305/313 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2909 variables, 147/460 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2909 variables, 0/460 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 0/2909 variables, 0/460 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2909/2909 variables, and 460 constraints, problems are : Problem set: 0 solved, 4 unsolved in 4421 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 254/256 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 30/286 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-30 19:32:42] [INFO ] Deduced a trap composed of 129 places in 403 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/286 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 19/305 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/305 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 2604/2909 variables, 305/314 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2909 variables, 147/461 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2909 variables, 4/465 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2909 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/2909 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2909/2909 variables, and 465 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2959 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 6/6 constraints]
After SMT, in 7404ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 2 properties in 356 ms.
Support contains 1 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 182 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 182 ms. Remains : 305/305 places, 7808/7808 transitions.
RANDOM walk for 40005 steps (8 resets) in 147 ms. (270 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 44 ms. (888 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 64 ms. (615 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 164570 steps, run timeout after 3001 ms. (steps per millisecond=54 ) properties seen :0 out of 2
Probabilistic random walk after 164570 steps, saw 58407 distinct states, run finished after 3001 ms. (steps per millisecond=54 ) properties seen :0
[2024-05-30 19:32:48] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-05-30 19:32:48] [INFO ] Invariant cache hit.
[2024-05-30 19:32:48] [INFO ] State equation strengthened by 147 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 255/256 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 30/286 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-30 19:32:49] [INFO ] Deduced a trap composed of 129 places in 423 ms of which 2 ms to minimize.
[2024-05-30 19:32:49] [INFO ] Deduced a trap composed of 129 places in 413 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 19/305 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/305 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 2604/2909 variables, 305/310 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2909 variables, 147/457 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-30 19:32:51] [INFO ] Deduced a trap composed of 50 places in 518 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/2909 variables, 1/458 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2909 variables, 0/458 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/2909 variables, 0/458 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2909/2909 variables, and 458 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2892 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 255/256 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 30/286 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-30 19:32:52] [INFO ] Deduced a trap composed of 137 places in 353 ms of which 2 ms to minimize.
[2024-05-30 19:32:52] [INFO ] Deduced a trap composed of 59 places in 341 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/286 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 19/305 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/305 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 2604/2909 variables, 305/313 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2909 variables, 147/460 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2909 variables, 2/462 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2909 variables, 0/462 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/2909 variables, 0/462 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2909/2909 variables, and 462 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2585 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 5/5 constraints]
After SMT, in 5501ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 102 ms.
Support contains 1 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 178 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 180 ms. Remains : 305/305 places, 7808/7808 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 189 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
[2024-05-30 19:32:54] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-05-30 19:32:54] [INFO ] Invariant cache hit.
[2024-05-30 19:32:55] [INFO ] Implicit Places using invariants in 568 ms returned []
[2024-05-30 19:32:55] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-05-30 19:32:55] [INFO ] Invariant cache hit.
[2024-05-30 19:32:55] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-30 19:33:22] [INFO ] Implicit Places using invariants and state equation in 26604 ms returned []
Implicit Place search using SMT with State Equation took 27174 ms to find 0 implicit places.
[2024-05-30 19:33:22] [INFO ] Redundant transitions in 768 ms returned []
Running 7806 sub problems to find dead transitions.
[2024-05-30 19:33:22] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-05-30 19:33:22] [INFO ] Invariant cache hit.
[2024-05-30 19:33:22] [INFO ] State equation strengthened by 147 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 7806 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 305/2909 variables, and 3 constraints, problems are : Problem set: 0 solved, 7806 unsolved in 30113 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/305 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 7806/7806 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7806 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 7806 unsolved
[2024-05-30 19:34:24] [INFO ] Deduced a trap composed of 138 places in 447 ms of which 2 ms to minimize.
[2024-05-30 19:34:26] [INFO ] Deduced a trap composed of 31 places in 445 ms of which 3 ms to minimize.
[2024-05-30 19:34:26] [INFO ] Deduced a trap composed of 106 places in 421 ms of which 2 ms to minimize.
[2024-05-30 19:34:27] [INFO ] Deduced a trap composed of 104 places in 454 ms of which 2 ms to minimize.
[2024-05-30 19:34:27] [INFO ] Deduced a trap composed of 37 places in 343 ms of which 2 ms to minimize.
[2024-05-30 19:34:28] [INFO ] Deduced a trap composed of 59 places in 388 ms of which 2 ms to minimize.
[2024-05-30 19:34:28] [INFO ] Deduced a trap composed of 42 places in 354 ms of which 2 ms to minimize.
[2024-05-30 19:34:28] [INFO ] Deduced a trap composed of 50 places in 327 ms of which 2 ms to minimize.
[2024-05-30 19:34:29] [INFO ] Deduced a trap composed of 42 places in 348 ms of which 1 ms to minimize.
[2024-05-30 19:34:29] [INFO ] Deduced a trap composed of 47 places in 315 ms of which 2 ms to minimize.
[2024-05-30 19:34:30] [INFO ] Deduced a trap composed of 62 places in 441 ms of which 2 ms to minimize.
[2024-05-30 19:34:30] [INFO ] Deduced a trap composed of 78 places in 438 ms of which 2 ms to minimize.
[2024-05-30 19:34:30] [INFO ] Deduced a trap composed of 48 places in 397 ms of which 2 ms to minimize.
[2024-05-30 19:34:31] [INFO ] Deduced a trap composed of 75 places in 365 ms of which 2 ms to minimize.
[2024-05-30 19:34:31] [INFO ] Deduced a trap composed of 42 places in 288 ms of which 2 ms to minimize.
[2024-05-30 19:34:31] [INFO ] Deduced a trap composed of 47 places in 279 ms of which 2 ms to minimize.
[2024-05-30 19:34:32] [INFO ] Deduced a trap composed of 50 places in 427 ms of which 2 ms to minimize.
[2024-05-30 19:34:32] [INFO ] Deduced a trap composed of 97 places in 410 ms of which 2 ms to minimize.
[2024-05-30 19:34:33] [INFO ] Deduced a trap composed of 64 places in 323 ms of which 2 ms to minimize.
[2024-05-30 19:34:33] [INFO ] Deduced a trap composed of 72 places in 393 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/305 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 7806 unsolved
[2024-05-30 19:34:38] [INFO ] Deduced a trap composed of 44 places in 412 ms of which 1 ms to minimize.
[2024-05-30 19:34:38] [INFO ] Deduced a trap composed of 57 places in 393 ms of which 2 ms to minimize.
[2024-05-30 19:34:39] [INFO ] Deduced a trap composed of 57 places in 391 ms of which 2 ms to minimize.
[2024-05-30 19:34:39] [INFO ] Deduced a trap composed of 72 places in 380 ms of which 2 ms to minimize.
[2024-05-30 19:34:39] [INFO ] Deduced a trap composed of 115 places in 433 ms of which 2 ms to minimize.
[2024-05-30 19:34:40] [INFO ] Deduced a trap composed of 114 places in 410 ms of which 2 ms to minimize.
[2024-05-30 19:34:40] [INFO ] Deduced a trap composed of 101 places in 375 ms of which 2 ms to minimize.
[2024-05-30 19:34:41] [INFO ] Deduced a trap composed of 114 places in 397 ms of which 1 ms to minimize.
[2024-05-30 19:34:41] [INFO ] Deduced a trap composed of 113 places in 385 ms of which 4 ms to minimize.
[2024-05-30 19:34:42] [INFO ] Deduced a trap composed of 125 places in 471 ms of which 2 ms to minimize.
[2024-05-30 19:34:43] [INFO ] Deduced a trap composed of 58 places in 387 ms of which 2 ms to minimize.
[2024-05-30 19:34:49] [INFO ] Deduced a trap composed of 86 places in 405 ms of which 2 ms to minimize.
[2024-05-30 19:34:49] [INFO ] Deduced a trap composed of 78 places in 307 ms of which 1 ms to minimize.
[2024-05-30 19:34:49] [INFO ] Deduced a trap composed of 120 places in 421 ms of which 2 ms to minimize.
[2024-05-30 19:34:50] [INFO ] Deduced a trap composed of 134 places in 260 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 305/2909 variables, and 38 constraints, problems are : Problem set: 0 solved, 7806 unsolved in 30111 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/305 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 0/7806 constraints, Known Traps: 35/35 constraints]
After SMT, in 88116ms problems are : Problem set: 0 solved, 7806 unsolved
Search for dead transitions found 0 dead transitions in 88182ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 116353 ms. Remains : 305/305 places, 7808/7808 transitions.
FORMULA Szymanski-PT-b04-UpperBounds-14 1 TECHNIQUES REACHABILITY_MAX
FORMULA Szymanski-PT-b04-UpperBounds-09 1 TECHNIQUES REACHABILITY_MAX
FORMULA Szymanski-PT-b04-UpperBounds-07 1 TECHNIQUES REACHABILITY_MAX
FORMULA Szymanski-PT-b04-UpperBounds-05 1 TECHNIQUES REACHABILITY_MAX
FORMULA Szymanski-PT-b04-UpperBounds-02 1 TECHNIQUES REACHABILITY_MAX
FORMULA Szymanski-PT-b04-UpperBounds-00 4 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 6 queries.) : Max Seen:[0] Max Struct:[1]
Starting property specific reduction for Szymanski-PT-b04-UpperBounds-15
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1]
[2024-05-30 19:34:51] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-05-30 19:34:51] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10003 steps (2 resets) in 20 ms. (476 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 10 ms. (909 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-30 19:34:51] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-05-30 19:34:51] [INFO ] Invariant cache hit.
[2024-05-30 19:34:51] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-30 19:34:51] [INFO ] [Real]Absence check using state equation in 398 ms returned sat
[2024-05-30 19:34:51] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-30 19:34:51] [INFO ] [Real]Added 147 Read/Feed constraints in 74 ms returned sat
[2024-05-30 19:34:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 19:34:51] [INFO ] [Nat]Absence check using 3 positive place invariants in 8 ms returned sat
[2024-05-30 19:34:52] [INFO ] [Nat]Absence check using state equation in 357 ms returned sat
[2024-05-30 19:34:52] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-30 19:34:53] [INFO ] [Nat]Added 147 Read/Feed constraints in 1052 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 305 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p165) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7807/7807 transitions.
Applied a total of 0 rules in 181 ms. Remains 305 /305 variables (removed 0) and now considering 7807/7807 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 182 ms. Remains : 305/305 places, 7807/7807 transitions.
[2024-05-30 19:34:53] [INFO ] Flow matrix only has 2603 transitions (discarded 5204 similar events)
// Phase 1: matrix 2603 rows 305 cols
[2024-05-30 19:34:53] [INFO ] Computed 3 invariants in 16 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (2 resets) in 1410 ms. (708 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 804 ms. (1242 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-30 19:34:55] [INFO ] Flow matrix only has 2603 transitions (discarded 5204 similar events)
[2024-05-30 19:34:55] [INFO ] Invariant cache hit.
[2024-05-30 19:34:55] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-30 19:34:56] [INFO ] [Real]Absence check using state equation in 365 ms returned sat
[2024-05-30 19:34:56] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-30 19:34:56] [INFO ] [Real]Added 147 Read/Feed constraints in 59 ms returned sat
[2024-05-30 19:34:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 19:34:56] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-30 19:34:56] [INFO ] [Nat]Absence check using state equation in 364 ms returned sat
[2024-05-30 19:34:58] [INFO ] [Nat]Added 147 Read/Feed constraints in 2020 ms returned sat
[2024-05-30 19:34:59] [INFO ] Deduced a trap composed of 78 places in 554 ms of which 2 ms to minimize.
[2024-05-30 19:34:59] [INFO ] Deduced a trap composed of 138 places in 507 ms of which 2 ms to minimize.
[2024-05-30 19:35:00] [INFO ] Deduced a trap composed of 137 places in 506 ms of which 2 ms to minimize.
[2024-05-30 19:35:00] [INFO ] Deduced a trap composed of 134 places in 525 ms of which 2 ms to minimize.
[2024-05-30 19:35:01] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2399 ms
[2024-05-30 19:35:01] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2592 transitions) in 300 ms.
[2024-05-30 19:35:01] [INFO ] Added : 0 causal constraints over 0 iterations in 450 ms. Result :sat
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running Szymanski-PT-b04
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 568
TRANSITIONS: 8320
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.173s, Sys 0.018s]
SAVING FILE /home/mcc/execution/model (.net / .def) ...
EXPORT TIME: [User 0.026s, Sys 0.000s]
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES
Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net
Process ID: 1185
MODEL NAME: /home/mcc/execution/model
568 places, 8320 transitions.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory
MEDDLY ERROR: Insufficient memory
MEDDLY ERROR: Insufficient memory
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="Szymanski-PT-b04"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is Szymanski-PT-b04, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r399-tall-171690531300869"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Szymanski-PT-b04.tgz
mv Szymanski-PT-b04 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "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 [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "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 "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.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 [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
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 ;