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-167813692700555.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-14, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r039-tajo-167813692700555
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 656K
-rw-r--r-- 1 mcc users 6.9K Feb 25 16:43 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Feb 25 16:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 16:42 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 25 16:42 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:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 15:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Feb 25 16:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 192K Feb 25 16:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 25 16:43 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 25 16:43 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:39 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 156K 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-14-LTLCardinality-00
FORMULA_NAME BusinessProcesses-PT-14-LTLCardinality-01
FORMULA_NAME BusinessProcesses-PT-14-LTLCardinality-02
FORMULA_NAME BusinessProcesses-PT-14-LTLCardinality-03
FORMULA_NAME BusinessProcesses-PT-14-LTLCardinality-04
FORMULA_NAME BusinessProcesses-PT-14-LTLCardinality-05
FORMULA_NAME BusinessProcesses-PT-14-LTLCardinality-06
FORMULA_NAME BusinessProcesses-PT-14-LTLCardinality-07
FORMULA_NAME BusinessProcesses-PT-14-LTLCardinality-08
FORMULA_NAME BusinessProcesses-PT-14-LTLCardinality-09
FORMULA_NAME BusinessProcesses-PT-14-LTLCardinality-10
FORMULA_NAME BusinessProcesses-PT-14-LTLCardinality-11
FORMULA_NAME BusinessProcesses-PT-14-LTLCardinality-12
FORMULA_NAME BusinessProcesses-PT-14-LTLCardinality-13
FORMULA_NAME BusinessProcesses-PT-14-LTLCardinality-14
FORMULA_NAME BusinessProcesses-PT-14-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678503267527

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-14
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-11 02:54:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-11 02:54:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 02:54:29] [INFO ] Load time of PNML (sax parser for PT used): 60 ms
[2023-03-11 02:54:29] [INFO ] Transformed 624 places.
[2023-03-11 02:54:29] [INFO ] Transformed 564 transitions.
[2023-03-11 02:54:29] [INFO ] Found NUPN structural information;
[2023-03-11 02:54:29] [INFO ] Parsed PT model containing 624 places and 564 transitions and 1657 arcs in 125 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 8 places in 9 ms
Reduce places removed 8 places and 8 transitions.
Initial state reduction rules removed 2 formulas.
FORMULA BusinessProcesses-PT-14-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-14-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-14-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-14-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-14-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-14-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-14-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 27 out of 616 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 616/616 places, 556/556 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 611 transition count 556
Discarding 90 places :
Symmetric choice reduction at 1 with 90 rule applications. Total rules 95 place count 521 transition count 466
Iterating global reduction 1 with 90 rules applied. Total rules applied 185 place count 521 transition count 466
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 227 place count 479 transition count 424
Iterating global reduction 1 with 42 rules applied. Total rules applied 269 place count 479 transition count 424
Applied a total of 269 rules in 107 ms. Remains 479 /616 variables (removed 137) and now considering 424/556 (removed 132) transitions.
// Phase 1: matrix 424 rows 479 cols
[2023-03-11 02:54:29] [INFO ] Computed 94 place invariants in 29 ms
[2023-03-11 02:54:29] [INFO ] Implicit Places using invariants in 312 ms returned []
[2023-03-11 02:54:29] [INFO ] Invariant cache hit.
[2023-03-11 02:54:30] [INFO ] Implicit Places using invariants and state equation in 440 ms returned []
Implicit Place search using SMT with State Equation took 778 ms to find 0 implicit places.
[2023-03-11 02:54:30] [INFO ] Invariant cache hit.
[2023-03-11 02:54:30] [INFO ] Dead Transitions using invariants and state equation in 219 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 479/616 places, 424/556 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1109 ms. Remains : 479/616 places, 424/556 transitions.
Support contains 27 out of 479 places after structural reductions.
[2023-03-11 02:54:30] [INFO ] Flatten gal took : 54 ms
[2023-03-11 02:54:30] [INFO ] Flatten gal took : 26 ms
[2023-03-11 02:54:30] [INFO ] Input system was already deterministic with 424 transitions.
Incomplete random walk after 10000 steps, including 68 resets, run finished after 356 ms. (steps per millisecond=28 ) properties (out of 20) seen :10
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 10 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
[2023-03-11 02:54:31] [INFO ] Invariant cache hit.
[2023-03-11 02:54:32] [INFO ] [Real]Absence check using 55 positive place invariants in 17 ms returned sat
[2023-03-11 02:54:32] [INFO ] [Real]Absence check using 55 positive and 39 generalized place invariants in 14 ms returned sat
[2023-03-11 02:54:32] [INFO ] After 346ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-11 02:54:32] [INFO ] [Nat]Absence check using 55 positive place invariants in 17 ms returned sat
[2023-03-11 02:54:32] [INFO ] [Nat]Absence check using 55 positive and 39 generalized place invariants in 18 ms returned sat
[2023-03-11 02:54:32] [INFO ] After 361ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-11 02:54:33] [INFO ] Deduced a trap composed of 8 places in 164 ms of which 5 ms to minimize.
[2023-03-11 02:54:33] [INFO ] Deduced a trap composed of 89 places in 140 ms of which 1 ms to minimize.
[2023-03-11 02:54:33] [INFO ] Deduced a trap composed of 15 places in 119 ms of which 2 ms to minimize.
[2023-03-11 02:54:33] [INFO ] Deduced a trap composed of 18 places in 133 ms of which 2 ms to minimize.
[2023-03-11 02:54:33] [INFO ] Deduced a trap composed of 80 places in 141 ms of which 1 ms to minimize.
[2023-03-11 02:54:33] [INFO ] Deduced a trap composed of 81 places in 122 ms of which 1 ms to minimize.
[2023-03-11 02:54:33] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 1 ms to minimize.
[2023-03-11 02:54:33] [INFO ] Deduced a trap composed of 25 places in 59 ms of which 1 ms to minimize.
[2023-03-11 02:54:34] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 0 ms to minimize.
[2023-03-11 02:54:34] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 0 ms to minimize.
[2023-03-11 02:54:34] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1325 ms
[2023-03-11 02:54:34] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 0 ms to minimize.
[2023-03-11 02:54:34] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 1 ms to minimize.
[2023-03-11 02:54:34] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 0 ms to minimize.
[2023-03-11 02:54:34] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 223 ms
[2023-03-11 02:54:34] [INFO ] Deduced a trap composed of 27 places in 90 ms of which 1 ms to minimize.
[2023-03-11 02:54:34] [INFO ] Deduced a trap composed of 32 places in 85 ms of which 1 ms to minimize.
[2023-03-11 02:54:34] [INFO ] Deduced a trap composed of 21 places in 75 ms of which 1 ms to minimize.
[2023-03-11 02:54:34] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 1 ms to minimize.
[2023-03-11 02:54:35] [INFO ] Deduced a trap composed of 26 places in 69 ms of which 0 ms to minimize.
[2023-03-11 02:54:35] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 532 ms
[2023-03-11 02:54:35] [INFO ] Deduced a trap composed of 34 places in 65 ms of which 0 ms to minimize.
[2023-03-11 02:54:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 114 ms
[2023-03-11 02:54:35] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 1 ms to minimize.
[2023-03-11 02:54:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 111 ms
[2023-03-11 02:54:35] [INFO ] After 2904ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 198 ms.
[2023-03-11 02:54:35] [INFO ] After 3364ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Parikh walk visited 0 properties in 119 ms.
Support contains 15 out of 479 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 479/479 places, 424/424 transitions.
Graph (trivial) has 210 edges and 479 vertex of which 6 / 479 are part of one of the 1 SCC in 3 ms
Free SCC test removed 5 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1081 edges and 474 vertex of which 473 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 48 place count 473 transition count 370
Reduce places removed 46 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 48 rules applied. Total rules applied 96 place count 427 transition count 368
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 98 place count 425 transition count 368
Performed 92 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 92 Pre rules applied. Total rules applied 98 place count 425 transition count 276
Deduced a syphon composed of 92 places in 1 ms
Ensure Unique test removed 16 places
Reduce places removed 108 places and 0 transitions.
Iterating global reduction 3 with 200 rules applied. Total rules applied 298 place count 317 transition count 276
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 301 place count 314 transition count 273
Iterating global reduction 3 with 3 rules applied. Total rules applied 304 place count 314 transition count 273
Performed 126 Post agglomeration using F-continuation condition.Transition count delta: 126
Deduced a syphon composed of 126 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 129 places and 0 transitions.
Iterating global reduction 3 with 255 rules applied. Total rules applied 559 place count 185 transition count 147
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 561 place count 184 transition count 151
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 563 place count 184 transition count 149
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 565 place count 182 transition count 149
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 566 place count 181 transition count 148
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 567 place count 180 transition count 148
Applied a total of 567 rules in 112 ms. Remains 180 /479 variables (removed 299) and now considering 148/424 (removed 276) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 112 ms. Remains : 180/479 places, 148/424 transitions.
Incomplete random walk after 10000 steps, including 351 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 9) seen :8
Finished Best-First random walk after 817 steps, including 13 resets, run visited all 1 properties in 3 ms. (steps per millisecond=272 )
Computed a total of 129 stabilizing places and 122 stable transitions
Graph (complete) has 1088 edges and 479 vertex of which 478 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.27 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' '!(G(F((p0||G(p1)))))'
Support contains 3 out of 479 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 479/479 places, 424/424 transitions.
Graph (trivial) has 224 edges and 479 vertex of which 6 / 479 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 1082 edges and 474 vertex of which 473 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 51 place count 472 transition count 367
Reduce places removed 49 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 50 rules applied. Total rules applied 101 place count 423 transition count 366
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 102 place count 422 transition count 366
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 100 Pre rules applied. Total rules applied 102 place count 422 transition count 266
Deduced a syphon composed of 100 places in 1 ms
Ensure Unique test removed 17 places
Reduce places removed 117 places and 0 transitions.
Iterating global reduction 3 with 217 rules applied. Total rules applied 319 place count 305 transition count 266
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 328 place count 296 transition count 257
Iterating global reduction 3 with 9 rules applied. Total rules applied 337 place count 296 transition count 257
Performed 123 Post agglomeration using F-continuation condition.Transition count delta: 123
Deduced a syphon composed of 123 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 3 with 251 rules applied. Total rules applied 588 place count 168 transition count 134
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 590 place count 167 transition count 138
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 591 place count 166 transition count 137
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 592 place count 165 transition count 137
Applied a total of 592 rules in 102 ms. Remains 165 /479 variables (removed 314) and now considering 137/424 (removed 287) transitions.
// Phase 1: matrix 137 rows 165 cols
[2023-03-11 02:54:36] [INFO ] Computed 71 place invariants in 11 ms
[2023-03-11 02:54:36] [INFO ] Implicit Places using invariants in 133 ms returned [16, 17, 21, 22, 23, 24, 25, 26, 49, 50, 51, 52]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 136 ms to find 12 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 153/479 places, 137/424 transitions.
Applied a total of 0 rules in 10 ms. Remains 153 /153 variables (removed 0) and now considering 137/137 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 250 ms. Remains : 153/479 places, 137/424 transitions.
Stuttering acceptance computed with spot in 293 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-14-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (EQ s13 0) (EQ s147 1)), p0:(AND (EQ s8 1) (OR (EQ s13 0) (EQ s147 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 36 steps with 7 reset in 2 ms.
FORMULA BusinessProcesses-PT-14-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-14-LTLCardinality-00 finished in 627 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 1 out of 479 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 479/479 places, 424/424 transitions.
Graph (trivial) has 226 edges and 479 vertex of which 6 / 479 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 1082 edges and 474 vertex of which 473 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 52 place count 472 transition count 366
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 1 with 50 rules applied. Total rules applied 102 place count 422 transition count 366
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 101 Pre rules applied. Total rules applied 102 place count 422 transition count 265
Deduced a syphon composed of 101 places in 0 ms
Ensure Unique test removed 17 places
Reduce places removed 118 places and 0 transitions.
Iterating global reduction 2 with 219 rules applied. Total rules applied 321 place count 304 transition count 265
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 330 place count 295 transition count 256
Iterating global reduction 2 with 9 rules applied. Total rules applied 339 place count 295 transition count 256
Performed 125 Post agglomeration using F-continuation condition.Transition count delta: 125
Deduced a syphon composed of 125 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 130 places and 0 transitions.
Iterating global reduction 2 with 255 rules applied. Total rules applied 594 place count 165 transition count 131
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
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 596 place count 164 transition count 135
Applied a total of 596 rules in 48 ms. Remains 164 /479 variables (removed 315) and now considering 135/424 (removed 289) transitions.
// Phase 1: matrix 135 rows 164 cols
[2023-03-11 02:54:36] [INFO ] Computed 72 place invariants in 2 ms
[2023-03-11 02:54:37] [INFO ] Implicit Places using invariants in 208 ms returned [1, 2, 3, 6, 7, 8, 15, 16, 20, 21, 22, 23, 24, 25, 48, 49, 50, 51, 52]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 209 ms to find 19 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 145/479 places, 135/424 transitions.
Applied a total of 0 rules in 7 ms. Remains 145 /145 variables (removed 0) and now considering 135/135 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 264 ms. Remains : 145/479 places, 135/424 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-14-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s2 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-14-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-14-LTLCardinality-03 finished in 320 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 479 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 479/479 places, 424/424 transitions.
Graph (trivial) has 226 edges and 479 vertex of which 6 / 479 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 1082 edges and 474 vertex of which 473 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 52 place count 472 transition count 366
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 1 with 50 rules applied. Total rules applied 102 place count 422 transition count 366
Performed 102 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 102 Pre rules applied. Total rules applied 102 place count 422 transition count 264
Deduced a syphon composed of 102 places in 0 ms
Ensure Unique test removed 17 places
Reduce places removed 119 places and 0 transitions.
Iterating global reduction 2 with 221 rules applied. Total rules applied 323 place count 303 transition count 264
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 333 place count 293 transition count 254
Iterating global reduction 2 with 10 rules applied. Total rules applied 343 place count 293 transition count 254
Performed 123 Post agglomeration using F-continuation condition.Transition count delta: 123
Deduced a syphon composed of 123 places in 1 ms
Ensure Unique test removed 4 places
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 2 with 250 rules applied. Total rules applied 593 place count 166 transition count 131
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
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 595 place count 165 transition count 135
Applied a total of 595 rules in 38 ms. Remains 165 /479 variables (removed 314) and now considering 135/424 (removed 289) transitions.
// Phase 1: matrix 135 rows 165 cols
[2023-03-11 02:54:37] [INFO ] Computed 73 place invariants in 2 ms
[2023-03-11 02:54:37] [INFO ] Implicit Places using invariants in 168 ms returned [1, 2, 3, 6, 7, 8, 9, 16, 17, 21, 22, 23, 24, 25, 26, 49, 50, 51, 52, 53, 122]
Discarding 21 places :
Implicit Place search using SMT only with invariants took 169 ms to find 21 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 144/479 places, 135/424 transitions.
Applied a total of 0 rules in 9 ms. Remains 144 /144 variables (removed 0) and now considering 135/135 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 216 ms. Remains : 144/479 places, 135/424 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-14-LTLCardinality-04 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 s2 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-14-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-14-LTLCardinality-04 finished in 272 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 2 out of 479 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 479/479 places, 424/424 transitions.
Graph (trivial) has 225 edges and 479 vertex of which 6 / 479 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 1082 edges and 474 vertex of which 473 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 52 place count 472 transition count 366
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 1 with 50 rules applied. Total rules applied 102 place count 422 transition count 366
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 102 place count 422 transition count 266
Deduced a syphon composed of 100 places in 3 ms
Ensure Unique test removed 17 places
Reduce places removed 117 places and 0 transitions.
Iterating global reduction 2 with 217 rules applied. Total rules applied 319 place count 305 transition count 266
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 328 place count 296 transition count 257
Iterating global reduction 2 with 9 rules applied. Total rules applied 337 place count 296 transition count 257
Performed 125 Post agglomeration using F-continuation condition.Transition count delta: 125
Deduced a syphon composed of 125 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 130 places and 0 transitions.
Iterating global reduction 2 with 255 rules applied. Total rules applied 592 place count 166 transition count 132
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
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 594 place count 165 transition count 136
Applied a total of 594 rules in 66 ms. Remains 165 /479 variables (removed 314) and now considering 136/424 (removed 288) transitions.
// Phase 1: matrix 136 rows 165 cols
[2023-03-11 02:54:37] [INFO ] Computed 72 place invariants in 3 ms
[2023-03-11 02:54:37] [INFO ] Implicit Places using invariants in 203 ms returned [1, 2, 3, 4, 5, 6, 7, 14, 15, 19, 20, 21, 22, 23, 24, 48, 49, 50, 51, 52]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 207 ms to find 20 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 145/479 places, 136/424 transitions.
Applied a total of 0 rules in 6 ms. Remains 145 /145 variables (removed 0) and now considering 136/136 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 280 ms. Remains : 145/479 places, 136/424 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-14-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s25 0) (EQ s100 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 21883 reset in 466 ms.
Product exploration explored 100000 steps with 21865 reset in 330 ms.
Computed a total of 13 stabilizing places and 11 stable transitions
Computed a total of 13 stabilizing places and 11 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 204 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 55 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2478 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 771 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Finished probabilistic random walk after 3162 steps, run visited all 1 properties in 66 ms. (steps per millisecond=47 )
Probabilistic random walk after 3162 steps, saw 970 distinct states, run finished after 66 ms. (steps per millisecond=47 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 264 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0)]
Support contains 2 out of 145 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 145/145 places, 136/136 transitions.
Applied a total of 0 rules in 6 ms. Remains 145 /145 variables (removed 0) and now considering 136/136 (removed 0) transitions.
// Phase 1: matrix 136 rows 145 cols
[2023-03-11 02:54:39] [INFO ] Computed 52 place invariants in 5 ms
[2023-03-11 02:54:39] [INFO ] Implicit Places using invariants in 142 ms returned []
[2023-03-11 02:54:39] [INFO ] Invariant cache hit.
[2023-03-11 02:54:39] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-11 02:54:39] [INFO ] Implicit Places using invariants and state equation in 212 ms returned [1, 3, 7, 10, 34, 36, 38, 39, 40, 42, 44, 46, 48, 50, 52, 54, 56, 58, 60, 64, 66, 68, 70, 72, 74, 76, 78, 86, 88, 90, 92, 94]
Discarding 32 places :
Implicit Place search using SMT with State Equation took 358 ms to find 32 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 113/145 places, 136/136 transitions.
Graph (complete) has 371 edges and 113 vertex of which 104 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.0 ms
Discarding 9 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 104 transition count 123
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 19 place count 95 transition count 123
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 31 place count 83 transition count 88
Iterating global reduction 2 with 12 rules applied. Total rules applied 43 place count 83 transition count 88
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 3 rules applied. Total rules applied 46 place count 83 transition count 85
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 49 place count 80 transition count 85
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 50 place count 79 transition count 84
Iterating global reduction 4 with 1 rules applied. Total rules applied 51 place count 79 transition count 84
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 15 rules applied. Total rules applied 66 place count 71 transition count 77
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 4 with 2 rules applied. Total rules applied 68 place count 70 transition count 76
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 69 place count 70 transition count 76
Applied a total of 69 rules in 17 ms. Remains 70 /113 variables (removed 43) and now considering 76/136 (removed 60) transitions.
// Phase 1: matrix 76 rows 70 cols
[2023-03-11 02:54:39] [INFO ] Computed 16 place invariants in 1 ms
[2023-03-11 02:54:39] [INFO ] Implicit Places using invariants in 76 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 79 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 69/145 places, 76/136 transitions.
Applied a total of 0 rules in 2 ms. Remains 69 /69 variables (removed 0) and now considering 76/76 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 462 ms. Remains : 69/145 places, 76/136 transitions.
Computed a total of 4 stabilizing places and 5 stable transitions
Graph (complete) has 239 edges and 69 vertex of which 66 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Computed a total of 4 stabilizing places and 5 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 91 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2575 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 781 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Finished probabilistic random walk after 580 steps, run visited all 1 properties in 42 ms. (steps per millisecond=13 )
Probabilistic random walk after 580 steps, saw 234 distinct states, run finished after 43 ms. (steps per millisecond=13 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 199 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Product exploration explored 100000 steps with 22269 reset in 183 ms.
Stuttering criterion allowed to conclude after 47873 steps with 10610 reset in 86 ms.
FORMULA BusinessProcesses-PT-14-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-14-LTLCardinality-06 finished in 3283 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' '!(G(F((X((!p1 U ((p2 U (p3||G(p2)))||G(!p1))))&&p0))))'
Support contains 4 out of 479 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 479/479 places, 424/424 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 470 transition count 415
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 470 transition count 415
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 467 transition count 412
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 467 transition count 412
Applied a total of 24 rules in 60 ms. Remains 467 /479 variables (removed 12) and now considering 412/424 (removed 12) transitions.
// Phase 1: matrix 412 rows 467 cols
[2023-03-11 02:54:40] [INFO ] Computed 94 place invariants in 5 ms
[2023-03-11 02:54:41] [INFO ] Implicit Places using invariants in 242 ms returned []
[2023-03-11 02:54:41] [INFO ] Invariant cache hit.
[2023-03-11 02:54:41] [INFO ] Implicit Places using invariants and state equation in 518 ms returned []
Implicit Place search using SMT with State Equation took 764 ms to find 0 implicit places.
[2023-03-11 02:54:41] [INFO ] Invariant cache hit.
[2023-03-11 02:54:41] [INFO ] Dead Transitions using invariants and state equation in 208 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 467/479 places, 412/424 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1034 ms. Remains : 467/479 places, 412/424 transitions.
Stuttering acceptance computed with spot in 220 ms :[(OR (NOT p0) (AND p1 (NOT p2) (NOT p3))), (OR (NOT p0) (AND p1 (NOT p2) (NOT p3))), (AND p1 (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND p1 (NOT p2) (NOT p3)))]
Running random walk in product with property : BusinessProcesses-PT-14-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0, 1} source=1 dest: 1}, { cond=p0, acceptance={0, 1} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p2) p1), acceptance={0, 1} source=2 dest: 1}, { cond=(AND (NOT p3) p2 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p3) p2 p1), acceptance={1} source=2 dest: 2}, { cond=(AND p0 (NOT p3) (NOT p2) p1), acceptance={0, 1} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p3) p2 p1), acceptance={1} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={0, 1} source=3 dest: 1}, { cond=(AND p0 (NOT p3) p2), acceptance={1} source=3 dest: 2}, { cond=(AND p0 (NOT p3) (NOT p2)), acceptance={0, 1} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p3) p2), acceptance={1} source=3 dest: 3}]], initial=0, aps=[p0:(AND (NEQ s361 0) (NEQ s384 1)), p3:(AND (NEQ s359 1) (NEQ s231 1)), p2:(NEQ s231 1), p1:(OR (EQ s361 0) (EQ s384 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 3615 reset in 368 ms.
Stack based approach found an accepted trace after 240 steps with 7 reset with depth 8 and stack size 8 in 1 ms.
FORMULA BusinessProcesses-PT-14-LTLCardinality-08 FALSE TECHNIQUES STACK_TEST
Treatment of property BusinessProcesses-PT-14-LTLCardinality-08 finished in 1661 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((G((p0&&(p1||G(p2))))||(p0&&X(p3)))))'
Support contains 3 out of 479 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 479/479 places, 424/424 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 471 transition count 416
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 471 transition count 416
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 470 transition count 415
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 470 transition count 415
Applied a total of 18 rules in 46 ms. Remains 470 /479 variables (removed 9) and now considering 415/424 (removed 9) transitions.
// Phase 1: matrix 415 rows 470 cols
[2023-03-11 02:54:42] [INFO ] Computed 94 place invariants in 7 ms
[2023-03-11 02:54:42] [INFO ] Implicit Places using invariants in 241 ms returned []
[2023-03-11 02:54:42] [INFO ] Invariant cache hit.
[2023-03-11 02:54:43] [INFO ] Implicit Places using invariants and state equation in 605 ms returned []
Implicit Place search using SMT with State Equation took 848 ms to find 0 implicit places.
[2023-03-11 02:54:43] [INFO ] Invariant cache hit.
[2023-03-11 02:54:43] [INFO ] Dead Transitions using invariants and state equation in 238 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 470/479 places, 415/424 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1146 ms. Remains : 470/479 places, 415/424 transitions.
Stuttering acceptance computed with spot in 255 ms :[true, (NOT p3), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (NOT p2) (NOT p0)), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : BusinessProcesses-PT-14-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p3), acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=3 dest: 4}, { cond=(AND p0 p1), acceptance={} source=3 dest: 5}], [{ cond=(OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3))), acceptance={} source=4 dest: 0}, { cond=(AND p0 p2 (NOT p3)), acceptance={} source=4 dest: 6}], [{ cond=(OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3))), acceptance={} source=5 dest: 0}, { cond=(AND p0 (NOT p1) p2 (NOT p3)), acceptance={} source=5 dest: 6}, { cond=(AND p0 p1 (NOT p3)), acceptance={} source=5 dest: 7}], [{ cond=(OR (NOT p0) (NOT p2)), acceptance={} source=6 dest: 0}, { cond=(AND p0 p2), acceptance={} source=6 dest: 6}], [{ cond=(OR (NOT p0) (AND (NOT p1) (NOT p2))), acceptance={} source=7 dest: 0}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=7 dest: 6}, { cond=(AND p0 p1), acceptance={} source=7 dest: 7}]], initial=2, aps=[p3:(EQ s19 0), p0:(EQ s398 1), p1:(EQ s389 1), p2:(EQ s19 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, 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-14-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-14-LTLCardinality-10 finished in 1442 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||G((F(p0)&&(p1||X(G(p1))))))))'
Support contains 1 out of 479 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 479/479 places, 424/424 transitions.
Graph (trivial) has 225 edges and 479 vertex of which 6 / 479 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1082 edges and 474 vertex of which 473 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 51 place count 472 transition count 367
Reduce places removed 49 places and 0 transitions.
Iterating post reduction 1 with 49 rules applied. Total rules applied 100 place count 423 transition count 367
Performed 102 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 102 Pre rules applied. Total rules applied 100 place count 423 transition count 265
Deduced a syphon composed of 102 places in 0 ms
Ensure Unique test removed 17 places
Reduce places removed 119 places and 0 transitions.
Iterating global reduction 2 with 221 rules applied. Total rules applied 321 place count 304 transition count 265
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 331 place count 294 transition count 255
Iterating global reduction 2 with 10 rules applied. Total rules applied 341 place count 294 transition count 255
Performed 122 Post agglomeration using F-continuation condition.Transition count delta: 122
Deduced a syphon composed of 122 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 2 with 249 rules applied. Total rules applied 590 place count 167 transition count 133
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
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 592 place count 166 transition count 137
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 593 place count 165 transition count 136
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 594 place count 164 transition count 136
Applied a total of 594 rules in 63 ms. Remains 164 /479 variables (removed 315) and now considering 136/424 (removed 288) transitions.
// Phase 1: matrix 136 rows 164 cols
[2023-03-11 02:54:43] [INFO ] Computed 71 place invariants in 1 ms
[2023-03-11 02:54:44] [INFO ] Implicit Places using invariants in 172 ms returned [22, 23, 24, 25, 48, 49, 50, 51]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 174 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 156/479 places, 136/424 transitions.
Applied a total of 0 rules in 6 ms. Remains 156 /156 variables (removed 0) and now considering 136/136 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 243 ms. Remains : 156/479 places, 136/424 transitions.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-14-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s103 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 1 ms.
FORMULA BusinessProcesses-PT-14-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-14-LTLCardinality-13 finished in 312 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)&&X((X(p1)&&F(p2)))))'
Support contains 8 out of 479 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 479/479 places, 424/424 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 472 transition count 417
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 472 transition count 417
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 469 transition count 414
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 469 transition count 414
Applied a total of 20 rules in 42 ms. Remains 469 /479 variables (removed 10) and now considering 414/424 (removed 10) transitions.
// Phase 1: matrix 414 rows 469 cols
[2023-03-11 02:54:44] [INFO ] Computed 94 place invariants in 2 ms
[2023-03-11 02:54:44] [INFO ] Implicit Places using invariants in 184 ms returned []
[2023-03-11 02:54:44] [INFO ] Invariant cache hit.
[2023-03-11 02:54:44] [INFO ] Implicit Places using invariants and state equation in 491 ms returned []
Implicit Place search using SMT with State Equation took 685 ms to find 0 implicit places.
[2023-03-11 02:54:44] [INFO ] Invariant cache hit.
[2023-03-11 02:54:45] [INFO ] Dead Transitions using invariants and state equation in 205 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 469/479 places, 414/424 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 934 ms. Remains : 469/479 places, 414/424 transitions.
Stuttering acceptance computed with spot in 198 ms :[(OR (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2), true]
Running random walk in product with property : BusinessProcesses-PT-14-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}, { cond=(NOT p2), acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={} source=3 dest: 5}], [{ cond=(NOT p2), acceptance={} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(OR (EQ s148 0) (EQ s298 1)), p2:(AND (EQ s308 0) (EQ s366 1) (EQ s43 0) (EQ s257 1)), p1:(OR (EQ s412 0) (EQ s49 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, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 141 steps with 2 reset in 0 ms.
FORMULA BusinessProcesses-PT-14-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-14-LTLCardinality-14 finished in 1163 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(p0) U G((p1 U p0))))))'
Support contains 4 out of 479 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 479/479 places, 424/424 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 470 transition count 415
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 470 transition count 415
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 468 transition count 413
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 468 transition count 413
Applied a total of 22 rules in 22 ms. Remains 468 /479 variables (removed 11) and now considering 413/424 (removed 11) transitions.
// Phase 1: matrix 413 rows 468 cols
[2023-03-11 02:54:45] [INFO ] Computed 94 place invariants in 3 ms
[2023-03-11 02:54:45] [INFO ] Implicit Places using invariants in 223 ms returned []
[2023-03-11 02:54:45] [INFO ] Invariant cache hit.
[2023-03-11 02:54:46] [INFO ] Implicit Places using invariants and state equation in 493 ms returned []
Implicit Place search using SMT with State Equation took 727 ms to find 0 implicit places.
[2023-03-11 02:54:46] [INFO ] Invariant cache hit.
[2023-03-11 02:54:46] [INFO ] Dead Transitions using invariants and state equation in 243 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 468/479 places, 413/424 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 992 ms. Remains : 468/479 places, 413/424 transitions.
Stuttering acceptance computed with spot in 169 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), true]
Running random walk in product with property : BusinessProcesses-PT-14-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 4}, { cond=p0, acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(OR (EQ s387 0) (EQ s156 1)), p1:(OR (EQ s104 0) (EQ s443 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 20092 reset in 326 ms.
Product exploration explored 100000 steps with 19957 reset in 286 ms.
Computed a total of 123 stabilizing places and 116 stable transitions
Graph (complete) has 1071 edges and 468 vertex of which 467 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Computed a total of 123 stabilizing places and 116 stable transitions
Knowledge obtained : [(AND p0 p1), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (OR p0 p1))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 244 ms. Reduced automaton from 7 states, 12 edges and 2 AP (stutter sensitive) to 7 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 195 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), true]
Incomplete random walk after 10000 steps, including 67 resets, run finished after 178 ms. (steps per millisecond=56 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 855840 steps, run timeout after 3001 ms. (steps per millisecond=285 ) properties seen :{2=1, 3=1}
Probabilistic random walk after 855840 steps, saw 131510 distinct states, run finished after 3003 ms. (steps per millisecond=284 ) properties seen :2
Running SMT prover for 2 properties.
[2023-03-11 02:54:50] [INFO ] Invariant cache hit.
[2023-03-11 02:54:50] [INFO ] After 75ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 02:54:50] [INFO ] [Nat]Absence check using 55 positive place invariants in 12 ms returned sat
[2023-03-11 02:54:50] [INFO ] [Nat]Absence check using 55 positive and 39 generalized place invariants in 11 ms returned sat
[2023-03-11 02:54:51] [INFO ] After 139ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 02:54:51] [INFO ] Deduced a trap composed of 15 places in 129 ms of which 0 ms to minimize.
[2023-03-11 02:54:51] [INFO ] Deduced a trap composed of 82 places in 108 ms of which 0 ms to minimize.
[2023-03-11 02:54:51] [INFO ] Deduced a trap composed of 82 places in 104 ms of which 1 ms to minimize.
[2023-03-11 02:54:51] [INFO ] Deduced a trap composed of 88 places in 100 ms of which 0 ms to minimize.
[2023-03-11 02:54:51] [INFO ] Deduced a trap composed of 86 places in 106 ms of which 1 ms to minimize.
[2023-03-11 02:54:51] [INFO ] Deduced a trap composed of 75 places in 104 ms of which 1 ms to minimize.
[2023-03-11 02:54:52] [INFO ] Deduced a trap composed of 78 places in 102 ms of which 0 ms to minimize.
[2023-03-11 02:54:52] [INFO ] Deduced a trap composed of 18 places in 103 ms of which 1 ms to minimize.
[2023-03-11 02:54:52] [INFO ] Deduced a trap composed of 83 places in 98 ms of which 0 ms to minimize.
[2023-03-11 02:54:52] [INFO ] Deduced a trap composed of 80 places in 101 ms of which 1 ms to minimize.
[2023-03-11 02:54:52] [INFO ] Deduced a trap composed of 86 places in 93 ms of which 0 ms to minimize.
[2023-03-11 02:54:52] [INFO ] Deduced a trap composed of 79 places in 93 ms of which 1 ms to minimize.
[2023-03-11 02:54:52] [INFO ] Deduced a trap composed of 91 places in 96 ms of which 4 ms to minimize.
[2023-03-11 02:54:52] [INFO ] Deduced a trap composed of 95 places in 91 ms of which 0 ms to minimize.
[2023-03-11 02:54:52] [INFO ] Deduced a trap composed of 86 places in 92 ms of which 0 ms to minimize.
[2023-03-11 02:54:52] [INFO ] Deduced a trap composed of 86 places in 79 ms of which 0 ms to minimize.
[2023-03-11 02:54:53] [INFO ] Deduced a trap composed of 81 places in 90 ms of which 0 ms to minimize.
[2023-03-11 02:54:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 17 trap constraints in 1986 ms
[2023-03-11 02:54:53] [INFO ] After 2152ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :0
[2023-03-11 02:54:53] [INFO ] After 2248ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (OR p0 p1))), (X (X p0)), (G (OR p1 p0)), (G (NOT (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F (NOT p0)), (F (AND p1 (NOT p0)))]
Knowledge based reduction with 7 factoid took 214 ms. Reduced automaton from 7 states, 12 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 48 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 468 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 468/468 places, 413/413 transitions.
Graph (trivial) has 211 edges and 468 vertex of which 6 / 468 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1065 edges and 463 vertex of which 462 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 48 place count 461 transition count 359
Reduce places removed 46 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 47 rules applied. Total rules applied 95 place count 415 transition count 358
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 96 place count 414 transition count 358
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 96 Pre rules applied. Total rules applied 96 place count 414 transition count 262
Deduced a syphon composed of 96 places in 1 ms
Ensure Unique test removed 17 places
Reduce places removed 113 places and 0 transitions.
Iterating global reduction 3 with 209 rules applied. Total rules applied 305 place count 301 transition count 262
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Deduced a syphon composed of 127 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 132 places and 0 transitions.
Iterating global reduction 3 with 259 rules applied. Total rules applied 564 place count 169 transition count 135
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 566 place count 168 transition count 139
Applied a total of 566 rules in 24 ms. Remains 168 /468 variables (removed 300) and now considering 139/413 (removed 274) transitions.
// Phase 1: matrix 139 rows 168 cols
[2023-03-11 02:54:53] [INFO ] Computed 72 place invariants in 1 ms
[2023-03-11 02:54:53] [INFO ] Implicit Places using invariants in 115 ms returned [1, 2, 3, 4, 5, 6, 7, 14, 15, 20, 21, 22, 23, 24, 25, 49, 50, 51, 52, 53]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 139 ms to find 20 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 148/468 places, 139/413 transitions.
Applied a total of 0 rules in 5 ms. Remains 148 /148 variables (removed 0) and now considering 139/139 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 168 ms. Remains : 148/468 places, 139/413 transitions.
Computed a total of 12 stabilizing places and 10 stable transitions
Computed a total of 12 stabilizing places and 10 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 113 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2485 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Finished Best-First random walk after 3415 steps, including 266 resets, run visited all 1 properties in 3 ms. (steps per millisecond=1138 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 80 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 21701 reset in 230 ms.
Product exploration explored 100000 steps with 21855 reset in 222 ms.
Support contains 2 out of 148 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 148/148 places, 139/139 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 148 transition count 137
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 146 transition count 137
Applied a total of 4 rules in 5 ms. Remains 146 /148 variables (removed 2) and now considering 137/139 (removed 2) transitions.
// Phase 1: matrix 137 rows 146 cols
[2023-03-11 02:54:54] [INFO ] Computed 52 place invariants in 1 ms
[2023-03-11 02:54:54] [INFO ] Implicit Places using invariants in 84 ms returned []
[2023-03-11 02:54:54] [INFO ] Invariant cache hit.
[2023-03-11 02:54:54] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-11 02:54:54] [INFO ] Implicit Places using invariants and state equation in 168 ms returned [1, 3, 7, 10, 34, 36, 38, 39, 40, 42, 44, 46, 48, 50, 52, 54, 56, 58, 60, 64, 66, 68, 70, 72, 74, 76, 78, 86, 88, 90, 92, 94]
Discarding 32 places :
Implicit Place search using SMT with State Equation took 267 ms to find 32 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 114/148 places, 137/139 transitions.
Graph (complete) has 372 edges and 114 vertex of which 106 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 106 transition count 124
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 19 place count 97 transition count 124
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 30 place count 86 transition count 93
Iterating global reduction 2 with 11 rules applied. Total rules applied 41 place count 86 transition count 93
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 3 rules applied. Total rules applied 44 place count 86 transition count 90
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 47 place count 83 transition count 90
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 48 place count 82 transition count 89
Iterating global reduction 4 with 1 rules applied. Total rules applied 49 place count 82 transition count 89
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 17 rules applied. Total rules applied 66 place count 73 transition count 81
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 4 with 2 rules applied. Total rules applied 68 place count 72 transition count 80
Applied a total of 68 rules in 10 ms. Remains 72 /114 variables (removed 42) and now considering 80/137 (removed 57) transitions.
// Phase 1: matrix 80 rows 72 cols
[2023-03-11 02:54:54] [INFO ] Computed 17 place invariants in 1 ms
[2023-03-11 02:54:54] [INFO ] Implicit Places using invariants in 75 ms returned []
[2023-03-11 02:54:54] [INFO ] Invariant cache hit.
[2023-03-11 02:54:54] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-11 02:54:55] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 72/148 places, 80/139 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 463 ms. Remains : 72/148 places, 80/139 transitions.
Treatment of property BusinessProcesses-PT-14-LTLCardinality-15 finished in 9818 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(p0) U G((p1 U p0))))))'
Found a Lengthening insensitive property : BusinessProcesses-PT-14-LTLCardinality-15
Stuttering acceptance computed with spot in 163 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), true]
Support contains 4 out of 479 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 479/479 places, 424/424 transitions.
Graph (trivial) has 222 edges and 479 vertex of which 6 / 479 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1082 edges and 474 vertex of which 473 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 50 place count 472 transition count 368
Reduce places removed 48 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 49 rules applied. Total rules applied 99 place count 424 transition count 367
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 100 place count 423 transition count 367
Performed 98 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 98 Pre rules applied. Total rules applied 100 place count 423 transition count 269
Deduced a syphon composed of 98 places in 1 ms
Ensure Unique test removed 17 places
Reduce places removed 115 places and 0 transitions.
Iterating global reduction 3 with 213 rules applied. Total rules applied 313 place count 308 transition count 269
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 322 place count 299 transition count 260
Iterating global reduction 3 with 9 rules applied. Total rules applied 331 place count 299 transition count 260
Performed 125 Post agglomeration using F-continuation condition.Transition count delta: 125
Deduced a syphon composed of 125 places in 1 ms
Ensure Unique test removed 5 places
Reduce places removed 130 places and 0 transitions.
Iterating global reduction 3 with 255 rules applied. Total rules applied 586 place count 169 transition count 135
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 588 place count 168 transition count 139
Applied a total of 588 rules in 25 ms. Remains 168 /479 variables (removed 311) and now considering 139/424 (removed 285) transitions.
// Phase 1: matrix 139 rows 168 cols
[2023-03-11 02:54:55] [INFO ] Computed 72 place invariants in 1 ms
[2023-03-11 02:54:55] [INFO ] Implicit Places using invariants in 288 ms returned [1, 2, 3, 4, 5, 6, 7, 14, 15, 20, 21, 22, 23, 24, 25, 49, 50, 51, 52, 53]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 290 ms to find 20 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 148/479 places, 139/424 transitions.
Applied a total of 0 rules in 2 ms. Remains 148 /148 variables (removed 0) and now considering 139/139 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 318 ms. Remains : 148/479 places, 139/424 transitions.
Running random walk in product with property : BusinessProcesses-PT-14-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 4}, { cond=p0, acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(OR (EQ s103 0) (EQ s16 1)), p1:(OR (EQ s9 0) (EQ s131 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 26362 reset in 211 ms.
Product exploration explored 100000 steps with 26370 reset in 195 ms.
Computed a total of 12 stabilizing places and 10 stable transitions
Computed a total of 12 stabilizing places and 10 stable transitions
Knowledge obtained : [(AND p0 p1), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (OR p0 p1))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 238 ms. Reduced automaton from 7 states, 12 edges and 2 AP (stutter sensitive) to 7 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 222 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), true]
Incomplete random walk after 10000 steps, including 2493 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10000 steps, including 767 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 766 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 139 rows 148 cols
[2023-03-11 02:54:56] [INFO ] Computed 52 place invariants in 1 ms
[2023-03-11 02:54:56] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 02:54:56] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-11 02:54:56] [INFO ] [Nat]Absence check using 36 positive and 16 generalized place invariants in 3 ms returned sat
[2023-03-11 02:54:56] [INFO ] After 52ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 02:54:56] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-11 02:54:56] [INFO ] After 18ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-11 02:54:56] [INFO ] Deduced a trap composed of 35 places in 43 ms of which 0 ms to minimize.
[2023-03-11 02:54:57] [INFO ] Deduced a trap composed of 36 places in 63 ms of which 1 ms to minimize.
[2023-03-11 02:54:57] [INFO ] Deduced a trap composed of 39 places in 53 ms of which 0 ms to minimize.
[2023-03-11 02:54:57] [INFO ] Deduced a trap composed of 39 places in 49 ms of which 1 ms to minimize.
[2023-03-11 02:54:57] [INFO ] Deduced a trap composed of 41 places in 43 ms of which 1 ms to minimize.
[2023-03-11 02:54:57] [INFO ] Deduced a trap composed of 41 places in 39 ms of which 1 ms to minimize.
[2023-03-11 02:54:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 6 trap constraints in 331 ms
[2023-03-11 02:54:57] [INFO ] After 355ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :0
[2023-03-11 02:54:57] [INFO ] After 461ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (OR p0 p1))), (X (X p0)), (G (OR p1 p0)), (G (NOT (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F (NOT p0)), (F (AND p1 (NOT p0)))]
Knowledge based reduction with 7 factoid took 260 ms. Reduced automaton from 7 states, 12 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 148 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 148/148 places, 139/139 transitions.
Applied a total of 0 rules in 2 ms. Remains 148 /148 variables (removed 0) and now considering 139/139 (removed 0) transitions.
[2023-03-11 02:54:57] [INFO ] Invariant cache hit.
[2023-03-11 02:54:57] [INFO ] Implicit Places using invariants in 72 ms returned []
[2023-03-11 02:54:57] [INFO ] Invariant cache hit.
[2023-03-11 02:54:57] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-11 02:54:57] [INFO ] Implicit Places using invariants and state equation in 155 ms returned [1, 3, 7, 11, 35, 37, 39, 40, 41, 43, 45, 47, 49, 51, 53, 55, 57, 59, 61, 65, 67, 69, 71, 73, 75, 77, 79, 87, 89, 91, 93, 95]
Discarding 32 places :
Implicit Place search using SMT with State Equation took 249 ms to find 32 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 116/148 places, 139/139 transitions.
Graph (complete) has 374 edges and 116 vertex of which 110 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 110 transition count 127
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 19 place count 101 transition count 127
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 30 place count 90 transition count 96
Iterating global reduction 2 with 11 rules applied. Total rules applied 41 place count 90 transition count 96
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 3 rules applied. Total rules applied 44 place count 90 transition count 93
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 47 place count 87 transition count 93
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 48 place count 86 transition count 92
Iterating global reduction 4 with 1 rules applied. Total rules applied 49 place count 86 transition count 92
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 17 rules applied. Total rules applied 66 place count 77 transition count 84
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 4 with 2 rules applied. Total rules applied 68 place count 76 transition count 83
Applied a total of 68 rules in 7 ms. Remains 76 /116 variables (removed 40) and now considering 83/139 (removed 56) transitions.
// Phase 1: matrix 83 rows 76 cols
[2023-03-11 02:54:57] [INFO ] Computed 18 place invariants in 1 ms
[2023-03-11 02:54:57] [INFO ] Implicit Places using invariants in 38 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 51 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 75/148 places, 83/139 transitions.
Applied a total of 0 rules in 2 ms. Remains 75 /75 variables (removed 0) and now considering 83/83 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 313 ms. Remains : 75/148 places, 83/139 transitions.
Computed a total of 4 stabilizing places and 5 stable transitions
Graph (complete) has 263 edges and 75 vertex of which 69 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Computed a total of 4 stabilizing places and 5 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 143 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Finished random walk after 2938 steps, including 742 resets, run visited all 1 properties in 3 ms. (steps per millisecond=979 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 101 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 45 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22421 reset in 74 ms.
Product exploration explored 100000 steps with 22343 reset in 78 ms.
Support contains 2 out of 75 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 75/75 places, 83/83 transitions.
Graph (complete) has 263 edges and 75 vertex of which 73 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 73 transition count 80
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 72 transition count 80
Applied a total of 3 rules in 2 ms. Remains 72 /75 variables (removed 3) and now considering 80/83 (removed 3) transitions.
// Phase 1: matrix 80 rows 72 cols
[2023-03-11 02:54:58] [INFO ] Computed 17 place invariants in 1 ms
[2023-03-11 02:54:58] [INFO ] Implicit Places using invariants in 87 ms returned []
[2023-03-11 02:54:58] [INFO ] Invariant cache hit.
[2023-03-11 02:54:58] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-11 02:54:58] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 167 ms to find 0 implicit places.
[2023-03-11 02:54:58] [INFO ] Redundant transitions in 10 ms returned []
[2023-03-11 02:54:58] [INFO ] Invariant cache hit.
[2023-03-11 02:54:58] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 72/75 places, 80/83 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 239 ms. Remains : 72/75 places, 80/83 transitions.
Treatment of property BusinessProcesses-PT-14-LTLCardinality-15 finished in 3753 ms.
[2023-03-11 02:54:58] [INFO ] Flatten gal took : 18 ms
[2023-03-11 02:54:58] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-11 02:54:58] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 479 places, 424 transitions and 1372 arcs took 3 ms.
Total runtime 29738 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT BusinessProcesses-PT-14
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/366
LTLCardinality

