About the Execution of ITS-Tools for ShieldRVt-PT-050A
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1399.176 | 41882.00 | 82457.00 | 177.40 | FFFFFFFTFTFFFFFT | normal |
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.r222-tall-165286026201027.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 itstools
Input is ShieldRVt-PT-050A, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r222-tall-165286026201027
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 360K
-rw-r--r-- 1 mcc users 6.2K Apr 30 02:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K Apr 30 02:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Apr 30 01:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Apr 30 01:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 9 09:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 09:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 09:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 09:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 09:02 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 09:02 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 136K 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
here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldRVt-PT-050A-LTLCardinality-00
FORMULA_NAME ShieldRVt-PT-050A-LTLCardinality-01
FORMULA_NAME ShieldRVt-PT-050A-LTLCardinality-02
FORMULA_NAME ShieldRVt-PT-050A-LTLCardinality-03
FORMULA_NAME ShieldRVt-PT-050A-LTLCardinality-04
FORMULA_NAME ShieldRVt-PT-050A-LTLCardinality-05
FORMULA_NAME ShieldRVt-PT-050A-LTLCardinality-06
FORMULA_NAME ShieldRVt-PT-050A-LTLCardinality-07
FORMULA_NAME ShieldRVt-PT-050A-LTLCardinality-08
FORMULA_NAME ShieldRVt-PT-050A-LTLCardinality-09
FORMULA_NAME ShieldRVt-PT-050A-LTLCardinality-10
FORMULA_NAME ShieldRVt-PT-050A-LTLCardinality-11
FORMULA_NAME ShieldRVt-PT-050A-LTLCardinality-12
FORMULA_NAME ShieldRVt-PT-050A-LTLCardinality-13
FORMULA_NAME ShieldRVt-PT-050A-LTLCardinality-14
FORMULA_NAME ShieldRVt-PT-050A-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1653081315740
Running Version 202205111006
[2022-05-20 21:15:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -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, 3600]
[2022-05-20 21:15:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 21:15:17] [INFO ] Load time of PNML (sax parser for PT used): 106 ms
[2022-05-20 21:15:17] [INFO ] Transformed 403 places.
[2022-05-20 21:15:17] [INFO ] Transformed 403 transitions.
[2022-05-20 21:15:17] [INFO ] Found NUPN structural information;
[2022-05-20 21:15:17] [INFO ] Parsed PT model containing 403 places and 403 transitions in 223 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
FORMULA ShieldRVt-PT-050A-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-050A-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-050A-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-050A-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-050A-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 37 out of 403 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 403/403 places, 402/402 transitions.
Applied a total of 0 rules in 45 ms. Remains 403 /403 variables (removed 0) and now considering 402/402 (removed 0) transitions.
// Phase 1: matrix 402 rows 403 cols
[2022-05-20 21:15:17] [INFO ] Computed 201 place invariants in 18 ms
[2022-05-20 21:15:17] [INFO ] Implicit Places using invariants in 363 ms returned []
// Phase 1: matrix 402 rows 403 cols
[2022-05-20 21:15:17] [INFO ] Computed 201 place invariants in 4 ms
[2022-05-20 21:15:18] [INFO ] Implicit Places using invariants and state equation in 341 ms returned []
Implicit Place search using SMT with State Equation took 732 ms to find 0 implicit places.
// Phase 1: matrix 402 rows 403 cols
[2022-05-20 21:15:18] [INFO ] Computed 201 place invariants in 3 ms
[2022-05-20 21:15:18] [INFO ] Dead Transitions using invariants and state equation in 217 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 403/403 places, 402/402 transitions.
Support contains 37 out of 403 places after structural reductions.
[2022-05-20 21:15:18] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2022-05-20 21:15:18] [INFO ] Flatten gal took : 80 ms
FORMULA ShieldRVt-PT-050A-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-20 21:15:18] [INFO ] Flatten gal took : 40 ms
[2022-05-20 21:15:18] [INFO ] Input system was already deterministic with 402 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 439 ms. (steps per millisecond=22 ) properties (out of 21) seen :10
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 402 rows 403 cols
[2022-05-20 21:15:19] [INFO ] Computed 201 place invariants in 14 ms
[2022-05-20 21:15:19] [INFO ] [Real]Absence check using 201 positive place invariants in 31 ms returned sat
[2022-05-20 21:15:20] [INFO ] After 736ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:10
[2022-05-20 21:15:20] [INFO ] [Nat]Absence check using 201 positive place invariants in 30 ms returned sat
[2022-05-20 21:15:21] [INFO ] After 825ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :10
[2022-05-20 21:15:22] [INFO ] After 1455ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :10
Attempting to minimize the solution found.
Minimization took 562 ms.
[2022-05-20 21:15:22] [INFO ] After 2247ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :10
Fused 11 Parikh solutions to 10 different solutions.
Parikh walk visited 0 properties in 274 ms.
Support contains 19 out of 403 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 403/403 places, 402/402 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 402 transition count 401
Partial Free-agglomeration rule applied 50 times.
Drop transitions removed 50 transitions
Iterating global reduction 0 with 50 rules applied. Total rules applied 52 place count 402 transition count 401
Drop transitions removed 50 transitions
Redundant transition composition rules discarded 50 transitions
Iterating global reduction 0 with 50 rules applied. Total rules applied 102 place count 402 transition count 351
Applied a total of 102 rules in 89 ms. Remains 402 /403 variables (removed 1) and now considering 351/402 (removed 51) transitions.
Finished structural reductions, in 1 iterations. Remains : 402/403 places, 351/402 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 259 ms. (steps per millisecond=38 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 10) seen :0
Finished probabilistic random walk after 6687 steps, run visited all 10 properties in 126 ms. (steps per millisecond=53 )
Probabilistic random walk after 6687 steps, saw 6547 distinct states, run finished after 127 ms. (steps per millisecond=52 ) properties seen :10
FORMULA ShieldRVt-PT-050A-LTLCardinality-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 9 simplifications.
Computed a total of 1 stabilizing places and 1 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(X(X(F(X(G(G(p0)))))))))'
Support contains 2 out of 403 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 403/403 places, 402/402 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 402 transition count 401
Applied a total of 2 rules in 30 ms. Remains 402 /403 variables (removed 1) and now considering 401/402 (removed 1) transitions.
// Phase 1: matrix 401 rows 402 cols
[2022-05-20 21:15:24] [INFO ] Computed 201 place invariants in 4 ms
[2022-05-20 21:15:24] [INFO ] Implicit Places using invariants in 177 ms returned [395]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 183 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 401/403 places, 401/402 transitions.
Applied a total of 0 rules in 32 ms. Remains 401 /401 variables (removed 0) and now considering 401/401 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 401/403 places, 401/402 transitions.
Stuttering acceptance computed with spot in 126 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVt-PT-050A-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s210 0) (EQ s122 1))], 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 0 reset in 489 ms.
Product exploration explored 100000 steps with 0 reset in 558 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 123 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Finished probabilistic random walk after 3952 steps, run visited all 1 properties in 22 ms. (steps per millisecond=179 )
Probabilistic random walk after 3952 steps, saw 3812 distinct states, run finished after 23 ms. (steps per millisecond=171 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 107 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Support contains 2 out of 401 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 401/401 places, 401/401 transitions.
Applied a total of 0 rules in 14 ms. Remains 401 /401 variables (removed 0) and now considering 401/401 (removed 0) transitions.
// Phase 1: matrix 401 rows 401 cols
[2022-05-20 21:15:26] [INFO ] Computed 200 place invariants in 5 ms
[2022-05-20 21:15:26] [INFO ] Implicit Places using invariants in 167 ms returned []
// Phase 1: matrix 401 rows 401 cols
[2022-05-20 21:15:26] [INFO ] Computed 200 place invariants in 5 ms
[2022-05-20 21:15:26] [INFO ] Implicit Places using invariants and state equation in 294 ms returned []
Implicit Place search using SMT with State Equation took 466 ms to find 0 implicit places.
[2022-05-20 21:15:26] [INFO ] Redundant transitions in 23 ms returned []
// Phase 1: matrix 401 rows 401 cols
[2022-05-20 21:15:26] [INFO ] Computed 200 place invariants in 1 ms
[2022-05-20 21:15:26] [INFO ] Dead Transitions using invariants and state equation in 202 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 401/401 places, 401/401 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 96 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Finished probabilistic random walk after 3952 steps, run visited all 1 properties in 25 ms. (steps per millisecond=158 )
Probabilistic random walk after 3952 steps, saw 3812 distinct states, run finished after 26 ms. (steps per millisecond=152 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 121 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 389 ms.
Product exploration explored 100000 steps with 0 reset in 493 ms.
Built C files in :
/tmp/ltsmin17856982595017856534
[2022-05-20 21:15:28] [INFO ] Computing symmetric may disable matrix : 401 transitions.
[2022-05-20 21:15:28] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 21:15:28] [INFO ] Computing symmetric may enable matrix : 401 transitions.
[2022-05-20 21:15:28] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 21:15:28] [INFO ] Computing Do-Not-Accords matrix : 401 transitions.
[2022-05-20 21:15:28] [INFO ] Computation of Completed DNA matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 21:15:28] [INFO ] Built C files in 75ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17856982595017856534
Running compilation step : cd /tmp/ltsmin17856982595017856534;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' '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'
Compilation finished in 870 ms.
Running link step : cd /tmp/ltsmin17856982595017856534;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin17856982595017856534;'/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' '--hoa' '/tmp/stateBased15195190533275014931.hoa' '--buchi-type=spotba'
LTSmin run took 717 ms.
FORMULA ShieldRVt-PT-050A-LTLCardinality-00 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldRVt-PT-050A-LTLCardinality-00 finished in 5733 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(F((G(((p1 U p2) U !p1))||p0)))))'
Support contains 6 out of 403 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 403/403 places, 402/402 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 402 transition count 401
Applied a total of 2 rules in 24 ms. Remains 402 /403 variables (removed 1) and now considering 401/402 (removed 1) transitions.
// Phase 1: matrix 401 rows 402 cols
[2022-05-20 21:15:29] [INFO ] Computed 201 place invariants in 3 ms
[2022-05-20 21:15:30] [INFO ] Implicit Places using invariants in 165 ms returned [395]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 166 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 401/403 places, 401/402 transitions.
Applied a total of 0 rules in 10 ms. Remains 401 /401 variables (removed 0) and now considering 401/401 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 401/403 places, 401/402 transitions.
Stuttering acceptance computed with spot in 166 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), false, (AND (NOT p0) p1)]
Running random walk in product with property : ShieldRVt-PT-050A-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 1}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s25 0) (EQ s296 1)), p1:(OR (EQ s211 0) (EQ s148 1)), p2:(OR (EQ s263 0) (EQ s44 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 389 ms.
Product exploration explored 100000 steps with 0 reset in 487 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 360 ms. Reduced automaton from 4 states, 9 edges and 3 AP to 4 states, 9 edges and 3 AP.
Stuttering acceptance computed with spot in 149 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), false, (AND (NOT p0) p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 249 ms. (steps per millisecond=40 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 4) seen :0
Finished probabilistic random walk after 7244 steps, run visited all 4 properties in 122 ms. (steps per millisecond=59 )
Probabilistic random walk after 7244 steps, saw 7052 distinct states, run finished after 123 ms. (steps per millisecond=58 ) properties seen :4
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X p0))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p2) (NOT p0))), (F (AND p1 (NOT p2) (NOT p0))), (F (NOT p0)), (F (AND p1 (NOT p0)))]
Knowledge based reduction with 8 factoid took 426 ms. Reduced automaton from 4 states, 9 edges and 3 AP to 4 states, 9 edges and 3 AP.
Stuttering acceptance computed with spot in 162 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), false, (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 164 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), false, (AND (NOT p0) p1)]
Support contains 6 out of 401 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 401/401 places, 401/401 transitions.
Applied a total of 0 rules in 16 ms. Remains 401 /401 variables (removed 0) and now considering 401/401 (removed 0) transitions.
// Phase 1: matrix 401 rows 401 cols
[2022-05-20 21:15:33] [INFO ] Computed 200 place invariants in 4 ms
[2022-05-20 21:15:33] [INFO ] Implicit Places using invariants in 168 ms returned []
// Phase 1: matrix 401 rows 401 cols
[2022-05-20 21:15:33] [INFO ] Computed 200 place invariants in 2 ms
[2022-05-20 21:15:33] [INFO ] Implicit Places using invariants and state equation in 302 ms returned []
Implicit Place search using SMT with State Equation took 472 ms to find 0 implicit places.
[2022-05-20 21:15:33] [INFO ] Redundant transitions in 8 ms returned []
// Phase 1: matrix 401 rows 401 cols
[2022-05-20 21:15:33] [INFO ] Computed 200 place invariants in 2 ms
[2022-05-20 21:15:33] [INFO ] Dead Transitions using invariants and state equation in 192 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 401/401 places, 401/401 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 p2 p0), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X p0)), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 250 ms. Reduced automaton from 4 states, 9 edges and 3 AP to 4 states, 9 edges and 3 AP.
Stuttering acceptance computed with spot in 159 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), false, (AND (NOT p0) p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 184 ms. (steps per millisecond=54 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 4) seen :0
Finished probabilistic random walk after 7244 steps, run visited all 4 properties in 171 ms. (steps per millisecond=42 )
Probabilistic random walk after 7244 steps, saw 7052 distinct states, run finished after 172 ms. (steps per millisecond=42 ) properties seen :4
Knowledge obtained : [(AND p1 p2 p0), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X p0)), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : [(F (AND (NOT p2) (NOT p0) (NOT p1))), (F (AND (NOT p2) (NOT p0) p1)), (F (NOT p0)), (F (AND (NOT p0) p1))]
Knowledge based reduction with 8 factoid took 458 ms. Reduced automaton from 4 states, 9 edges and 3 AP to 4 states, 9 edges and 3 AP.
Stuttering acceptance computed with spot in 157 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), false, (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 145 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), false, (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), false, (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 0 reset in 396 ms.
Product exploration explored 100000 steps with 0 reset in 513 ms.
Built C files in :
/tmp/ltsmin4881185586631901307
[2022-05-20 21:15:36] [INFO ] Computing symmetric may disable matrix : 401 transitions.
[2022-05-20 21:15:36] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 21:15:36] [INFO ] Computing symmetric may enable matrix : 401 transitions.
[2022-05-20 21:15:36] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 21:15:36] [INFO ] Computing Do-Not-Accords matrix : 401 transitions.
[2022-05-20 21:15:36] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 21:15:36] [INFO ] Built C files in 37ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4881185586631901307
Running compilation step : cd /tmp/ltsmin4881185586631901307;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' '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'
Compilation finished in 808 ms.
Running link step : cd /tmp/ltsmin4881185586631901307;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin4881185586631901307;'/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' '--hoa' '/tmp/stateBased4555838592007533840.hoa' '--buchi-type=spotba'
LTSmin run took 5132 ms.
FORMULA ShieldRVt-PT-050A-LTLCardinality-03 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldRVt-PT-050A-LTLCardinality-03 finished in 12669 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 403 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 403/403 places, 402/402 transitions.
Applied a total of 0 rules in 4 ms. Remains 403 /403 variables (removed 0) and now considering 402/402 (removed 0) transitions.
// Phase 1: matrix 402 rows 403 cols
[2022-05-20 21:15:42] [INFO ] Computed 201 place invariants in 4 ms
[2022-05-20 21:15:42] [INFO ] Implicit Places using invariants in 166 ms returned []
// Phase 1: matrix 402 rows 403 cols
[2022-05-20 21:15:42] [INFO ] Computed 201 place invariants in 1 ms
[2022-05-20 21:15:43] [INFO ] Implicit Places using invariants and state equation in 303 ms returned []
Implicit Place search using SMT with State Equation took 470 ms to find 0 implicit places.
// Phase 1: matrix 402 rows 403 cols
[2022-05-20 21:15:43] [INFO ] Computed 201 place invariants in 5 ms
[2022-05-20 21:15:43] [INFO ] Dead Transitions using invariants and state equation in 200 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 403/403 places, 402/402 transitions.
Stuttering acceptance computed with spot in 83 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-050A-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(NEQ s198 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-050A-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-050A-LTLCardinality-04 finished in 772 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(G(X(p0))))'
Support contains 2 out of 403 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 403/403 places, 402/402 transitions.
Applied a total of 0 rules in 9 ms. Remains 403 /403 variables (removed 0) and now considering 402/402 (removed 0) transitions.
// Phase 1: matrix 402 rows 403 cols
[2022-05-20 21:15:43] [INFO ] Computed 201 place invariants in 3 ms
[2022-05-20 21:15:43] [INFO ] Implicit Places using invariants in 200 ms returned []
// Phase 1: matrix 402 rows 403 cols
[2022-05-20 21:15:43] [INFO ] Computed 201 place invariants in 2 ms
[2022-05-20 21:15:43] [INFO ] Implicit Places using invariants and state equation in 302 ms returned []
Implicit Place search using SMT with State Equation took 505 ms to find 0 implicit places.
// Phase 1: matrix 402 rows 403 cols
[2022-05-20 21:15:43] [INFO ] Computed 201 place invariants in 2 ms
[2022-05-20 21:15:44] [INFO ] Dead Transitions using invariants and state equation in 208 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 403/403 places, 402/402 transitions.
Stuttering acceptance computed with spot in 72 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-050A-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (NEQ s83 0) (NEQ s7 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-050A-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-050A-LTLCardinality-05 finished in 814 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(G((X(p0) U p0)))||(p1&&(F(p3)||p2))))))'
Support contains 7 out of 403 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 403/403 places, 402/402 transitions.
Applied a total of 0 rules in 8 ms. Remains 403 /403 variables (removed 0) and now considering 402/402 (removed 0) transitions.
// Phase 1: matrix 402 rows 403 cols
[2022-05-20 21:15:44] [INFO ] Computed 201 place invariants in 2 ms
[2022-05-20 21:15:44] [INFO ] Implicit Places using invariants in 165 ms returned []
// Phase 1: matrix 402 rows 403 cols
[2022-05-20 21:15:44] [INFO ] Computed 201 place invariants in 1 ms
[2022-05-20 21:15:44] [INFO ] Implicit Places using invariants and state equation in 310 ms returned []
Implicit Place search using SMT with State Equation took 477 ms to find 0 implicit places.
// Phase 1: matrix 402 rows 403 cols
[2022-05-20 21:15:44] [INFO ] Computed 201 place invariants in 1 ms
[2022-05-20 21:15:44] [INFO ] Dead Transitions using invariants and state equation in 205 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 403/403 places, 402/402 transitions.
Stuttering acceptance computed with spot in 270 ms :[true, (AND (NOT p3) (NOT p0)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (NOT p0), (AND (NOT p3) (NOT p0)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (NOT p0), (NOT p3)]
Running random walk in product with property : ShieldRVt-PT-050A-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p3) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p3) (NOT p0)), acceptance={} source=1 dest: 4}], [{ cond=(AND p1 (NOT p2) (NOT p3)), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 7}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 7}], [{ cond=(AND (NOT p3) p0), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p3) (NOT p0)), acceptance={} source=4 dest: 8}], [{ cond=true, acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={} source=6 dest: 2}], [{ cond=(NOT p0), acceptance={} source=7 dest: 3}, { cond=p0, acceptance={} source=7 dest: 7}], [{ cond=(NOT p3), acceptance={0} source=8 dest: 8}]], initial=5, aps=[p3:(OR (EQ s238 0) (EQ s231 1)), p0:(EQ s381 1), p1:(OR (EQ s278 0) (EQ s51 1)), p2:(OR (EQ s317 0) (EQ s127 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-050A-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-050A-LTLCardinality-06 finished in 988 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 403 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 403/403 places, 402/402 transitions.
Applied a total of 0 rules in 8 ms. Remains 403 /403 variables (removed 0) and now considering 402/402 (removed 0) transitions.
// Phase 1: matrix 402 rows 403 cols
[2022-05-20 21:15:45] [INFO ] Computed 201 place invariants in 1 ms
[2022-05-20 21:15:45] [INFO ] Implicit Places using invariants in 164 ms returned []
// Phase 1: matrix 402 rows 403 cols
[2022-05-20 21:15:45] [INFO ] Computed 201 place invariants in 2 ms
[2022-05-20 21:15:45] [INFO ] Implicit Places using invariants and state equation in 300 ms returned []
Implicit Place search using SMT with State Equation took 467 ms to find 0 implicit places.
// Phase 1: matrix 402 rows 403 cols
[2022-05-20 21:15:45] [INFO ] Computed 201 place invariants in 4 ms
[2022-05-20 21:15:45] [INFO ] Dead Transitions using invariants and state equation in 199 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 403/403 places, 402/402 transitions.
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-050A-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s170 0) (EQ s129 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 0 reset in 405 ms.
Stack based approach found an accepted trace after 35 steps with 0 reset with depth 36 and stack size 36 in 0 ms.
FORMULA ShieldRVt-PT-050A-LTLCardinality-08 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVt-PT-050A-LTLCardinality-08 finished in 1158 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(F(G(p0)))))'
Support contains 2 out of 403 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 403/403 places, 402/402 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 402 transition count 401
Applied a total of 2 rules in 23 ms. Remains 402 /403 variables (removed 1) and now considering 401/402 (removed 1) transitions.
// Phase 1: matrix 401 rows 402 cols
[2022-05-20 21:15:46] [INFO ] Computed 201 place invariants in 3 ms
[2022-05-20 21:15:46] [INFO ] Implicit Places using invariants in 161 ms returned [395]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 162 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 401/403 places, 401/402 transitions.
Applied a total of 0 rules in 10 ms. Remains 401 /401 variables (removed 0) and now considering 401/401 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 401/403 places, 401/402 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVt-PT-050A-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s236 0) (EQ s204 1))], 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 0 reset in 386 ms.
Stack based approach found an accepted trace after 4 steps with 0 reset with depth 5 and stack size 5 in 1 ms.
FORMULA ShieldRVt-PT-050A-LTLCardinality-10 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVt-PT-050A-LTLCardinality-10 finished in 630 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0 U !p1))))'
Support contains 4 out of 403 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 403/403 places, 402/402 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 402 transition count 401
Applied a total of 2 rules in 25 ms. Remains 402 /403 variables (removed 1) and now considering 401/402 (removed 1) transitions.
// Phase 1: matrix 401 rows 402 cols
[2022-05-20 21:15:46] [INFO ] Computed 201 place invariants in 2 ms
[2022-05-20 21:15:47] [INFO ] Implicit Places using invariants in 166 ms returned [395]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 167 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 401/403 places, 401/402 transitions.
Applied a total of 0 rules in 10 ms. Remains 401 /401 variables (removed 0) and now considering 401/401 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 401/403 places, 401/402 transitions.
Stuttering acceptance computed with spot in 73 ms :[p1, p1]
Running random walk in product with property : ShieldRVt-PT-050A-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p1) p0), acceptance={} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={0} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND p1 p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (EQ s66 0) (EQ s187 1)), p0:(OR (EQ s155 0) (EQ s33 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 407 ms.
Product exploration explored 100000 steps with 0 reset in 519 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 p0), (X (OR (NOT p1) p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 p0))), (X (X (OR (NOT p1) p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p0))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 253 ms. Reduced automaton from 2 states, 5 edges and 2 AP to 2 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 68 ms :[p1, p1]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 401 rows 401 cols
[2022-05-20 21:15:48] [INFO ] Computed 200 place invariants in 2 ms
[2022-05-20 21:15:48] [INFO ] [Real]Absence check using 200 positive place invariants in 24 ms returned sat
[2022-05-20 21:15:48] [INFO ] After 279ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-20 21:15:49] [INFO ] [Nat]Absence check using 200 positive place invariants in 23 ms returned sat
[2022-05-20 21:15:49] [INFO ] After 146ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-20 21:15:49] [INFO ] After 206ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 56 ms.
[2022-05-20 21:15:49] [INFO ] After 370ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 479 steps, including 0 resets, run visited all 2 properties in 10 ms. (steps per millisecond=47 )
Parikh walk visited 2 properties in 9 ms.
Knowledge obtained : [(AND p1 p0), (X (OR (NOT p1) p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 p0))), (X (X (OR (NOT p1) p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p0))))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1)))), (F (NOT (AND p0 p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 7 factoid took 266 ms. Reduced automaton from 2 states, 5 edges and 2 AP to 2 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 61 ms :[p1, p1]
Stuttering acceptance computed with spot in 65 ms :[p1, p1]
// Phase 1: matrix 401 rows 401 cols
[2022-05-20 21:15:49] [INFO ] Computed 200 place invariants in 2 ms
[2022-05-20 21:15:49] [INFO ] [Real]Absence check using 200 positive place invariants in 36 ms returned sat
[2022-05-20 21:15:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 21:15:50] [INFO ] [Real]Absence check using state equation in 102 ms returned sat
[2022-05-20 21:15:50] [INFO ] Computed and/alt/rep : 400/1743/400 causal constraints (skipped 0 transitions) in 24 ms.
[2022-05-20 21:15:50] [INFO ] Added : 0 causal constraints over 0 iterations in 65 ms. Result :sat
Could not prove EG p1
Support contains 4 out of 401 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 401/401 places, 401/401 transitions.
Applied a total of 0 rules in 10 ms. Remains 401 /401 variables (removed 0) and now considering 401/401 (removed 0) transitions.
// Phase 1: matrix 401 rows 401 cols
[2022-05-20 21:15:50] [INFO ] Computed 200 place invariants in 2 ms
[2022-05-20 21:15:50] [INFO ] Implicit Places using invariants in 163 ms returned []
// Phase 1: matrix 401 rows 401 cols
[2022-05-20 21:15:50] [INFO ] Computed 200 place invariants in 1 ms
[2022-05-20 21:15:50] [INFO ] Implicit Places using invariants and state equation in 314 ms returned []
Implicit Place search using SMT with State Equation took 477 ms to find 0 implicit places.
[2022-05-20 21:15:50] [INFO ] Redundant transitions in 7 ms returned []
// Phase 1: matrix 401 rows 401 cols
[2022-05-20 21:15:50] [INFO ] Computed 200 place invariants in 0 ms
[2022-05-20 21:15:50] [INFO ] Dead Transitions using invariants and state equation in 207 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 401/401 places, 401/401 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (OR p0 (NOT p1))), (X (NOT (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (OR p0 (NOT p1)))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 227 ms. Reduced automaton from 2 states, 5 edges and 2 AP to 2 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 62 ms :[p1, p1]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 401 rows 401 cols
[2022-05-20 21:15:51] [INFO ] Computed 200 place invariants in 2 ms
[2022-05-20 21:15:51] [INFO ] [Real]Absence check using 200 positive place invariants in 22 ms returned sat
[2022-05-20 21:15:51] [INFO ] After 264ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-20 21:15:51] [INFO ] [Nat]Absence check using 200 positive place invariants in 22 ms returned sat
[2022-05-20 21:15:51] [INFO ] After 153ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-20 21:15:51] [INFO ] After 228ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 43 ms.
[2022-05-20 21:15:52] [INFO ] After 380ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 453 steps, including 0 resets, run visited all 2 properties in 11 ms. (steps per millisecond=41 )
Parikh walk visited 2 properties in 10 ms.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (OR p0 (NOT p1))), (X (NOT (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (OR p0 (NOT p1)))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1)))), (F (NOT (AND p0 p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 7 factoid took 327 ms. Reduced automaton from 2 states, 5 edges and 2 AP to 2 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 63 ms :[p1, p1]
Stuttering acceptance computed with spot in 75 ms :[p1, p1]
// Phase 1: matrix 401 rows 401 cols
[2022-05-20 21:15:52] [INFO ] Computed 200 place invariants in 4 ms
[2022-05-20 21:15:52] [INFO ] [Real]Absence check using 200 positive place invariants in 36 ms returned sat
[2022-05-20 21:15:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 21:15:52] [INFO ] [Real]Absence check using state equation in 103 ms returned sat
[2022-05-20 21:15:52] [INFO ] Computed and/alt/rep : 400/1743/400 causal constraints (skipped 0 transitions) in 23 ms.
[2022-05-20 21:15:52] [INFO ] Added : 0 causal constraints over 0 iterations in 58 ms. Result :sat
Could not prove EG p1
Stuttering acceptance computed with spot in 70 ms :[p1, p1]
Product exploration explored 100000 steps with 0 reset in 406 ms.
Product exploration explored 100000 steps with 2 reset in 500 ms.
Built C files in :
/tmp/ltsmin3990990780480725850
[2022-05-20 21:15:53] [INFO ] Computing symmetric may disable matrix : 401 transitions.
[2022-05-20 21:15:53] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 21:15:53] [INFO ] Computing symmetric may enable matrix : 401 transitions.
[2022-05-20 21:15:53] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 21:15:53] [INFO ] Computing Do-Not-Accords matrix : 401 transitions.
[2022-05-20 21:15:53] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 21:15:53] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3990990780480725850
Running compilation step : cd /tmp/ltsmin3990990780480725850;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' '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'
Compilation finished in 810 ms.
Running link step : cd /tmp/ltsmin3990990780480725850;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin3990990780480725850;'/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' '--hoa' '/tmp/stateBased7235389400075075456.hoa' '--buchi-type=spotba'
LTSmin run took 1867 ms.
FORMULA ShieldRVt-PT-050A-LTLCardinality-11 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldRVt-PT-050A-LTLCardinality-11 finished in 9746 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(G(X(G((p1 U p2)))))))'
Support contains 5 out of 403 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 403/403 places, 402/402 transitions.
Applied a total of 0 rules in 4 ms. Remains 403 /403 variables (removed 0) and now considering 402/402 (removed 0) transitions.
// Phase 1: matrix 402 rows 403 cols
[2022-05-20 21:15:56] [INFO ] Computed 201 place invariants in 2 ms
[2022-05-20 21:15:56] [INFO ] Implicit Places using invariants in 165 ms returned []
// Phase 1: matrix 402 rows 403 cols
[2022-05-20 21:15:56] [INFO ] Computed 201 place invariants in 8 ms
[2022-05-20 21:15:57] [INFO ] Implicit Places using invariants and state equation in 302 ms returned []
Implicit Place search using SMT with State Equation took 469 ms to find 0 implicit places.
// Phase 1: matrix 402 rows 403 cols
[2022-05-20 21:15:57] [INFO ] Computed 201 place invariants in 1 ms
[2022-05-20 21:15:57] [INFO ] Dead Transitions using invariants and state equation in 192 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 403/403 places, 402/402 transitions.
Stuttering acceptance computed with spot in 202 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), (NOT p2), (NOT p2), true, (NOT p2)]
Running random walk in product with property : ShieldRVt-PT-050A-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(OR p2 p1), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=5 dest: 4}, { cond=(AND (NOT p2) p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(OR (EQ s171 0) (EQ s183 1)), p2:(OR (EQ s22 0) (EQ s139 1)), p1:(EQ s31 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-050A-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-050A-LTLCardinality-14 finished in 886 ms.
All properties solved by simple procedures.
Total runtime 40671 ms.
BK_STOP 1653081357622
--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLCardinality -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 3600 -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="ShieldRVt-PT-050A"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
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-4028"
echo " Executing tool itstools"
echo " Input is ShieldRVt-PT-050A, 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 r222-tall-165286026201027"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVt-PT-050A.tgz
mv ShieldRVt-PT-050A 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 '
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 ;