Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r039-tajo-167813692600459.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.......................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is BusinessProcesses-PT-02, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r039-tajo-167813692600459
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 7.7K Feb 25 16:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Feb 25 16:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 25 16:43 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 25 16:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:38 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 15:38 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 15:38 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 16:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K Feb 25 16:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Feb 25 16:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K Feb 25 16:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:38 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:38 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 59K Mar 5 18:22 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 BusinessProcesses-PT-02-LTLCardinality-00
FORMULA_NAME BusinessProcesses-PT-02-LTLCardinality-01
FORMULA_NAME BusinessProcesses-PT-02-LTLCardinality-02
FORMULA_NAME BusinessProcesses-PT-02-LTLCardinality-03
FORMULA_NAME BusinessProcesses-PT-02-LTLCardinality-04
FORMULA_NAME BusinessProcesses-PT-02-LTLCardinality-05
FORMULA_NAME BusinessProcesses-PT-02-LTLCardinality-06
FORMULA_NAME BusinessProcesses-PT-02-LTLCardinality-07
FORMULA_NAME BusinessProcesses-PT-02-LTLCardinality-08
FORMULA_NAME BusinessProcesses-PT-02-LTLCardinality-09
FORMULA_NAME BusinessProcesses-PT-02-LTLCardinality-10
FORMULA_NAME BusinessProcesses-PT-02-LTLCardinality-11
FORMULA_NAME BusinessProcesses-PT-02-LTLCardinality-12
FORMULA_NAME BusinessProcesses-PT-02-LTLCardinality-13
FORMULA_NAME BusinessProcesses-PT-02-LTLCardinality-14
FORMULA_NAME BusinessProcesses-PT-02-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678500851209

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=lolaxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-02
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-11 02:14:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-11 02:14:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 02:14:13] [INFO ] Load time of PNML (sax parser for PT used): 85 ms
[2023-03-11 02:14:13] [INFO ] Transformed 262 places.
[2023-03-11 02:14:13] [INFO ] Transformed 219 transitions.
[2023-03-11 02:14:13] [INFO ] Found NUPN structural information;
[2023-03-11 02:14:13] [INFO ] Parsed PT model containing 262 places and 219 transitions and 576 arcs in 208 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 5 formulas.
Deduced a syphon composed of 17 places in 3 ms
Reduce places removed 17 places and 15 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA BusinessProcesses-PT-02-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-02-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-02-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-02-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-02-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-02-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-02-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-02-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 27 out of 245 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 245/245 places, 204/204 transitions.
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 239 transition count 204
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 33 place count 212 transition count 177
Iterating global reduction 1 with 27 rules applied. Total rules applied 60 place count 212 transition count 177
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 74 place count 198 transition count 163
Iterating global reduction 1 with 14 rules applied. Total rules applied 88 place count 198 transition count 163
Applied a total of 88 rules in 111 ms. Remains 198 /245 variables (removed 47) and now considering 163/204 (removed 41) transitions.
// Phase 1: matrix 163 rows 198 cols
[2023-03-11 02:14:13] [INFO ] Computed 37 place invariants in 17 ms
[2023-03-11 02:14:14] [INFO ] Implicit Places using invariants in 309 ms returned []
[2023-03-11 02:14:14] [INFO ] Invariant cache hit.
[2023-03-11 02:14:14] [INFO ] Implicit Places using invariants and state equation in 262 ms returned []
Implicit Place search using SMT with State Equation took 599 ms to find 0 implicit places.
[2023-03-11 02:14:14] [INFO ] Invariant cache hit.
[2023-03-11 02:14:15] [INFO ] Dead Transitions using invariants and state equation in 785 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 198/245 places, 163/204 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1508 ms. Remains : 198/245 places, 163/204 transitions.
Support contains 27 out of 198 places after structural reductions.
[2023-03-11 02:14:15] [INFO ] Flatten gal took : 42 ms
[2023-03-11 02:14:15] [INFO ] Flatten gal took : 21 ms
[2023-03-11 02:14:15] [INFO ] Input system was already deterministic with 163 transitions.
Incomplete random walk after 10000 steps, including 131 resets, run finished after 340 ms. (steps per millisecond=29 ) properties (out of 14) seen :9
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 25 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-11 02:14:16] [INFO ] Invariant cache hit.
[2023-03-11 02:14:16] [INFO ] After 74ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-11 02:14:16] [INFO ] [Nat]Absence check using 24 positive place invariants in 6 ms returned sat
[2023-03-11 02:14:16] [INFO ] [Nat]Absence check using 24 positive and 13 generalized place invariants in 3 ms returned sat
[2023-03-11 02:14:16] [INFO ] After 118ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-11 02:14:16] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 3 ms to minimize.
[2023-03-11 02:14:16] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 0 ms to minimize.
[2023-03-11 02:14:16] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2023-03-11 02:14:16] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
[2023-03-11 02:14:16] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 192 ms
[2023-03-11 02:14:16] [INFO ] After 376ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 33 ms.
[2023-03-11 02:14:16] [INFO ] After 504ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 10 ms.
Support contains 10 out of 198 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 198/198 places, 163/163 transitions.
Graph (trivial) has 91 edges and 198 vertex of which 7 / 198 are part of one of the 1 SCC in 3 ms
Free SCC test removed 6 places
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (complete) has 379 edges and 192 vertex of which 189 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 27 place count 189 transition count 126
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 52 place count 164 transition count 126
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 33 Pre rules applied. Total rules applied 52 place count 164 transition count 93
Deduced a syphon composed of 33 places in 1 ms
Ensure Unique test removed 5 places
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 71 rules applied. Total rules applied 123 place count 126 transition count 93
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 127 place count 122 transition count 89
Iterating global reduction 2 with 4 rules applied. Total rules applied 131 place count 122 transition count 89
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
Deduced a syphon composed of 46 places in 1 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 2 with 92 rules applied. Total rules applied 223 place count 76 transition count 43
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 224 place count 76 transition count 42
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 225 place count 75 transition count 42
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 226 place count 75 transition count 42
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 227 place count 74 transition count 41
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 228 place count 73 transition count 41
Applied a total of 228 rules in 46 ms. Remains 73 /198 variables (removed 125) and now considering 41/163 (removed 122) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 73/198 places, 41/163 transitions.
Finished random walk after 9283 steps, including 299 resets, run visited all 4 properties in 21 ms. (steps per millisecond=442 )
FORMULA BusinessProcesses-PT-02-LTLCardinality-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA BusinessProcesses-PT-02-LTLCardinality-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 190 stabilizing places and 153 stable transitions
Graph (complete) has 387 edges and 198 vertex of which 195 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||X(G((G(p1) U (G(p2)||X(F(p3)))))))))'
Support contains 8 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 163/163 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 195 transition count 160
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 195 transition count 160
Applied a total of 6 rules in 10 ms. Remains 195 /198 variables (removed 3) and now considering 160/163 (removed 3) transitions.
// Phase 1: matrix 160 rows 195 cols
[2023-03-11 02:14:17] [INFO ] Computed 37 place invariants in 3 ms
[2023-03-11 02:14:17] [INFO ] Implicit Places using invariants in 61 ms returned []
[2023-03-11 02:14:17] [INFO ] Invariant cache hit.
[2023-03-11 02:14:17] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 181 ms to find 0 implicit places.
[2023-03-11 02:14:17] [INFO ] Invariant cache hit.
[2023-03-11 02:14:17] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 195/198 places, 160/163 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 265 ms. Remains : 195/198 places, 160/163 transitions.
Stuttering acceptance computed with spot in 469 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3) p2 (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3) (NOT p2))]
Running random walk in product with property : BusinessProcesses-PT-02-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) p2 (NOT p1) (NOT p3)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p0) p2 p1 (NOT p3)), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1) (NOT p3)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p0) (NOT p2) p1 (NOT p3)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p0) p2 p1 (NOT p3)), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p0) (NOT p2) p1 (NOT p3)), acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p0) p2 (NOT p1) (NOT p3)), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p3)), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p0) p2 (NOT p3)), acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(OR (EQ s22 0) (EQ s180 1)), p2:(OR (EQ s172 0) (EQ s117 1)), p1:(OR (EQ s178 0) (EQ s171 1)), p3:(OR (EQ s150 0) (EQ s32 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 396 ms.
Product exploration explored 100000 steps with 50000 reset in 269 ms.
Computed a total of 188 stabilizing places and 151 stable transitions
Graph (complete) has 384 edges and 195 vertex of which 192 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.4 ms
Computed a total of 188 stabilizing places and 151 stable transitions
Detected a total of 188/195 stabilizing places and 151/160 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 4/4 atomic propositions.
Knowledge obtained : [(AND p0 p2 p1 p3), (X p0), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 10 factoid took 132 ms. Reduced automaton from 7 states, 17 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-02-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-02-LTLCardinality-05 finished in 1607 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&(F(!p1) U p2)))'
Support contains 6 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 163/163 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 192 transition count 157
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 192 transition count 157
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 190 transition count 155
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 190 transition count 155
Applied a total of 16 rules in 8 ms. Remains 190 /198 variables (removed 8) and now considering 155/163 (removed 8) transitions.
// Phase 1: matrix 155 rows 190 cols
[2023-03-11 02:14:18] [INFO ] Computed 37 place invariants in 4 ms
[2023-03-11 02:14:18] [INFO ] Implicit Places using invariants in 75 ms returned []
[2023-03-11 02:14:18] [INFO ] Invariant cache hit.
[2023-03-11 02:14:19] [INFO ] Implicit Places using invariants and state equation in 256 ms returned []
Implicit Place search using SMT with State Equation took 333 ms to find 0 implicit places.
[2023-03-11 02:14:19] [INFO ] Invariant cache hit.
[2023-03-11 02:14:19] [INFO ] Dead Transitions using invariants and state equation in 182 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 190/198 places, 155/163 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 534 ms. Remains : 190/198 places, 155/163 transitions.
Stuttering acceptance computed with spot in 337 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), p1, (NOT p2), true]
Running random walk in product with property : BusinessProcesses-PT-02-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 2}, { cond=(NOT p2), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(OR (EQ s113 0) (EQ s66 1)), p1:(OR (EQ s138 0) (EQ s124 1)), p0:(AND (NEQ s138 0) (NEQ s124 1) (NEQ s110 0) (NEQ s184 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-02-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-02-LTLCardinality-08 finished in 896 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 2 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 163/163 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 190 transition count 155
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 190 transition count 155
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 188 transition count 153
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 188 transition count 153
Applied a total of 20 rules in 8 ms. Remains 188 /198 variables (removed 10) and now considering 153/163 (removed 10) transitions.
// Phase 1: matrix 153 rows 188 cols
[2023-03-11 02:14:19] [INFO ] Computed 37 place invariants in 2 ms
[2023-03-11 02:14:19] [INFO ] Implicit Places using invariants in 155 ms returned []
[2023-03-11 02:14:19] [INFO ] Invariant cache hit.
[2023-03-11 02:14:19] [INFO ] Implicit Places using invariants and state equation in 177 ms returned []
Implicit Place search using SMT with State Equation took 335 ms to find 0 implicit places.
[2023-03-11 02:14:19] [INFO ] Invariant cache hit.
[2023-03-11 02:14:20] [INFO ] Dead Transitions using invariants and state equation in 113 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 188/198 places, 153/163 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 470 ms. Remains : 188/198 places, 153/163 transitions.
Stuttering acceptance computed with spot in 301 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-02-LTLCardinality-09 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: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(OR (EQ s178 0) (EQ s38 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][false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 268 ms.
Product exploration explored 100000 steps with 25000 reset in 288 ms.
Computed a total of 181 stabilizing places and 144 stable transitions
Graph (complete) has 375 edges and 188 vertex of which 185 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Computed a total of 181 stabilizing places and 144 stable transitions
Detected a total of 181/188 stabilizing places and 144/153 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 148 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 137 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 129 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 9285 steps, run visited all 1 properties in 64 ms. (steps per millisecond=145 )
Probabilistic random walk after 9285 steps, saw 2443 distinct states, run finished after 64 ms. (steps per millisecond=145 ) properties seen :1
Knowledge obtained : [p0, true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 202 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 168 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 149 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 153/153 transitions.
Applied a total of 0 rules in 2 ms. Remains 188 /188 variables (removed 0) and now considering 153/153 (removed 0) transitions.
[2023-03-11 02:14:21] [INFO ] Invariant cache hit.
[2023-03-11 02:14:21] [INFO ] Implicit Places using invariants in 104 ms returned []
[2023-03-11 02:14:21] [INFO ] Invariant cache hit.
[2023-03-11 02:14:22] [INFO ] Implicit Places using invariants and state equation in 190 ms returned []
Implicit Place search using SMT with State Equation took 298 ms to find 0 implicit places.
[2023-03-11 02:14:22] [INFO ] Invariant cache hit.
[2023-03-11 02:14:22] [INFO ] Dead Transitions using invariants and state equation in 126 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 429 ms. Remains : 188/188 places, 153/153 transitions.
Computed a total of 181 stabilizing places and 144 stable transitions
Graph (complete) has 375 edges and 188 vertex of which 185 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Computed a total of 181 stabilizing places and 144 stable transitions
Detected a total of 181/188 stabilizing places and 144/153 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 160 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 164 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 130 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 25 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 9285 steps, run visited all 1 properties in 59 ms. (steps per millisecond=157 )
Probabilistic random walk after 9285 steps, saw 2443 distinct states, run finished after 59 ms. (steps per millisecond=157 ) properties seen :1
Knowledge obtained : [p0, true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 545 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 270 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 186 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 194 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 160 ms.
Product exploration explored 100000 steps with 25000 reset in 214 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 153 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 188 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 188/188 places, 153/153 transitions.
Graph (trivial) has 89 edges and 188 vertex of which 6 / 188 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 369 edges and 183 vertex of which 180 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 23 rules applied. Total rules applied 25 place count 180 transition count 144
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 28 Pre rules applied. Total rules applied 25 place count 180 transition count 165
Deduced a syphon composed of 51 places in 0 ms
Iterating global reduction 1 with 28 rules applied. Total rules applied 53 place count 180 transition count 165
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 60 place count 173 transition count 153
Deduced a syphon composed of 44 places in 0 ms
Iterating global reduction 1 with 7 rules applied. Total rules applied 67 place count 173 transition count 153
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 103 places in 0 ms
Iterating global reduction 1 with 59 rules applied. Total rules applied 126 place count 173 transition count 153
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 142 place count 157 transition count 137
Deduced a syphon composed of 87 places in 0 ms
Iterating global reduction 1 with 16 rules applied. Total rules applied 158 place count 157 transition count 137
Deduced a syphon composed of 87 places in 0 ms
Applied a total of 158 rules in 51 ms. Remains 157 /188 variables (removed 31) and now considering 137/153 (removed 16) transitions.
[2023-03-11 02:14:24] [INFO ] Redundant transitions in 30 ms returned []
// Phase 1: matrix 137 rows 157 cols
[2023-03-11 02:14:24] [INFO ] Computed 37 place invariants in 3 ms
[2023-03-11 02:14:24] [INFO ] Dead Transitions using invariants and state equation in 89 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 157/188 places, 137/153 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 187 ms. Remains : 157/188 places, 137/153 transitions.
Support contains 2 out of 188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 153/153 transitions.
Applied a total of 0 rules in 4 ms. Remains 188 /188 variables (removed 0) and now considering 153/153 (removed 0) transitions.
// Phase 1: matrix 153 rows 188 cols
[2023-03-11 02:14:24] [INFO ] Computed 37 place invariants in 2 ms
[2023-03-11 02:14:24] [INFO ] Implicit Places using invariants in 73 ms returned []
[2023-03-11 02:14:24] [INFO ] Invariant cache hit.
[2023-03-11 02:14:25] [INFO ] Implicit Places using invariants and state equation in 183 ms returned []
Implicit Place search using SMT with State Equation took 260 ms to find 0 implicit places.
[2023-03-11 02:14:25] [INFO ] Invariant cache hit.
[2023-03-11 02:14:25] [INFO ] Dead Transitions using invariants and state equation in 94 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 360 ms. Remains : 188/188 places, 153/153 transitions.
Treatment of property BusinessProcesses-PT-02-LTLCardinality-09 finished in 5699 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 198 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 198/198 places, 163/163 transitions.
Graph (trivial) has 98 edges and 198 vertex of which 4 / 198 are part of one of the 1 SCC in 1 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (complete) has 384 edges and 195 vertex of which 192 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 31 place count 191 transition count 127
Reduce places removed 29 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 30 rules applied. Total rules applied 61 place count 162 transition count 126
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 62 place count 161 transition count 126
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 38 Pre rules applied. Total rules applied 62 place count 161 transition count 88
Deduced a syphon composed of 38 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 146 place count 115 transition count 88
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 153 place count 108 transition count 81
Iterating global reduction 3 with 7 rules applied. Total rules applied 160 place count 108 transition count 81
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 45
Deduced a syphon composed of 45 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 92 rules applied. Total rules applied 252 place count 61 transition count 36
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 253 place count 61 transition count 36
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 254 place count 60 transition count 35
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 255 place count 59 transition count 35
Applied a total of 255 rules in 33 ms. Remains 59 /198 variables (removed 139) and now considering 35/163 (removed 128) transitions.
// Phase 1: matrix 35 rows 59 cols
[2023-03-11 02:14:25] [INFO ] Computed 26 place invariants in 1 ms
[2023-03-11 02:14:25] [INFO ] Implicit Places using invariants in 52 ms returned []
[2023-03-11 02:14:25] [INFO ] Invariant cache hit.
[2023-03-11 02:14:25] [INFO ] Implicit Places using invariants and state equation in 72 ms returned [0, 1, 2, 4, 6, 8, 11, 12, 13, 14, 15, 17, 19, 21, 22, 23, 25, 27, 29, 31, 33, 35, 37, 39, 41]
Discarding 25 places :
Implicit Place search using SMT with State Equation took 131 ms to find 25 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 34/198 places, 35/163 transitions.
Graph (complete) has 68 edges and 34 vertex of which 32 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 32 transition count 28
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 26 transition count 28
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 15 place count 24 transition count 26
Iterating global reduction 2 with 2 rules applied. Total rules applied 17 place count 24 transition count 26
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 9 rules applied. Total rules applied 26 place count 19 transition count 22
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 28 place count 18 transition count 21
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 29 place count 18 transition count 20
Applied a total of 29 rules in 7 ms. Remains 18 /34 variables (removed 16) and now considering 20/35 (removed 15) transitions.
// Phase 1: matrix 20 rows 18 cols
[2023-03-11 02:14:25] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-11 02:14:25] [INFO ] Implicit Places using invariants in 33 ms returned []
[2023-03-11 02:14:25] [INFO ] Invariant cache hit.
[2023-03-11 02:14:25] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 18/198 places, 20/163 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 234 ms. Remains : 18/198 places, 20/163 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-02-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (NEQ s14 0) (NEQ s0 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-02-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-02-LTLCardinality-11 finished in 302 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 163/163 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 190 transition count 155
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 190 transition count 155
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 188 transition count 153
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 188 transition count 153
Applied a total of 20 rules in 12 ms. Remains 188 /198 variables (removed 10) and now considering 153/163 (removed 10) transitions.
// Phase 1: matrix 153 rows 188 cols
[2023-03-11 02:14:25] [INFO ] Computed 37 place invariants in 2 ms
[2023-03-11 02:14:25] [INFO ] Implicit Places using invariants in 77 ms returned []
[2023-03-11 02:14:25] [INFO ] Invariant cache hit.
[2023-03-11 02:14:25] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 213 ms to find 0 implicit places.
[2023-03-11 02:14:25] [INFO ] Invariant cache hit.
[2023-03-11 02:14:25] [INFO ] Dead Transitions using invariants and state equation in 119 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 188/198 places, 153/163 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 345 ms. Remains : 188/198 places, 153/163 transitions.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-02-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s102 0) (EQ s10 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 263 ms.
Product exploration explored 100000 steps with 50000 reset in 280 ms.
Computed a total of 181 stabilizing places and 144 stable transitions
Graph (complete) has 375 edges and 188 vertex of which 185 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Computed a total of 181 stabilizing places and 144 stable transitions
Detected a total of 181/188 stabilizing places and 144/153 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 :(X p0)
Knowledge based reduction with 4 factoid took 88 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-02-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-02-LTLCardinality-13 finished in 1059 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 198 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 198/198 places, 163/163 transitions.
Graph (trivial) has 100 edges and 198 vertex of which 7 / 198 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 380 edges and 192 vertex of which 189 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 31 place count 188 transition count 123
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 1 with 29 rules applied. Total rules applied 60 place count 159 transition count 123
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 37 Pre rules applied. Total rules applied 60 place count 159 transition count 86
Deduced a syphon composed of 37 places in 1 ms
Ensure Unique test removed 7 places
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 2 with 81 rules applied. Total rules applied 141 place count 115 transition count 86
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 148 place count 108 transition count 79
Iterating global reduction 2 with 7 rules applied. Total rules applied 155 place count 108 transition count 79
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
Deduced a syphon composed of 46 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 94 rules applied. Total rules applied 249 place count 60 transition count 33
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 250 place count 59 transition count 32
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 251 place count 58 transition count 32
Applied a total of 251 rules in 32 ms. Remains 58 /198 variables (removed 140) and now considering 32/163 (removed 131) transitions.
// Phase 1: matrix 32 rows 58 cols
[2023-03-11 02:14:26] [INFO ] Computed 27 place invariants in 1 ms
[2023-03-11 02:14:26] [INFO ] Implicit Places using invariants in 74 ms returned [15]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 75 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 57/198 places, 32/163 transitions.
Applied a total of 0 rules in 2 ms. Remains 57 /57 variables (removed 0) and now considering 32/32 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 110 ms. Remains : 57/198 places, 32/163 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-02-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s50 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 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-02-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-02-LTLCardinality-15 finished in 150 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Found a Shortening insensitive property : BusinessProcesses-PT-02-LTLCardinality-09
Stuttering acceptance computed with spot in 188 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 198 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 198/198 places, 163/163 transitions.
Graph (trivial) has 99 edges and 198 vertex of which 7 / 198 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 380 edges and 192 vertex of which 189 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 31 place count 188 transition count 123
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 1 with 29 rules applied. Total rules applied 60 place count 159 transition count 123
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 36 Pre rules applied. Total rules applied 60 place count 159 transition count 87
Deduced a syphon composed of 36 places in 0 ms
Ensure Unique test removed 7 places
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 2 with 79 rules applied. Total rules applied 139 place count 116 transition count 87
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 146 place count 109 transition count 80
Iterating global reduction 2 with 7 rules applied. Total rules applied 153 place count 109 transition count 80
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
Deduced a syphon composed of 46 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 94 rules applied. Total rules applied 247 place count 61 transition count 34
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 248 place count 60 transition count 33
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 249 place count 59 transition count 33
Applied a total of 249 rules in 19 ms. Remains 59 /198 variables (removed 139) and now considering 33/163 (removed 130) transitions.
// Phase 1: matrix 33 rows 59 cols
[2023-03-11 02:14:27] [INFO ] Computed 27 place invariants in 1 ms
[2023-03-11 02:14:27] [INFO ] Implicit Places using invariants in 45 ms returned [15]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 46 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 58/198 places, 33/163 transitions.
Applied a total of 0 rules in 1 ms. Remains 58 /58 variables (removed 0) and now considering 33/33 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 67 ms. Remains : 58/198 places, 33/163 transitions.
Running random walk in product with property : BusinessProcesses-PT-02-LTLCardinality-09 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: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(OR (EQ s51 0) (EQ s7 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 36456 reset in 215 ms.
Product exploration explored 100000 steps with 36534 reset in 169 ms.
Computed a total of 58 stabilizing places and 32 stable transitions
Computed a total of 58 stabilizing places and 32 stable transitions
Detected a total of 58/58 stabilizing places and 32/33 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 133 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 128 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 3545 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 1313 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Finished probabilistic random walk after 110 steps, run visited all 1 properties in 6 ms. (steps per millisecond=18 )
Probabilistic random walk after 110 steps, saw 65 distinct states, run finished after 6 ms. (steps per millisecond=18 ) properties seen :1
Knowledge obtained : [p0, true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 186 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 178 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 58 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 58/58 places, 33/33 transitions.
Applied a total of 0 rules in 0 ms. Remains 58 /58 variables (removed 0) and now considering 33/33 (removed 0) transitions.
// Phase 1: matrix 33 rows 58 cols
[2023-03-11 02:14:28] [INFO ] Computed 26 place invariants in 0 ms
[2023-03-11 02:14:28] [INFO ] Implicit Places using invariants in 48 ms returned []
[2023-03-11 02:14:28] [INFO ] Invariant cache hit.
[2023-03-11 02:14:28] [INFO ] Implicit Places using invariants and state equation in 65 ms returned [0, 1, 2, 3, 5, 8, 11, 12, 13, 14, 15, 17, 19, 21, 22, 23, 25, 27, 29, 31, 33, 35, 37, 39, 41]
Discarding 25 places :
Implicit Place search using SMT with State Equation took 115 ms to find 25 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 33/58 places, 33/33 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 32 transition count 32
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 32 transition count 32
Applied a total of 2 rules in 1 ms. Remains 32 /33 variables (removed 1) and now considering 32/33 (removed 1) transitions.
// Phase 1: matrix 32 rows 32 cols
[2023-03-11 02:14:28] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-11 02:14:28] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-11 02:14:28] [INFO ] Invariant cache hit.
[2023-03-11 02:14:28] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 32/58 places, 32/33 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 172 ms. Remains : 32/58 places, 32/33 transitions.
Computed a total of 32 stabilizing places and 31 stable transitions
Graph (complete) has 63 edges and 32 vertex of which 30 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Computed a total of 32 stabilizing places and 31 stable transitions
Detected a total of 32/32 stabilizing places and 31/32 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 164 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 167 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 3598 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 1292 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 110 steps, run visited all 1 properties in 6 ms. (steps per millisecond=18 )
Probabilistic random walk after 110 steps, saw 65 distinct states, run finished after 6 ms. (steps per millisecond=18 ) properties seen :1
Knowledge obtained : [p0, true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 165 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 169 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 165 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 177 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 36344 reset in 74 ms.
Product exploration explored 100000 steps with 36333 reset in 83 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 205 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 32/32 transitions.
Graph (complete) has 63 edges and 32 vertex of which 30 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 30 transition count 31
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 9 places in 1 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 10 place count 30 transition count 33
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 29 transition count 32
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 29 transition count 32
Deduced a syphon composed of 9 places in 0 ms
Applied a total of 12 rules in 3 ms. Remains 29 /32 variables (removed 3) and now considering 32/32 (removed 0) transitions.
[2023-03-11 02:14:30] [INFO ] Redundant transitions in 25 ms returned []
// Phase 1: matrix 32 rows 29 cols
[2023-03-11 02:14:30] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-11 02:14:30] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 29/32 places, 32/32 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 76 ms. Remains : 29/32 places, 32/32 transitions.
Support contains 2 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 32 cols
[2023-03-11 02:14:30] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-11 02:14:30] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-11 02:14:30] [INFO ] Invariant cache hit.
[2023-03-11 02:14:30] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
[2023-03-11 02:14:30] [INFO ] Invariant cache hit.
[2023-03-11 02:14:30] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 160 ms. Remains : 32/32 places, 32/32 transitions.
Treatment of property BusinessProcesses-PT-02-LTLCardinality-09 finished in 3638 ms.
[2023-03-11 02:14:30] [INFO ] Flatten gal took : 17 ms
[2023-03-11 02:14:30] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-11 02:14:30] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 198 places, 163 transitions and 459 arcs took 3 ms.
Total runtime 17074 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT BusinessProcesses-PT-02
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/375
LTLCardinality

FORMULA BusinessProcesses-PT-02-LTLCardinality-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678500871015

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

+ 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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/375/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/375/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/375/LTLCardinality.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 1 (type EXCL) for 0 BusinessProcesses-PT-02-LTLCardinality-09
lola: time limit : 3599 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for BusinessProcesses-PT-02-LTLCardinality-09
lola: result : true
lola: markings : 9
lola: fired transitions : 9
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BusinessProcesses-PT-02-LTLCardinality-09: LTL true LTL model checker


Time elapsed: 1 secs. Pages in use: 1

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="BusinessProcesses-PT-02"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="lolaxred"
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-5348"
echo " Executing tool lolaxred"
echo " Input is BusinessProcesses-PT-02, 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 r039-tajo-167813692600459"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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