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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 7.1K Feb 25 16:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Feb 25 16:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 25 16:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 25 16:45 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.6K Feb 25 15:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.4K Feb 25 16:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K Feb 25 16:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 25 16:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 25 16:47 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 148K 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-13-LTLCardinality-00
FORMULA_NAME BusinessProcesses-PT-13-LTLCardinality-01
FORMULA_NAME BusinessProcesses-PT-13-LTLCardinality-02
FORMULA_NAME BusinessProcesses-PT-13-LTLCardinality-03
FORMULA_NAME BusinessProcesses-PT-13-LTLCardinality-04
FORMULA_NAME BusinessProcesses-PT-13-LTLCardinality-05
FORMULA_NAME BusinessProcesses-PT-13-LTLCardinality-06
FORMULA_NAME BusinessProcesses-PT-13-LTLCardinality-07
FORMULA_NAME BusinessProcesses-PT-13-LTLCardinality-08
FORMULA_NAME BusinessProcesses-PT-13-LTLCardinality-09
FORMULA_NAME BusinessProcesses-PT-13-LTLCardinality-10
FORMULA_NAME BusinessProcesses-PT-13-LTLCardinality-11
FORMULA_NAME BusinessProcesses-PT-13-LTLCardinality-12
FORMULA_NAME BusinessProcesses-PT-13-LTLCardinality-13
FORMULA_NAME BusinessProcesses-PT-13-LTLCardinality-14
FORMULA_NAME BusinessProcesses-PT-13-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678503104366

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-13
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-11 02:51:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-11 02:51:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 02:51:47] [INFO ] Load time of PNML (sax parser for PT used): 116 ms
[2023-03-11 02:51:47] [INFO ] Transformed 593 places.
[2023-03-11 02:51:47] [INFO ] Transformed 536 transitions.
[2023-03-11 02:51:47] [INFO ] Found NUPN structural information;
[2023-03-11 02:51:47] [INFO ] Parsed PT model containing 593 places and 536 transitions and 1582 arcs in 287 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 8 places in 8 ms
Reduce places removed 8 places and 8 transitions.
FORMULA BusinessProcesses-PT-13-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-13-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-13-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-13-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-13-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-13-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-13-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-13-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-13-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 14 out of 585 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 585/585 places, 528/528 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 580 transition count 528
Discarding 87 places :
Symmetric choice reduction at 1 with 87 rule applications. Total rules 92 place count 493 transition count 441
Iterating global reduction 1 with 87 rules applied. Total rules applied 179 place count 493 transition count 441
Discarding 43 places :
Symmetric choice reduction at 1 with 43 rule applications. Total rules 222 place count 450 transition count 398
Iterating global reduction 1 with 43 rules applied. Total rules applied 265 place count 450 transition count 398
Applied a total of 265 rules in 192 ms. Remains 450 /585 variables (removed 135) and now considering 398/528 (removed 130) transitions.
// Phase 1: matrix 398 rows 450 cols
[2023-03-11 02:51:47] [INFO ] Computed 90 place invariants in 30 ms
[2023-03-11 02:51:48] [INFO ] Implicit Places using invariants in 468 ms returned []
[2023-03-11 02:51:48] [INFO ] Invariant cache hit.
[2023-03-11 02:51:48] [INFO ] Implicit Places using invariants and state equation in 656 ms returned []
Implicit Place search using SMT with State Equation took 1228 ms to find 0 implicit places.
[2023-03-11 02:51:48] [INFO ] Invariant cache hit.
[2023-03-11 02:51:49] [INFO ] Dead Transitions using invariants and state equation in 268 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 450/585 places, 398/528 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1702 ms. Remains : 450/585 places, 398/528 transitions.
Support contains 14 out of 450 places after structural reductions.
[2023-03-11 02:51:49] [INFO ] Flatten gal took : 120 ms
[2023-03-11 02:51:49] [INFO ] Flatten gal took : 37 ms
[2023-03-11 02:51:49] [INFO ] Input system was already deterministic with 398 transitions.
Incomplete random walk after 10000 steps, including 70 resets, run finished after 448 ms. (steps per millisecond=22 ) properties (out of 10) seen :4
Incomplete Best-First random walk after 10000 steps, including 10 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-11 02:51:50] [INFO ] Invariant cache hit.
[2023-03-11 02:51:50] [INFO ] After 169ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-11 02:51:50] [INFO ] [Nat]Absence check using 52 positive place invariants in 14 ms returned sat
[2023-03-11 02:51:50] [INFO ] [Nat]Absence check using 52 positive and 38 generalized place invariants in 36 ms returned sat
[2023-03-11 02:51:51] [INFO ] After 449ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-11 02:51:51] [INFO ] Deduced a trap composed of 8 places in 143 ms of which 23 ms to minimize.
[2023-03-11 02:51:51] [INFO ] Deduced a trap composed of 25 places in 132 ms of which 1 ms to minimize.
[2023-03-11 02:51:51] [INFO ] Deduced a trap composed of 12 places in 107 ms of which 1 ms to minimize.
[2023-03-11 02:51:51] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 494 ms
[2023-03-11 02:51:51] [INFO ] Deduced a trap composed of 15 places in 181 ms of which 2 ms to minimize.
[2023-03-11 02:51:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 234 ms
[2023-03-11 02:51:52] [INFO ] After 1408ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 128 ms.
[2023-03-11 02:51:52] [INFO ] After 1833ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 30 ms.
Support contains 9 out of 450 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 450/450 places, 398/398 transitions.
Graph (trivial) has 202 edges and 450 vertex of which 6 / 450 are part of one of the 1 SCC in 6 ms
Free SCC test removed 5 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1022 edges and 445 vertex of which 444 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 44 rules applied. Total rules applied 46 place count 444 transition count 346
Reduce places removed 44 places and 0 transitions.
Iterating post reduction 1 with 44 rules applied. Total rules applied 90 place count 400 transition count 346
Performed 94 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 94 Pre rules applied. Total rules applied 90 place count 400 transition count 252
Deduced a syphon composed of 94 places in 0 ms
Ensure Unique test removed 16 places
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 2 with 204 rules applied. Total rules applied 294 place count 290 transition count 252
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 296 place count 288 transition count 250
Iterating global reduction 2 with 2 rules applied. Total rules applied 298 place count 288 transition count 250
Performed 116 Post agglomeration using F-continuation condition.Transition count delta: 116
Deduced a syphon composed of 116 places in 3 ms
Ensure Unique test removed 4 places
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 2 with 236 rules applied. Total rules applied 534 place count 168 transition count 134
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 9 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 536 place count 167 transition count 138
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 538 place count 167 transition count 136
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 540 place count 165 transition count 136
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 545 place count 165 transition count 136
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 546 place count 164 transition count 135
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 547 place count 163 transition count 135
Applied a total of 547 rules in 170 ms. Remains 163 /450 variables (removed 287) and now considering 135/398 (removed 263) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 170 ms. Remains : 163/450 places, 135/398 transitions.
Incomplete random walk after 10000 steps, including 390 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 5) seen :4
Finished Best-First random walk after 426 steps, including 5 resets, run visited all 1 properties in 2 ms. (steps per millisecond=213 )
FORMULA BusinessProcesses-PT-13-LTLCardinality-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 120 stabilizing places and 113 stable transitions
Graph (complete) has 1029 edges and 450 vertex of which 449 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' '!(X(X(X((F(p0)&&G(p1))))))'
Support contains 3 out of 450 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 450/450 places, 398/398 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 447 transition count 395
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 447 transition count 395
Applied a total of 6 rules in 48 ms. Remains 447 /450 variables (removed 3) and now considering 395/398 (removed 3) transitions.
// Phase 1: matrix 395 rows 447 cols
[2023-03-11 02:51:52] [INFO ] Computed 90 place invariants in 8 ms
[2023-03-11 02:51:53] [INFO ] Implicit Places using invariants in 282 ms returned []
[2023-03-11 02:51:53] [INFO ] Invariant cache hit.
[2023-03-11 02:51:53] [INFO ] Implicit Places using invariants and state equation in 501 ms returned []
Implicit Place search using SMT with State Equation took 790 ms to find 0 implicit places.
[2023-03-11 02:51:53] [INFO ] Invariant cache hit.
[2023-03-11 02:51:53] [INFO ] Dead Transitions using invariants and state equation in 233 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 447/450 places, 395/398 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1075 ms. Remains : 447/450 places, 395/398 transitions.
Stuttering acceptance computed with spot in 464 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-13-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND p0 p1), acceptance={0} source=5 dest: 0}, { cond=(NOT p1), acceptance={0} source=5 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={0} source=5 dest: 5}]], initial=3, aps=[p1:(OR (EQ s283 0) (EQ s344 1)), p0:(EQ s367 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 198 steps with 0 reset in 5 ms.
FORMULA BusinessProcesses-PT-13-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-13-LTLCardinality-00 finished in 1634 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 450 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 450/450 places, 398/398 transitions.
Graph (trivial) has 205 edges and 450 vertex of which 6 / 450 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 1023 edges and 445 vertex of which 444 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 44 rules applied. Total rules applied 46 place count 443 transition count 346
Reduce places removed 44 places and 0 transitions.
Iterating post reduction 1 with 44 rules applied. Total rules applied 90 place count 399 transition count 346
Performed 95 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 95 Pre rules applied. Total rules applied 90 place count 399 transition count 251
Deduced a syphon composed of 95 places in 1 ms
Ensure Unique test removed 17 places
Reduce places removed 112 places and 0 transitions.
Iterating global reduction 2 with 207 rules applied. Total rules applied 297 place count 287 transition count 251
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 300 place count 284 transition count 248
Iterating global reduction 2 with 3 rules applied. Total rules applied 303 place count 284 transition count 248
Performed 119 Post agglomeration using F-continuation condition.Transition count delta: 119
Deduced a syphon composed of 119 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 123 places and 0 transitions.
Iterating global reduction 2 with 242 rules applied. Total rules applied 545 place count 161 transition count 129
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 547 place count 160 transition count 133
Applied a total of 547 rules in 52 ms. Remains 160 /450 variables (removed 290) and now considering 133/398 (removed 265) transitions.
// Phase 1: matrix 133 rows 160 cols
[2023-03-11 02:51:54] [INFO ] Computed 69 place invariants in 3 ms
[2023-03-11 02:51:54] [INFO ] Implicit Places using invariants in 112 ms returned [1, 2, 3, 4, 5, 6, 13, 14, 18, 19, 20, 21, 22, 23, 46, 47, 48, 49, 50]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 115 ms to find 19 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 141/450 places, 133/398 transitions.
Applied a total of 0 rules in 8 ms. Remains 141 /141 variables (removed 0) and now considering 133/133 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 175 ms. Remains : 141/450 places, 133/398 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-13-LTLCardinality-02 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 (NEQ s59 0) (NEQ s43 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-13-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-13-LTLCardinality-02 finished in 231 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 1 out of 450 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 450/450 places, 398/398 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 446 transition count 394
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 446 transition count 394
Applied a total of 8 rules in 21 ms. Remains 446 /450 variables (removed 4) and now considering 394/398 (removed 4) transitions.
// Phase 1: matrix 394 rows 446 cols
[2023-03-11 02:51:54] [INFO ] Computed 90 place invariants in 6 ms
[2023-03-11 02:51:54] [INFO ] Implicit Places using invariants in 176 ms returned []
[2023-03-11 02:51:54] [INFO ] Invariant cache hit.
[2023-03-11 02:51:55] [INFO ] Implicit Places using invariants and state equation in 470 ms returned []
Implicit Place search using SMT with State Equation took 670 ms to find 0 implicit places.
[2023-03-11 02:51:55] [INFO ] Invariant cache hit.
[2023-03-11 02:51:55] [INFO ] Dead Transitions using invariants and state equation in 328 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 446/450 places, 394/398 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1023 ms. Remains : 446/450 places, 394/398 transitions.
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : BusinessProcesses-PT-13-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s349 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-13-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-13-LTLCardinality-05 finished in 1156 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 1 out of 450 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 450/450 places, 398/398 transitions.
Graph (trivial) has 208 edges and 450 vertex of which 6 / 450 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 1023 edges and 445 vertex of which 444 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 47 place count 443 transition count 345
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 1 with 45 rules applied. Total rules applied 92 place count 398 transition count 345
Performed 97 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 97 Pre rules applied. Total rules applied 92 place count 398 transition count 248
Deduced a syphon composed of 97 places in 0 ms
Ensure Unique test removed 17 places
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 2 with 211 rules applied. Total rules applied 303 place count 284 transition count 248
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 307 place count 280 transition count 244
Iterating global reduction 2 with 4 rules applied. Total rules applied 311 place count 280 transition count 244
Performed 117 Post agglomeration using F-continuation condition.Transition count delta: 117
Deduced a syphon composed of 117 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 121 places and 0 transitions.
Iterating global reduction 2 with 238 rules applied. Total rules applied 549 place count 159 transition count 127
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 551 place count 158 transition count 131
Partial Post-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 557 place count 158 transition count 131
Applied a total of 557 rules in 88 ms. Remains 158 /450 variables (removed 292) and now considering 131/398 (removed 267) transitions.
// Phase 1: matrix 131 rows 158 cols
[2023-03-11 02:51:55] [INFO ] Computed 69 place invariants in 1 ms
[2023-03-11 02:51:56] [INFO ] Implicit Places using invariants in 144 ms returned [1, 2, 3, 4, 5, 6, 13, 14, 18, 19, 20, 21, 22, 23, 46, 47, 48, 49, 50]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 145 ms to find 19 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 139/450 places, 131/398 transitions.
Applied a total of 0 rules in 5 ms. Remains 139 /139 variables (removed 0) and now considering 131/131 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 238 ms. Remains : 139/450 places, 131/398 transitions.
Stuttering acceptance computed with spot in 108 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-13-LTLCardinality-08 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:(NEQ s12 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 21949 reset in 411 ms.
Product exploration explored 100000 steps with 21855 reset in 446 ms.
Computed a total of 12 stabilizing places and 10 stable transitions
Computed a total of 12 stabilizing places and 10 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 398 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 106 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2539 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 756 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Finished probabilistic random walk after 5980 steps, run visited all 1 properties in 48 ms. (steps per millisecond=124 )
Probabilistic random walk after 5980 steps, saw 1820 distinct states, run finished after 48 ms. (steps per millisecond=124 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 231 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 86 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 139 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 139/139 places, 131/131 transitions.
Applied a total of 0 rules in 6 ms. Remains 139 /139 variables (removed 0) and now considering 131/131 (removed 0) transitions.
// Phase 1: matrix 131 rows 139 cols
[2023-03-11 02:51:58] [INFO ] Computed 50 place invariants in 2 ms
[2023-03-11 02:51:58] [INFO ] Implicit Places using invariants in 154 ms returned []
[2023-03-11 02:51:58] [INFO ] Invariant cache hit.
[2023-03-11 02:51:58] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-11 02:51:58] [INFO ] Implicit Places using invariants and state equation in 260 ms returned [1, 3, 7, 10, 33, 34, 35, 37, 39, 41, 43, 45, 47, 49, 51, 53, 55, 59, 61, 63, 65, 67, 69, 71, 73, 81, 83, 85, 87, 89]
Discarding 30 places :
Implicit Place search using SMT with State Equation took 417 ms to find 30 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 109/139 places, 131/131 transitions.
Graph (complete) has 362 edges and 109 vertex of which 98 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.1 ms
Discarding 11 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 98 transition count 117
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 19 place count 89 transition count 117
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 31 place count 77 transition count 79
Iterating global reduction 2 with 12 rules applied. Total rules applied 43 place count 77 transition count 79
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 45 place count 77 transition count 77
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 47 place count 75 transition count 77
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 48 place count 74 transition count 76
Iterating global reduction 4 with 1 rules applied. Total rules applied 49 place count 74 transition count 76
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 17 rules applied. Total rules applied 66 place count 65 transition count 68
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 68 place count 64 transition count 67
Applied a total of 68 rules in 29 ms. Remains 64 /109 variables (removed 45) and now considering 67/131 (removed 64) transitions.
// Phase 1: matrix 67 rows 64 cols
[2023-03-11 02:51:58] [INFO ] Computed 15 place invariants in 1 ms
[2023-03-11 02:51:58] [INFO ] Implicit Places using invariants in 64 ms returned [5, 7]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 66 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 62/139 places, 67/131 transitions.
Applied a total of 0 rules in 3 ms. Remains 62 /62 variables (removed 0) and now considering 67/67 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 534 ms. Remains : 62/139 places, 67/131 transitions.
Computed a total of 4 stabilizing places and 5 stable transitions
Computed a total of 4 stabilizing places and 5 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 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 87 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2577 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 751 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 925 steps, run visited all 1 properties in 8 ms. (steps per millisecond=115 )
Probabilistic random walk after 925 steps, saw 365 distinct states, run finished after 8 ms. (steps per millisecond=115 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 224 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 114 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 154 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22277 reset in 121 ms.
Product exploration explored 100000 steps with 22494 reset in 113 ms.
Support contains 1 out of 62 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 62/62 places, 67/67 transitions.
Applied a total of 0 rules in 3 ms. Remains 62 /62 variables (removed 0) and now considering 67/67 (removed 0) transitions.
// Phase 1: matrix 67 rows 62 cols
[2023-03-11 02:51:59] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-11 02:51:59] [INFO ] Implicit Places using invariants in 74 ms returned []
[2023-03-11 02:51:59] [INFO ] Invariant cache hit.
[2023-03-11 02:51:59] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-11 02:52:00] [INFO ] Implicit Places using invariants and state equation in 106 ms returned [25, 29]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 183 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 60/62 places, 67/67 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 60 transition count 65
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 58 transition count 65
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 18 place count 50 transition count 59
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 20 place count 49 transition count 58
Applied a total of 20 rules in 7 ms. Remains 49 /60 variables (removed 11) and now considering 58/67 (removed 9) transitions.
// Phase 1: matrix 58 rows 49 cols
[2023-03-11 02:52:00] [INFO ] Computed 9 place invariants in 0 ms
[2023-03-11 02:52:00] [INFO ] Implicit Places using invariants in 61 ms returned [42, 43, 48]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 63 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 46/62 places, 58/67 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 44 transition count 56
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 44 transition count 56
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 42 transition count 52
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 42 transition count 52
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 0 with 2 rules applied. Total rules applied 10 place count 41 transition count 51
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 40 transition count 49
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 40 transition count 49
Applied a total of 12 rules in 5 ms. Remains 40 /46 variables (removed 6) and now considering 49/58 (removed 9) transitions.
// Phase 1: matrix 49 rows 40 cols
[2023-03-11 02:52:00] [INFO ] Computed 6 place invariants in 0 ms
[2023-03-11 02:52:00] [INFO ] Implicit Places using invariants in 78 ms returned [37]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 80 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 39/62 places, 49/67 transitions.
Applied a total of 0 rules in 2 ms. Remains 39 /39 variables (removed 0) and now considering 49/49 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 4 iterations and 344 ms. Remains : 39/62 places, 49/67 transitions.
Treatment of property BusinessProcesses-PT-13-LTLCardinality-08 finished in 4450 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((X(p1)||p0)))'
Support contains 3 out of 450 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 450/450 places, 398/398 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 446 transition count 394
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 446 transition count 394
Applied a total of 8 rules in 37 ms. Remains 446 /450 variables (removed 4) and now considering 394/398 (removed 4) transitions.
// Phase 1: matrix 394 rows 446 cols
[2023-03-11 02:52:00] [INFO ] Computed 90 place invariants in 4 ms
[2023-03-11 02:52:00] [INFO ] Implicit Places using invariants in 245 ms returned []
[2023-03-11 02:52:00] [INFO ] Invariant cache hit.
[2023-03-11 02:52:01] [INFO ] Implicit Places using invariants and state equation in 539 ms returned []
Implicit Place search using SMT with State Equation took 791 ms to find 0 implicit places.
[2023-03-11 02:52:01] [INFO ] Invariant cache hit.
[2023-03-11 02:52:01] [INFO ] Dead Transitions using invariants and state equation in 286 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 446/450 places, 394/398 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1115 ms. Remains : 446/450 places, 394/398 transitions.
Stuttering acceptance computed with spot in 86 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-13-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s373 1) (EQ s139 0) (EQ s445 1)), p1:(AND (EQ s445 0) (EQ s139 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 718 reset in 331 ms.
Product exploration explored 100000 steps with 716 reset in 248 ms.
Computed a total of 118 stabilizing places and 111 stable transitions
Graph (complete) has 1021 edges and 446 vertex of which 445 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 118 stabilizing places and 111 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X p0), (X (X (NOT p1))), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 589 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 121 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 71 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 925636 steps, run timeout after 3001 ms. (steps per millisecond=308 ) properties seen :{0=1, 1=1, 3=1}
Probabilistic random walk after 925636 steps, saw 137768 distinct states, run finished after 3006 ms. (steps per millisecond=307 ) properties seen :3
Running SMT prover for 1 properties.
[2023-03-11 02:52:06] [INFO ] Invariant cache hit.
[2023-03-11 02:52:06] [INFO ] [Real]Absence check using 52 positive place invariants in 39 ms returned sat
[2023-03-11 02:52:06] [INFO ] [Real]Absence check using 52 positive and 38 generalized place invariants in 21 ms returned sat
[2023-03-11 02:52:06] [INFO ] After 217ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X p0), (X (X (NOT p1))), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (X (X p0)), (G (NOT (AND p1 p0)))]
False Knowledge obtained : [(F (AND p1 (NOT p0))), (F (NOT p0)), (F p1)]
Knowledge based reduction with 11 factoid took 899 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 123 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 137 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 3 out of 446 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 446/446 places, 394/394 transitions.
Applied a total of 0 rules in 49 ms. Remains 446 /446 variables (removed 0) and now considering 394/394 (removed 0) transitions.
[2023-03-11 02:52:07] [INFO ] Invariant cache hit.
[2023-03-11 02:52:07] [INFO ] Implicit Places using invariants in 297 ms returned []
[2023-03-11 02:52:07] [INFO ] Invariant cache hit.
[2023-03-11 02:52:08] [INFO ] Implicit Places using invariants and state equation in 697 ms returned []
Implicit Place search using SMT with State Equation took 996 ms to find 0 implicit places.
[2023-03-11 02:52:08] [INFO ] Invariant cache hit.
[2023-03-11 02:52:08] [INFO ] Dead Transitions using invariants and state equation in 233 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1293 ms. Remains : 446/446 places, 394/394 transitions.
Computed a total of 118 stabilizing places and 111 stable transitions
Graph (complete) has 1021 edges and 446 vertex of which 445 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.20 ms
Computed a total of 118 stabilizing places and 111 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X p0), (X (X (NOT p1))), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 432 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 124 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 70 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 2) seen :0
Finished probabilistic random walk after 22429 steps, run visited all 2 properties in 197 ms. (steps per millisecond=113 )
Probabilistic random walk after 22429 steps, saw 9580 distinct states, run finished after 198 ms. (steps per millisecond=113 ) properties seen :2
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X p0), (X (X (NOT p1))), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F p1)]
Knowledge based reduction with 6 factoid took 539 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 142 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 134 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 115 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 711 reset in 488 ms.
Product exploration explored 100000 steps with 720 reset in 462 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 109 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 3 out of 446 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 446/446 places, 394/394 transitions.
Graph (trivial) has 202 edges and 446 vertex of which 6 / 446 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 1015 edges and 441 vertex of which 440 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
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 44 rules applied. Total rules applied 46 place count 440 transition count 387
Performed 67 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 67 Pre rules applied. Total rules applied 46 place count 440 transition count 434
Deduced a syphon composed of 111 places in 0 ms
Iterating global reduction 1 with 67 rules applied. Total rules applied 113 place count 440 transition count 434
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 127 place count 426 transition count 408
Deduced a syphon composed of 97 places in 1 ms
Iterating global reduction 1 with 14 rules applied. Total rules applied 141 place count 426 transition count 408
Performed 146 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 243 places in 0 ms
Iterating global reduction 1 with 146 rules applied. Total rules applied 287 place count 426 transition count 408
Discarding 36 places :
Symmetric choice reduction at 1 with 36 rule applications. Total rules 323 place count 390 transition count 372
Deduced a syphon composed of 207 places in 0 ms
Iterating global reduction 1 with 36 rules applied. Total rules applied 359 place count 390 transition count 372
Deduced a syphon composed of 207 places in 1 ms
Applied a total of 359 rules in 118 ms. Remains 390 /446 variables (removed 56) and now considering 372/394 (removed 22) transitions.
[2023-03-11 02:52:12] [INFO ] Redundant transitions in 42 ms returned []
// Phase 1: matrix 372 rows 390 cols
[2023-03-11 02:52:12] [INFO ] Computed 90 place invariants in 5 ms
[2023-03-11 02:52:12] [INFO ] Dead Transitions using invariants and state equation in 327 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 390/446 places, 372/394 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 519 ms. Remains : 390/446 places, 372/394 transitions.
Support contains 3 out of 446 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 446/446 places, 394/394 transitions.
Applied a total of 0 rules in 16 ms. Remains 446 /446 variables (removed 0) and now considering 394/394 (removed 0) transitions.
// Phase 1: matrix 394 rows 446 cols
[2023-03-11 02:52:12] [INFO ] Computed 90 place invariants in 4 ms
[2023-03-11 02:52:12] [INFO ] Implicit Places using invariants in 243 ms returned []
[2023-03-11 02:52:12] [INFO ] Invariant cache hit.
[2023-03-11 02:52:13] [INFO ] Implicit Places using invariants and state equation in 617 ms returned []
Implicit Place search using SMT with State Equation took 864 ms to find 0 implicit places.
[2023-03-11 02:52:13] [INFO ] Invariant cache hit.
[2023-03-11 02:52:13] [INFO ] Dead Transitions using invariants and state equation in 269 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1150 ms. Remains : 446/446 places, 394/394 transitions.
Treatment of property BusinessProcesses-PT-13-LTLCardinality-10 finished in 13596 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 (p1||G(p0))))'
Support contains 3 out of 450 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 450/450 places, 398/398 transitions.
Graph (trivial) has 205 edges and 450 vertex of which 6 / 450 are part of one of the 1 SCC in 16 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1023 edges and 445 vertex of which 444 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 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 44 rules applied. Total rules applied 46 place count 443 transition count 346
Reduce places removed 44 places and 0 transitions.
Iterating post reduction 1 with 44 rules applied. Total rules applied 90 place count 399 transition count 346
Performed 97 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 97 Pre rules applied. Total rules applied 90 place count 399 transition count 249
Deduced a syphon composed of 97 places in 0 ms
Ensure Unique test removed 17 places
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 2 with 211 rules applied. Total rules applied 301 place count 285 transition count 249
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 303 place count 283 transition count 247
Iterating global reduction 2 with 2 rules applied. Total rules applied 305 place count 283 transition count 247
Performed 117 Post agglomeration using F-continuation condition.Transition count delta: 117
Deduced a syphon composed of 117 places in 1 ms
Ensure Unique test removed 4 places
Reduce places removed 121 places and 0 transitions.
Iterating global reduction 2 with 238 rules applied. Total rules applied 543 place count 162 transition count 130
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 545 place count 161 transition count 134
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 546 place count 160 transition count 133
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 547 place count 159 transition count 133
Applied a total of 547 rules in 92 ms. Remains 159 /450 variables (removed 291) and now considering 133/398 (removed 265) transitions.
// Phase 1: matrix 133 rows 159 cols
[2023-03-11 02:52:13] [INFO ] Computed 68 place invariants in 1 ms
[2023-03-11 02:52:21] [INFO ] Implicit Places using invariants in 7928 ms returned [25, 48, 49, 50, 51]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 7945 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 154/450 places, 133/398 transitions.
Applied a total of 0 rules in 4 ms. Remains 154 /154 variables (removed 0) and now considering 133/133 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 8043 ms. Remains : 154/450 places, 133/398 transitions.
Stuttering acceptance computed with spot in 84 ms :[true, (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-13-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}]], initial=1, aps=[p1:(AND (NOT (OR (EQ s11 0) (EQ s114 1))) (NEQ s23 1)), p0:(NEQ s23 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-13-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-13-LTLCardinality-14 finished in 8145 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)))'
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((X(p1)||p0)))'
Found a Lengthening insensitive property : BusinessProcesses-PT-13-LTLCardinality-10
Stuttering acceptance computed with spot in 161 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 3 out of 450 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 450/450 places, 398/398 transitions.
Graph (trivial) has 206 edges and 450 vertex of which 6 / 450 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 1023 edges and 445 vertex of which 444 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 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 47 place count 443 transition count 345
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 1 with 45 rules applied. Total rules applied 92 place count 398 transition count 345
Performed 95 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 95 Pre rules applied. Total rules applied 92 place count 398 transition count 250
Deduced a syphon composed of 95 places in 1 ms
Ensure Unique test removed 16 places
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 2 with 206 rules applied. Total rules applied 298 place count 287 transition count 250
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 302 place count 283 transition count 246
Iterating global reduction 2 with 4 rules applied. Total rules applied 306 place count 283 transition count 246
Performed 116 Post agglomeration using F-continuation condition.Transition count delta: 116
Deduced a syphon composed of 116 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 2 with 236 rules applied. Total rules applied 542 place count 163 transition count 130
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 544 place count 162 transition count 134
Partial Post-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 550 place count 162 transition count 134
Applied a total of 550 rules in 73 ms. Remains 162 /450 variables (removed 288) and now considering 134/398 (removed 264) transitions.
// Phase 1: matrix 134 rows 162 cols
[2023-03-11 02:52:22] [INFO ] Computed 70 place invariants in 1 ms
[2023-03-11 02:52:22] [INFO ] Implicit Places using invariants in 154 ms returned [1, 2, 3, 4, 5, 6, 7, 14, 15, 19, 20, 21, 22, 23, 24, 48, 49, 50, 51, 52]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 158 ms to find 20 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 142/450 places, 134/398 transitions.
Applied a total of 0 rules in 4 ms. Remains 142 /142 variables (removed 0) and now considering 134/134 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 236 ms. Remains : 142/450 places, 134/398 transitions.
Running random walk in product with property : BusinessProcesses-PT-13-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s100 1) (EQ s11 0) (EQ s141 1)), p1:(AND (EQ s141 0) (EQ s11 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 21934 reset in 262 ms.
Product exploration explored 100000 steps with 21942 reset in 278 ms.
Computed a total of 12 stabilizing places and 10 stable transitions
Computed a total of 12 stabilizing places and 10 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X p0), (X (X (NOT p1))), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 576 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 103 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 2457 resets, run finished after 200 ms. (steps per millisecond=50 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 769 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 743 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 738 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 781 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 4) seen :0
Probably explored full state space saw : 12947 states, properties seen :3
Probabilistic random walk after 47480 steps, saw 12947 distinct states, run finished after 136 ms. (steps per millisecond=349 ) properties seen :3
Explored full state space saw : 12947 states, properties seen :0
Exhaustive walk after 47480 steps, saw 12947 distinct states, run finished after 68 ms. (steps per millisecond=698 ) properties seen :0
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X p0), (X (X (NOT p1))), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (X (X p0)), (G (NOT (AND p1 p0)))]
False Knowledge obtained : [(F (AND p1 (NOT p0))), (F (NOT p0)), (F p1)]
Knowledge based reduction with 11 factoid took 826 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 150 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 143 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 3 out of 142 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 142/142 places, 134/134 transitions.
Applied a total of 0 rules in 2 ms. Remains 142 /142 variables (removed 0) and now considering 134/134 (removed 0) transitions.
// Phase 1: matrix 134 rows 142 cols
[2023-03-11 02:52:25] [INFO ] Computed 50 place invariants in 3 ms
[2023-03-11 02:52:25] [INFO ] Implicit Places using invariants in 161 ms returned []
[2023-03-11 02:52:25] [INFO ] Invariant cache hit.
[2023-03-11 02:52:25] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-11 02:52:26] [INFO ] Implicit Places using invariants and state equation in 238 ms returned [1, 3, 7, 10, 34, 35, 36, 38, 40, 42, 44, 46, 48, 50, 52, 54, 56, 60, 62, 64, 66, 68, 70, 72, 74, 82, 84, 86, 88, 90]
Discarding 30 places :
Implicit Place search using SMT with State Equation took 401 ms to find 30 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 112/142 places, 134/134 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 108 transition count 128
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 108 transition count 128
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 107 transition count 127
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 107 transition count 127
Applied a total of 10 rules in 3 ms. Remains 107 /112 variables (removed 5) and now considering 127/134 (removed 7) transitions.
// Phase 1: matrix 127 rows 107 cols
[2023-03-11 02:52:26] [INFO ] Computed 22 place invariants in 1 ms
[2023-03-11 02:52:26] [INFO ] Implicit Places using invariants in 75 ms returned []
[2023-03-11 02:52:26] [INFO ] Invariant cache hit.
[2023-03-11 02:52:26] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-11 02:52:26] [INFO ] Implicit Places using invariants and state equation in 242 ms returned []
Implicit Place search using SMT with State Equation took 320 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 107/142 places, 127/134 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 728 ms. Remains : 107/142 places, 127/134 transitions.
Computed a total of 6 stabilizing places and 7 stable transitions
Graph (complete) has 352 edges and 107 vertex of which 96 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.1 ms
Computed a total of 6 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X p0), (X (X (NOT p1))), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 336 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 131 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 2509 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 774 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 784 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 2) seen :0
Finished probabilistic random walk after 4544 steps, run visited all 2 properties in 26 ms. (steps per millisecond=174 )
Probabilistic random walk after 4544 steps, saw 1383 distinct states, run finished after 26 ms. (steps per millisecond=174 ) properties seen :2
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X p0), (X (X (NOT p1))), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F p1)]
Knowledge based reduction with 6 factoid took 507 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 162 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 143 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 123 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 21767 reset in 127 ms.
Product exploration explored 100000 steps with 21882 reset in 133 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 179 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 3 out of 107 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 107/107 places, 127/127 transitions.
Graph (complete) has 352 edges and 107 vertex of which 96 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.0 ms
Discarding 11 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 96 transition count 122
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 21 place count 87 transition count 86
Deduced a syphon composed of 11 places in 0 ms
Iterating global reduction 1 with 9 rules applied. Total rules applied 30 place count 87 transition count 86
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 19 places in 0 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 38 place count 87 transition count 90
Deduced a syphon composed of 19 places in 0 ms
Applied a total of 38 rules in 8 ms. Remains 87 /107 variables (removed 20) and now considering 90/127 (removed 37) transitions.
[2023-03-11 02:52:28] [INFO ] Redundant transitions in 34 ms returned []
// Phase 1: matrix 90 rows 87 cols
[2023-03-11 02:52:28] [INFO ] Computed 16 place invariants in 5 ms
[2023-03-11 02:52:28] [INFO ] Dead Transitions using invariants and state equation in 129 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 87/107 places, 90/127 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 217 ms. Remains : 87/107 places, 90/127 transitions.
Support contains 3 out of 107 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 107/107 places, 127/127 transitions.
Applied a total of 0 rules in 1 ms. Remains 107 /107 variables (removed 0) and now considering 127/127 (removed 0) transitions.
// Phase 1: matrix 127 rows 107 cols
[2023-03-11 02:52:28] [INFO ] Computed 22 place invariants in 1 ms
[2023-03-11 02:52:29] [INFO ] Implicit Places using invariants in 142 ms returned []
[2023-03-11 02:52:29] [INFO ] Invariant cache hit.
[2023-03-11 02:52:29] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-11 02:52:29] [INFO ] Implicit Places using invariants and state equation in 278 ms returned []
Implicit Place search using SMT with State Equation took 423 ms to find 0 implicit places.
[2023-03-11 02:52:29] [INFO ] Invariant cache hit.
[2023-03-11 02:52:29] [INFO ] Dead Transitions using invariants and state equation in 120 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 559 ms. Remains : 107/107 places, 127/127 transitions.
Treatment of property BusinessProcesses-PT-13-LTLCardinality-10 finished in 7308 ms.
[2023-03-11 02:52:29] [INFO ] Flatten gal took : 64 ms
[2023-03-11 02:52:29] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2023-03-11 02:52:29] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 450 places, 398 transitions and 1301 arcs took 5 ms.
Total runtime 42800 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT BusinessProcesses-PT-13
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/369
LTLCardinality

