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.r037-tajo-167813690600595.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 itstools
Input is BusinessProcesses-PT-19, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r037-tajo-167813690600595
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 628K
-rw-r--r-- 1 mcc users 7.0K Feb 25 16:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 25 16:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Feb 25 16:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Feb 25 16:45 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 16:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K Feb 25 16:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Feb 25 16:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K Feb 25 16:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:39 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 189K 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-19-LTLCardinality-00
FORMULA_NAME BusinessProcesses-PT-19-LTLCardinality-01
FORMULA_NAME BusinessProcesses-PT-19-LTLCardinality-02
FORMULA_NAME BusinessProcesses-PT-19-LTLCardinality-03
FORMULA_NAME BusinessProcesses-PT-19-LTLCardinality-04
FORMULA_NAME BusinessProcesses-PT-19-LTLCardinality-05
FORMULA_NAME BusinessProcesses-PT-19-LTLCardinality-06
FORMULA_NAME BusinessProcesses-PT-19-LTLCardinality-07
FORMULA_NAME BusinessProcesses-PT-19-LTLCardinality-08
FORMULA_NAME BusinessProcesses-PT-19-LTLCardinality-09
FORMULA_NAME BusinessProcesses-PT-19-LTLCardinality-10
FORMULA_NAME BusinessProcesses-PT-19-LTLCardinality-11
FORMULA_NAME BusinessProcesses-PT-19-LTLCardinality-12
FORMULA_NAME BusinessProcesses-PT-19-LTLCardinality-13
FORMULA_NAME BusinessProcesses-PT-19-LTLCardinality-14
FORMULA_NAME BusinessProcesses-PT-19-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678364579167

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=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-19
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202303021504
[2023-03-09 12:23:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-09 12:23:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 12:23:01] [INFO ] Load time of PNML (sax parser for PT used): 67 ms
[2023-03-09 12:23:01] [INFO ] Transformed 772 places.
[2023-03-09 12:23:01] [INFO ] Transformed 685 transitions.
[2023-03-09 12:23:01] [INFO ] Found NUPN structural information;
[2023-03-09 12:23:01] [INFO ] Parsed PT model containing 772 places and 685 transitions and 1981 arcs in 134 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 15 places in 18 ms
Reduce places removed 15 places and 15 transitions.
FORMULA BusinessProcesses-PT-19-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-19-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-19-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-19-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-19-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-19-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-19-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-19-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-19-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 27 out of 757 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 757/757 places, 670/670 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 749 transition count 670
Discarding 105 places :
Symmetric choice reduction at 1 with 105 rule applications. Total rules 113 place count 644 transition count 565
Iterating global reduction 1 with 105 rules applied. Total rules applied 218 place count 644 transition count 565
Discarding 52 places :
Symmetric choice reduction at 1 with 52 rule applications. Total rules 270 place count 592 transition count 513
Iterating global reduction 1 with 52 rules applied. Total rules applied 322 place count 592 transition count 513
Applied a total of 322 rules in 134 ms. Remains 592 /757 variables (removed 165) and now considering 513/670 (removed 157) transitions.
// Phase 1: matrix 513 rows 592 cols
[2023-03-09 12:23:02] [INFO ] Computed 117 place invariants in 45 ms
[2023-03-09 12:23:02] [INFO ] Implicit Places using invariants in 378 ms returned []
[2023-03-09 12:23:02] [INFO ] Invariant cache hit.
[2023-03-09 12:23:02] [INFO ] Implicit Places using invariants and state equation in 581 ms returned []
Implicit Place search using SMT with State Equation took 984 ms to find 0 implicit places.
[2023-03-09 12:23:02] [INFO ] Invariant cache hit.
[2023-03-09 12:23:03] [INFO ] Dead Transitions using invariants and state equation in 279 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 592/757 places, 513/670 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1400 ms. Remains : 592/757 places, 513/670 transitions.
Support contains 27 out of 592 places after structural reductions.
[2023-03-09 12:23:03] [INFO ] Flatten gal took : 82 ms
[2023-03-09 12:23:03] [INFO ] Flatten gal took : 39 ms
[2023-03-09 12:23:03] [INFO ] Input system was already deterministic with 513 transitions.
Incomplete random walk after 10000 steps, including 55 resets, run finished after 594 ms. (steps per millisecond=16 ) properties (out of 18) seen :4
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 10 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 10 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 10 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 14) seen :0
Running SMT prover for 14 properties.
[2023-03-09 12:23:05] [INFO ] Invariant cache hit.
[2023-03-09 12:23:05] [INFO ] After 480ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2023-03-09 12:23:06] [INFO ] [Nat]Absence check using 70 positive place invariants in 18 ms returned sat
[2023-03-09 12:23:06] [INFO ] [Nat]Absence check using 70 positive and 47 generalized place invariants in 16 ms returned sat
[2023-03-09 12:23:06] [INFO ] After 566ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :14
[2023-03-09 12:23:07] [INFO ] Deduced a trap composed of 14 places in 212 ms of which 23 ms to minimize.
[2023-03-09 12:23:07] [INFO ] Deduced a trap composed of 21 places in 203 ms of which 14 ms to minimize.
[2023-03-09 12:23:07] [INFO ] Deduced a trap composed of 15 places in 156 ms of which 2 ms to minimize.
[2023-03-09 12:23:07] [INFO ] Deduced a trap composed of 35 places in 102 ms of which 1 ms to minimize.
[2023-03-09 12:23:07] [INFO ] Deduced a trap composed of 33 places in 134 ms of which 1 ms to minimize.
[2023-03-09 12:23:08] [INFO ] Deduced a trap composed of 36 places in 190 ms of which 0 ms to minimize.
[2023-03-09 12:23:08] [INFO ] Deduced a trap composed of 36 places in 139 ms of which 2 ms to minimize.
[2023-03-09 12:23:08] [INFO ] Deduced a trap composed of 53 places in 111 ms of which 0 ms to minimize.
[2023-03-09 12:23:08] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1550 ms
[2023-03-09 12:23:08] [INFO ] Deduced a trap composed of 43 places in 148 ms of which 0 ms to minimize.
[2023-03-09 12:23:08] [INFO ] Deduced a trap composed of 21 places in 131 ms of which 1 ms to minimize.
[2023-03-09 12:23:08] [INFO ] Deduced a trap composed of 27 places in 125 ms of which 1 ms to minimize.
[2023-03-09 12:23:09] [INFO ] Deduced a trap composed of 25 places in 97 ms of which 0 ms to minimize.
[2023-03-09 12:23:09] [INFO ] Deduced a trap composed of 29 places in 98 ms of which 0 ms to minimize.
[2023-03-09 12:23:09] [INFO ] Deduced a trap composed of 42 places in 87 ms of which 0 ms to minimize.
[2023-03-09 12:23:09] [INFO ] Deduced a trap composed of 46 places in 81 ms of which 0 ms to minimize.
[2023-03-09 12:23:09] [INFO ] Deduced a trap composed of 72 places in 71 ms of which 1 ms to minimize.
[2023-03-09 12:23:09] [INFO ] Deduced a trap composed of 72 places in 70 ms of which 0 ms to minimize.
[2023-03-09 12:23:09] [INFO ] Deduced a trap composed of 79 places in 68 ms of which 1 ms to minimize.
[2023-03-09 12:23:09] [INFO ] Deduced a trap composed of 82 places in 76 ms of which 0 ms to minimize.
[2023-03-09 12:23:09] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1356 ms
[2023-03-09 12:23:10] [INFO ] Deduced a trap composed of 101 places in 158 ms of which 1 ms to minimize.
[2023-03-09 12:23:10] [INFO ] Deduced a trap composed of 103 places in 167 ms of which 1 ms to minimize.
[2023-03-09 12:23:10] [INFO ] Deduced a trap composed of 102 places in 162 ms of which 1 ms to minimize.
[2023-03-09 12:23:10] [INFO ] Deduced a trap composed of 100 places in 152 ms of which 1 ms to minimize.
[2023-03-09 12:23:10] [INFO ] Deduced a trap composed of 103 places in 142 ms of which 1 ms to minimize.
[2023-03-09 12:23:11] [INFO ] Deduced a trap composed of 101 places in 165 ms of which 0 ms to minimize.
[2023-03-09 12:23:11] [INFO ] Deduced a trap composed of 111 places in 172 ms of which 0 ms to minimize.
[2023-03-09 12:23:11] [INFO ] Deduced a trap composed of 20 places in 126 ms of which 1 ms to minimize.
[2023-03-09 12:23:11] [INFO ] Deduced a trap composed of 30 places in 94 ms of which 0 ms to minimize.
[2023-03-09 12:23:11] [INFO ] Deduced a trap composed of 43 places in 78 ms of which 0 ms to minimize.
[2023-03-09 12:23:11] [INFO ] Deduced a trap composed of 42 places in 92 ms of which 0 ms to minimize.
[2023-03-09 12:23:11] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1918 ms
[2023-03-09 12:23:12] [INFO ] Deduced a trap composed of 98 places in 226 ms of which 1 ms to minimize.
[2023-03-09 12:23:12] [INFO ] Deduced a trap composed of 98 places in 183 ms of which 0 ms to minimize.
[2023-03-09 12:23:12] [INFO ] Deduced a trap composed of 96 places in 255 ms of which 1 ms to minimize.
[2023-03-09 12:23:12] [INFO ] Deduced a trap composed of 106 places in 269 ms of which 2 ms to minimize.
[2023-03-09 12:23:13] [INFO ] Deduced a trap composed of 102 places in 168 ms of which 10 ms to minimize.
[2023-03-09 12:23:13] [INFO ] Deduced a trap composed of 98 places in 173 ms of which 1 ms to minimize.
[2023-03-09 12:23:13] [INFO ] Deduced a trap composed of 103 places in 184 ms of which 1 ms to minimize.
[2023-03-09 12:23:13] [INFO ] Deduced a trap composed of 102 places in 151 ms of which 1 ms to minimize.
[2023-03-09 12:23:13] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1892 ms
[2023-03-09 12:23:14] [INFO ] After 7933ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :14
Attempting to minimize the solution found.
Minimization took 589 ms.
[2023-03-09 12:23:14] [INFO ] After 8974ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :14
Fused 14 Parikh solutions to 13 different solutions.
Parikh walk visited 4 properties in 417 ms.
Support contains 14 out of 592 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 592/592 places, 513/513 transitions.
Graph (trivial) has 269 edges and 592 vertex of which 6 / 592 are part of one of the 1 SCC in 4 ms
Free SCC test removed 5 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1309 edges and 587 vertex of which 586 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 66 place count 586 transition count 441
Reduce places removed 64 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 66 rules applied. Total rules applied 132 place count 522 transition count 439
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 134 place count 520 transition count 439
Performed 118 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 118 Pre rules applied. Total rules applied 134 place count 520 transition count 321
Deduced a syphon composed of 118 places in 3 ms
Ensure Unique test removed 23 places
Reduce places removed 141 places and 0 transitions.
Iterating global reduction 3 with 259 rules applied. Total rules applied 393 place count 379 transition count 321
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 396 place count 376 transition count 318
Iterating global reduction 3 with 3 rules applied. Total rules applied 399 place count 376 transition count 318
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 400 place count 375 transition count 317
Iterating global reduction 3 with 1 rules applied. Total rules applied 401 place count 375 transition count 317
Performed 157 Post agglomeration using F-continuation condition.Transition count delta: 157
Deduced a syphon composed of 157 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 161 places and 0 transitions.
Iterating global reduction 3 with 318 rules applied. Total rules applied 719 place count 214 transition count 160
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 721 place count 213 transition count 163
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 723 place count 213 transition count 161
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 725 place count 211 transition count 161
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 726 place count 211 transition count 161
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 727 place count 210 transition count 160
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 728 place count 209 transition count 160
Applied a total of 728 rules in 201 ms. Remains 209 /592 variables (removed 383) and now considering 160/513 (removed 353) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 201 ms. Remains : 209/592 places, 160/513 transitions.
Finished random walk after 759 steps, including 35 resets, run visited all 10 properties in 16 ms. (steps per millisecond=47 )
FORMULA BusinessProcesses-PT-19-LTLCardinality-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 533 stabilizing places and 464 stable transitions
Graph (complete) has 1316 edges and 592 vertex of which 591 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.29 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((!p0&&F((X((!p1 U (p2||G(!p1))))||(p0&&F(G(!p1))))))||G(F(((!p1 U (p2||G(!p1)))||(p0&&F(G(!p1)))))))))'
Support contains 4 out of 592 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 592/592 places, 513/513 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 585 transition count 506
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 585 transition count 506
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 18 place count 581 transition count 502
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 581 transition count 502
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 580 transition count 501
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 580 transition count 501
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 579 transition count 500
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 579 transition count 500
Applied a total of 26 rules in 96 ms. Remains 579 /592 variables (removed 13) and now considering 500/513 (removed 13) transitions.
// Phase 1: matrix 500 rows 579 cols
[2023-03-09 12:23:15] [INFO ] Computed 117 place invariants in 29 ms
[2023-03-09 12:23:16] [INFO ] Implicit Places using invariants in 284 ms returned []
[2023-03-09 12:23:16] [INFO ] Invariant cache hit.
[2023-03-09 12:23:16] [INFO ] Implicit Places using invariants and state equation in 733 ms returned []
Implicit Place search using SMT with State Equation took 1022 ms to find 0 implicit places.
[2023-03-09 12:23:16] [INFO ] Invariant cache hit.
[2023-03-09 12:23:17] [INFO ] Dead Transitions using invariants and state equation in 285 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 579/592 places, 500/513 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1407 ms. Remains : 579/592 places, 500/513 transitions.
Stuttering acceptance computed with spot in 273 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2))]
Running random walk in product with property : BusinessProcesses-PT-19-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(OR (NOT p0) (AND p1 (NOT p2))), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(NEQ s572 1), p1:(OR (EQ s465 0) (EQ s329 1)), p2:(AND (NOT (OR (EQ s465 0) (EQ s329 1))) (NEQ s198 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 171 steps with 0 reset in 5 ms.
FORMULA BusinessProcesses-PT-19-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-19-LTLCardinality-01 finished in 1775 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 592 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 592/592 places, 513/513 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 584 transition count 505
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 584 transition count 505
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 20 place count 580 transition count 501
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 580 transition count 501
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 579 transition count 500
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 579 transition count 500
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 578 transition count 499
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 578 transition count 499
Applied a total of 28 rules in 89 ms. Remains 578 /592 variables (removed 14) and now considering 499/513 (removed 14) transitions.
// Phase 1: matrix 499 rows 578 cols
[2023-03-09 12:23:17] [INFO ] Computed 117 place invariants in 15 ms
[2023-03-09 12:23:17] [INFO ] Implicit Places using invariants in 277 ms returned []
[2023-03-09 12:23:17] [INFO ] Invariant cache hit.
[2023-03-09 12:23:18] [INFO ] Implicit Places using invariants and state equation in 728 ms returned []
Implicit Place search using SMT with State Equation took 1011 ms to find 0 implicit places.
[2023-03-09 12:23:18] [INFO ] Invariant cache hit.
[2023-03-09 12:23:19] [INFO ] Dead Transitions using invariants and state equation in 357 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 578/592 places, 499/513 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1458 ms. Remains : 578/592 places, 499/513 transitions.
Stuttering acceptance computed with spot in 128 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-19-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s324 0) (EQ s473 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 149 steps with 0 reset in 2 ms.
FORMULA BusinessProcesses-PT-19-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-19-LTLCardinality-02 finished in 1615 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 592 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 592/592 places, 513/513 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 584 transition count 505
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 584 transition count 505
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 20 place count 580 transition count 501
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 580 transition count 501
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 579 transition count 500
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 579 transition count 500
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 578 transition count 499
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 578 transition count 499
Applied a total of 28 rules in 86 ms. Remains 578 /592 variables (removed 14) and now considering 499/513 (removed 14) transitions.
[2023-03-09 12:23:19] [INFO ] Invariant cache hit.
[2023-03-09 12:23:19] [INFO ] Implicit Places using invariants in 257 ms returned []
[2023-03-09 12:23:19] [INFO ] Invariant cache hit.
[2023-03-09 12:23:20] [INFO ] Implicit Places using invariants and state equation in 719 ms returned []
Implicit Place search using SMT with State Equation took 981 ms to find 0 implicit places.
[2023-03-09 12:23:20] [INFO ] Invariant cache hit.
[2023-03-09 12:23:20] [INFO ] Dead Transitions using invariants and state equation in 261 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 578/592 places, 499/513 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1333 ms. Remains : 578/592 places, 499/513 transitions.
Stuttering acceptance computed with spot in 222 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-19-LTLCardinality-06 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:(OR (EQ s196 0) (EQ s567 1)), p0:(AND (EQ s567 0) (EQ s196 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 174 steps with 0 reset in 3 ms.
FORMULA BusinessProcesses-PT-19-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-19-LTLCardinality-06 finished in 1585 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((p0&&X(X(X(F(p1)))))) U G(p0))))'
Support contains 4 out of 592 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 592/592 places, 513/513 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 584 transition count 505
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 584 transition count 505
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 20 place count 580 transition count 501
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 580 transition count 501
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 579 transition count 500
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 579 transition count 500
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 578 transition count 499
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 578 transition count 499
Applied a total of 28 rules in 84 ms. Remains 578 /592 variables (removed 14) and now considering 499/513 (removed 14) transitions.
[2023-03-09 12:23:20] [INFO ] Invariant cache hit.
[2023-03-09 12:23:21] [INFO ] Implicit Places using invariants in 273 ms returned []
[2023-03-09 12:23:21] [INFO ] Invariant cache hit.
[2023-03-09 12:23:21] [INFO ] Implicit Places using invariants and state equation in 785 ms returned []
Implicit Place search using SMT with State Equation took 1061 ms to find 0 implicit places.
[2023-03-09 12:23:21] [INFO ] Invariant cache hit.
[2023-03-09 12:23:22] [INFO ] Dead Transitions using invariants and state equation in 329 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 578/592 places, 499/513 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1475 ms. Remains : 578/592 places, 499/513 transitions.
Stuttering acceptance computed with spot in 634 ms :[(NOT p0), (NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true, (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-19-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 5}, { cond=p0, acceptance={} source=0 dest: 7}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=(NOT p0), acceptance={} source=2 dest: 4}, { cond=p0, acceptance={} source=2 dest: 6}], [{ cond=p0, acceptance={} source=3 dest: 2}, { cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=p0, acceptance={} source=5 dest: 3}, { cond=(NOT p0), acceptance={} source=5 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=6 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0} source=6 dest: 6}, { cond=(AND p0 p1), acceptance={0} source=6 dest: 7}], [{ cond=(NOT p0), acceptance={} source=7 dest: 4}, { cond=p0, acceptance={} source=7 dest: 7}]], initial=1, aps=[p0:(OR (EQ s73 0) (EQ s9 1)), p1:(OR (EQ s386 0) (EQ s416 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4828 steps with 25 reset in 26 ms.
FORMULA BusinessProcesses-PT-19-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-19-LTLCardinality-07 finished in 2176 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 4 out of 592 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 592/592 places, 513/513 transitions.
Graph (trivial) has 279 edges and 592 vertex of which 6 / 592 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1310 edges and 587 vertex of which 586 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.8 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 68 transitions
Trivial Post-agglo rules discarded 68 transitions
Performed 68 trivial Post agglomeration. Transition count delta: 68
Iterating post reduction 0 with 68 rules applied. Total rules applied 70 place count 585 transition count 437
Reduce places removed 68 places and 0 transitions.
Iterating post reduction 1 with 68 rules applied. Total rules applied 138 place count 517 transition count 437
Performed 124 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 124 Pre rules applied. Total rules applied 138 place count 517 transition count 313
Deduced a syphon composed of 124 places in 1 ms
Ensure Unique test removed 24 places
Reduce places removed 148 places and 0 transitions.
Iterating global reduction 2 with 272 rules applied. Total rules applied 410 place count 369 transition count 313
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 416 place count 363 transition count 307
Iterating global reduction 2 with 6 rules applied. Total rules applied 422 place count 363 transition count 307
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 423 place count 362 transition count 306
Iterating global reduction 2 with 1 rules applied. Total rules applied 424 place count 362 transition count 306
Performed 157 Post agglomeration using F-continuation condition.Transition count delta: 157
Deduced a syphon composed of 157 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 162 places and 0 transitions.
Iterating global reduction 2 with 319 rules applied. Total rules applied 743 place count 200 transition count 149
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 745 place count 199 transition count 152
Applied a total of 745 rules in 115 ms. Remains 199 /592 variables (removed 393) and now considering 152/513 (removed 361) transitions.
// Phase 1: matrix 152 rows 199 cols
[2023-03-09 12:23:23] [INFO ] Computed 88 place invariants in 3 ms
[2023-03-09 12:23:23] [INFO ] Implicit Places using invariants in 171 ms returned [1, 2, 3, 4, 5, 13, 14, 15, 16, 17, 18, 21, 22, 23, 24, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61]
Discarding 29 places :
Implicit Place search using SMT only with invariants took 175 ms to find 29 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 170/592 places, 152/513 transitions.
Applied a total of 0 rules in 9 ms. Remains 170 /170 variables (removed 0) and now considering 152/152 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 301 ms. Remains : 170/592 places, 152/513 transitions.
Stuttering acceptance computed with spot in 54 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-19-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s86 0) (EQ s122 1)), p1:(OR (EQ s20 0) (EQ s141 1))], nbAcceptance=2, 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 21285 reset in 421 ms.
Product exploration explored 100000 steps with 21311 reset in 417 ms.
Computed a total of 145 stabilizing places and 132 stable transitions
Computed a total of 145 stabilizing places and 132 stable transitions
Detected a total of 145/170 stabilizing places and 132/152 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 p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X (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))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 374 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 44 ms :[(AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2405 resets, run finished after 217 ms. (steps per millisecond=46 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 757 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 758 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 737 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 742 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 4) seen :0
Finished probabilistic random walk after 182 steps, run visited all 4 properties in 11 ms. (steps per millisecond=16 )
Probabilistic random walk after 182 steps, saw 117 distinct states, run finished after 11 ms. (steps per millisecond=16 ) properties seen :4
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X (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))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT (AND p0 p1))), (F (AND p0 (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 10 factoid took 368 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 32 ms :[(AND (NOT p0) (NOT p1))]
Support contains 4 out of 170 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 170/170 places, 152/152 transitions.
Applied a total of 0 rules in 8 ms. Remains 170 /170 variables (removed 0) and now considering 152/152 (removed 0) transitions.
// Phase 1: matrix 152 rows 170 cols
[2023-03-09 12:23:25] [INFO ] Computed 59 place invariants in 2 ms
[2023-03-09 12:23:25] [INFO ] Implicit Places using invariants in 104 ms returned []
[2023-03-09 12:23:25] [INFO ] Invariant cache hit.
[2023-03-09 12:23:25] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-09 12:23:25] [INFO ] Implicit Places using invariants and state equation in 262 ms returned [1, 3, 5, 10, 34, 35, 37, 39, 41, 43, 45, 47, 49, 51, 53, 55, 57, 59, 60, 75, 77, 81, 87, 89, 91, 93, 95, 97, 99, 101, 103, 105, 107, 109]
Discarding 34 places :
Implicit Place search using SMT with State Equation took 369 ms to find 34 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 136/170 places, 152/152 transitions.
Graph (complete) has 427 edges and 136 vertex of which 125 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.1 ms
Discarding 11 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 125 transition count 135
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 25 place count 113 transition count 135
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 37 place count 101 transition count 98
Iterating global reduction 2 with 12 rules applied. Total rules applied 49 place count 101 transition count 98
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 3 rules applied. Total rules applied 52 place count 101 transition count 95
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 55 place count 98 transition count 95
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 57 place count 96 transition count 93
Iterating global reduction 4 with 2 rules applied. Total rules applied 59 place count 96 transition count 93
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 4 with 2 rules applied. Total rules applied 61 place count 96 transition count 91
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 62 place count 95 transition count 91
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 6 with 15 rules applied. Total rules applied 77 place count 87 transition count 84
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 79 place count 86 transition count 83
Applied a total of 79 rules in 19 ms. Remains 86 /136 variables (removed 50) and now considering 83/152 (removed 69) transitions.
// Phase 1: matrix 83 rows 86 cols
[2023-03-09 12:23:25] [INFO ] Computed 20 place invariants in 0 ms
[2023-03-09 12:23:25] [INFO ] Implicit Places using invariants in 53 ms returned [5, 6]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 55 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 84/170 places, 83/152 transitions.
Applied a total of 0 rules in 3 ms. Remains 84 /84 variables (removed 0) and now considering 83/83 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 456 ms. Remains : 84/170 places, 83/152 transitions.
Computed a total of 59 stabilizing places and 63 stable transitions
Graph (complete) has 266 edges and 84 vertex of which 83 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 59 stabilizing places and 63 stable transitions
Detected a total of 59/84 stabilizing places and 63/83 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 p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X (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))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 261 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2489 resets, run finished after 201 ms. (steps per millisecond=49 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 730 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 767 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 749 resets, run finished after 137 ms. (steps per millisecond=72 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 764 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 4) seen :0
Finished probabilistic random walk after 188 steps, run visited all 4 properties in 22 ms. (steps per millisecond=8 )
Probabilistic random walk after 188 steps, saw 121 distinct states, run finished after 23 ms. (steps per millisecond=8 ) properties seen :4
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X (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))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT (AND p0 p1))), (F (AND p0 (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 10 factoid took 390 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 207 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 55 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 21818 reset in 146 ms.
Product exploration explored 100000 steps with 21823 reset in 151 ms.
Built C files in :
/tmp/ltsmin14300492134151261731
[2023-03-09 12:23:27] [INFO ] Computing symmetric may disable matrix : 83 transitions.
[2023-03-09 12:23:27] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 12:23:27] [INFO ] Computing symmetric may enable matrix : 83 transitions.
[2023-03-09 12:23:27] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 12:23:27] [INFO ] Computing Do-Not-Accords matrix : 83 transitions.
[2023-03-09 12:23:27] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 12:23:27] [INFO ] Built C files in 44ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14300492134151261731
Running compilation step : cd /tmp/ltsmin14300492134151261731;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 360 ms.
Running link step : cd /tmp/ltsmin14300492134151261731;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 60 ms.
Running LTSmin : cd /tmp/ltsmin14300492134151261731;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15223088297220970894.hoa' '--buchi-type=spotba'
LTSmin run took 203 ms.
FORMULA BusinessProcesses-PT-19-LTLCardinality-09 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property BusinessProcesses-PT-19-LTLCardinality-09 finished in 5633 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0||(p1&&G(p2))) U X(G((!p2 U p0)))))'
Support contains 5 out of 592 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 592/592 places, 513/513 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 587 transition count 508
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 587 transition count 508
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 585 transition count 506
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 585 transition count 506
Applied a total of 14 rules in 38 ms. Remains 585 /592 variables (removed 7) and now considering 506/513 (removed 7) transitions.
// Phase 1: matrix 506 rows 585 cols
[2023-03-09 12:23:28] [INFO ] Computed 117 place invariants in 4 ms
[2023-03-09 12:23:29] [INFO ] Implicit Places using invariants in 382 ms returned []
[2023-03-09 12:23:29] [INFO ] Invariant cache hit.
[2023-03-09 12:23:29] [INFO ] Implicit Places using invariants and state equation in 766 ms returned []
Implicit Place search using SMT with State Equation took 1164 ms to find 0 implicit places.
[2023-03-09 12:23:29] [INFO ] Invariant cache hit.
[2023-03-09 12:23:30] [INFO ] Dead Transitions using invariants and state equation in 288 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 585/592 places, 506/513 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1503 ms. Remains : 585/592 places, 506/513 transitions.
Stuttering acceptance computed with spot in 189 ms :[(NOT p0), false, (NOT p0), true, (NOT p0), (NOT p2)]
Running random walk in product with property : BusinessProcesses-PT-19-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(OR p0 (NOT p2)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 4}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 0}, { cond=(AND p0 p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 5}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p1 p2), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) p2), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 3}, { cond=p2, acceptance={} source=5 dest: 5}]], initial=2, aps=[p0:(EQ s88 1), p2:(OR (EQ s531 0) (EQ s516 1)), p1:(OR (EQ s266 0) (EQ s562 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 554 reset in 370 ms.
Stack based approach found an accepted trace after 3246 steps with 18 reset with depth 5 and stack size 5 in 12 ms.
FORMULA BusinessProcesses-PT-19-LTLCardinality-12 FALSE TECHNIQUES STACK_TEST
Treatment of property BusinessProcesses-PT-19-LTLCardinality-12 finished in 2120 ms.
All properties solved by simple procedures.
Total runtime 29132 ms.

BK_STOP 1678364611308

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-19"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
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 itstools"
echo " Input is BusinessProcesses-PT-19, 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 r037-tajo-167813690600595"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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