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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K 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.4K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 17:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Apr 11 16:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 98K Apr 11 16:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Apr 11 16:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 11 16:28 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 148K 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-13-LTLCardinality-00
FORMULA_NAME BusinessProcesses-PT-13-LTLCardinality-01
FORMULA_NAME BusinessProcesses-PT-13-LTLCardinality-02
FORMULA_NAME BusinessProcesses-PT-13-LTLCardinality-03
FORMULA_NAME BusinessProcesses-PT-13-LTLCardinality-04
FORMULA_NAME BusinessProcesses-PT-13-LTLCardinality-05
FORMULA_NAME BusinessProcesses-PT-13-LTLCardinality-06
FORMULA_NAME BusinessProcesses-PT-13-LTLCardinality-07
FORMULA_NAME BusinessProcesses-PT-13-LTLCardinality-08
FORMULA_NAME BusinessProcesses-PT-13-LTLCardinality-09
FORMULA_NAME BusinessProcesses-PT-13-LTLCardinality-10
FORMULA_NAME BusinessProcesses-PT-13-LTLCardinality-11
FORMULA_NAME BusinessProcesses-PT-13-LTLCardinality-12
FORMULA_NAME BusinessProcesses-PT-13-LTLCardinality-13
FORMULA_NAME BusinessProcesses-PT-13-LTLCardinality-14
FORMULA_NAME BusinessProcesses-PT-13-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716651164757

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-13
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-25 15:32:46] [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:32:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 15:32:46] [INFO ] Load time of PNML (sax parser for PT used): 104 ms
[2024-05-25 15:32:46] [INFO ] Transformed 593 places.
[2024-05-25 15:32:46] [INFO ] Transformed 536 transitions.
[2024-05-25 15:32:46] [INFO ] Found NUPN structural information;
[2024-05-25 15:32:46] [INFO ] Parsed PT model containing 593 places and 536 transitions and 1582 arcs in 194 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 9 formulas.
Deduced a syphon composed of 8 places in 20 ms
Reduce places removed 8 places and 8 transitions.
FORMULA BusinessProcesses-PT-13-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-13-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-13-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-13-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-13-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-13-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-13-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-13-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-13-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-13-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-13-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-13-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 10 out of 585 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 585/585 places, 528/528 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 580 transition count 528
Discarding 86 places :
Symmetric choice reduction at 1 with 86 rule applications. Total rules 91 place count 494 transition count 442
Iterating global reduction 1 with 86 rules applied. Total rules applied 177 place count 494 transition count 442
Discarding 46 places :
Symmetric choice reduction at 1 with 46 rule applications. Total rules 223 place count 448 transition count 396
Iterating global reduction 1 with 46 rules applied. Total rules applied 269 place count 448 transition count 396
Applied a total of 269 rules in 110 ms. Remains 448 /585 variables (removed 137) and now considering 396/528 (removed 132) transitions.
// Phase 1: matrix 396 rows 448 cols
[2024-05-25 15:32:47] [INFO ] Computed 90 invariants in 60 ms
[2024-05-25 15:32:47] [INFO ] Implicit Places using invariants in 434 ms returned []
[2024-05-25 15:32:47] [INFO ] Invariant cache hit.
[2024-05-25 15:32:48] [INFO ] Implicit Places using invariants and state equation in 550 ms returned []
Implicit Place search using SMT with State Equation took 1011 ms to find 0 implicit places.
[2024-05-25 15:32:48] [INFO ] Invariant cache hit.
[2024-05-25 15:32:48] [INFO ] Dead Transitions using invariants and state equation in 361 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 448/585 places, 396/528 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1485 ms. Remains : 448/585 places, 396/528 transitions.
Support contains 10 out of 448 places after structural reductions.
[2024-05-25 15:32:48] [INFO ] Flatten gal took : 138 ms
[2024-05-25 15:32:48] [INFO ] Flatten gal took : 47 ms
[2024-05-25 15:32:49] [INFO ] Input system was already deterministic with 396 transitions.
Incomplete random walk after 10000 steps, including 72 resets, run finished after 387 ms. (steps per millisecond=25 ) properties (out of 6) seen :5
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-25 15:32:49] [INFO ] Invariant cache hit.
[2024-05-25 15:32:49] [INFO ] [Real]Absence check using 52 positive place invariants in 32 ms returned sat
[2024-05-25 15:32:49] [INFO ] [Real]Absence check using 52 positive and 38 generalized place invariants in 15 ms returned sat
[2024-05-25 15:32:49] [INFO ] After 282ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-25 15:32:50] [INFO ] Deduced a trap composed of 17 places in 171 ms of which 5 ms to minimize.
[2024-05-25 15:32:50] [INFO ] Deduced a trap composed of 11 places in 122 ms of which 1 ms to minimize.
[2024-05-25 15:32:50] [INFO ] Deduced a trap composed of 16 places in 92 ms of which 1 ms to minimize.
[2024-05-25 15:32:50] [INFO ] Deduced a trap composed of 21 places in 103 ms of which 2 ms to minimize.
[2024-05-25 15:32:50] [INFO ] Deduced a trap composed of 26 places in 125 ms of which 1 ms to minimize.
[2024-05-25 15:32:50] [INFO ] Deduced a trap composed of 35 places in 76 ms of which 1 ms to minimize.
[2024-05-25 15:32:50] [INFO ] Deduced a trap composed of 17 places in 129 ms of which 0 ms to minimize.
[2024-05-25 15:32:51] [INFO ] Deduced a trap composed of 15 places in 91 ms of which 1 ms to minimize.
[2024-05-25 15:32:51] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1088 ms
[2024-05-25 15:32:51] [INFO ] After 1399ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 15:32:51] [INFO ] After 1588ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 15:32:51] [INFO ] [Nat]Absence check using 52 positive place invariants in 107 ms returned sat
[2024-05-25 15:32:51] [INFO ] [Nat]Absence check using 52 positive and 38 generalized place invariants in 12 ms returned sat
[2024-05-25 15:32:51] [INFO ] After 306ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 15:32:51] [INFO ] Deduced a trap composed of 15 places in 121 ms of which 1 ms to minimize.
[2024-05-25 15:32:51] [INFO ] Deduced a trap composed of 16 places in 167 ms of which 1 ms to minimize.
[2024-05-25 15:32:52] [INFO ] Deduced a trap composed of 13 places in 119 ms of which 1 ms to minimize.
[2024-05-25 15:32:52] [INFO ] Deduced a trap composed of 17 places in 104 ms of which 1 ms to minimize.
[2024-05-25 15:32:52] [INFO ] Deduced a trap composed of 75 places in 101 ms of which 0 ms to minimize.
[2024-05-25 15:32:52] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 1 ms to minimize.
[2024-05-25 15:32:52] [INFO ] Deduced a trap composed of 19 places in 100 ms of which 1 ms to minimize.
[2024-05-25 15:32:52] [INFO ] Deduced a trap composed of 33 places in 107 ms of which 1 ms to minimize.
[2024-05-25 15:32:52] [INFO ] Deduced a trap composed of 79 places in 89 ms of which 0 ms to minimize.
[2024-05-25 15:32:52] [INFO ] Deduced a trap composed of 75 places in 105 ms of which 0 ms to minimize.
[2024-05-25 15:32:53] [INFO ] Deduced a trap composed of 75 places in 97 ms of which 0 ms to minimize.
[2024-05-25 15:32:53] [INFO ] Deduced a trap composed of 76 places in 183 ms of which 1 ms to minimize.
[2024-05-25 15:32:53] [INFO ] Deduced a trap composed of 38 places in 134 ms of which 0 ms to minimize.
[2024-05-25 15:32:53] [INFO ] Deduced a trap composed of 74 places in 117 ms of which 1 ms to minimize.
[2024-05-25 15:32:53] [INFO ] Deduced a trap composed of 87 places in 134 ms of which 1 ms to minimize.
[2024-05-25 15:32:53] [INFO ] Deduced a trap composed of 12 places in 154 ms of which 0 ms to minimize.
[2024-05-25 15:32:54] [INFO ] Deduced a trap composed of 76 places in 123 ms of which 1 ms to minimize.
[2024-05-25 15:32:54] [INFO ] Deduced a trap composed of 74 places in 89 ms of which 0 ms to minimize.
[2024-05-25 15:32:54] [INFO ] Deduced a trap composed of 80 places in 97 ms of which 1 ms to minimize.
[2024-05-25 15:32:54] [INFO ] Deduced a trap composed of 74 places in 93 ms of which 0 ms to minimize.
[2024-05-25 15:32:54] [INFO ] Deduced a trap composed of 82 places in 110 ms of which 0 ms to minimize.
[2024-05-25 15:32:54] [INFO ] Deduced a trap composed of 77 places in 94 ms of which 0 ms to minimize.
[2024-05-25 15:32:54] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 1 ms to minimize.
[2024-05-25 15:32:54] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 0 ms to minimize.
[2024-05-25 15:32:54] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 3131 ms
[2024-05-25 15:32:54] [INFO ] After 3454ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 28 ms.
[2024-05-25 15:32:54] [INFO ] After 3726ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 7 ms.
Support contains 2 out of 448 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 448/448 places, 396/396 transitions.
Graph (trivial) has 205 edges and 448 vertex of which 6 / 448 are part of one of the 1 SCC in 3 ms
Free SCC test removed 5 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1016 edges and 443 vertex of which 442 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 442 transition count 341
Reduce places removed 47 places and 0 transitions.
Iterating post reduction 1 with 47 rules applied. Total rules applied 96 place count 395 transition count 341
Performed 95 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 95 Pre rules applied. Total rules applied 96 place count 395 transition count 246
Deduced a syphon composed of 95 places in 1 ms
Ensure Unique test removed 16 places
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 2 with 206 rules applied. Total rules applied 302 place count 284 transition count 246
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 304 place count 282 transition count 244
Iterating global reduction 2 with 2 rules applied. Total rules applied 306 place count 282 transition count 244
Performed 117 Post agglomeration using F-continuation condition.Transition count delta: 117
Deduced a syphon composed of 117 places in 1 ms
Ensure Unique test removed 4 places
Reduce places removed 121 places and 0 transitions.
Iterating global reduction 2 with 238 rules applied. Total rules applied 544 place count 161 transition count 127
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 546 place count 160 transition count 131
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 548 place count 160 transition count 129
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 550 place count 158 transition count 129
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 555 place count 158 transition count 129
Applied a total of 555 rules in 102 ms. Remains 158 /448 variables (removed 290) and now considering 129/396 (removed 267) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 103 ms. Remains : 158/448 places, 129/396 transitions.
Finished random walk after 114 steps, including 5 resets, run visited all 1 properties in 2 ms. (steps per millisecond=57 )
Parikh walk visited 0 properties in 0 ms.
Computed a total of 120 stabilizing places and 113 stable transitions
Graph (complete) has 1023 edges and 448 vertex of which 447 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.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||(X(G(p1))&&G(p2))))'
Support contains 5 out of 448 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 448/448 places, 396/396 transitions.
Applied a total of 0 rules in 14 ms. Remains 448 /448 variables (removed 0) and now considering 396/396 (removed 0) transitions.
[2024-05-25 15:32:55] [INFO ] Invariant cache hit.
[2024-05-25 15:32:55] [INFO ] Implicit Places using invariants in 309 ms returned []
[2024-05-25 15:32:55] [INFO ] Invariant cache hit.
[2024-05-25 15:32:56] [INFO ] Implicit Places using invariants and state equation in 469 ms returned []
Implicit Place search using SMT with State Equation took 786 ms to find 0 implicit places.
[2024-05-25 15:32:56] [INFO ] Invariant cache hit.
[2024-05-25 15:32:56] [INFO ] Dead Transitions using invariants and state equation in 203 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1025 ms. Remains : 448/448 places, 396/396 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 316 ms :[true, (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : BusinessProcesses-PT-13-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}], [{ cond=(NOT p2), acceptance={} source=2 dest: 1}, { cond=p2, acceptance={} source=2 dest: 3}], [{ cond=(OR (AND (NOT p2) (NOT p0)) (AND (NOT p0) (NOT p1))), acceptance={} source=3 dest: 0}, { cond=(AND p2 (NOT p0) p1), acceptance={} source=3 dest: 4}], [{ cond=(OR (NOT p2) (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(AND p2 p1), acceptance={} source=4 dest: 4}]], initial=2, aps=[p0:(AND (EQ s392 0) (EQ s306 1)), p2:(AND (EQ s124 0) (EQ s76 1)), p1:(EQ s286 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA BusinessProcesses-PT-13-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-13-LTLCardinality-00 finished in 1417 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)))'
Support contains 2 out of 448 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 448/448 places, 396/396 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 446 transition count 394
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 446 transition count 394
Applied a total of 4 rules in 20 ms. Remains 446 /448 variables (removed 2) and now considering 394/396 (removed 2) transitions.
// Phase 1: matrix 394 rows 446 cols
[2024-05-25 15:32:56] [INFO ] Computed 90 invariants in 10 ms
[2024-05-25 15:32:56] [INFO ] Implicit Places using invariants in 309 ms returned []
[2024-05-25 15:32:56] [INFO ] Invariant cache hit.
[2024-05-25 15:32:57] [INFO ] Implicit Places using invariants and state equation in 537 ms returned []
Implicit Place search using SMT with State Equation took 861 ms to find 0 implicit places.
[2024-05-25 15:32:57] [INFO ] Invariant cache hit.
[2024-05-25 15:32:57] [INFO ] Dead Transitions using invariants and state equation in 189 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 446/448 places, 394/396 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1073 ms. Remains : 446/448 places, 394/396 transitions.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-13-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (NEQ s131 0) (NEQ s153 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 128 steps with 0 reset in 9 ms.
FORMULA BusinessProcesses-PT-13-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-13-LTLCardinality-02 finished in 1160 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)))'
Support contains 2 out of 448 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 448/448 places, 396/396 transitions.
Graph (trivial) has 205 edges and 448 vertex of which 6 / 448 are part of one of the 1 SCC in 2 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1017 edges and 443 vertex of which 442 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 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 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 441 transition count 341
Reduce places removed 47 places and 0 transitions.
Iterating post reduction 1 with 47 rules applied. Total rules applied 96 place count 394 transition count 341
Performed 95 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 95 Pre rules applied. Total rules applied 96 place count 394 transition count 246
Deduced a syphon composed of 95 places in 0 ms
Ensure Unique test removed 16 places
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 2 with 206 rules applied. Total rules applied 302 place count 283 transition count 246
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 304 place count 281 transition count 244
Iterating global reduction 2 with 2 rules applied. Total rules applied 306 place count 281 transition count 244
Performed 116 Post agglomeration using F-continuation condition.Transition count delta: 116
Deduced a syphon composed of 116 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 2 with 236 rules applied. Total rules applied 542 place count 161 transition count 128
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 544 place count 160 transition count 132
Applied a total of 544 rules in 50 ms. Remains 160 /448 variables (removed 288) and now considering 132/396 (removed 264) transitions.
// Phase 1: matrix 132 rows 160 cols
[2024-05-25 15:32:57] [INFO ] Computed 70 invariants in 2 ms
[2024-05-25 15:32:58] [INFO ] Implicit Places using invariants in 613 ms returned [1, 2, 3, 4, 5, 6, 13, 14, 18, 19, 20, 21, 22, 23, 48, 49, 50, 51, 52, 132]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 618 ms to find 20 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 140/448 places, 132/396 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 139 transition count 131
Applied a total of 2 rules in 12 ms. Remains 139 /140 variables (removed 1) and now considering 131/132 (removed 1) transitions.
// Phase 1: matrix 131 rows 139 cols
[2024-05-25 15:32:58] [INFO ] Computed 50 invariants in 1 ms
[2024-05-25 15:32:58] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-05-25 15:32:58] [INFO ] Invariant cache hit.
[2024-05-25 15:32:58] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-25 15:32:58] [INFO ] Implicit Places using invariants and state equation in 197 ms returned [1, 3, 7, 10, 34, 35, 36, 38, 40, 42, 44, 46, 48, 50, 52, 54, 56, 60, 62, 64, 66, 68, 70, 72, 74, 82, 84, 86, 88, 90]
Discarding 30 places :
Implicit Place search using SMT with State Equation took 309 ms to find 30 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 109/448 places, 131/396 transitions.
Graph (complete) has 340 edges and 109 vertex of which 98 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.1 ms
Discarding 11 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 98 transition count 117
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 19 place count 89 transition count 117
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 32 place count 76 transition count 75
Iterating global reduction 2 with 13 rules applied. Total rules applied 45 place count 76 transition count 75
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 2 rules applied. Total rules applied 47 place count 76 transition count 73
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 49 place count 74 transition count 73
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 50 place count 73 transition count 72
Iterating global reduction 4 with 1 rules applied. Total rules applied 51 place count 73 transition count 72
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 17 rules applied. Total rules applied 68 place count 64 transition count 64
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 70 place count 63 transition count 63
Applied a total of 70 rules in 17 ms. Remains 63 /109 variables (removed 46) and now considering 63/131 (removed 68) transitions.
// Phase 1: matrix 63 rows 63 cols
[2024-05-25 15:32:58] [INFO ] Computed 15 invariants in 1 ms
[2024-05-25 15:32:58] [INFO ] Implicit Places using invariants in 61 ms returned [5, 6, 7]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 64 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 60/448 places, 63/396 transitions.
Applied a total of 0 rules in 9 ms. Remains 60 /60 variables (removed 0) and now considering 63/63 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 4 iterations and 1081 ms. Remains : 60/448 places, 63/396 transitions.
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-13-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s5 0) (EQ s29 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-13-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-13-LTLCardinality-04 finished in 1158 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)))'
Support contains 1 out of 448 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 448/448 places, 396/396 transitions.
Graph (trivial) has 205 edges and 448 vertex of which 6 / 448 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 1017 edges and 443 vertex of which 442 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 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 441 transition count 341
Reduce places removed 47 places and 0 transitions.
Iterating post reduction 1 with 47 rules applied. Total rules applied 96 place count 394 transition count 341
Performed 95 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 95 Pre rules applied. Total rules applied 96 place count 394 transition count 246
Deduced a syphon composed of 95 places in 1 ms
Ensure Unique test removed 17 places
Reduce places removed 112 places and 0 transitions.
Iterating global reduction 2 with 207 rules applied. Total rules applied 303 place count 282 transition count 246
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 305 place count 280 transition count 244
Iterating global reduction 2 with 2 rules applied. Total rules applied 307 place count 280 transition count 244
Performed 117 Post agglomeration using F-continuation condition.Transition count delta: 117
Deduced a syphon composed of 117 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 121 places and 0 transitions.
Iterating global reduction 2 with 238 rules applied. Total rules applied 545 place count 159 transition count 127
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 547 place count 158 transition count 131
Applied a total of 547 rules in 46 ms. Remains 158 /448 variables (removed 290) and now considering 131/396 (removed 265) transitions.
// Phase 1: matrix 131 rows 158 cols
[2024-05-25 15:32:58] [INFO ] Computed 69 invariants in 2 ms
[2024-05-25 15:32:59] [INFO ] Implicit Places using invariants in 107 ms returned [1, 2, 3, 4, 5, 6, 13, 14, 18, 19, 20, 21, 22, 23, 46, 47, 48, 49, 50]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 109 ms to find 19 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 139/448 places, 131/396 transitions.
Applied a total of 0 rules in 5 ms. Remains 139 /139 variables (removed 0) and now considering 131/131 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 171 ms. Remains : 139/448 places, 131/396 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-13-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s89 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-13-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-13-LTLCardinality-11 finished in 252 ms.
All properties solved by simple procedures.
Total runtime 12532 ms.

BK_STOP 1716651179332

--------------------
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-13"
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-13, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r065-tajo-171620414900342"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-13.tgz
mv BusinessProcesses-PT-13 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;