Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r307-tajo-171654460700199.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.......................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is PolyORBLF-PT-S06J04T04, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r307-tajo-171654460700199
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 11M
-rw-r--r-- 1 mcc users 13K Apr 11 17:34 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K Apr 11 17:34 CTLCardinality.xml
-rw-r--r-- 1 mcc users 221K Apr 11 17:32 CTLFireability.txt
-rw-r--r-- 1 mcc users 912K Apr 11 17:32 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 8.9K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 38K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 112K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 343K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 19K Apr 11 17:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Apr 11 17:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 291K Apr 11 17:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.2M Apr 11 17:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.7K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 6.8M May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717122229302

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-PT-S06J04T04
Applying reductions before tool lola
Invoking reducer
Running Version 202304061127
[2024-05-31 02:23:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-31 02:23:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 02:23:52] [INFO ] Load time of PNML (sax parser for PT used): 428 ms
[2024-05-31 02:23:52] [INFO ] Transformed 454 places.
[2024-05-31 02:23:52] [INFO ] Transformed 6994 transitions.
[2024-05-31 02:23:52] [INFO ] Parsed PT model containing 454 places and 6994 transitions and 59152 arcs in 613 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 22 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 5380 transitions
Reduce redundant transitions removed 5380 transitions.
Incomplete random walk after 10000 steps, including 61 resets, run finished after 613 ms. (steps per millisecond=16 ) properties (out of 16) seen :7
FORMULA PolyORBLF-PT-S06J04T04-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S06J04T04-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S06J04T04-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S06J04T04-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S06J04T04-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S06J04T04-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S06J04T04-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 186 ms. (steps per millisecond=53 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 33 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 30 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 25 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 149 ms. (steps per millisecond=67 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 28 resets, run finished after 169 ms. (steps per millisecond=59 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
[2024-05-31 02:23:54] [INFO ] Flow matrix only has 1590 transitions (discarded 24 similar events)
// Phase 1: matrix 1590 rows 454 cols
[2024-05-31 02:23:54] [INFO ] Computed 50 invariants in 79 ms
[2024-05-31 02:23:54] [INFO ] [Real]Absence check using 19 positive place invariants in 11 ms returned sat
[2024-05-31 02:23:55] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 24 ms returned sat
[2024-05-31 02:23:55] [INFO ] After 523ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:8
[2024-05-31 02:23:55] [INFO ] [Nat]Absence check using 19 positive place invariants in 9 ms returned sat
[2024-05-31 02:23:55] [INFO ] [Nat]Absence check using 19 positive and 31 generalized place invariants in 62 ms returned sat
[2024-05-31 02:24:03] [INFO ] After 7851ms SMT Verify possible using state equation in natural domain returned unsat :8 sat :1
[2024-05-31 02:24:03] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-05-31 02:24:04] [INFO ] After 1211ms SMT Verify possible using 112 Read/Feed constraints in natural domain returned unsat :8 sat :1
[2024-05-31 02:24:05] [INFO ] Deduced a trap composed of 255 places in 828 ms of which 10 ms to minimize.
[2024-05-31 02:24:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1419 ms
[2024-05-31 02:24:05] [INFO ] After 2701ms SMT Verify possible using trap constraints in natural domain returned unsat :8 sat :1
Attempting to minimize the solution found.
Minimization took 662 ms.
[2024-05-31 02:24:06] [INFO ] After 11603ms SMT Verify possible using all constraints in natural domain returned unsat :8 sat :1
FORMULA PolyORBLF-PT-S06J04T04-ReachabilityCardinality-2024-15 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBLF-PT-S06J04T04-ReachabilityCardinality-2024-14 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBLF-PT-S06J04T04-ReachabilityCardinality-2024-08 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBLF-PT-S06J04T04-ReachabilityCardinality-2024-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBLF-PT-S06J04T04-ReachabilityCardinality-2024-04 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBLF-PT-S06J04T04-ReachabilityCardinality-2024-03 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBLF-PT-S06J04T04-ReachabilityCardinality-2024-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBLF-PT-S06J04T04-ReachabilityCardinality-2024-00 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 9 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 16 ms.
Support contains 1 out of 454 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 454/454 places, 1614/1614 transitions.
Ensure Unique test removed 6 places
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 448 transition count 1578
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 78 place count 412 transition count 1578
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 48 Pre rules applied. Total rules applied 78 place count 412 transition count 1530
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 174 place count 364 transition count 1530
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 2 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 270 place count 316 transition count 1482
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 2 with 8 rules applied. Total rules applied 278 place count 316 transition count 1474
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 286 place count 308 transition count 1474
Applied a total of 286 rules in 277 ms. Remains 308 /454 variables (removed 146) and now considering 1474/1614 (removed 140) transitions.
[2024-05-31 02:24:06] [INFO ] Flow matrix only has 1450 transitions (discarded 24 similar events)
// Phase 1: matrix 1450 rows 308 cols
[2024-05-31 02:24:07] [INFO ] Computed 44 invariants in 77 ms
[2024-05-31 02:24:07] [INFO ] Dead Transitions using invariants and state equation in 841 ms found 612 transitions.
Found 612 dead transitions using SMT.
Drop transitions removed 612 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 612 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 308/454 places, 862/1614 transitions.
Applied a total of 0 rules in 19 ms. Remains 308 /308 variables (removed 0) and now considering 862/862 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1140 ms. Remains : 308/454 places, 862/1614 transitions.
Incomplete random walk after 10001 steps, including 99 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 48 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 331237 steps, run timeout after 3001 ms. (steps per millisecond=110 ) properties seen :{}
Probabilistic random walk after 331237 steps, saw 164811 distinct states, run finished after 3004 ms. (steps per millisecond=110 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-31 02:24:10] [INFO ] Flow matrix only has 838 transitions (discarded 24 similar events)
// Phase 1: matrix 838 rows 308 cols
[2024-05-31 02:24:10] [INFO ] Computed 44 invariants in 13 ms
[2024-05-31 02:24:11] [INFO ] [Real]Absence check using 17 positive place invariants in 5 ms returned sat
[2024-05-31 02:24:11] [INFO ] [Real]Absence check using 17 positive and 27 generalized place invariants in 30 ms returned sat
[2024-05-31 02:24:35] [INFO ] After 25040ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 308 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 862/862 transitions.
Applied a total of 0 rules in 51 ms. Remains 308 /308 variables (removed 0) and now considering 862/862 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 308/308 places, 862/862 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 862/862 transitions.
Applied a total of 0 rules in 34 ms. Remains 308 /308 variables (removed 0) and now considering 862/862 (removed 0) transitions.
[2024-05-31 02:24:36] [INFO ] Flow matrix only has 838 transitions (discarded 24 similar events)
[2024-05-31 02:24:36] [INFO ] Invariant cache hit.
[2024-05-31 02:24:36] [INFO ] Implicit Places using invariants in 610 ms returned [29, 202, 240, 280]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 620 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 304/308 places, 862/862 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 301 transition count 859
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 301 transition count 859
Applied a total of 6 rules in 42 ms. Remains 301 /304 variables (removed 3) and now considering 859/862 (removed 3) transitions.
[2024-05-31 02:24:36] [INFO ] Flow matrix only has 835 transitions (discarded 24 similar events)
// Phase 1: matrix 835 rows 301 cols
[2024-05-31 02:24:36] [INFO ] Computed 40 invariants in 17 ms
[2024-05-31 02:24:37] [INFO ] Implicit Places using invariants in 502 ms returned []
[2024-05-31 02:24:37] [INFO ] Flow matrix only has 835 transitions (discarded 24 similar events)
[2024-05-31 02:24:37] [INFO ] Invariant cache hit.
[2024-05-31 02:24:37] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-05-31 02:24:39] [INFO ] Implicit Places using invariants and state equation in 2305 ms returned []
Implicit Place search using SMT with State Equation took 2811 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 301/308 places, 859/862 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3508 ms. Remains : 301/308 places, 859/862 transitions.
Incomplete random walk after 10000 steps, including 101 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 288641 steps, run timeout after 3001 ms. (steps per millisecond=96 ) properties seen :{}
Probabilistic random walk after 288641 steps, saw 172334 distinct states, run finished after 3003 ms. (steps per millisecond=96 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-31 02:24:42] [INFO ] Flow matrix only has 835 transitions (discarded 24 similar events)
[2024-05-31 02:24:42] [INFO ] Invariant cache hit.
[2024-05-31 02:24:42] [INFO ] [Real]Absence check using 16 positive place invariants in 9 ms returned sat
[2024-05-31 02:24:42] [INFO ] [Real]Absence check using 16 positive and 24 generalized place invariants in 31 ms returned sat
[2024-05-31 02:24:44] [INFO ] After 1435ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 02:24:44] [INFO ] [Nat]Absence check using 16 positive place invariants in 5 ms returned sat
[2024-05-31 02:24:44] [INFO ] [Nat]Absence check using 16 positive and 24 generalized place invariants in 20 ms returned sat
[2024-05-31 02:24:45] [INFO ] After 1705ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 02:24:45] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-05-31 02:24:46] [INFO ] After 573ms SMT Verify possible using 112 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-31 02:24:46] [INFO ] Deduced a trap composed of 143 places in 229 ms of which 2 ms to minimize.
[2024-05-31 02:24:46] [INFO ] Deduced a trap composed of 141 places in 203 ms of which 1 ms to minimize.
[2024-05-31 02:24:47] [INFO ] Deduced a trap composed of 136 places in 269 ms of which 1 ms to minimize.
[2024-05-31 02:24:47] [INFO ] Deduced a trap composed of 126 places in 260 ms of which 1 ms to minimize.
[2024-05-31 02:24:47] [INFO ] Deduced a trap composed of 141 places in 259 ms of which 1 ms to minimize.
[2024-05-31 02:24:48] [INFO ] Deduced a trap composed of 139 places in 218 ms of which 2 ms to minimize.
[2024-05-31 02:24:48] [INFO ] Deduced a trap composed of 143 places in 279 ms of which 1 ms to minimize.
[2024-05-31 02:24:48] [INFO ] Deduced a trap composed of 143 places in 320 ms of which 1 ms to minimize.
[2024-05-31 02:24:49] [INFO ] Deduced a trap composed of 144 places in 201 ms of which 1 ms to minimize.
[2024-05-31 02:24:49] [INFO ] Deduced a trap composed of 149 places in 259 ms of which 0 ms to minimize.
[2024-05-31 02:24:49] [INFO ] Deduced a trap composed of 144 places in 220 ms of which 0 ms to minimize.
[2024-05-31 02:24:50] [INFO ] Deduced a trap composed of 149 places in 229 ms of which 1 ms to minimize.
[2024-05-31 02:24:50] [INFO ] Deduced a trap composed of 145 places in 250 ms of which 1 ms to minimize.
[2024-05-31 02:24:51] [INFO ] Deduced a trap composed of 133 places in 235 ms of which 1 ms to minimize.
[2024-05-31 02:24:51] [INFO ] Deduced a trap composed of 146 places in 258 ms of which 1 ms to minimize.
[2024-05-31 02:24:51] [INFO ] Deduced a trap composed of 145 places in 230 ms of which 0 ms to minimize.
[2024-05-31 02:24:51] [INFO ] Deduced a trap composed of 148 places in 222 ms of which 0 ms to minimize.
[2024-05-31 02:24:52] [INFO ] Deduced a trap composed of 131 places in 243 ms of which 0 ms to minimize.
[2024-05-31 02:24:52] [INFO ] Deduced a trap composed of 155 places in 195 ms of which 0 ms to minimize.
[2024-05-31 02:24:52] [INFO ] Deduced a trap composed of 142 places in 260 ms of which 1 ms to minimize.
[2024-05-31 02:24:53] [INFO ] Deduced a trap composed of 122 places in 236 ms of which 0 ms to minimize.
[2024-05-31 02:24:53] [INFO ] Deduced a trap composed of 150 places in 232 ms of which 0 ms to minimize.
[2024-05-31 02:24:53] [INFO ] Deduced a trap composed of 144 places in 186 ms of which 1 ms to minimize.
[2024-05-31 02:24:54] [INFO ] Deduced a trap composed of 141 places in 272 ms of which 1 ms to minimize.
[2024-05-31 02:24:54] [INFO ] Deduced a trap composed of 132 places in 172 ms of which 2 ms to minimize.
[2024-05-31 02:24:54] [INFO ] Deduced a trap composed of 146 places in 254 ms of which 1 ms to minimize.
[2024-05-31 02:24:54] [INFO ] Deduced a trap composed of 150 places in 255 ms of which 0 ms to minimize.
[2024-05-31 02:24:55] [INFO ] Deduced a trap composed of 146 places in 273 ms of which 1 ms to minimize.
[2024-05-31 02:24:55] [INFO ] Deduced a trap composed of 129 places in 271 ms of which 1 ms to minimize.
[2024-05-31 02:24:55] [INFO ] Deduced a trap composed of 143 places in 221 ms of which 0 ms to minimize.
[2024-05-31 02:24:56] [INFO ] Deduced a trap composed of 148 places in 264 ms of which 14 ms to minimize.
[2024-05-31 02:24:56] [INFO ] Deduced a trap composed of 134 places in 250 ms of which 1 ms to minimize.
[2024-05-31 02:24:57] [INFO ] Deduced a trap composed of 144 places in 237 ms of which 4 ms to minimize.
[2024-05-31 02:24:57] [INFO ] Deduced a trap composed of 143 places in 259 ms of which 1 ms to minimize.
[2024-05-31 02:24:57] [INFO ] Deduced a trap composed of 155 places in 215 ms of which 1 ms to minimize.
[2024-05-31 02:24:58] [INFO ] Deduced a trap composed of 154 places in 243 ms of which 1 ms to minimize.
[2024-05-31 02:24:58] [INFO ] Deduced a trap composed of 146 places in 225 ms of which 1 ms to minimize.
[2024-05-31 02:24:58] [INFO ] Deduced a trap composed of 134 places in 257 ms of which 1 ms to minimize.
[2024-05-31 02:24:58] [INFO ] Deduced a trap composed of 130 places in 213 ms of which 0 ms to minimize.
[2024-05-31 02:24:59] [INFO ] Deduced a trap composed of 112 places in 252 ms of which 1 ms to minimize.
[2024-05-31 02:25:00] [INFO ] Deduced a trap composed of 146 places in 179 ms of which 1 ms to minimize.
[2024-05-31 02:25:00] [INFO ] Deduced a trap composed of 146 places in 265 ms of which 0 ms to minimize.
[2024-05-31 02:25:00] [INFO ] Deduced a trap composed of 133 places in 221 ms of which 1 ms to minimize.
[2024-05-31 02:25:01] [INFO ] Deduced a trap composed of 135 places in 178 ms of which 0 ms to minimize.
[2024-05-31 02:25:01] [INFO ] Deduced a trap composed of 147 places in 212 ms of which 1 ms to minimize.
[2024-05-31 02:25:01] [INFO ] Deduced a trap composed of 136 places in 177 ms of which 0 ms to minimize.
[2024-05-31 02:25:01] [INFO ] Deduced a trap composed of 137 places in 161 ms of which 0 ms to minimize.
[2024-05-31 02:25:01] [INFO ] Deduced a trap composed of 137 places in 133 ms of which 0 ms to minimize.
[2024-05-31 02:25:02] [INFO ] Deduced a trap composed of 135 places in 206 ms of which 0 ms to minimize.
[2024-05-31 02:25:02] [INFO ] Deduced a trap composed of 144 places in 221 ms of which 1 ms to minimize.
[2024-05-31 02:25:02] [INFO ] Deduced a trap composed of 138 places in 167 ms of which 0 ms to minimize.
[2024-05-31 02:25:02] [INFO ] Deduced a trap composed of 130 places in 216 ms of which 1 ms to minimize.
[2024-05-31 02:25:03] [INFO ] Deduced a trap composed of 153 places in 191 ms of which 0 ms to minimize.
[2024-05-31 02:25:03] [INFO ] Deduced a trap composed of 145 places in 240 ms of which 0 ms to minimize.
[2024-05-31 02:25:03] [INFO ] Deduced a trap composed of 142 places in 233 ms of which 15 ms to minimize.
[2024-05-31 02:25:03] [INFO ] Deduced a trap composed of 139 places in 228 ms of which 1 ms to minimize.
[2024-05-31 02:25:04] [INFO ] Deduced a trap composed of 140 places in 259 ms of which 0 ms to minimize.
[2024-05-31 02:25:04] [INFO ] Deduced a trap composed of 139 places in 244 ms of which 0 ms to minimize.
[2024-05-31 02:25:05] [INFO ] Deduced a trap composed of 146 places in 267 ms of which 0 ms to minimize.
[2024-05-31 02:25:05] [INFO ] Deduced a trap composed of 141 places in 265 ms of which 0 ms to minimize.
[2024-05-31 02:25:05] [INFO ] Deduced a trap composed of 140 places in 222 ms of which 0 ms to minimize.
[2024-05-31 02:25:06] [INFO ] Deduced a trap composed of 143 places in 231 ms of which 1 ms to minimize.
[2024-05-31 02:25:06] [INFO ] Deduced a trap composed of 127 places in 254 ms of which 0 ms to minimize.
[2024-05-31 02:25:06] [INFO ] Deduced a trap composed of 151 places in 250 ms of which 0 ms to minimize.
[2024-05-31 02:25:06] [INFO ] Deduced a trap composed of 121 places in 227 ms of which 0 ms to minimize.
[2024-05-31 02:25:07] [INFO ] Deduced a trap composed of 149 places in 207 ms of which 1 ms to minimize.
[2024-05-31 02:25:07] [INFO ] Deduced a trap composed of 129 places in 222 ms of which 1 ms to minimize.
[2024-05-31 02:25:07] [INFO ] Deduced a trap composed of 131 places in 263 ms of which 1 ms to minimize.
[2024-05-31 02:25:08] [INFO ] Deduced a trap composed of 146 places in 244 ms of which 0 ms to minimize.
[2024-05-31 02:25:08] [INFO ] Deduced a trap composed of 150 places in 223 ms of which 1 ms to minimize.
[2024-05-31 02:25:09] [INFO ] Deduced a trap composed of 146 places in 257 ms of which 0 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:944)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-31 02:25:09] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-31 02:25:09] [INFO ] After 25056ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 301 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 301/301 places, 859/859 transitions.
Applied a total of 0 rules in 25 ms. Remains 301 /301 variables (removed 0) and now considering 859/859 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 301/301 places, 859/859 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 301/301 places, 859/859 transitions.
Applied a total of 0 rules in 21 ms. Remains 301 /301 variables (removed 0) and now considering 859/859 (removed 0) transitions.
[2024-05-31 02:25:09] [INFO ] Flow matrix only has 835 transitions (discarded 24 similar events)
[2024-05-31 02:25:09] [INFO ] Invariant cache hit.
[2024-05-31 02:25:09] [INFO ] Implicit Places using invariants in 375 ms returned []
[2024-05-31 02:25:09] [INFO ] Flow matrix only has 835 transitions (discarded 24 similar events)
[2024-05-31 02:25:09] [INFO ] Invariant cache hit.
[2024-05-31 02:25:09] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-05-31 02:25:12] [INFO ] Implicit Places using invariants and state equation in 2874 ms returned []
Implicit Place search using SMT with State Equation took 3252 ms to find 0 implicit places.
[2024-05-31 02:25:12] [INFO ] Redundant transitions in 77 ms returned []
[2024-05-31 02:25:12] [INFO ] Flow matrix only has 835 transitions (discarded 24 similar events)
[2024-05-31 02:25:12] [INFO ] Invariant cache hit.
[2024-05-31 02:25:13] [INFO ] Dead Transitions using invariants and state equation in 512 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3873 ms. Remains : 301/301 places, 859/859 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 301 transition count 835
Drop transitions removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 1 with 24 rules applied. Total rules applied 48 place count 301 transition count 811
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -40
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 1 with 8 rules applied. Total rules applied 56 place count 297 transition count 851
Free-agglomeration rule applied 4 times.
Iterating global reduction 1 with 4 rules applied. Total rules applied 60 place count 297 transition count 847
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 64 place count 293 transition count 847
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 2 with 10 rules applied. Total rules applied 74 place count 293 transition count 837
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 84 place count 283 transition count 837
Applied a total of 84 rules in 107 ms. Remains 283 /301 variables (removed 18) and now considering 837/859 (removed 22) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 837 rows 283 cols
[2024-05-31 02:25:13] [INFO ] Computed 40 invariants in 28 ms
[2024-05-31 02:25:13] [INFO ] [Real]Absence check using 20 positive place invariants in 5 ms returned sat
[2024-05-31 02:25:13] [INFO ] [Real]Absence check using 20 positive and 20 generalized place invariants in 22 ms returned sat
[2024-05-31 02:25:13] [INFO ] After 117ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 02:25:13] [INFO ] [Nat]Absence check using 20 positive place invariants in 6 ms returned sat
[2024-05-31 02:25:13] [INFO ] [Nat]Absence check using 20 positive and 20 generalized place invariants in 22 ms returned sat
[2024-05-31 02:25:15] [INFO ] After 1893ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 02:25:15] [INFO ] After 1939ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 22 ms.
[2024-05-31 02:25:15] [INFO ] After 2185ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2024-05-31 02:25:15] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 4 ms.
[2024-05-31 02:25:15] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 301 places, 859 transitions and 5297 arcs took 13 ms.
[2024-05-31 02:25:15] [INFO ] Flatten gal took : 182 ms
Total runtime 84372 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT PolyORBLF-PT-S06J04T04
BK_EXAMINATION: ReachabilityCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/368
ReachabilityCardinality