FORMULA BusinessProcesses-PT-13-LTLCardinality-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678503215087

--------------------
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/369/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/369/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/369/LTLCardinality.xml
lola: Created skeleton in 0.000000 secs.
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-13-LTLCardinality-08
lola: time limit : 1799 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for BusinessProcesses-PT-13-LTLCardinality-08
lola: result : true
lola: markings : 3538
lola: fired transitions : 6474
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 4 (type EXCL) for 3 BusinessProcesses-PT-13-LTLCardinality-10
lola: time limit : 3599 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BusinessProcesses-PT-13-LTLCardinality-08: LTL true LTL model checker

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 5/3599 4/32 BusinessProcesses-PT-13-LTLCardinality-10 375774 m, 75154 m/sec, 2378165 t fired, .

Time elapsed: 6 secs. Pages in use: 4
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BusinessProcesses-PT-13-LTLCardinality-08: LTL true LTL model checker

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 10/3599 6/32 BusinessProcesses-PT-13-LTLCardinality-10 694613 m, 63767 m/sec, 4597481 t fired, .

Time elapsed: 11 secs. Pages in use: 6
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BusinessProcesses-PT-13-LTLCardinality-08: LTL true LTL model checker

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 15/3599 9/32 BusinessProcesses-PT-13-LTLCardinality-10 952874 m, 51652 m/sec, 6633489 t fired, .

