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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 564K
-rw-r--r-- 1 mcc users 6.6K Feb 25 16:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Feb 25 16:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Feb 25 16:43 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 25 16:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:38 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:38 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 15:38 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 25 16:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 134K Feb 25 16:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Feb 25 16:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K 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 79K 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-04-LTLCardinality-00
FORMULA_NAME BusinessProcesses-PT-04-LTLCardinality-01
FORMULA_NAME BusinessProcesses-PT-04-LTLCardinality-02
FORMULA_NAME BusinessProcesses-PT-04-LTLCardinality-03
FORMULA_NAME BusinessProcesses-PT-04-LTLCardinality-04
FORMULA_NAME BusinessProcesses-PT-04-LTLCardinality-05
FORMULA_NAME BusinessProcesses-PT-04-LTLCardinality-06
FORMULA_NAME BusinessProcesses-PT-04-LTLCardinality-07
FORMULA_NAME BusinessProcesses-PT-04-LTLCardinality-08
FORMULA_NAME BusinessProcesses-PT-04-LTLCardinality-09
FORMULA_NAME BusinessProcesses-PT-04-LTLCardinality-10
FORMULA_NAME BusinessProcesses-PT-04-LTLCardinality-11
FORMULA_NAME BusinessProcesses-PT-04-LTLCardinality-12
FORMULA_NAME BusinessProcesses-PT-04-LTLCardinality-13
FORMULA_NAME BusinessProcesses-PT-04-LTLCardinality-14
FORMULA_NAME BusinessProcesses-PT-04-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678501423359

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-04
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-11 02:23:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-11 02:23:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 02:23:45] [INFO ] Load time of PNML (sax parser for PT used): 64 ms
[2023-03-11 02:23:45] [INFO ] Transformed 288 places.
[2023-03-11 02:23:45] [INFO ] Transformed 283 transitions.
[2023-03-11 02:23:45] [INFO ] Found NUPN structural information;
[2023-03-11 02:23:45] [INFO ] Parsed PT model containing 288 places and 283 transitions and 916 arcs in 163 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 2 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA BusinessProcesses-PT-04-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-04-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-04-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-04-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-04-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-04-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-04-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-04-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 17 out of 286 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 286/286 places, 281/281 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 283 transition count 281
Discarding 39 places :
Symmetric choice reduction at 1 with 39 rule applications. Total rules 42 place count 244 transition count 242
Iterating global reduction 1 with 39 rules applied. Total rules applied 81 place count 244 transition count 242
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 82 place count 244 transition count 241
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 99 place count 227 transition count 224
Iterating global reduction 2 with 17 rules applied. Total rules applied 116 place count 227 transition count 224
Applied a total of 116 rules in 94 ms. Remains 227 /286 variables (removed 59) and now considering 224/281 (removed 57) transitions.
// Phase 1: matrix 224 rows 227 cols
[2023-03-11 02:23:46] [INFO ] Computed 41 place invariants in 24 ms
[2023-03-11 02:23:46] [INFO ] Implicit Places using invariants in 442 ms returned []
[2023-03-11 02:23:46] [INFO ] Invariant cache hit.
[2023-03-11 02:23:46] [INFO ] Implicit Places using invariants and state equation in 364 ms returned []
Implicit Place search using SMT with State Equation took 842 ms to find 0 implicit places.
[2023-03-11 02:23:46] [INFO ] Invariant cache hit.
[2023-03-11 02:23:47] [INFO ] Dead Transitions using invariants and state equation in 197 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 227/286 places, 224/281 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1144 ms. Remains : 227/286 places, 224/281 transitions.
Support contains 17 out of 227 places after structural reductions.
[2023-03-11 02:23:47] [INFO ] Flatten gal took : 56 ms
[2023-03-11 02:23:47] [INFO ] Flatten gal took : 24 ms
[2023-03-11 02:23:47] [INFO ] Input system was already deterministic with 224 transitions.
Finished random walk after 6659 steps, including 65 resets, run visited all 11 properties in 119 ms. (steps per millisecond=55 )
FORMULA BusinessProcesses-PT-04-LTLCardinality-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 204 stabilizing places and 202 stable transitions
Graph (complete) has 566 edges and 227 vertex of which 226 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.8 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 227 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 227/227 places, 224/224 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 221 transition count 218
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 221 transition count 218
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 219 transition count 216
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 219 transition count 216
Applied a total of 16 rules in 16 ms. Remains 219 /227 variables (removed 8) and now considering 216/224 (removed 8) transitions.
// Phase 1: matrix 216 rows 219 cols
[2023-03-11 02:23:47] [INFO ] Computed 41 place invariants in 6 ms
[2023-03-11 02:23:47] [INFO ] Implicit Places using invariants in 121 ms returned []
[2023-03-11 02:23:47] [INFO ] Invariant cache hit.
[2023-03-11 02:23:48] [INFO ] Implicit Places using invariants and state equation in 220 ms returned []
Implicit Place search using SMT with State Equation took 343 ms to find 0 implicit places.
[2023-03-11 02:23:48] [INFO ] Invariant cache hit.
[2023-03-11 02:23:48] [INFO ] Dead Transitions using invariants and state equation in 120 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 219/227 places, 216/224 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 480 ms. Remains : 219/227 places, 216/224 transitions.
Stuttering acceptance computed with spot in 193 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-04-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (NEQ s59 0) (NEQ s91 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-04-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-04-LTLCardinality-01 finished in 729 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 2 out of 227 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 227/227 places, 224/224 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 222 transition count 219
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 222 transition count 219
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 220 transition count 217
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 220 transition count 217
Applied a total of 14 rules in 13 ms. Remains 220 /227 variables (removed 7) and now considering 217/224 (removed 7) transitions.
// Phase 1: matrix 217 rows 220 cols
[2023-03-11 02:23:48] [INFO ] Computed 41 place invariants in 4 ms
[2023-03-11 02:23:48] [INFO ] Implicit Places using invariants in 90 ms returned []
[2023-03-11 02:23:48] [INFO ] Invariant cache hit.
[2023-03-11 02:23:48] [INFO ] Implicit Places using invariants and state equation in 170 ms returned []
Implicit Place search using SMT with State Equation took 262 ms to find 0 implicit places.
[2023-03-11 02:23:48] [INFO ] Invariant cache hit.
[2023-03-11 02:23:48] [INFO ] Dead Transitions using invariants and state equation in 118 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 220/227 places, 217/224 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 394 ms. Remains : 220/227 places, 217/224 transitions.
Stuttering acceptance computed with spot in 125 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : BusinessProcesses-PT-04-LTLCardinality-03 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:(OR (EQ s141 0) (EQ s169 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]]
Product exploration explored 100000 steps with 50000 reset in 488 ms.
Product exploration explored 100000 steps with 50000 reset in 248 ms.
Computed a total of 197 stabilizing places and 195 stable transitions
Graph (complete) has 557 edges and 220 vertex of which 219 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Computed a total of 197 stabilizing places and 195 stable transitions
Detected a total of 197/220 stabilizing places and 195/217 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), true, (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 117 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-04-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-04-LTLCardinality-03 finished in 1399 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(G(p0))&&F(p1))))'
Support contains 2 out of 227 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 227/227 places, 224/224 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 222 transition count 219
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 222 transition count 219
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 220 transition count 217
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 220 transition count 217
Applied a total of 14 rules in 20 ms. Remains 220 /227 variables (removed 7) and now considering 217/224 (removed 7) transitions.
// Phase 1: matrix 217 rows 220 cols
[2023-03-11 02:23:49] [INFO ] Computed 41 place invariants in 8 ms
[2023-03-11 02:23:50] [INFO ] Implicit Places using invariants in 145 ms returned []
[2023-03-11 02:23:50] [INFO ] Invariant cache hit.
[2023-03-11 02:23:50] [INFO ] Implicit Places using invariants and state equation in 263 ms returned []
Implicit Place search using SMT with State Equation took 410 ms to find 0 implicit places.
[2023-03-11 02:23:50] [INFO ] Invariant cache hit.
[2023-03-11 02:23:50] [INFO ] Dead Transitions using invariants and state equation in 132 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 220/227 places, 217/224 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 563 ms. Remains : 220/227 places, 217/224 transitions.
Stuttering acceptance computed with spot in 210 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-04-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s174 0) (EQ s100 1)), p0:(OR (EQ s100 0) (EQ s174 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1990 reset in 216 ms.
Stack based approach found an accepted trace after 8338 steps with 170 reset with depth 6 and stack size 6 in 15 ms.
FORMULA BusinessProcesses-PT-04-LTLCardinality-04 FALSE TECHNIQUES STACK_TEST
Treatment of property BusinessProcesses-PT-04-LTLCardinality-04 finished in 1151 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 227 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 227/227 places, 224/224 transitions.
Graph (trivial) has 98 edges and 227 vertex of which 6 / 227 are part of one of the 1 SCC in 3 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 559 edges and 222 vertex of which 221 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 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 21 place count 220 transition count 197
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 40 place count 201 transition count 197
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 48 Pre rules applied. Total rules applied 40 place count 201 transition count 149
Deduced a syphon composed of 48 places in 1 ms
Ensure Unique test removed 5 places
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 2 with 101 rules applied. Total rules applied 141 place count 148 transition count 149
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 145 place count 144 transition count 145
Iterating global reduction 2 with 4 rules applied. Total rules applied 149 place count 144 transition count 145
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 245 place count 96 transition count 97
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 247 place count 95 transition count 100
Applied a total of 247 rules in 40 ms. Remains 95 /227 variables (removed 132) and now considering 100/224 (removed 124) transitions.
// Phase 1: matrix 100 rows 95 cols
[2023-03-11 02:23:51] [INFO ] Computed 36 place invariants in 2 ms
[2023-03-11 02:23:51] [INFO ] Implicit Places using invariants in 69 ms returned [1, 5, 12, 35, 36, 37]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 71 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 89/227 places, 100/224 transitions.
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 2 place count 88 transition count 99
Applied a total of 2 rules in 6 ms. Remains 88 /89 variables (removed 1) and now considering 99/100 (removed 1) transitions.
// Phase 1: matrix 99 rows 88 cols
[2023-03-11 02:23:51] [INFO ] Computed 30 place invariants in 2 ms
[2023-03-11 02:23:51] [INFO ] Implicit Places using invariants in 69 ms returned []
[2023-03-11 02:23:51] [INFO ] Invariant cache hit.
[2023-03-11 02:23:51] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-11 02:23:51] [INFO ] Implicit Places using invariants and state equation in 133 ms returned [1, 10, 33, 34, 43, 45, 51]
Discarding 7 places :
Implicit Place search using SMT with State Equation took 206 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 81/227 places, 99/224 transitions.
Graph (complete) has 324 edges and 81 vertex of which 70 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
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 14 place count 57 transition count 51
Iterating global reduction 0 with 13 rules applied. Total rules applied 27 place count 57 transition count 51
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 28 place count 56 transition count 50
Iterating global reduction 0 with 1 rules applied. Total rules applied 29 place count 56 transition count 50
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 33 place count 54 transition count 48
Applied a total of 33 rules in 9 ms. Remains 54 /81 variables (removed 27) and now considering 48/99 (removed 51) transitions.
// Phase 1: matrix 48 rows 54 cols
[2023-03-11 02:23:51] [INFO ] Computed 19 place invariants in 0 ms
[2023-03-11 02:23:51] [INFO ] Implicit Places using invariants in 40 ms returned [1, 2, 5, 6, 7]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 41 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 49/227 places, 48/224 transitions.
Applied a total of 0 rules in 3 ms. Remains 49 /49 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 4 iterations and 377 ms. Remains : 49/227 places, 48/224 transitions.
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-04-LTLCardinality-06 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:(EQ s22 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 0 ms.
FORMULA BusinessProcesses-PT-04-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-04-LTLCardinality-06 finished in 494 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 227 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 227/227 places, 224/224 transitions.
Graph (trivial) has 97 edges and 227 vertex of which 6 / 227 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 559 edges and 222 vertex of which 221 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 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 21 place count 220 transition count 197
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 40 place count 201 transition count 197
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 47 Pre rules applied. Total rules applied 40 place count 201 transition count 150
Deduced a syphon composed of 47 places in 1 ms
Ensure Unique test removed 6 places
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 140 place count 148 transition count 150
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 143 place count 145 transition count 147
Iterating global reduction 2 with 3 rules applied. Total rules applied 146 place count 145 transition count 147
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 246 place count 95 transition count 97
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 248 place count 94 transition count 100
Applied a total of 248 rules in 33 ms. Remains 94 /227 variables (removed 133) and now considering 100/224 (removed 124) transitions.
// Phase 1: matrix 100 rows 94 cols
[2023-03-11 02:23:51] [INFO ] Computed 35 place invariants in 1 ms
[2023-03-11 02:23:51] [INFO ] Implicit Places using invariants in 61 ms returned [1, 11, 35, 36, 37]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 62 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 89/227 places, 100/224 transitions.
Applied a total of 0 rules in 4 ms. Remains 89 /89 variables (removed 0) and now considering 100/100 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 99 ms. Remains : 89/227 places, 100/224 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-04-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s59 0) (EQ s23 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 11339 reset in 248 ms.
Product exploration explored 100000 steps with 11239 reset in 180 ms.
Computed a total of 82 stabilizing places and 93 stable transitions
Computed a total of 82 stabilizing places and 93 stable transitions
Detected a total of 82/89 stabilizing places and 93/100 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 177 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Finished random walk after 11 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=5 )
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 134 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 58 ms :[(NOT p0)]
Support contains 2 out of 89 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 89/89 places, 100/100 transitions.
Applied a total of 0 rules in 4 ms. Remains 89 /89 variables (removed 0) and now considering 100/100 (removed 0) transitions.
// Phase 1: matrix 100 rows 89 cols
[2023-03-11 02:23:52] [INFO ] Computed 30 place invariants in 2 ms
[2023-03-11 02:23:52] [INFO ] Implicit Places using invariants in 93 ms returned []
[2023-03-11 02:23:52] [INFO ] Invariant cache hit.
[2023-03-11 02:23:52] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-11 02:23:52] [INFO ] Implicit Places using invariants and state equation in 140 ms returned [1, 10, 34, 35, 44, 46, 52]
Discarding 7 places :
Implicit Place search using SMT with State Equation took 237 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 82/89 places, 100/100 transitions.
Graph (complete) has 334 edges and 82 vertex of which 73 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.0 ms
Discarding 9 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 11 place count 63 transition count 63
Iterating global reduction 0 with 10 rules applied. Total rules applied 21 place count 63 transition count 63
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 27 place count 60 transition count 60
Applied a total of 27 rules in 7 ms. Remains 60 /82 variables (removed 22) and now considering 60/100 (removed 40) transitions.
// Phase 1: matrix 60 rows 60 cols
[2023-03-11 02:23:52] [INFO ] Computed 20 place invariants in 1 ms
[2023-03-11 02:23:52] [INFO ] Implicit Places using invariants in 77 ms returned [1, 2, 7]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 78 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 57/89 places, 60/100 transitions.
Applied a total of 0 rules in 3 ms. Remains 57 /57 variables (removed 0) and now considering 60/60 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 329 ms. Remains : 57/89 places, 60/100 transitions.
Computed a total of 50 stabilizing places and 53 stable transitions
Graph (complete) has 202 edges and 57 vertex of which 54 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Computed a total of 50 stabilizing places and 53 stable transitions
Detected a total of 50/57 stabilizing places and 53/60 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 146 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Finished random walk after 235 steps, including 34 resets, run visited all 1 properties in 3 ms. (steps per millisecond=78 )
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 194 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Product exploration explored 100000 steps with 12012 reset in 142 ms.
Product exploration explored 100000 steps with 12099 reset in 136 ms.
Support contains 2 out of 57 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 57/57 places, 60/60 transitions.
Applied a total of 0 rules in 3 ms. Remains 57 /57 variables (removed 0) and now considering 60/60 (removed 0) transitions.
// Phase 1: matrix 60 rows 57 cols
[2023-03-11 02:23:53] [INFO ] Computed 17 place invariants in 0 ms
[2023-03-11 02:23:53] [INFO ] Implicit Places using invariants in 45 ms returned []
[2023-03-11 02:23:53] [INFO ] Invariant cache hit.
[2023-03-11 02:23:53] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-11 02:23:53] [INFO ] Implicit Places using invariants and state equation in 95 ms returned [11, 13, 23]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 142 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 54/57 places, 60/60 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 1 place count 54 transition count 59
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 53 transition count 59
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 3 place count 52 transition count 58
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 52 transition count 58
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 5 place count 51 transition count 57
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 51 transition count 57
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7 place count 51 transition count 56
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 1 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 13 rules applied. Total rules applied 20 place count 44 transition count 50
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 22 place count 43 transition count 49
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 23 place count 43 transition count 48
Applied a total of 23 rules in 14 ms. Remains 43 /54 variables (removed 11) and now considering 48/60 (removed 12) transitions.
// Phase 1: matrix 48 rows 43 cols
[2023-03-11 02:23:53] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-11 02:23:53] [INFO ] Implicit Places using invariants in 36 ms returned [32, 39, 42]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 38 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 40/57 places, 48/60 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 39 transition count 47
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 39 transition count 47
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 4 place count 38 transition count 46
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 36 transition count 42
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 36 transition count 42
Applied a total of 8 rules in 5 ms. Remains 36 /40 variables (removed 4) and now considering 42/48 (removed 6) transitions.
// Phase 1: matrix 42 rows 36 cols
[2023-03-11 02:23:53] [INFO ] Computed 10 place invariants in 0 ms
[2023-03-11 02:23:53] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-11 02:23:53] [INFO ] Invariant cache hit.
[2023-03-11 02:23:53] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-11 02:23:53] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 36/57 places, 42/60 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 292 ms. Remains : 36/57 places, 42/60 transitions.
Treatment of property BusinessProcesses-PT-04-LTLCardinality-10 finished in 2512 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((X(p1)||p0))))'
Support contains 4 out of 227 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 227/227 places, 224/224 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 223 transition count 220
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 223 transition count 220
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 222 transition count 219
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 222 transition count 219
Applied a total of 10 rules in 9 ms. Remains 222 /227 variables (removed 5) and now considering 219/224 (removed 5) transitions.
// Phase 1: matrix 219 rows 222 cols
[2023-03-11 02:23:53] [INFO ] Computed 41 place invariants in 2 ms
[2023-03-11 02:23:54] [INFO ] Implicit Places using invariants in 106 ms returned []
[2023-03-11 02:23:54] [INFO ] Invariant cache hit.
[2023-03-11 02:23:54] [INFO ] Implicit Places using invariants and state equation in 235 ms returned []
Implicit Place search using SMT with State Equation took 345 ms to find 0 implicit places.
[2023-03-11 02:23:54] [INFO ] Invariant cache hit.
[2023-03-11 02:23:54] [INFO ] Dead Transitions using invariants and state equation in 132 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 222/227 places, 219/224 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 487 ms. Remains : 222/227 places, 219/224 transitions.
Stuttering acceptance computed with spot in 87 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-04-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p0:(OR (EQ s163 0) (EQ s152 1)), p1:(OR (EQ s98 0) (EQ s113 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 1104 reset in 208 ms.
Product exploration explored 100000 steps with 1106 reset in 234 ms.
Computed a total of 199 stabilizing places and 197 stable transitions
Graph (complete) has 559 edges and 222 vertex of which 221 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 199 stabilizing places and 197 stable transitions
Detected a total of 199/222 stabilizing places and 197/219 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 12 factoid took 420 ms. Reduced automaton from 2 states, 6 edges and 2 AP (stutter sensitive) to 2 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 59 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 106 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10000 steps, including 25 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-11 02:23:55] [INFO ] Invariant cache hit.
[2023-03-11 02:23:55] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 02:23:55] [INFO ] [Nat]Absence check using 17 positive place invariants in 9 ms returned sat
[2023-03-11 02:23:55] [INFO ] [Nat]Absence check using 17 positive and 24 generalized place invariants in 6 ms returned sat
[2023-03-11 02:23:55] [INFO ] After 81ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 02:23:55] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 3 ms to minimize.
[2023-03-11 02:23:55] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
[2023-03-11 02:23:55] [INFO ] Deduced a trap composed of 42 places in 35 ms of which 1 ms to minimize.
[2023-03-11 02:23:55] [INFO ] Deduced a trap composed of 22 places in 24 ms of which 1 ms to minimize.
[2023-03-11 02:23:55] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 193 ms
[2023-03-11 02:23:55] [INFO ] After 282ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-03-11 02:23:55] [INFO ] After 357ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 222 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 222/222 places, 219/219 transitions.
Graph (trivial) has 88 edges and 222 vertex of which 6 / 222 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 544 edges and 217 vertex of which 216 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 15 place count 216 transition count 198
Reduce places removed 13 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 203 transition count 196
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 32 place count 201 transition count 196
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 47 Pre rules applied. Total rules applied 32 place count 201 transition count 149
Deduced a syphon composed of 47 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 3 with 100 rules applied. Total rules applied 132 place count 148 transition count 149
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 228 place count 100 transition count 101
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 3 with 2 rules applied. Total rules applied 230 place count 99 transition count 104
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 231 place count 99 transition count 103
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 232 place count 98 transition count 103
Applied a total of 232 rules in 20 ms. Remains 98 /222 variables (removed 124) and now considering 103/219 (removed 116) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 98/222 places, 103/219 transitions.
Finished random walk after 399 steps, including 29 resets, run visited all 1 properties in 2 ms. (steps per millisecond=199 )
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p1) p0)), (F (NOT (AND p1 p0))), (F (NOT p0)), (F (AND (NOT p1) (NOT p0))), (F (AND p1 (NOT p0)))]
Knowledge based reduction with 12 factoid took 696 ms. Reduced automaton from 2 states, 7 edges and 2 AP (stutter insensitive) to 2 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 114 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 222 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 222/222 places, 219/219 transitions.
Graph (trivial) has 88 edges and 222 vertex of which 6 / 222 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 552 edges and 217 vertex of which 216 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 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 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 15 place count 215 transition count 198
Reduce places removed 13 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 202 transition count 196
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 32 place count 200 transition count 196
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 47 Pre rules applied. Total rules applied 32 place count 200 transition count 149
Deduced a syphon composed of 47 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 3 with 100 rules applied. Total rules applied 132 place count 147 transition count 149
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 226 place count 100 transition count 102
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 3 with 2 rules applied. Total rules applied 228 place count 99 transition count 105
Applied a total of 228 rules in 18 ms. Remains 99 /222 variables (removed 123) and now considering 105/219 (removed 114) transitions.
// Phase 1: matrix 105 rows 99 cols
[2023-03-11 02:23:56] [INFO ] Computed 35 place invariants in 4 ms
[2023-03-11 02:23:57] [INFO ] Implicit Places using invariants in 91 ms returned [1, 11, 34, 35]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 93 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 95/222 places, 105/219 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 95 transition count 104
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 2 place count 94 transition count 104
Applied a total of 2 rules in 7 ms. Remains 94 /95 variables (removed 1) and now considering 104/105 (removed 1) transitions.
// Phase 1: matrix 104 rows 94 cols
[2023-03-11 02:23:57] [INFO ] Computed 31 place invariants in 1 ms
[2023-03-11 02:23:57] [INFO ] Implicit Places using invariants in 89 ms returned []
[2023-03-11 02:23:57] [INFO ] Invariant cache hit.
[2023-03-11 02:23:57] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-11 02:23:57] [INFO ] Implicit Places using invariants and state equation in 122 ms returned [1, 10, 48, 50, 58]
Discarding 5 places :
Implicit Place search using SMT with State Equation took 214 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 89/222 places, 104/219 transitions.
Graph (complete) has 347 edges and 89 vertex of which 78 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
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 13 place count 66 transition count 57
Iterating global reduction 0 with 12 rules applied. Total rules applied 25 place count 66 transition count 57
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 26 place count 65 transition count 56
Iterating global reduction 0 with 1 rules applied. Total rules applied 27 place count 65 transition count 56
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 29 place count 64 transition count 55
Applied a total of 29 rules in 12 ms. Remains 64 /89 variables (removed 25) and now considering 55/104 (removed 49) transitions.
// Phase 1: matrix 55 rows 64 cols
[2023-03-11 02:23:57] [INFO ] Computed 20 place invariants in 1 ms
[2023-03-11 02:23:57] [INFO ] Implicit Places using invariants in 62 ms returned [1, 2, 5, 6, 7]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 64 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 59/222 places, 55/219 transitions.
Applied a total of 0 rules in 4 ms. Remains 59 /59 variables (removed 0) and now considering 55/55 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 4 iterations and 420 ms. Remains : 59/222 places, 55/219 transitions.
Computed a total of 49 stabilizing places and 46 stable transitions
Graph (complete) has 175 edges and 59 vertex of which 58 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 49 stabilizing places and 46 stable transitions
Detected a total of 49/59 stabilizing places and 46/55 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (AND p1 p0)), (X p0), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND p1 p0))), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 280 ms. Reduced automaton from 2 states, 7 edges and 2 AP (stutter insensitive) to 2 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 1514 steps, including 163 resets, run visited all 5 properties in 12 ms. (steps per millisecond=126 )
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (AND p1 p0)), (X p0), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND p1 p0))), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p1) p0)), (F (NOT (AND p1 p0))), (F (NOT p0)), (F (AND (NOT p1) (NOT p0))), (F (AND p1 (NOT p0)))]
Knowledge based reduction with 12 factoid took 427 ms. Reduced automaton from 2 states, 7 edges and 2 AP (stutter insensitive) to 2 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 9121 reset in 268 ms.
Product exploration explored 100000 steps with 9155 reset in 142 ms.
Support contains 4 out of 59 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 59/59 places, 55/55 transitions.
Applied a total of 0 rules in 1 ms. Remains 59 /59 variables (removed 0) and now considering 55/55 (removed 0) transitions.
// Phase 1: matrix 55 rows 59 cols
[2023-03-11 02:23:58] [INFO ] Computed 15 place invariants in 1 ms
[2023-03-11 02:23:58] [INFO ] Implicit Places using invariants in 63 ms returned []
[2023-03-11 02:23:58] [INFO ] Invariant cache hit.
[2023-03-11 02:23:58] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-11 02:23:58] [INFO ] Implicit Places using invariants and state equation in 93 ms returned [11, 13, 15, 20, 22]
Discarding 5 places :
Implicit Place search using SMT with State Equation took 159 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 54/59 places, 55/55 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 54 transition count 53
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 52 transition count 53
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 5 place count 51 transition count 52
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 51 transition count 52
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 7 place count 50 transition count 51
Iterating global reduction 2 with 1 rules applied. Total rules applied 8 place count 50 transition count 51
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 9 place count 50 transition count 50
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 41 place count 31 transition count 37
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 45 place count 27 transition count 33
Iterating global reduction 3 with 4 rules applied. Total rules applied 49 place count 27 transition count 33
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 50 place count 27 transition count 32
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 52 place count 26 transition count 31
Applied a total of 52 rules in 5 ms. Remains 26 /54 variables (removed 28) and now considering 31/55 (removed 24) transitions.
// Phase 1: matrix 31 rows 26 cols
[2023-03-11 02:23:59] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-11 02:23:59] [INFO ] Implicit Places using invariants in 38 ms returned []
[2023-03-11 02:23:59] [INFO ] Invariant cache hit.
[2023-03-11 02:23:59] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-11 02:24:00] [INFO ] Implicit Places using invariants and state equation in 1272 ms returned []
Implicit Place search using SMT with State Equation took 1321 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 26/59 places, 31/55 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1486 ms. Remains : 26/59 places, 31/55 transitions.
Treatment of property BusinessProcesses-PT-04-LTLCardinality-12 finished in 6399 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 1 out of 227 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 227/227 places, 224/224 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 222 transition count 219
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 222 transition count 219
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 221 transition count 218
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 221 transition count 218
Applied a total of 12 rules in 8 ms. Remains 221 /227 variables (removed 6) and now considering 218/224 (removed 6) transitions.
// Phase 1: matrix 218 rows 221 cols
[2023-03-11 02:24:00] [INFO ] Computed 41 place invariants in 5 ms
[2023-03-11 02:24:00] [INFO ] Implicit Places using invariants in 151 ms returned []
[2023-03-11 02:24:00] [INFO ] Invariant cache hit.
[2023-03-11 02:24:00] [INFO ] Implicit Places using invariants and state equation in 244 ms returned []
Implicit Place search using SMT with State Equation took 404 ms to find 0 implicit places.
[2023-03-11 02:24:00] [INFO ] Invariant cache hit.
[2023-03-11 02:24:00] [INFO ] Dead Transitions using invariants and state equation in 143 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 221/227 places, 218/224 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 557 ms. Remains : 221/227 places, 218/224 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-04-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s177 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 65 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-04-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-04-LTLCardinality-15 finished in 655 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)))'
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((X(p1)||p0))))'
Found a Lengthening insensitive property : BusinessProcesses-PT-04-LTLCardinality-12
Stuttering acceptance computed with spot in 87 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 227 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 227/227 places, 224/224 transitions.
Graph (trivial) has 93 edges and 227 vertex of which 6 / 227 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 559 edges and 222 vertex of which 221 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 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 17 place count 220 transition count 201
Reduce places removed 15 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 17 rules applied. Total rules applied 34 place count 205 transition count 199
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 36 place count 203 transition count 199
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 47 Pre rules applied. Total rules applied 36 place count 203 transition count 152
Deduced a syphon composed of 47 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 3 with 100 rules applied. Total rules applied 136 place count 150 transition count 152
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 138 place count 148 transition count 150
Iterating global reduction 3 with 2 rules applied. Total rules applied 140 place count 148 transition count 150
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 236 place count 100 transition count 102
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 3 with 2 rules applied. Total rules applied 238 place count 99 transition count 105
Applied a total of 238 rules in 18 ms. Remains 99 /227 variables (removed 128) and now considering 105/224 (removed 119) transitions.
// Phase 1: matrix 105 rows 99 cols
[2023-03-11 02:24:01] [INFO ] Computed 35 place invariants in 2 ms
[2023-03-11 02:24:01] [INFO ] Implicit Places using invariants in 103 ms returned [1, 11, 34, 35]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 104 ms to find 4 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 95/227 places, 105/224 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 95 transition count 104
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 2 place count 94 transition count 104
Applied a total of 2 rules in 3 ms. Remains 94 /95 variables (removed 1) and now considering 104/105 (removed 1) transitions.
// Phase 1: matrix 104 rows 94 cols
[2023-03-11 02:24:01] [INFO ] Computed 31 place invariants in 2 ms
[2023-03-11 02:24:01] [INFO ] Implicit Places using invariants in 75 ms returned []
[2023-03-11 02:24:01] [INFO ] Invariant cache hit.
[2023-03-11 02:24:01] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-11 02:24:01] [INFO ] Implicit Places using invariants and state equation in 145 ms returned [1, 10, 48, 50, 58]
Discarding 5 places :
Implicit Place search using SMT with State Equation took 222 ms to find 5 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 89/227 places, 104/224 transitions.
Graph (complete) has 347 edges and 89 vertex of which 78 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
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 13 place count 66 transition count 57
Iterating global reduction 0 with 12 rules applied. Total rules applied 25 place count 66 transition count 57
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 26 place count 65 transition count 56
Iterating global reduction 0 with 1 rules applied. Total rules applied 27 place count 65 transition count 56
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 29 place count 64 transition count 55
Applied a total of 29 rules in 5 ms. Remains 64 /89 variables (removed 25) and now considering 55/104 (removed 49) transitions.
// Phase 1: matrix 55 rows 64 cols
[2023-03-11 02:24:01] [INFO ] Computed 20 place invariants in 1 ms
[2023-03-11 02:24:01] [INFO ] Implicit Places using invariants in 75 ms returned [1, 2, 5, 6, 7]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 76 ms to find 5 implicit places.
Starting structural reductions in LI_LTL mode, iteration 3 : 59/227 places, 55/224 transitions.
Applied a total of 0 rules in 1 ms. Remains 59 /59 variables (removed 0) and now considering 55/55 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 4 iterations and 432 ms. Remains : 59/227 places, 55/224 transitions.
Running random walk in product with property : BusinessProcesses-PT-04-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p0:(OR (EQ s28 0) (EQ s24 1)), p1:(OR (EQ s4 0) (EQ s8 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, sl-invariant], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 9103 reset in 106 ms.
Product exploration explored 100000 steps with 9057 reset in 112 ms.
Computed a total of 49 stabilizing places and 46 stable transitions
Graph (complete) has 175 edges and 59 vertex of which 58 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 49 stabilizing places and 46 stable transitions
Detected a total of 49/59 stabilizing places and 46/55 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 12 factoid took 609 ms. Reduced automaton from 2 states, 6 edges and 2 AP (stutter sensitive) to 2 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 4009 steps, including 424 resets, run visited all 5 properties in 9 ms. (steps per millisecond=445 )
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p1) p0)), (F (NOT (AND p1 p0))), (F (NOT p0)), (F (AND (NOT p1) (NOT p0))), (F (AND p1 (NOT p0)))]
Knowledge based reduction with 12 factoid took 669 ms. Reduced automaton from 2 states, 7 edges and 2 AP (stutter insensitive) to 2 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 59 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 59/59 places, 55/55 transitions.
Applied a total of 0 rules in 2 ms. Remains 59 /59 variables (removed 0) and now considering 55/55 (removed 0) transitions.
// Phase 1: matrix 55 rows 59 cols
[2023-03-11 02:24:03] [INFO ] Computed 15 place invariants in 1 ms
[2023-03-11 02:24:03] [INFO ] Implicit Places using invariants in 57 ms returned []
[2023-03-11 02:24:03] [INFO ] Invariant cache hit.
[2023-03-11 02:24:04] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-11 02:24:04] [INFO ] Implicit Places using invariants and state equation in 662 ms returned [11, 13, 15, 20, 22]
Discarding 5 places :
Implicit Place search using SMT with State Equation took 722 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 54/59 places, 55/55 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 54 transition count 53
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 52 transition count 53
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 5 place count 51 transition count 52
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 51 transition count 52
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 7 place count 50 transition count 51
Iterating global reduction 2 with 1 rules applied. Total rules applied 8 place count 50 transition count 51
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 9 place count 50 transition count 50
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 41 place count 31 transition count 37
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 45 place count 27 transition count 33
Iterating global reduction 3 with 4 rules applied. Total rules applied 49 place count 27 transition count 33
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 50 place count 27 transition count 32
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 52 place count 26 transition count 31
Applied a total of 52 rules in 8 ms. Remains 26 /54 variables (removed 28) and now considering 31/55 (removed 24) transitions.
// Phase 1: matrix 31 rows 26 cols
[2023-03-11 02:24:04] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-11 02:24:04] [INFO ] Implicit Places using invariants in 55 ms returned []
[2023-03-11 02:24:04] [INFO ] Invariant cache hit.
[2023-03-11 02:24:04] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-11 02:24:04] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 26/59 places, 31/55 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 839 ms. Remains : 26/59 places, 31/55 transitions.
Computed a total of 16 stabilizing places and 22 stable transitions
Graph (complete) has 72 edges and 26 vertex of which 25 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 16 stabilizing places and 22 stable transitions
Detected a total of 16/26 stabilizing places and 22/31 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (AND p1 p0)), (X p0), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND p1 p0))), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 498 ms. Reduced automaton from 2 states, 7 edges and 2 AP (stutter insensitive) to 2 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 434 steps, including 56 resets, run visited all 5 properties in 4 ms. (steps per millisecond=108 )
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (AND p1 p0)), (X p0), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND p1 p0))), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p1) p0)), (F (NOT (AND p1 p0))), (F (NOT p0)), (F (AND (NOT p1) (NOT p0))), (F (AND p1 (NOT p0)))]
Knowledge based reduction with 12 factoid took 620 ms. Reduced automaton from 2 states, 7 edges and 2 AP (stutter insensitive) to 2 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 127 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 129 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 10368 reset in 113 ms.
Product exploration explored 100000 steps with 10299 reset in 129 ms.
Support contains 4 out of 26 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 26/26 places, 31/31 transitions.
Applied a total of 0 rules in 5 ms. Remains 26 /26 variables (removed 0) and now considering 31/31 (removed 0) transitions.
[2023-03-11 02:24:06] [INFO ] Invariant cache hit.
[2023-03-11 02:24:06] [INFO ] Implicit Places using invariants in 65 ms returned []
[2023-03-11 02:24:06] [INFO ] Invariant cache hit.
[2023-03-11 02:24:06] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-11 02:24:06] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 164 ms to find 0 implicit places.
[2023-03-11 02:24:06] [INFO ] Redundant transitions in 237 ms returned []
[2023-03-11 02:24:06] [INFO ] Invariant cache hit.
[2023-03-11 02:24:06] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 486 ms. Remains : 26/26 places, 31/31 transitions.
Treatment of property BusinessProcesses-PT-04-LTLCardinality-12 finished in 5607 ms.
[2023-03-11 02:24:06] [INFO ] Flatten gal took : 15 ms
[2023-03-11 02:24:06] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2023-03-11 02:24:06] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 227 places, 224 transitions and 795 arcs took 2 ms.
Total runtime 21382 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT BusinessProcesses-PT-04
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/380
LTLCardinality