BK_STOP 1678503364298

--------------------
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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ 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/366/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/366/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/366/LTLCardinality.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:436
lola: rewrite Frontend/Parser/formula_rewrite.k:521
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: LAUNCH task # 1 (type EXCL) for 0 BusinessProcesses-PT-14-LTLCardinality-15
lola: time limit : 3600 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BusinessProcesses-PT-14-LTLCardinality-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/3600 4/32 BusinessProcesses-PT-14-LTLCardinality-15 369365 m, 73873 m/sec, 2339449 t fired, .

Time elapsed: 5 secs. Pages in use: 4
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BusinessProcesses-PT-14-LTLCardinality-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/3600 7/32 BusinessProcesses-PT-14-LTLCardinality-15 710056 m, 68138 m/sec, 4711424 t fired, .

Time elapsed: 10 secs. Pages in use: 7
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BusinessProcesses-PT-14-LTLCardinality-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 15/3600 9/32 BusinessProcesses-PT-14-LTLCardinality-15 1004605 m, 58909 m/sec, 7075362 t fired, .

Time elapsed: 15 secs. Pages in use: 9
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BusinessProcesses-PT-14-LTLCardinality-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 20/3600 12/32 BusinessProcesses-PT-14-LTLCardinality-15 1343193 m, 67717 m/sec, 9458615 t fired, .

