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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 564K
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K 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.3K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 15:30 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 9.6K Apr 11 16:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K Apr 11 16:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Apr 11 16:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 11 16:37 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 156K 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-14-LTLCardinality-00
FORMULA_NAME BusinessProcesses-PT-14-LTLCardinality-01
FORMULA_NAME BusinessProcesses-PT-14-LTLCardinality-02
FORMULA_NAME BusinessProcesses-PT-14-LTLCardinality-03
FORMULA_NAME BusinessProcesses-PT-14-LTLCardinality-04
FORMULA_NAME BusinessProcesses-PT-14-LTLCardinality-05
FORMULA_NAME BusinessProcesses-PT-14-LTLCardinality-06
FORMULA_NAME BusinessProcesses-PT-14-LTLCardinality-07
FORMULA_NAME BusinessProcesses-PT-14-LTLCardinality-08
FORMULA_NAME BusinessProcesses-PT-14-LTLCardinality-09
FORMULA_NAME BusinessProcesses-PT-14-LTLCardinality-10
FORMULA_NAME BusinessProcesses-PT-14-LTLCardinality-11
FORMULA_NAME BusinessProcesses-PT-14-LTLCardinality-12
FORMULA_NAME BusinessProcesses-PT-14-LTLCardinality-13
FORMULA_NAME BusinessProcesses-PT-14-LTLCardinality-14
FORMULA_NAME BusinessProcesses-PT-14-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716651244289

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-14
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-25 15:34:06] [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:34:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 15:34:06] [INFO ] Load time of PNML (sax parser for PT used): 78 ms
[2024-05-25 15:34:06] [INFO ] Transformed 624 places.
[2024-05-25 15:34:06] [INFO ] Transformed 564 transitions.
[2024-05-25 15:34:06] [INFO ] Found NUPN structural information;
[2024-05-25 15:34:06] [INFO ] Parsed PT model containing 624 places and 564 transitions and 1657 arcs in 178 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 8 places in 13 ms
Reduce places removed 8 places and 8 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA BusinessProcesses-PT-14-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-14-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-14-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-14-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-14-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-14-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-14-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 616 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 616/616 places, 556/556 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 611 transition count 556
Discarding 90 places :
Symmetric choice reduction at 1 with 90 rule applications. Total rules 95 place count 521 transition count 466
Iterating global reduction 1 with 90 rules applied. Total rules applied 185 place count 521 transition count 466
Discarding 43 places :
Symmetric choice reduction at 1 with 43 rule applications. Total rules 228 place count 478 transition count 423
Iterating global reduction 1 with 43 rules applied. Total rules applied 271 place count 478 transition count 423
Applied a total of 271 rules in 149 ms. Remains 478 /616 variables (removed 138) and now considering 423/556 (removed 133) transitions.
// Phase 1: matrix 423 rows 478 cols
[2024-05-25 15:34:07] [INFO ] Computed 94 invariants in 31 ms
[2024-05-25 15:34:07] [INFO ] Implicit Places using invariants in 402 ms returned []
[2024-05-25 15:34:07] [INFO ] Invariant cache hit.
[2024-05-25 15:34:08] [INFO ] Implicit Places using invariants and state equation in 660 ms returned []
Implicit Place search using SMT with State Equation took 1111 ms to find 0 implicit places.
[2024-05-25 15:34:08] [INFO ] Invariant cache hit.
[2024-05-25 15:34:08] [INFO ] Dead Transitions using invariants and state equation in 261 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 478/616 places, 423/556 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1537 ms. Remains : 478/616 places, 423/556 transitions.
Support contains 30 out of 478 places after structural reductions.
[2024-05-25 15:34:08] [INFO ] Flatten gal took : 86 ms
[2024-05-25 15:34:08] [INFO ] Flatten gal took : 36 ms
[2024-05-25 15:34:09] [INFO ] Input system was already deterministic with 423 transitions.
Incomplete random walk after 10000 steps, including 68 resets, run finished after 627 ms. (steps per millisecond=15 ) properties (out of 15) seen :6
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2024-05-25 15:34:10] [INFO ] Invariant cache hit.
[2024-05-25 15:34:10] [INFO ] [Real]Absence check using 55 positive place invariants in 42 ms returned sat
[2024-05-25 15:34:10] [INFO ] [Real]Absence check using 55 positive and 39 generalized place invariants in 20 ms returned sat
[2024-05-25 15:34:10] [INFO ] After 218ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2024-05-25 15:34:10] [INFO ] [Nat]Absence check using 55 positive place invariants in 26 ms returned sat
[2024-05-25 15:34:10] [INFO ] [Nat]Absence check using 55 positive and 39 generalized place invariants in 27 ms returned sat
[2024-05-25 15:34:11] [INFO ] After 364ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :7
[2024-05-25 15:34:11] [INFO ] Deduced a trap composed of 20 places in 123 ms of which 27 ms to minimize.
[2024-05-25 15:34:11] [INFO ] Deduced a trap composed of 30 places in 110 ms of which 1 ms to minimize.
[2024-05-25 15:34:11] [INFO ] Deduced a trap composed of 33 places in 88 ms of which 1 ms to minimize.
[2024-05-25 15:34:14] [INFO ] Deduced a trap composed of 18 places in 2861 ms of which 27 ms to minimize.
[2024-05-25 15:34:14] [INFO ] Deduced a trap composed of 45 places in 154 ms of which 2 ms to minimize.
[2024-05-25 15:34:14] [INFO ] Deduced a trap composed of 50 places in 153 ms of which 0 ms to minimize.
[2024-05-25 15:34:14] [INFO ] Deduced a trap composed of 32 places in 116 ms of which 1 ms to minimize.
[2024-05-25 15:34:14] [INFO ] Deduced a trap composed of 56 places in 119 ms of which 0 ms to minimize.
[2024-05-25 15:34:15] [INFO ] Deduced a trap composed of 51 places in 162 ms of which 1 ms to minimize.
[2024-05-25 15:34:15] [INFO ] Deduced a trap composed of 55 places in 77 ms of which 0 ms to minimize.
[2024-05-25 15:34:15] [INFO ] Deduced a trap composed of 36 places in 74 ms of which 1 ms to minimize.
[2024-05-25 15:34:15] [INFO ] Deduced a trap composed of 40 places in 113 ms of which 0 ms to minimize.
[2024-05-25 15:34:15] [INFO ] Deduced a trap composed of 55 places in 76 ms of which 0 ms to minimize.
[2024-05-25 15:34:15] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 4609 ms
[2024-05-25 15:34:15] [INFO ] Deduced a trap composed of 91 places in 113 ms of which 0 ms to minimize.
[2024-05-25 15:34:16] [INFO ] Deduced a trap composed of 88 places in 126 ms of which 0 ms to minimize.
[2024-05-25 15:34:16] [INFO ] Deduced a trap composed of 86 places in 115 ms of which 0 ms to minimize.
[2024-05-25 15:34:16] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 446 ms
[2024-05-25 15:34:16] [INFO ] After 5689ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :7
Attempting to minimize the solution found.
Minimization took 146 ms.
[2024-05-25 15:34:16] [INFO ] After 6133ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :7
Fused 8 Parikh solutions to 7 different solutions.
Parikh walk visited 1 properties in 40 ms.
Support contains 10 out of 478 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 478/478 places, 423/423 transitions.
Graph (trivial) has 217 edges and 478 vertex of which 6 / 478 are part of one of the 1 SCC in 2 ms
Free SCC test removed 5 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1082 edges and 473 vertex of which 472 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 50 place count 472 transition count 367
Reduce places removed 48 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 49 rules applied. Total rules applied 99 place count 424 transition count 366
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 100 place count 423 transition count 366
Performed 95 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 95 Pre rules applied. Total rules applied 100 place count 423 transition count 271
Deduced a syphon composed of 95 places in 1 ms
Ensure Unique test removed 14 places
Reduce places removed 109 places and 0 transitions.
Iterating global reduction 3 with 204 rules applied. Total rules applied 304 place count 314 transition count 271
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 310 place count 308 transition count 265
Iterating global reduction 3 with 6 rules applied. Total rules applied 316 place count 308 transition count 265
Performed 123 Post agglomeration using F-continuation condition.Transition count delta: 123
Deduced a syphon composed of 123 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 3 with 251 rules applied. Total rules applied 567 place count 180 transition count 142
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 569 place count 179 transition count 146
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 571 place count 179 transition count 144
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 573 place count 177 transition count 144
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 577 place count 177 transition count 144
Applied a total of 577 rules in 87 ms. Remains 177 /478 variables (removed 301) and now considering 144/423 (removed 279) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 89 ms. Remains : 177/478 places, 144/423 transitions.
Finished random walk after 360 steps, including 16 resets, run visited all 6 properties in 8 ms. (steps per millisecond=45 )
Parikh walk visited 0 properties in 0 ms.
FORMULA BusinessProcesses-PT-14-LTLCardinality-13 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA BusinessProcesses-PT-14-LTLCardinality-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 7 simplifications.
Computed a total of 127 stabilizing places and 120 stable transitions
Graph (complete) has 1089 edges and 478 vertex of which 477 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.14 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 478 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 478/478 places, 423/423 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 470 transition count 415
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 470 transition count 415
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 20 place count 466 transition count 411
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 466 transition count 411
Applied a total of 24 rules in 51 ms. Remains 466 /478 variables (removed 12) and now considering 411/423 (removed 12) transitions.
// Phase 1: matrix 411 rows 466 cols
[2024-05-25 15:34:16] [INFO ] Computed 94 invariants in 7 ms
[2024-05-25 15:34:17] [INFO ] Implicit Places using invariants in 314 ms returned []
[2024-05-25 15:34:17] [INFO ] Invariant cache hit.
[2024-05-25 15:34:17] [INFO ] Implicit Places using invariants and state equation in 574 ms returned []
Implicit Place search using SMT with State Equation took 893 ms to find 0 implicit places.
[2024-05-25 15:34:17] [INFO ] Invariant cache hit.
[2024-05-25 15:34:18] [INFO ] Dead Transitions using invariants and state equation in 302 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 466/478 places, 411/423 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1263 ms. Remains : 466/478 places, 411/423 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 418 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-14-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 (EQ s84 0) (EQ s334 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 988 steps with 20 reset in 9 ms.
FORMULA BusinessProcesses-PT-14-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-14-LTLCardinality-02 finished in 1768 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) U (X(X(!p2))||p1)) U p0))'
Support contains 5 out of 478 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 478/478 places, 423/423 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 472 transition count 417
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 472 transition count 417
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 469 transition count 414
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 469 transition count 414
Applied a total of 18 rules in 35 ms. Remains 469 /478 variables (removed 9) and now considering 414/423 (removed 9) transitions.
// Phase 1: matrix 414 rows 469 cols
[2024-05-25 15:34:18] [INFO ] Computed 94 invariants in 5 ms
[2024-05-25 15:34:18] [INFO ] Implicit Places using invariants in 300 ms returned []
[2024-05-25 15:34:18] [INFO ] Invariant cache hit.
[2024-05-25 15:34:19] [INFO ] Implicit Places using invariants and state equation in 826 ms returned []
Implicit Place search using SMT with State Equation took 1131 ms to find 0 implicit places.
[2024-05-25 15:34:19] [INFO ] Invariant cache hit.
[2024-05-25 15:34:20] [INFO ] Dead Transitions using invariants and state equation in 286 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 469/478 places, 414/423 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1454 ms. Remains : 469/478 places, 414/423 transitions.
Stuttering acceptance computed with spot in 323 ms :[(NOT p0), (OR (AND (NOT p1) p2) (AND (NOT p0) p2)), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p1) p2), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-14-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(EQ s153 1), p1:(OR (EQ s441 0) (EQ s88 1)), p2:(OR (EQ s236 0) (EQ s150 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 139 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-14-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-14-LTLCardinality-05 finished in 1838 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 478 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 478/478 places, 423/423 transitions.
Graph (trivial) has 225 edges and 478 vertex of which 6 / 478 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 1083 edges and 473 vertex of which 472 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 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 52 place count 471 transition count 365
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 1 with 50 rules applied. Total rules applied 102 place count 421 transition count 365
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 101 Pre rules applied. Total rules applied 102 place count 421 transition count 264
Deduced a syphon composed of 101 places in 0 ms
Ensure Unique test removed 16 places
Reduce places removed 117 places and 0 transitions.
Iterating global reduction 2 with 218 rules applied. Total rules applied 320 place count 304 transition count 264
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 328 place count 296 transition count 256
Iterating global reduction 2 with 8 rules applied. Total rules applied 336 place count 296 transition count 256
Performed 123 Post agglomeration using F-continuation condition.Transition count delta: 123
Deduced a syphon composed of 123 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 2 with 251 rules applied. Total rules applied 587 place count 168 transition count 133
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 589 place count 167 transition count 137
Applied a total of 589 rules in 45 ms. Remains 167 /478 variables (removed 311) and now considering 137/423 (removed 286) transitions.
// Phase 1: matrix 137 rows 167 cols
[2024-05-25 15:34:20] [INFO ] Computed 73 invariants in 2 ms
[2024-05-25 15:34:20] [INFO ] Implicit Places using invariants in 134 ms returned [1, 2, 3, 4, 5, 6, 7, 14, 15, 19, 20, 21, 22, 23, 24, 29, 48, 49, 50, 51, 52]
Discarding 21 places :
Implicit Place search using SMT only with invariants took 137 ms to find 21 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 146/478 places, 137/423 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 145 transition count 136
Applied a total of 2 rules in 9 ms. Remains 145 /146 variables (removed 1) and now considering 136/137 (removed 1) transitions.
// Phase 1: matrix 136 rows 145 cols
[2024-05-25 15:34:20] [INFO ] Computed 52 invariants in 1 ms
[2024-05-25 15:34:20] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-05-25 15:34:20] [INFO ] Invariant cache hit.
[2024-05-25 15:34:20] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-25 15:34:20] [INFO ] Implicit Places using invariants and state equation in 204 ms returned [1, 3, 7, 10, 33, 35, 37, 38, 39, 41, 43, 45, 47, 49, 51, 53, 55, 57, 59, 63, 65, 67, 69, 71, 73, 75, 77, 85, 87, 89, 91, 93]
Discarding 32 places :
Implicit Place search using SMT with State Equation took 302 ms to find 32 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 113/478 places, 136/423 transitions.
Graph (complete) has 347 edges and 113 vertex of which 102 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 102 transition count 122
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 19 place count 93 transition count 122
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 33 place count 79 transition count 79
Iterating global reduction 2 with 14 rules applied. Total rules applied 47 place count 79 transition count 79
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 3 rules applied. Total rules applied 50 place count 79 transition count 76
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 53 place count 76 transition count 76
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 54 place count 75 transition count 75
Iterating global reduction 4 with 1 rules applied. Total rules applied 55 place count 75 transition count 75
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 72 place count 66 transition count 67
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 74 place count 65 transition count 66
Applied a total of 74 rules in 17 ms. Remains 65 /113 variables (removed 48) and now considering 66/136 (removed 70) transitions.
// Phase 1: matrix 66 rows 65 cols
[2024-05-25 15:34:20] [INFO ] Computed 15 invariants in 1 ms
[2024-05-25 15:34:21] [INFO ] Implicit Places using invariants in 58 ms returned [5, 6, 7]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 59 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 62/478 places, 66/423 transitions.
Applied a total of 0 rules in 4 ms. Remains 62 /62 variables (removed 0) and now considering 66/66 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 4 iterations and 574 ms. Remains : 62/478 places, 66/423 transitions.
Stuttering acceptance computed with spot in 138 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-14-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s46 0) (EQ s41 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-14-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-14-LTLCardinality-06 finished in 734 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 1 out of 478 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 478/478 places, 423/423 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 470 transition count 415
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 470 transition count 415
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 20 place count 466 transition count 411
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 466 transition count 411
Applied a total of 24 rules in 98 ms. Remains 466 /478 variables (removed 12) and now considering 411/423 (removed 12) transitions.
// Phase 1: matrix 411 rows 466 cols
[2024-05-25 15:34:21] [INFO ] Computed 94 invariants in 4 ms
[2024-05-25 15:34:21] [INFO ] Implicit Places using invariants in 191 ms returned []
[2024-05-25 15:34:21] [INFO ] Invariant cache hit.
[2024-05-25 15:34:22] [INFO ] Implicit Places using invariants and state equation in 863 ms returned []
Implicit Place search using SMT with State Equation took 1058 ms to find 0 implicit places.
[2024-05-25 15:34:22] [INFO ] Invariant cache hit.
[2024-05-25 15:34:22] [INFO ] Dead Transitions using invariants and state equation in 354 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 466/478 places, 411/423 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1513 ms. Remains : 466/478 places, 411/423 transitions.
Stuttering acceptance computed with spot in 116 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-14-LTLCardinality-08 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:(EQ s407 0)], 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]]
Product exploration explored 100000 steps with 682 reset in 353 ms.
Product exploration explored 100000 steps with 683 reset in 321 ms.
Computed a total of 123 stabilizing places and 116 stable transitions
Graph (complete) has 1067 edges and 466 vertex of which 465 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 ms
Computed a total of 123 stabilizing places and 116 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 117 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 51 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 68 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Finished probabilistic random walk after 2193 steps, run visited all 1 properties in 26 ms. (steps per millisecond=84 )
Probabilistic random walk after 2193 steps, saw 1969 distinct states, run finished after 26 ms. (steps per millisecond=84 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 4 factoid took 159 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-14-LTLCardinality-08 FALSE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-14-LTLCardinality-08 finished in 2765 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 4 out of 478 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 478/478 places, 423/423 transitions.
Graph (trivial) has 222 edges and 478 vertex of which 6 / 478 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 1083 edges and 473 vertex of which 472 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 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 471 transition count 366
Reduce places removed 49 places and 0 transitions.
Iterating post reduction 1 with 49 rules applied. Total rules applied 100 place count 422 transition count 366
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 100 place count 422 transition count 266
Deduced a syphon composed of 100 places in 1 ms
Ensure Unique test removed 17 places
Reduce places removed 117 places and 0 transitions.
Iterating global reduction 2 with 217 rules applied. Total rules applied 317 place count 305 transition count 266
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 324 place count 298 transition count 259
Iterating global reduction 2 with 7 rules applied. Total rules applied 331 place count 298 transition count 259
Performed 125 Post agglomeration using F-continuation condition.Transition count delta: 125
Deduced a syphon composed of 125 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 130 places and 0 transitions.
Iterating global reduction 2 with 255 rules applied. Total rules applied 586 place count 168 transition count 134
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 588 place count 167 transition count 138
Applied a total of 588 rules in 73 ms. Remains 167 /478 variables (removed 311) and now considering 138/423 (removed 285) transitions.
// Phase 1: matrix 138 rows 167 cols
[2024-05-25 15:34:24] [INFO ] Computed 72 invariants in 13 ms
[2024-05-25 15:34:24] [INFO ] Implicit Places using invariants in 212 ms returned [1, 2, 3, 4, 5, 6, 7, 14, 15, 19, 20, 21, 22, 23, 24, 47, 48, 49, 50, 51]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 217 ms to find 20 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 147/478 places, 138/423 transitions.
Applied a total of 0 rules in 8 ms. Remains 147 /147 variables (removed 0) and now considering 138/138 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 298 ms. Remains : 147/478 places, 138/423 transitions.
Stuttering acceptance computed with spot in 83 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-14-LTLCardinality-12 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 s100 0) (EQ s142 0) (OR (EQ s70 0) (EQ s77 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 17856 reset in 387 ms.
Product exploration explored 100000 steps with 17864 reset in 314 ms.
Computed a total of 14 stabilizing places and 12 stable transitions
Computed a total of 14 stabilizing places and 12 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 123 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 56 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2018 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 619 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Finished probabilistic random walk after 123 steps, run visited all 1 properties in 4 ms. (steps per millisecond=30 )
Probabilistic random walk after 123 steps, saw 79 distinct states, run finished after 4 ms. (steps per millisecond=30 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 134 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Support contains 4 out of 147 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 147/147 places, 138/138 transitions.
Applied a total of 0 rules in 8 ms. Remains 147 /147 variables (removed 0) and now considering 138/138 (removed 0) transitions.
// Phase 1: matrix 138 rows 147 cols
[2024-05-25 15:34:25] [INFO ] Computed 52 invariants in 1 ms
[2024-05-25 15:34:25] [INFO ] Implicit Places using invariants in 159 ms returned []
[2024-05-25 15:34:25] [INFO ] Invariant cache hit.
[2024-05-25 15:34:25] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-25 15:34:25] [INFO ] Implicit Places using invariants and state equation in 206 ms returned [1, 3, 7, 10, 33, 35, 37, 38, 39, 41, 43, 45, 47, 49, 51, 53, 55, 57, 59, 63, 65, 67, 69, 71, 73, 78, 86, 88, 90, 92, 94]
Discarding 31 places :
Implicit Place search using SMT with State Equation took 369 ms to find 31 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 116/147 places, 138/138 transitions.
Graph (complete) has 379 edges and 116 vertex of which 105 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.0 ms
Discarding 11 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 9 place count 105 transition count 125
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 17 place count 97 transition count 125
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 31 place count 83 transition count 82
Iterating global reduction 2 with 14 rules applied. Total rules applied 45 place count 83 transition count 82
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 3 rules applied. Total rules applied 48 place count 83 transition count 79
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 51 place count 80 transition count 79
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 52 place count 79 transition count 78
Iterating global reduction 4 with 1 rules applied. Total rules applied 53 place count 79 transition count 78
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 67 place count 72 transition count 71
Applied a total of 67 rules in 13 ms. Remains 72 /116 variables (removed 44) and now considering 71/138 (removed 67) transitions.
// Phase 1: matrix 71 rows 72 cols
[2024-05-25 15:34:25] [INFO ] Computed 17 invariants in 0 ms
[2024-05-25 15:34:25] [INFO ] Implicit Places using invariants in 58 ms returned [5, 6, 7, 50]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 59 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 68/147 places, 71/138 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 67 transition count 70
Applied a total of 2 rules in 4 ms. Remains 67 /68 variables (removed 1) and now considering 70/71 (removed 1) transitions.
// Phase 1: matrix 70 rows 67 cols
[2024-05-25 15:34:25] [INFO ] Computed 13 invariants in 0 ms
[2024-05-25 15:34:26] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-05-25 15:34:26] [INFO ] Invariant cache hit.
[2024-05-25 15:34:26] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-25 15:34:26] [INFO ] Implicit Places using invariants and state equation in 121 ms returned [27, 29, 31]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 207 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 64/147 places, 70/138 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 64 transition count 67
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 61 transition count 67
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 7 place count 60 transition count 66
Iterating global reduction 2 with 1 rules applied. Total rules applied 8 place count 60 transition count 66
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 9 place count 60 transition count 65
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 4 places
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 29 place count 48 transition count 57
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 31 place count 46 transition count 55
Iterating global reduction 3 with 2 rules applied. Total rules applied 33 place count 46 transition count 55
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 35 place count 45 transition count 54
Applied a total of 35 rules in 9 ms. Remains 45 /64 variables (removed 19) and now considering 54/70 (removed 16) transitions.
// Phase 1: matrix 54 rows 45 cols
[2024-05-25 15:34:26] [INFO ] Computed 6 invariants in 1 ms
[2024-05-25 15:34:26] [INFO ] Implicit Places using invariants in 42 ms returned [41]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 43 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 4 : 44/147 places, 54/138 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 44 transition count 53
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 43 transition count 53
Applied a total of 2 rules in 3 ms. Remains 43 /44 variables (removed 1) and now considering 53/54 (removed 1) transitions.
// Phase 1: matrix 53 rows 43 cols
[2024-05-25 15:34:26] [INFO ] Computed 5 invariants in 0 ms
[2024-05-25 15:34:26] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-25 15:34:26] [INFO ] Invariant cache hit.
[2024-05-25 15:34:26] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-25 15:34:26] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 5 : 43/147 places, 53/138 transitions.
Finished structural reductions in SI_LTL mode , in 5 iterations and 830 ms. Remains : 43/147 places, 53/138 transitions.
Computed a total of 4 stabilizing places and 5 stable transitions
Computed a total of 4 stabilizing places and 5 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 102 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2047 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 631 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Finished probabilistic random walk after 76 steps, run visited all 1 properties in 3 ms. (steps per millisecond=25 )
Probabilistic random walk after 76 steps, saw 52 distinct states, run finished after 3 ms. (steps per millisecond=25 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 168 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 61 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 61 ms :[(NOT p0)]
Product exploration explored 100000 steps with 18314 reset in 146 ms.
Product exploration explored 100000 steps with 18282 reset in 118 ms.
Built C files in :
/tmp/ltsmin5634284651751959842
[2024-05-25 15:34:27] [INFO ] Computing symmetric may disable matrix : 53 transitions.
[2024-05-25 15:34:27] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 15:34:27] [INFO ] Computing symmetric may enable matrix : 53 transitions.
[2024-05-25 15:34:27] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 15:34:27] [INFO ] Computing Do-Not-Accords matrix : 53 transitions.
[2024-05-25 15:34:27] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 15:34:27] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5634284651751959842
Running compilation step : cd /tmp/ltsmin5634284651751959842;'/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 770 ms.
Running link step : cd /tmp/ltsmin5634284651751959842;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin5634284651751959842;'/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/stateBased12865877432942845160.hoa' '--buchi-type=spotba'
LTSmin run took 137 ms.
FORMULA BusinessProcesses-PT-14-LTLCardinality-12 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property BusinessProcesses-PT-14-LTLCardinality-12 finished in 4276 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((p0 U G(p1))))))'
Support contains 4 out of 478 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 478/478 places, 423/423 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 473 transition count 418
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 473 transition count 418
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 470 transition count 415
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 470 transition count 415
Applied a total of 16 rules in 30 ms. Remains 470 /478 variables (removed 8) and now considering 415/423 (removed 8) transitions.
// Phase 1: matrix 415 rows 470 cols
[2024-05-25 15:34:28] [INFO ] Computed 94 invariants in 7 ms
[2024-05-25 15:34:28] [INFO ] Implicit Places using invariants in 193 ms returned []
[2024-05-25 15:34:28] [INFO ] Invariant cache hit.
[2024-05-25 15:34:28] [INFO ] Implicit Places using invariants and state equation in 489 ms returned []
Implicit Place search using SMT with State Equation took 685 ms to find 0 implicit places.
[2024-05-25 15:34:28] [INFO ] Invariant cache hit.
[2024-05-25 15:34:29] [INFO ] Dead Transitions using invariants and state equation in 284 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 470/478 places, 415/423 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1003 ms. Remains : 470/478 places, 415/423 transitions.
Stuttering acceptance computed with spot in 257 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-14-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND p1 p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 4}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(OR (EQ s37 0) (EQ s344 1)), p0:(OR (EQ s339 0) (EQ s384 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 686 reset in 201 ms.
Product exploration explored 100000 steps with 679 reset in 184 ms.
Computed a total of 125 stabilizing places and 118 stable transitions
Graph (complete) has 1075 edges and 470 vertex of which 469 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 125 stabilizing places and 118 stable transitions
Knowledge obtained : [(AND p1 p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 146 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 264 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Incomplete random walk after 10000 steps, including 68 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-25 15:34:30] [INFO ] Invariant cache hit.
[2024-05-25 15:34:30] [INFO ] After 121ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-25 15:34:30] [INFO ] [Nat]Absence check using 55 positive place invariants in 13 ms returned sat
[2024-05-25 15:34:30] [INFO ] [Nat]Absence check using 55 positive and 39 generalized place invariants in 10 ms returned sat
[2024-05-25 15:34:30] [INFO ] After 213ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-25 15:34:31] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 1 ms to minimize.
[2024-05-25 15:34:31] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 0 ms to minimize.
[2024-05-25 15:34:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 166 ms
[2024-05-25 15:34:31] [INFO ] Deduced a trap composed of 80 places in 198 ms of which 1 ms to minimize.
[2024-05-25 15:34:31] [INFO ] Deduced a trap composed of 19 places in 142 ms of which 0 ms to minimize.
[2024-05-25 15:34:31] [INFO ] Deduced a trap composed of 81 places in 181 ms of which 1 ms to minimize.
[2024-05-25 15:34:31] [INFO ] Deduced a trap composed of 81 places in 140 ms of which 0 ms to minimize.
[2024-05-25 15:34:32] [INFO ] Deduced a trap composed of 81 places in 113 ms of which 1 ms to minimize.
[2024-05-25 15:34:32] [INFO ] Deduced a trap composed of 79 places in 129 ms of which 1 ms to minimize.
[2024-05-25 15:34:32] [INFO ] Deduced a trap composed of 81 places in 88 ms of which 1 ms to minimize.
[2024-05-25 15:34:32] [INFO ] Deduced a trap composed of 80 places in 82 ms of which 0 ms to minimize.
[2024-05-25 15:34:32] [INFO ] Deduced a trap composed of 14 places in 102 ms of which 1 ms to minimize.
[2024-05-25 15:34:32] [INFO ] Deduced a trap composed of 32 places in 133 ms of which 1 ms to minimize.
[2024-05-25 15:34:32] [INFO ] Deduced a trap composed of 15 places in 91 ms of which 0 ms to minimize.
[2024-05-25 15:34:32] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 0 ms to minimize.
[2024-05-25 15:34:32] [INFO ] Deduced a trap composed of 17 places in 95 ms of which 0 ms to minimize.
[2024-05-25 15:34:33] [INFO ] Deduced a trap composed of 22 places in 102 ms of which 0 ms to minimize.
[2024-05-25 15:34:35] [INFO ] Deduced a trap composed of 14 places in 2741 ms of which 6 ms to minimize.
[2024-05-25 15:34:35] [INFO ] Deduced a trap composed of 35 places in 81 ms of which 1 ms to minimize.
[2024-05-25 15:34:36] [INFO ] Deduced a trap composed of 50 places in 62 ms of which 0 ms to minimize.
[2024-05-25 15:34:36] [INFO ] Deduced a trap composed of 36 places in 75 ms of which 0 ms to minimize.
[2024-05-25 15:34:36] [INFO ] Deduced a trap composed of 37 places in 74 ms of which 0 ms to minimize.
[2024-05-25 15:34:36] [INFO ] Deduced a trap composed of 56 places in 96 ms of which 1 ms to minimize.
[2024-05-25 15:34:36] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 5174 ms
[2024-05-25 15:34:36] [INFO ] After 5618ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 58 ms.
[2024-05-25 15:34:36] [INFO ] After 5821ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 197 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=197 )
Parikh walk visited 3 properties in 6 ms.
Knowledge obtained : [(AND p1 p0), true]
False Knowledge obtained : [(F (NOT p1)), (F (AND (NOT p0) p1)), (F (NOT (AND p0 p1))), (F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 2 factoid took 301 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 252 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Stuttering acceptance computed with spot in 261 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Support contains 4 out of 470 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 470/470 places, 415/415 transitions.
Applied a total of 0 rules in 17 ms. Remains 470 /470 variables (removed 0) and now considering 415/415 (removed 0) transitions.
[2024-05-25 15:34:37] [INFO ] Invariant cache hit.
[2024-05-25 15:34:37] [INFO ] Implicit Places using invariants in 272 ms returned []
[2024-05-25 15:34:37] [INFO ] Invariant cache hit.
[2024-05-25 15:34:38] [INFO ] Implicit Places using invariants and state equation in 554 ms returned []
Implicit Place search using SMT with State Equation took 829 ms to find 0 implicit places.
[2024-05-25 15:34:38] [INFO ] Invariant cache hit.
[2024-05-25 15:34:38] [INFO ] Dead Transitions using invariants and state equation in 404 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1255 ms. Remains : 470/470 places, 415/415 transitions.
Computed a total of 125 stabilizing places and 118 stable transitions
Graph (complete) has 1075 edges and 470 vertex of which 469 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 125 stabilizing places and 118 stable transitions
Knowledge obtained : [(AND p0 p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 133 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 341 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Incomplete random walk after 10000 steps, including 69 resets, run finished after 200 ms. (steps per millisecond=50 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-25 15:34:39] [INFO ] Invariant cache hit.
[2024-05-25 15:34:39] [INFO ] After 111ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-25 15:34:39] [INFO ] [Nat]Absence check using 55 positive place invariants in 34 ms returned sat
[2024-05-25 15:34:39] [INFO ] [Nat]Absence check using 55 positive and 39 generalized place invariants in 19 ms returned sat
[2024-05-25 15:34:39] [INFO ] After 217ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-25 15:34:39] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
[2024-05-25 15:34:39] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 0 ms to minimize.
[2024-05-25 15:34:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 114 ms
[2024-05-25 15:34:40] [INFO ] Deduced a trap composed of 80 places in 209 ms of which 1 ms to minimize.
[2024-05-25 15:34:40] [INFO ] Deduced a trap composed of 19 places in 186 ms of which 0 ms to minimize.
[2024-05-25 15:34:40] [INFO ] Deduced a trap composed of 81 places in 177 ms of which 0 ms to minimize.
[2024-05-25 15:34:40] [INFO ] Deduced a trap composed of 81 places in 161 ms of which 1 ms to minimize.
[2024-05-25 15:34:40] [INFO ] Deduced a trap composed of 81 places in 120 ms of which 1 ms to minimize.
[2024-05-25 15:34:41] [INFO ] Deduced a trap composed of 79 places in 121 ms of which 1 ms to minimize.
[2024-05-25 15:34:41] [INFO ] Deduced a trap composed of 81 places in 150 ms of which 0 ms to minimize.
[2024-05-25 15:34:41] [INFO ] Deduced a trap composed of 80 places in 149 ms of which 0 ms to minimize.
[2024-05-25 15:34:41] [INFO ] Deduced a trap composed of 14 places in 132 ms of which 2 ms to minimize.
[2024-05-25 15:34:41] [INFO ] Deduced a trap composed of 32 places in 92 ms of which 0 ms to minimize.
[2024-05-25 15:34:41] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
[2024-05-25 15:34:41] [INFO ] Deduced a trap composed of 14 places in 87 ms of which 0 ms to minimize.
[2024-05-25 15:34:41] [INFO ] Deduced a trap composed of 17 places in 84 ms of which 0 ms to minimize.
[2024-05-25 15:34:42] [INFO ] Deduced a trap composed of 22 places in 138 ms of which 42 ms to minimize.
[2024-05-25 15:34:42] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 0 ms to minimize.
[2024-05-25 15:34:42] [INFO ] Deduced a trap composed of 35 places in 80 ms of which 1 ms to minimize.
[2024-05-25 15:34:42] [INFO ] Deduced a trap composed of 50 places in 54 ms of which 0 ms to minimize.
[2024-05-25 15:34:42] [INFO ] Deduced a trap composed of 36 places in 67 ms of which 0 ms to minimize.
[2024-05-25 15:34:42] [INFO ] Deduced a trap composed of 37 places in 66 ms of which 0 ms to minimize.
[2024-05-25 15:34:42] [INFO ] Deduced a trap composed of 56 places in 55 ms of which 0 ms to minimize.
[2024-05-25 15:34:42] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 2604 ms
[2024-05-25 15:34:42] [INFO ] After 2995ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 70 ms.
[2024-05-25 15:34:42] [INFO ] After 3239ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 197 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=98 )
Parikh walk visited 3 properties in 8 ms.
Knowledge obtained : [(AND p0 p1), true]
False Knowledge obtained : [(F (NOT p1)), (F (AND (NOT p0) p1)), (F (NOT (AND p0 p1))), (F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 2 factoid took 283 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 241 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Stuttering acceptance computed with spot in 205 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Stuttering acceptance computed with spot in 194 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Product exploration explored 100000 steps with 682 reset in 254 ms.
Product exploration explored 100000 steps with 681 reset in 231 ms.
Applying partial POR strategy [false, false, false, true, true, true]
Stuttering acceptance computed with spot in 304 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Support contains 4 out of 470 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 470/470 places, 415/415 transitions.
Graph (trivial) has 212 edges and 470 vertex of which 6 / 470 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 1069 edges and 465 vertex of which 464 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
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 45 rules applied. Total rules applied 47 place count 464 transition count 408
Performed 71 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 71 Pre rules applied. Total rules applied 47 place count 464 transition count 459
Deduced a syphon composed of 116 places in 1 ms
Iterating global reduction 1 with 71 rules applied. Total rules applied 118 place count 464 transition count 459
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 132 place count 450 transition count 433
Deduced a syphon composed of 102 places in 1 ms
Iterating global reduction 1 with 14 rules applied. Total rules applied 146 place count 450 transition count 433
Performed 154 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 256 places in 0 ms
Iterating global reduction 1 with 154 rules applied. Total rules applied 300 place count 450 transition count 433
Discarding 37 places :
Symmetric choice reduction at 1 with 37 rule applications. Total rules 337 place count 413 transition count 396
Deduced a syphon composed of 219 places in 1 ms
Iterating global reduction 1 with 37 rules applied. Total rules applied 374 place count 413 transition count 396
Deduced a syphon composed of 219 places in 0 ms
Applied a total of 374 rules in 90 ms. Remains 413 /470 variables (removed 57) and now considering 396/415 (removed 19) transitions.
[2024-05-25 15:34:44] [INFO ] Redundant transitions in 28 ms returned []
// Phase 1: matrix 396 rows 413 cols
[2024-05-25 15:34:44] [INFO ] Computed 94 invariants in 6 ms
[2024-05-25 15:34:45] [INFO ] Dead Transitions using invariants and state equation in 372 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 413/470 places, 396/415 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 538 ms. Remains : 413/470 places, 396/415 transitions.
Built C files in :
/tmp/ltsmin12290718529943766178
[2024-05-25 15:34:45] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12290718529943766178
Running compilation step : cd /tmp/ltsmin12290718529943766178;'/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 781 ms.
Running link step : cd /tmp/ltsmin12290718529943766178;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 56 ms.
Running LTSmin : cd /tmp/ltsmin12290718529943766178;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased9714413701579129146.hoa' '--buchi-type=spotba'
LTSmin run took 5932 ms.
FORMULA BusinessProcesses-PT-14-LTLCardinality-14 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property BusinessProcesses-PT-14-LTLCardinality-14 finished in 23804 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(p0) U G((p1 U p0))))))'
Support contains 4 out of 478 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 478/478 places, 423/423 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 471 transition count 416
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 471 transition count 416
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 468 transition count 413
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 468 transition count 413
Applied a total of 20 rules in 43 ms. Remains 468 /478 variables (removed 10) and now considering 413/423 (removed 10) transitions.
// Phase 1: matrix 413 rows 468 cols
[2024-05-25 15:34:52] [INFO ] Computed 94 invariants in 3 ms
[2024-05-25 15:34:52] [INFO ] Implicit Places using invariants in 306 ms returned []
[2024-05-25 15:34:52] [INFO ] Invariant cache hit.
[2024-05-25 15:34:53] [INFO ] Implicit Places using invariants and state equation in 919 ms returned []
Implicit Place search using SMT with State Equation took 1234 ms to find 0 implicit places.
[2024-05-25 15:34:53] [INFO ] Invariant cache hit.
[2024-05-25 15:34:53] [INFO ] Dead Transitions using invariants and state equation in 345 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 468/478 places, 413/423 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1624 ms. Remains : 468/478 places, 413/423 transitions.
Stuttering acceptance computed with spot in 246 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), true]
Running random walk in product with property : BusinessProcesses-PT-14-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 4}, { cond=p0, acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(OR (EQ s387 0) (EQ s156 1)), p1:(OR (EQ s104 0) (EQ s443 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 20001 reset in 313 ms.
Product exploration explored 100000 steps with 19917 reset in 277 ms.
Computed a total of 123 stabilizing places and 116 stable transitions
Graph (complete) has 1071 edges and 468 vertex of which 467 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 123 stabilizing places and 116 stable transitions
Knowledge obtained : [(AND p0 p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (OR p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 136 ms. Reduced automaton from 7 states, 12 edges and 2 AP (stutter sensitive) to 7 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 299 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), true]
Incomplete random walk after 10000 steps, including 67 resets, run finished after 295 ms. (steps per millisecond=33 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 403953 steps, run timeout after 3001 ms. (steps per millisecond=134 ) properties seen :{2=1, 3=1}
Probabilistic random walk after 403953 steps, saw 66084 distinct states, run finished after 3002 ms. (steps per millisecond=134 ) properties seen :2
Running SMT prover for 2 properties.
[2024-05-25 15:34:58] [INFO ] Invariant cache hit.
[2024-05-25 15:34:58] [INFO ] After 129ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-25 15:34:58] [INFO ] [Nat]Absence check using 55 positive place invariants in 20 ms returned sat
[2024-05-25 15:34:58] [INFO ] [Nat]Absence check using 55 positive and 39 generalized place invariants in 17 ms returned sat
[2024-05-25 15:34:59] [INFO ] After 191ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-25 15:34:59] [INFO ] Deduced a trap composed of 72 places in 181 ms of which 1 ms to minimize.
[2024-05-25 15:34:59] [INFO ] Deduced a trap composed of 63 places in 157 ms of which 0 ms to minimize.
[2024-05-25 15:34:59] [INFO ] Deduced a trap composed of 90 places in 164 ms of which 1 ms to minimize.
[2024-05-25 15:34:59] [INFO ] Deduced a trap composed of 83 places in 162 ms of which 1 ms to minimize.
[2024-05-25 15:34:59] [INFO ] Deduced a trap composed of 82 places in 163 ms of which 1 ms to minimize.
[2024-05-25 15:35:00] [INFO ] Deduced a trap composed of 84 places in 160 ms of which 1 ms to minimize.
[2024-05-25 15:35:00] [INFO ] Deduced a trap composed of 86 places in 144 ms of which 1 ms to minimize.
[2024-05-25 15:35:00] [INFO ] Deduced a trap composed of 85 places in 124 ms of which 1 ms to minimize.
[2024-05-25 15:35:00] [INFO ] Deduced a trap composed of 82 places in 119 ms of which 0 ms to minimize.
[2024-05-25 15:35:00] [INFO ] Deduced a trap composed of 80 places in 159 ms of which 1 ms to minimize.
[2024-05-25 15:35:00] [INFO ] Deduced a trap composed of 84 places in 147 ms of which 1 ms to minimize.
[2024-05-25 15:35:01] [INFO ] Deduced a trap composed of 84 places in 123 ms of which 1 ms to minimize.
[2024-05-25 15:35:01] [INFO ] Deduced a trap composed of 76 places in 119 ms of which 0 ms to minimize.
[2024-05-25 15:35:01] [INFO ] Deduced a trap composed of 89 places in 118 ms of which 0 ms to minimize.
[2024-05-25 15:35:01] [INFO ] Deduced a trap composed of 84 places in 149 ms of which 1 ms to minimize.
[2024-05-25 15:35:01] [INFO ] Deduced a trap composed of 83 places in 139 ms of which 0 ms to minimize.
[2024-05-25 15:35:01] [INFO ] Deduced a trap composed of 41 places in 153 ms of which 0 ms to minimize.
[2024-05-25 15:35:02] [INFO ] Deduced a trap composed of 84 places in 147 ms of which 0 ms to minimize.
[2024-05-25 15:35:02] [INFO ] Deduced a trap composed of 91 places in 120 ms of which 0 ms to minimize.
[2024-05-25 15:35:02] [INFO ] Deduced a trap composed of 83 places in 132 ms of which 0 ms to minimize.
[2024-05-25 15:35:02] [INFO ] Deduced a trap composed of 88 places in 117 ms of which 0 ms to minimize.
[2024-05-25 15:35:02] [INFO ] Deduced a trap composed of 94 places in 125 ms of which 1 ms to minimize.
[2024-05-25 15:35:02] [INFO ] Deduced a trap composed of 88 places in 158 ms of which 0 ms to minimize.
[2024-05-25 15:35:03] [INFO ] Deduced a trap composed of 83 places in 116 ms of which 0 ms to minimize.
[2024-05-25 15:35:03] [INFO ] Deduced a trap composed of 80 places in 119 ms of which 0 ms to minimize.
[2024-05-25 15:35:03] [INFO ] Deduced a trap composed of 88 places in 119 ms of which 1 ms to minimize.
[2024-05-25 15:35:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 26 trap constraints in 4304 ms
[2024-05-25 15:35:03] [INFO ] After 4549ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :0
[2024-05-25 15:35:03] [INFO ] After 4695ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (OR p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (G (OR p0 p1)), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT p0)), (F (AND (NOT p0) p1))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 148 ms. Reduced automaton from 7 states, 12 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 468 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 468/468 places, 413/413 transitions.
Graph (trivial) has 211 edges and 468 vertex of which 6 / 468 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 1065 edges and 463 vertex of which 462 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 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 48 place count 461 transition count 359
Reduce places removed 46 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 47 rules applied. Total rules applied 95 place count 415 transition count 358
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 96 place count 414 transition count 358
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 96 Pre rules applied. Total rules applied 96 place count 414 transition count 262
Deduced a syphon composed of 96 places in 1 ms
Ensure Unique test removed 17 places
Reduce places removed 113 places and 0 transitions.
Iterating global reduction 3 with 209 rules applied. Total rules applied 305 place count 301 transition count 262
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Deduced a syphon composed of 127 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 132 places and 0 transitions.
Iterating global reduction 3 with 259 rules applied. Total rules applied 564 place count 169 transition count 135
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 566 place count 168 transition count 139
Applied a total of 566 rules in 34 ms. Remains 168 /468 variables (removed 300) and now considering 139/413 (removed 274) transitions.
// Phase 1: matrix 139 rows 168 cols
[2024-05-25 15:35:03] [INFO ] Computed 72 invariants in 1 ms
[2024-05-25 15:35:03] [INFO ] Implicit Places using invariants in 120 ms returned [1, 2, 3, 4, 5, 6, 7, 14, 15, 20, 21, 22, 23, 24, 25, 49, 50, 51, 52, 53]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 135 ms to find 20 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 148/468 places, 139/413 transitions.
Applied a total of 0 rules in 3 ms. Remains 148 /148 variables (removed 0) and now considering 139/139 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 172 ms. Remains : 148/468 places, 139/413 transitions.
Computed a total of 12 stabilizing places and 10 stable transitions
Computed a total of 12 stabilizing places and 10 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 105 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 108 ms :[(NOT p0), (NOT p0)]
Finished random walk after 9781 steps, including 2375 resets, run visited all 1 properties in 25 ms. (steps per millisecond=391 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 161 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 21806 reset in 159 ms.
Product exploration explored 100000 steps with 21827 reset in 173 ms.
Built C files in :
/tmp/ltsmin4891189446881229369
[2024-05-25 15:35:04] [INFO ] Computing symmetric may disable matrix : 139 transitions.
[2024-05-25 15:35:04] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 15:35:04] [INFO ] Computing symmetric may enable matrix : 139 transitions.
[2024-05-25 15:35:04] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 15:35:04] [INFO ] Computing Do-Not-Accords matrix : 139 transitions.
[2024-05-25 15:35:04] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 15:35:04] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4891189446881229369
Running compilation step : cd /tmp/ltsmin4891189446881229369;'/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 373 ms.
Running link step : cd /tmp/ltsmin4891189446881229369;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin4891189446881229369;'/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/stateBased11142032163278166519.hoa' '--buchi-type=spotba'
LTSmin run took 559 ms.
FORMULA BusinessProcesses-PT-14-LTLCardinality-15 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property BusinessProcesses-PT-14-LTLCardinality-15 finished in 13865 ms.
All properties solved by simple procedures.
Total runtime 59196 ms.

BK_STOP 1716651306155

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.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-14"
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-14, 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-171620414900347"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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