FORMULA BusinessProcesses-PT-04-LTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678501507385

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/380/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/380/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/380/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-04-LTLCardinality-10
lola: time limit : 1800 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for BusinessProcesses-PT-04-LTLCardinality-10
lola: result : true
lola: markings : 3839
lola: fired transitions : 7206
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 4 (type EXCL) for 3 BusinessProcesses-PT-04-LTLCardinality-12
lola: time limit : 3600 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BusinessProcesses-PT-04-LTLCardinality-10: LTL true LTL model checker

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 5/3600 4/32 BusinessProcesses-PT-04-LTLCardinality-12 525403 m, 105080 m/sec, 3196931 t fired, .

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

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 10/3600 7/32 BusinessProcesses-PT-04-LTLCardinality-12 1005678 m, 96055 m/sec, 6454129 t fired, .

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

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 15/3600 10/32 BusinessProcesses-PT-04-LTLCardinality-12 1448439 m, 88552 m/sec, 9565939 t fired, .

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

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 20/3600 13/32 BusinessProcesses-PT-04-LTLCardinality-12 1870880 m, 84488 m/sec, 12597998 t fired, .

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

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 25/3600 16/32 BusinessProcesses-PT-04-LTLCardinality-12 2283520 m, 82528 m/sec, 15568635 t fired, .

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

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 30/3600 19/32 BusinessProcesses-PT-04-LTLCardinality-12 2702903 m, 83876 m/sec, 18423792 t fired, .

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

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 35/3600 21/32 BusinessProcesses-PT-04-LTLCardinality-12 3070345 m, 73488 m/sec, 21189515 t fired, .

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

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 40/3600 23/32 BusinessProcesses-PT-04-LTLCardinality-12 3420382 m, 70007 m/sec, 24045092 t fired, .

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

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 45/3600 26/32 BusinessProcesses-PT-04-LTLCardinality-12 3873107 m, 90545 m/sec, 27253060 t fired, .

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

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 50/3600 29/32 BusinessProcesses-PT-04-LTLCardinality-12 4273299 m, 80038 m/sec, 30277690 t fired, .

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

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 55/3600 31/32 BusinessProcesses-PT-04-LTLCardinality-12 4601742 m, 65688 m/sec, 32966578 t fired, .

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

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

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

Time elapsed: 60 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-04-LTLCardinality-10: LTL true LTL model checker
BusinessProcesses-PT-04-LTLCardinality-12: LTL unknown AGGR


Time elapsed: 60 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-04"
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-04, 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-167813692600475"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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