Time elapsed: 20 secs. Pages in use: 12
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BusinessProcesses-PT-14-LTLCardinality-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 25/3600 15/32 BusinessProcesses-PT-14-LTLCardinality-15 1648880 m, 61137 m/sec, 11838750 t fired, .

Time elapsed: 25 secs. Pages in use: 15
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BusinessProcesses-PT-14-LTLCardinality-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 30/3600 17/32 BusinessProcesses-PT-14-LTLCardinality-15 1896131 m, 49450 m/sec, 13986605 t fired, .

Time elapsed: 30 secs. Pages in use: 17
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BusinessProcesses-PT-14-LTLCardinality-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 35/3600 19/32 BusinessProcesses-PT-14-LTLCardinality-15 2133535 m, 47480 m/sec, 15943875 t fired, .

Time elapsed: 35 secs. Pages in use: 19
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BusinessProcesses-PT-14-LTLCardinality-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 40/3600 22/32 BusinessProcesses-PT-14-LTLCardinality-15 2436096 m, 60512 m/sec, 18196795 t fired, .

Time elapsed: 40 secs. Pages in use: 22
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BusinessProcesses-PT-14-LTLCardinality-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 45/3600 24/32 BusinessProcesses-PT-14-LTLCardinality-15 2728758 m, 58532 m/sec, 20471627 t fired, .

