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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 8.4K Feb 25 16:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K Feb 25 16:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K Feb 25 16:42 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K 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:38 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:38 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:38 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.9K Feb 25 16:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K Feb 25 16:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Feb 25 16:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 25 16:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:38 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:38 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 100K 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-07-LTLCardinality-00
FORMULA_NAME BusinessProcesses-PT-07-LTLCardinality-01
FORMULA_NAME BusinessProcesses-PT-07-LTLCardinality-02
FORMULA_NAME BusinessProcesses-PT-07-LTLCardinality-03
FORMULA_NAME BusinessProcesses-PT-07-LTLCardinality-04
FORMULA_NAME BusinessProcesses-PT-07-LTLCardinality-05
FORMULA_NAME BusinessProcesses-PT-07-LTLCardinality-06
FORMULA_NAME BusinessProcesses-PT-07-LTLCardinality-07
FORMULA_NAME BusinessProcesses-PT-07-LTLCardinality-08
FORMULA_NAME BusinessProcesses-PT-07-LTLCardinality-09
FORMULA_NAME BusinessProcesses-PT-07-LTLCardinality-10
FORMULA_NAME BusinessProcesses-PT-07-LTLCardinality-11
FORMULA_NAME BusinessProcesses-PT-07-LTLCardinality-12
FORMULA_NAME BusinessProcesses-PT-07-LTLCardinality-13
FORMULA_NAME BusinessProcesses-PT-07-LTLCardinality-14
FORMULA_NAME BusinessProcesses-PT-07-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678502091432

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-07
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-11 02:34:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-11 02:34:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 02:34:53] [INFO ] Load time of PNML (sax parser for PT used): 54 ms
[2023-03-11 02:34:53] [INFO ] Transformed 386 places.
[2023-03-11 02:34:53] [INFO ] Transformed 360 transitions.
[2023-03-11 02:34:53] [INFO ] Found NUPN structural information;
[2023-03-11 02:34:53] [INFO ] Parsed PT model containing 386 places and 360 transitions and 1110 arcs in 133 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 17 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA BusinessProcesses-PT-07-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-07-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-07-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-07-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-07-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-07-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-07-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 32 out of 386 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 386/386 places, 360/360 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 385 transition count 360
Discarding 50 places :
Symmetric choice reduction at 1 with 50 rule applications. Total rules 51 place count 335 transition count 310
Iterating global reduction 1 with 50 rules applied. Total rules applied 101 place count 335 transition count 310
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 123 place count 313 transition count 288
Iterating global reduction 1 with 22 rules applied. Total rules applied 145 place count 313 transition count 288
Applied a total of 145 rules in 57 ms. Remains 313 /386 variables (removed 73) and now considering 288/360 (removed 72) transitions.
// Phase 1: matrix 288 rows 313 cols
[2023-03-11 02:34:53] [INFO ] Computed 61 place invariants in 14 ms
[2023-03-11 02:34:53] [INFO ] Implicit Places using invariants in 242 ms returned []
[2023-03-11 02:34:53] [INFO ] Invariant cache hit.
[2023-03-11 02:34:54] [INFO ] Implicit Places using invariants and state equation in 454 ms returned []
Implicit Place search using SMT with State Equation took 719 ms to find 0 implicit places.
[2023-03-11 02:34:54] [INFO ] Invariant cache hit.
[2023-03-11 02:34:54] [INFO ] Dead Transitions using invariants and state equation in 191 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 313/386 places, 288/360 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 971 ms. Remains : 313/386 places, 288/360 transitions.
Support contains 32 out of 313 places after structural reductions.
[2023-03-11 02:34:54] [INFO ] Flatten gal took : 63 ms
[2023-03-11 02:34:54] [INFO ] Flatten gal took : 26 ms
[2023-03-11 02:34:54] [INFO ] Input system was already deterministic with 288 transitions.
Incomplete random walk after 10000 steps, including 110 resets, run finished after 390 ms. (steps per millisecond=25 ) properties (out of 16) seen :14
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-11 02:34:55] [INFO ] Invariant cache hit.
[2023-03-11 02:34:55] [INFO ] After 118ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 02:34:55] [INFO ] [Nat]Absence check using 32 positive place invariants in 6 ms returned sat
[2023-03-11 02:34:55] [INFO ] [Nat]Absence check using 32 positive and 29 generalized place invariants in 6 ms returned sat
[2023-03-11 02:34:55] [INFO ] After 222ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 02:34:55] [INFO ] Deduced a trap composed of 42 places in 127 ms of which 7 ms to minimize.
[2023-03-11 02:34:56] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 0 ms to minimize.
[2023-03-11 02:34:56] [INFO ] Deduced a trap composed of 37 places in 91 ms of which 1 ms to minimize.
[2023-03-11 02:34:56] [INFO ] Deduced a trap composed of 69 places in 80 ms of which 1 ms to minimize.
[2023-03-11 02:34:56] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 0 ms to minimize.
[2023-03-11 02:34:56] [INFO ] Deduced a trap composed of 57 places in 121 ms of which 0 ms to minimize.
[2023-03-11 02:34:56] [INFO ] Deduced a trap composed of 55 places in 73 ms of which 1 ms to minimize.
[2023-03-11 02:34:56] [INFO ] Deduced a trap composed of 19 places in 90 ms of which 1 ms to minimize.
[2023-03-11 02:34:56] [INFO ] Deduced a trap composed of 59 places in 108 ms of which 0 ms to minimize.
[2023-03-11 02:34:56] [INFO ] Deduced a trap composed of 57 places in 69 ms of which 1 ms to minimize.
[2023-03-11 02:34:56] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1067 ms
[2023-03-11 02:34:56] [INFO ] Deduced a trap composed of 55 places in 74 ms of which 4 ms to minimize.
[2023-03-11 02:34:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 91 ms
[2023-03-11 02:34:57] [INFO ] After 1413ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-11 02:34:57] [INFO ] After 1529ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 1 properties in 6 ms.
Support contains 2 out of 313 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 313/313 places, 288/288 transitions.
Graph (trivial) has 141 edges and 313 vertex of which 6 / 313 are part of one of the 1 SCC in 2 ms
Free SCC test removed 5 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 724 edges and 308 vertex of which 307 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 33 place count 307 transition count 249
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 64 place count 276 transition count 249
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 64 Pre rules applied. Total rules applied 64 place count 276 transition count 185
Deduced a syphon composed of 64 places in 1 ms
Ensure Unique test removed 8 places
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 136 rules applied. Total rules applied 200 place count 204 transition count 185
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 205 place count 199 transition count 180
Iterating global reduction 2 with 5 rules applied. Total rules applied 210 place count 199 transition count 180
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 210 place count 199 transition count 179
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 212 place count 198 transition count 179
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 2 with 153 rules applied. Total rules applied 365 place count 120 transition count 104
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
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 367 place count 119 transition count 106
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 369 place count 119 transition count 104
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 371 place count 117 transition count 104
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 372 place count 117 transition count 104
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 373 place count 116 transition count 103
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 374 place count 115 transition count 103
Applied a total of 374 rules in 51 ms. Remains 115 /313 variables (removed 198) and now considering 103/288 (removed 185) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 115/313 places, 103/288 transitions.
Finished random walk after 39 steps, including 3 resets, run visited all 1 properties in 1 ms. (steps per millisecond=39 )
FORMULA BusinessProcesses-PT-07-LTLCardinality-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 192 stabilizing places and 194 stable transitions
Graph (complete) has 731 edges and 313 vertex of which 312 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 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)))'
Support contains 2 out of 313 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 313/313 places, 288/288 transitions.
Graph (trivial) has 140 edges and 313 vertex of which 6 / 313 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 725 edges and 308 vertex of which 307 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 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 33 place count 306 transition count 249
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 64 place count 275 transition count 249
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 64 Pre rules applied. Total rules applied 64 place count 275 transition count 185
Deduced a syphon composed of 64 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 2 with 137 rules applied. Total rules applied 201 place count 202 transition count 185
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 206 place count 197 transition count 180
Iterating global reduction 2 with 5 rules applied. Total rules applied 211 place count 197 transition count 180
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 211 place count 197 transition count 178
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 215 place count 195 transition count 178
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Deduced a syphon composed of 73 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 2 with 149 rules applied. Total rules applied 364 place count 119 transition count 105
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 365 place count 118 transition count 104
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 366 place count 117 transition count 104
Applied a total of 366 rules in 46 ms. Remains 117 /313 variables (removed 196) and now considering 104/288 (removed 184) transitions.
// Phase 1: matrix 104 rows 117 cols
[2023-03-11 02:34:57] [INFO ] Computed 48 place invariants in 7 ms
[2023-03-11 02:34:57] [INFO ] Implicit Places using invariants in 117 ms returned [0, 1, 9, 36, 37, 38, 39, 40, 41]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 132 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 108/313 places, 104/288 transitions.
Applied a total of 0 rules in 4 ms. Remains 108 /108 variables (removed 0) and now considering 104/104 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 183 ms. Remains : 108/313 places, 104/288 transitions.
Stuttering acceptance computed with spot in 258 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-07-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (NEQ s9 0) (NEQ s71 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-07-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-07-LTLCardinality-01 finished in 531 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((G(p0) U (p1&&G(p0)&&X(p2))))))'
Support contains 6 out of 313 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 313/313 places, 288/288 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 307 transition count 282
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 307 transition count 282
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 304 transition count 279
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 304 transition count 279
Applied a total of 18 rules in 10 ms. Remains 304 /313 variables (removed 9) and now considering 279/288 (removed 9) transitions.
// Phase 1: matrix 279 rows 304 cols
[2023-03-11 02:34:57] [INFO ] Computed 61 place invariants in 17 ms
[2023-03-11 02:34:57] [INFO ] Implicit Places using invariants in 142 ms returned []
[2023-03-11 02:34:57] [INFO ] Invariant cache hit.
[2023-03-11 02:34:58] [INFO ] Implicit Places using invariants and state equation in 230 ms returned []
Implicit Place search using SMT with State Equation took 375 ms to find 0 implicit places.
[2023-03-11 02:34:58] [INFO ] Invariant cache hit.
[2023-03-11 02:34:58] [INFO ] Dead Transitions using invariants and state equation in 119 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 304/313 places, 279/288 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 507 ms. Remains : 304/313 places, 279/288 transitions.
Stuttering acceptance computed with spot in 173 ms :[(NOT p0), (OR (NOT p2) (NOT p0)), (OR (NOT p0) (NOT p1) (NOT p2)), true, (OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-07-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=(AND p0 p2), acceptance={0} source=1 dest: 0}, { cond=(AND p1 p0 (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 3}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=1 dest: 5}], [{ cond=true, acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 2}], [{ cond=(AND p1 p0), acceptance={0} source=5 dest: 1}, { cond=(NOT p0), acceptance={0} source=5 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=5 dest: 5}]], initial=4, aps=[p0:(OR (EQ s214 0) (EQ s150 1)), p2:(OR (EQ s63 0) (EQ s251 1)), p1:(OR (EQ s282 0) (EQ s298 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 32 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-07-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-07-LTLCardinality-06 finished in 695 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 313 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 313/313 places, 288/288 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 306 transition count 281
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 306 transition count 281
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 303 transition count 278
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 303 transition count 278
Applied a total of 20 rules in 23 ms. Remains 303 /313 variables (removed 10) and now considering 278/288 (removed 10) transitions.
// Phase 1: matrix 278 rows 303 cols
[2023-03-11 02:34:58] [INFO ] Computed 61 place invariants in 2 ms
[2023-03-11 02:34:58] [INFO ] Implicit Places using invariants in 104 ms returned []
[2023-03-11 02:34:58] [INFO ] Invariant cache hit.
[2023-03-11 02:34:58] [INFO ] Implicit Places using invariants and state equation in 244 ms returned []
Implicit Place search using SMT with State Equation took 348 ms to find 0 implicit places.
[2023-03-11 02:34:58] [INFO ] Invariant cache hit.
[2023-03-11 02:34:59] [INFO ] Dead Transitions using invariants and state equation in 135 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 303/313 places, 278/288 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 507 ms. Remains : 303/313 places, 278/288 transitions.
Stuttering acceptance computed with spot in 72 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-07-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 s53 0) (EQ s65 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 269 steps with 2 reset in 2 ms.
FORMULA BusinessProcesses-PT-07-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-07-LTLCardinality-07 finished in 591 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' '!((p0 U X(p1)))'
Support contains 4 out of 313 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 313/313 places, 288/288 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 308 transition count 283
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 308 transition count 283
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 305 transition count 280
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 305 transition count 280
Applied a total of 16 rules in 9 ms. Remains 305 /313 variables (removed 8) and now considering 280/288 (removed 8) transitions.
// Phase 1: matrix 280 rows 305 cols
[2023-03-11 02:34:59] [INFO ] Computed 61 place invariants in 5 ms
[2023-03-11 02:34:59] [INFO ] Implicit Places using invariants in 127 ms returned []
[2023-03-11 02:34:59] [INFO ] Invariant cache hit.
[2023-03-11 02:34:59] [INFO ] Implicit Places using invariants and state equation in 215 ms returned []
Implicit Place search using SMT with State Equation took 371 ms to find 0 implicit places.
[2023-03-11 02:34:59] [INFO ] Invariant cache hit.
[2023-03-11 02:34:59] [INFO ] Dead Transitions using invariants and state equation in 128 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 305/313 places, 280/288 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 508 ms. Remains : 305/313 places, 280/288 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p1), true, (NOT p1), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-07-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}]], initial=0, aps=[p0:(OR (EQ s213 0) (EQ s59 1)), p1:(OR (EQ s147 0) (EQ s171 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 310 ms.
Product exploration explored 100000 steps with 50000 reset in 291 ms.
Computed a total of 187 stabilizing places and 189 stable transitions
Graph (complete) has 722 edges and 305 vertex of which 304 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.18 ms
Computed a total of 187 stabilizing places and 189 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p1)
Knowledge based reduction with 8 factoid took 187 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-07-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-07-LTLCardinality-08 finished in 1426 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||F(!p1)) U (G((!p0||F(!p1)))||((!p0||F(!p1))&&X(G(!p2))))))))'
Support contains 6 out of 313 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 313/313 places, 288/288 transitions.
Graph (trivial) has 137 edges and 313 vertex of which 6 / 313 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 725 edges and 308 vertex of which 307 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 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 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 32 place count 306 transition count 250
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 62 place count 276 transition count 250
Performed 63 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 63 Pre rules applied. Total rules applied 62 place count 276 transition count 187
Deduced a syphon composed of 63 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 2 with 134 rules applied. Total rules applied 196 place count 205 transition count 187
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 200 place count 201 transition count 183
Iterating global reduction 2 with 4 rules applied. Total rules applied 204 place count 201 transition count 183
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Deduced a syphon composed of 73 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 2 with 149 rules applied. Total rules applied 353 place count 125 transition count 110
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
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 355 place count 124 transition count 112
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 356 place count 123 transition count 111
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 357 place count 122 transition count 111
Applied a total of 357 rules in 66 ms. Remains 122 /313 variables (removed 191) and now considering 111/288 (removed 177) transitions.
// Phase 1: matrix 111 rows 122 cols
[2023-03-11 02:35:00] [INFO ] Computed 49 place invariants in 2 ms
[2023-03-11 02:35:00] [INFO ] Implicit Places using invariants in 102 ms returned [0, 1, 9, 36, 37, 38, 39, 40, 41, 42]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 104 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 112/313 places, 111/288 transitions.
Applied a total of 0 rules in 3 ms. Remains 112 /112 variables (removed 0) and now considering 111/111 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 174 ms. Remains : 112/313 places, 111/288 transitions.
Stuttering acceptance computed with spot in 95 ms :[(AND p0 p1), (AND p0 p1), (AND p0 p1 p2)]
Running random walk in product with property : BusinessProcesses-PT-07-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 p1), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={1} source=1 dest: 2}], [{ cond=(AND p0 p1 p2), acceptance={0, 1} source=2 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p1 p2), acceptance={1} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s96 0) (EQ s71 1)), p1:(OR (EQ s81 0) (EQ s10 1)), p2:(OR (EQ s58 0) (EQ s61 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-07-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-07-LTLCardinality-10 finished in 292 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 313 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 313/313 places, 288/288 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 306 transition count 281
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 306 transition count 281
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 303 transition count 278
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 303 transition count 278
Applied a total of 20 rules in 15 ms. Remains 303 /313 variables (removed 10) and now considering 278/288 (removed 10) transitions.
// Phase 1: matrix 278 rows 303 cols
[2023-03-11 02:35:00] [INFO ] Computed 61 place invariants in 3 ms
[2023-03-11 02:35:01] [INFO ] Implicit Places using invariants in 177 ms returned []
[2023-03-11 02:35:01] [INFO ] Invariant cache hit.
[2023-03-11 02:35:01] [INFO ] Implicit Places using invariants and state equation in 288 ms returned []
Implicit Place search using SMT with State Equation took 468 ms to find 0 implicit places.
[2023-03-11 02:35:01] [INFO ] Invariant cache hit.
[2023-03-11 02:35:01] [INFO ] Dead Transitions using invariants and state equation in 140 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 303/313 places, 278/288 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 625 ms. Remains : 303/313 places, 278/288 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-07-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s15 0) (EQ s276 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 178 ms.
Product exploration explored 100000 steps with 50000 reset in 212 ms.
Computed a total of 186 stabilizing places and 188 stable transitions
Graph (complete) has 719 edges and 303 vertex of which 302 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 186 stabilizing places and 188 stable transitions
Detected a total of 186/303 stabilizing places and 188/278 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 4 factoid took 75 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-07-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-07-LTLCardinality-12 finished in 1170 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(G(p0))))'
Support contains 2 out of 313 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 313/313 places, 288/288 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 306 transition count 281
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 306 transition count 281
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 303 transition count 278
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 303 transition count 278
Applied a total of 20 rules in 10 ms. Remains 303 /313 variables (removed 10) and now considering 278/288 (removed 10) transitions.
[2023-03-11 02:35:02] [INFO ] Invariant cache hit.
[2023-03-11 02:35:02] [INFO ] Implicit Places using invariants in 126 ms returned []
[2023-03-11 02:35:02] [INFO ] Invariant cache hit.
[2023-03-11 02:35:02] [INFO ] Implicit Places using invariants and state equation in 199 ms returned []
Implicit Place search using SMT with State Equation took 326 ms to find 0 implicit places.
[2023-03-11 02:35:02] [INFO ] Invariant cache hit.
[2023-03-11 02:35:02] [INFO ] Dead Transitions using invariants and state equation in 136 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 303/313 places, 278/288 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 485 ms. Remains : 303/313 places, 278/288 transitions.
Stuttering acceptance computed with spot in 87 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-07-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (EQ s121 0) (EQ s285 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2640 steps with 28 reset in 8 ms.
FORMULA BusinessProcesses-PT-07-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-07-LTLCardinality-13 finished in 593 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)))'
Support contains 2 out of 313 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 313/313 places, 288/288 transitions.
Graph (trivial) has 141 edges and 313 vertex of which 6 / 313 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 725 edges and 308 vertex of which 307 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 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 34 place count 306 transition count 248
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 66 place count 274 transition count 248
Performed 63 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 63 Pre rules applied. Total rules applied 66 place count 274 transition count 185
Deduced a syphon composed of 63 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 135 rules applied. Total rules applied 201 place count 202 transition count 185
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 206 place count 197 transition count 180
Iterating global reduction 2 with 5 rules applied. Total rules applied 211 place count 197 transition count 180
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 211 place count 197 transition count 178
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 215 place count 195 transition count 178
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Deduced a syphon composed of 73 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 2 with 149 rules applied. Total rules applied 364 place count 119 transition count 105
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
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 366 place count 118 transition count 108
Applied a total of 366 rules in 29 ms. Remains 118 /313 variables (removed 195) and now considering 108/288 (removed 180) transitions.
// Phase 1: matrix 108 rows 118 cols
[2023-03-11 02:35:02] [INFO ] Computed 49 place invariants in 4 ms
[2023-03-11 02:35:02] [INFO ] Implicit Places using invariants in 106 ms returned [1, 2, 10, 35, 36, 37, 38, 39, 40, 41]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 108 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 108/313 places, 108/288 transitions.
Applied a total of 0 rules in 3 ms. Remains 108 /108 variables (removed 0) and now considering 108/108 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 140 ms. Remains : 108/313 places, 108/288 transitions.
Stuttering acceptance computed with spot in 46 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-07-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s76 0) (EQ s35 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 16750 reset in 232 ms.
Product exploration explored 100000 steps with 16700 reset in 175 ms.
Computed a total of 68 stabilizing places and 82 stable transitions
Computed a total of 68 stabilizing places and 82 stable transitions
Detected a total of 68/108 stabilizing places and 82/108 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 : []
Knowledge based reduction with 4 factoid took 229 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 76 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 1848 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 1) seen :0
Finished Best-First random walk after 1540 steps, including 103 resets, run visited all 1 properties in 4 ms. (steps per millisecond=385 )
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 149 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 82 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 108/108 transitions.
Applied a total of 0 rules in 6 ms. Remains 108 /108 variables (removed 0) and now considering 108/108 (removed 0) transitions.
// Phase 1: matrix 108 rows 108 cols
[2023-03-11 02:35:03] [INFO ] Computed 39 place invariants in 1 ms
[2023-03-11 02:35:03] [INFO ] Implicit Places using invariants in 71 ms returned []
[2023-03-11 02:35:03] [INFO ] Invariant cache hit.
[2023-03-11 02:35:04] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-11 02:35:04] [INFO ] Implicit Places using invariants and state equation in 151 ms returned [10, 56, 58, 64, 66]
Discarding 5 places :
Implicit Place search using SMT with State Equation took 224 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 103/108 places, 108/108 transitions.
Graph (complete) has 392 edges and 103 vertex of which 94 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
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 94 transition count 103
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 93 transition count 103
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 13 place count 83 transition count 65
Iterating global reduction 2 with 10 rules applied. Total rules applied 23 place count 83 transition count 65
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 24 place count 82 transition count 64
Iterating global reduction 2 with 1 rules applied. Total rules applied 25 place count 82 transition count 64
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 27 place count 81 transition count 63
Applied a total of 27 rules in 12 ms. Remains 81 /103 variables (removed 22) and now considering 63/108 (removed 45) transitions.
// Phase 1: matrix 63 rows 81 cols
[2023-03-11 02:35:04] [INFO ] Computed 29 place invariants in 1 ms
[2023-03-11 02:35:04] [INFO ] Implicit Places using invariants in 78 ms returned [10, 11, 12]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 79 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 78/108 places, 63/108 transitions.
Applied a total of 0 rules in 4 ms. Remains 78 /78 variables (removed 0) and now considering 63/63 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 325 ms. Remains : 78/108 places, 63/108 transitions.
Computed a total of 38 stabilizing places and 37 stable transitions
Computed a total of 38 stabilizing places and 37 stable transitions
Detected a total of 38/78 stabilizing places and 37/63 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 : []
Knowledge based reduction with 4 factoid took 137 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 64 ms :[(NOT p0), (NOT p0)]
Finished random walk after 2365 steps, including 449 resets, run visited all 1 properties in 5 ms. (steps per millisecond=473 )
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 104 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 61 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 17172 reset in 139 ms.
Product exploration explored 100000 steps with 17062 reset in 145 ms.
Support contains 2 out of 78 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 78/78 places, 63/63 transitions.
Applied a total of 0 rules in 4 ms. Remains 78 /78 variables (removed 0) and now considering 63/63 (removed 0) transitions.
// Phase 1: matrix 63 rows 78 cols
[2023-03-11 02:35:05] [INFO ] Computed 26 place invariants in 5 ms
[2023-03-11 02:35:05] [INFO ] Implicit Places using invariants in 54 ms returned []
[2023-03-11 02:35:05] [INFO ] Invariant cache hit.
[2023-03-11 02:35:05] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-11 02:35:05] [INFO ] Implicit Places using invariants and state equation in 72 ms returned [32, 35, 37]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 129 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 75/78 places, 63/63 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 75 transition count 60
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 72 transition count 60
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 7 place count 71 transition count 59
Iterating global reduction 2 with 1 rules applied. Total rules applied 8 place count 71 transition count 59
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 23 rules applied. Total rules applied 31 place count 57 transition count 50
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 34 place count 54 transition count 47
Iterating global reduction 2 with 3 rules applied. Total rules applied 37 place count 54 transition count 47
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 38 place count 54 transition count 46
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 3 with 2 rules applied. Total rules applied 40 place count 53 transition count 45
Applied a total of 40 rules in 7 ms. Remains 53 /75 variables (removed 22) and now considering 45/63 (removed 18) transitions.
// Phase 1: matrix 45 rows 53 cols
[2023-03-11 02:35:05] [INFO ] Computed 18 place invariants in 0 ms
[2023-03-11 02:35:05] [INFO ] Implicit Places using invariants in 78 ms returned []
[2023-03-11 02:35:05] [INFO ] Invariant cache hit.
[2023-03-11 02:35:05] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-11 02:35:05] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 53/78 places, 45/63 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 261 ms. Remains : 53/78 places, 45/63 transitions.
Treatment of property BusinessProcesses-PT-07-LTLCardinality-14 finished in 2756 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)))'
[2023-03-11 02:35:05] [INFO ] Flatten gal took : 38 ms
[2023-03-11 02:35:05] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2023-03-11 02:35:05] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 313 places, 288 transitions and 965 arcs took 5 ms.
Total runtime 12404 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT BusinessProcesses-PT-07
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/372
LTLCardinality

FORMULA BusinessProcesses-PT-07-LTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678502107941

--------------------
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/372/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/372/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/372/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-07-LTLCardinality-14
lola: time limit : 3600 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for BusinessProcesses-PT-07-LTLCardinality-14
lola: result : true
lola: markings : 703489
lola: fired transitions : 1316738
lola: time used : 2.000000
lola: memory pages used : 5
lola: Portfolio finished: no open formulas

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


Time elapsed: 2 secs. Pages in use: 5

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

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