Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r065-tajo-171620414900352.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
........................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is BusinessProcesses-PT-15, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r065-tajo-171620414900352
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 680K
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 19K Apr 11 16:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 211K Apr 11 16:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Apr 11 16:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K Apr 11 16:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 157K May 18 16:42 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-15-LTLCardinality-00
FORMULA_NAME BusinessProcesses-PT-15-LTLCardinality-01
FORMULA_NAME BusinessProcesses-PT-15-LTLCardinality-02
FORMULA_NAME BusinessProcesses-PT-15-LTLCardinality-03
FORMULA_NAME BusinessProcesses-PT-15-LTLCardinality-04
FORMULA_NAME BusinessProcesses-PT-15-LTLCardinality-05
FORMULA_NAME BusinessProcesses-PT-15-LTLCardinality-06
FORMULA_NAME BusinessProcesses-PT-15-LTLCardinality-07
FORMULA_NAME BusinessProcesses-PT-15-LTLCardinality-08
FORMULA_NAME BusinessProcesses-PT-15-LTLCardinality-09
FORMULA_NAME BusinessProcesses-PT-15-LTLCardinality-10
FORMULA_NAME BusinessProcesses-PT-15-LTLCardinality-11
FORMULA_NAME BusinessProcesses-PT-15-LTLCardinality-12
FORMULA_NAME BusinessProcesses-PT-15-LTLCardinality-13
FORMULA_NAME BusinessProcesses-PT-15-LTLCardinality-14
FORMULA_NAME BusinessProcesses-PT-15-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716651336989

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=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-15
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-25 15:35:40] [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]
[2024-05-25 15:35:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 15:35:40] [INFO ] Load time of PNML (sax parser for PT used): 172 ms
[2024-05-25 15:35:40] [INFO ] Transformed 630 places.
[2024-05-25 15:35:40] [INFO ] Transformed 566 transitions.
[2024-05-25 15:35:40] [INFO ] Found NUPN structural information;
[2024-05-25 15:35:40] [INFO ] Parsed PT model containing 630 places and 566 transitions and 1666 arcs in 338 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 17 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
Deduced a syphon composed of 4 places in 36 ms
Reduce places removed 4 places and 4 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA BusinessProcesses-PT-15-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-15-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-15-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-15-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-15-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-15-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-15-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-15-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 23 out of 626 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 626/626 places, 562/562 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 623 transition count 562
Discarding 88 places :
Symmetric choice reduction at 1 with 88 rule applications. Total rules 91 place count 535 transition count 474
Iterating global reduction 1 with 88 rules applied. Total rules applied 179 place count 535 transition count 474
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 221 place count 493 transition count 432
Iterating global reduction 1 with 42 rules applied. Total rules applied 263 place count 493 transition count 432
Applied a total of 263 rules in 237 ms. Remains 493 /626 variables (removed 133) and now considering 432/562 (removed 130) transitions.
// Phase 1: matrix 432 rows 493 cols
[2024-05-25 15:35:41] [INFO ] Computed 99 invariants in 107 ms
[2024-05-25 15:35:43] [INFO ] Implicit Places using invariants in 1964 ms returned []
[2024-05-25 15:35:43] [INFO ] Invariant cache hit.
[2024-05-25 15:35:44] [INFO ] Implicit Places using invariants and state equation in 1831 ms returned []
Implicit Place search using SMT with State Equation took 3875 ms to find 0 implicit places.
[2024-05-25 15:35:44] [INFO ] Invariant cache hit.
[2024-05-25 15:35:49] [INFO ] Dead Transitions using invariants and state equation in 4613 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 493/626 places, 432/562 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8742 ms. Remains : 493/626 places, 432/562 transitions.
Support contains 23 out of 493 places after structural reductions.
[2024-05-25 15:35:50] [INFO ] Flatten gal took : 133 ms
[2024-05-25 15:35:50] [INFO ] Flatten gal took : 66 ms
[2024-05-25 15:35:50] [INFO ] Input system was already deterministic with 432 transitions.
Incomplete random walk after 10000 steps, including 67 resets, run finished after 553 ms. (steps per millisecond=18 ) properties (out of 14) seen :3
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2024-05-25 15:35:51] [INFO ] Invariant cache hit.
[2024-05-25 15:35:52] [INFO ] [Real]Absence check using 58 positive place invariants in 287 ms returned sat
[2024-05-25 15:35:52] [INFO ] [Real]Absence check using 58 positive and 41 generalized place invariants in 246 ms returned sat
[2024-05-25 15:35:53] [INFO ] After 1584ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2024-05-25 15:35:53] [INFO ] [Nat]Absence check using 58 positive place invariants in 163 ms returned sat
[2024-05-25 15:35:53] [INFO ] [Nat]Absence check using 58 positive and 41 generalized place invariants in 215 ms returned sat
[2024-05-25 15:35:54] [INFO ] After 457ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2024-05-25 15:35:54] [INFO ] Deduced a trap composed of 88 places in 307 ms of which 20 ms to minimize.
[2024-05-25 15:35:54] [INFO ] Deduced a trap composed of 11 places in 282 ms of which 1 ms to minimize.
[2024-05-25 15:35:55] [INFO ] Deduced a trap composed of 19 places in 187 ms of which 13 ms to minimize.
[2024-05-25 15:35:55] [INFO ] Deduced a trap composed of 13 places in 201 ms of which 2 ms to minimize.
[2024-05-25 15:35:55] [INFO ] Deduced a trap composed of 11 places in 172 ms of which 1 ms to minimize.
[2024-05-25 15:35:55] [INFO ] Deduced a trap composed of 49 places in 232 ms of which 0 ms to minimize.
[2024-05-25 15:35:56] [INFO ] Deduced a trap composed of 87 places in 173 ms of which 1 ms to minimize.
[2024-05-25 15:35:57] [INFO ] Deduced a trap composed of 86 places in 982 ms of which 0 ms to minimize.
[2024-05-25 15:35:57] [INFO ] Deduced a trap composed of 90 places in 208 ms of which 1 ms to minimize.
[2024-05-25 15:35:57] [INFO ] Deduced a trap composed of 14 places in 225 ms of which 1 ms to minimize.
[2024-05-25 15:35:57] [INFO ] Deduced a trap composed of 23 places in 133 ms of which 1 ms to minimize.
[2024-05-25 15:35:57] [INFO ] Deduced a trap composed of 29 places in 140 ms of which 1 ms to minimize.
[2024-05-25 15:35:57] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 3653 ms
[2024-05-25 15:35:58] [INFO ] Deduced a trap composed of 92 places in 259 ms of which 1 ms to minimize.
[2024-05-25 15:35:58] [INFO ] Deduced a trap composed of 91 places in 506 ms of which 1 ms to minimize.
[2024-05-25 15:35:59] [INFO ] Deduced a trap composed of 86 places in 177 ms of which 1 ms to minimize.
[2024-05-25 15:35:59] [INFO ] Deduced a trap composed of 17 places in 177 ms of which 1 ms to minimize.
[2024-05-25 15:35:59] [INFO ] Deduced a trap composed of 86 places in 311 ms of which 0 ms to minimize.
[2024-05-25 15:36:00] [INFO ] Deduced a trap composed of 90 places in 361 ms of which 1 ms to minimize.
[2024-05-25 15:36:00] [INFO ] Deduced a trap composed of 89 places in 229 ms of which 1 ms to minimize.
[2024-05-25 15:36:00] [INFO ] Deduced a trap composed of 97 places in 161 ms of which 1 ms to minimize.
[2024-05-25 15:36:00] [INFO ] Deduced a trap composed of 88 places in 158 ms of which 1 ms to minimize.
[2024-05-25 15:36:00] [INFO ] Deduced a trap composed of 91 places in 165 ms of which 1 ms to minimize.
[2024-05-25 15:36:01] [INFO ] Deduced a trap composed of 93 places in 167 ms of which 1 ms to minimize.
[2024-05-25 15:36:01] [INFO ] Deduced a trap composed of 87 places in 193 ms of which 1 ms to minimize.
[2024-05-25 15:36:01] [INFO ] Deduced a trap composed of 100 places in 202 ms of which 1 ms to minimize.
[2024-05-25 15:36:01] [INFO ] Deduced a trap composed of 90 places in 132 ms of which 4 ms to minimize.
[2024-05-25 15:36:01] [INFO ] Deduced a trap composed of 91 places in 165 ms of which 1 ms to minimize.
[2024-05-25 15:36:02] [INFO ] Deduced a trap composed of 91 places in 192 ms of which 1 ms to minimize.
[2024-05-25 15:36:02] [INFO ] Deduced a trap composed of 88 places in 264 ms of which 1 ms to minimize.
[2024-05-25 15:36:02] [INFO ] Deduced a trap composed of 90 places in 224 ms of which 1 ms to minimize.
[2024-05-25 15:36:02] [INFO ] Deduced a trap composed of 89 places in 203 ms of which 1 ms to minimize.
[2024-05-25 15:36:03] [INFO ] Deduced a trap composed of 110 places in 202 ms of which 1 ms to minimize.
[2024-05-25 15:36:03] [INFO ] Deduced a trap composed of 97 places in 230 ms of which 1 ms to minimize.
[2024-05-25 15:36:03] [INFO ] Deduced a trap composed of 98 places in 218 ms of which 15 ms to minimize.
[2024-05-25 15:36:03] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 5734 ms
[2024-05-25 15:36:04] [INFO ] Deduced a trap composed of 89 places in 185 ms of which 1 ms to minimize.
[2024-05-25 15:36:04] [INFO ] Deduced a trap composed of 87 places in 205 ms of which 1 ms to minimize.
[2024-05-25 15:36:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 472 ms
[2024-05-25 15:36:04] [INFO ] After 10705ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 354 ms.
[2024-05-25 15:36:04] [INFO ] After 11804ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Fused 8 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 211 ms.
Support contains 13 out of 493 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 493/493 places, 432/432 transitions.
Graph (trivial) has 214 edges and 493 vertex of which 6 / 493 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 1109 edges and 488 vertex of which 487 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 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 47 rules applied. Total rules applied 49 place count 487 transition count 377
Reduce places removed 47 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 49 rules applied. Total rules applied 98 place count 440 transition count 375
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 100 place count 438 transition count 375
Performed 97 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 97 Pre rules applied. Total rules applied 100 place count 438 transition count 278
Deduced a syphon composed of 97 places in 1 ms
Ensure Unique test removed 18 places
Reduce places removed 115 places and 0 transitions.
Iterating global reduction 3 with 212 rules applied. Total rules applied 312 place count 323 transition count 278
Performed 129 Post agglomeration using F-continuation condition.Transition count delta: 129
Deduced a syphon composed of 129 places in 23 ms
Ensure Unique test removed 3 places
Reduce places removed 132 places and 0 transitions.
Iterating global reduction 3 with 261 rules applied. Total rules applied 573 place count 191 transition count 149
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 575 place count 190 transition count 153
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 577 place count 190 transition count 151
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 579 place count 188 transition count 151
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 580 place count 187 transition count 150
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 581 place count 186 transition count 150
Applied a total of 581 rules in 179 ms. Remains 186 /493 variables (removed 307) and now considering 150/432 (removed 282) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 179 ms. Remains : 186/493 places, 150/432 transitions.
Incomplete random walk after 10000 steps, including 201 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 8) seen :7
Finished Best-First random walk after 53 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=53 )
Parikh walk visited 0 properties in 0 ms.
FORMULA BusinessProcesses-PT-15-LTLCardinality-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 208 stabilizing places and 180 stable transitions
Graph (complete) has 1116 edges and 493 vertex of which 492 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.15 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 493 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 493/493 places, 432/432 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 488 transition count 427
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 488 transition count 427
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 14 place count 484 transition count 423
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 484 transition count 423
Applied a total of 18 rules in 54 ms. Remains 484 /493 variables (removed 9) and now considering 423/432 (removed 9) transitions.
// Phase 1: matrix 423 rows 484 cols
[2024-05-25 15:36:06] [INFO ] Computed 99 invariants in 23 ms
[2024-05-25 15:36:06] [INFO ] Implicit Places using invariants in 651 ms returned []
[2024-05-25 15:36:06] [INFO ] Invariant cache hit.
[2024-05-25 15:36:07] [INFO ] Implicit Places using invariants and state equation in 769 ms returned []
Implicit Place search using SMT with State Equation took 1423 ms to find 0 implicit places.
[2024-05-25 15:36:07] [INFO ] Invariant cache hit.
[2024-05-25 15:36:07] [INFO ] Dead Transitions using invariants and state equation in 303 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 484/493 places, 423/432 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1782 ms. Remains : 484/493 places, 423/432 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 289 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-15-LTLCardinality-00 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 s39 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 86 steps with 0 reset in 2 ms.
FORMULA BusinessProcesses-PT-15-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-15-LTLCardinality-00 finished in 2171 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&X(G(p1)))))'
Support contains 4 out of 493 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 493/493 places, 432/432 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 490 transition count 429
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 490 transition count 429
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 488 transition count 427
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 488 transition count 427
Applied a total of 10 rules in 41 ms. Remains 488 /493 variables (removed 5) and now considering 427/432 (removed 5) transitions.
// Phase 1: matrix 427 rows 488 cols
[2024-05-25 15:36:08] [INFO ] Computed 99 invariants in 6 ms
[2024-05-25 15:36:10] [INFO ] Implicit Places using invariants in 2408 ms returned []
[2024-05-25 15:36:10] [INFO ] Invariant cache hit.
[2024-05-25 15:36:11] [INFO ] Implicit Places using invariants and state equation in 996 ms returned []
Implicit Place search using SMT with State Equation took 3411 ms to find 0 implicit places.
[2024-05-25 15:36:11] [INFO ] Invariant cache hit.
[2024-05-25 15:36:11] [INFO ] Dead Transitions using invariants and state equation in 315 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 488/493 places, 427/432 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3769 ms. Remains : 488/493 places, 427/432 transitions.
Stuttering acceptance computed with spot in 218 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-15-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=4, aps=[p1:(OR (EQ s202 0) (EQ s443 1)), p0:(AND (EQ s67 0) (EQ s429 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][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 158 steps with 0 reset in 2 ms.
FORMULA BusinessProcesses-PT-15-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-15-LTLCardinality-02 finished in 4030 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 493 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 493/493 places, 432/432 transitions.
Graph (trivial) has 230 edges and 493 vertex of which 6 / 493 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 1110 edges and 488 vertex of which 487 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 52 rules applied. Total rules applied 54 place count 486 transition count 372
Reduce places removed 52 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 54 rules applied. Total rules applied 108 place count 434 transition count 370
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 110 place count 432 transition count 370
Performed 103 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 103 Pre rules applied. Total rules applied 110 place count 432 transition count 267
Deduced a syphon composed of 103 places in 1 ms
Ensure Unique test removed 19 places
Reduce places removed 122 places and 0 transitions.
Iterating global reduction 3 with 225 rules applied. Total rules applied 335 place count 310 transition count 267
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 340 place count 305 transition count 262
Iterating global reduction 3 with 5 rules applied. Total rules applied 345 place count 305 transition count 262
Performed 129 Post agglomeration using F-continuation condition.Transition count delta: 129
Deduced a syphon composed of 129 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 133 places and 0 transitions.
Iterating global reduction 3 with 262 rules applied. Total rules applied 607 place count 172 transition count 133
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 609 place count 171 transition count 137
Applied a total of 609 rules in 81 ms. Remains 171 /493 variables (removed 322) and now considering 137/432 (removed 295) transitions.
// Phase 1: matrix 137 rows 171 cols
[2024-05-25 15:36:12] [INFO ] Computed 76 invariants in 2 ms
[2024-05-25 15:36:12] [INFO ] Implicit Places using invariants in 145 ms returned [1, 2, 3, 4, 9, 10, 33, 34, 35, 36, 41, 42, 43, 47, 48, 49, 50, 51, 54, 55, 56, 145]
Discarding 22 places :
Implicit Place search using SMT only with invariants took 148 ms to find 22 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 149/493 places, 137/432 transitions.
Applied a total of 0 rules in 8 ms. Remains 149 /149 variables (removed 0) and now considering 137/137 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 238 ms. Remains : 149/493 places, 137/432 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-15-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s2 0) (EQ s35 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-15-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-15-LTLCardinality-03 finished in 298 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(((p0&&G(p1))||(p0&&X(p2))))))'
Support contains 4 out of 493 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 493/493 places, 432/432 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 489 transition count 428
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 489 transition count 428
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 486 transition count 425
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 486 transition count 425
Applied a total of 14 rules in 25 ms. Remains 486 /493 variables (removed 7) and now considering 425/432 (removed 7) transitions.
// Phase 1: matrix 425 rows 486 cols
[2024-05-25 15:36:12] [INFO ] Computed 99 invariants in 6 ms
[2024-05-25 15:36:12] [INFO ] Implicit Places using invariants in 169 ms returned []
[2024-05-25 15:36:12] [INFO ] Invariant cache hit.
[2024-05-25 15:36:13] [INFO ] Implicit Places using invariants and state equation in 510 ms returned []
Implicit Place search using SMT with State Equation took 685 ms to find 0 implicit places.
[2024-05-25 15:36:13] [INFO ] Invariant cache hit.
[2024-05-25 15:36:13] [INFO ] Dead Transitions using invariants and state equation in 268 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 486/493 places, 425/432 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 980 ms. Remains : 486/493 places, 425/432 transitions.
Stuttering acceptance computed with spot in 270 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : BusinessProcesses-PT-15-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 2}, { cond=(AND p0 p1), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 2}, { cond=(AND p0 p1), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s195 1), p1:(OR (EQ s431 0) (EQ s293 1)), p2:(EQ s353 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 136 steps with 0 reset in 2 ms.
FORMULA BusinessProcesses-PT-15-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-15-LTLCardinality-04 finished in 1281 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 2 out of 493 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 493/493 places, 432/432 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 489 transition count 428
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 489 transition count 428
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 485 transition count 424
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 485 transition count 424
Applied a total of 16 rules in 54 ms. Remains 485 /493 variables (removed 8) and now considering 424/432 (removed 8) transitions.
// Phase 1: matrix 424 rows 485 cols
[2024-05-25 15:36:13] [INFO ] Computed 99 invariants in 11 ms
[2024-05-25 15:36:14] [INFO ] Implicit Places using invariants in 229 ms returned []
[2024-05-25 15:36:14] [INFO ] Invariant cache hit.
[2024-05-25 15:36:14] [INFO ] Implicit Places using invariants and state equation in 634 ms returned []
Implicit Place search using SMT with State Equation took 867 ms to find 0 implicit places.
[2024-05-25 15:36:14] [INFO ] Invariant cache hit.
[2024-05-25 15:36:14] [INFO ] Dead Transitions using invariants and state equation in 263 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 485/493 places, 424/432 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1187 ms. Remains : 485/493 places, 424/432 transitions.
Stuttering acceptance computed with spot in 182 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-15-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(OR (EQ s174 0) (EQ s406 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 681 reset in 305 ms.
Product exploration explored 100000 steps with 672 reset in 297 ms.
Computed a total of 204 stabilizing places and 176 stable transitions
Graph (complete) has 1105 edges and 485 vertex of which 484 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Computed a total of 204 stabilizing places and 176 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 88 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 174 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 68 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Finished probabilistic random walk after 2201 steps, run visited all 1 properties in 22 ms. (steps per millisecond=100 )
Probabilistic random walk after 2201 steps, saw 1970 distinct states, run finished after 22 ms. (steps per millisecond=100 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 93 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 160 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 143 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 485 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 485/485 places, 424/424 transitions.
Applied a total of 0 rules in 10 ms. Remains 485 /485 variables (removed 0) and now considering 424/424 (removed 0) transitions.
[2024-05-25 15:36:16] [INFO ] Invariant cache hit.
[2024-05-25 15:36:16] [INFO ] Implicit Places using invariants in 162 ms returned []
[2024-05-25 15:36:16] [INFO ] Invariant cache hit.
[2024-05-25 15:36:17] [INFO ] Implicit Places using invariants and state equation in 560 ms returned []
Implicit Place search using SMT with State Equation took 743 ms to find 0 implicit places.
[2024-05-25 15:36:17] [INFO ] Invariant cache hit.
[2024-05-25 15:36:17] [INFO ] Dead Transitions using invariants and state equation in 258 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1016 ms. Remains : 485/485 places, 424/424 transitions.
Computed a total of 204 stabilizing places and 176 stable transitions
Graph (complete) has 1105 edges and 485 vertex of which 484 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Computed a total of 204 stabilizing places and 176 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 100 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 182 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 67 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 10 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Finished probabilistic random walk after 2201 steps, run visited all 1 properties in 15 ms. (steps per millisecond=146 )
Probabilistic random walk after 2201 steps, saw 1970 distinct states, run finished after 15 ms. (steps per millisecond=146 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 112 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 157 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 179 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 215 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 680 reset in 252 ms.
Entered a terminal (fully accepting) state of product in 6813 steps with 44 reset in 14 ms.
FORMULA BusinessProcesses-PT-15-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-15-LTLCardinality-08 finished in 5083 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 493 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 493/493 places, 432/432 transitions.
Graph (trivial) has 231 edges and 493 vertex of which 6 / 493 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 1110 edges and 488 vertex of which 487 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 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 56 place count 486 transition count 370
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 110 place count 432 transition count 370
Performed 103 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 103 Pre rules applied. Total rules applied 110 place count 432 transition count 267
Deduced a syphon composed of 103 places in 0 ms
Ensure Unique test removed 20 places
Reduce places removed 123 places and 0 transitions.
Iterating global reduction 2 with 226 rules applied. Total rules applied 336 place count 309 transition count 267
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 341 place count 304 transition count 262
Iterating global reduction 2 with 5 rules applied. Total rules applied 346 place count 304 transition count 262
Performed 130 Post agglomeration using F-continuation condition.Transition count delta: 130
Deduced a syphon composed of 130 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 134 places and 0 transitions.
Iterating global reduction 2 with 264 rules applied. Total rules applied 610 place count 170 transition count 132
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 612 place count 169 transition count 136
Applied a total of 612 rules in 38 ms. Remains 169 /493 variables (removed 324) and now considering 136/432 (removed 296) transitions.
// Phase 1: matrix 136 rows 169 cols
[2024-05-25 15:36:18] [INFO ] Computed 75 invariants in 2 ms
[2024-05-25 15:36:19] [INFO ] Implicit Places using invariants in 115 ms returned [1, 2, 3, 4, 5, 8, 9, 33, 34, 35, 36, 41, 42, 43, 47, 48, 49, 50, 51, 52, 53, 54]
Discarding 22 places :
Implicit Place search using SMT only with invariants took 117 ms to find 22 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 147/493 places, 136/432 transitions.
Applied a total of 0 rules in 5 ms. Remains 147 /147 variables (removed 0) and now considering 136/136 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 162 ms. Remains : 147/493 places, 136/432 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-15-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s13 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-15-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-15-LTLCardinality-13 finished in 230 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(F(p1))))'
Support contains 4 out of 493 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 493/493 places, 432/432 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 489 transition count 428
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 489 transition count 428
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 486 transition count 425
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 486 transition count 425
Applied a total of 14 rules in 28 ms. Remains 486 /493 variables (removed 7) and now considering 425/432 (removed 7) transitions.
// Phase 1: matrix 425 rows 486 cols
[2024-05-25 15:36:19] [INFO ] Computed 99 invariants in 5 ms
[2024-05-25 15:36:19] [INFO ] Implicit Places using invariants in 165 ms returned []
[2024-05-25 15:36:19] [INFO ] Invariant cache hit.
[2024-05-25 15:36:19] [INFO ] Implicit Places using invariants and state equation in 526 ms returned []
Implicit Place search using SMT with State Equation took 695 ms to find 0 implicit places.
[2024-05-25 15:36:19] [INFO ] Invariant cache hit.
[2024-05-25 15:36:20] [INFO ] Dead Transitions using invariants and state equation in 218 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 486/493 places, 425/432 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 943 ms. Remains : 486/493 places, 425/432 transitions.
Stuttering acceptance computed with spot in 110 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-15-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(AND (EQ s376 0) (EQ s404 1)), p0:(OR (EQ s427 0) (EQ s142 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 674 reset in 240 ms.
Product exploration explored 100000 steps with 679 reset in 257 ms.
Computed a total of 206 stabilizing places and 178 stable transitions
Graph (complete) has 1106 edges and 486 vertex of which 485 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Computed a total of 206 stabilizing places and 178 stable transitions
Detected a total of 206/486 stabilizing places and 178/425 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X (AND p0 (NOT p1)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 116 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 189 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Incomplete random walk after 10000 steps, including 67 resets, run finished after 242 ms. (steps per millisecond=41 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 452047 steps, run timeout after 3001 ms. (steps per millisecond=150 ) properties seen :{1=1, 2=1}
Probabilistic random walk after 452047 steps, saw 76201 distinct states, run finished after 3005 ms. (steps per millisecond=150 ) properties seen :2
Running SMT prover for 3 properties.
[2024-05-25 15:36:24] [INFO ] Invariant cache hit.
[2024-05-25 15:36:24] [INFO ] [Real]Absence check using 58 positive place invariants in 19 ms returned sat
[2024-05-25 15:36:24] [INFO ] [Real]Absence check using 58 positive and 41 generalized place invariants in 13 ms returned sat
[2024-05-25 15:36:24] [INFO ] After 407ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-25 15:36:24] [INFO ] [Nat]Absence check using 58 positive place invariants in 17 ms returned sat
[2024-05-25 15:36:25] [INFO ] [Nat]Absence check using 58 positive and 41 generalized place invariants in 24 ms returned sat
[2024-05-25 15:36:25] [INFO ] After 214ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2024-05-25 15:36:25] [INFO ] Deduced a trap composed of 12 places in 148 ms of which 2 ms to minimize.
[2024-05-25 15:36:25] [INFO ] Deduced a trap composed of 20 places in 86 ms of which 0 ms to minimize.
[2024-05-25 15:36:25] [INFO ] Deduced a trap composed of 24 places in 80 ms of which 2 ms to minimize.
[2024-05-25 15:36:25] [INFO ] Deduced a trap composed of 19 places in 113 ms of which 0 ms to minimize.
[2024-05-25 15:36:25] [INFO ] Deduced a trap composed of 22 places in 79 ms of which 1 ms to minimize.
[2024-05-25 15:36:26] [INFO ] Deduced a trap composed of 38 places in 81 ms of which 1 ms to minimize.
[2024-05-25 15:36:26] [INFO ] Deduced a trap composed of 46 places in 115 ms of which 1 ms to minimize.
[2024-05-25 15:36:26] [INFO ] Deduced a trap composed of 32 places in 63 ms of which 1 ms to minimize.
[2024-05-25 15:36:26] [INFO ] Deduced a trap composed of 36 places in 64 ms of which 1 ms to minimize.
[2024-05-25 15:36:26] [INFO ] Deduced a trap composed of 30 places in 90 ms of which 1 ms to minimize.
[2024-05-25 15:36:26] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1221 ms
[2024-05-25 15:36:26] [INFO ] After 1485ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 73 ms.
[2024-05-25 15:36:26] [INFO ] After 1763ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 9 ms.
Support contains 4 out of 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 425/425 transitions.
Graph (trivial) has 219 edges and 486 vertex of which 6 / 486 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 1099 edges and 481 vertex of which 480 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 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 51 place count 480 transition count 368
Reduce places removed 49 places and 0 transitions.
Iterating post reduction 1 with 49 rules applied. Total rules applied 100 place count 431 transition count 368
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 101 Pre rules applied. Total rules applied 100 place count 431 transition count 267
Deduced a syphon composed of 101 places in 1 ms
Ensure Unique test removed 19 places
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 2 with 221 rules applied. Total rules applied 321 place count 311 transition count 267
Performed 131 Post agglomeration using F-continuation condition.Transition count delta: 131
Deduced a syphon composed of 131 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 134 places and 0 transitions.
Iterating global reduction 2 with 265 rules applied. Total rules applied 586 place count 177 transition count 136
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 588 place count 176 transition count 140
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 590 place count 176 transition count 138
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 592 place count 174 transition count 138
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 593 place count 174 transition count 138
Applied a total of 593 rules in 60 ms. Remains 174 /486 variables (removed 312) and now considering 138/425 (removed 287) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 174/486 places, 138/425 transitions.
Incomplete random walk after 10000 steps, including 253 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 2) seen :0
Finished Best-First random walk after 36 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=36 )
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X (AND p0 (NOT p1)))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND (NOT p0) p1)))]
False Knowledge obtained : [(F p1), (F (AND p0 p1)), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 9 factoid took 370 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 7 states, 17 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 398 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), false, false, false]
Stuttering acceptance computed with spot in 426 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), false, false, false]
Support contains 4 out of 486 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 486/486 places, 425/425 transitions.
Graph (trivial) has 219 edges and 486 vertex of which 6 / 486 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 1100 edges and 481 vertex of which 480 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 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 51 place count 479 transition count 368
Reduce places removed 49 places and 0 transitions.
Iterating post reduction 1 with 49 rules applied. Total rules applied 100 place count 430 transition count 368
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 101 Pre rules applied. Total rules applied 100 place count 430 transition count 267
Deduced a syphon composed of 101 places in 0 ms
Ensure Unique test removed 19 places
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 2 with 221 rules applied. Total rules applied 321 place count 310 transition count 267
Performed 130 Post agglomeration using F-continuation condition.Transition count delta: 130
Deduced a syphon composed of 130 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 133 places and 0 transitions.
Iterating global reduction 2 with 263 rules applied. Total rules applied 584 place count 177 transition count 137
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 586 place count 176 transition count 141
Applied a total of 586 rules in 31 ms. Remains 176 /486 variables (removed 310) and now considering 141/425 (removed 284) transitions.
// Phase 1: matrix 141 rows 176 cols
[2024-05-25 15:36:28] [INFO ] Computed 77 invariants in 1 ms
[2024-05-25 15:36:33] [INFO ] Implicit Places using invariants in 5465 ms returned [1, 2, 3, 4, 5, 6, 9, 10, 33, 34, 35, 36, 37, 44, 45, 46, 50, 51, 52, 53, 54, 55, 56, 57]
Discarding 24 places :
Implicit Place search using SMT only with invariants took 5479 ms to find 24 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 152/486 places, 141/425 transitions.
Applied a total of 0 rules in 8 ms. Remains 152 /152 variables (removed 0) and now considering 141/141 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 5518 ms. Remains : 152/486 places, 141/425 transitions.
Computed a total of 34 stabilizing places and 26 stable transitions
Computed a total of 34 stabilizing places and 26 stable transitions
Detected a total of 34/152 stabilizing places and 26/141 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT p1)), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1))), (X (X (AND p0 (NOT p1)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 305 ms. Reduced automaton from 7 states, 17 edges and 2 AP (stutter insensitive) to 7 states, 18 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 464 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0)), false, false]
Incomplete random walk after 10000 steps, including 1994 resets, run finished after 280 ms. (steps per millisecond=35 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 652 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 653 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 627 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 141 rows 152 cols
[2024-05-25 15:36:34] [INFO ] Computed 53 invariants in 2 ms
[2024-05-25 15:36:34] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-25 15:36:34] [INFO ] [Nat]Absence check using 36 positive place invariants in 7 ms returned sat
[2024-05-25 15:36:34] [INFO ] [Nat]Absence check using 36 positive and 17 generalized place invariants in 5 ms returned sat
[2024-05-25 15:36:34] [INFO ] After 77ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2024-05-25 15:36:34] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-25 15:36:34] [INFO ] After 8ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2024-05-25 15:36:35] [INFO ] After 21ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2024-05-25 15:36:35] [INFO ] After 198ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 152 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 152/152 places, 141/141 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 152 transition count 140
Free-agglomeration rule applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 3 place count 152 transition count 138
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 150 transition count 138
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 150 transition count 138
Applied a total of 6 rules in 35 ms. Remains 150 /152 variables (removed 2) and now considering 138/141 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 150/152 places, 138/141 transitions.
Finished random walk after 33 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=33 )
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT p1)), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1))), (X (X (AND p0 (NOT p1)))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND (NOT p0) p1)))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p1)))), (F (AND p0 p1)), (F p1), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 15 factoid took 436 ms. Reduced automaton from 7 states, 18 edges and 2 AP (stutter insensitive) to 7 states, 17 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 351 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), false, false, false]
Stuttering acceptance computed with spot in 338 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), false, false, false]
Stuttering acceptance computed with spot in 305 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), false, false, false]
Product exploration explored 100000 steps with 17688 reset in 268 ms.
Product exploration explored 100000 steps with 17785 reset in 239 ms.
Built C files in :
/tmp/ltsmin8939368938252443589
[2024-05-25 15:36:37] [INFO ] Computing symmetric may disable matrix : 141 transitions.
[2024-05-25 15:36:37] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 15:36:37] [INFO ] Computing symmetric may enable matrix : 141 transitions.
[2024-05-25 15:36:37] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 15:36:37] [INFO ] Computing Do-Not-Accords matrix : 141 transitions.
[2024-05-25 15:36:37] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 15:36:37] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8939368938252443589
Running compilation step : cd /tmp/ltsmin8939368938252443589;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 617 ms.
Running link step : cd /tmp/ltsmin8939368938252443589;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 70 ms.
Running LTSmin : cd /tmp/ltsmin8939368938252443589;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13383163134204223371.hoa' '--buchi-type=spotba'
LTSmin run took 399 ms.
FORMULA BusinessProcesses-PT-15-LTLCardinality-14 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property BusinessProcesses-PT-15-LTLCardinality-14 finished in 19111 ms.
All properties solved by simple procedures.
Total runtime 58166 ms.

BK_STOP 1716651398479

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /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-15"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is BusinessProcesses-PT-15, 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 r065-tajo-171620414900352"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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