fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r042-smll-165252095700403
Last Updated
Jun 22, 2022

About the Execution of ITS-Tools for DES-PT-01a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1665.023 26390.00 62947.00 196.80 TTTTTFFFTFFFFTFT 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.r042-smll-165252095700403.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 DES-PT-01a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r042-smll-165252095700403
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 252K
-rw-r--r-- 1 mcc users 6.0K Apr 29 15:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Apr 29 15:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Apr 29 15:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Apr 29 15:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 9 07:22 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 9 07:22 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 9 07:22 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 07:22 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 9 07:22 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K May 9 07:22 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 32K May 10 09:33 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 DES-PT-01a-LTLCardinality-00
FORMULA_NAME DES-PT-01a-LTLCardinality-01
FORMULA_NAME DES-PT-01a-LTLCardinality-02
FORMULA_NAME DES-PT-01a-LTLCardinality-03
FORMULA_NAME DES-PT-01a-LTLCardinality-04
FORMULA_NAME DES-PT-01a-LTLCardinality-05
FORMULA_NAME DES-PT-01a-LTLCardinality-06
FORMULA_NAME DES-PT-01a-LTLCardinality-07
FORMULA_NAME DES-PT-01a-LTLCardinality-08
FORMULA_NAME DES-PT-01a-LTLCardinality-09
FORMULA_NAME DES-PT-01a-LTLCardinality-10
FORMULA_NAME DES-PT-01a-LTLCardinality-11
FORMULA_NAME DES-PT-01a-LTLCardinality-12
FORMULA_NAME DES-PT-01a-LTLCardinality-13
FORMULA_NAME DES-PT-01a-LTLCardinality-14
FORMULA_NAME DES-PT-01a-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1652708833490