Time elapsed: 45 secs. Pages in use: 24
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BusinessProcesses-PT-14-LTLCardinality-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 50/3600 26/32 BusinessProcesses-PT-14-LTLCardinality-15 2999051 m, 54058 m/sec, 22795862 t fired, .

Time elapsed: 50 secs. Pages in use: 26
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BusinessProcesses-PT-14-LTLCardinality-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 55/3600 29/32 BusinessProcesses-PT-14-LTLCardinality-15 3263613 m, 52912 m/sec, 24881264 t fired, .

Time elapsed: 55 secs. Pages in use: 29
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BusinessProcesses-PT-14-LTLCardinality-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 60/3600 31/32 BusinessProcesses-PT-14-LTLCardinality-15 3556614 m, 58600 m/sec, 27100557 t fired, .

Time elapsed: 60 secs. Pages in use: 31
# running tasks: 1 of 4 Visible: 1
lola: CANCELED task # 1 (type EXCL) for BusinessProcesses-PT-14-LTLCardinality-15 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BusinessProcesses-PT-14-LTLCardinality-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 65 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 1
lola: Portfolio finished: no open tasks 1

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BusinessProcesses-PT-14-LTLCardinality-15: LTL unknown AGGR


Time elapsed: 65 secs. Pages in use: 32

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-14"
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-14, 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-167813692700555"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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