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-165281606300171.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-10, examination is ReachabilityDeadlock
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r216-oct2-165281606300171
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.9M
-rw-r--r-- 1 mcc users 26K Apr 29 11:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 155K Apr 29 11:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 213K Apr 29 11:44 CTLFireability.txt
-rw-r--r-- 1 mcc users 959K Apr 29 11:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 8.4K May 9 08:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 42K May 9 08:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 75K May 9 08:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 259K May 9 08:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K May 9 08:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 8.1K 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 1.2M 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 1653217794676

Running Version 0
[2022-05-22 11:09:57] [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:09:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-22 11:09:57] [INFO ] Load time of PNML (sax parser for PT used): 152 ms
[2022-05-22 11:09:57] [INFO ] Transformed 316 places.
[2022-05-22 11:09:57] [INFO ] Transformed 1631 transitions.
[2022-05-22 11:09:57] [INFO ] Parsed PT model containing 316 places and 1631 transitions in 207 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 10 places and 0 transitions.
Built sparse matrix representations for Structural reductions in 5 ms.21187KB memory used
Starting structural reductions, iteration 0 : 306/306 places, 1631/1631 transitions.
Applied a total of 0 rules in 289 ms. Remains 306 /306 variables (removed 0) and now considering 1631/1631 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 306/306 places, 1631/1631 transitions.
Starting structural reductions, iteration 0 : 306/306 places, 1631/1631 transitions.
Applied a total of 0 rules in 137 ms. Remains 306 /306 variables (removed 0) and now considering 1631/1631 (removed 0) transitions.
[2022-05-22 11:09:57] [INFO ] Flow matrix only has 642 transitions (discarded 989 similar events)
// Phase 1: matrix 642 rows 306 cols
[2022-05-22 11:09:58] [INFO ] Computed 45 place invariants in 37 ms
[2022-05-22 11:09:58] [INFO ] Implicit Places using invariants in 850 ms returned [266, 267, 268, 269, 270, 271, 272, 273, 274, 275]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 879 ms to find 10 implicit places.
[2022-05-22 11:09:58] [INFO ] Redundant transitions in 111 ms returned []
[2022-05-22 11:09:58] [INFO ] Flow matrix only has 642 transitions (discarded 989 similar events)
// Phase 1: matrix 642 rows 296 cols
[2022-05-22 11:09:58] [INFO ] Computed 35 place invariants in 10 ms
[2022-05-22 11:09:59] [INFO ] Dead Transitions using invariants and state equation in 944 ms returned [91, 102, 113, 124, 135, 146, 157, 168, 179, 190, 191, 202, 213, 224, 235, 246, 257, 268, 279, 290, 291, 302, 313, 324, 335, 346, 357, 368, 379, 390, 391, 402, 413, 424, 435, 446, 457, 468, 479, 490, 491, 502, 513, 524, 535, 546, 557, 568, 579, 590, 591, 602, 613, 624, 635, 646, 657, 668, 679, 690, 691, 702, 713, 724, 735, 746, 757, 768, 779, 790, 791, 802, 813, 824, 835, 846, 857, 868, 879, 890, 891, 902, 913, 924, 935, 946, 957, 968, 979, 990, 991, 1002, 1013, 1024, 1035, 1046, 1057, 1068, 1079, 1090]
Found 100 dead transitions using SMT.
Drop transitions removed 100 transitions
Dead transitions reduction (with SMT) removed 100 transitions :[1090, 1079, 1068, 1057, 1046, 1035, 1024, 1013, 1002, 991, 990, 979, 968, 957, 946, 935, 924, 913, 902, 891, 890, 879, 868, 857, 846, 835, 824, 813, 802, 791, 790, 779, 768, 757, 746, 735, 724, 713, 702, 691, 690, 679, 668, 657, 646, 635, 624, 613, 602, 591, 590, 579, 568, 557, 546, 535, 524, 513, 502, 491, 490, 479, 468, 457, 446, 435, 424, 413, 402, 391, 390, 379, 368, 357, 346, 335, 324, 313, 302, 291, 290, 279, 268, 257, 246, 235, 224, 213, 202, 191, 190, 179, 168, 157, 146, 135, 124, 113, 102, 91]
Starting structural reductions, iteration 1 : 296/306 places, 1531/1631 transitions.
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 10 Pre rules applied. Total rules applied 0 place count 296 transition count 1521
Deduced a syphon composed of 10 places in 10 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 286 transition count 1521
Applied a total of 20 rules in 143 ms. Remains 286 /296 variables (removed 10) and now considering 1521/1531 (removed 10) transitions.
[2022-05-22 11:10:00] [INFO ] Flow matrix only has 632 transitions (discarded 889 similar events)
// Phase 1: matrix 632 rows 286 cols
[2022-05-22 11:10:00] [INFO ] Computed 35 place invariants in 12 ms
[2022-05-22 11:10:00] [INFO ] Implicit Places using invariants in 298 ms returned []
[2022-05-22 11:10:00] [INFO ] Flow matrix only has 632 transitions (discarded 889 similar events)
// Phase 1: matrix 632 rows 286 cols
[2022-05-22 11:10:00] [INFO ] Computed 35 place invariants in 6 ms
[2022-05-22 11:10:00] [INFO ] State equation strengthened by 111 read => feed constraints.
[2022-05-22 11:10:02] [INFO ] Implicit Places using invariants and state equation in 2161 ms returned []
Implicit Place search using SMT with State Equation took 2463 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 286/306 places, 1521/1631 transitions.
Random walk for 1250000 steps, including 0 resets, run took 5188 ms (no deadlock found). (steps per millisecond=240 )
Random directed walk for 1250002 steps, including 0 resets, run took 4000 ms (no deadlock found). (steps per millisecond=312 )
[2022-05-22 11:10:11] [INFO ] Flow matrix only has 632 transitions (discarded 889 similar events)
// Phase 1: matrix 632 rows 286 cols
[2022-05-22 11:10:11] [INFO ] Computed 35 place invariants in 5 ms
[2022-05-22 11:10:11] [INFO ] [Real]Absence check using 14 positive place invariants in 6 ms returned sat
[2022-05-22 11:10:12] [INFO ] [Real]Absence check using 14 positive and 21 generalized place invariants in 152 ms returned sat
[2022-05-22 11:10:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-22 11:10:12] [INFO ] [Real]Absence check using state equation in 277 ms returned sat
[2022-05-22 11:10:12] [INFO ] Solution in real domain found non-integer solution.
[2022-05-22 11:10:12] [INFO ] [Nat]Absence check using 14 positive place invariants in 6 ms returned sat
[2022-05-22 11:10:12] [INFO ] [Nat]Absence check using 14 positive and 21 generalized place invariants in 57 ms returned sat
[2022-05-22 11:10:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-22 11:10:12] [INFO ] [Nat]Absence check using state equation in 245 ms returned sat
[2022-05-22 11:10:12] [INFO ] State equation strengthened by 111 read => feed constraints.
[2022-05-22 11:10:13] [INFO ] [Nat]Added 111 Read/Feed constraints in 79 ms returned sat
[2022-05-22 11:10:13] [INFO ] Deduced a trap composed of 49 places in 174 ms of which 6 ms to minimize.
[2022-05-22 11:10:13] [INFO ] Deduced a trap composed of 41 places in 135 ms of which 3 ms to minimize.
[2022-05-22 11:10:13] [INFO ] Deduced a trap composed of 49 places in 109 ms of which 0 ms to minimize.
[2022-05-22 11:10:13] [INFO ] Deduced a trap composed of 41 places in 82 ms of which 0 ms to minimize.
[2022-05-22 11:10:13] [INFO ] Deduced a trap composed of 41 places in 69 ms of which 1 ms to minimize.
[2022-05-22 11:10:13] [INFO ] Deduced a trap composed of 41 places in 48 ms of which 1 ms to minimize.
[2022-05-22 11:10:13] [INFO ] Deduced a trap composed of 41 places in 49 ms of which 1 ms to minimize.
[2022-05-22 11:10:14] [INFO ] Deduced a trap composed of 49 places in 47 ms of which 0 ms to minimize.
[2022-05-22 11:10:14] [INFO ] Deduced a trap composed of 49 places in 48 ms of which 0 ms to minimize.
[2022-05-22 11:10:14] [INFO ] Deduced a trap composed of 49 places in 48 ms of which 0 ms to minimize.
[2022-05-22 11:10:14] [INFO ] Deduced a trap composed of 49 places in 49 ms of which 0 ms to minimize.
[2022-05-22 11:10:14] [INFO ] Deduced a trap composed of 49 places in 57 ms of which 1 ms to minimize.
[2022-05-22 11:10:14] [INFO ] Deduced a trap composed of 49 places in 83 ms of which 1 ms to minimize.
[2022-05-22 11:10:14] [INFO ] Deduced a trap composed of 49 places in 61 ms of which 1 ms to minimize.
[2022-05-22 11:10:14] [INFO ] Deduced a trap composed of 49 places in 68 ms of which 0 ms to minimize.
[2022-05-22 11:10:14] [INFO ] Deduced a trap composed of 57 places in 46 ms of which 1 ms to minimize.
[2022-05-22 11:10:14] [INFO ] Deduced a trap composed of 49 places in 63 ms of which 0 ms to minimize.
[2022-05-22 11:10:14] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 1753 ms
[2022-05-22 11:10:14] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 602 transitions) in 74 ms.
[2022-05-22 11:10:15] [INFO ] Added : 20 causal constraints over 4 iterations in 245 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 15 ms.
Parikh directed walk for 83000 steps, including 993 resets, run took 462 ms. (steps per millisecond=179 )
Random directed walk for 500002 steps, including 0 resets, run took 1483 ms (no deadlock found). (steps per millisecond=337 )
Random walk for 500000 steps, including 0 resets, run took 1821 ms (no deadlock found). (steps per millisecond=274 )
Random directed walk for 500000 steps, including 0 resets, run took 1466 ms (no deadlock found). (steps per millisecond=341 )
Random walk for 500000 steps, including 0 resets, run took 1826 ms (no deadlock found). (steps per millisecond=273 )
Starting structural reductions, iteration 0 : 286/286 places, 1521/1521 transitions.
Applied a total of 0 rules in 161 ms. Remains 286 /286 variables (removed 0) and now considering 1521/1521 (removed 0) transitions.
[2022-05-22 11:10:22] [INFO ] Flow matrix only has 632 transitions (discarded 889 similar events)
// Phase 1: matrix 632 rows 286 cols
[2022-05-22 11:10:22] [INFO ] Computed 35 place invariants in 5 ms
[2022-05-22 11:10:22] [INFO ] Implicit Places using invariants in 360 ms returned []
[2022-05-22 11:10:22] [INFO ] Flow matrix only has 632 transitions (discarded 889 similar events)
// Phase 1: matrix 632 rows 286 cols
[2022-05-22 11:10:22] [INFO ] Computed 35 place invariants in 11 ms
[2022-05-22 11:10:22] [INFO ] State equation strengthened by 111 read => feed constraints.
[2022-05-22 11:10:24] [INFO ] Implicit Places using invariants and state equation in 1483 ms returned []
Implicit Place search using SMT with State Equation took 1864 ms to find 0 implicit places.
[2022-05-22 11:10:24] [INFO ] Redundant transitions in 27 ms returned []
[2022-05-22 11:10:24] [INFO ] Flow matrix only has 632 transitions (discarded 889 similar events)
// Phase 1: matrix 632 rows 286 cols
[2022-05-22 11:10:24] [INFO ] Computed 35 place invariants in 13 ms
[2022-05-22 11:10:24] [INFO ] Dead Transitions using invariants and state equation in 481 ms returned []
Finished structural reductions, in 1 iterations. Remains : 286/286 places, 1521/1521 transitions.
Random walk for 1250000 steps, including 0 resets, run took 4623 ms (no deadlock found). (steps per millisecond=270 )
Random directed walk for 1250009 steps, including 0 resets, run took 3678 ms (no deadlock found). (steps per millisecond=339 )
[2022-05-22 11:10:33] [INFO ] Flow matrix only has 632 transitions (discarded 889 similar events)
// Phase 1: matrix 632 rows 286 cols
[2022-05-22 11:10:33] [INFO ] Computed 35 place invariants in 9 ms
[2022-05-22 11:10:33] [INFO ] [Real]Absence check using 14 positive place invariants in 13 ms returned sat
[2022-05-22 11:10:33] [INFO ] [Real]Absence check using 14 positive and 21 generalized place invariants in 180 ms returned sat
[2022-05-22 11:10:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-22 11:10:33] [INFO ] [Real]Absence check using state equation in 297 ms returned sat
[2022-05-22 11:10:33] [INFO ] Solution in real domain found non-integer solution.
[2022-05-22 11:10:34] [INFO ] [Nat]Absence check using 14 positive place invariants in 6 ms returned sat
[2022-05-22 11:10:34] [INFO ] [Nat]Absence check using 14 positive and 21 generalized place invariants in 47 ms returned sat
[2022-05-22 11:10:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-22 11:10:34] [INFO ] [Nat]Absence check using state equation in 247 ms returned sat
[2022-05-22 11:10:34] [INFO ] State equation strengthened by 111 read => feed constraints.
[2022-05-22 11:10:34] [INFO ] [Nat]Added 111 Read/Feed constraints in 88 ms returned sat
[2022-05-22 11:10:34] [INFO ] Deduced a trap composed of 49 places in 69 ms of which 0 ms to minimize.
[2022-05-22 11:10:34] [INFO ] Deduced a trap composed of 41 places in 50 ms of which 0 ms to minimize.
[2022-05-22 11:10:34] [INFO ] Deduced a trap composed of 49 places in 67 ms of which 0 ms to minimize.
[2022-05-22 11:10:34] [INFO ] Deduced a trap composed of 41 places in 48 ms of which 1 ms to minimize.
[2022-05-22 11:10:34] [INFO ] Deduced a trap composed of 41 places in 48 ms of which 1 ms to minimize.
[2022-05-22 11:10:35] [INFO ] Deduced a trap composed of 41 places in 49 ms of which 1 ms to minimize.
[2022-05-22 11:10:35] [INFO ] Deduced a trap composed of 41 places in 52 ms of which 0 ms to minimize.
[2022-05-22 11:10:35] [INFO ] Deduced a trap composed of 49 places in 60 ms of which 1 ms to minimize.
[2022-05-22 11:10:35] [INFO ] Deduced a trap composed of 49 places in 82 ms of which 1 ms to minimize.
[2022-05-22 11:10:35] [INFO ] Deduced a trap composed of 49 places in 67 ms of which 1 ms to minimize.
[2022-05-22 11:10:35] [INFO ] Deduced a trap composed of 49 places in 56 ms of which 1 ms to minimize.
[2022-05-22 11:10:35] [INFO ] Deduced a trap composed of 49 places in 55 ms of which 0 ms to minimize.
[2022-05-22 11:10:35] [INFO ] Deduced a trap composed of 49 places in 55 ms of which 0 ms to minimize.
[2022-05-22 11:10:35] [INFO ] Deduced a trap composed of 49 places in 69 ms of which 0 ms to minimize.
[2022-05-22 11:10:35] [INFO ] Deduced a trap composed of 49 places in 58 ms of which 1 ms to minimize.
[2022-05-22 11:10:35] [INFO ] Deduced a trap composed of 57 places in 55 ms of which 0 ms to minimize.
[2022-05-22 11:10:36] [INFO ] Deduced a trap composed of 49 places in 70 ms of which 0 ms to minimize.
[2022-05-22 11:10:36] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 1642 ms
[2022-05-22 11:10:36] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 602 transitions) in 66 ms.
[2022-05-22 11:10:36] [INFO ] Added : 20 causal constraints over 4 iterations in 237 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 7 ms.
Parikh directed walk for 83000 steps, including 994 resets, run took 460 ms. (steps per millisecond=180 )
Random directed walk for 500001 steps, including 0 resets, run took 1647 ms (no deadlock found). (steps per millisecond=303 )
Random walk for 500000 steps, including 0 resets, run took 1925 ms (no deadlock found). (steps per millisecond=259 )
Random directed walk for 500000 steps, including 0 resets, run took 1533 ms (no deadlock found). (steps per millisecond=326 )
Random walk for 500000 steps, including 0 resets, run took 1843 ms (no deadlock found). (steps per millisecond=271 )
[2022-05-22 11:10:44] [INFO ] Flatten gal took : 302 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin13452176686344500798
[2022-05-22 11:10:44] [INFO ] Too many transitions (1631) to apply POR reductions. Disabling POR matrices.
[2022-05-22 11:10:44] [INFO ] Applying decomposition
[2022-05-22 11:10:44] [INFO ] Built C files in 107ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13452176686344500798
[2022-05-22 11:10:44] [INFO ] Flatten gal took : 178 ms
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/ltsmin13452176686344500798]
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/graph4017063900555917382.txt, -o, /tmp/graph4017063900555917382.bin, -w, /tmp/graph4017063900555917382.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/graph4017063900555917382.bin, -l, -1, -v, -w, /tmp/graph4017063900555917382.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-05-22 11:10:45] [INFO ] Decomposing Gal with order
[2022-05-22 11:10:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-22 11:10:45] [INFO ] Removed a total of 2965 redundant transitions.
[2022-05-22 11:10:46] [INFO ] Flatten gal took : 790 ms
[2022-05-22 11:10:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 813 labels/synchronizations in 84 ms.
[2022-05-22 11:10:46] [INFO ] Time to serialize gal into /tmp/ReachabilityDeadlock14145577579379174381.gal : 34 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/ReachabilityDeadlock14145577579379174381.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/ReachabilityDeadlock14145577579379174381.gal -t CGAL -ctl DEADLOCK
No direction supplied, using forward translation only.
Compilation finished in 14603 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin13452176686344500798]
Link finished in 74 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/ltsmin13452176686344500798]
Detected timeout of ITS tools.
[2022-05-22 11:21:02] [INFO ] Flatten gal took : 232 ms
[2022-05-22 11:21:02] [INFO ] Time to serialize gal into /tmp/ReachabilityDeadlock11531690307178913354.gal : 74 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/ReachabilityDeadlock11531690307178913354.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/ReachabilityDeadlock11531690307178913354.gal -t CGAL -ctl DEADLOCK --gen-order FOLLOW
No direction supplied, using forward translation only.
Detected timeout of ITS tools.
[2022-05-22 11:31:17] [INFO ] Flatten gal took : 232 ms
[2022-05-22 11:31:17] [INFO ] Input system was already deterministic with 1631 transitions.
[2022-05-22 11:31:18] [INFO ] Transformed 306 places.
[2022-05-22 11:31:18] [INFO ] Transformed 1631 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:31:48] [INFO ] Time to serialize gal into /tmp/ReachabilityDeadlock1885376790637354253.gal : 6 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/ReachabilityDeadlock1885376790637354253.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/ReachabilityDeadlock1885376790637354253.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-10"
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-10, 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-165281606300171"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SafeBus-PT-10.tgz
mv SafeBus-PT-10 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 ;