FORMULA PolyORBLF-PT-S06J04T04-ReachabilityCardinality-2024-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1717122317540

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/368/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/368/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/368/ReachabilityCardinality.xml
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: LAUNCH task # 4 (type SKEL/FNDP) for 0 PolyORBLF-PT-S06J04T04-ReachabilityCardinality-2024-10
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 5 (type SKEL/EQUN) for 0 PolyORBLF-PT-S06J04T04-ReachabilityCardinality-2024-10
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 7 (type SKEL/SRCH) for 0 PolyORBLF-PT-S06J04T04-ReachabilityCardinality-2024-10
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 8 (type SKEL/SRCH) for 0 PolyORBLF-PT-S06J04T04-ReachabilityCardinality-2024-10
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
sara: try reading problem file /home/mcc/execution/368/ReachabilityCardinality-5.sara.
sara: place or transition ordering is non-deterministic
sara: warning, failure of lp_solve (at job 10)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 8 (type SKEL/SRCH) for PolyORBLF-PT-S06J04T04-ReachabilityCardinality-2024-10
lola: result : false
lola: markings : 92269
lola: fired transitions : 114583
lola: time used : 1.000000
lola: memory pages used : 1
lola: FINISHED task # 7 (type SKEL/SRCH) for PolyORBLF-PT-S06J04T04-ReachabilityCardinality-2024-10
lola: result : false
lola: markings : 139332
lola: fired transitions : 206409
lola: time used : 1.000000
lola: memory pages used : 1
lola: CANCELED task # 4 (type FNDP) for PolyORBLF-PT-S06J04T04-ReachabilityCardinality-2024-10 (obsolete)
lola: CANCELED task # 5 (type EQUN) for PolyORBLF-PT-S06J04T04-ReachabilityCardinality-2024-10 (obsolete)
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PolyORBLF-PT-S06J04T04-ReachabilityCardinality-2024-10: EF false skeleton: tandem / insertion


Time elapsed: 1 secs. Pages in use: 2

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBLF-PT-S06J04T04"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="gold2023"
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 gold2023"
echo " Input is PolyORBLF-PT-S06J04T04, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r307-tajo-171654460700199"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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