fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r395-smll-171683823800037
Last Updated
July 7, 2024

About the Execution of 2023-gold for SieveSingleMsgMbox-PT-d1m06

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
599.976 13785.00 29723.00 515.40 TFFTTFFFTFTTFFFT normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r395-smll-171683823800037.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is SieveSingleMsgMbox-PT-d1m06, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r395-smll-171683823800037
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 864K
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 07:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 07:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 07:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 19:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K Apr 12 19:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Apr 12 19:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 12 19:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:56 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 450K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716918212381

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SieveSingleMsgMbox-PT-d1m06
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-28 17:43:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-28 17:43:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 17:43:36] [INFO ] Load time of PNML (sax parser for PT used): 246 ms
[2024-05-28 17:43:36] [INFO ] Transformed 1295 places.
[2024-05-28 17:43:36] [INFO ] Transformed 749 transitions.
[2024-05-28 17:43:36] [INFO ] Parsed PT model containing 1295 places and 749 transitions and 2996 arcs in 400 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 1036 places in 12 ms
Reduce places removed 1036 places and 0 transitions.
Initial state reduction rules removed 2 formulas.
FORMULA SieveSingleMsgMbox-PT-d1m06-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m06-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m06-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m06-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m06-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m06-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m06-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m06-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m06-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m06-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m06-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m06-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m06-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 4 out of 259 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 259/259 places, 749/749 transitions.
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 240 transitions.
Iterating post reduction 0 with 257 rules applied. Total rules applied 257 place count 242 transition count 509
Discarding 59 places :
Symmetric choice reduction at 1 with 59 rule applications. Total rules 316 place count 183 transition count 247
Iterating global reduction 1 with 59 rules applied. Total rules applied 375 place count 183 transition count 247
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 382 place count 183 transition count 240
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 424 place count 141 transition count 198
Iterating global reduction 2 with 42 rules applied. Total rules applied 466 place count 141 transition count 198
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 480 place count 141 transition count 184
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 503 place count 118 transition count 159
Iterating global reduction 3 with 23 rules applied. Total rules applied 526 place count 118 transition count 159
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 3 with 18 rules applied. Total rules applied 544 place count 118 transition count 141
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 549 place count 113 transition count 134
Iterating global reduction 4 with 5 rules applied. Total rules applied 554 place count 113 transition count 134
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 559 place count 108 transition count 129
Iterating global reduction 4 with 5 rules applied. Total rules applied 564 place count 108 transition count 129
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 566 place count 106 transition count 126
Iterating global reduction 4 with 2 rules applied. Total rules applied 568 place count 106 transition count 126
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 570 place count 104 transition count 124
Iterating global reduction 4 with 2 rules applied. Total rules applied 572 place count 104 transition count 124
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 574 place count 102 transition count 122
Iterating global reduction 4 with 2 rules applied. Total rules applied 576 place count 102 transition count 122
Applied a total of 576 rules in 104 ms. Remains 102 /259 variables (removed 157) and now considering 122/749 (removed 627) transitions.
// Phase 1: matrix 122 rows 102 cols
[2024-05-28 17:43:36] [INFO ] Computed 5 invariants in 20 ms
[2024-05-28 17:43:37] [INFO ] Implicit Places using invariants in 471 ms returned []
[2024-05-28 17:43:37] [INFO ] Invariant cache hit.
[2024-05-28 17:43:37] [INFO ] State equation strengthened by 54 read => feed constraints.
[2024-05-28 17:43:37] [INFO ] Implicit Places using invariants and state equation in 604 ms returned []
Implicit Place search using SMT with State Equation took 1133 ms to find 0 implicit places.
[2024-05-28 17:43:37] [INFO ] Invariant cache hit.
[2024-05-28 17:43:37] [INFO ] Dead Transitions using invariants and state equation in 159 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 102/259 places, 122/749 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1412 ms. Remains : 102/259 places, 122/749 transitions.
Support contains 4 out of 102 places after structural reductions.
[2024-05-28 17:43:38] [INFO ] Flatten gal took : 51 ms
[2024-05-28 17:43:38] [INFO ] Flatten gal took : 27 ms
[2024-05-28 17:43:38] [INFO ] Input system was already deterministic with 122 transitions.
Incomplete random walk after 10000 steps, including 2287 resets, run finished after 570 ms. (steps per millisecond=17 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 1065 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 1072 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 1057 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 3) seen :0
Probably explored full state space saw : 96716 states, properties seen :2
Probabilistic random walk after 250181 steps, saw 96716 distinct states, run finished after 563 ms. (steps per millisecond=444 ) properties seen :2
Explored full state space saw : 96717 states, properties seen :0
Exhaustive walk after 250182 steps, saw 96717 distinct states, run finished after 309 ms. (steps per millisecond=809 ) properties seen :0
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 1 atomic propositions for a total of 3 simplifications.
FORMULA SieveSingleMsgMbox-PT-d1m06-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 19 stabilizing places and 24 stable transitions
Graph (complete) has 328 edges and 102 vertex of which 101 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 122/122 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 100 transition count 120
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 100 transition count 120
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 100 transition count 119
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 7 place count 98 transition count 117
Iterating global reduction 1 with 2 rules applied. Total rules applied 9 place count 98 transition count 117
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 10 place count 98 transition count 116
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 13 place count 95 transition count 113
Iterating global reduction 2 with 3 rules applied. Total rules applied 16 place count 95 transition count 113
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 18 place count 93 transition count 110
Iterating global reduction 2 with 2 rules applied. Total rules applied 20 place count 93 transition count 110
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 22 place count 91 transition count 108
Iterating global reduction 2 with 2 rules applied. Total rules applied 24 place count 91 transition count 108
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 26 place count 91 transition count 106
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 28 place count 89 transition count 104
Iterating global reduction 3 with 2 rules applied. Total rules applied 30 place count 89 transition count 104
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 31 place count 88 transition count 103
Iterating global reduction 3 with 1 rules applied. Total rules applied 32 place count 88 transition count 103
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 33 place count 87 transition count 102
Iterating global reduction 3 with 1 rules applied. Total rules applied 34 place count 87 transition count 102
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 35 place count 86 transition count 100
Iterating global reduction 3 with 1 rules applied. Total rules applied 36 place count 86 transition count 100
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 37 place count 85 transition count 99
Iterating global reduction 3 with 1 rules applied. Total rules applied 38 place count 85 transition count 99
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 39 place count 84 transition count 98
Iterating global reduction 3 with 1 rules applied. Total rules applied 40 place count 84 transition count 98
Applied a total of 40 rules in 55 ms. Remains 84 /102 variables (removed 18) and now considering 98/122 (removed 24) transitions.
// Phase 1: matrix 98 rows 84 cols
[2024-05-28 17:43:40] [INFO ] Computed 5 invariants in 3 ms
[2024-05-28 17:43:40] [INFO ] Implicit Places using invariants in 141 ms returned []
[2024-05-28 17:43:40] [INFO ] Invariant cache hit.
[2024-05-28 17:43:40] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-28 17:43:40] [INFO ] Implicit Places using invariants and state equation in 232 ms returned []
Implicit Place search using SMT with State Equation took 380 ms to find 0 implicit places.
[2024-05-28 17:43:40] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-28 17:43:40] [INFO ] Invariant cache hit.
[2024-05-28 17:43:40] [INFO ] Dead Transitions using invariants and state equation in 103 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 84/102 places, 98/122 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 560 ms. Remains : 84/102 places, 98/122 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 185 ms :[(NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m06-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s79 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 22556 reset in 357 ms.
Product exploration explored 100000 steps with 22408 reset in 230 ms.
Computed a total of 13 stabilizing places and 17 stable transitions
Graph (complete) has 269 edges and 84 vertex of which 83 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 13 stabilizing places and 17 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 105 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2278 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 1044 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 17346 steps, run visited all 1 properties in 27 ms. (steps per millisecond=642 )
Probabilistic random walk after 17346 steps, saw 7882 distinct states, run finished after 27 ms. (steps per millisecond=642 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 135 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Support contains 1 out of 84 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 84/84 places, 98/98 transitions.
Applied a total of 0 rules in 8 ms. Remains 84 /84 variables (removed 0) and now considering 98/98 (removed 0) transitions.
[2024-05-28 17:43:42] [INFO ] Invariant cache hit.
[2024-05-28 17:43:42] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-05-28 17:43:42] [INFO ] Invariant cache hit.
[2024-05-28 17:43:42] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-28 17:43:42] [INFO ] Implicit Places using invariants and state equation in 318 ms returned []
Implicit Place search using SMT with State Equation took 411 ms to find 0 implicit places.
[2024-05-28 17:43:42] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-28 17:43:42] [INFO ] Invariant cache hit.
[2024-05-28 17:43:42] [INFO ] Dead Transitions using invariants and state equation in 93 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 524 ms. Remains : 84/84 places, 98/98 transitions.
Computed a total of 13 stabilizing places and 17 stable transitions
Graph (complete) has 269 edges and 84 vertex of which 83 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 13 stabilizing places and 17 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 85 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2185 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 1060 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Finished probabilistic random walk after 17346 steps, run visited all 1 properties in 95 ms. (steps per millisecond=182 )
Probabilistic random walk after 17346 steps, saw 7882 distinct states, run finished after 96 ms. (steps per millisecond=180 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 100 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Product exploration explored 100000 steps with 22507 reset in 145 ms.
Product exploration explored 100000 steps with 22402 reset in 156 ms.
Built C files in :
/tmp/ltsmin2814865977692332415
[2024-05-28 17:43:43] [INFO ] Computing symmetric may disable matrix : 98 transitions.
[2024-05-28 17:43:43] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 17:43:43] [INFO ] Computing symmetric may enable matrix : 98 transitions.
[2024-05-28 17:43:43] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 17:43:43] [INFO ] Computing Do-Not-Accords matrix : 98 transitions.
[2024-05-28 17:43:43] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 17:43:43] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2814865977692332415
Running compilation step : cd /tmp/ltsmin2814865977692332415;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 480 ms.
Running link step : cd /tmp/ltsmin2814865977692332415;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin2814865977692332415;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased654615114950912610.hoa' '--buchi-type=spotba'
LTSmin run took 577 ms.
FORMULA SieveSingleMsgMbox-PT-d1m06-LTLCardinality-01 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property SieveSingleMsgMbox-PT-d1m06-LTLCardinality-01 finished in 4430 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 122/122 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 100 transition count 112
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 100 transition count 112
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 98 transition count 110
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 98 transition count 110
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 98 transition count 109
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 12 place count 95 transition count 106
Iterating global reduction 1 with 3 rules applied. Total rules applied 15 place count 95 transition count 106
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 16 place count 95 transition count 105
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 18 place count 93 transition count 102
Iterating global reduction 2 with 2 rules applied. Total rules applied 20 place count 93 transition count 102
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 22 place count 91 transition count 100
Iterating global reduction 2 with 2 rules applied. Total rules applied 24 place count 91 transition count 100
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 26 place count 89 transition count 98
Iterating global reduction 2 with 2 rules applied. Total rules applied 28 place count 89 transition count 98
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 29 place count 89 transition count 97
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 31 place count 87 transition count 95
Iterating global reduction 3 with 2 rules applied. Total rules applied 33 place count 87 transition count 95
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 34 place count 86 transition count 94
Iterating global reduction 3 with 1 rules applied. Total rules applied 35 place count 86 transition count 94
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 36 place count 85 transition count 92
Iterating global reduction 3 with 1 rules applied. Total rules applied 37 place count 85 transition count 92
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 38 place count 84 transition count 91
Iterating global reduction 3 with 1 rules applied. Total rules applied 39 place count 84 transition count 91
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 40 place count 83 transition count 90
Iterating global reduction 3 with 1 rules applied. Total rules applied 41 place count 83 transition count 90
Applied a total of 41 rules in 43 ms. Remains 83 /102 variables (removed 19) and now considering 90/122 (removed 32) transitions.
// Phase 1: matrix 90 rows 83 cols
[2024-05-28 17:43:44] [INFO ] Computed 5 invariants in 2 ms
[2024-05-28 17:43:44] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-28 17:43:44] [INFO ] Invariant cache hit.
[2024-05-28 17:43:44] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-05-28 17:43:44] [INFO ] Implicit Places using invariants and state equation in 210 ms returned []
Implicit Place search using SMT with State Equation took 292 ms to find 0 implicit places.
[2024-05-28 17:43:44] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-28 17:43:44] [INFO ] Invariant cache hit.
[2024-05-28 17:43:45] [INFO ] Dead Transitions using invariants and state equation in 73 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 83/102 places, 90/122 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 419 ms. Remains : 83/102 places, 90/122 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m06-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT s19 s4)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d1m06-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m06-LTLCardinality-09 finished in 479 ms.
All properties solved by simple procedures.
Total runtime 9410 ms.

BK_STOP 1716918226166

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="SieveSingleMsgMbox-PT-d1m06"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is SieveSingleMsgMbox-PT-d1m06, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r395-smll-171683823800037"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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