Running Version 202205111006
[2022-05-16 13:47:15] [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-16 13:47:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 13:47:15] [INFO ] Load time of PNML (sax parser for PT used): 104 ms
[2022-05-16 13:47:15] [INFO ] Transformed 119 places.
[2022-05-16 13:47:15] [INFO ] Transformed 76 transitions.
[2022-05-16 13:47:15] [INFO ] Found NUPN structural information;
[2022-05-16 13:47:15] [INFO ] Parsed PT model containing 119 places and 76 transitions in 267 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 17 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA DES-PT-01a-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-01a-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-01a-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-01a-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-01a-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-01a-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-01a-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-01a-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-01a-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 22 out of 119 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 119/119 places, 62/62 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 118 transition count 61
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 118 transition count 61
Applied a total of 2 rules in 39 ms. Remains 118 /119 variables (removed 1) and now considering 61/62 (removed 1) transitions.
// Phase 1: matrix 61 rows 118 cols
[2022-05-16 13:47:15] [INFO ] Computed 59 place invariants in 18 ms
[2022-05-16 13:47:16] [INFO ] Implicit Places using invariants in 363 ms returned [16]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 408 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 117/119 places, 61/62 transitions.
Applied a total of 0 rules in 11 ms. Remains 117 /117 variables (removed 0) and now considering 61/61 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 117/119 places, 61/62 transitions.
Support contains 22 out of 117 places after structural reductions.
[2022-05-16 13:47:16] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2022-05-16 13:47:16] [INFO ] Flatten gal took : 51 ms
FORMULA DES-PT-01a-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-16 13:47:16] [INFO ] Flatten gal took : 23 ms
[2022-05-16 13:47:16] [INFO ] Input system was already deterministic with 61 transitions.
Support contains 19 out of 117 places (down from 22) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 399 resets, run finished after 222 ms. (steps per millisecond=45 ) properties (out of 9) seen :8
Incomplete Best-First random walk after 10001 steps, including 106 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 61 rows 117 cols
[2022-05-16 13:47:16] [INFO ] Computed 58 place invariants in 8 ms
[2022-05-16 13:47:16] [INFO ] After 71ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-16 13:47:16] [INFO ] [Nat]Absence check using 33 positive place invariants in 9 ms returned sat
[2022-05-16 13:47:16] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 11 ms returned sat
[2022-05-16 13:47:17] [INFO ] After 72ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-16 13:47:17] [INFO ] After 102ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2022-05-16 13:47:17] [INFO ] After 209ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 8 ms.
Support contains 2 out of 117 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 117/117 places, 61/61 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 117 transition count 59
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 1 with 7 rules applied. Total rules applied 9 place count 117 transition count 59
Applied a total of 9 rules in 28 ms. Remains 117 /117 variables (removed 0) and now considering 59/61 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 117/117 places, 59/61 transitions.
Incomplete random walk after 10000 steps, including 137 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1661733 steps, run timeout after 3001 ms. (steps per millisecond=553 ) properties seen :{}
Probabilistic random walk after 1661733 steps, saw 220262 distinct states, run finished after 3005 ms. (steps per millisecond=552 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 59 rows 117 cols
[2022-05-16 13:47:20] [INFO ] Computed 60 place invariants in 4 ms
[2022-05-16 13:47:20] [INFO ] After 63ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-16 13:47:20] [INFO ] [Nat]Absence check using 36 positive place invariants in 11 ms returned sat
[2022-05-16 13:47:20] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 9 ms returned sat
[2022-05-16 13:47:20] [INFO ] After 102ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-16 13:47:20] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-16 13:47:20] [INFO ] After 27ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-16 13:47:20] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 1 ms to minimize.
[2022-05-16 13:47:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 52 ms
[2022-05-16 13:47:20] [INFO ] After 104ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 29 ms.
[2022-05-16 13:47:20] [INFO ] After 314ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 117 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 117/117 places, 59/59 transitions.
Applied a total of 0 rules in 11 ms. Remains 117 /117 variables (removed 0) and now considering 59/59 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 117/117 places, 59/59 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 117/117 places, 59/59 transitions.
Applied a total of 0 rules in 10 ms. Remains 117 /117 variables (removed 0) and now considering 59/59 (removed 0) transitions.
// Phase 1: matrix 59 rows 117 cols
[2022-05-16 13:47:20] [INFO ] Computed 60 place invariants in 5 ms
[2022-05-16 13:47:20] [INFO ] Implicit Places using invariants in 161 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 162 ms to find 1 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 116/117 places, 59/59 transitions.
Applied a total of 0 rules in 7 ms. Remains 116 /116 variables (removed 0) and now considering 59/59 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 116/117 places, 59/59 transitions.
Incomplete random walk after 10000 steps, including 141 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1706597 steps, run timeout after 3001 ms. (steps per millisecond=568 ) properties seen :{}
Probabilistic random walk after 1706597 steps, saw 225684 distinct states, run finished after 3001 ms. (steps per millisecond=568 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 59 rows 116 cols
[2022-05-16 13:47:23] [INFO ] Computed 59 place invariants in 3 ms
[2022-05-16 13:47:23] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-16 13:47:23] [INFO ] [Nat]Absence check using 37 positive place invariants in 12 ms returned sat
[2022-05-16 13:47:23] [INFO ] [Nat]Absence check using 37 positive and 22 generalized place invariants in 9 ms returned sat
[2022-05-16 13:47:24] [INFO ] After 60ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-16 13:47:24] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-16 13:47:24] [INFO ] After 20ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-16 13:47:24] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 1 ms to minimize.
[2022-05-16 13:47:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 34 ms
[2022-05-16 13:47:24] [INFO ] After 69ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2022-05-16 13:47:24] [INFO ] After 217ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 116 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 116/116 places, 59/59 transitions.
Applied a total of 0 rules in 6 ms. Remains 116 /116 variables (removed 0) and now considering 59/59 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 116/116 places, 59/59 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 116/116 places, 59/59 transitions.
Applied a total of 0 rules in 6 ms. Remains 116 /116 variables (removed 0) and now considering 59/59 (removed 0) transitions.
// Phase 1: matrix 59 rows 116 cols
[2022-05-16 13:47:24] [INFO ] Computed 59 place invariants in 1 ms
[2022-05-16 13:47:24] [INFO ] Implicit Places using invariants in 131 ms returned []
// Phase 1: matrix 59 rows 116 cols
[2022-05-16 13:47:24] [INFO ] Computed 59 place invariants in 2 ms
[2022-05-16 13:47:24] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-16 13:47:24] [INFO ] Implicit Places using invariants and state equation in 276 ms returned [8, 28, 34, 38, 42, 44, 46, 48, 50, 52, 54, 56, 58, 60, 62, 64, 66, 68, 70, 72, 94, 111]
Discarding 22 places :
Implicit Place search using SMT with State Equation took 416 ms to find 22 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 94/116 places, 59/59 transitions.
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 10 Pre rules applied. Total rules applied 0 place count 94 transition count 49
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 84 transition count 49
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Ensure Unique test removed 12 places
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 0 with 34 rules applied. Total rules applied 54 place count 61 transition count 38
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 55 place count 61 transition count 38
Applied a total of 55 rules in 17 ms. Remains 61 /94 variables (removed 33) and now considering 38/59 (removed 21) transitions.
// Phase 1: matrix 38 rows 61 cols
[2022-05-16 13:47:24] [INFO ] Computed 25 place invariants in 0 ms
[2022-05-16 13:47:24] [INFO ] Implicit Places using invariants in 87 ms returned [37, 40, 43, 47, 50]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 88 ms to find 5 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 56/116 places, 38/59 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 56 transition count 37
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 55 transition count 37
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 4 place count 53 transition count 35
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 53 transition count 35
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 52 transition count 33
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 52 transition count 33
Applied a total of 8 rules in 12 ms. Remains 52 /56 variables (removed 4) and now considering 33/38 (removed 5) transitions.
// Phase 1: matrix 33 rows 52 cols
[2022-05-16 13:47:24] [INFO ] Computed 20 place invariants in 0 ms
[2022-05-16 13:47:24] [INFO ] Implicit Places using invariants in 92 ms returned []
// Phase 1: matrix 33 rows 52 cols
[2022-05-16 13:47:24] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-16 13:47:24] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-05-16 13:47:24] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 232 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 3 : 52/116 places, 33/59 transitions.
Finished structural reductions, in 3 iterations. Remains : 52/116 places, 33/59 transitions.
Incomplete random walk after 10000 steps, including 240 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 67 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Probably explored full state space saw : 22038 states, properties seen :0
Probabilistic random walk after 95748 steps, saw 22038 distinct states, run finished after 104 ms. (steps per millisecond=920 ) properties seen :0
Explored full state space saw : 22038 states, properties seen :0
Exhaustive walk after 95748 steps, saw 22038 distinct states, run finished after 106 ms. (steps per millisecond=903 ) properties seen :0
FORMULA DES-PT-01a-LTLCardinality-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 5 simplifications.
FORMULA DES-PT-01a-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 20 stabilizing places and 15 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)&&F(X(p1)))))'
Support contains 3 out of 117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 61/61 transitions.
Applied a total of 0 rules in 5 ms. Remains 117 /117 variables (removed 0) and now considering 61/61 (removed 0) transitions.
// Phase 1: matrix 61 rows 117 cols
[2022-05-16 13:47:25] [INFO ] Computed 58 place invariants in 1 ms
[2022-05-16 13:47:25] [INFO ] Implicit Places using invariants in 193 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 195 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 116/117 places, 61/61 transitions.
Applied a total of 0 rules in 2 ms. Remains 116 /116 variables (removed 0) and now considering 61/61 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 116/117 places, 61/61 transitions.
Stuttering acceptance computed with spot in 363 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DES-PT-01a-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (OR (EQ s56 0) (EQ s56 1)) (OR (EQ s75 0) (EQ s79 1))), p1:(OR (EQ s75 0) (EQ s79 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 7562 reset in 603 ms.
Product exploration explored 100000 steps with 7625 reset in 411 ms.
Computed a total of 15 stabilizing places and 12 stable transitions
Computed a total of 15 stabilizing places and 12 stable transitions
Knowledge obtained : [(AND p0 p1), (X p1), (X p0), (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 252 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 121 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 2541 steps, including 105 resets, run visited all 2 properties in 106 ms. (steps per millisecond=23 )
Knowledge obtained : [(AND p0 p1), (X p1), (X p0), (X (X p1)), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 349 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 113 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 116 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 3 out of 116 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 116/116 places, 61/61 transitions.
Applied a total of 0 rules in 3 ms. Remains 116 /116 variables (removed 0) and now considering 61/61 (removed 0) transitions.
// Phase 1: matrix 61 rows 116 cols
[2022-05-16 13:47:28] [INFO ] Computed 57 place invariants in 3 ms
[2022-05-16 13:47:28] [INFO ] Implicit Places using invariants in 191 ms returned []
// Phase 1: matrix 61 rows 116 cols
[2022-05-16 13:47:28] [INFO ] Computed 57 place invariants in 2 ms
[2022-05-16 13:47:28] [INFO ] Implicit Places using invariants and state equation in 198 ms returned [8, 28, 32, 34, 38, 42, 44, 46, 48, 50, 52, 54, 58, 60, 62, 64, 66, 68, 70, 72, 94, 111]
Discarding 22 places :
Implicit Place search using SMT with State Equation took 391 ms to find 22 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 94/116 places, 61/61 transitions.
Applied a total of 0 rules in 3 ms. Remains 94 /94 variables (removed 0) and now considering 61/61 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 94/116 places, 61/61 transitions.
Computed a total of 13 stabilizing places and 12 stable transitions
Graph (complete) has 231 edges and 94 vertex of which 92 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Computed a total of 13 stabilizing places and 12 stable transitions
Knowledge obtained : [(AND p0 p1), (X p1), (X p0), (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 252 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 143 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 74 steps, including 2 resets, run visited all 2 properties in 2 ms. (steps per millisecond=37 )
Knowledge obtained : [(AND p0 p1), (X p1), (X p0), (X (X p1)), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 333 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 118 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 129 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 7529 reset in 191 ms.
Product exploration explored 100000 steps with 7420 reset in 212 ms.
Applying partial POR strategy [false, false, true]
Stuttering acceptance computed with spot in 147 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 3 out of 94 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 94/94 places, 61/61 transitions.
Graph (complete) has 231 edges and 94 vertex of which 92 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 1 place count 92 transition count 61
Deduced a syphon composed of 4 places in 1 ms
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 92 transition count 61
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 21 places in 1 ms
Iterating global reduction 0 with 17 rules applied. Total rules applied 22 place count 92 transition count 61
Deduced a syphon composed of 21 places in 0 ms
Applied a total of 22 rules in 14 ms. Remains 92 /94 variables (removed 2) and now considering 61/61 (removed 0) transitions.
[2022-05-16 13:47:30] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 61 rows 92 cols
[2022-05-16 13:47:30] [INFO ] Computed 34 place invariants in 1 ms
[2022-05-16 13:47:30] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 92/94 places, 61/61 transitions.
Finished structural reductions, in 1 iterations. Remains : 92/94 places, 61/61 transitions.
Product exploration explored 100000 steps with 7544 reset in 280 ms.
Product exploration explored 100000 steps with 7672 reset in 319 ms.
Built C files in :
/tmp/ltsmin10007345609424718595
[2022-05-16 13:47:31] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10007345609424718595
Running compilation step : cd /tmp/ltsmin10007345609424718595;'/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 383 ms.
Running link step : cd /tmp/ltsmin10007345609424718595;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin10007345609424718595;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased4864475166306406301.hoa' '--buchi-type=spotba'
LTSmin run took 7246 ms.
FORMULA DES-PT-01a-LTLCardinality-06 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DES-PT-01a-LTLCardinality-06 finished in 13572 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 117 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 117/117 places, 61/61 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 117 transition count 60
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 116 transition count 60
Applied a total of 2 rules in 8 ms. Remains 116 /117 variables (removed 1) and now considering 60/61 (removed 1) transitions.
// Phase 1: matrix 60 rows 116 cols
[2022-05-16 13:47:38] [INFO ] Computed 58 place invariants in 1 ms
[2022-05-16 13:47:38] [INFO ] Implicit Places using invariants in 113 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 115 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 115/117 places, 60/61 transitions.
Applied a total of 0 rules in 7 ms. Remains 115 /115 variables (removed 0) and now considering 60/60 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 115/117 places, 60/61 transitions.
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-01a-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (NEQ s8 0) (NEQ s89 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 28 steps with 0 reset in 1 ms.
FORMULA DES-PT-01a-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-01a-LTLCardinality-07 finished in 230 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 4 out of 117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 61/61 transitions.
Applied a total of 0 rules in 3 ms. Remains 117 /117 variables (removed 0) and now considering 61/61 (removed 0) transitions.
// Phase 1: matrix 61 rows 117 cols
[2022-05-16 13:47:39] [INFO ] Computed 58 place invariants in 3 ms
[2022-05-16 13:47:39] [INFO ] Implicit Places using invariants in 124 ms returned []
// Phase 1: matrix 61 rows 117 cols
[2022-05-16 13:47:39] [INFO ] Computed 58 place invariants in 2 ms
[2022-05-16 13:47:39] [INFO ] Implicit Places using invariants and state equation in 191 ms returned [9, 29, 33, 35, 39, 43, 45, 47, 49, 51, 53, 55, 57, 59, 61, 63, 65, 67, 69, 71, 73, 95, 112]
Discarding 23 places :
Implicit Place search using SMT with State Equation took 320 ms to find 23 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 94/117 places, 61/61 transitions.
Applied a total of 0 rules in 2 ms. Remains 94 /94 variables (removed 0) and now considering 61/61 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 94/117 places, 61/61 transitions.
Stuttering acceptance computed with spot in 124 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-01a-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (AND (EQ s1 0) (EQ s91 1)) (AND (EQ s34 0) (EQ s36 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, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 19 steps with 0 reset in 0 ms.
FORMULA DES-PT-01a-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-01a-LTLCardinality-11 finished in 465 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 117 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 117/117 places, 61/61 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 117 transition count 60
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 116 transition count 60
Applied a total of 2 rules in 7 ms. Remains 116 /117 variables (removed 1) and now considering 60/61 (removed 1) transitions.
// Phase 1: matrix 60 rows 116 cols
[2022-05-16 13:47:39] [INFO ] Computed 58 place invariants in 4 ms
[2022-05-16 13:47:39] [INFO ] Implicit Places using invariants in 127 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 131 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 115/117 places, 60/61 transitions.
Applied a total of 0 rules in 4 ms. Remains 115 /115 variables (removed 0) and now considering 60/60 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 115/117 places, 60/61 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-01a-LTLCardinality-14 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 (NEQ s106 0) (NEQ s38 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 126 steps with 4 reset in 0 ms.
FORMULA DES-PT-01a-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-01a-LTLCardinality-14 finished in 202 ms.
All properties solved by simple procedures.
Total runtime 24503 ms.

BK_STOP 1652708859880

--------------------
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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination 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="DES-PT-01a"
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 DES-PT-01a, 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 r042-smll-165252095700403"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-01a.tgz
mv DES-PT-01a execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;