Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2022-input.r216-oct2-165281606300176.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2021
Input is SafeBus-PT-15, examination is ReachabilityDeadlock
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r216-oct2-165281606300176
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.4M
-rw-r--r-- 1 mcc users 39K Apr 29 12:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 254K Apr 29 12:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 178K Apr 29 11:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 792K Apr 29 11:59 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 24K May 9 08:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 90K May 9 08:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 388K May 9 08:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 1.2M May 9 08:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.8K May 9 08:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 20K May 9 08:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 3.5M May 10 09:34 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME ReachabilityDeadlock

=== Now, execution of the tool begins

BK_START 1653217810541

Running Version 0
[2022-05-22 11:10:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityDeadlock, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2022-05-22 11:10:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-22 11:10:12] [INFO ] Load time of PNML (sax parser for PT used): 244 ms
[2022-05-22 11:10:12] [INFO ] Transformed 621 places.
[2022-05-22 11:10:12] [INFO ] Transformed 4771 transitions.
[2022-05-22 11:10:12] [INFO ] Parsed PT model containing 621 places and 4771 transitions in 327 ms.
Parsed 1 properties from file /home/mcc/execution/ReachabilityDeadlock.xml in 4 ms.
Working with output stream class java.io.PrintStream
Reduce places removed 15 places and 0 transitions.
Built sparse matrix representations for Structural reductions in 7 ms.28052KB memory used
Starting structural reductions, iteration 0 : 606/606 places, 4771/4771 transitions.
Applied a total of 0 rules in 1391 ms. Remains 606 /606 variables (removed 0) and now considering 4771/4771 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 606/606 places, 4771/4771 transitions.
Starting structural reductions, iteration 0 : 606/606 places, 4771/4771 transitions.
Applied a total of 0 rules in 1034 ms. Remains 606 /606 variables (removed 0) and now considering 4771/4771 (removed 0) transitions.
[2022-05-22 11:10:15] [INFO ] Flow matrix only has 1412 transitions (discarded 3359 similar events)
// Phase 1: matrix 1412 rows 606 cols
[2022-05-22 11:10:15] [INFO ] Computed 65 place invariants in 126 ms
[2022-05-22 11:10:16] [INFO ] Implicit Places using invariants in 1688 ms returned [546, 547, 548, 549, 550, 551, 552, 553, 554, 555, 556, 557, 558, 559, 560]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 1716 ms to find 15 implicit places.
[2022-05-22 11:10:17] [INFO ] Redundant transitions in 310 ms returned []
[2022-05-22 11:10:17] [INFO ] Flow matrix only has 1412 transitions (discarded 3359 similar events)
// Phase 1: matrix 1412 rows 591 cols
[2022-05-22 11:10:17] [INFO ] Computed 50 place invariants in 26 ms
[2022-05-22 11:10:18] [INFO ] Dead Transitions using invariants and state equation in 1747 ms returned [211, 227, 243, 259, 275, 291, 307, 323, 339, 355, 371, 387, 403, 419, 435, 436, 452, 468, 484, 500, 516, 532, 548, 564, 580, 596, 612, 628, 644, 660, 661, 677, 693, 709, 725, 741, 757, 773, 789, 805, 821, 837, 853, 869, 885, 886, 902, 918, 934, 950, 966, 982, 998, 1014, 1030, 1046, 1062, 1078, 1094, 1110, 1111, 1127, 1143, 1159, 1175, 1191, 1207, 1223, 1239, 1255, 1271, 1287, 1303, 1319, 1335, 1336, 1352, 1368, 1384, 1400, 1416, 1432, 1448, 1464, 1480, 1496, 1512, 1528, 1544, 1560, 1561, 1577, 1593, 1609, 1625, 1641, 1657, 1673, 1689, 1705, 1721, 1737, 1753, 1769, 1785, 1786, 1802, 1818, 1834, 1850, 1866, 1882, 1898, 1914, 1930, 1946, 1962, 1978, 1994, 2010, 2011, 2027, 2043, 2059, 2075, 2091, 2107, 2123, 2139, 2155, 2171, 2187, 2203, 2219, 2235, 2236, 2252, 2268, 2284, 2300, 2316, 2332, 2348, 2364, 2380, 2396, 2412, 2428, 2444, 2460, 2461, 2477, 2493, 2509, 2525, 2541, 2557, 2573, 2589, 2605, 2621, 2637, 2653, 2669, 2685, 2686, 2702, 2718, 2734, 2750, 2766, 2782, 2798, 2814, 2830, 2846, 2862, 2878, 2894, 2910, 2911, 2927, 2943, 2959, 2975, 2991, 3007, 3023, 3039, 3055, 3071, 3087, 3103, 3119, 3135, 3136, 3152, 3168, 3184, 3200, 3216, 3232, 3248, 3264, 3280, 3296, 3312, 3328, 3344, 3360, 3361, 3377, 3393, 3409, 3425, 3441, 3457, 3473, 3489, 3505, 3521, 3537, 3553, 3569, 3585]
Found 225 dead transitions using SMT.
Drop transitions removed 225 transitions
Dead transitions reduction (with SMT) removed 225 transitions :[3585, 3569, 3553, 3537, 3521, 3505, 3489, 3473, 3457, 3441, 3425, 3409, 3393, 3377, 3361, 3360, 3344, 3328, 3312, 3296, 3280, 3264, 3248, 3232, 3216, 3200, 3184, 3168, 3152, 3136, 3135, 3119, 3103, 3087, 3071, 3055, 3039, 3023, 3007, 2991, 2975, 2959, 2943, 2927, 2911, 2910, 2894, 2878, 2862, 2846, 2830, 2814, 2798, 2782, 2766, 2750, 2734, 2718, 2702, 2686, 2685, 2669, 2653, 2637, 2621, 2605, 2589, 2573, 2557, 2541, 2525, 2509, 2493, 2477, 2461, 2460, 2444, 2428, 2412, 2396, 2380, 2364, 2348, 2332, 2316, 2300, 2284, 2268, 2252, 2236, 2235, 2219, 2203, 2187, 2171, 2155, 2139, 2123, 2107, 2091, 2075, 2059, 2043, 2027, 2011, 2010, 1994, 1978, 1962, 1946, 1930, 1914, 1898, 1882, 1866, 1850, 1834, 1818, 1802, 1786, 1785, 1769, 1753, 1737, 1721, 1705, 1689, 1673, 1657, 1641, 1625, 1609, 1593, 1577, 1561, 1560, 1544, 1528, 1512, 1496, 1480, 1464, 1448, 1432, 1416, 1400, 1384, 1368, 1352, 1336, 1335, 1319, 1303, 1287, 1271, 1255, 1239, 1223, 1207, 1191, 1175, 1159, 1143, 1127, 1111, 1110, 1094, 1078, 1062, 1046, 1030, 1014, 998, 982, 966, 950, 934, 918, 902, 886, 885, 869, 853, 837, 821, 805, 789, 773, 757, 741, 725, 709, 693, 677, 661, 660, 644, 628, 612, 596, 580, 564, 548, 532, 516, 500, 484, 468, 452, 436, 435, 419, 403, 387, 371, 355, 339, 323, 307, 291, 275, 259, 243, 227, 211]
Starting structural reductions, iteration 1 : 591/606 places, 4546/4771 transitions.
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 15 Pre rules applied. Total rules applied 0 place count 591 transition count 4531
Deduced a syphon composed of 15 places in 3 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 0 with 30 rules applied. Total rules applied 30 place count 576 transition count 4531
Applied a total of 30 rules in 875 ms. Remains 576 /591 variables (removed 15) and now considering 4531/4546 (removed 15) transitions.
[2022-05-22 11:10:19] [INFO ] Flow matrix only has 1397 transitions (discarded 3134 similar events)
// Phase 1: matrix 1397 rows 576 cols
[2022-05-22 11:10:19] [INFO ] Computed 50 place invariants in 18 ms
[2022-05-22 11:10:20] [INFO ] Implicit Places using invariants in 952 ms returned []
[2022-05-22 11:10:20] [INFO ] Flow matrix only has 1397 transitions (discarded 3134 similar events)
// Phase 1: matrix 1397 rows 576 cols
[2022-05-22 11:10:20] [INFO ] Computed 50 place invariants in 15 ms
[2022-05-22 11:10:21] [INFO ] State equation strengthened by 241 read => feed constraints.
[2022-05-22 11:10:25] [INFO ] Implicit Places using invariants and state equation in 4795 ms returned []
Implicit Place search using SMT with State Equation took 5750 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 576/606 places, 4531/4771 transitions.
Random walk for 1250000 steps, including 0 resets, run took 12441 ms (no deadlock found). (steps per millisecond=100 )
Random directed walk for 1250000 steps, including 0 resets, run took 10724 ms (no deadlock found). (steps per millisecond=116 )
[2022-05-22 11:10:48] [INFO ] Flow matrix only has 1397 transitions (discarded 3134 similar events)
// Phase 1: matrix 1397 rows 576 cols
[2022-05-22 11:10:48] [INFO ] Computed 50 place invariants in 23 ms
[2022-05-22 11:10:49] [INFO ] [Real]Absence check using 19 positive place invariants in 16 ms returned sat
[2022-05-22 11:10:50] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 611 ms returned sat
[2022-05-22 11:10:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-22 11:10:51] [INFO ] [Real]Absence check using state equation in 1041 ms returned sat
[2022-05-22 11:10:51] [INFO ] Solution in real domain found non-integer solution.
[2022-05-22 11:10:51] [INFO ] [Nat]Absence check using 19 positive place invariants in 16 ms returned sat
[2022-05-22 11:10:51] [INFO ] [Nat]Absence check using 19 positive and 31 generalized place invariants in 120 ms returned sat
[2022-05-22 11:10:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-22 11:10:52] [INFO ] [Nat]Absence check using state equation in 1032 ms returned sat
[2022-05-22 11:10:52] [INFO ] State equation strengthened by 241 read => feed constraints.
[2022-05-22 11:10:53] [INFO ] [Nat]Added 241 Read/Feed constraints in 186 ms returned sat
[2022-05-22 11:10:53] [INFO ] Deduced a trap composed of 74 places in 247 ms of which 2 ms to minimize.
[2022-05-22 11:10:53] [INFO ] Deduced a trap composed of 61 places in 237 ms of which 2 ms to minimize.
[2022-05-22 11:10:54] [INFO ] Deduced a trap composed of 61 places in 276 ms of which 1 ms to minimize.
[2022-05-22 11:10:54] [INFO ] Deduced a trap composed of 74 places in 183 ms of which 1 ms to minimize.
[2022-05-22 11:10:54] [INFO ] Deduced a trap composed of 61 places in 202 ms of which 1 ms to minimize.
[2022-05-22 11:10:54] [INFO ] Deduced a trap composed of 74 places in 146 ms of which 1 ms to minimize.
[2022-05-22 11:10:55] [INFO ] Deduced a trap composed of 61 places in 151 ms of which 0 ms to minimize.
[2022-05-22 11:10:55] [INFO ] Deduced a trap composed of 74 places in 111 ms of which 1 ms to minimize.
[2022-05-22 11:10:55] [INFO ] Deduced a trap composed of 61 places in 182 ms of which 1 ms to minimize.
[2022-05-22 11:10:56] [INFO ] Deduced a trap composed of 74 places in 160 ms of which 1 ms to minimize.
[2022-05-22 11:10:56] [INFO ] Deduced a trap composed of 61 places in 118 ms of which 0 ms to minimize.
[2022-05-22 11:10:56] [INFO ] Deduced a trap composed of 74 places in 117 ms of which 0 ms to minimize.
[2022-05-22 11:10:56] [INFO ] Deduced a trap composed of 61 places in 119 ms of which 1 ms to minimize.
[2022-05-22 11:10:56] [INFO ] Deduced a trap composed of 61 places in 118 ms of which 0 ms to minimize.
[2022-05-22 11:10:57] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 4593 ms
[2022-05-22 11:10:58] [INFO ] Computed and/alt/rep : 30/45/30 causal constraints (skipped 1352 transitions) in 270 ms.
[2022-05-22 11:10:58] [INFO ] Added : 30 causal constraints over 6 iterations in 778 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 17 ms.
Parikh directed walk for 185100 steps, including 1000 resets, run took 2432 ms. (steps per millisecond=76 )
Random directed walk for 500001 steps, including 0 resets, run took 3743 ms (no deadlock found). (steps per millisecond=133 )
Random walk for 500000 steps, including 0 resets, run took 4707 ms (no deadlock found). (steps per millisecond=106 )
Random directed walk for 500001 steps, including 0 resets, run took 3730 ms (no deadlock found). (steps per millisecond=134 )
Random walk for 500000 steps, including 0 resets, run took 4709 ms (no deadlock found). (steps per millisecond=106 )
Starting structural reductions, iteration 0 : 576/576 places, 4531/4531 transitions.
Applied a total of 0 rules in 817 ms. Remains 576 /576 variables (removed 0) and now considering 4531/4531 (removed 0) transitions.
[2022-05-22 11:11:18] [INFO ] Flow matrix only has 1397 transitions (discarded 3134 similar events)
// Phase 1: matrix 1397 rows 576 cols
[2022-05-22 11:11:18] [INFO ] Computed 50 place invariants in 15 ms
[2022-05-22 11:11:19] [INFO ] Implicit Places using invariants in 984 ms returned []
[2022-05-22 11:11:19] [INFO ] Flow matrix only has 1397 transitions (discarded 3134 similar events)
// Phase 1: matrix 1397 rows 576 cols
[2022-05-22 11:11:19] [INFO ] Computed 50 place invariants in 14 ms
[2022-05-22 11:11:20] [INFO ] State equation strengthened by 241 read => feed constraints.
[2022-05-22 11:11:24] [INFO ] Implicit Places using invariants and state equation in 4570 ms returned []
Implicit Place search using SMT with State Equation took 5556 ms to find 0 implicit places.
[2022-05-22 11:11:24] [INFO ] Redundant transitions in 197 ms returned []
[2022-05-22 11:11:24] [INFO ] Flow matrix only has 1397 transitions (discarded 3134 similar events)
// Phase 1: matrix 1397 rows 576 cols
[2022-05-22 11:11:24] [INFO ] Computed 50 place invariants in 9 ms
[2022-05-22 11:11:26] [INFO ] Dead Transitions using invariants and state equation in 1843 ms returned []
Finished structural reductions, in 1 iterations. Remains : 576/576 places, 4531/4531 transitions.
Random walk for 1250000 steps, including 0 resets, run took 11588 ms (no deadlock found). (steps per millisecond=107 )
Random directed walk for 1250001 steps, including 0 resets, run took 9382 ms (no deadlock found). (steps per millisecond=133 )
[2022-05-22 11:11:47] [INFO ] Flow matrix only has 1397 transitions (discarded 3134 similar events)
// Phase 1: matrix 1397 rows 576 cols
[2022-05-22 11:11:47] [INFO ] Computed 50 place invariants in 14 ms
[2022-05-22 11:11:47] [INFO ] [Real]Absence check using 19 positive place invariants in 15 ms returned sat
[2022-05-22 11:11:48] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 606 ms returned sat
[2022-05-22 11:11:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-22 11:11:49] [INFO ] [Real]Absence check using state equation in 1014 ms returned sat
[2022-05-22 11:11:49] [INFO ] Solution in real domain found non-integer solution.
[2022-05-22 11:11:50] [INFO ] [Nat]Absence check using 19 positive place invariants in 14 ms returned sat
[2022-05-22 11:11:50] [INFO ] [Nat]Absence check using 19 positive and 31 generalized place invariants in 119 ms returned sat
[2022-05-22 11:11:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-22 11:11:51] [INFO ] [Nat]Absence check using state equation in 967 ms returned sat
[2022-05-22 11:11:51] [INFO ] State equation strengthened by 241 read => feed constraints.
[2022-05-22 11:11:51] [INFO ] [Nat]Added 241 Read/Feed constraints in 176 ms returned sat
[2022-05-22 11:11:51] [INFO ] Deduced a trap composed of 74 places in 117 ms of which 1 ms to minimize.
[2022-05-22 11:11:51] [INFO ] Deduced a trap composed of 61 places in 131 ms of which 1 ms to minimize.
[2022-05-22 11:11:52] [INFO ] Deduced a trap composed of 61 places in 114 ms of which 0 ms to minimize.
[2022-05-22 11:11:52] [INFO ] Deduced a trap composed of 74 places in 133 ms of which 1 ms to minimize.
[2022-05-22 11:11:52] [INFO ] Deduced a trap composed of 61 places in 183 ms of which 1 ms to minimize.
[2022-05-22 11:11:52] [INFO ] Deduced a trap composed of 74 places in 145 ms of which 0 ms to minimize.
[2022-05-22 11:11:52] [INFO ] Deduced a trap composed of 61 places in 119 ms of which 0 ms to minimize.
[2022-05-22 11:11:52] [INFO ] Deduced a trap composed of 74 places in 136 ms of which 0 ms to minimize.
[2022-05-22 11:11:53] [INFO ] Deduced a trap composed of 61 places in 186 ms of which 0 ms to minimize.
[2022-05-22 11:11:53] [INFO ] Deduced a trap composed of 74 places in 128 ms of which 0 ms to minimize.
[2022-05-22 11:11:53] [INFO ] Deduced a trap composed of 61 places in 140 ms of which 0 ms to minimize.
[2022-05-22 11:11:54] [INFO ] Deduced a trap composed of 74 places in 163 ms of which 0 ms to minimize.
[2022-05-22 11:11:54] [INFO ] Deduced a trap composed of 61 places in 107 ms of which 0 ms to minimize.
[2022-05-22 11:11:54] [INFO ] Deduced a trap composed of 61 places in 103 ms of which 0 ms to minimize.
[2022-05-22 11:11:55] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 3829 ms
[2022-05-22 11:11:55] [INFO ] Computed and/alt/rep : 30/45/30 causal constraints (skipped 1352 transitions) in 148 ms.
[2022-05-22 11:11:55] [INFO ] Added : 30 causal constraints over 6 iterations in 606 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 10 ms.
Parikh directed walk for 185100 steps, including 1000 resets, run took 2254 ms. (steps per millisecond=82 )
Random directed walk for 500000 steps, including 0 resets, run took 3711 ms (no deadlock found). (steps per millisecond=134 )
Random walk for 500000 steps, including 0 resets, run took 4709 ms (no deadlock found). (steps per millisecond=106 )
Random directed walk for 500006 steps, including 0 resets, run took 3708 ms (no deadlock found). (steps per millisecond=134 )
Random walk for 500000 steps, including 0 resets, run took 4700 ms (no deadlock found). (steps per millisecond=106 )
[2022-05-22 11:12:15] [INFO ] Flatten gal took : 422 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin11981758010290834675
[2022-05-22 11:12:16] [INFO ] Too many transitions (4771) to apply POR reductions. Disabling POR matrices.
[2022-05-22 11:12:16] [INFO ] Applying decomposition
[2022-05-22 11:12:16] [INFO ] Built C files in 204ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11981758010290834675
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin11981758010290834675]
[2022-05-22 11:12:16] [INFO ] Flatten gal took : 257 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph16348375668717904549.txt, -o, /tmp/graph16348375668717904549.bin, -w, /tmp/graph16348375668717904549.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph16348375668717904549.bin, -l, -1, -v, -w, /tmp/graph16348375668717904549.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-05-22 11:12:16] [INFO ] Decomposing Gal with order
[2022-05-22 11:12:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-22 11:12:17] [INFO ] Removed a total of 13233 redundant transitions.
[2022-05-22 11:12:17] [INFO ] Flatten gal took : 877 ms
[2022-05-22 11:12:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 700 labels/synchronizations in 151 ms.
[2022-05-22 11:12:18] [INFO ] Time to serialize gal into /tmp/ReachabilityDeadlock243353272524678179.gal : 37 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityDeadlock243353272524678179.gal, -t, CGAL, -ctl, DEADLOCK], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityDeadlock243353272524678179.gal -t CGAL -ctl DEADLOCK
No direction supplied, using forward translation only.
Compilation finished in 77978 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin11981758010290834675]
Link finished in 89 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, -d], workingDir=/tmp/ltsmin11981758010290834675]
Detected timeout of ITS tools.
[2022-05-22 11:23:00] [INFO ] Flatten gal took : 576 ms
[2022-05-22 11:23:00] [INFO ] Time to serialize gal into /tmp/ReachabilityDeadlock17516479810374168600.gal : 52 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityDeadlock17516479810374168600.gal, -t, CGAL, -ctl, DEADLOCK, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityDeadlock17516479810374168600.gal -t CGAL -ctl DEADLOCK --gen-order FOLLOW
No direction supplied, using forward translation only.
Detected timeout of ITS tools.
[2022-05-22 11:33:43] [INFO ] Flatten gal took : 651 ms
[2022-05-22 11:33:43] [INFO ] Input system was already deterministic with 4771 transitions.
[2022-05-22 11:33:43] [INFO ] Transformed 606 places.
[2022-05-22 11:33:43] [INFO ] Transformed 4771 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-05-22 11:34:14] [INFO ] Time to serialize gal into /tmp/ReachabilityDeadlock2374409688003405343.gal : 41 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityDeadlock2374409688003405343.gal, -t, CGAL, -ctl, DEADLOCK, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityDeadlock2374409688003405343.gal -t CGAL -ctl DEADLOCK --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityDeadlock = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityDeadlock -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination ReachabilityDeadlock -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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="SafeBus-PT-15"
export BK_EXAMINATION="ReachabilityDeadlock"
export BK_TOOL="gold2021"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool gold2021"
echo " Input is SafeBus-PT-15, examination is ReachabilityDeadlock"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r216-oct2-165281606300176"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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