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.r039-tajo-167813692800604.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 lolaxred
Input is BusinessProcesses-PT-20, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r039-tajo-167813692800604
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 632K
-rw-r--r-- 1 mcc users 7.9K Feb 25 16:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Feb 25 16:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 25 16:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 25 16:49 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.5K Feb 25 15:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K 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 12K Feb 25 16:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 129K Feb 25 16:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 25 16:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 25 16:50 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 192K 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-20-LTLFireability-00
FORMULA_NAME BusinessProcesses-PT-20-LTLFireability-01
FORMULA_NAME BusinessProcesses-PT-20-LTLFireability-02
FORMULA_NAME BusinessProcesses-PT-20-LTLFireability-03
FORMULA_NAME BusinessProcesses-PT-20-LTLFireability-04
FORMULA_NAME BusinessProcesses-PT-20-LTLFireability-05
FORMULA_NAME BusinessProcesses-PT-20-LTLFireability-06
FORMULA_NAME BusinessProcesses-PT-20-LTLFireability-07
FORMULA_NAME BusinessProcesses-PT-20-LTLFireability-08
FORMULA_NAME BusinessProcesses-PT-20-LTLFireability-09
FORMULA_NAME BusinessProcesses-PT-20-LTLFireability-10
FORMULA_NAME BusinessProcesses-PT-20-LTLFireability-11
FORMULA_NAME BusinessProcesses-PT-20-LTLFireability-12
FORMULA_NAME BusinessProcesses-PT-20-LTLFireability-13
FORMULA_NAME BusinessProcesses-PT-20-LTLFireability-14
FORMULA_NAME BusinessProcesses-PT-20-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678503841726

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=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-20
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-11 03:04:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-11 03:04:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 03:04:03] [INFO ] Load time of PNML (sax parser for PT used): 64 ms
[2023-03-11 03:04:03] [INFO ] Transformed 782 places.
[2023-03-11 03:04:03] [INFO ] Transformed 697 transitions.
[2023-03-11 03:04:03] [INFO ] Found NUPN structural information;
[2023-03-11 03:04:03] [INFO ] Parsed PT model containing 782 places and 697 transitions and 2011 arcs in 125 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 6 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 63 places in 11 ms
Reduce places removed 63 places and 59 transitions.
FORMULA BusinessProcesses-PT-20-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-20-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-20-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 35 out of 719 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 719/719 places, 638/638 transitions.
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 705 transition count 638
Discarding 103 places :
Symmetric choice reduction at 1 with 103 rule applications. Total rules 117 place count 602 transition count 535
Iterating global reduction 1 with 103 rules applied. Total rules applied 220 place count 602 transition count 535
Discarding 53 places :
Symmetric choice reduction at 1 with 53 rule applications. Total rules 273 place count 549 transition count 482
Iterating global reduction 1 with 53 rules applied. Total rules applied 326 place count 549 transition count 482
Applied a total of 326 rules in 116 ms. Remains 549 /719 variables (removed 170) and now considering 482/638 (removed 156) transitions.
// Phase 1: matrix 482 rows 549 cols
[2023-03-11 03:04:03] [INFO ] Computed 107 place invariants in 24 ms
[2023-03-11 03:04:04] [INFO ] Implicit Places using invariants in 317 ms returned []
[2023-03-11 03:04:04] [INFO ] Invariant cache hit.
[2023-03-11 03:04:04] [INFO ] Implicit Places using invariants and state equation in 415 ms returned []
Implicit Place search using SMT with State Equation took 755 ms to find 0 implicit places.
[2023-03-11 03:04:04] [INFO ] Invariant cache hit.
[2023-03-11 03:04:04] [INFO ] Dead Transitions using invariants and state equation in 310 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 549/719 places, 482/638 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1183 ms. Remains : 549/719 places, 482/638 transitions.
Support contains 35 out of 549 places after structural reductions.
[2023-03-11 03:04:05] [INFO ] Flatten gal took : 67 ms
[2023-03-11 03:04:05] [INFO ] Flatten gal took : 30 ms
[2023-03-11 03:04:05] [INFO ] Input system was already deterministic with 482 transitions.
Incomplete random walk after 10000 steps, including 49 resets, run finished after 463 ms. (steps per millisecond=21 ) properties (out of 27) seen :15
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 10 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 12) seen :2
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 9) seen :2
Running SMT prover for 7 properties.
[2023-03-11 03:04:06] [INFO ] Invariant cache hit.
[2023-03-11 03:04:06] [INFO ] [Real]Absence check using 64 positive place invariants in 20 ms returned sat
[2023-03-11 03:04:06] [INFO ] [Real]Absence check using 64 positive and 43 generalized place invariants in 12 ms returned sat
[2023-03-11 03:04:06] [INFO ] After 216ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:6
[2023-03-11 03:04:06] [INFO ] Deduced a trap composed of 99 places in 144 ms of which 5 ms to minimize.
[2023-03-11 03:04:07] [INFO ] Deduced a trap composed of 92 places in 142 ms of which 1 ms to minimize.
[2023-03-11 03:04:07] [INFO ] Deduced a trap composed of 97 places in 124 ms of which 1 ms to minimize.
[2023-03-11 03:04:07] [INFO ] Deduced a trap composed of 98 places in 143 ms of which 2 ms to minimize.
[2023-03-11 03:04:07] [INFO ] Deduced a trap composed of 99 places in 160 ms of which 1 ms to minimize.
[2023-03-11 03:04:07] [INFO ] Deduced a trap composed of 32 places in 162 ms of which 1 ms to minimize.
[2023-03-11 03:04:07] [INFO ] Deduced a trap composed of 97 places in 144 ms of which 1 ms to minimize.
[2023-03-11 03:04:08] [INFO ] Deduced a trap composed of 94 places in 175 ms of which 1 ms to minimize.
[2023-03-11 03:04:08] [INFO ] Deduced a trap composed of 94 places in 140 ms of which 1 ms to minimize.
[2023-03-11 03:04:08] [INFO ] Deduced a trap composed of 98 places in 133 ms of which 1 ms to minimize.
[2023-03-11 03:04:08] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 1 ms to minimize.
[2023-03-11 03:04:08] [INFO ] Deduced a trap composed of 33 places in 47 ms of which 1 ms to minimize.
[2023-03-11 03:04:08] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 0 ms to minimize.
[2023-03-11 03:04:08] [INFO ] Deduced a trap composed of 37 places in 38 ms of which 0 ms to minimize.
[2023-03-11 03:04:08] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 2092 ms
[2023-03-11 03:04:08] [INFO ] After 2337ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-11 03:04:08] [INFO ] After 2587ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-11 03:04:09] [INFO ] [Nat]Absence check using 64 positive place invariants in 21 ms returned sat
[2023-03-11 03:04:09] [INFO ] [Nat]Absence check using 64 positive and 43 generalized place invariants in 13 ms returned sat
[2023-03-11 03:04:09] [INFO ] After 275ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :6
[2023-03-11 03:04:09] [INFO ] Deduced a trap composed of 33 places in 166 ms of which 0 ms to minimize.
[2023-03-11 03:04:09] [INFO ] Deduced a trap composed of 100 places in 119 ms of which 0 ms to minimize.
[2023-03-11 03:04:09] [INFO ] Deduced a trap composed of 91 places in 147 ms of which 1 ms to minimize.
[2023-03-11 03:04:09] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 0 ms to minimize.
[2023-03-11 03:04:10] [INFO ] Deduced a trap composed of 96 places in 104 ms of which 0 ms to minimize.
[2023-03-11 03:04:10] [INFO ] Deduced a trap composed of 29 places in 49 ms of which 0 ms to minimize.
[2023-03-11 03:04:10] [INFO ] Deduced a trap composed of 41 places in 50 ms of which 1 ms to minimize.
[2023-03-11 03:04:10] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 0 ms to minimize.
[2023-03-11 03:04:10] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 0 ms to minimize.
[2023-03-11 03:04:10] [INFO ] Deduced a trap composed of 37 places in 42 ms of which 0 ms to minimize.
[2023-03-11 03:04:10] [INFO ] Deduced a trap composed of 39 places in 46 ms of which 0 ms to minimize.
[2023-03-11 03:04:10] [INFO ] Deduced a trap composed of 33 places in 43 ms of which 0 ms to minimize.
[2023-03-11 03:04:10] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1193 ms
[2023-03-11 03:04:10] [INFO ] Deduced a trap composed of 104 places in 110 ms of which 0 ms to minimize.
[2023-03-11 03:04:10] [INFO ] Deduced a trap composed of 94 places in 109 ms of which 1 ms to minimize.
[2023-03-11 03:04:10] [INFO ] Deduced a trap composed of 91 places in 103 ms of which 1 ms to minimize.
[2023-03-11 03:04:11] [INFO ] Deduced a trap composed of 97 places in 153 ms of which 0 ms to minimize.
[2023-03-11 03:04:11] [INFO ] Deduced a trap composed of 87 places in 110 ms of which 0 ms to minimize.
[2023-03-11 03:04:11] [INFO ] Deduced a trap composed of 93 places in 127 ms of which 0 ms to minimize.
[2023-03-11 03:04:11] [INFO ] Deduced a trap composed of 90 places in 114 ms of which 1 ms to minimize.
[2023-03-11 03:04:11] [INFO ] Deduced a trap composed of 94 places in 113 ms of which 1 ms to minimize.
[2023-03-11 03:04:11] [INFO ] Deduced a trap composed of 93 places in 103 ms of which 2 ms to minimize.
[2023-03-11 03:04:11] [INFO ] Deduced a trap composed of 102 places in 116 ms of which 1 ms to minimize.
[2023-03-11 03:04:12] [INFO ] Deduced a trap composed of 93 places in 109 ms of which 0 ms to minimize.
[2023-03-11 03:04:12] [INFO ] Deduced a trap composed of 96 places in 146 ms of which 0 ms to minimize.
[2023-03-11 03:04:12] [INFO ] Deduced a trap composed of 90 places in 123 ms of which 0 ms to minimize.
[2023-03-11 03:04:12] [INFO ] Deduced a trap composed of 96 places in 106 ms of which 13 ms to minimize.
[2023-03-11 03:04:12] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 1957 ms
[2023-03-11 03:04:12] [INFO ] Deduced a trap composed of 96 places in 117 ms of which 0 ms to minimize.
[2023-03-11 03:04:12] [INFO ] Deduced a trap composed of 89 places in 138 ms of which 0 ms to minimize.
[2023-03-11 03:04:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 303 ms
[2023-03-11 03:04:12] [INFO ] After 3852ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :6
Attempting to minimize the solution found.
Minimization took 116 ms.
[2023-03-11 03:04:13] [INFO ] After 4218ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :6
Fused 7 Parikh solutions to 5 different solutions.
Parikh walk visited 4 properties in 73 ms.
Support contains 2 out of 549 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 549/549 places, 482/482 transitions.
Graph (trivial) has 260 edges and 549 vertex of which 6 / 549 are part of one of the 1 SCC in 4 ms
Free SCC test removed 5 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1222 edges and 544 vertex of which 542 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 0 with 71 rules applied. Total rules applied 73 place count 542 transition count 402
Reduce places removed 71 places and 0 transitions.
Iterating post reduction 1 with 71 rules applied. Total rules applied 144 place count 471 transition count 402
Performed 111 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 111 Pre rules applied. Total rules applied 144 place count 471 transition count 291
Deduced a syphon composed of 111 places in 0 ms
Ensure Unique test removed 22 places
Reduce places removed 133 places and 0 transitions.
Iterating global reduction 2 with 244 rules applied. Total rules applied 388 place count 338 transition count 291
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 394 place count 332 transition count 285
Iterating global reduction 2 with 6 rules applied. Total rules applied 400 place count 332 transition count 285
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 400 place count 332 transition count 284
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 402 place count 331 transition count 284
Performed 142 Post agglomeration using F-continuation condition.Transition count delta: 142
Deduced a syphon composed of 142 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 145 places and 0 transitions.
Iterating global reduction 2 with 287 rules applied. Total rules applied 689 place count 186 transition count 142
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -7
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 693 place count 184 transition count 149
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 695 place count 184 transition count 147
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 697 place count 182 transition count 147
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 698 place count 182 transition count 147
Applied a total of 698 rules in 134 ms. Remains 182 /549 variables (removed 367) and now considering 147/482 (removed 335) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 134 ms. Remains : 182/549 places, 147/482 transitions.
Finished random walk after 297 steps, including 12 resets, run visited all 2 properties in 20 ms. (steps per millisecond=14 )
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
FORMULA BusinessProcesses-PT-20-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 481 stabilizing places and 424 stable transitions
Graph (complete) has 1229 edges and 549 vertex of which 547 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.22 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 2 out of 549 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 549/549 places, 482/482 transitions.
Graph (trivial) has 260 edges and 549 vertex of which 6 / 549 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 1223 edges and 544 vertex of which 542 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 70 rules applied. Total rules applied 72 place count 541 transition count 403
Reduce places removed 70 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 71 rules applied. Total rules applied 143 place count 471 transition count 402
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 144 place count 470 transition count 402
Performed 111 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 111 Pre rules applied. Total rules applied 144 place count 470 transition count 291
Deduced a syphon composed of 111 places in 1 ms
Ensure Unique test removed 22 places
Reduce places removed 133 places and 0 transitions.
Iterating global reduction 3 with 244 rules applied. Total rules applied 388 place count 337 transition count 291
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 395 place count 330 transition count 284
Ensure Unique test removed 1 places
Iterating global reduction 3 with 8 rules applied. Total rules applied 403 place count 329 transition count 284
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 403 place count 329 transition count 283
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 405 place count 328 transition count 283
Performed 140 Post agglomeration using F-continuation condition.Transition count delta: 140
Deduced a syphon composed of 140 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 3 with 283 rules applied. Total rules applied 688 place count 185 transition count 143
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -7
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 692 place count 183 transition count 150
Applied a total of 692 rules in 73 ms. Remains 183 /549 variables (removed 366) and now considering 150/482 (removed 332) transitions.
[2023-03-11 03:04:13] [INFO ] Flow matrix only has 149 transitions (discarded 1 similar events)
// Phase 1: matrix 149 rows 183 cols
[2023-03-11 03:04:13] [INFO ] Computed 81 place invariants in 5 ms
[2023-03-11 03:04:14] [INFO ] Implicit Places using invariants in 822 ms returned [27, 28, 29, 30, 31, 36, 37, 41, 42, 43, 44, 45, 46, 47, 48, 51, 52, 53, 54, 55, 56, 57, 58]
Discarding 23 places :
Implicit Place search using SMT only with invariants took 837 ms to find 23 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 160/549 places, 150/482 transitions.
Applied a total of 0 rules in 10 ms. Remains 160 /160 variables (removed 0) and now considering 150/150 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 921 ms. Remains : 160/549 places, 150/482 transitions.
Stuttering acceptance computed with spot in 218 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-20-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s63 1), p1:(EQ s35 1)], nbAcceptance=2, 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 1 ms.
FORMULA BusinessProcesses-PT-20-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-20-LTLFireability-00 finished in 1199 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(((p0&&F(p1))||(p2&&X(G(p3))))))'
Support contains 6 out of 549 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 549/549 places, 482/482 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 540 transition count 473
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 540 transition count 473
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 538 transition count 471
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 538 transition count 471
Applied a total of 22 rules in 45 ms. Remains 538 /549 variables (removed 11) and now considering 471/482 (removed 11) transitions.
// Phase 1: matrix 471 rows 538 cols
[2023-03-11 03:04:15] [INFO ] Computed 107 place invariants in 8 ms
[2023-03-11 03:04:15] [INFO ] Implicit Places using invariants in 403 ms returned []
[2023-03-11 03:04:15] [INFO ] Invariant cache hit.
[2023-03-11 03:04:15] [INFO ] Implicit Places using invariants and state equation in 426 ms returned []
Implicit Place search using SMT with State Equation took 832 ms to find 0 implicit places.
[2023-03-11 03:04:15] [INFO ] Invariant cache hit.
[2023-03-11 03:04:16] [INFO ] Dead Transitions using invariants and state equation in 259 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 538/549 places, 471/482 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1142 ms. Remains : 538/549 places, 471/482 transitions.
Stuttering acceptance computed with spot in 204 ms :[true, (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (NOT p3), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : BusinessProcesses-PT-20-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 4}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=3 dest: 5}], [{ cond=(NOT p3), acceptance={} source=4 dest: 0}, { cond=p3, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p1) p3), acceptance={} source=5 dest: 5}]], initial=2, aps=[p1:(AND (EQ s84 1) (EQ s338 1) (EQ s523 1)), p0:(EQ s64 1), p2:(EQ s277 0), p3:(EQ s102 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, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-20-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-20-LTLFireability-02 finished in 1387 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||X(G((p1&&F(G(p2))))))))'
Support contains 2 out of 549 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 549/549 places, 482/482 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 540 transition count 473
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 540 transition count 473
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 538 transition count 471
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 538 transition count 471
Applied a total of 22 rules in 34 ms. Remains 538 /549 variables (removed 11) and now considering 471/482 (removed 11) transitions.
[2023-03-11 03:04:16] [INFO ] Invariant cache hit.
[2023-03-11 03:04:16] [INFO ] Implicit Places using invariants in 163 ms returned []
[2023-03-11 03:04:16] [INFO ] Invariant cache hit.
[2023-03-11 03:04:16] [INFO ] Implicit Places using invariants and state equation in 420 ms returned []
Implicit Place search using SMT with State Equation took 585 ms to find 0 implicit places.
[2023-03-11 03:04:16] [INFO ] Invariant cache hit.
[2023-03-11 03:04:17] [INFO ] Dead Transitions using invariants and state equation in 280 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 538/549 places, 471/482 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 901 ms. Remains : 538/549 places, 471/482 transitions.
Stuttering acceptance computed with spot in 106 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), true, (NOT p2)]
Running random walk in product with property : BusinessProcesses-PT-20-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p2, acceptance={} source=3 dest: 3}, { cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s287 1), p1:(EQ s203 0), p2:(EQ s203 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 176 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-20-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-20-LTLFireability-03 finished in 1023 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||X(F(p1)))))'
Support contains 1 out of 549 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 549/549 places, 482/482 transitions.
Graph (trivial) has 261 edges and 549 vertex of which 6 / 549 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 1223 edges and 544 vertex of which 542 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 0 with 71 rules applied. Total rules applied 73 place count 541 transition count 402
Reduce places removed 71 places and 0 transitions.
Iterating post reduction 1 with 71 rules applied. Total rules applied 144 place count 470 transition count 402
Performed 112 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 112 Pre rules applied. Total rules applied 144 place count 470 transition count 290
Deduced a syphon composed of 112 places in 0 ms
Ensure Unique test removed 22 places
Reduce places removed 134 places and 0 transitions.
Iterating global reduction 2 with 246 rules applied. Total rules applied 390 place count 336 transition count 290
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 397 place count 329 transition count 283
Ensure Unique test removed 1 places
Iterating global reduction 2 with 8 rules applied. Total rules applied 405 place count 328 transition count 283
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 405 place count 328 transition count 282
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 407 place count 327 transition count 282
Performed 140 Post agglomeration using F-continuation condition.Transition count delta: 140
Deduced a syphon composed of 140 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 2 with 283 rules applied. Total rules applied 690 place count 184 transition count 142
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -7
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 694 place count 182 transition count 149
Applied a total of 694 rules in 45 ms. Remains 182 /549 variables (removed 367) and now considering 149/482 (removed 333) transitions.
[2023-03-11 03:04:17] [INFO ] Flow matrix only has 148 transitions (discarded 1 similar events)
// Phase 1: matrix 148 rows 182 cols
[2023-03-11 03:04:17] [INFO ] Computed 81 place invariants in 2 ms
[2023-03-11 03:04:17] [INFO ] Implicit Places using invariants in 244 ms returned [29, 30, 31, 32, 33, 38, 39, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59]
Discarding 24 places :
Implicit Place search using SMT only with invariants took 245 ms to find 24 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 158/549 places, 149/482 transitions.
Applied a total of 0 rules in 6 ms. Remains 158 /158 variables (removed 0) and now considering 149/149 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 296 ms. Remains : 158/549 places, 149/482 transitions.
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-20-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s6 0), p1:(EQ s6 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 28577 steps with 4534 reset in 105 ms.
FORMULA BusinessProcesses-PT-20-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-20-LTLFireability-04 finished in 497 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((X(X(p0))&&G(p1))))'
Support contains 2 out of 549 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 549/549 places, 482/482 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 542 transition count 475
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 542 transition count 475
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 541 transition count 474
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 541 transition count 474
Applied a total of 16 rules in 33 ms. Remains 541 /549 variables (removed 8) and now considering 474/482 (removed 8) transitions.
// Phase 1: matrix 474 rows 541 cols
[2023-03-11 03:04:17] [INFO ] Computed 107 place invariants in 4 ms
[2023-03-11 03:04:18] [INFO ] Implicit Places using invariants in 149 ms returned []
[2023-03-11 03:04:18] [INFO ] Invariant cache hit.
[2023-03-11 03:04:18] [INFO ] Implicit Places using invariants and state equation in 408 ms returned []
Implicit Place search using SMT with State Equation took 563 ms to find 0 implicit places.
[2023-03-11 03:04:18] [INFO ] Invariant cache hit.
[2023-03-11 03:04:18] [INFO ] Dead Transitions using invariants and state equation in 198 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 541/549 places, 474/482 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 807 ms. Remains : 541/549 places, 474/482 transitions.
Stuttering acceptance computed with spot in 250 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-20-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=p1, acceptance={0} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 3}, { cond=p1, acceptance={0} source=1 dest: 4}, { cond=p1, acceptance={} source=1 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=3 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={0} source=4 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=5 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=5 dest: 2}]], initial=0, aps=[p1:(NEQ s464 1), p0:(EQ s166 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 505 reset in 264 ms.
Product exploration explored 100000 steps with 504 reset in 278 ms.
Computed a total of 473 stabilizing places and 416 stable transitions
Graph (complete) has 1213 edges and 541 vertex of which 539 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.7 ms
Computed a total of 473 stabilizing places and 416 stable transitions
Detected a total of 473/541 stabilizing places and 416/474 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 328 ms. Reduced automaton from 6 states, 16 edges and 2 AP (stutter sensitive) to 6 states, 16 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 171 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 50 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 518225 steps, run timeout after 3001 ms. (steps per millisecond=172 ) properties seen :{}
Probabilistic random walk after 518225 steps, saw 87173 distinct states, run finished after 3002 ms. (steps per millisecond=172 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-11 03:04:23] [INFO ] Invariant cache hit.
[2023-03-11 03:04:23] [INFO ] [Real]Absence check using 64 positive place invariants in 23 ms returned sat
[2023-03-11 03:04:23] [INFO ] [Real]Absence check using 64 positive and 43 generalized place invariants in 14 ms returned sat
[2023-03-11 03:04:23] [INFO ] After 245ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3
[2023-03-11 03:04:23] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 1 ms to minimize.
[2023-03-11 03:04:23] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 0 ms to minimize.
[2023-03-11 03:04:23] [INFO ] Deduced a trap composed of 22 places in 91 ms of which 1 ms to minimize.
[2023-03-11 03:04:23] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 0 ms to minimize.
[2023-03-11 03:04:24] [INFO ] Deduced a trap composed of 32 places in 64 ms of which 0 ms to minimize.
[2023-03-11 03:04:24] [INFO ] Deduced a trap composed of 29 places in 56 ms of which 1 ms to minimize.
[2023-03-11 03:04:24] [INFO ] Deduced a trap composed of 38 places in 71 ms of which 0 ms to minimize.
[2023-03-11 03:04:24] [INFO ] Deduced a trap composed of 37 places in 47 ms of which 1 ms to minimize.
[2023-03-11 03:04:24] [INFO ] Deduced a trap composed of 39 places in 50 ms of which 1 ms to minimize.
[2023-03-11 03:04:24] [INFO ] Deduced a trap composed of 28 places in 74 ms of which 1 ms to minimize.
[2023-03-11 03:04:24] [INFO ] Deduced a trap composed of 37 places in 50 ms of which 0 ms to minimize.
[2023-03-11 03:04:24] [INFO ] Deduced a trap composed of 31 places in 49 ms of which 0 ms to minimize.
[2023-03-11 03:04:24] [INFO ] Deduced a trap composed of 42 places in 72 ms of which 12 ms to minimize.
[2023-03-11 03:04:24] [INFO ] Deduced a trap composed of 25 places in 73 ms of which 0 ms to minimize.
[2023-03-11 03:04:24] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 1275 ms
[2023-03-11 03:04:25] [INFO ] After 1633ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 03:04:25] [INFO ] After 1805ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 03:04:25] [INFO ] [Nat]Absence check using 64 positive place invariants in 15 ms returned sat
[2023-03-11 03:04:25] [INFO ] [Nat]Absence check using 64 positive and 43 generalized place invariants in 9 ms returned sat
[2023-03-11 03:04:25] [INFO ] After 159ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-11 03:04:25] [INFO ] Deduced a trap composed of 93 places in 90 ms of which 1 ms to minimize.
[2023-03-11 03:04:25] [INFO ] Deduced a trap composed of 94 places in 127 ms of which 0 ms to minimize.
[2023-03-11 03:04:25] [INFO ] Deduced a trap composed of 11 places in 127 ms of which 1 ms to minimize.
[2023-03-11 03:04:25] [INFO ] Deduced a trap composed of 11 places in 143 ms of which 0 ms to minimize.
[2023-03-11 03:04:26] [INFO ] Deduced a trap composed of 89 places in 114 ms of which 0 ms to minimize.
[2023-03-11 03:04:26] [INFO ] Deduced a trap composed of 88 places in 113 ms of which 1 ms to minimize.
[2023-03-11 03:04:26] [INFO ] Deduced a trap composed of 89 places in 113 ms of which 1 ms to minimize.
[2023-03-11 03:04:26] [INFO ] Deduced a trap composed of 89 places in 114 ms of which 1 ms to minimize.
[2023-03-11 03:04:26] [INFO ] Deduced a trap composed of 89 places in 113 ms of which 2 ms to minimize.
[2023-03-11 03:04:26] [INFO ] Deduced a trap composed of 91 places in 104 ms of which 1 ms to minimize.
[2023-03-11 03:04:26] [INFO ] Deduced a trap composed of 92 places in 109 ms of which 2 ms to minimize.
[2023-03-11 03:04:26] [INFO ] Deduced a trap composed of 93 places in 100 ms of which 0 ms to minimize.
[2023-03-11 03:04:27] [INFO ] Deduced a trap composed of 93 places in 111 ms of which 1 ms to minimize.
[2023-03-11 03:04:27] [INFO ] Deduced a trap composed of 24 places in 102 ms of which 0 ms to minimize.
[2023-03-11 03:04:27] [INFO ] Deduced a trap composed of 34 places in 102 ms of which 1 ms to minimize.
[2023-03-11 03:04:27] [INFO ] Deduced a trap composed of 22 places in 110 ms of which 1 ms to minimize.
[2023-03-11 03:04:27] [INFO ] Deduced a trap composed of 104 places in 105 ms of which 0 ms to minimize.
[2023-03-11 03:04:27] [INFO ] Deduced a trap composed of 101 places in 98 ms of which 0 ms to minimize.
[2023-03-11 03:04:27] [INFO ] Deduced a trap composed of 106 places in 109 ms of which 1 ms to minimize.
[2023-03-11 03:04:27] [INFO ] Deduced a trap composed of 90 places in 89 ms of which 0 ms to minimize.
[2023-03-11 03:04:28] [INFO ] Deduced a trap composed of 90 places in 87 ms of which 0 ms to minimize.
[2023-03-11 03:04:28] [INFO ] Deduced a trap composed of 90 places in 88 ms of which 0 ms to minimize.
[2023-03-11 03:04:28] [INFO ] Deduced a trap composed of 97 places in 127 ms of which 1 ms to minimize.
[2023-03-11 03:04:28] [INFO ] Deduced a trap composed of 100 places in 121 ms of which 13 ms to minimize.
[2023-03-11 03:04:28] [INFO ] Deduced a trap composed of 101 places in 181 ms of which 1 ms to minimize.
[2023-03-11 03:04:28] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 0 ms to minimize.
[2023-03-11 03:04:28] [INFO ] Deduced a trap composed of 31 places in 42 ms of which 0 ms to minimize.
[2023-03-11 03:04:28] [INFO ] Deduced a trap composed of 30 places in 28 ms of which 1 ms to minimize.
[2023-03-11 03:04:28] [INFO ] Deduced a trap composed of 40 places in 39 ms of which 0 ms to minimize.
[2023-03-11 03:04:28] [INFO ] Deduced a trap composed of 38 places in 39 ms of which 1 ms to minimize.
[2023-03-11 03:04:29] [INFO ] Deduced a trap composed of 40 places in 40 ms of which 0 ms to minimize.
[2023-03-11 03:04:29] [INFO ] Trap strengthening (SAT) tested/added 32/31 trap constraints in 3707 ms
[2023-03-11 03:04:29] [INFO ] Deduced a trap composed of 54 places in 34 ms of which 0 ms to minimize.
[2023-03-11 03:04:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 63 ms
[2023-03-11 03:04:29] [INFO ] After 3979ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 39 ms.
[2023-03-11 03:04:29] [INFO ] After 4179ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 563 steps, including 1 resets, run visited all 3 properties in 11 ms. (steps per millisecond=51 )
Parikh walk visited 3 properties in 11 ms.
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND p1 (NOT p0)))), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 7 factoid took 300 ms. Reduced automaton from 6 states, 16 edges and 2 AP (stutter sensitive) to 6 states, 16 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 141 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
[2023-03-11 03:04:29] [INFO ] Invariant cache hit.
[2023-03-11 03:04:29] [INFO ] [Real]Absence check using 64 positive place invariants in 22 ms returned sat
[2023-03-11 03:04:29] [INFO ] [Real]Absence check using 64 positive and 43 generalized place invariants in 3 ms returned unsat
Proved EG (NOT p0)
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND p1 (NOT p0)))), (F (AND (NOT p1) (NOT p0))), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 7 factoid took 129 ms. Reduced automaton from 6 states, 16 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-20-LTLFireability-05 FALSE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-20-LTLFireability-05 finished in 12285 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)||F(p1)))'
Support contains 2 out of 549 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 549/549 places, 482/482 transitions.
Graph (trivial) has 261 edges and 549 vertex of which 6 / 549 are part of one of the 1 SCC in 4 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1223 edges and 544 vertex of which 542 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 72 rules applied. Total rules applied 74 place count 541 transition count 401
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 146 place count 469 transition count 401
Performed 112 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 112 Pre rules applied. Total rules applied 146 place count 469 transition count 289
Deduced a syphon composed of 112 places in 0 ms
Ensure Unique test removed 22 places
Reduce places removed 134 places and 0 transitions.
Iterating global reduction 2 with 246 rules applied. Total rules applied 392 place count 335 transition count 289
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 398 place count 329 transition count 283
Ensure Unique test removed 1 places
Iterating global reduction 2 with 7 rules applied. Total rules applied 405 place count 328 transition count 283
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 405 place count 328 transition count 282
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 407 place count 327 transition count 282
Performed 140 Post agglomeration using F-continuation condition.Transition count delta: 140
Deduced a syphon composed of 140 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 2 with 283 rules applied. Total rules applied 690 place count 184 transition count 142
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -7
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 694 place count 182 transition count 149
Applied a total of 694 rules in 46 ms. Remains 182 /549 variables (removed 367) and now considering 149/482 (removed 333) transitions.
[2023-03-11 03:04:30] [INFO ] Flow matrix only has 148 transitions (discarded 1 similar events)
// Phase 1: matrix 148 rows 182 cols
[2023-03-11 03:04:30] [INFO ] Computed 81 place invariants in 1 ms
[2023-03-11 03:04:30] [INFO ] Implicit Places using invariants in 109 ms returned [27, 28, 29, 30, 31, 36, 37, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57]
Discarding 24 places :
Implicit Place search using SMT only with invariants took 122 ms to find 24 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 158/549 places, 149/482 transitions.
Applied a total of 0 rules in 5 ms. Remains 158 /158 variables (removed 0) and now considering 149/149 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 173 ms. Remains : 158/549 places, 149/482 transitions.
Stuttering acceptance computed with spot in 58 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-20-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}]], initial=1, aps=[p1:(EQ s107 1), p0:(EQ s133 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-20-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-20-LTLFireability-07 finished in 242 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 549 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 549/549 places, 482/482 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 541 transition count 474
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 541 transition count 474
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 539 transition count 472
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 539 transition count 472
Applied a total of 20 rules in 32 ms. Remains 539 /549 variables (removed 10) and now considering 472/482 (removed 10) transitions.
// Phase 1: matrix 472 rows 539 cols
[2023-03-11 03:04:30] [INFO ] Computed 107 place invariants in 3 ms
[2023-03-11 03:04:30] [INFO ] Implicit Places using invariants in 189 ms returned []
[2023-03-11 03:04:30] [INFO ] Invariant cache hit.
[2023-03-11 03:04:31] [INFO ] Implicit Places using invariants and state equation in 478 ms returned []
Implicit Place search using SMT with State Equation took 682 ms to find 0 implicit places.
[2023-03-11 03:04:31] [INFO ] Invariant cache hit.
[2023-03-11 03:04:31] [INFO ] Dead Transitions using invariants and state equation in 338 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 539/549 places, 472/482 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1054 ms. Remains : 539/549 places, 472/482 transitions.
Stuttering acceptance computed with spot in 52 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-20-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s480 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 40835 steps with 207 reset in 84 ms.
FORMULA BusinessProcesses-PT-20-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-20-LTLFireability-08 finished in 1204 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(F(p0))&&(p1||X(p2)))))'
Support contains 6 out of 549 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 549/549 places, 482/482 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 540 transition count 473
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 540 transition count 473
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 538 transition count 471
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 538 transition count 471
Applied a total of 22 rules in 40 ms. Remains 538 /549 variables (removed 11) and now considering 471/482 (removed 11) transitions.
// Phase 1: matrix 471 rows 538 cols
[2023-03-11 03:04:31] [INFO ] Computed 107 place invariants in 3 ms
[2023-03-11 03:04:31] [INFO ] Implicit Places using invariants in 181 ms returned []
[2023-03-11 03:04:31] [INFO ] Invariant cache hit.
[2023-03-11 03:04:32] [INFO ] Implicit Places using invariants and state equation in 434 ms returned []
Implicit Place search using SMT with State Equation took 636 ms to find 0 implicit places.
[2023-03-11 03:04:32] [INFO ] Invariant cache hit.
[2023-03-11 03:04:32] [INFO ] Dead Transitions using invariants and state equation in 219 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 538/549 places, 471/482 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 908 ms. Remains : 538/549 places, 471/482 transitions.
Stuttering acceptance computed with spot in 122 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true]
Running random walk in product with property : BusinessProcesses-PT-20-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p2), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p0:(AND (EQ s189 1) (EQ s345 1) (EQ s503 1)), p2:(AND (EQ s225 1) (EQ s425 1) (EQ s503 1)), p1:(EQ s29 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]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-20-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-20-LTLFireability-10 finished in 1063 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((p0&&X(X(X(p1)))))||G(p2))))'
Support contains 6 out of 549 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 549/549 places, 482/482 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 541 transition count 474
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 541 transition count 474
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 539 transition count 472
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 539 transition count 472
Applied a total of 20 rules in 29 ms. Remains 539 /549 variables (removed 10) and now considering 472/482 (removed 10) transitions.
// Phase 1: matrix 472 rows 539 cols
[2023-03-11 03:04:32] [INFO ] Computed 107 place invariants in 4 ms
[2023-03-11 03:04:32] [INFO ] Implicit Places using invariants in 167 ms returned []
[2023-03-11 03:04:32] [INFO ] Invariant cache hit.
[2023-03-11 03:04:33] [INFO ] Implicit Places using invariants and state equation in 412 ms returned []
Implicit Place search using SMT with State Equation took 595 ms to find 0 implicit places.
[2023-03-11 03:04:33] [INFO ] Invariant cache hit.
[2023-03-11 03:04:33] [INFO ] Dead Transitions using invariants and state equation in 203 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 539/549 places, 472/482 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 840 ms. Remains : 539/549 places, 472/482 transitions.
Stuttering acceptance computed with spot in 290 ms :[(NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), true, (OR (NOT p0) (NOT p1)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p2)]
Running random walk in product with property : BusinessProcesses-PT-20-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 8}], [{ cond=true, acceptance={} source=1 dest: 10}], [{ cond=(NOT p2), acceptance={} source=2 dest: 0}, { cond=p2, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 8}, { cond=(AND p2 (NOT p1)), acceptance={} source=3 dest: 11}], [{ cond=true, acceptance={} source=4 dest: 0}], [{ cond=p2, acceptance={} source=5 dest: 2}, { cond=(NOT p2), acceptance={} source=5 dest: 4}], [{ cond=true, acceptance={} source=6 dest: 4}], [{ cond=(AND p2 p0), acceptance={} source=7 dest: 5}, { cond=(AND (NOT p2) p0), acceptance={} source=7 dest: 6}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=7 dest: 8}, { cond=(AND p2 (NOT p0)), acceptance={} source=7 dest: 11}], [{ cond=true, acceptance={0} source=8 dest: 8}], [{ cond=p0, acceptance={} source=9 dest: 6}, { cond=(NOT p0), acceptance={} source=9 dest: 8}], [{ cond=p2, acceptance={} source=10 dest: 7}, { cond=(NOT p2), acceptance={} source=10 dest: 9}], [{ cond=(NOT p2), acceptance={} source=11 dest: 8}, { cond=p2, acceptance={} source=11 dest: 11}]], initial=1, aps=[p1:(EQ s467 1), p2:(EQ s395 1), p0:(OR (EQ s225 0) (EQ s425 0) (EQ s504 0) (EQ s18 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-20-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-20-LTLFireability-11 finished in 1145 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 549 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 549/549 places, 482/482 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 540 transition count 473
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 540 transition count 473
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 538 transition count 471
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 538 transition count 471
Applied a total of 22 rules in 46 ms. Remains 538 /549 variables (removed 11) and now considering 471/482 (removed 11) transitions.
// Phase 1: matrix 471 rows 538 cols
[2023-03-11 03:04:33] [INFO ] Computed 107 place invariants in 7 ms
[2023-03-11 03:04:34] [INFO ] Implicit Places using invariants in 214 ms returned []
[2023-03-11 03:04:34] [INFO ] Invariant cache hit.
[2023-03-11 03:04:34] [INFO ] Implicit Places using invariants and state equation in 427 ms returned []
Implicit Place search using SMT with State Equation took 643 ms to find 0 implicit places.
[2023-03-11 03:04:34] [INFO ] Invariant cache hit.
[2023-03-11 03:04:34] [INFO ] Dead Transitions using invariants and state equation in 291 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 538/549 places, 471/482 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 994 ms. Remains : 538/549 places, 471/482 transitions.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-20-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s491 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 181 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-20-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-20-LTLFireability-12 finished in 1070 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(G((X(X(!F(p0))) U p0)))))'
Support contains 2 out of 549 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 549/549 places, 482/482 transitions.
Graph (trivial) has 261 edges and 549 vertex of which 6 / 549 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 1223 edges and 544 vertex of which 542 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 72 rules applied. Total rules applied 74 place count 541 transition count 401
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 146 place count 469 transition count 401
Performed 112 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 112 Pre rules applied. Total rules applied 146 place count 469 transition count 289
Deduced a syphon composed of 112 places in 1 ms
Ensure Unique test removed 22 places
Reduce places removed 134 places and 0 transitions.
Iterating global reduction 2 with 246 rules applied. Total rules applied 392 place count 335 transition count 289
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 400 place count 327 transition count 281
Ensure Unique test removed 1 places
Iterating global reduction 2 with 9 rules applied. Total rules applied 409 place count 326 transition count 281
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 409 place count 326 transition count 280
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 411 place count 325 transition count 280
Performed 140 Post agglomeration using F-continuation condition.Transition count delta: 140
Deduced a syphon composed of 140 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 2 with 283 rules applied. Total rules applied 694 place count 182 transition count 140
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 696 place count 181 transition count 143
Applied a total of 696 rules in 55 ms. Remains 181 /549 variables (removed 368) and now considering 143/482 (removed 339) transitions.
// Phase 1: matrix 143 rows 181 cols
[2023-03-11 03:04:34] [INFO ] Computed 81 place invariants in 2 ms
[2023-03-11 03:04:35] [INFO ] Implicit Places using invariants in 134 ms returned [28, 29, 30, 31, 32, 37, 38, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58]
Discarding 24 places :
Implicit Place search using SMT only with invariants took 149 ms to find 24 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 157/549 places, 143/482 transitions.
Applied a total of 0 rules in 4 ms. Remains 157 /157 variables (removed 0) and now considering 143/143 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 208 ms. Remains : 157/549 places, 143/482 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-20-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s3 1) (EQ s107 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-20-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-20-LTLFireability-13 finished in 258 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||X(F(p0))))||((!p0||X(F(p0)))&&F(G(p1))))))'
Support contains 4 out of 549 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 549/549 places, 482/482 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 541 transition count 474
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 541 transition count 474
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 539 transition count 472
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 539 transition count 472
Applied a total of 20 rules in 35 ms. Remains 539 /549 variables (removed 10) and now considering 472/482 (removed 10) transitions.
// Phase 1: matrix 472 rows 539 cols
[2023-03-11 03:04:35] [INFO ] Computed 107 place invariants in 4 ms
[2023-03-11 03:04:35] [INFO ] Implicit Places using invariants in 243 ms returned []
[2023-03-11 03:04:35] [INFO ] Invariant cache hit.
[2023-03-11 03:04:35] [INFO ] Implicit Places using invariants and state equation in 502 ms returned []
Implicit Place search using SMT with State Equation took 747 ms to find 0 implicit places.
[2023-03-11 03:04:35] [INFO ] Invariant cache hit.
[2023-03-11 03:04:36] [INFO ] Dead Transitions using invariants and state equation in 209 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 539/549 places, 472/482 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 992 ms. Remains : 539/549 places, 472/482 transitions.
Stuttering acceptance computed with spot in 106 ms :[false, false, (NOT p0), false, (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-20-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s82 1) (EQ s331 1) (EQ s521 1)), p1:(NEQ s51 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 506 reset in 202 ms.
Product exploration explored 100000 steps with 512 reset in 202 ms.
Computed a total of 471 stabilizing places and 414 stable transitions
Graph (complete) has 1212 edges and 539 vertex of which 537 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Computed a total of 471 stabilizing places and 414 stable transitions
Detected a total of 471/539 stabilizing places and 414/472 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), true, (X (X (NOT 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.
Knowledge based reduction with 6 factoid took 276 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 97 ms :[false, false, (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 49 resets, run finished after 199 ms. (steps per millisecond=50 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 678024 steps, run timeout after 3001 ms. (steps per millisecond=225 ) properties seen :{0=1, 1=1}
Probabilistic random walk after 678024 steps, saw 109236 distinct states, run finished after 3001 ms. (steps per millisecond=225 ) properties seen :2
Running SMT prover for 1 properties.
[2023-03-11 03:04:40] [INFO ] Invariant cache hit.
[2023-03-11 03:04:40] [INFO ] [Real]Absence check using 64 positive place invariants in 23 ms returned sat
[2023-03-11 03:04:40] [INFO ] [Real]Absence check using 64 positive and 43 generalized place invariants in 26 ms returned sat
[2023-03-11 03:04:40] [INFO ] After 154ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 03:04:40] [INFO ] [Nat]Absence check using 64 positive place invariants in 19 ms returned sat
[2023-03-11 03:04:40] [INFO ] [Nat]Absence check using 64 positive and 43 generalized place invariants in 15 ms returned sat
[2023-03-11 03:04:40] [INFO ] After 179ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 03:04:41] [INFO ] Deduced a trap composed of 8 places in 57 ms of which 0 ms to minimize.
[2023-03-11 03:04:41] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 1 ms to minimize.
[2023-03-11 03:04:41] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 0 ms to minimize.
[2023-03-11 03:04:41] [INFO ] Deduced a trap composed of 21 places in 80 ms of which 2 ms to minimize.
[2023-03-11 03:04:41] [INFO ] Deduced a trap composed of 20 places in 69 ms of which 0 ms to minimize.
[2023-03-11 03:04:41] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 0 ms to minimize.
[2023-03-11 03:04:41] [INFO ] Deduced a trap composed of 36 places in 62 ms of which 0 ms to minimize.
[2023-03-11 03:04:41] [INFO ] Deduced a trap composed of 43 places in 72 ms of which 0 ms to minimize.
[2023-03-11 03:04:41] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 760 ms
[2023-03-11 03:04:41] [INFO ] After 957ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 34 ms.
[2023-03-11 03:04:41] [INFO ] After 1112ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 4 out of 539 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 539/539 places, 472/472 transitions.
Graph (trivial) has 251 edges and 539 vertex of which 6 / 539 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1205 edges and 534 vertex of which 532 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 67 transitions
Trivial Post-agglo rules discarded 67 transitions
Performed 67 trivial Post agglomeration. Transition count delta: 67
Iterating post reduction 0 with 67 rules applied. Total rules applied 69 place count 532 transition count 396
Reduce places removed 67 places and 0 transitions.
Iterating post reduction 1 with 67 rules applied. Total rules applied 136 place count 465 transition count 396
Performed 111 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 111 Pre rules applied. Total rules applied 136 place count 465 transition count 285
Deduced a syphon composed of 111 places in 0 ms
Ensure Unique test removed 22 places
Reduce places removed 133 places and 0 transitions.
Iterating global reduction 2 with 244 rules applied. Total rules applied 380 place count 332 transition count 285
Performed 142 Post agglomeration using F-continuation condition.Transition count delta: 142
Deduced a syphon composed of 142 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 146 places and 0 transitions.
Iterating global reduction 2 with 288 rules applied. Total rules applied 668 place count 186 transition count 143
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -7
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 672 place count 184 transition count 150
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 674 place count 184 transition count 148
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 676 place count 182 transition count 148
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 677 place count 182 transition count 148
Applied a total of 677 rules in 37 ms. Remains 182 /539 variables (removed 357) and now considering 148/472 (removed 324) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 182/539 places, 148/472 transitions.
Incomplete random walk after 10000 steps, including 499 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 172 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1026874 steps, run timeout after 3001 ms. (steps per millisecond=342 ) properties seen :{}
Probabilistic random walk after 1026874 steps, saw 302706 distinct states, run finished after 3001 ms. (steps per millisecond=342 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-11 03:04:44] [INFO ] Flow matrix only has 147 transitions (discarded 1 similar events)
// Phase 1: matrix 147 rows 182 cols
[2023-03-11 03:04:44] [INFO ] Computed 81 place invariants in 4 ms
[2023-03-11 03:04:44] [INFO ] [Real]Absence check using 64 positive place invariants in 12 ms returned sat
[2023-03-11 03:04:44] [INFO ] [Real]Absence check using 64 positive and 17 generalized place invariants in 5 ms returned sat
[2023-03-11 03:04:45] [INFO ] After 81ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 03:04:45] [INFO ] [Nat]Absence check using 64 positive place invariants in 9 ms returned sat
[2023-03-11 03:04:45] [INFO ] [Nat]Absence check using 64 positive and 17 generalized place invariants in 4 ms returned sat
[2023-03-11 03:04:45] [INFO ] After 61ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 03:04:45] [INFO ] State equation strengthened by 15 read => feed constraints.
[2023-03-11 03:04:45] [INFO ] After 13ms SMT Verify possible using 15 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 03:04:45] [INFO ] After 36ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-11 03:04:45] [INFO ] After 163ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 19 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=19 )
Parikh walk visited 1 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), true, (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p0), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 6 factoid took 257 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 100 ms :[false, false, (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 98 ms :[false, false, (AND (NOT p0) (NOT p1))]
Support contains 4 out of 539 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 539/539 places, 472/472 transitions.
Applied a total of 0 rules in 14 ms. Remains 539 /539 variables (removed 0) and now considering 472/472 (removed 0) transitions.
// Phase 1: matrix 472 rows 539 cols
[2023-03-11 03:04:45] [INFO ] Computed 107 place invariants in 4 ms
[2023-03-11 03:04:45] [INFO ] Implicit Places using invariants in 232 ms returned []
[2023-03-11 03:04:45] [INFO ] Invariant cache hit.
[2023-03-11 03:04:46] [INFO ] Implicit Places using invariants and state equation in 523 ms returned []
Implicit Place search using SMT with State Equation took 757 ms to find 0 implicit places.
[2023-03-11 03:04:46] [INFO ] Invariant cache hit.
[2023-03-11 03:04:46] [INFO ] Dead Transitions using invariants and state equation in 251 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1037 ms. Remains : 539/539 places, 472/472 transitions.
Computed a total of 471 stabilizing places and 414 stable transitions
Graph (complete) has 1212 edges and 539 vertex of which 537 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Computed a total of 471 stabilizing places and 414 stable transitions
Detected a total of 471/539 stabilizing places and 414/472 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 320 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 105 ms :[false, false, (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 50 resets, run finished after 173 ms. (steps per millisecond=57 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 631299 steps, run timeout after 3001 ms. (steps per millisecond=210 ) properties seen :{0=1, 1=1}
Probabilistic random walk after 631299 steps, saw 102684 distinct states, run finished after 3001 ms. (steps per millisecond=210 ) properties seen :2
Running SMT prover for 1 properties.
[2023-03-11 03:04:50] [INFO ] Invariant cache hit.
[2023-03-11 03:04:50] [INFO ] [Real]Absence check using 64 positive place invariants in 24 ms returned sat
[2023-03-11 03:04:50] [INFO ] [Real]Absence check using 64 positive and 43 generalized place invariants in 19 ms returned sat
[2023-03-11 03:04:50] [INFO ] After 140ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 03:04:50] [INFO ] [Nat]Absence check using 64 positive place invariants in 14 ms returned sat
[2023-03-11 03:04:50] [INFO ] [Nat]Absence check using 64 positive and 43 generalized place invariants in 11 ms returned sat
[2023-03-11 03:04:50] [INFO ] After 157ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 03:04:50] [INFO ] Deduced a trap composed of 8 places in 78 ms of which 0 ms to minimize.
[2023-03-11 03:04:50] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 0 ms to minimize.
[2023-03-11 03:04:51] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 1 ms to minimize.
[2023-03-11 03:04:51] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 1 ms to minimize.
[2023-03-11 03:04:51] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 1 ms to minimize.
[2023-03-11 03:04:51] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 0 ms to minimize.
[2023-03-11 03:04:51] [INFO ] Deduced a trap composed of 36 places in 64 ms of which 0 ms to minimize.
[2023-03-11 03:04:51] [INFO ] Deduced a trap composed of 43 places in 62 ms of which 0 ms to minimize.
[2023-03-11 03:04:51] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 687 ms
[2023-03-11 03:04:51] [INFO ] After 859ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-11 03:04:51] [INFO ] After 997ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 4 out of 539 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 539/539 places, 472/472 transitions.
Graph (trivial) has 251 edges and 539 vertex of which 6 / 539 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1205 edges and 534 vertex of which 532 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 67 transitions
Trivial Post-agglo rules discarded 67 transitions
Performed 67 trivial Post agglomeration. Transition count delta: 67
Iterating post reduction 0 with 67 rules applied. Total rules applied 69 place count 532 transition count 396
Reduce places removed 67 places and 0 transitions.
Iterating post reduction 1 with 67 rules applied. Total rules applied 136 place count 465 transition count 396
Performed 111 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 111 Pre rules applied. Total rules applied 136 place count 465 transition count 285
Deduced a syphon composed of 111 places in 0 ms
Ensure Unique test removed 22 places
Reduce places removed 133 places and 0 transitions.
Iterating global reduction 2 with 244 rules applied. Total rules applied 380 place count 332 transition count 285
Performed 142 Post agglomeration using F-continuation condition.Transition count delta: 142
Deduced a syphon composed of 142 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 146 places and 0 transitions.
Iterating global reduction 2 with 288 rules applied. Total rules applied 668 place count 186 transition count 143
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -7
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 672 place count 184 transition count 150
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 674 place count 184 transition count 148
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 676 place count 182 transition count 148
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 677 place count 182 transition count 148
Applied a total of 677 rules in 28 ms. Remains 182 /539 variables (removed 357) and now considering 148/472 (removed 324) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 182/539 places, 148/472 transitions.
Incomplete random walk after 10000 steps, including 502 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 1) seen :0
Finished Best-First random walk after 600 steps, including 8 resets, run visited all 1 properties in 2 ms. (steps per millisecond=300 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p0), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 8 factoid took 263 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 64 ms :[false, false, (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 56 ms :[false, false, (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 79 ms :[false, false, (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 506 reset in 197 ms.
Product exploration explored 100000 steps with 506 reset in 218 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 76 ms :[false, false, (AND (NOT p0) (NOT p1))]
Support contains 4 out of 539 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 539/539 places, 472/472 transitions.
Graph (trivial) has 251 edges and 539 vertex of which 6 / 539 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 1206 edges and 534 vertex of which 532 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Performed 61 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 61 rules applied. Total rules applied 63 place count 532 transition count 464
Performed 86 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 86 Pre rules applied. Total rules applied 63 place count 532 transition count 524
Deduced a syphon composed of 147 places in 1 ms
Iterating global reduction 1 with 86 rules applied. Total rules applied 149 place count 532 transition count 524
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 176 place count 505 transition count 479
Deduced a syphon composed of 120 places in 1 ms
Iterating global reduction 1 with 27 rules applied. Total rules applied 203 place count 505 transition count 479
Performed 172 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 292 places in 0 ms
Iterating global reduction 1 with 172 rules applied. Total rules applied 375 place count 505 transition count 479
Discarding 44 places :
Symmetric choice reduction at 1 with 44 rule applications. Total rules 419 place count 461 transition count 435
Deduced a syphon composed of 248 places in 0 ms
Iterating global reduction 1 with 44 rules applied. Total rules applied 463 place count 461 transition count 435
Deduced a syphon composed of 248 places in 0 ms
Applied a total of 463 rules in 99 ms. Remains 461 /539 variables (removed 78) and now considering 435/472 (removed 37) transitions.
[2023-03-11 03:04:52] [INFO ] Redundant transitions in 19 ms returned []
// Phase 1: matrix 435 rows 461 cols
[2023-03-11 03:04:52] [INFO ] Computed 107 place invariants in 9 ms
[2023-03-11 03:04:53] [INFO ] Dead Transitions using invariants and state equation in 221 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 461/539 places, 435/472 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 360 ms. Remains : 461/539 places, 435/472 transitions.
Support contains 4 out of 539 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 539/539 places, 472/472 transitions.
Applied a total of 0 rules in 85 ms. Remains 539 /539 variables (removed 0) and now considering 472/472 (removed 0) transitions.
// Phase 1: matrix 472 rows 539 cols
[2023-03-11 03:04:53] [INFO ] Computed 107 place invariants in 8 ms
[2023-03-11 03:04:53] [INFO ] Implicit Places using invariants in 219 ms returned []
[2023-03-11 03:04:53] [INFO ] Invariant cache hit.
[2023-03-11 03:04:53] [INFO ] Implicit Places using invariants and state equation in 452 ms returned []
Implicit Place search using SMT with State Equation took 676 ms to find 0 implicit places.
[2023-03-11 03:04:53] [INFO ] Invariant cache hit.
[2023-03-11 03:04:54] [INFO ] Dead Transitions using invariants and state equation in 242 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1003 ms. Remains : 539/539 places, 472/472 transitions.
Treatment of property BusinessProcesses-PT-20-LTLFireability-14 finished in 19128 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||X(F(p0))))||((!p0||X(F(p0)))&&F(G(p1))))))'
[2023-03-11 03:04:54] [INFO ] Flatten gal took : 26 ms
[2023-03-11 03:04:54] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-11 03:04:54] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 549 places, 482 transitions and 1533 arcs took 18 ms.
Total runtime 51077 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT BusinessProcesses-PT-20
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/375
LTLFireability

BK_STOP 1678503974755

--------------------
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:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ 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 LTLFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/375/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/375/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/375/LTLFireability.xml
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: LAUNCH task # 1 (type EXCL) for 0 BusinessProcesses-PT-20-LTLFireability-14
lola: time limit : 3600 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BusinessProcesses-PT-20-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/3600 3/32 BusinessProcesses-PT-20-LTLFireability-14 318358 m, 63671 m/sec, 1938322 t fired, .

Time elapsed: 5 secs. Pages in use: 3
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BusinessProcesses-PT-20-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/3600 6/32 BusinessProcesses-PT-20-LTLFireability-14 620116 m, 60351 m/sec, 4057382 t fired, .

Time elapsed: 10 secs. Pages in use: 6
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BusinessProcesses-PT-20-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 15/3600 8/32 BusinessProcesses-PT-20-LTLFireability-14 900305 m, 56037 m/sec, 6052726 t fired, .

Time elapsed: 15 secs. Pages in use: 8
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BusinessProcesses-PT-20-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 20/3600 10/32 BusinessProcesses-PT-20-LTLFireability-14 1152844 m, 50507 m/sec, 7973960 t fired, .

Time elapsed: 20 secs. Pages in use: 10
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BusinessProcesses-PT-20-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 25/3600 12/32 BusinessProcesses-PT-20-LTLFireability-14 1402441 m, 49919 m/sec, 9990716 t fired, .

Time elapsed: 25 secs. Pages in use: 12
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BusinessProcesses-PT-20-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 30/3600 14/32 BusinessProcesses-PT-20-LTLFireability-14 1658591 m, 51230 m/sec, 11948769 t fired, .

Time elapsed: 30 secs. Pages in use: 14
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BusinessProcesses-PT-20-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 35/3600 17/32 BusinessProcesses-PT-20-LTLFireability-14 1923590 m, 52999 m/sec, 13943809 t fired, .

Time elapsed: 35 secs. Pages in use: 17
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BusinessProcesses-PT-20-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 40/3600 19/32 BusinessProcesses-PT-20-LTLFireability-14 2160244 m, 47330 m/sec, 15850767 t fired, .

Time elapsed: 40 secs. Pages in use: 19
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BusinessProcesses-PT-20-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 45/3600 21/32 BusinessProcesses-PT-20-LTLFireability-14 2419105 m, 51772 m/sec, 17855933 t fired, .

Time elapsed: 45 secs. Pages in use: 21
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BusinessProcesses-PT-20-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 50/3600 23/32 BusinessProcesses-PT-20-LTLFireability-14 2676666 m, 51512 m/sec, 19794000 t fired, .

Time elapsed: 50 secs. Pages in use: 23
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BusinessProcesses-PT-20-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 55/3600 25/32 BusinessProcesses-PT-20-LTLFireability-14 2924441 m, 49555 m/sec, 21761215 t fired, .

Time elapsed: 55 secs. Pages in use: 25
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BusinessProcesses-PT-20-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 60/3600 27/32 BusinessProcesses-PT-20-LTLFireability-14 3161841 m, 47480 m/sec, 23693327 t fired, .

Time elapsed: 60 secs. Pages in use: 27
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BusinessProcesses-PT-20-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 65/3600 29/32 BusinessProcesses-PT-20-LTLFireability-14 3385469 m, 44725 m/sec, 25583669 t fired, .

Time elapsed: 65 secs. Pages in use: 29
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BusinessProcesses-PT-20-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 70/3600 31/32 BusinessProcesses-PT-20-LTLFireability-14 3607366 m, 44379 m/sec, 27506833 t fired, .

Time elapsed: 70 secs. Pages in use: 31
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BusinessProcesses-PT-20-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 75/3600 32/32 BusinessProcesses-PT-20-LTLFireability-14 3810895 m, 40705 m/sec, 29452884 t fired, .

Time elapsed: 75 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 1
lola: CANCELED task # 1 (type EXCL) for BusinessProcesses-PT-20-LTLFireability-14 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BusinessProcesses-PT-20-LTLFireability-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 80 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 1
lola: Portfolio finished: no open tasks 1

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BusinessProcesses-PT-20-LTLFireability-14: LTL unknown AGGR


Time elapsed: 80 secs. Pages in use: 32

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-20"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="lolaxred"
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 lolaxred"
echo " Input is BusinessProcesses-PT-20, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r039-tajo-167813692800604"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-20.tgz
mv BusinessProcesses-PT-20 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;