About the Execution of 2021-gold for ShieldIIPt-PT-010B
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
11236.544 | 1800000.00 | 6135436.00 | 1140.70 | [undef] | Time out reached |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2022-input.r234-tall-165286037900166.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/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 ShieldIIPt-PT-010B, examination is ReachabilityDeadlock
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r234-tall-165286037900166
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 436K
-rw-r--r-- 1 mcc users 9.3K Apr 29 18:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 111K Apr 29 18:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Apr 29 18:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Apr 29 18:23 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K May 9 08:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 08:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 08:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 08:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 167K 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 1653032695848
Running Version 0
[2022-05-20 07:44: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-20 07:44:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 07:44:57] [INFO ] Load time of PNML (sax parser for PT used): 71 ms
[2022-05-20 07:44:57] [INFO ] Transformed 703 places.
[2022-05-20 07:44:57] [INFO ] Transformed 653 transitions.
[2022-05-20 07:44:57] [INFO ] Found NUPN structural information;
[2022-05-20 07:44:57] [INFO ] Parsed PT model containing 703 places and 653 transitions in 116 ms.
Parsed 1 properties from file /home/mcc/execution/ReachabilityDeadlock.xml in 3 ms.
Working with output stream class java.io.PrintStream
Built sparse matrix representations for Structural reductions in 5 ms.22113KB memory used
Starting structural reductions, iteration 0 : 703/703 places, 653/653 transitions.
Drop transitions removed 172 transitions
Trivial Post-agglo rules discarded 172 transitions
Performed 172 trivial Post agglomeration. Transition count delta: 172
Iterating post reduction 0 with 172 rules applied. Total rules applied 172 place count 703 transition count 481
Reduce places removed 172 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 174 rules applied. Total rules applied 346 place count 531 transition count 479
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 347 place count 530 transition count 479
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 41 Pre rules applied. Total rules applied 347 place count 530 transition count 438
Deduced a syphon composed of 41 places in 1 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 3 with 82 rules applied. Total rules applied 429 place count 489 transition count 438
Discarding 70 places :
Symmetric choice reduction at 3 with 70 rule applications. Total rules 499 place count 419 transition count 368
Iterating global reduction 3 with 70 rules applied. Total rules applied 569 place count 419 transition count 368
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 30 Pre rules applied. Total rules applied 569 place count 419 transition count 338
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 629 place count 389 transition count 338
Performed 169 Post agglomeration using F-continuation condition.Transition count delta: 169
Deduced a syphon composed of 169 places in 0 ms
Reduce places removed 169 places and 0 transitions.
Iterating global reduction 3 with 338 rules applied. Total rules applied 967 place count 220 transition count 169
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 1025 place count 191 transition count 188
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1026 place count 190 transition count 187
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1028 place count 188 transition count 187
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1028 place count 188 transition count 186
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1030 place count 187 transition count 186
Applied a total of 1030 rules in 156 ms. Remains 187 /703 variables (removed 516) and now considering 186/653 (removed 467) transitions.
Finished structural reductions, in 1 iterations. Remains : 187/703 places, 186/653 transitions.
Random walk for 1250000 steps, including 0 resets, run took 3378 ms (no deadlock found). (steps per millisecond=370 )
Random directed walk for 1250004 steps, including 0 resets, run took 2239 ms (no deadlock found). (steps per millisecond=558 )
// Phase 1: matrix 186 rows 187 cols
[2022-05-20 07:45:03] [INFO ] Computed 89 place invariants in 13 ms
[2022-05-20 07:45:03] [INFO ] [Real]Absence check using 89 positive place invariants in 20 ms returned sat
[2022-05-20 07:45:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 07:45:03] [INFO ] [Real]Absence check using state equation in 79 ms returned sat
[2022-05-20 07:45:03] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 07:45:03] [INFO ] [Nat]Absence check using 89 positive place invariants in 19 ms returned sat
[2022-05-20 07:45:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 07:45:03] [INFO ] [Nat]Absence check using state equation in 80 ms returned sat
[2022-05-20 07:45:03] [INFO ] Computed and/alt/rep : 182/278/182 causal constraints (skipped 0 transitions) in 14 ms.
[2022-05-20 07:45:04] [INFO ] Added : 142 causal constraints over 29 iterations in 513 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 9 ms.
Parikh directed walk for 105600 steps, including 462 resets, run took 352 ms. (steps per millisecond=300 )
Random directed walk for 500000 steps, including 0 resets, run took 942 ms (no deadlock found). (steps per millisecond=530 )
Random walk for 500000 steps, including 0 resets, run took 1323 ms (no deadlock found). (steps per millisecond=377 )
Random directed walk for 500006 steps, including 0 resets, run took 891 ms (no deadlock found). (steps per millisecond=561 )
Random walk for 500000 steps, including 0 resets, run took 1364 ms (no deadlock found). (steps per millisecond=366 )
Starting structural reductions, iteration 0 : 187/187 places, 186/186 transitions.
Applied a total of 0 rules in 7 ms. Remains 187 /187 variables (removed 0) and now considering 186/186 (removed 0) transitions.
// Phase 1: matrix 186 rows 187 cols
[2022-05-20 07:45:09] [INFO ] Computed 89 place invariants in 6 ms
[2022-05-20 07:45:09] [INFO ] Implicit Places using invariants in 117 ms returned [176]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 118 ms to find 1 implicit places.
[2022-05-20 07:45:09] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 186 rows 186 cols
[2022-05-20 07:45:09] [INFO ] Computed 88 place invariants in 9 ms
[2022-05-20 07:45:09] [INFO ] Dead Transitions using invariants and state equation in 107 ms returned []
Starting structural reductions, iteration 1 : 186/187 places, 186/186 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 185 transition count 185
Applied a total of 2 rules in 10 ms. Remains 185 /186 variables (removed 1) and now considering 185/186 (removed 1) transitions.
// Phase 1: matrix 185 rows 185 cols
[2022-05-20 07:45:09] [INFO ] Computed 88 place invariants in 2 ms
[2022-05-20 07:45:09] [INFO ] Implicit Places using invariants in 99 ms returned []
// Phase 1: matrix 185 rows 185 cols
[2022-05-20 07:45:09] [INFO ] Computed 88 place invariants in 1 ms
[2022-05-20 07:45:09] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 231 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 185/187 places, 185/186 transitions.
Random walk for 1250000 steps, including 0 resets, run took 3253 ms (no deadlock found). (steps per millisecond=384 )
Random directed walk for 1250002 steps, including 0 resets, run took 2130 ms (no deadlock found). (steps per millisecond=586 )
// Phase 1: matrix 185 rows 185 cols
[2022-05-20 07:45:14] [INFO ] Computed 88 place invariants in 8 ms
[2022-05-20 07:45:15] [INFO ] [Real]Absence check using 88 positive place invariants in 19 ms returned sat
[2022-05-20 07:45:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 07:45:15] [INFO ] [Real]Absence check using state equation in 72 ms returned sat
[2022-05-20 07:45:15] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 07:45:15] [INFO ] [Nat]Absence check using 88 positive place invariants in 14 ms returned sat
[2022-05-20 07:45:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 07:45:15] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2022-05-20 07:45:15] [INFO ] Computed and/alt/rep : 181/275/181 causal constraints (skipped 0 transitions) in 12 ms.
[2022-05-20 07:45:15] [INFO ] Added : 133 causal constraints over 27 iterations in 429 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 5 ms.
Parikh directed walk for 81500 steps, including 275 resets, run took 271 ms. (steps per millisecond=300 )
Random directed walk for 500000 steps, including 0 resets, run took 859 ms (no deadlock found). (steps per millisecond=582 )
Random walk for 500000 steps, including 0 resets, run took 1309 ms (no deadlock found). (steps per millisecond=381 )
Random directed walk for 500000 steps, including 0 resets, run took 863 ms (no deadlock found). (steps per millisecond=579 )
Random walk for 500000 steps, including 0 resets, run took 1319 ms (no deadlock found). (steps per millisecond=379 )
[2022-05-20 07:45:20] [INFO ] Flatten gal took : 77 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin17189529849240927032
[2022-05-20 07:45:20] [INFO ] Applying decomposition
[2022-05-20 07:45:20] [INFO ] Computing symmetric may disable matrix : 653 transitions.
[2022-05-20 07:45:20] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 07:45:20] [INFO ] Computing symmetric may enable matrix : 653 transitions.
[2022-05-20 07:45:20] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 07:45:20] [INFO ] Flatten gal took : 33 ms
[2022-05-20 07:45:20] [INFO ] Computing Do-Not-Accords matrix : 653 transitions.
[2022-05-20 07:45:20] [INFO ] Computation of Completed DNA matrix. took 16 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 07:45:20] [INFO ] Built C files in 179ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17189529849240927032
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/ltsmin17189529849240927032]
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/graph7685498108383227314.txt, -o, /tmp/graph7685498108383227314.bin, -w, /tmp/graph7685498108383227314.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/graph7685498108383227314.bin, -l, -1, -v, -w, /tmp/graph7685498108383227314.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-05-20 07:45:20] [INFO ] Decomposing Gal with order
[2022-05-20 07:45:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 07:45:20] [INFO ] Removed a total of 60 redundant transitions.
[2022-05-20 07:45:21] [INFO ] Flatten gal took : 79 ms
[2022-05-20 07:45:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 9 ms.
[2022-05-20 07:45:21] [INFO ] Time to serialize gal into /tmp/ReachabilityDeadlock5289578368779809587.gal : 17 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/ReachabilityDeadlock5289578368779809587.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/ReachabilityDeadlock5289578368779809587.gal -t CGAL -ctl DEADLOCK
No direction supplied, using forward translation only.
Compilation finished in 4213 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin17189529849240927032]
Link finished in 64 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/ltsmin17189529849240927032]
Detected timeout of ITS tools.
[2022-05-20 07:55:28] [INFO ] Applying decomposition
[2022-05-20 07:55:28] [INFO ] Flatten gal took : 80 ms
[2022-05-20 07:55:28] [INFO ] Decomposing Gal with order
[2022-05-20 07:55:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 07:55:28] [INFO ] Flatten gal took : 73 ms
[2022-05-20 07:55:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2022-05-20 07:55:29] [INFO ] Time to serialize gal into /tmp/ReachabilityDeadlock7316507655139847854.gal : 23 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/ReachabilityDeadlock7316507655139847854.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/ReachabilityDeadlock7316507655139847854.gal -t CGAL -ctl DEADLOCK
No direction supplied, using forward translation only.
Detected timeout of ITS tools.
[2022-05-20 08:05:36] [INFO ] Flatten gal took : 52 ms
[2022-05-20 08:05:36] [INFO ] Input system was already deterministic with 653 transitions.
[2022-05-20 08:05:36] [INFO ] Transformed 703 places.
[2022-05-20 08:05:36] [INFO ] Transformed 653 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
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-20 08:05:36] [INFO ] Time to serialize gal into /tmp/ReachabilityDeadlock2793659609019499716.gal : 3 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/ReachabilityDeadlock2793659609019499716.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/ReachabilityDeadlock2793659609019499716.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.
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 3/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.004: Loading model from ./gal.so
pins2lts-mc-linux64( 5/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.155: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.155: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.155: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.205: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.216: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.212: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.216: Initializing POR dependencies: labels 653, guards 653
pins2lts-mc-linux64( 7/ 8), 0.235: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.240: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 2.691: There are 653 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 2.691: State length is 703, there are 653 groups
pins2lts-mc-linux64( 0/ 8), 2.691: Running bfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 2.691: Using a non-indexing tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 2.691: Successor permutation: none
pins2lts-mc-linux64( 0/ 8), 2.691: Visible groups: 0 / 653, labels: 0 / 653
pins2lts-mc-linux64( 0/ 8), 2.691: POR cycle proviso: none
pins2lts-mc-linux64( 0/ 8), 2.691: Global bits: 0, count bits: 0, local bits: 0
pins2lts-mc-linux64( 0/ 8), 2.955: ~120 levels ~960 states ~960 transitions
pins2lts-mc-linux64( 0/ 8), 3.110: ~223 levels ~1920 states ~1976 transitions
pins2lts-mc-linux64( 0/ 8), 3.225: ~247 levels ~3840 states ~4264 transitions
pins2lts-mc-linux64( 0/ 8), 3.282: ~257 levels ~7680 states ~8776 transitions
pins2lts-mc-linux64( 0/ 8), 3.403: ~268 levels ~15360 states ~18192 transitions
pins2lts-mc-linux64( 0/ 8), 3.655: ~275 levels ~30720 states ~36560 transitions
pins2lts-mc-linux64( 2/ 8), 4.219: ~52 levels ~61440 states ~76088 transitions
pins2lts-mc-linux64( 2/ 8), 5.220: ~59 levels ~122880 states ~151040 transitions
pins2lts-mc-linux64( 2/ 8), 7.283: ~66 levels ~245760 states ~303816 transitions
pins2lts-mc-linux64( 2/ 8), 11.943: ~74 levels ~491520 states ~609496 transitions
pins2lts-mc-linux64( 4/ 8), 20.719: ~83 levels ~983040 states ~1190496 transitions
pins2lts-mc-linux64( 4/ 8), 38.207: ~90 levels ~1966080 states ~2387072 transitions
pins2lts-mc-linux64( 7/ 8), 74.337: ~108 levels ~3932160 states ~4827760 transitions
pins2lts-mc-linux64( 7/ 8), 146.848: ~115 levels ~7864320 states ~9667384 transitions
pins2lts-mc-linux64( 4/ 8), 294.777: ~111 levels ~15728640 states ~19228976 transitions
pins2lts-mc-linux64( 4/ 8), 591.441: ~118 levels ~31457280 states ~38496872 transitions
pins2lts-mc-linux64( 6/ 8), 1186.517: ~123 levels ~62914560 states ~77132392 transitions
pins2lts-mc-linux64( 6/ 8), 1439.827: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 1439.859:
pins2lts-mc-linux64( 0/ 8), 1439.859: mean standard work distribution: 7.3% (states) 7.3% (transitions)
pins2lts-mc-linux64( 0/ 8), 1439.859:
pins2lts-mc-linux64( 0/ 8), 1439.859: Explored 72365994 states 89086098 transitions, fanout: 1.231
pins2lts-mc-linux64( 0/ 8), 1439.859: Total exploration time 1437.170 sec (1437.140 sec minimum, 1437.149 sec on average)
pins2lts-mc-linux64( 0/ 8), 1439.859: States per second: 50353, Transitions per second: 61987
pins2lts-mc-linux64( 0/ 8), 1439.859:
pins2lts-mc-linux64( 0/ 8), 1439.859: Queue width: 8B, total height: 7446338, memory: 56.81MB
pins2lts-mc-linux64( 0/ 8), 1439.859: Tree memory: 864.9MB, 11.4 B/state, compr.: 0.4%
pins2lts-mc-linux64( 0/ 8), 1439.859: Tree fill ratio (roots/leafs): 59.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 1439.859: Stored 686 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 1439.859: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 1439.859: Est. total memory use: 921.7MB (~1080.8MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing 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/ltsmin17189529849240927032]
255
java.lang.RuntimeException: Unexpected exception when executing 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/ltsmin17189529849240927032]
255
at fr.lip6.move.gal.application.LTSminRunner.checkProperty(LTSminRunner.java:214)
at fr.lip6.move.gal.application.LTSminRunner.access$10(LTSminRunner.java:165)
at fr.lip6.move.gal.application.LTSminRunner$1.checkProperties(LTSminRunner.java:154)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:98)
at java.base/java.lang.Thread.run(Thread.java:834)
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="ShieldIIPt-PT-010B"
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 ShieldIIPt-PT-010B, 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 r234-tall-165286037900166"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPt-PT-010B.tgz
mv ShieldIIPt-PT-010B 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 '
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 ;