Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 600K
-rw-r--r-- 1 mcc users 7.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 15:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 08:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 144K Apr 12 08:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Apr 12 08:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 88K Apr 12 08:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Apr 22 14:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 103K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716337392047

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-30b
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-22 00:23:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-22 00:23:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 00:23:13] [INFO ] Load time of PNML (sax parser for PT used): 85 ms
[2024-05-22 00:23:13] [INFO ] Transformed 399 places.
[2024-05-22 00:23:13] [INFO ] Transformed 350 transitions.
[2024-05-22 00:23:13] [INFO ] Found NUPN structural information;
[2024-05-22 00:23:13] [INFO ] Parsed PT model containing 399 places and 350 transitions and 1143 arcs in 153 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA DES-PT-30b-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-30b-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-30b-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-30b-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-30b-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 34 out of 399 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 399/399 places, 350/350 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 396 transition count 350
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 26 place count 373 transition count 327
Iterating global reduction 1 with 23 rules applied. Total rules applied 49 place count 373 transition count 327
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 63 place count 359 transition count 313
Iterating global reduction 1 with 14 rules applied. Total rules applied 77 place count 359 transition count 313
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 88 place count 359 transition count 302
Applied a total of 88 rules in 188 ms. Remains 359 /399 variables (removed 40) and now considering 302/350 (removed 48) transitions.
// Phase 1: matrix 302 rows 359 cols
[2024-05-22 00:23:14] [INFO ] Computed 62 invariants in 54 ms
[2024-05-22 00:23:14] [INFO ] Implicit Places using invariants in 367 ms returned []
[2024-05-22 00:23:14] [INFO ] Invariant cache hit.
[2024-05-22 00:23:14] [INFO ] Implicit Places using invariants and state equation in 408 ms returned []
Implicit Place search using SMT with State Equation took 815 ms to find 0 implicit places.
[2024-05-22 00:23:14] [INFO ] Invariant cache hit.
[2024-05-22 00:23:14] [INFO ] Dead Transitions using invariants and state equation in 159 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 359/399 places, 302/350 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1164 ms. Remains : 359/399 places, 302/350 transitions.
Support contains 34 out of 359 places after structural reductions.
[2024-05-22 00:23:15] [INFO ] Flatten gal took : 49 ms
[2024-05-22 00:23:15] [INFO ] Flatten gal took : 27 ms
[2024-05-22 00:23:15] [INFO ] Input system was already deterministic with 302 transitions.
Incomplete random walk after 10000 steps, including 88 resets, run finished after 414 ms. (steps per millisecond=24 ) properties (out of 20) seen :17
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-22 00:23:15] [INFO ] Invariant cache hit.
[2024-05-22 00:23:15] [INFO ] After 89ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-22 00:23:15] [INFO ] [Nat]Absence check using 33 positive place invariants in 6 ms returned sat
[2024-05-22 00:23:15] [INFO ] [Nat]Absence check using 33 positive and 29 generalized place invariants in 22 ms returned sat
[2024-05-22 00:23:16] [INFO ] After 244ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-22 00:23:16] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 4 ms to minimize.
[2024-05-22 00:23:16] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 0 ms to minimize.
[2024-05-22 00:23:16] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-05-22 00:23:16] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 0 ms to minimize.
[2024-05-22 00:23:16] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 1 ms to minimize.
[2024-05-22 00:23:16] [INFO ] Deduced a trap composed of 31 places in 39 ms of which 1 ms to minimize.
[2024-05-22 00:23:16] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 456 ms
[2024-05-22 00:23:16] [INFO ] Deduced a trap composed of 33 places in 49 ms of which 0 ms to minimize.
[2024-05-22 00:23:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 88 ms
[2024-05-22 00:23:16] [INFO ] After 849ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 65 ms.
[2024-05-22 00:23:16] [INFO ] After 1053ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 215 ms.
Support contains 4 out of 359 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 359/359 places, 302/302 transitions.
Graph (complete) has 776 edges and 359 vertex of which 351 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 20 rules applied. Total rules applied 21 place count 351 transition count 277
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 39 place count 333 transition count 277
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 39 place count 333 transition count 267
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 59 place count 323 transition count 267
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 61 place count 321 transition count 265
Iterating global reduction 2 with 2 rules applied. Total rules applied 63 place count 321 transition count 265
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 66 place count 321 transition count 262
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 68 place count 320 transition count 261
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 68 place count 320 transition count 260
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 70 place count 319 transition count 260
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 1 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 4 with 154 rules applied. Total rules applied 224 place count 242 transition count 183
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 228 place count 240 transition count 185
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 229 place count 240 transition count 184
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 230 place count 239 transition count 184
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 231 place count 239 transition count 184
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 232 place count 238 transition count 183
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 233 place count 237 transition count 183
Applied a total of 233 rules in 109 ms. Remains 237 /359 variables (removed 122) and now considering 183/302 (removed 119) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 109 ms. Remains : 237/359 places, 183/302 transitions.
Incomplete random walk after 10000 steps, including 479 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 84 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 98 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 1067238 steps, run timeout after 3001 ms. (steps per millisecond=355 ) properties seen :{}
Probabilistic random walk after 1067238 steps, saw 149633 distinct states, run finished after 3002 ms. (steps per millisecond=355 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 183 rows 237 cols
[2024-05-22 00:23:20] [INFO ] Computed 60 invariants in 3 ms
[2024-05-22 00:23:20] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-22 00:23:20] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-22 00:23:20] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 65 ms returned sat
[2024-05-22 00:23:20] [INFO ] After 222ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-22 00:23:20] [INFO ] After 293ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 71 ms.
[2024-05-22 00:23:20] [INFO ] After 500ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 63 ms.
Support contains 4 out of 237 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 237/237 places, 183/183 transitions.
Applied a total of 0 rules in 10 ms. Remains 237 /237 variables (removed 0) and now considering 183/183 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 237/237 places, 183/183 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 237/237 places, 183/183 transitions.
Applied a total of 0 rules in 10 ms. Remains 237 /237 variables (removed 0) and now considering 183/183 (removed 0) transitions.
[2024-05-22 00:23:21] [INFO ] Invariant cache hit.
[2024-05-22 00:23:21] [INFO ] Implicit Places using invariants in 139 ms returned []
[2024-05-22 00:23:21] [INFO ] Invariant cache hit.
[2024-05-22 00:23:21] [INFO ] Implicit Places using invariants and state equation in 254 ms returned []
Implicit Place search using SMT with State Equation took 401 ms to find 0 implicit places.
[2024-05-22 00:23:21] [INFO ] Redundant transitions in 8 ms returned []
[2024-05-22 00:23:21] [INFO ] Invariant cache hit.
[2024-05-22 00:23:21] [INFO ] Dead Transitions using invariants and state equation in 114 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 539 ms. Remains : 237/237 places, 183/183 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 237 transition count 183
Applied a total of 1 rules in 14 ms. Remains 237 /237 variables (removed 0) and now considering 183/183 (removed 0) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 183 rows 237 cols
[2024-05-22 00:23:21] [INFO ] Computed 60 invariants in 6 ms
[2024-05-22 00:23:21] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-22 00:23:21] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2024-05-22 00:23:21] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 67 ms returned sat
[2024-05-22 00:23:21] [INFO ] After 200ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-22 00:23:22] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 0 ms to minimize.
[2024-05-22 00:23:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 44 ms
[2024-05-22 00:23:22] [INFO ] After 317ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 43 ms.
[2024-05-22 00:23:22] [INFO ] After 491ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Computed a total of 176 stabilizing places and 168 stable transitions
Graph (complete) has 776 edges and 359 vertex of which 351 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.29 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 359 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 359/359 places, 302/302 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 355 transition count 298
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 355 transition count 298
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 10 place count 355 transition count 296
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 12 place count 353 transition count 294
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 353 transition count 294
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 15 place count 353 transition count 293
Applied a total of 15 rules in 22 ms. Remains 353 /359 variables (removed 6) and now considering 293/302 (removed 9) transitions.
// Phase 1: matrix 293 rows 353 cols
[2024-05-22 00:23:22] [INFO ] Computed 62 invariants in 12 ms
[2024-05-22 00:23:22] [INFO ] Implicit Places using invariants in 169 ms returned []
[2024-05-22 00:23:22] [INFO ] Invariant cache hit.
[2024-05-22 00:23:23] [INFO ] Implicit Places using invariants and state equation in 359 ms returned []
Implicit Place search using SMT with State Equation took 532 ms to find 0 implicit places.
[2024-05-22 00:23:23] [INFO ] Invariant cache hit.
[2024-05-22 00:23:23] [INFO ] Dead Transitions using invariants and state equation in 162 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 353/359 places, 293/302 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 725 ms. Remains : 353/359 places, 293/302 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 189 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-30b-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s85 0)], 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 50000 reset in 359 ms.
Product exploration explored 100000 steps with 50000 reset in 299 ms.
Computed a total of 176 stabilizing places and 168 stable transitions
Graph (complete) has 766 edges and 353 vertex of which 347 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.6 ms
Computed a total of 176 stabilizing places and 168 stable transitions
Detected a total of 176/353 stabilizing places and 168/293 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 16 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DES-PT-30b-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-30b-LTLCardinality-01 finished in 1662 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0&&(F(p1)||X(p0))))))'
Support contains 3 out of 359 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 359/359 places, 302/302 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 355 transition count 298
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 355 transition count 298
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 10 place count 355 transition count 296
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 12 place count 353 transition count 294
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 353 transition count 294
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 15 place count 353 transition count 293
Applied a total of 15 rules in 25 ms. Remains 353 /359 variables (removed 6) and now considering 293/302 (removed 9) transitions.
[2024-05-22 00:23:24] [INFO ] Invariant cache hit.
[2024-05-22 00:23:24] [INFO ] Implicit Places using invariants in 166 ms returned []
[2024-05-22 00:23:24] [INFO ] Invariant cache hit.
[2024-05-22 00:23:24] [INFO ] Implicit Places using invariants and state equation in 374 ms returned []
Implicit Place search using SMT with State Equation took 545 ms to find 0 implicit places.
[2024-05-22 00:23:24] [INFO ] Invariant cache hit.
[2024-05-22 00:23:24] [INFO ] Dead Transitions using invariants and state equation in 153 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 353/359 places, 293/302 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 726 ms. Remains : 353/359 places, 293/302 transitions.
Stuttering acceptance computed with spot in 222 ms :[(NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), true]
Running random walk in product with property : DES-PT-30b-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=4, aps=[p1:(AND (EQ s338 0) (EQ s281 1)), p0:(EQ s64 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, 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 1 ms.
FORMULA DES-PT-30b-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-30b-LTLCardinality-02 finished in 970 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0&&(p0 U p1)))))'
Support contains 4 out of 359 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 359/359 places, 302/302 transitions.
Graph (complete) has 776 edges and 359 vertex of which 351 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.3 ms
Discarding 8 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 350 transition count 281
Reduce places removed 15 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 335 transition count 280
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 33 place count 334 transition count 280
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 33 place count 334 transition count 270
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 53 place count 324 transition count 270
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 55 place count 322 transition count 268
Iterating global reduction 3 with 2 rules applied. Total rules applied 57 place count 322 transition count 268
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 60 place count 322 transition count 265
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 62 place count 321 transition count 264
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 62 place count 321 transition count 263
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 64 place count 320 transition count 263
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 0 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 5 with 152 rules applied. Total rules applied 216 place count 244 transition count 187
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 220 place count 242 transition count 189
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 222 place count 240 transition count 187
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 223 place count 239 transition count 187
Applied a total of 223 rules in 101 ms. Remains 239 /359 variables (removed 120) and now considering 187/302 (removed 115) transitions.
// Phase 1: matrix 187 rows 239 cols
[2024-05-22 00:23:25] [INFO ] Computed 58 invariants in 4 ms
[2024-05-22 00:23:25] [INFO ] Implicit Places using invariants in 125 ms returned []
[2024-05-22 00:23:25] [INFO ] Invariant cache hit.
[2024-05-22 00:23:25] [INFO ] Implicit Places using invariants and state equation in 235 ms returned []
Implicit Place search using SMT with State Equation took 363 ms to find 0 implicit places.
[2024-05-22 00:23:25] [INFO ] Redundant transitions in 8 ms returned []
[2024-05-22 00:23:25] [INFO ] Invariant cache hit.
[2024-05-22 00:23:25] [INFO ] Dead Transitions using invariants and state equation in 97 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 239/359 places, 187/302 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 581 ms. Remains : 239/359 places, 187/302 transitions.
Stuttering acceptance computed with spot in 102 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : DES-PT-30b-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s166 0) (EQ s206 1)), p1:(AND (OR (EQ s41 0) (EQ s169 1)) (OR (EQ s166 0) (EQ s206 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 5114 reset in 334 ms.
Product exploration explored 100000 steps with 5105 reset in 354 ms.
Computed a total of 134 stabilizing places and 129 stable transitions
Computed a total of 134 stabilizing places and 129 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 88 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 529 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10000 steps, including 97 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-22 00:23:26] [INFO ] Invariant cache hit.
[2024-05-22 00:23:26] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 00:23:26] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2024-05-22 00:23:26] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 73 ms returned sat
[2024-05-22 00:23:26] [INFO ] After 86ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 00:23:26] [INFO ] After 103ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2024-05-22 00:23:26] [INFO ] After 257ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 4 out of 239 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 239/239 places, 187/187 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 239 transition count 186
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 239 transition count 185
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 238 transition count 185
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 238 transition count 185
Applied a total of 4 rules in 20 ms. Remains 238 /239 variables (removed 1) and now considering 185/187 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 238/239 places, 185/187 transitions.
Incomplete random walk after 10000 steps, including 485 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 94 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1583133 steps, run timeout after 3001 ms. (steps per millisecond=527 ) properties seen :{}
Probabilistic random walk after 1583133 steps, saw 219177 distinct states, run finished after 3001 ms. (steps per millisecond=527 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 185 rows 238 cols
[2024-05-22 00:23:30] [INFO ] Computed 59 invariants in 5 ms
[2024-05-22 00:23:30] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 00:23:30] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-22 00:23:30] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 54 ms returned sat
[2024-05-22 00:23:30] [INFO ] After 166ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 00:23:30] [INFO ] After 202ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 24 ms.
[2024-05-22 00:23:30] [INFO ] After 332ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 4 out of 238 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 238/238 places, 185/185 transitions.
Applied a total of 0 rules in 5 ms. Remains 238 /238 variables (removed 0) and now considering 185/185 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 238/238 places, 185/185 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 238/238 places, 185/185 transitions.
Applied a total of 0 rules in 5 ms. Remains 238 /238 variables (removed 0) and now considering 185/185 (removed 0) transitions.
[2024-05-22 00:23:30] [INFO ] Invariant cache hit.
[2024-05-22 00:23:30] [INFO ] Implicit Places using invariants in 133 ms returned []
[2024-05-22 00:23:30] [INFO ] Invariant cache hit.
[2024-05-22 00:23:30] [INFO ] Implicit Places using invariants and state equation in 246 ms returned []
Implicit Place search using SMT with State Equation took 382 ms to find 0 implicit places.
[2024-05-22 00:23:30] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-22 00:23:30] [INFO ] Invariant cache hit.
[2024-05-22 00:23:30] [INFO ] Dead Transitions using invariants and state equation in 107 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 503 ms. Remains : 238/238 places, 185/185 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 238 transition count 185
Applied a total of 1 rules in 10 ms. Remains 238 /238 variables (removed 0) and now considering 185/185 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 185 rows 238 cols
[2024-05-22 00:23:30] [INFO ] Computed 59 invariants in 2 ms
[2024-05-22 00:23:30] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 00:23:31] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-22 00:23:31] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 54 ms returned sat
[2024-05-22 00:23:31] [INFO ] After 165ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 00:23:31] [INFO ] After 199ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2024-05-22 00:23:31] [INFO ] After 324ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 7 factoid took 157 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 81 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Support contains 4 out of 239 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 239/239 places, 187/187 transitions.
Applied a total of 0 rules in 11 ms. Remains 239 /239 variables (removed 0) and now considering 187/187 (removed 0) transitions.
// Phase 1: matrix 187 rows 239 cols
[2024-05-22 00:23:31] [INFO ] Computed 58 invariants in 2 ms
[2024-05-22 00:23:31] [INFO ] Implicit Places using invariants in 121 ms returned []
[2024-05-22 00:23:31] [INFO ] Invariant cache hit.
[2024-05-22 00:23:32] [INFO ] Implicit Places using invariants and state equation in 263 ms returned []
Implicit Place search using SMT with State Equation took 385 ms to find 0 implicit places.
[2024-05-22 00:23:32] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-22 00:23:32] [INFO ] Invariant cache hit.
[2024-05-22 00:23:32] [INFO ] Dead Transitions using invariants and state equation in 102 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 506 ms. Remains : 239/239 places, 187/187 transitions.
Computed a total of 134 stabilizing places and 129 stable transitions
Computed a total of 134 stabilizing places and 129 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 103 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 526 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10000 steps, including 96 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-22 00:23:32] [INFO ] Invariant cache hit.
[2024-05-22 00:23:32] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 00:23:32] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2024-05-22 00:23:32] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 65 ms returned sat
[2024-05-22 00:23:32] [INFO ] After 84ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 00:23:32] [INFO ] After 101ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2024-05-22 00:23:32] [INFO ] After 261ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 8 ms.
Support contains 4 out of 239 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 239/239 places, 187/187 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 239 transition count 186
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 239 transition count 185
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 238 transition count 185
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 238 transition count 185
Applied a total of 4 rules in 15 ms. Remains 238 /239 variables (removed 1) and now considering 185/187 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 238/239 places, 185/187 transitions.
Incomplete random walk after 10000 steps, including 501 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 101 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1498287 steps, run timeout after 3001 ms. (steps per millisecond=499 ) properties seen :{}
Probabilistic random walk after 1498287 steps, saw 208239 distinct states, run finished after 3002 ms. (steps per millisecond=499 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 185 rows 238 cols
[2024-05-22 00:23:35] [INFO ] Computed 59 invariants in 5 ms
[2024-05-22 00:23:35] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 00:23:35] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-22 00:23:35] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 52 ms returned sat
[2024-05-22 00:23:36] [INFO ] After 162ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 00:23:36] [INFO ] After 200ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 24 ms.
[2024-05-22 00:23:36] [INFO ] After 324ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 7 ms.
Support contains 4 out of 238 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 238/238 places, 185/185 transitions.
Applied a total of 0 rules in 5 ms. Remains 238 /238 variables (removed 0) and now considering 185/185 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 238/238 places, 185/185 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 238/238 places, 185/185 transitions.
Applied a total of 0 rules in 4 ms. Remains 238 /238 variables (removed 0) and now considering 185/185 (removed 0) transitions.
[2024-05-22 00:23:36] [INFO ] Invariant cache hit.
[2024-05-22 00:23:36] [INFO ] Implicit Places using invariants in 139 ms returned []
[2024-05-22 00:23:36] [INFO ] Invariant cache hit.
[2024-05-22 00:23:36] [INFO ] Implicit Places using invariants and state equation in 244 ms returned []
Implicit Place search using SMT with State Equation took 385 ms to find 0 implicit places.
[2024-05-22 00:23:36] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-22 00:23:36] [INFO ] Invariant cache hit.
[2024-05-22 00:23:36] [INFO ] Dead Transitions using invariants and state equation in 112 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 508 ms. Remains : 238/238 places, 185/185 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 238 transition count 185
Applied a total of 1 rules in 9 ms. Remains 238 /238 variables (removed 0) and now considering 185/185 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 185 rows 238 cols
[2024-05-22 00:23:36] [INFO ] Computed 59 invariants in 2 ms
[2024-05-22 00:23:36] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 00:23:36] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-22 00:23:36] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 53 ms returned sat
[2024-05-22 00:23:36] [INFO ] After 156ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 00:23:37] [INFO ] After 196ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2024-05-22 00:23:37] [INFO ] After 312ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 7 factoid took 153 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 71 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 74 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 5142 reset in 259 ms.
Product exploration explored 100000 steps with 5137 reset in 263 ms.
Built C files in :
/tmp/ltsmin1488661931502167916
[2024-05-22 00:23:37] [INFO ] Computing symmetric may disable matrix : 187 transitions.
[2024-05-22 00:23:37] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:23:37] [INFO ] Computing symmetric may enable matrix : 187 transitions.
[2024-05-22 00:23:37] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:23:38] [INFO ] Computing Do-Not-Accords matrix : 187 transitions.
[2024-05-22 00:23:38] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:23:38] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1488661931502167916
Running compilation step : cd /tmp/ltsmin1488661931502167916;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 521 ms.
Running link step : cd /tmp/ltsmin1488661931502167916;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin1488661931502167916;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased9748327837124053230.hoa' '--buchi-type=spotba'
LTSmin run took 3408 ms.
FORMULA DES-PT-30b-LTLCardinality-04 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DES-PT-30b-LTLCardinality-04 finished in 16988 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0)||(G(F(p1)) U p2)) U X(p3)))'
Support contains 7 out of 359 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 359/359 places, 302/302 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 356 transition count 299
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 356 transition count 299
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 356 transition count 297
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 10 place count 354 transition count 295
Iterating global reduction 1 with 2 rules applied. Total rules applied 12 place count 354 transition count 295
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 354 transition count 294
Applied a total of 13 rules in 18 ms. Remains 354 /359 variables (removed 5) and now considering 294/302 (removed 8) transitions.
// Phase 1: matrix 294 rows 354 cols
[2024-05-22 00:23:42] [INFO ] Computed 62 invariants in 5 ms
[2024-05-22 00:23:42] [INFO ] Implicit Places using invariants in 144 ms returned []
[2024-05-22 00:23:42] [INFO ] Invariant cache hit.
[2024-05-22 00:23:42] [INFO ] Implicit Places using invariants and state equation in 363 ms returned []
Implicit Place search using SMT with State Equation took 509 ms to find 0 implicit places.
[2024-05-22 00:23:42] [INFO ] Invariant cache hit.
[2024-05-22 00:23:42] [INFO ] Dead Transitions using invariants and state equation in 140 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 354/359 places, 294/302 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 668 ms. Remains : 354/359 places, 294/302 transitions.
Stuttering acceptance computed with spot in 378 ms :[(NOT p3), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (NOT p3), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (NOT p1), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : DES-PT-30b-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=1 dest: 4}, { cond=(NOT p3), acceptance={} source=1 dest: 5}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=1 dest: 6}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p3)), acceptance={0} source=2 dest: 1}, { cond=(NOT p3), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p2) (NOT p3)), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p3)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) (NOT p3)), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p0) (NOT p2) (NOT p3)), acceptance={} source=3 dest: 6}, { cond=(AND p0 (NOT p3)), acceptance={} source=3 dest: 7}, { cond=(AND p0 (NOT p2) (NOT p3)), acceptance={} source=3 dest: 8}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=6 dest: 4}, { cond=(NOT p2), acceptance={0} source=6 dest: 5}, { cond=(NOT p2), acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=7 dest: 4}, { cond=(NOT p0), acceptance={} source=7 dest: 5}, { cond=p0, acceptance={} source=7 dest: 7}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=8 dest: 6}, { cond=(AND p0 (NOT p2)), acceptance={} source=8 dest: 8}]], initial=0, aps=[p0:(OR (EQ s199 0) (EQ s101 1)), p2:(OR (EQ s182 0) (EQ s319 1)), p1:(OR (EQ s141 0) (EQ s215 1)), p3:(EQ s273 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, null, null, null][false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 96 steps with 0 reset in 0 ms.
FORMULA DES-PT-30b-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-30b-LTLCardinality-06 finished in 1079 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G((G(p0)||(p0&&F(!p1)))))||(F(p2)&&X((G(p0)||(p0&&F(!p1)))))))'
Support contains 6 out of 359 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 359/359 places, 302/302 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 355 transition count 298
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 355 transition count 298
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 10 place count 355 transition count 296
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 12 place count 353 transition count 294
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 353 transition count 294
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 15 place count 353 transition count 293
Applied a total of 15 rules in 16 ms. Remains 353 /359 variables (removed 6) and now considering 293/302 (removed 9) transitions.
// Phase 1: matrix 293 rows 353 cols
[2024-05-22 00:23:43] [INFO ] Computed 62 invariants in 5 ms
[2024-05-22 00:23:43] [INFO ] Implicit Places using invariants in 135 ms returned []
[2024-05-22 00:23:43] [INFO ] Invariant cache hit.
[2024-05-22 00:23:43] [INFO ] Implicit Places using invariants and state equation in 347 ms returned []
Implicit Place search using SMT with State Equation took 484 ms to find 0 implicit places.
[2024-05-22 00:23:43] [INFO ] Invariant cache hit.
[2024-05-22 00:23:43] [INFO ] Dead Transitions using invariants and state equation in 136 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 353/359 places, 293/302 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 637 ms. Remains : 353/359 places, 293/302 transitions.
Stuttering acceptance computed with spot in 228 ms :[(NOT p0), (AND (NOT p2) (NOT p0)), (NOT p0), (NOT p2), true, (AND p1 (NOT p0)), p1]
Running random walk in product with property : DES-PT-30b-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p2) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 4}, { cond=(AND p0 p1), acceptance={} source=2 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND p0 p1), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p0) p1), acceptance={} source=5 dest: 6}], [{ cond=p1, acceptance={0} source=6 dest: 6}]], initial=0, aps=[p2:(OR (EQ s118 0) (EQ s221 1)), p0:(OR (EQ s212 0) (EQ s199 1)), p1:(OR (EQ s184 0) (EQ s250 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, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 91 steps with 0 reset in 2 ms.
FORMULA DES-PT-30b-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-30b-LTLCardinality-08 finished in 891 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 359 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 359/359 places, 302/302 transitions.
Graph (complete) has 776 edges and 359 vertex of which 351 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.2 ms
Discarding 8 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 350 transition count 280
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 33 place count 334 transition count 280
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 33 place count 334 transition count 269
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 55 place count 323 transition count 269
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 57 place count 321 transition count 267
Iterating global reduction 2 with 2 rules applied. Total rules applied 59 place count 321 transition count 267
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 62 place count 321 transition count 264
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 64 place count 320 transition count 263
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 64 place count 320 transition count 262
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 66 place count 319 transition count 262
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: 71
Deduced a syphon composed of 71 places in 0 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 4 with 142 rules applied. Total rules applied 208 place count 248 transition count 191
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 212 place count 246 transition count 193
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 214 place count 244 transition count 191
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 215 place count 243 transition count 191
Applied a total of 215 rules in 45 ms. Remains 243 /359 variables (removed 116) and now considering 191/302 (removed 111) transitions.
// Phase 1: matrix 191 rows 243 cols
[2024-05-22 00:23:44] [INFO ] Computed 58 invariants in 3 ms
[2024-05-22 00:23:44] [INFO ] Implicit Places using invariants in 151 ms returned []
[2024-05-22 00:23:44] [INFO ] Invariant cache hit.
[2024-05-22 00:23:44] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-22 00:23:44] [INFO ] Implicit Places using invariants and state equation in 263 ms returned []
Implicit Place search using SMT with State Equation took 425 ms to find 0 implicit places.
[2024-05-22 00:23:44] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-22 00:23:44] [INFO ] Invariant cache hit.
[2024-05-22 00:23:44] [INFO ] Dead Transitions using invariants and state equation in 91 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 243/359 places, 191/302 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 566 ms. Remains : 243/359 places, 191/302 transitions.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-30b-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s156 1) (OR (EQ s135 0) (EQ s127 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 16 steps with 0 reset in 1 ms.
FORMULA DES-PT-30b-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-30b-LTLCardinality-09 finished in 613 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 359 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 359/359 places, 302/302 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 355 transition count 298
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 355 transition count 298
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 10 place count 355 transition count 296
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 12 place count 353 transition count 294
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 353 transition count 294
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 15 place count 353 transition count 293
Applied a total of 15 rules in 16 ms. Remains 353 /359 variables (removed 6) and now considering 293/302 (removed 9) transitions.
// Phase 1: matrix 293 rows 353 cols
[2024-05-22 00:23:44] [INFO ] Computed 62 invariants in 5 ms
[2024-05-22 00:23:44] [INFO ] Implicit Places using invariants in 144 ms returned []
[2024-05-22 00:23:44] [INFO ] Invariant cache hit.
[2024-05-22 00:23:45] [INFO ] Implicit Places using invariants and state equation in 342 ms returned []
Implicit Place search using SMT with State Equation took 487 ms to find 0 implicit places.
[2024-05-22 00:23:45] [INFO ] Invariant cache hit.
[2024-05-22 00:23:45] [INFO ] Dead Transitions using invariants and state equation in 143 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 353/359 places, 293/302 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 648 ms. Remains : 353/359 places, 293/302 transitions.
Stuttering acceptance computed with spot in 105 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-30b-LTLCardinality-10 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:(EQ s37 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 2 steps with 0 reset in 0 ms.
FORMULA DES-PT-30b-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-30b-LTLCardinality-10 finished in 771 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 359 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 359/359 places, 302/302 transitions.
Graph (complete) has 776 edges and 359 vertex of which 353 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 352 transition count 282
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 33 place count 336 transition count 282
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 33 place count 336 transition count 271
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 55 place count 325 transition count 271
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 57 place count 323 transition count 269
Iterating global reduction 2 with 2 rules applied. Total rules applied 59 place count 323 transition count 269
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 62 place count 323 transition count 266
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 64 place count 322 transition count 265
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 64 place count 322 transition count 264
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 66 place count 321 transition count 264
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 0 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 4 with 154 rules applied. Total rules applied 220 place count 244 transition count 187
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 222 place count 243 transition count 187
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 224 place count 241 transition count 185
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 225 place count 240 transition count 185
Applied a total of 225 rules in 40 ms. Remains 240 /359 variables (removed 119) and now considering 185/302 (removed 117) transitions.
// Phase 1: matrix 185 rows 240 cols
[2024-05-22 00:23:45] [INFO ] Computed 58 invariants in 1 ms
[2024-05-22 00:23:45] [INFO ] Implicit Places using invariants in 128 ms returned []
[2024-05-22 00:23:45] [INFO ] Invariant cache hit.
[2024-05-22 00:23:45] [INFO ] Implicit Places using invariants and state equation in 234 ms returned []
Implicit Place search using SMT with State Equation took 365 ms to find 0 implicit places.
[2024-05-22 00:23:45] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-22 00:23:45] [INFO ] Invariant cache hit.
[2024-05-22 00:23:45] [INFO ] Dead Transitions using invariants and state equation in 95 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 240/359 places, 185/302 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 507 ms. Remains : 240/359 places, 185/302 transitions.
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-30b-LTLCardinality-12 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 s136 0) (NEQ s121 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 24 steps with 0 reset in 1 ms.
FORMULA DES-PT-30b-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-30b-LTLCardinality-12 finished in 582 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((F(p0)&&F(G(p1))))||G(p2)))'
Support contains 4 out of 359 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 359/359 places, 302/302 transitions.
Graph (complete) has 776 edges and 359 vertex of which 351 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 350 transition count 280
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 33 place count 334 transition count 280
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 33 place count 334 transition count 269
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 55 place count 323 transition count 269
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 57 place count 321 transition count 267
Iterating global reduction 2 with 2 rules applied. Total rules applied 59 place count 321 transition count 267
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 62 place count 321 transition count 264
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 64 place count 320 transition count 263
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 64 place count 320 transition count 262
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 66 place count 319 transition count 262
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 4 with 146 rules applied. Total rules applied 212 place count 246 transition count 189
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 216 place count 244 transition count 191
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 218 place count 242 transition count 189
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 219 place count 241 transition count 189
Applied a total of 219 rules in 40 ms. Remains 241 /359 variables (removed 118) and now considering 189/302 (removed 113) transitions.
// Phase 1: matrix 189 rows 241 cols
[2024-05-22 00:23:46] [INFO ] Computed 58 invariants in 3 ms
[2024-05-22 00:23:46] [INFO ] Implicit Places using invariants in 129 ms returned []
[2024-05-22 00:23:46] [INFO ] Invariant cache hit.
[2024-05-22 00:23:46] [INFO ] Implicit Places using invariants and state equation in 221 ms returned []
Implicit Place search using SMT with State Equation took 351 ms to find 0 implicit places.
[2024-05-22 00:23:46] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-22 00:23:46] [INFO ] Invariant cache hit.
[2024-05-22 00:23:46] [INFO ] Dead Transitions using invariants and state equation in 101 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 241/359 places, 189/302 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 498 ms. Remains : 241/359 places, 189/302 transitions.
Stuttering acceptance computed with spot in 211 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : DES-PT-30b-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(AND (EQ s75 0) (EQ s176 1)), p0:(OR (EQ s176 0) (EQ s75 1)), p1:(AND (EQ s4 0) (EQ s178 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 15 steps with 0 reset in 0 ms.
FORMULA DES-PT-30b-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-30b-LTLCardinality-13 finished in 728 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 359 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 359/359 places, 302/302 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 357 transition count 300
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 357 transition count 300
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 356 transition count 299
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 356 transition count 299
Applied a total of 6 rules in 16 ms. Remains 356 /359 variables (removed 3) and now considering 299/302 (removed 3) transitions.
// Phase 1: matrix 299 rows 356 cols
[2024-05-22 00:23:46] [INFO ] Computed 62 invariants in 4 ms
[2024-05-22 00:23:46] [INFO ] Implicit Places using invariants in 147 ms returned []
[2024-05-22 00:23:46] [INFO ] Invariant cache hit.
[2024-05-22 00:23:47] [INFO ] Implicit Places using invariants and state equation in 343 ms returned []
Implicit Place search using SMT with State Equation took 491 ms to find 0 implicit places.
[2024-05-22 00:23:47] [INFO ] Invariant cache hit.
[2024-05-22 00:23:47] [INFO ] Dead Transitions using invariants and state equation in 144 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 356/359 places, 299/302 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 652 ms. Remains : 356/359 places, 299/302 transitions.
Stuttering acceptance computed with spot in 72 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-30b-LTLCardinality-14 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 s158 0) (NEQ s145 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 DES-PT-30b-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-30b-LTLCardinality-14 finished in 741 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 1 out of 359 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 359/359 places, 302/302 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 355 transition count 298
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 355 transition count 298
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 10 place count 355 transition count 296
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 12 place count 353 transition count 294
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 353 transition count 294
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 15 place count 353 transition count 293
Applied a total of 15 rules in 20 ms. Remains 353 /359 variables (removed 6) and now considering 293/302 (removed 9) transitions.
// Phase 1: matrix 293 rows 353 cols
[2024-05-22 00:23:47] [INFO ] Computed 62 invariants in 5 ms
[2024-05-22 00:23:47] [INFO ] Implicit Places using invariants in 183 ms returned []
[2024-05-22 00:23:47] [INFO ] Invariant cache hit.
[2024-05-22 00:23:47] [INFO ] Implicit Places using invariants and state equation in 350 ms returned []
Implicit Place search using SMT with State Equation took 536 ms to find 0 implicit places.
[2024-05-22 00:23:47] [INFO ] Invariant cache hit.
[2024-05-22 00:23:48] [INFO ] Dead Transitions using invariants and state equation in 146 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 353/359 places, 293/302 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 704 ms. Remains : 353/359 places, 293/302 transitions.
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-30b-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(EQ s163 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, null][false, false, false]]
Stuttering criterion allowed to conclude after 94 steps with 0 reset in 1 ms.
FORMULA DES-PT-30b-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-30b-LTLCardinality-15 finished in 813 ms.
All properties solved by simple procedures.
Total runtime 34779 ms.

BK_STOP 1716337429143

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

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

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DES-PT-30b"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is DES-PT-30b, 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 r109-tall-171624208600442"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-30b.tgz
mv DES-PT-30b 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 ;