About the Execution of LTSMin+red for BusinessProcesses-PT-12
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 555.304 | 29285.00 | 57668.00 | 82.50 | FTFTFFFFTFF?FTTF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2023-input.r041-tajo-167813694800539.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is BusinessProcesses-PT-12, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r041-tajo-167813694800539
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 528K
-rw-r--r-- 1 mcc users 6.4K Feb 25 16:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Feb 25 16:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 25 16:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 25 16:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.5K Feb 25 16:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 70K Feb 25 16:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Feb 25 16:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 25 16:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:39 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 146K Mar 5 18:22 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME BusinessProcesses-PT-12-LTLCardinality-00
FORMULA_NAME BusinessProcesses-PT-12-LTLCardinality-01
FORMULA_NAME BusinessProcesses-PT-12-LTLCardinality-02
FORMULA_NAME BusinessProcesses-PT-12-LTLCardinality-03
FORMULA_NAME BusinessProcesses-PT-12-LTLCardinality-04
FORMULA_NAME BusinessProcesses-PT-12-LTLCardinality-05
FORMULA_NAME BusinessProcesses-PT-12-LTLCardinality-06
FORMULA_NAME BusinessProcesses-PT-12-LTLCardinality-07
FORMULA_NAME BusinessProcesses-PT-12-LTLCardinality-08
FORMULA_NAME BusinessProcesses-PT-12-LTLCardinality-09
FORMULA_NAME BusinessProcesses-PT-12-LTLCardinality-10
FORMULA_NAME BusinessProcesses-PT-12-LTLCardinality-11
FORMULA_NAME BusinessProcesses-PT-12-LTLCardinality-12
FORMULA_NAME BusinessProcesses-PT-12-LTLCardinality-13
FORMULA_NAME BusinessProcesses-PT-12-LTLCardinality-14
FORMULA_NAME BusinessProcesses-PT-12-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1678644082903
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=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-12
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 18:01:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-12 18:01:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 18:01:24] [INFO ] Load time of PNML (sax parser for PT used): 66 ms
[2023-03-12 18:01:24] [INFO ] Transformed 586 places.
[2023-03-12 18:01:24] [INFO ] Transformed 525 transitions.
[2023-03-12 18:01:24] [INFO ] Found NUPN structural information;
[2023-03-12 18:01:24] [INFO ] Parsed PT model containing 586 places and 525 transitions and 1560 arcs in 139 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 4 places in 11 ms
Reduce places removed 4 places and 4 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA BusinessProcesses-PT-12-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-12-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-12-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-12-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-12-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-12-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 26 out of 582 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 582/582 places, 521/521 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 579 transition count 521
Discarding 80 places :
Symmetric choice reduction at 1 with 80 rule applications. Total rules 83 place count 499 transition count 441
Iterating global reduction 1 with 80 rules applied. Total rules applied 163 place count 499 transition count 441
Discarding 38 places :
Symmetric choice reduction at 1 with 38 rule applications. Total rules 201 place count 461 transition count 403
Iterating global reduction 1 with 38 rules applied. Total rules applied 239 place count 461 transition count 403
Applied a total of 239 rules in 99 ms. Remains 461 /582 variables (removed 121) and now considering 403/521 (removed 118) transitions.
// Phase 1: matrix 403 rows 461 cols
[2023-03-12 18:01:25] [INFO ] Computed 95 place invariants in 27 ms
[2023-03-12 18:01:25] [INFO ] Implicit Places using invariants in 415 ms returned []
[2023-03-12 18:01:25] [INFO ] Invariant cache hit.
[2023-03-12 18:01:26] [INFO ] Implicit Places using invariants and state equation in 645 ms returned []
Implicit Place search using SMT with State Equation took 1087 ms to find 0 implicit places.
[2023-03-12 18:01:26] [INFO ] Invariant cache hit.
[2023-03-12 18:01:26] [INFO ] Dead Transitions using invariants and state equation in 265 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 461/582 places, 403/521 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1454 ms. Remains : 461/582 places, 403/521 transitions.
Support contains 26 out of 461 places after structural reductions.
[2023-03-12 18:01:26] [INFO ] Flatten gal took : 67 ms
[2023-03-12 18:01:26] [INFO ] Flatten gal took : 37 ms
[2023-03-12 18:01:26] [INFO ] Input system was already deterministic with 403 transitions.
Incomplete random walk after 10000 steps, including 71 resets, run finished after 311 ms. (steps per millisecond=32 ) properties (out of 16) seen :10
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-03-12 18:01:27] [INFO ] Invariant cache hit.
[2023-03-12 18:01:27] [INFO ] [Real]Absence check using 52 positive place invariants in 14 ms returned sat
[2023-03-12 18:01:27] [INFO ] [Real]Absence check using 52 positive and 43 generalized place invariants in 14 ms returned sat
[2023-03-12 18:01:27] [INFO ] After 159ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:5
[2023-03-12 18:01:27] [INFO ] Deduced a trap composed of 37 places in 80 ms of which 7 ms to minimize.
[2023-03-12 18:01:27] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 1 ms to minimize.
[2023-03-12 18:01:28] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 2 ms to minimize.
[2023-03-12 18:01:28] [INFO ] Deduced a trap composed of 43 places in 65 ms of which 2 ms to minimize.
[2023-03-12 18:01:28] [INFO ] Deduced a trap composed of 29 places in 56 ms of which 1 ms to minimize.
[2023-03-12 18:01:28] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 452 ms
[2023-03-12 18:01:28] [INFO ] After 624ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-12 18:01:28] [INFO ] After 804ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-12 18:01:28] [INFO ] [Nat]Absence check using 52 positive place invariants in 13 ms returned sat
[2023-03-12 18:01:28] [INFO ] [Nat]Absence check using 52 positive and 43 generalized place invariants in 12 ms returned sat
[2023-03-12 18:01:28] [INFO ] After 273ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-12 18:01:28] [INFO ] Deduced a trap composed of 8 places in 95 ms of which 0 ms to minimize.
[2023-03-12 18:01:28] [INFO ] Deduced a trap composed of 28 places in 92 ms of which 0 ms to minimize.
[2023-03-12 18:01:29] [INFO ] Deduced a trap composed of 21 places in 82 ms of which 1 ms to minimize.
[2023-03-12 18:01:29] [INFO ] Deduced a trap composed of 32 places in 69 ms of which 1 ms to minimize.
[2023-03-12 18:01:29] [INFO ] Deduced a trap composed of 35 places in 87 ms of which 0 ms to minimize.
[2023-03-12 18:01:29] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 1 ms to minimize.
[2023-03-12 18:01:29] [INFO ] Deduced a trap composed of 37 places in 67 ms of which 1 ms to minimize.
[2023-03-12 18:01:29] [INFO ] Deduced a trap composed of 45 places in 110 ms of which 1 ms to minimize.
[2023-03-12 18:01:29] [INFO ] Deduced a trap composed of 23 places in 112 ms of which 0 ms to minimize.
[2023-03-12 18:01:29] [INFO ] Deduced a trap composed of 28 places in 87 ms of which 1 ms to minimize.
[2023-03-12 18:01:29] [INFO ] Deduced a trap composed of 40 places in 77 ms of which 1 ms to minimize.
[2023-03-12 18:01:29] [INFO ] Deduced a trap composed of 24 places in 74 ms of which 1 ms to minimize.
[2023-03-12 18:01:30] [INFO ] Deduced a trap composed of 30 places in 73 ms of which 1 ms to minimize.
[2023-03-12 18:01:30] [INFO ] Deduced a trap composed of 44 places in 61 ms of which 1 ms to minimize.
[2023-03-12 18:01:30] [INFO ] Deduced a trap composed of 32 places in 63 ms of which 1 ms to minimize.
[2023-03-12 18:01:30] [INFO ] Deduced a trap composed of 36 places in 105 ms of which 0 ms to minimize.
[2023-03-12 18:01:30] [INFO ] Deduced a trap composed of 29 places in 60 ms of which 0 ms to minimize.
[2023-03-12 18:01:30] [INFO ] Deduced a trap composed of 52 places in 65 ms of which 1 ms to minimize.
[2023-03-12 18:01:30] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 1836 ms
[2023-03-12 18:01:30] [INFO ] Deduced a trap composed of 90 places in 141 ms of which 1 ms to minimize.
[2023-03-12 18:01:30] [INFO ] Deduced a trap composed of 74 places in 89 ms of which 1 ms to minimize.
[2023-03-12 18:01:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 292 ms
[2023-03-12 18:01:30] [INFO ] After 2564ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :5
Attempting to minimize the solution found.
Minimization took 143 ms.
[2023-03-12 18:01:31] [INFO ] After 2886ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :5
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 1 properties in 45 ms.
Support contains 7 out of 461 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 461/461 places, 403/403 transitions.
Graph (trivial) has 207 edges and 461 vertex of which 6 / 461 are part of one of the 1 SCC in 7 ms
Free SCC test removed 5 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1033 edges and 456 vertex of which 455 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output 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 455 transition count 349
Reduce places removed 46 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 48 rules applied. Total rules applied 96 place count 409 transition count 347
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 98 place count 407 transition count 347
Performed 94 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 94 Pre rules applied. Total rules applied 98 place count 407 transition count 253
Deduced a syphon composed of 94 places in 0 ms
Ensure Unique test removed 16 places
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 3 with 204 rules applied. Total rules applied 302 place count 297 transition count 253
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 307 place count 292 transition count 248
Iterating global reduction 3 with 5 rules applied. Total rules applied 312 place count 292 transition count 248
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 312 place count 292 transition count 246
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 316 place count 290 transition count 246
Performed 117 Post agglomeration using F-continuation condition.Transition count delta: 117
Deduced a syphon composed of 117 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 121 places and 0 transitions.
Iterating global reduction 3 with 238 rules applied. Total rules applied 554 place count 169 transition count 129
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 556 place count 168 transition count 133
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 558 place count 168 transition count 131
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 560 place count 166 transition count 131
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 561 place count 166 transition count 131
Applied a total of 561 rules in 147 ms. Remains 166 /461 variables (removed 295) and now considering 131/403 (removed 272) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 148 ms. Remains : 166/461 places, 131/403 transitions.
Finished random walk after 550 steps, including 20 resets, run visited all 4 properties in 11 ms. (steps per millisecond=50 )
Successfully simplified 1 atomic propositions for a total of 10 simplifications.
FORMULA BusinessProcesses-PT-12-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 446 stabilizing places and 388 stable transitions
Graph (complete) has 1040 edges and 461 vertex of which 460 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.24 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 461 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 461/461 places, 403/403 transitions.
Graph (trivial) has 211 edges and 461 vertex of which 6 / 461 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 1034 edges and 456 vertex of which 455 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 47 rules applied. Total rules applied 49 place count 454 transition count 348
Reduce places removed 47 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 48 rules applied. Total rules applied 97 place count 407 transition count 347
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 98 place count 406 transition count 347
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 96 Pre rules applied. Total rules applied 98 place count 406 transition count 251
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 307 place count 293 transition count 251
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 314 place count 286 transition count 244
Iterating global reduction 3 with 7 rules applied. Total rules applied 321 place count 286 transition count 244
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 321 place count 286 transition count 242
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 325 place count 284 transition count 242
Performed 116 Post agglomeration using F-continuation condition.Transition count delta: 116
Deduced a syphon composed of 116 places in 1 ms
Ensure Unique test removed 4 places
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 3 with 236 rules applied. Total rules applied 561 place count 164 transition count 126
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 563 place count 163 transition count 130
Applied a total of 563 rules in 56 ms. Remains 163 /461 variables (removed 298) and now considering 130/403 (removed 273) transitions.
// Phase 1: matrix 130 rows 163 cols
[2023-03-12 18:01:31] [INFO ] Computed 74 place invariants in 3 ms
[2023-03-12 18:01:31] [INFO ] Implicit Places using invariants in 186 ms returned [1, 2, 5, 6, 29, 30, 31, 32, 39, 40, 41, 48, 49, 50, 51, 52, 53, 54, 55, 130]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 188 ms to find 20 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 143/461 places, 130/403 transitions.
Applied a total of 0 rules in 16 ms. Remains 143 /143 variables (removed 0) and now considering 130/130 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 261 ms. Remains : 143/461 places, 130/403 transitions.
Stuttering acceptance computed with spot in 162 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-12-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s32 0) (EQ s41 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 2 ms.
FORMULA BusinessProcesses-PT-12-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-12-LTLCardinality-00 finished in 476 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 461 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 461/461 places, 403/403 transitions.
Graph (trivial) has 211 edges and 461 vertex of which 6 / 461 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 1034 edges and 456 vertex of which 455 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 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 454 transition count 347
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 98 place count 406 transition count 347
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 96 Pre rules applied. Total rules applied 98 place count 406 transition count 251
Deduced a syphon composed of 96 places in 1 ms
Ensure Unique test removed 18 places
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 2 with 210 rules applied. Total rules applied 308 place count 292 transition count 251
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 314 place count 286 transition count 245
Iterating global reduction 2 with 6 rules applied. Total rules applied 320 place count 286 transition count 245
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 320 place count 286 transition count 243
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 324 place count 284 transition count 243
Performed 117 Post agglomeration using F-continuation condition.Transition count delta: 117
Deduced a syphon composed of 117 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 121 places and 0 transitions.
Iterating global reduction 2 with 238 rules applied. Total rules applied 562 place count 163 transition count 126
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 564 place count 162 transition count 130
Applied a total of 564 rules in 46 ms. Remains 162 /461 variables (removed 299) and now considering 130/403 (removed 273) transitions.
// Phase 1: matrix 130 rows 162 cols
[2023-03-12 18:01:32] [INFO ] Computed 73 place invariants in 6 ms
[2023-03-12 18:01:32] [INFO ] Implicit Places using invariants in 143 ms returned [1, 2, 5, 6, 29, 30, 31, 32, 39, 40, 41, 46, 47, 48, 49, 50, 51, 52, 53]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 145 ms to find 19 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 143/461 places, 130/403 transitions.
Applied a total of 0 rules in 6 ms. Remains 143 /143 variables (removed 0) and now considering 130/130 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 199 ms. Remains : 143/461 places, 130/403 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-12-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s83 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-12-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-12-LTLCardinality-02 finished in 248 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0 U p1)))'
Support contains 3 out of 461 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 461/461 places, 403/403 transitions.
Graph (trivial) has 210 edges and 461 vertex of which 6 / 461 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 1034 edges and 456 vertex of which 455 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 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 47 rules applied. Total rules applied 49 place count 454 transition count 348
Reduce places removed 47 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 48 rules applied. Total rules applied 97 place count 407 transition count 347
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 98 place count 406 transition count 347
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 96 Pre rules applied. Total rules applied 98 place count 406 transition count 251
Deduced a syphon composed of 96 places in 0 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 307 place count 293 transition count 251
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 313 place count 287 transition count 245
Iterating global reduction 3 with 6 rules applied. Total rules applied 319 place count 287 transition count 245
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 319 place count 287 transition count 243
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 323 place count 285 transition count 243
Performed 114 Post agglomeration using F-continuation condition.Transition count delta: 114
Deduced a syphon composed of 114 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 118 places and 0 transitions.
Iterating global reduction 3 with 232 rules applied. Total rules applied 555 place count 167 transition count 129
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 557 place count 166 transition count 133
Applied a total of 557 rules in 66 ms. Remains 166 /461 variables (removed 295) and now considering 133/403 (removed 270) transitions.
// Phase 1: matrix 133 rows 166 cols
[2023-03-12 18:01:32] [INFO ] Computed 74 place invariants in 2 ms
[2023-03-12 18:01:32] [INFO ] Implicit Places using invariants in 156 ms returned [1, 2, 5, 6, 29, 30, 31, 32, 39, 40, 41, 46, 47, 48, 49, 50, 51, 52, 55, 140]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 161 ms to find 20 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 146/461 places, 133/403 transitions.
Applied a total of 0 rules in 6 ms. Remains 146 /146 variables (removed 0) and now considering 133/133 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 233 ms. Remains : 146/461 places, 133/403 transitions.
Stuttering acceptance computed with spot in 132 ms :[(NOT p1), true, (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-12-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(OR (EQ s104 0) (EQ s36 1)), p0:(EQ s39 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 14993 reset in 354 ms.
Product exploration explored 100000 steps with 14849 reset in 294 ms.
Computed a total of 137 stabilizing places and 125 stable transitions
Computed a total of 137 stabilizing places and 125 stable transitions
Detected a total of 137/146 stabilizing places and 125/133 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0)), (X (OR p1 p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (X (OR p1 p0))), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 298 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p1), true, (NOT p1)]
Incomplete random walk after 10000 steps, including 1618 resets, run finished after 166 ms. (steps per millisecond=60 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 648 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 667 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 563 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 3) seen :0
Probably explored full state space saw : 8659 states, properties seen :2
Probabilistic random walk after 28686 steps, saw 8659 distinct states, run finished after 83 ms. (steps per millisecond=345 ) properties seen :2
Explored full state space saw : 8659 states, properties seen :0
Exhaustive walk after 28686 steps, saw 8659 distinct states, run finished after 55 ms. (steps per millisecond=521 ) properties seen :0
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p0)), (X (OR p1 p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (X (OR p1 p0))), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND (NOT p1) p0)))]
False Knowledge obtained : [(F (NOT (OR p1 p0))), (F (AND (NOT p1) (NOT p0)))]
Property proved to be false thanks to negative knowledge :(F (NOT (OR p1 p0)))
Knowledge based reduction with 11 factoid took 199 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-12-LTLCardinality-04 FALSE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-12-LTLCardinality-04 finished in 2046 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((p0||F(p1))&&(p0||X(p2))))))'
Support contains 5 out of 461 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 461/461 places, 403/403 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 457 transition count 399
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 457 transition count 399
Applied a total of 8 rules in 26 ms. Remains 457 /461 variables (removed 4) and now considering 399/403 (removed 4) transitions.
// Phase 1: matrix 399 rows 457 cols
[2023-03-12 18:01:34] [INFO ] Computed 95 place invariants in 5 ms
[2023-03-12 18:01:34] [INFO ] Implicit Places using invariants in 227 ms returned []
[2023-03-12 18:01:34] [INFO ] Invariant cache hit.
[2023-03-12 18:01:35] [INFO ] Implicit Places using invariants and state equation in 471 ms returned []
Implicit Place search using SMT with State Equation took 716 ms to find 0 implicit places.
[2023-03-12 18:01:35] [INFO ] Invariant cache hit.
[2023-03-12 18:01:35] [INFO ] Dead Transitions using invariants and state equation in 194 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 457/461 places, 399/403 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 938 ms. Remains : 457/461 places, 399/403 transitions.
Stuttering acceptance computed with spot in 132 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : BusinessProcesses-PT-12-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={0} source=0 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s84 0) (EQ s407 1)), p1:(OR (EQ s270 0) (EQ s5 1)), p2:(EQ s283 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 648 steps with 5 reset in 4 ms.
FORMULA BusinessProcesses-PT-12-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-12-LTLCardinality-05 finished in 1097 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 461 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 461/461 places, 403/403 transitions.
Graph (trivial) has 211 edges and 461 vertex of which 6 / 461 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 1034 edges and 456 vertex of which 455 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 47 rules applied. Total rules applied 49 place count 454 transition count 348
Reduce places removed 47 places and 0 transitions.
Iterating post reduction 1 with 47 rules applied. Total rules applied 96 place count 407 transition count 348
Performed 97 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 97 Pre rules applied. Total rules applied 96 place count 407 transition count 251
Deduced a syphon composed of 97 places in 1 ms
Ensure Unique test removed 17 places
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 2 with 211 rules applied. Total rules applied 307 place count 293 transition count 251
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 314 place count 286 transition count 244
Iterating global reduction 2 with 7 rules applied. Total rules applied 321 place count 286 transition count 244
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 321 place count 286 transition count 242
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 325 place count 284 transition count 242
Performed 114 Post agglomeration using F-continuation condition.Transition count delta: 114
Deduced a syphon composed of 114 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 118 places and 0 transitions.
Iterating global reduction 2 with 232 rules applied. Total rules applied 557 place count 166 transition count 128
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 559 place count 165 transition count 132
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 560 place count 164 transition count 131
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 561 place count 163 transition count 131
Applied a total of 561 rules in 52 ms. Remains 163 /461 variables (removed 298) and now considering 131/403 (removed 272) transitions.
// Phase 1: matrix 131 rows 163 cols
[2023-03-12 18:01:35] [INFO ] Computed 73 place invariants in 1 ms
[2023-03-12 18:01:35] [INFO ] Implicit Places using invariants in 171 ms returned [55, 128]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 172 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 161/461 places, 131/403 transitions.
Applied a total of 0 rules in 8 ms. Remains 161 /161 variables (removed 0) and now considering 131/131 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 234 ms. Remains : 161/461 places, 131/403 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-12-LTLCardinality-07 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 (NEQ s1 0) (NEQ s41 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-12-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-12-LTLCardinality-07 finished in 284 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0) U p1)))'
Support contains 3 out of 461 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 461/461 places, 403/403 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 455 transition count 397
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 455 transition count 397
Applied a total of 12 rules in 16 ms. Remains 455 /461 variables (removed 6) and now considering 397/403 (removed 6) transitions.
// Phase 1: matrix 397 rows 455 cols
[2023-03-12 18:01:35] [INFO ] Computed 95 place invariants in 4 ms
[2023-03-12 18:01:35] [INFO ] Implicit Places using invariants in 177 ms returned []
[2023-03-12 18:01:35] [INFO ] Invariant cache hit.
[2023-03-12 18:01:36] [INFO ] Implicit Places using invariants and state equation in 433 ms returned []
Implicit Place search using SMT with State Equation took 616 ms to find 0 implicit places.
[2023-03-12 18:01:36] [INFO ] Invariant cache hit.
[2023-03-12 18:01:36] [INFO ] Dead Transitions using invariants and state equation in 198 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 455/461 places, 397/403 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 835 ms. Remains : 455/461 places, 397/403 transitions.
Stuttering acceptance computed with spot in 125 ms :[(NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-12-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(OR (EQ s223 0) (EQ s4 1)), p0:(EQ s46 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 407 ms.
Product exploration explored 100000 steps with 50000 reset in 394 ms.
Computed a total of 440 stabilizing places and 382 stable transitions
Graph (complete) has 1033 edges and 455 vertex of which 454 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Computed a total of 440 stabilizing places and 382 stable transitions
Detected a total of 440/455 stabilizing places and 382/397 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p1) (NOT p0))))
Knowledge based reduction with 9 factoid took 182 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-12-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-12-LTLCardinality-08 finished in 1969 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(p1)||p0)))'
Support contains 4 out of 461 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 461/461 places, 403/403 transitions.
Graph (trivial) has 210 edges and 461 vertex of which 6 / 461 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 1034 edges and 456 vertex of which 455 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 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 454 transition count 347
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 98 place count 406 transition count 347
Performed 95 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 95 Pre rules applied. Total rules applied 98 place count 406 transition count 252
Deduced a syphon composed of 95 places in 1 ms
Ensure Unique test removed 16 places
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 2 with 206 rules applied. Total rules applied 304 place count 295 transition count 252
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 311 place count 288 transition count 245
Iterating global reduction 2 with 7 rules applied. Total rules applied 318 place count 288 transition count 245
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 318 place count 288 transition count 243
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 322 place count 286 transition count 243
Performed 113 Post agglomeration using F-continuation condition.Transition count delta: 113
Deduced a syphon composed of 113 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 115 places and 0 transitions.
Iterating global reduction 2 with 228 rules applied. Total rules applied 550 place count 171 transition count 130
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 552 place count 170 transition count 134
Applied a total of 552 rules in 30 ms. Remains 170 /461 variables (removed 291) and now considering 134/403 (removed 269) transitions.
// Phase 1: matrix 134 rows 170 cols
[2023-03-12 18:01:37] [INFO ] Computed 77 place invariants in 1 ms
[2023-03-12 18:01:37] [INFO ] Implicit Places using invariants in 217 ms returned [1, 2, 5, 6, 7, 30, 31, 32, 35, 42, 43, 44, 46, 48, 51, 52, 53, 54, 55, 56, 57, 58, 132]
Discarding 23 places :
Implicit Place search using SMT only with invariants took 219 ms to find 23 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 147/461 places, 134/403 transitions.
Applied a total of 0 rules in 8 ms. Remains 147 /147 variables (removed 0) and now considering 134/134 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 257 ms. Remains : 147/461 places, 134/403 transitions.
Stuttering acceptance computed with spot in 125 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-12-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=2, aps=[p1:(OR (EQ s141 0) (EQ s103 1)), p0:(OR (EQ s39 0) (EQ s25 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 15183 reset in 219 ms.
Product exploration explored 100000 steps with 15118 reset in 231 ms.
Computed a total of 138 stabilizing places and 126 stable transitions
Computed a total of 138 stabilizing places and 126 stable transitions
Detected a total of 138/147 stabilizing places and 126/134 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), true, (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 10 factoid took 421 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 1641 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 595 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 540 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 134 rows 147 cols
[2023-03-12 18:01:39] [INFO ] Computed 54 place invariants in 1 ms
[2023-03-12 18:01:39] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 18:01:39] [INFO ] [Nat]Absence check using 32 positive place invariants in 6 ms returned sat
[2023-03-12 18:01:39] [INFO ] [Nat]Absence check using 32 positive and 22 generalized place invariants in 7 ms returned sat
[2023-03-12 18:01:39] [INFO ] After 59ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 18:01:39] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-12 18:01:39] [INFO ] After 14ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 18:01:39] [INFO ] Deduced a trap composed of 17 places in 104 ms of which 1 ms to minimize.
[2023-03-12 18:01:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 120 ms
[2023-03-12 18:01:39] [INFO ] After 147ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 11 ms.
[2023-03-12 18:01:39] [INFO ] After 299ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 18 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=18 )
Parikh walk visited 1 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), true, (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0))), (F (NOT p0)), (F (NOT p1)), (F (AND p1 (NOT p0)))]
Knowledge based reduction with 11 factoid took 509 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 56 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 53 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 4 out of 147 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 147/147 places, 134/134 transitions.
Applied a total of 0 rules in 1 ms. Remains 147 /147 variables (removed 0) and now considering 134/134 (removed 0) transitions.
[2023-03-12 18:01:40] [INFO ] Invariant cache hit.
[2023-03-12 18:01:40] [INFO ] Implicit Places using invariants in 86 ms returned []
[2023-03-12 18:01:40] [INFO ] Invariant cache hit.
[2023-03-12 18:01:40] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-12 18:01:40] [INFO ] Implicit Places using invariants and state equation in 266 ms returned [3, 27, 29, 31, 33, 71, 73, 75, 77, 79, 81, 83, 85, 87, 89, 91, 93, 95]
Discarding 18 places :
Implicit Place search using SMT with State Equation took 366 ms to find 18 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 129/147 places, 134/134 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 128 transition count 133
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 128 transition count 133
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 127 transition count 132
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 127 transition count 132
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 126 transition count 131
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 126 transition count 131
Applied a total of 6 rules in 4 ms. Remains 126 /129 variables (removed 3) and now considering 131/134 (removed 3) transitions.
// Phase 1: matrix 131 rows 126 cols
[2023-03-12 18:01:40] [INFO ] Computed 36 place invariants in 0 ms
[2023-03-12 18:01:40] [INFO ] Implicit Places using invariants in 85 ms returned []
[2023-03-12 18:01:40] [INFO ] Invariant cache hit.
[2023-03-12 18:01:40] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-12 18:01:40] [INFO ] Implicit Places using invariants and state equation in 156 ms returned []
Implicit Place search using SMT with State Equation took 279 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 126/147 places, 131/134 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 650 ms. Remains : 126/147 places, 131/134 transitions.
Computed a total of 117 stabilizing places and 123 stable transitions
Graph (complete) has 430 edges and 126 vertex of which 114 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.1 ms
Computed a total of 117 stabilizing places and 123 stable transitions
Detected a total of 117/126 stabilizing places and 123/131 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X p1), (X p0), true, (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 7 factoid took 477 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 53 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 1660 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 591 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-12 18:01:41] [INFO ] Invariant cache hit.
[2023-03-12 18:01:41] [INFO ] After 80ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 18:01:41] [INFO ] [Nat]Absence check using 18 positive place invariants in 3 ms returned sat
[2023-03-12 18:01:41] [INFO ] [Nat]Absence check using 18 positive and 18 generalized place invariants in 11 ms returned sat
[2023-03-12 18:01:41] [INFO ] After 40ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 18:01:41] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-12 18:01:41] [INFO ] After 5ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 18:01:41] [INFO ] After 13ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-12 18:01:41] [INFO ] After 124ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 18 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=18 )
Parikh walk visited 1 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X p1), (X p0), true, (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 7 factoid took 475 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 87 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 57 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 68 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Entered a terminal (fully accepting) state of product in 14719 steps with 2227 reset in 21 ms.
FORMULA BusinessProcesses-PT-12-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-12-LTLCardinality-09 finished in 4633 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(F(p0))))))'
Support contains 2 out of 461 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 461/461 places, 403/403 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 454 transition count 396
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 454 transition count 396
Applied a total of 14 rules in 15 ms. Remains 454 /461 variables (removed 7) and now considering 396/403 (removed 7) transitions.
// Phase 1: matrix 396 rows 454 cols
[2023-03-12 18:01:42] [INFO ] Computed 95 place invariants in 4 ms
[2023-03-12 18:01:42] [INFO ] Implicit Places using invariants in 239 ms returned []
[2023-03-12 18:01:42] [INFO ] Invariant cache hit.
[2023-03-12 18:01:43] [INFO ] Implicit Places using invariants and state equation in 478 ms returned []
Implicit Place search using SMT with State Equation took 721 ms to find 0 implicit places.
[2023-03-12 18:01:43] [INFO ] Invariant cache hit.
[2023-03-12 18:01:43] [INFO ] Dead Transitions using invariants and state equation in 227 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 454/461 places, 396/403 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 966 ms. Remains : 454/461 places, 396/403 transitions.
Stuttering acceptance computed with spot in 152 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-12-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p0:(OR (EQ s58 0) (EQ s209 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 20000 reset in 200 ms.
Product exploration explored 100000 steps with 20000 reset in 224 ms.
Computed a total of 439 stabilizing places and 381 stable transitions
Graph (complete) has 1032 edges and 454 vertex of which 453 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 439 stabilizing places and 381 stable transitions
Detected a total of 439/454 stabilizing places and 381/396 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 111 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 147 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 90 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=90 )
Knowledge obtained : [p0, true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 105 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 128 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 153 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 454 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 454/454 places, 396/396 transitions.
Applied a total of 0 rules in 8 ms. Remains 454 /454 variables (removed 0) and now considering 396/396 (removed 0) transitions.
[2023-03-12 18:01:44] [INFO ] Invariant cache hit.
[2023-03-12 18:01:44] [INFO ] Implicit Places using invariants in 204 ms returned []
[2023-03-12 18:01:44] [INFO ] Invariant cache hit.
[2023-03-12 18:01:45] [INFO ] Implicit Places using invariants and state equation in 525 ms returned []
Implicit Place search using SMT with State Equation took 731 ms to find 0 implicit places.
[2023-03-12 18:01:45] [INFO ] Invariant cache hit.
[2023-03-12 18:01:45] [INFO ] Dead Transitions using invariants and state equation in 212 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 952 ms. Remains : 454/454 places, 396/396 transitions.
Computed a total of 439 stabilizing places and 381 stable transitions
Graph (complete) has 1032 edges and 454 vertex of which 453 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 439 stabilizing places and 381 stable transitions
Detected a total of 439/454 stabilizing places and 381/396 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 101 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 136 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 119 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=59 )
Knowledge obtained : [p0, true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 122 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 136 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 144 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 137 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 20000 reset in 201 ms.
Product exploration explored 100000 steps with 20000 reset in 223 ms.
Applying partial POR strategy [true, false, false, false, false]
Stuttering acceptance computed with spot in 181 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 454 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 454/454 places, 396/396 transitions.
Graph (trivial) has 202 edges and 454 vertex of which 6 / 454 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 1026 edges and 449 vertex of which 448 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 43 rules applied. Total rules applied 45 place count 448 transition count 389
Performed 69 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 69 Pre rules applied. Total rules applied 45 place count 448 transition count 438
Deduced a syphon composed of 112 places in 1 ms
Iterating global reduction 1 with 69 rules applied. Total rules applied 114 place count 448 transition count 438
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 129 place count 433 transition count 408
Deduced a syphon composed of 97 places in 0 ms
Iterating global reduction 1 with 15 rules applied. Total rules applied 144 place count 433 transition count 408
Performed 147 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 244 places in 0 ms
Iterating global reduction 1 with 147 rules applied. Total rules applied 291 place count 433 transition count 408
Discarding 32 places :
Symmetric choice reduction at 1 with 32 rule applications. Total rules 323 place count 401 transition count 376
Deduced a syphon composed of 212 places in 1 ms
Iterating global reduction 1 with 32 rules applied. Total rules applied 355 place count 401 transition count 376
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 213 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 356 place count 401 transition count 387
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 357 place count 400 transition count 385
Deduced a syphon composed of 212 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 358 place count 400 transition count 385
Deduced a syphon composed of 212 places in 0 ms
Applied a total of 358 rules in 112 ms. Remains 400 /454 variables (removed 54) and now considering 385/396 (removed 11) transitions.
[2023-03-12 18:01:47] [INFO ] Redundant transitions in 20 ms returned []
// Phase 1: matrix 385 rows 400 cols
[2023-03-12 18:01:47] [INFO ] Computed 95 place invariants in 18 ms
[2023-03-12 18:01:47] [INFO ] Dead Transitions using invariants and state equation in 244 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 400/454 places, 385/396 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 412 ms. Remains : 400/454 places, 385/396 transitions.
Support contains 2 out of 454 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 454/454 places, 396/396 transitions.
Applied a total of 0 rules in 15 ms. Remains 454 /454 variables (removed 0) and now considering 396/396 (removed 0) transitions.
// Phase 1: matrix 396 rows 454 cols
[2023-03-12 18:01:47] [INFO ] Computed 95 place invariants in 4 ms
[2023-03-12 18:01:47] [INFO ] Implicit Places using invariants in 242 ms returned []
[2023-03-12 18:01:47] [INFO ] Invariant cache hit.
[2023-03-12 18:01:48] [INFO ] Implicit Places using invariants and state equation in 529 ms returned []
Implicit Place search using SMT with State Equation took 775 ms to find 0 implicit places.
[2023-03-12 18:01:48] [INFO ] Invariant cache hit.
[2023-03-12 18:01:48] [INFO ] Dead Transitions using invariants and state equation in 207 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 999 ms. Remains : 454/454 places, 396/396 transitions.
Treatment of property BusinessProcesses-PT-12-LTLCardinality-11 finished in 6252 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(G(p0))) U (p0&&X(p1))))'
Support contains 4 out of 461 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 461/461 places, 403/403 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 455 transition count 397
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 455 transition count 397
Applied a total of 12 rules in 30 ms. Remains 455 /461 variables (removed 6) and now considering 397/403 (removed 6) transitions.
// Phase 1: matrix 397 rows 455 cols
[2023-03-12 18:01:48] [INFO ] Computed 95 place invariants in 3 ms
[2023-03-12 18:01:49] [INFO ] Implicit Places using invariants in 423 ms returned []
[2023-03-12 18:01:49] [INFO ] Invariant cache hit.
[2023-03-12 18:01:49] [INFO ] Implicit Places using invariants and state equation in 429 ms returned []
Implicit Place search using SMT with State Equation took 856 ms to find 0 implicit places.
[2023-03-12 18:01:49] [INFO ] Invariant cache hit.
[2023-03-12 18:01:49] [INFO ] Dead Transitions using invariants and state equation in 253 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 455/461 places, 397/403 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1153 ms. Remains : 455/461 places, 397/403 transitions.
Stuttering acceptance computed with spot in 133 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p0), true]
Running random walk in product with property : BusinessProcesses-PT-12-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 1}, { cond=p0, acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 3}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(OR (EQ s296 0) (EQ s73 1)), p1:(OR (EQ s249 0) (EQ s393 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 326 ms.
Product exploration explored 100000 steps with 50000 reset in 432 ms.
Computed a total of 440 stabilizing places and 382 stable transitions
Graph (complete) has 1034 edges and 455 vertex of which 454 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 440 stabilizing places and 382 stable transitions
Detected a total of 440/455 stabilizing places and 382/397 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), true, (X (X p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p0 p1)
Knowledge based reduction with 12 factoid took 390 ms. Reduced automaton from 5 states, 10 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-12-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-12-LTLCardinality-14 finished in 2462 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(F(p0))))))'
Found a Shortening insensitive property : BusinessProcesses-PT-12-LTLCardinality-11
Stuttering acceptance computed with spot in 153 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 461 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 461/461 places, 403/403 transitions.
Graph (trivial) has 209 edges and 461 vertex of which 6 / 461 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 1034 edges and 456 vertex of which 455 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 454 transition count 349
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 1 with 46 rules applied. Total rules applied 94 place count 408 transition count 349
Performed 98 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 98 Pre rules applied. Total rules applied 94 place count 408 transition count 251
Deduced a syphon composed of 98 places in 0 ms
Ensure Unique test removed 18 places
Reduce places removed 116 places and 0 transitions.
Iterating global reduction 2 with 214 rules applied. Total rules applied 308 place count 292 transition count 251
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 315 place count 285 transition count 244
Iterating global reduction 2 with 7 rules applied. Total rules applied 322 place count 285 transition count 244
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 322 place count 285 transition count 242
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 326 place count 283 transition count 242
Performed 113 Post agglomeration using F-continuation condition.Transition count delta: 113
Deduced a syphon composed of 113 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 117 places and 0 transitions.
Iterating global reduction 2 with 230 rules applied. Total rules applied 556 place count 166 transition count 129
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 558 place count 165 transition count 133
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 559 place count 164 transition count 132
Applied a total of 559 rules in 35 ms. Remains 164 /461 variables (removed 297) and now considering 132/403 (removed 271) transitions.
// Phase 1: matrix 132 rows 164 cols
[2023-03-12 18:01:51] [INFO ] Computed 73 place invariants in 2 ms
[2023-03-12 18:01:51] [INFO ] Implicit Places using invariants in 116 ms returned [30, 31, 32, 33, 40, 41, 42, 47, 48, 49, 50, 51, 52, 53]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 130 ms to find 14 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 150/461 places, 132/403 transitions.
Applied a total of 0 rules in 3 ms. Remains 150 /150 variables (removed 0) and now considering 132/132 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 169 ms. Remains : 150/461 places, 132/403 transitions.
Running random walk in product with property : BusinessProcesses-PT-12-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p0:(OR (EQ s7 0) (EQ s41 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
Treatment of property BusinessProcesses-PT-12-LTLCardinality-11 finished in 410 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
[2023-03-12 18:01:51] [INFO ] Flatten gal took : 41 ms
[2023-03-12 18:01:51] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-12 18:01:51] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 461 places, 403 transitions and 1313 arcs took 20 ms.
Total runtime 27022 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1351/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : BusinessProcesses-PT-12-LTLCardinality-11
BK_STOP 1678644112188
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2023
ltl formula name BusinessProcesses-PT-12-LTLCardinality-11
ltl formula formula --ltl=/tmp/1351/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 461 places, 403 transitions and 1313 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.090 real 0.000 user 0.030 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1351/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1351/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1351/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1351/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
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-12"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is BusinessProcesses-PT-12, 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 r041-tajo-167813694800539"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-12.tgz
mv BusinessProcesses-PT-12 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 '
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 ;