Time elapsed: 16 secs. Pages in use: 9
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BusinessProcesses-PT-13-LTLCardinality-08: LTL true LTL model checker

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 20/3599 11/32 BusinessProcesses-PT-13-LTLCardinality-10 1255496 m, 60524 m/sec, 8745135 t fired, .

Time elapsed: 21 secs. Pages in use: 11
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BusinessProcesses-PT-13-LTLCardinality-08: LTL true LTL model checker

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 25/3599 14/32 BusinessProcesses-PT-13-LTLCardinality-10 1547449 m, 58390 m/sec, 11080206 t fired, .

Time elapsed: 26 secs. Pages in use: 14
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BusinessProcesses-PT-13-LTLCardinality-08: LTL true LTL model checker

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 30/3599 16/32 BusinessProcesses-PT-13-LTLCardinality-10 1849941 m, 60498 m/sec, 13553289 t fired, .

Time elapsed: 31 secs. Pages in use: 16
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BusinessProcesses-PT-13-LTLCardinality-08: LTL true LTL model checker

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 35/3599 19/32 BusinessProcesses-PT-13-LTLCardinality-10 2144810 m, 58973 m/sec, 16012828 t fired, .

Time elapsed: 36 secs. Pages in use: 19
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BusinessProcesses-PT-13-LTLCardinality-08: LTL true LTL model checker

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 40/3599 22/32 BusinessProcesses-PT-13-LTLCardinality-10 2480290 m, 67096 m/sec, 18514523 t fired, .

