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.r003-smll-171620117500359.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 Anderson-PT-09, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r003-smll-171620117500359
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 71K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 15:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 19 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 17:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 15:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 155K Apr 12 15:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Apr 12 15:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 41K Apr 12 15:40 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:27 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 927K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716445754073

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Anderson-PT-09
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 06:29:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-23 06:29:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 06:29:17] [INFO ] Load time of PNML (sax parser for PT used): 467 ms
[2024-05-23 06:29:17] [INFO ] Transformed 505 places.
[2024-05-23 06:29:17] [INFO ] Transformed 1845 transitions.
[2024-05-23 06:29:17] [INFO ] Found NUPN structural information;
[2024-05-23 06:29:17] [INFO ] Parsed PT model containing 505 places and 1845 transitions and 7092 arcs in 874 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 28 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (8 resets) in 3636 ms. (10 steps per ms) remains 11/16 properties
FORMULA Anderson-PT-09-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Anderson-PT-09-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Anderson-PT-09-ReachabilityFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Anderson-PT-09-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Anderson-PT-09-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 498 ms. (80 steps per ms) remains 8/11 properties
FORMULA Anderson-PT-09-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Anderson-PT-09-ReachabilityFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Anderson-PT-09-ReachabilityFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 990 ms. (40 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (8 resets) in 235 ms. (169 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (8 resets) in 409 ms. (97 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 205 ms. (194 steps per ms) remains 6/8 properties
FORMULA Anderson-PT-09-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Anderson-PT-09-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 263 ms. (151 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 292 ms. (136 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 113 ms. (350 steps per ms) remains 5/6 properties
FORMULA Anderson-PT-09-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 1845 rows 505 cols
[2024-05-23 06:29:20] [INFO ] Computed 21 invariants in 83 ms
[2024-05-23 06:29:20] [INFO ] State equation strengthened by 72 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 444/501 variables, 10/67 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/501 variables, 444/511 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/501 variables, 5/516 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/501 variables, 0/516 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 4/505 variables, 6/522 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/505 variables, 4/526 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/505 variables, 0/526 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 1845/2350 variables, 505/1031 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2350 variables, 72/1103 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2350 variables, 0/1103 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 0/2350 variables, 0/1103 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2350/2350 variables, and 1103 constraints, problems are : Problem set: 0 solved, 5 unsolved in 2366 ms.
Refiners :[Domain max(s): 505/505 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 505/505 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 5/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 444/501 variables, 10/67 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/501 variables, 444/511 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/501 variables, 5/516 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/501 variables, 0/516 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem Anderson-PT-09-ReachabilityFireability-2024-01 is UNSAT
FORMULA Anderson-PT-09-ReachabilityFireability-2024-01 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 6 (OVERLAPS) 4/505 variables, 6/522 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/505 variables, 4/526 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-05-23 06:29:24] [INFO ] Deduced a trap composed of 109 places in 949 ms of which 88 ms to minimize.
[2024-05-23 06:29:25] [INFO ] Deduced a trap composed of 150 places in 915 ms of which 10 ms to minimize.
[2024-05-23 06:29:26] [INFO ] Deduced a trap composed of 140 places in 978 ms of which 9 ms to minimize.
[2024-05-23 06:29:27] [INFO ] Deduced a trap composed of 71 places in 1022 ms of which 8 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 505/2350 variables, and 530 constraints, problems are : Problem set: 1 solved, 4 unsolved in 5022 ms.
Refiners :[Domain max(s): 505/505 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 0/505 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 4/4 constraints]
After SMT, in 7929ms problems are : Problem set: 1 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 39 out of 505 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 505/505 places, 1845/1845 transitions.
Performed 68 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 68 Pre rules applied. Total rules applied 0 place count 505 transition count 1777
Deduced a syphon composed of 68 places in 4 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 0 with 136 rules applied. Total rules applied 136 place count 437 transition count 1777
Discarding 121 places :
Symmetric choice reduction at 0 with 121 rule applications. Total rules 257 place count 316 transition count 824
Iterating global reduction 0 with 121 rules applied. Total rules applied 378 place count 316 transition count 824
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 384 place count 313 transition count 821
Applied a total of 384 rules in 333 ms. Remains 313 /505 variables (removed 192) and now considering 821/1845 (removed 1024) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 361 ms. Remains : 313/505 places, 821/1845 transitions.
RANDOM walk for 40000 steps (8 resets) in 725 ms. (55 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 222 ms. (179 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 434 ms. (91 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 266 ms. (149 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 224 ms. (177 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 218940 steps, run timeout after 3001 ms. (steps per millisecond=72 ) properties seen :0 out of 4
Probabilistic random walk after 218940 steps, saw 149464 distinct states, run finished after 3014 ms. (steps per millisecond=72 ) properties seen :0
// Phase 1: matrix 821 rows 313 cols
[2024-05-23 06:29:31] [INFO ] Computed 21 invariants in 14 ms
[2024-05-23 06:29:31] [INFO ] State equation strengthened by 72 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 266/305 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/305 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/305 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 8/313 variables, 9/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/313 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 821/1134 variables, 313/334 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1134 variables, 72/406 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1134 variables, 0/406 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 0/1134 variables, 0/406 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1134/1134 variables, and 406 constraints, problems are : Problem set: 0 solved, 4 unsolved in 937 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 313/313 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 266/305 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/305 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/305 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 8/313 variables, 9/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-23 06:29:33] [INFO ] Deduced a trap composed of 121 places in 487 ms of which 3 ms to minimize.
[2024-05-23 06:29:34] [INFO ] Deduced a trap composed of 92 places in 308 ms of which 3 ms to minimize.
[2024-05-23 06:29:34] [INFO ] Deduced a trap composed of 103 places in 430 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/313 variables, 3/24 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-23 06:29:35] [INFO ] Deduced a trap composed of 106 places in 244 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-23 06:29:35] [INFO ] Deduced a trap composed of 154 places in 298 ms of which 3 ms to minimize.
[2024-05-23 06:29:36] [INFO ] Deduced a trap composed of 165 places in 425 ms of which 6 ms to minimize.
[2024-05-23 06:29:36] [INFO ] Deduced a trap composed of 76 places in 392 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/313 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/313 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 821/1134 variables, 313/341 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1134 variables, 72/413 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1134 variables, 4/417 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1134 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/1134 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1134/1134 variables, and 417 constraints, problems are : Problem set: 0 solved, 4 unsolved in 9736 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 313/313 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 7/7 constraints]
After SMT, in 10790ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 1337 ms.
Support contains 39 out of 313 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 313/313 places, 821/821 transitions.
Applied a total of 0 rules in 33 ms. Remains 313 /313 variables (removed 0) and now considering 821/821 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 313/313 places, 821/821 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 313/313 places, 821/821 transitions.
Applied a total of 0 rules in 26 ms. Remains 313 /313 variables (removed 0) and now considering 821/821 (removed 0) transitions.
[2024-05-23 06:29:44] [INFO ] Invariant cache hit.
[2024-05-23 06:29:44] [INFO ] Implicit Places using invariants in 468 ms returned []
[2024-05-23 06:29:44] [INFO ] Invariant cache hit.
[2024-05-23 06:29:45] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-23 06:29:47] [INFO ] Implicit Places using invariants and state equation in 2809 ms returned []
Implicit Place search using SMT with State Equation took 3293 ms to find 0 implicit places.
[2024-05-23 06:29:47] [INFO ] Redundant transitions in 89 ms returned []
Running 812 sub problems to find dead transitions.
[2024-05-23 06:29:47] [INFO ] Invariant cache hit.
[2024-05-23 06:29:47] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/313 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 812 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/313 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 812 unsolved
[2024-05-23 06:29:59] [INFO ] Deduced a trap composed of 57 places in 337 ms of which 4 ms to minimize.
[2024-05-23 06:30:00] [INFO ] Deduced a trap composed of 100 places in 347 ms of which 4 ms to minimize.
[2024-05-23 06:30:00] [INFO ] Deduced a trap composed of 141 places in 386 ms of which 4 ms to minimize.
[2024-05-23 06:30:01] [INFO ] Deduced a trap composed of 85 places in 452 ms of which 4 ms to minimize.
[2024-05-23 06:30:01] [INFO ] Deduced a trap composed of 150 places in 402 ms of which 4 ms to minimize.
[2024-05-23 06:30:01] [INFO ] Deduced a trap composed of 93 places in 431 ms of which 4 ms to minimize.
[2024-05-23 06:30:02] [INFO ] Deduced a trap composed of 167 places in 388 ms of which 3 ms to minimize.
[2024-05-23 06:30:02] [INFO ] Deduced a trap composed of 138 places in 446 ms of which 6 ms to minimize.
[2024-05-23 06:30:03] [INFO ] Deduced a trap composed of 141 places in 433 ms of which 5 ms to minimize.
[2024-05-23 06:30:03] [INFO ] Deduced a trap composed of 143 places in 445 ms of which 5 ms to minimize.
[2024-05-23 06:30:04] [INFO ] Deduced a trap composed of 112 places in 439 ms of which 5 ms to minimize.
[2024-05-23 06:30:04] [INFO ] Deduced a trap composed of 154 places in 479 ms of which 5 ms to minimize.
[2024-05-23 06:30:05] [INFO ] Deduced a trap composed of 152 places in 483 ms of which 6 ms to minimize.
[2024-05-23 06:30:05] [INFO ] Deduced a trap composed of 132 places in 477 ms of which 6 ms to minimize.
[2024-05-23 06:30:06] [INFO ] Deduced a trap composed of 153 places in 494 ms of which 5 ms to minimize.
[2024-05-23 06:30:06] [INFO ] Deduced a trap composed of 141 places in 474 ms of which 6 ms to minimize.
[2024-05-23 06:30:07] [INFO ] Deduced a trap composed of 137 places in 469 ms of which 6 ms to minimize.
[2024-05-23 06:30:07] [INFO ] Deduced a trap composed of 118 places in 320 ms of which 4 ms to minimize.
[2024-05-23 06:30:07] [INFO ] Deduced a trap composed of 145 places in 291 ms of which 3 ms to minimize.
[2024-05-23 06:30:08] [INFO ] Deduced a trap composed of 111 places in 249 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/313 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 812 unsolved
[2024-05-23 06:30:09] [INFO ] Deduced a trap composed of 135 places in 456 ms of which 6 ms to minimize.
[2024-05-23 06:30:10] [INFO ] Deduced a trap composed of 91 places in 496 ms of which 5 ms to minimize.
[2024-05-23 06:30:10] [INFO ] Deduced a trap composed of 144 places in 477 ms of which 5 ms to minimize.
[2024-05-23 06:30:11] [INFO ] Deduced a trap composed of 141 places in 492 ms of which 9 ms to minimize.
[2024-05-23 06:30:11] [INFO ] Deduced a trap composed of 139 places in 469 ms of which 6 ms to minimize.
[2024-05-23 06:30:12] [INFO ] Deduced a trap composed of 140 places in 470 ms of which 6 ms to minimize.
[2024-05-23 06:30:12] [INFO ] Deduced a trap composed of 155 places in 468 ms of which 5 ms to minimize.
[2024-05-23 06:30:13] [INFO ] Deduced a trap composed of 95 places in 514 ms of which 5 ms to minimize.
[2024-05-23 06:30:13] [INFO ] Deduced a trap composed of 72 places in 469 ms of which 7 ms to minimize.
[2024-05-23 06:30:14] [INFO ] Deduced a trap composed of 141 places in 428 ms of which 5 ms to minimize.
[2024-05-23 06:30:15] [INFO ] Deduced a trap composed of 92 places in 464 ms of which 5 ms to minimize.
[2024-05-23 06:30:15] [INFO ] Deduced a trap composed of 109 places in 493 ms of which 5 ms to minimize.
[2024-05-23 06:30:16] [INFO ] Deduced a trap composed of 172 places in 462 ms of which 5 ms to minimize.
[2024-05-23 06:30:16] [INFO ] Deduced a trap composed of 170 places in 527 ms of which 6 ms to minimize.
[2024-05-23 06:30:17] [INFO ] Deduced a trap composed of 132 places in 422 ms of which 3 ms to minimize.
[2024-05-23 06:30:17] [INFO ] Deduced a trap composed of 151 places in 282 ms of which 3 ms to minimize.
[2024-05-23 06:30:17] [INFO ] Deduced a trap composed of 91 places in 456 ms of which 6 ms to minimize.
[2024-05-23 06:30:18] [INFO ] Deduced a trap composed of 171 places in 471 ms of which 6 ms to minimize.
[2024-05-23 06:30:18] [INFO ] Deduced a trap composed of 110 places in 486 ms of which 5 ms to minimize.
[2024-05-23 06:30:19] [INFO ] Deduced a trap composed of 148 places in 479 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/313 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 812 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 313/1134 variables, and 61 constraints, problems are : Problem set: 0 solved, 812 unsolved in 30057 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 0/313 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 812/812 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 812 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/313 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 812 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/313 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 812 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/313 variables, 40/61 constraints. Problems are: Problem set: 0 solved, 812 unsolved
[2024-05-23 06:30:25] [INFO ] Deduced a trap composed of 57 places in 407 ms of which 5 ms to minimize.
[2024-05-23 06:30:25] [INFO ] Deduced a trap composed of 138 places in 462 ms of which 6 ms to minimize.
[2024-05-23 06:30:26] [INFO ] Deduced a trap composed of 79 places in 506 ms of which 5 ms to minimize.
[2024-05-23 06:30:27] [INFO ] Deduced a trap composed of 106 places in 429 ms of which 5 ms to minimize.
[2024-05-23 06:30:27] [INFO ] Deduced a trap composed of 100 places in 468 ms of which 5 ms to minimize.
[2024-05-23 06:30:28] [INFO ] Deduced a trap composed of 103 places in 436 ms of which 14 ms to minimize.
[2024-05-23 06:30:28] [INFO ] Deduced a trap composed of 99 places in 529 ms of which 5 ms to minimize.
[2024-05-23 06:30:29] [INFO ] Deduced a trap composed of 101 places in 445 ms of which 5 ms to minimize.
[2024-05-23 06:30:29] [INFO ] Deduced a trap composed of 111 places in 436 ms of which 5 ms to minimize.
[2024-05-23 06:30:30] [INFO ] Deduced a trap composed of 117 places in 406 ms of which 5 ms to minimize.
[2024-05-23 06:30:30] [INFO ] Deduced a trap composed of 93 places in 447 ms of which 5 ms to minimize.
[2024-05-23 06:30:32] [INFO ] Deduced a trap composed of 73 places in 443 ms of which 5 ms to minimize.
[2024-05-23 06:30:32] [INFO ] Deduced a trap composed of 73 places in 451 ms of which 6 ms to minimize.
[2024-05-23 06:30:32] [INFO ] Deduced a trap composed of 84 places in 465 ms of which 5 ms to minimize.
[2024-05-23 06:30:33] [INFO ] Deduced a trap composed of 87 places in 397 ms of which 5 ms to minimize.
[2024-05-23 06:30:33] [INFO ] Deduced a trap composed of 130 places in 488 ms of which 5 ms to minimize.
[2024-05-23 06:30:34] [INFO ] Deduced a trap composed of 62 places in 435 ms of which 5 ms to minimize.
[2024-05-23 06:30:34] [INFO ] Deduced a trap composed of 66 places in 431 ms of which 5 ms to minimize.
[2024-05-23 06:30:35] [INFO ] Deduced a trap composed of 69 places in 475 ms of which 5 ms to minimize.
[2024-05-23 06:30:35] [INFO ] Deduced a trap composed of 181 places in 466 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/313 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 812 unsolved
[2024-05-23 06:30:39] [INFO ] Deduced a trap composed of 97 places in 415 ms of which 6 ms to minimize.
[2024-05-23 06:30:40] [INFO ] Deduced a trap composed of 147 places in 478 ms of which 6 ms to minimize.
[2024-05-23 06:30:41] [INFO ] Deduced a trap composed of 78 places in 479 ms of which 6 ms to minimize.
[2024-05-23 06:30:41] [INFO ] Deduced a trap composed of 87 places in 463 ms of which 5 ms to minimize.
[2024-05-23 06:30:42] [INFO ] Deduced a trap composed of 102 places in 458 ms of which 5 ms to minimize.
[2024-05-23 06:30:42] [INFO ] Deduced a trap composed of 82 places in 490 ms of which 6 ms to minimize.
[2024-05-23 06:30:43] [INFO ] Deduced a trap composed of 173 places in 449 ms of which 6 ms to minimize.
[2024-05-23 06:30:43] [INFO ] Deduced a trap composed of 150 places in 479 ms of which 5 ms to minimize.
[2024-05-23 06:30:44] [INFO ] Deduced a trap composed of 109 places in 513 ms of which 5 ms to minimize.
[2024-05-23 06:30:44] [INFO ] Deduced a trap composed of 124 places in 503 ms of which 6 ms to minimize.
[2024-05-23 06:30:45] [INFO ] Deduced a trap composed of 97 places in 519 ms of which 5 ms to minimize.
[2024-05-23 06:30:45] [INFO ] Deduced a trap composed of 99 places in 508 ms of which 5 ms to minimize.
[2024-05-23 06:30:46] [INFO ] Deduced a trap composed of 96 places in 487 ms of which 5 ms to minimize.
[2024-05-23 06:30:46] [INFO ] Deduced a trap composed of 90 places in 376 ms of which 4 ms to minimize.
[2024-05-23 06:30:47] [INFO ] Deduced a trap composed of 82 places in 417 ms of which 6 ms to minimize.
[2024-05-23 06:30:47] [INFO ] Deduced a trap composed of 156 places in 470 ms of which 5 ms to minimize.
[2024-05-23 06:30:48] [INFO ] Deduced a trap composed of 166 places in 456 ms of which 6 ms to minimize.
[2024-05-23 06:30:48] [INFO ] Deduced a trap composed of 129 places in 456 ms of which 5 ms to minimize.
[2024-05-23 06:30:48] [INFO ] Deduced a trap composed of 179 places in 450 ms of which 5 ms to minimize.
[2024-05-23 06:30:49] [INFO ] Deduced a trap composed of 120 places in 458 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 812 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 313/1134 variables, and 101 constraints, problems are : Problem set: 0 solved, 812 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 0/313 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/812 constraints, Known Traps: 80/80 constraints]
After SMT, in 62113ms problems are : Problem set: 0 solved, 812 unsolved
Search for dead transitions found 0 dead transitions in 62140ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65581 ms. Remains : 313/313 places, 821/821 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 80 Pre rules applied. Total rules applied 0 place count 313 transition count 741
Deduced a syphon composed of 80 places in 1 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 0 with 160 rules applied. Total rules applied 160 place count 233 transition count 741
Applied a total of 160 rules in 45 ms. Remains 233 /313 variables (removed 80) and now considering 741/821 (removed 80) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 741 rows 233 cols
[2024-05-23 06:30:49] [INFO ] Computed 21 invariants in 9 ms
[2024-05-23 06:30:49] [INFO ] After 114ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-23 06:30:50] [INFO ] [Nat]Absence check using 10 positive place invariants in 14 ms returned sat
[2024-05-23 06:30:50] [INFO ] [Nat]Absence check using 10 positive and 11 generalized place invariants in 22 ms returned sat
[2024-05-23 06:30:51] [INFO ] After 918ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2024-05-23 06:30:51] [INFO ] After 1605ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2024-05-23 06:30:52] [INFO ] After 2224ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Over-approximation ignoring read arcs solved 0 properties in 2466 ms.
[2024-05-23 06:30:52] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 4 ms.
[2024-05-23 06:30:52] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 313 places, 821 transitions and 3276 arcs took 11 ms.
[2024-05-23 06:30:52] [INFO ] Flatten gal took : 161 ms
Total runtime 95994 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running Anderson-PT-09

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/415/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 313
TRANSITIONS: 821
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.024s, Sys 0.000s]


SAVING FILE /home/mcc/execution/415/model (.net / .def) ...
EXPORT TIME: [User 0.004s, 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: 858
MODEL NAME: /home/mcc/execution/415/model
313 places, 821 transitions.

No place bound informations found.
No place bound informations found.
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
No place bound informations found.
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 ReachabilityFireability -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Anderson-PT-09"
export BK_EXAMINATION="ReachabilityFireability"
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 Anderson-PT-09, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r003-smll-171620117500359"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Anderson-PT-09.tgz
mv Anderson-PT-09 execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;