About the Execution of 2022-gold for PGCD-COL-D03N050
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
1917.752 | 423436.00 | 563446.00 | 970.50 | F | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r544-tall-167987257700251.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool gold2022
Input is PGCD-COL-D03N050, examination is ReachabilityDeadlock
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r544-tall-167987257700251
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 424K
-rw-r--r-- 1 mcc users 7.2K Mar 23 15:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Mar 23 15:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Mar 23 15:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Mar 23 15:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Mar 23 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 23 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 23 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 23 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 9.3K Mar 23 15:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 100K Mar 23 15:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Mar 23 15:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Mar 23 15:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 23 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 23 07:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 26 22:42 equiv_pt
-rw-r--r-- 1 mcc users 8 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 5 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 16K Mar 26 22:42 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
FORMULA_NAME ReachabilityDeadlock
=== Now, execution of the tool begins
BK_START 1679951150127
Running Version 202205111006
[2023-03-27 21:05:51] [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]
[2023-03-27 21:05:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-27 21:05:51] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-27 21:05:51] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-27 21:05:51] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 578 ms
[2023-03-27 21:05:52] [INFO ] Imported 3 HL places and 3 HL transitions for a total of 12 PT places and 12.0 transition bindings in 24 ms.
Parsed 1 properties from file /home/mcc/execution/ReachabilityDeadlock.xml in 2 ms.
Working with output stream class java.io.PrintStream
[2023-03-27 21:05:52] [INFO ] Built PT skeleton of HLPN with 3 places and 3 transitions 14 arcs in 5 ms.
[2023-03-27 21:05:52] [INFO ] Skeletonized 1 HLPN properties in 0 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Prefix of Interest using HLPN skeleton for deadlock discarded 0 places and 0 transitions.
Arc [0:1*[(MOD (ADD $x 1) 4)]] contains successor/predecessor on variables of sort CD
[2023-03-27 21:05:52] [INFO ] Unfolded HLPN to a Petri net with 12 places and 12 transitions 56 arcs in 6 ms.
[2023-03-27 21:05:52] [INFO ] Unfolded 1 HLPN properties in 0 ms.
Built sparse matrix representations for Structural reductions in 0 ms.11723KB memory used
Starting structural reductions in DEADLOCKS mode, iteration 0 : 12/12 places, 12/12 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 8 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 12 cols
[2023-03-27 21:05:52] [INFO ] Computed 5 place invariants in 8 ms
[2023-03-27 21:05:52] [INFO ] Dead Transitions using invariants and state equation in 122 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 12/12 places, 12/12 transitions.
Starting structural reductions in DEADLOCKS mode, iteration 0 : 12/12 places, 12/12 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 2 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 12 cols
[2023-03-27 21:05:52] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-27 21:05:52] [INFO ] Implicit Places using invariants in 63 ms returned [8, 9, 10, 11]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 66 ms to find 4 implicit places.
Starting structural reductions in DEADLOCKS mode, iteration 1 : 8/12 places, 12/12 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 2 ms. Remains 8 /8 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 8/12 places, 12/12 transitions.
Random walk for 1250130 steps, including 0 resets, run took 227 ms (no deadlock found). (steps per millisecond=5507 )
Random directed walk for 1250031 steps, including 0 resets, run took 182 ms (no deadlock found). (steps per millisecond=6868 )
// Phase 1: matrix 12 rows 8 cols
[2023-03-27 21:05:52] [INFO ] Computed 1 place invariants in 2 ms
[2023-03-27 21:05:52] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-27 21:05:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-27 21:05:52] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-27 21:05:52] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-27 21:05:52] [INFO ] [Real]Added 4 Read/Feed constraints in 6 ms returned sat
[2023-03-27 21:05:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-27 21:05:52] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-27 21:05:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-27 21:05:52] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-03-27 21:05:52] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-27 21:05:52] [INFO ] [Nat]Added 4 Read/Feed constraints in 4 ms returned sat
[2023-03-27 21:05:52] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 2 ms to minimize.
[2023-03-27 21:05:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 22 ms
[2023-03-27 21:05:52] [INFO ] Computed and/alt/rep : 4/8/4 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-27 21:05:52] [INFO ] Added : 1 causal constraints over 1 iterations in 10 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 0 ms.
Parikh directed walk for 8500 steps, including 172 resets, run took 15 ms. (steps per millisecond=566 )
Random directed walk for 500018 steps, including 0 resets, run took 71 ms (no deadlock found). (steps per millisecond=7042 )
Random walk for 500052 steps, including 0 resets, run took 67 ms (no deadlock found). (steps per millisecond=7463 )
Random directed walk for 500002 steps, including 0 resets, run took 56 ms (no deadlock found). (steps per millisecond=8928 )
Random walk for 500012 steps, including 0 resets, run took 60 ms (no deadlock found). (steps per millisecond=8333 )
Starting structural reductions in DEADLOCKS mode, iteration 0 : 8/8 places, 12/12 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 8 cols
[2023-03-27 21:05:53] [INFO ] Computed 1 place invariants in 3 ms
[2023-03-27 21:05:53] [INFO ] Implicit Places using invariants in 29 ms returned []
// Phase 1: matrix 12 rows 8 cols
[2023-03-27 21:05:53] [INFO ] Computed 1 place invariants in 2 ms
[2023-03-27 21:05:53] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-27 21:05:53] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2023-03-27 21:05:53] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 12 rows 8 cols
[2023-03-27 21:05:53] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-27 21:05:53] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 8/8 places, 12/12 transitions.
Random walk for 1250046 steps, including 0 resets, run took 153 ms (no deadlock found). (steps per millisecond=8170 )
Random directed walk for 1250016 steps, including 0 resets, run took 129 ms (no deadlock found). (steps per millisecond=9690 )
// Phase 1: matrix 12 rows 8 cols
[2023-03-27 21:05:53] [INFO ] Computed 1 place invariants in 2 ms
[2023-03-27 21:05:53] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-27 21:05:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-27 21:05:53] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-27 21:05:53] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-27 21:05:53] [INFO ] [Real]Added 4 Read/Feed constraints in 1 ms returned sat
[2023-03-27 21:05:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-27 21:05:53] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-27 21:05:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-27 21:05:53] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-03-27 21:05:53] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-27 21:05:53] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2023-03-27 21:05:53] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2023-03-27 21:05:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 27 ms
[2023-03-27 21:05:53] [INFO ] Computed and/alt/rep : 4/8/4 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-27 21:05:53] [INFO ] Added : 1 causal constraints over 1 iterations in 5 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 3 ms.
Parikh directed walk for 8500 steps, including 181 resets, run took 11 ms. (steps per millisecond=772 )
Random directed walk for 500004 steps, including 0 resets, run took 56 ms (no deadlock found). (steps per millisecond=8928 )
Random walk for 500039 steps, including 0 resets, run took 56 ms (no deadlock found). (steps per millisecond=8929 )
Random directed walk for 500062 steps, including 0 resets, run took 69 ms (no deadlock found). (steps per millisecond=7247 )
Random walk for 500015 steps, including 0 resets, run took 59 ms (no deadlock found). (steps per millisecond=8474 )
[2023-03-27 21:05:53] [INFO ] Flatten gal took : 15 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin13637941218368932501
[2023-03-27 21:05:53] [INFO ] Applying decomposition
[2023-03-27 21:05:53] [INFO ] Flatten gal took : 4 ms
[2023-03-27 21:05:53] [INFO ] Computing symmetric may disable matrix : 12 transitions.
[2023-03-27 21:05:53] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-27 21:05:53] [INFO ] Computing symmetric may enable matrix : 12 transitions.
[2023-03-27 21:05:53] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-27 21:05:53] [INFO ] Computing Do-Not-Accords matrix : 12 transitions.
[2023-03-27 21:05:53] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-27 21:05:53] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13637941218368932501
Running compilation step : cd /tmp/ltsmin13637941218368932501;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph3208679331804063690.txt' '-o' '/tmp/graph3208679331804063690.bin' '-w' '/tmp/graph3208679331804063690.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph3208679331804063690.bin' '-l' '-1' '-v' '-w' '/tmp/graph3208679331804063690.weights' '-q' '0' '-e' '0.001'
[2023-03-27 21:05:54] [INFO ] Decomposing Gal with order
[2023-03-27 21:05:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-27 21:05:54] [INFO ] Flatten gal took : 17 ms
[2023-03-27 21:05:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2023-03-27 21:05:54] [INFO ] Time to serialize gal into /tmp/ReachabilityDeadlock8844013409198859814.gal : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityDeadlock8844013409198859814.gal' '-t' 'CGAL' '-ctl' 'DEADLOCK'
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/R...225
No direction supplied, using forward translation only.
Compilation finished in 250 ms.
Running link step : cd /tmp/ltsmin13637941218368932501;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin13637941218368932501;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-d'
pins2lts-mc-linux64, 0.001: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.002: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.004: Initializing POR dependencies: labels 12, guards 12
pins2lts-mc-linux64( 7/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.010: There are 12 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.010: State length is 12, there are 12 groups
pins2lts-mc-linux64( 0/ 8), 0.010: Running bfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.010: Using a non-indexing tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.010: Successor permutation: none
pins2lts-mc-linux64( 0/ 8), 0.010: Visible groups: 0 / 12, labels: 0 / 12
pins2lts-mc-linux64( 0/ 8), 0.010: POR cycle proviso: none
pins2lts-mc-linux64( 0/ 8), 0.010: Global bits: 0, count bits: 0, local bits: 0
pins2lts-mc-linux64( 0/ 8), 0.083: ~5 levels ~960 states ~4816 transitions
pins2lts-mc-linux64( 1/ 8), 0.095: ~2 levels ~1920 states ~7920 transitions
pins2lts-mc-linux64( 1/ 8), 0.135: ~3 levels ~3840 states ~15064 transitions
pins2lts-mc-linux64( 1/ 8), 0.184: ~4 levels ~7680 states ~27808 transitions
pins2lts-mc-linux64( 1/ 8), 0.269: ~5 levels ~15360 states ~53816 transitions
pins2lts-mc-linux64( 7/ 8), 0.367: ~8 levels ~30720 states ~105312 transitions
pins2lts-mc-linux64( 1/ 8), 0.641: ~9 levels ~61440 states ~199792 transitions
pins2lts-mc-linux64( 1/ 8), 1.071: ~12 levels ~122880 states ~387360 transitions
pins2lts-mc-linux64( 7/ 8), 1.557: ~14 levels ~245760 states ~781768 transitions
pins2lts-mc-linux64( 1/ 8), 2.239: ~19 levels ~491520 states ~1508984 transitions
pins2lts-mc-linux64( 1/ 8), 2.974: ~22 levels ~983040 states ~3012664 transitions
pins2lts-mc-linux64( 7/ 8), 4.061: ~24 levels ~1966080 states ~6028648 transitions
pins2lts-mc-linux64( 4/ 8), 6.217: ~28 levels ~3932160 states ~12150416 transitions
pins2lts-mc-linux64( 7/ 8), 10.450: ~32 levels ~7864320 states ~23920384 transitions
pins2lts-mc-linux64( 4/ 8), 19.508: ~37 levels ~15728640 states ~47842400 transitions
pins2lts-mc-linux64( 4/ 8), 44.092: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 44.132:
pins2lts-mc-linux64( 0/ 8), 44.132: mean standard work distribution: 3.1% (states) 3.4% (transitions)
pins2lts-mc-linux64( 0/ 8), 44.132:
pins2lts-mc-linux64( 0/ 8), 44.132: Explored 28222226 states 85607685 transitions, fanout: 3.033
pins2lts-mc-linux64( 0/ 8), 44.132: Total exploration time 44.110 sec (44.080 sec minimum, 44.093 sec on average)
pins2lts-mc-linux64( 0/ 8), 44.132: States per second: 639815, Transitions per second: 1940777
pins2lts-mc-linux64( 0/ 8), 44.132:
pins2lts-mc-linux64( 0/ 8), 44.132: Queue width: 8B, total height: 3547946, memory: 27.07MB
pins2lts-mc-linux64( 0/ 8), 44.132: Tree memory: 498.4MB, 16.4 B/state, compr.: 32.9%
pins2lts-mc-linux64( 0/ 8), 44.133: Tree fill ratio (roots/leafs): 23.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 44.133: Stored 12 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 44.133: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 44.133: Est. total memory use: 525.5MB (~1051.1MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin13637941218368932501;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-d'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin13637941218368932501;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-d'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:242)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:177)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:115)
at java.base/java.lang.Thread.run(Thread.java:829)
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.17215e+11,366.375,1400708,1386,10995,985124,154220,31,731902,23,962240,0
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
dead,0,394.726,1412712,1,0,985124,1.51479e+06,63,731902,686,4.66177e+06,9015
System contains 0 deadlocks (shown below if less than --print-limit option) !
FORMULA ReachabilityDeadlock FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
[ 0 ]
Total runtime 422207 ms.
BK_STOP 1679951573563
--------------------
content from stderr:
+ export LANG=C
+ LANG=C
+ 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
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -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=@none -Xss128m -Xms40m -Xmx8192m
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="PGCD-COL-D03N050"
export BK_EXAMINATION="ReachabilityDeadlock"
export BK_TOOL="gold2022"
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-5348"
echo " Executing tool gold2022"
echo " Input is PGCD-COL-D03N050, 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 r544-tall-167987257700251"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PGCD-COL-D03N050.tgz
mv PGCD-COL-D03N050 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 ;