Time elapsed: 41 secs. Pages in use: 22
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BusinessProcesses-PT-13-LTLCardinality-08: LTL true LTL model checker

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 45/3599 24/32 BusinessProcesses-PT-13-LTLCardinality-10 2765891 m, 57120 m/sec, 20782106 t fired, .

Time elapsed: 46 secs. Pages in use: 24
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BusinessProcesses-PT-13-LTLCardinality-08: LTL true LTL model checker

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 50/3599 26/32 BusinessProcesses-PT-13-LTLCardinality-10 3052588 m, 57339 m/sec, 23261605 t fired, .

Time elapsed: 51 secs. Pages in use: 26
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BusinessProcesses-PT-13-LTLCardinality-08: LTL true LTL model checker

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 55/3599 29/32 BusinessProcesses-PT-13-LTLCardinality-10 3380526 m, 65587 m/sec, 25713627 t fired, .

Time elapsed: 56 secs. Pages in use: 29
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BusinessProcesses-PT-13-LTLCardinality-08: LTL true LTL model checker

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 60/3599 32/32 BusinessProcesses-PT-13-LTLCardinality-10 3669893 m, 57873 m/sec, 28035882 t fired, .

Time elapsed: 61 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: CANCELED task # 4 (type EXCL) for BusinessProcesses-PT-13-LTLCardinality-10 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BusinessProcesses-PT-13-LTLCardinality-08: LTL true LTL model checker

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

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

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

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BusinessProcesses-PT-13-LTLCardinality-08: LTL true LTL model checker
BusinessProcesses-PT-13-LTLCardinality-10: LTL unknown AGGR


Time elapsed: 66 secs. Pages in use: 32

Sequence of Actions to be Executed by the VM

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

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

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