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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 7.4K Feb 25 16:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 25 16:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K Feb 25 16:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 33K Feb 25 16:48 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.9K Feb 25 15:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Feb 25 15:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K 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 6.7K Feb 25 16:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 59K Feb 25 16:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Feb 25 16:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 25 16:49 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 161K 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-17-LTLCardinality-00
FORMULA_NAME BusinessProcesses-PT-17-LTLCardinality-01
FORMULA_NAME BusinessProcesses-PT-17-LTLCardinality-02
FORMULA_NAME BusinessProcesses-PT-17-LTLCardinality-03
FORMULA_NAME BusinessProcesses-PT-17-LTLCardinality-04
FORMULA_NAME BusinessProcesses-PT-17-LTLCardinality-05
FORMULA_NAME BusinessProcesses-PT-17-LTLCardinality-06
FORMULA_NAME BusinessProcesses-PT-17-LTLCardinality-07
FORMULA_NAME BusinessProcesses-PT-17-LTLCardinality-08
FORMULA_NAME BusinessProcesses-PT-17-LTLCardinality-09
FORMULA_NAME BusinessProcesses-PT-17-LTLCardinality-10
FORMULA_NAME BusinessProcesses-PT-17-LTLCardinality-11
FORMULA_NAME BusinessProcesses-PT-17-LTLCardinality-12
FORMULA_NAME BusinessProcesses-PT-17-LTLCardinality-13
FORMULA_NAME BusinessProcesses-PT-17-LTLCardinality-14
FORMULA_NAME BusinessProcesses-PT-17-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678503510043

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-17
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-11 02:58:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-11 02:58:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 02:58:32] [INFO ] Load time of PNML (sax parser for PT used): 80 ms
[2023-03-11 02:58:32] [INFO ] Transformed 650 places.
[2023-03-11 02:58:32] [INFO ] Transformed 580 transitions.
[2023-03-11 02:58:32] [INFO ] Found NUPN structural information;
[2023-03-11 02:58:32] [INFO ] Parsed PT model containing 650 places and 580 transitions and 1709 arcs in 164 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 4 places in 14 ms
Reduce places removed 4 places and 4 transitions.
FORMULA BusinessProcesses-PT-17-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-17-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-17-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-17-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-17-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-17-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-17-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-17-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 out of 646 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 646/646 places, 576/576 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 643 transition count 576
Discarding 87 places :
Symmetric choice reduction at 1 with 87 rule applications. Total rules 90 place count 556 transition count 489
Iterating global reduction 1 with 87 rules applied. Total rules applied 177 place count 556 transition count 489
Discarding 41 places :
Symmetric choice reduction at 1 with 41 rule applications. Total rules 218 place count 515 transition count 448
Iterating global reduction 1 with 41 rules applied. Total rules applied 259 place count 515 transition count 448
Applied a total of 259 rules in 170 ms. Remains 515 /646 variables (removed 131) and now considering 448/576 (removed 128) transitions.
// Phase 1: matrix 448 rows 515 cols
[2023-03-11 02:58:32] [INFO ] Computed 105 place invariants in 50 ms
[2023-03-11 02:58:33] [INFO ] Implicit Places using invariants in 519 ms returned []
[2023-03-11 02:58:33] [INFO ] Invariant cache hit.
[2023-03-11 02:58:33] [INFO ] Implicit Places using invariants and state equation in 537 ms returned []
Implicit Place search using SMT with State Equation took 1086 ms to find 0 implicit places.
[2023-03-11 02:58:33] [INFO ] Invariant cache hit.
[2023-03-11 02:58:33] [INFO ] Dead Transitions using invariants and state equation in 259 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 515/646 places, 448/576 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1516 ms. Remains : 515/646 places, 448/576 transitions.
Support contains 28 out of 515 places after structural reductions.
[2023-03-11 02:58:34] [INFO ] Flatten gal took : 67 ms
[2023-03-11 02:58:34] [INFO ] Flatten gal took : 28 ms
[2023-03-11 02:58:34] [INFO ] Input system was already deterministic with 448 transitions.
Incomplete random walk after 10000 steps, including 66 resets, run finished after 602 ms. (steps per millisecond=16 ) properties (out of 13) seen :5
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2023-03-11 02:58:35] [INFO ] Invariant cache hit.
[2023-03-11 02:58:35] [INFO ] [Real]Absence check using 59 positive place invariants in 19 ms returned sat
[2023-03-11 02:58:35] [INFO ] [Real]Absence check using 59 positive and 46 generalized place invariants in 19 ms returned sat
[2023-03-11 02:58:35] [INFO ] After 164ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:7
[2023-03-11 02:58:35] [INFO ] Deduced a trap composed of 11 places in 80 ms of which 5 ms to minimize.
[2023-03-11 02:58:35] [INFO ] Deduced a trap composed of 40 places in 85 ms of which 1 ms to minimize.
[2023-03-11 02:58:36] [INFO ] Deduced a trap composed of 32 places in 60 ms of which 1 ms to minimize.
[2023-03-11 02:58:36] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 1 ms to minimize.
[2023-03-11 02:58:36] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 1 ms to minimize.
[2023-03-11 02:58:36] [INFO ] Deduced a trap composed of 44 places in 62 ms of which 1 ms to minimize.
[2023-03-11 02:58:36] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 0 ms to minimize.
[2023-03-11 02:58:36] [INFO ] Deduced a trap composed of 33 places in 44 ms of which 0 ms to minimize.
[2023-03-11 02:58:36] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 0 ms to minimize.
[2023-03-11 02:58:36] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 754 ms
[2023-03-11 02:58:36] [INFO ] After 934ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-11 02:58:36] [INFO ] After 1164ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-11 02:58:36] [INFO ] [Nat]Absence check using 59 positive place invariants in 21 ms returned sat
[2023-03-11 02:58:36] [INFO ] [Nat]Absence check using 59 positive and 46 generalized place invariants in 38 ms returned sat
[2023-03-11 02:58:37] [INFO ] After 309ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-11 02:58:37] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 0 ms to minimize.
[2023-03-11 02:58:37] [INFO ] Deduced a trap composed of 11 places in 88 ms of which 0 ms to minimize.
[2023-03-11 02:58:37] [INFO ] Deduced a trap composed of 11 places in 81 ms of which 1 ms to minimize.
[2023-03-11 02:58:37] [INFO ] Deduced a trap composed of 14 places in 90 ms of which 1 ms to minimize.
[2023-03-11 02:58:37] [INFO ] Deduced a trap composed of 21 places in 74 ms of which 0 ms to minimize.
[2023-03-11 02:58:37] [INFO ] Deduced a trap composed of 39 places in 71 ms of which 1 ms to minimize.
[2023-03-11 02:58:37] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 0 ms to minimize.
[2023-03-11 02:58:37] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 0 ms to minimize.
[2023-03-11 02:58:38] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 1 ms to minimize.
[2023-03-11 02:58:38] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 916 ms
[2023-03-11 02:58:38] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 0 ms to minimize.
[2023-03-11 02:58:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 74 ms
[2023-03-11 02:58:38] [INFO ] After 1549ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 195 ms.
[2023-03-11 02:58:38] [INFO ] After 2022ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 1 properties in 178 ms.
Support contains 12 out of 515 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 515/515 places, 448/448 transitions.
Graph (trivial) has 230 edges and 515 vertex of which 6 / 515 are part of one of the 1 SCC in 4 ms
Free SCC test removed 5 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1146 edges and 510 vertex of which 509 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 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 52 rules applied. Total rules applied 54 place count 509 transition count 388
Reduce places removed 52 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 53 rules applied. Total rules applied 107 place count 457 transition count 387
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 108 place count 456 transition count 387
Performed 106 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 106 Pre rules applied. Total rules applied 108 place count 456 transition count 281
Deduced a syphon composed of 106 places in 2 ms
Ensure Unique test removed 20 places
Reduce places removed 126 places and 0 transitions.
Iterating global reduction 3 with 232 rules applied. Total rules applied 340 place count 330 transition count 281
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 344 place count 326 transition count 277
Iterating global reduction 3 with 4 rules applied. Total rules applied 348 place count 326 transition count 277
Performed 129 Post agglomeration using F-continuation condition.Transition count delta: 129
Deduced a syphon composed of 129 places in 1 ms
Ensure Unique test removed 5 places
Reduce places removed 134 places and 0 transitions.
Iterating global reduction 3 with 263 rules applied. Total rules applied 611 place count 192 transition count 148
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 614 place count 192 transition count 145
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 617 place count 189 transition count 145
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 618 place count 189 transition count 145
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 619 place count 188 transition count 144
Applied a total of 619 rules in 110 ms. Remains 188 /515 variables (removed 327) and now considering 144/448 (removed 304) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 110 ms. Remains : 188/515 places, 144/448 transitions.
Incomplete random walk after 10000 steps, including 592 resets, run finished after 293 ms. (steps per millisecond=34 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 201 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 206 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 194 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 207 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 242 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 209 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 7) seen :0
Finished Best-First random walk after 4663 steps, including 25 resets, run visited all 7 properties in 20 ms. (steps per millisecond=233 )
Computed a total of 209 stabilizing places and 181 stable transitions
Graph (complete) has 1153 edges and 515 vertex of which 514 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.16 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&&F((p1&&F(p2)&&F(p3))))))'
Support contains 6 out of 515 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 515/515 places, 448/448 transitions.
Graph (trivial) has 235 edges and 515 vertex of which 6 / 515 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 1147 edges and 510 vertex of which 509 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 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 56 place count 508 transition count 386
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 110 place count 454 transition count 386
Performed 107 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 107 Pre rules applied. Total rules applied 110 place count 454 transition count 279
Deduced a syphon composed of 107 places in 1 ms
Ensure Unique test removed 20 places
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 2 with 234 rules applied. Total rules applied 344 place count 327 transition count 279
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 350 place count 321 transition count 273
Iterating global reduction 2 with 6 rules applied. Total rules applied 356 place count 321 transition count 273
Performed 132 Post agglomeration using F-continuation condition.Transition count delta: 132
Deduced a syphon composed of 132 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 137 places and 0 transitions.
Iterating global reduction 2 with 269 rules applied. Total rules applied 625 place count 184 transition count 141
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 627 place count 183 transition count 145
Applied a total of 627 rules in 44 ms. Remains 183 /515 variables (removed 332) and now considering 145/448 (removed 303) transitions.
// Phase 1: matrix 145 rows 183 cols
[2023-03-11 02:58:40] [INFO ] Computed 80 place invariants in 2 ms
[2023-03-11 02:58:40] [INFO ] Implicit Places using invariants in 180 ms returned [1, 2, 3, 4, 5, 8, 9, 33, 34, 35, 36, 43, 44, 45, 50, 51, 52, 53, 54, 55, 56, 57]
Discarding 22 places :
Implicit Place search using SMT only with invariants took 182 ms to find 22 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 161/515 places, 145/448 transitions.
Applied a total of 0 rules in 9 ms. Remains 161 /161 variables (removed 0) and now considering 145/145 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 235 ms. Remains : 161/515 places, 145/448 transitions.
Stuttering acceptance computed with spot in 315 ms :[(OR (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (OR (NOT p1) (NOT p2) (NOT p3)), (NOT p2), (NOT p3)]
Running random walk in product with property : BusinessProcesses-PT-17-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND p0 p1 (NOT p3)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p3)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={} source=2 dest: 2}], [{ cond=(NOT p3), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s20 1), p1:(OR (EQ s117 0) (EQ s90 1)), p2:(OR (EQ s51 0) (EQ s124 1)), p3:(EQ s107 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 2 ms.
FORMULA BusinessProcesses-PT-17-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-17-LTLCardinality-00 finished in 619 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 515 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 515/515 places, 448/448 transitions.
Graph (trivial) has 240 edges and 515 vertex of which 6 / 515 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 1147 edges and 510 vertex of which 509 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 55 transitions
Trivial Post-agglo rules discarded 55 transitions
Performed 55 trivial Post agglomeration. Transition count delta: 55
Iterating post reduction 0 with 55 rules applied. Total rules applied 57 place count 508 transition count 385
Reduce places removed 55 places and 0 transitions.
Iterating post reduction 1 with 55 rules applied. Total rules applied 112 place count 453 transition count 385
Performed 109 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 109 Pre rules applied. Total rules applied 112 place count 453 transition count 276
Deduced a syphon composed of 109 places in 1 ms
Ensure Unique test removed 20 places
Reduce places removed 129 places and 0 transitions.
Iterating global reduction 2 with 238 rules applied. Total rules applied 350 place count 324 transition count 276
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 359 place count 315 transition count 267
Iterating global reduction 2 with 9 rules applied. Total rules applied 368 place count 315 transition count 267
Performed 130 Post agglomeration using F-continuation condition.Transition count delta: 130
Deduced a syphon composed of 130 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 135 places and 0 transitions.
Iterating global reduction 2 with 265 rules applied. Total rules applied 633 place count 180 transition count 137
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 635 place count 179 transition count 141
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 636 place count 178 transition count 140
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 637 place count 177 transition count 140
Applied a total of 637 rules in 57 ms. Remains 177 /515 variables (removed 338) and now considering 140/448 (removed 308) transitions.
// Phase 1: matrix 140 rows 177 cols
[2023-03-11 02:58:40] [INFO ] Computed 79 place invariants in 6 ms
[2023-03-11 02:58:40] [INFO ] Implicit Places using invariants in 130 ms returned []
[2023-03-11 02:58:40] [INFO ] Invariant cache hit.
[2023-03-11 02:58:40] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-11 02:58:41] [INFO ] Implicit Places using invariants and state equation in 281 ms returned [60, 62, 64, 66, 68, 75, 77, 83, 85, 87, 89, 91, 93, 95, 97, 99, 101, 103, 105, 107, 109, 111, 113, 115, 117, 119, 121, 123]
Discarding 28 places :
Implicit Place search using SMT with State Equation took 415 ms to find 28 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 149/515 places, 140/448 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 149 transition count 127
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 26 place count 136 transition count 127
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 29 place count 133 transition count 123
Iterating global reduction 2 with 3 rules applied. Total rules applied 32 place count 133 transition count 123
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 2 rules applied. Total rules applied 34 place count 133 transition count 121
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 36 place count 131 transition count 121
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 4 places
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 56 place count 119 transition count 113
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 60 place count 117 transition count 111
Applied a total of 60 rules in 19 ms. Remains 117 /149 variables (removed 32) and now considering 111/140 (removed 29) transitions.
// Phase 1: matrix 111 rows 117 cols
[2023-03-11 02:58:41] [INFO ] Computed 47 place invariants in 1 ms
[2023-03-11 02:58:41] [INFO ] Implicit Places using invariants in 70 ms returned []
[2023-03-11 02:58:41] [INFO ] Invariant cache hit.
[2023-03-11 02:58:41] [INFO ] State equation strengthened by 28 read => feed constraints.
[2023-03-11 02:58:41] [INFO ] Implicit Places using invariants and state equation in 176 ms returned [2, 3, 4, 9, 10, 11, 35, 36, 37, 38, 39, 41, 43, 45, 46, 47, 48, 49, 50, 51, 52, 53]
Discarding 22 places :
Implicit Place search using SMT with State Equation took 248 ms to find 22 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 95/515 places, 111/448 transitions.
Graph (complete) has 378 edges and 95 vertex of which 86 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 11 place count 76 transition count 73
Iterating global reduction 0 with 10 rules applied. Total rules applied 21 place count 76 transition count 73
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 76 transition count 72
Applied a total of 22 rules in 8 ms. Remains 76 /95 variables (removed 19) and now considering 72/111 (removed 39) transitions.
// Phase 1: matrix 72 rows 76 cols
[2023-03-11 02:58:41] [INFO ] Computed 20 place invariants in 3 ms
[2023-03-11 02:58:41] [INFO ] Implicit Places using invariants in 52 ms returned [9, 10]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 55 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 74/515 places, 72/448 transitions.
Applied a total of 0 rules in 2 ms. Remains 74 /74 variables (removed 0) and now considering 72/72 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 4 iterations and 806 ms. Remains : 74/515 places, 72/448 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-17-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s1 0) (EQ s6 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-17-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-17-LTLCardinality-01 finished in 858 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)||G(!p0))))'
Support contains 2 out of 515 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 515/515 places, 448/448 transitions.
Graph (trivial) has 241 edges and 515 vertex of which 6 / 515 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 1147 edges and 510 vertex of which 509 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 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 58 place count 508 transition count 384
Reduce places removed 56 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 57 rules applied. Total rules applied 115 place count 452 transition count 383
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 116 place count 451 transition count 383
Performed 107 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 107 Pre rules applied. Total rules applied 116 place count 451 transition count 276
Deduced a syphon composed of 107 places in 0 ms
Ensure Unique test removed 19 places
Reduce places removed 126 places and 0 transitions.
Iterating global reduction 3 with 233 rules applied. Total rules applied 349 place count 325 transition count 276
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 359 place count 315 transition count 266
Iterating global reduction 3 with 10 rules applied. Total rules applied 369 place count 315 transition count 266
Performed 130 Post agglomeration using F-continuation condition.Transition count delta: 130
Deduced a syphon composed of 130 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 135 places and 0 transitions.
Iterating global reduction 3 with 265 rules applied. Total rules applied 634 place count 180 transition count 136
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 636 place count 179 transition count 140
Applied a total of 636 rules in 107 ms. Remains 179 /515 variables (removed 336) and now considering 140/448 (removed 308) transitions.
// Phase 1: matrix 140 rows 179 cols
[2023-03-11 02:58:41] [INFO ] Computed 81 place invariants in 2 ms
[2023-03-11 02:58:41] [INFO ] Implicit Places using invariants in 173 ms returned [1, 2, 3, 4, 5, 8, 9, 32, 33, 34, 35, 42, 43, 44, 49, 50, 51, 52, 55, 56, 57, 58, 150]
Discarding 23 places :
Implicit Place search using SMT only with invariants took 176 ms to find 23 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 156/515 places, 140/448 transitions.
Applied a total of 0 rules in 7 ms. Remains 156 /156 variables (removed 0) and now considering 140/140 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 291 ms. Remains : 156/515 places, 140/448 transitions.
Stuttering acceptance computed with spot in 94 ms :[false]
Running random walk in product with property : BusinessProcesses-PT-17-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={1} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s36 0) (EQ s39 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, colored, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 15127 reset in 448 ms.
Product exploration explored 100000 steps with 15120 reset in 367 ms.
Computed a total of 34 stabilizing places and 26 stable transitions
Computed a total of 34 stabilizing places and 26 stable transitions
Detected a total of 34/156 stabilizing places and 26/140 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (OR (G p0) (G (NOT p0))))
Knowledge based reduction with 4 factoid took 166 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-17-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-17-LTLCardinality-04 finished in 1388 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)))'
Support contains 2 out of 515 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 515/515 places, 448/448 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 505 transition count 438
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 505 transition count 438
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 24 place count 501 transition count 434
Iterating global reduction 0 with 4 rules applied. Total rules applied 28 place count 501 transition count 434
Applied a total of 28 rules in 42 ms. Remains 501 /515 variables (removed 14) and now considering 434/448 (removed 14) transitions.
// Phase 1: matrix 434 rows 501 cols
[2023-03-11 02:58:42] [INFO ] Computed 105 place invariants in 20 ms
[2023-03-11 02:58:43] [INFO ] Implicit Places using invariants in 230 ms returned []
[2023-03-11 02:58:43] [INFO ] Invariant cache hit.
[2023-03-11 02:58:43] [INFO ] Implicit Places using invariants and state equation in 789 ms returned []
Implicit Place search using SMT with State Equation took 1048 ms to find 0 implicit places.
[2023-03-11 02:58:43] [INFO ] Invariant cache hit.
[2023-03-11 02:58:44] [INFO ] Dead Transitions using invariants and state equation in 324 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 501/515 places, 434/448 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1432 ms. Remains : 501/515 places, 434/448 transitions.
Stuttering acceptance computed with spot in 97 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-17-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (NEQ s222 0) (NEQ s289 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-17-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-17-LTLCardinality-06 finished in 1550 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)))'
Support contains 2 out of 515 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 515/515 places, 448/448 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 505 transition count 438
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 505 transition count 438
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 24 place count 501 transition count 434
Iterating global reduction 0 with 4 rules applied. Total rules applied 28 place count 501 transition count 434
Applied a total of 28 rules in 28 ms. Remains 501 /515 variables (removed 14) and now considering 434/448 (removed 14) transitions.
[2023-03-11 02:58:44] [INFO ] Invariant cache hit.
[2023-03-11 02:58:44] [INFO ] Implicit Places using invariants in 231 ms returned []
[2023-03-11 02:58:44] [INFO ] Invariant cache hit.
[2023-03-11 02:58:45] [INFO ] Implicit Places using invariants and state equation in 628 ms returned []
Implicit Place search using SMT with State Equation took 875 ms to find 0 implicit places.
[2023-03-11 02:58:45] [INFO ] Invariant cache hit.
[2023-03-11 02:58:45] [INFO ] Dead Transitions using invariants and state equation in 299 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 501/515 places, 434/448 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1204 ms. Remains : 501/515 places, 434/448 transitions.
Stuttering acceptance computed with spot in 128 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-17-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s267 0) (EQ s68 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 153 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-17-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-17-LTLCardinality-07 finished in 1350 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 6 out of 515 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 515/515 places, 448/448 transitions.
Graph (trivial) has 234 edges and 515 vertex of which 6 / 515 are part of one of the 1 SCC in 2 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1147 edges and 510 vertex of which 509 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 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 56 place count 508 transition count 386
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 110 place count 454 transition count 386
Performed 107 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 107 Pre rules applied. Total rules applied 110 place count 454 transition count 279
Deduced a syphon composed of 107 places in 1 ms
Ensure Unique test removed 19 places
Reduce places removed 126 places and 0 transitions.
Iterating global reduction 2 with 233 rules applied. Total rules applied 343 place count 328 transition count 279
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 351 place count 320 transition count 271
Iterating global reduction 2 with 8 rules applied. Total rules applied 359 place count 320 transition count 271
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 2 with 259 rules applied. Total rules applied 618 place count 188 transition count 144
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 620 place count 187 transition count 148
Applied a total of 620 rules in 73 ms. Remains 187 /515 variables (removed 328) and now considering 148/448 (removed 300) transitions.
// Phase 1: matrix 148 rows 187 cols
[2023-03-11 02:58:45] [INFO ] Computed 81 place invariants in 3 ms
[2023-03-11 02:58:45] [INFO ] Implicit Places using invariants in 156 ms returned [7, 10, 11, 34, 35, 36, 37, 44, 45, 46, 51, 52, 53, 54, 55, 56, 57, 61, 161]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 159 ms to find 19 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 168/515 places, 148/448 transitions.
Applied a total of 0 rules in 12 ms. Remains 168 /168 variables (removed 0) and now considering 148/148 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 244 ms. Remains : 168/515 places, 148/448 transitions.
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-17-LTLCardinality-11 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 (AND (OR (EQ s42 0) (EQ s84 1)) (OR (EQ s68 0) (EQ s5 1))) (AND (NEQ s124 0) (NEQ s107 1)) (AND (NEQ s68 0) (NEQ s5 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 8479 reset in 338 ms.
Product exploration explored 100000 steps with 8511 reset in 294 ms.
Computed a total of 42 stabilizing places and 33 stable transitions
Computed a total of 42 stabilizing places and 33 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 179 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 44 ms :[(NOT p0)]
Finished random walk after 109 steps, including 10 resets, run visited all 1 properties in 2 ms. (steps per millisecond=54 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 178 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 39 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 59 ms :[(NOT p0)]
Support contains 6 out of 168 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 168/168 places, 148/148 transitions.
Applied a total of 0 rules in 9 ms. Remains 168 /168 variables (removed 0) and now considering 148/148 (removed 0) transitions.
// Phase 1: matrix 148 rows 168 cols
[2023-03-11 02:58:47] [INFO ] Computed 62 place invariants in 4 ms
[2023-03-11 02:58:47] [INFO ] Implicit Places using invariants in 128 ms returned []
[2023-03-11 02:58:47] [INFO ] Invariant cache hit.
[2023-03-11 02:58:47] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-11 02:58:47] [INFO ] Implicit Places using invariants and state equation in 258 ms returned [9, 31, 33, 35, 110, 112, 114]
Discarding 7 places :
Implicit Place search using SMT with State Equation took 391 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 161/168 places, 148/148 transitions.
Graph (complete) has 562 edges and 161 vertex of which 152 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
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 152 transition count 143
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 151 transition count 143
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 12 place count 142 transition count 107
Iterating global reduction 2 with 9 rules applied. Total rules applied 21 place count 142 transition count 107
Applied a total of 21 rules in 9 ms. Remains 142 /161 variables (removed 19) and now considering 107/148 (removed 41) transitions.
// Phase 1: matrix 107 rows 142 cols
[2023-03-11 02:58:47] [INFO ] Computed 50 place invariants in 2 ms
[2023-03-11 02:58:47] [INFO ] Implicit Places using invariants in 116 ms returned [9, 10, 11]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 117 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 139/168 places, 107/148 transitions.
Applied a total of 0 rules in 5 ms. Remains 139 /139 variables (removed 0) and now considering 107/107 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 532 ms. Remains : 139/168 places, 107/148 transitions.
Computed a total of 38 stabilizing places and 32 stable transitions
Computed a total of 38 stabilizing places and 32 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 104 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 28 ms :[(NOT p0)]
Finished random walk after 121 steps, including 11 resets, run visited all 1 properties in 2 ms. (steps per millisecond=60 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 149 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 44 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Product exploration explored 100000 steps with 8548 reset in 251 ms.
Product exploration explored 100000 steps with 8567 reset in 219 ms.
Support contains 6 out of 139 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 139/139 places, 107/107 transitions.
Applied a total of 0 rules in 4 ms. Remains 139 /139 variables (removed 0) and now considering 107/107 (removed 0) transitions.
// Phase 1: matrix 107 rows 139 cols
[2023-03-11 02:58:48] [INFO ] Computed 47 place invariants in 3 ms
[2023-03-11 02:58:48] [INFO ] Implicit Places using invariants in 122 ms returned []
[2023-03-11 02:58:48] [INFO ] Invariant cache hit.
[2023-03-11 02:58:48] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-11 02:58:48] [INFO ] Implicit Places using invariants and state equation in 196 ms returned []
Implicit Place search using SMT with State Equation took 322 ms to find 0 implicit places.
[2023-03-11 02:58:48] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-11 02:58:48] [INFO ] Invariant cache hit.
[2023-03-11 02:58:49] [INFO ] Dead Transitions using invariants and state equation in 82 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 417 ms. Remains : 139/139 places, 107/107 transitions.
Treatment of property BusinessProcesses-PT-17-LTLCardinality-11 finished in 3453 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 515 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 515/515 places, 448/448 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 505 transition count 438
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 505 transition count 438
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 24 place count 501 transition count 434
Iterating global reduction 0 with 4 rules applied. Total rules applied 28 place count 501 transition count 434
Applied a total of 28 rules in 32 ms. Remains 501 /515 variables (removed 14) and now considering 434/448 (removed 14) transitions.
// Phase 1: matrix 434 rows 501 cols
[2023-03-11 02:58:49] [INFO ] Computed 105 place invariants in 6 ms
[2023-03-11 02:58:49] [INFO ] Implicit Places using invariants in 213 ms returned []
[2023-03-11 02:58:49] [INFO ] Invariant cache hit.
[2023-03-11 02:58:50] [INFO ] Implicit Places using invariants and state equation in 613 ms returned []
Implicit Place search using SMT with State Equation took 839 ms to find 0 implicit places.
[2023-03-11 02:58:50] [INFO ] Invariant cache hit.
[2023-03-11 02:58:50] [INFO ] Dead Transitions using invariants and state equation in 321 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 501/515 places, 434/448 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1197 ms. Remains : 501/515 places, 434/448 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-17-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (NEQ s231 0) (NEQ s244 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 143 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-17-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-17-LTLCardinality-13 finished in 1289 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))||(!p1 U (p2||G(!p1)))))'
Support contains 6 out of 515 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 515/515 places, 448/448 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 508 transition count 441
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 508 transition count 441
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 18 place count 504 transition count 437
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 504 transition count 437
Applied a total of 22 rules in 26 ms. Remains 504 /515 variables (removed 11) and now considering 437/448 (removed 11) transitions.
// Phase 1: matrix 437 rows 504 cols
[2023-03-11 02:58:50] [INFO ] Computed 105 place invariants in 4 ms
[2023-03-11 02:58:50] [INFO ] Implicit Places using invariants in 191 ms returned []
[2023-03-11 02:58:50] [INFO ] Invariant cache hit.
[2023-03-11 02:58:51] [INFO ] Implicit Places using invariants and state equation in 640 ms returned []
Implicit Place search using SMT with State Equation took 833 ms to find 0 implicit places.
[2023-03-11 02:58:51] [INFO ] Invariant cache hit.
[2023-03-11 02:58:51] [INFO ] Dead Transitions using invariants and state equation in 252 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 504/515 places, 437/448 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1114 ms. Remains : 504/515 places, 437/448 transitions.
Stuttering acceptance computed with spot in 140 ms :[(NOT p0), (AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2) p1)]
Running random walk in product with property : BusinessProcesses-PT-17-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (OR (EQ s52 0) (EQ s410 1)) (EQ s444 0) (EQ s64 1)), p2:(AND (OR (EQ s64 0) (EQ s444 1)) (NOT (OR (EQ s105 0) (EQ s387 1)))), p1:(OR (EQ s105 0) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 143 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-17-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-17-LTLCardinality-14 finished in 1271 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)))'
[2023-03-11 02:58:51] [INFO ] Flatten gal took : 32 ms
[2023-03-11 02:58:51] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2023-03-11 02:58:51] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 515 places, 448 transitions and 1442 arcs took 4 ms.
Total runtime 19968 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT BusinessProcesses-PT-17
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/375
LTLCardinality

FORMULA BusinessProcesses-PT-17-LTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678503532563

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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/375/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/375/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/375/LTLCardinality.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 1 (type EXCL) for 0 BusinessProcesses-PT-17-LTLCardinality-11
lola: time limit : 3600 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for BusinessProcesses-PT-17-LTLCardinality-11
lola: result : true
lola: markings : 57015
lola: fired transitions : 159658
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open formulas

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


Time elapsed: 0 secs. Pages in use: 1

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BusinessProcesses-PT-17"
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-17, 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-167813692700579"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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