Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 7.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 11 16:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K Apr 11 16:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Apr 11 16:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 43K Apr 11 16:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 141K May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME BusinessProcesses-PT-11-LTLFireability-00
FORMULA_NAME BusinessProcesses-PT-11-LTLFireability-01
FORMULA_NAME BusinessProcesses-PT-11-LTLFireability-02
FORMULA_NAME BusinessProcesses-PT-11-LTLFireability-03
FORMULA_NAME BusinessProcesses-PT-11-LTLFireability-04
FORMULA_NAME BusinessProcesses-PT-11-LTLFireability-05
FORMULA_NAME BusinessProcesses-PT-11-LTLFireability-06
FORMULA_NAME BusinessProcesses-PT-11-LTLFireability-07
FORMULA_NAME BusinessProcesses-PT-11-LTLFireability-08
FORMULA_NAME BusinessProcesses-PT-11-LTLFireability-09
FORMULA_NAME BusinessProcesses-PT-11-LTLFireability-10
FORMULA_NAME BusinessProcesses-PT-11-LTLFireability-11
FORMULA_NAME BusinessProcesses-PT-11-LTLFireability-12
FORMULA_NAME BusinessProcesses-PT-11-LTLFireability-13
FORMULA_NAME BusinessProcesses-PT-11-LTLFireability-14
FORMULA_NAME BusinessProcesses-PT-11-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716651046246

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-11
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-25 15:30:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-25 15:30:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 15:30:48] [INFO ] Load time of PNML (sax parser for PT used): 91 ms
[2024-05-25 15:30:48] [INFO ] Transformed 567 places.
[2024-05-25 15:30:48] [INFO ] Transformed 508 transitions.
[2024-05-25 15:30:48] [INFO ] Found NUPN structural information;
[2024-05-25 15:30:48] [INFO ] Parsed PT model containing 567 places and 508 transitions and 1512 arcs in 172 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 7 places in 8 ms
Reduce places removed 7 places and 7 transitions.
FORMULA BusinessProcesses-PT-11-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-11-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-11-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-11-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 47 out of 560 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 560/560 places, 501/501 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 556 transition count 501
Discarding 71 places :
Symmetric choice reduction at 1 with 71 rule applications. Total rules 75 place count 485 transition count 430
Iterating global reduction 1 with 71 rules applied. Total rules applied 146 place count 485 transition count 430
Discarding 36 places :
Symmetric choice reduction at 1 with 36 rule applications. Total rules 182 place count 449 transition count 394
Iterating global reduction 1 with 36 rules applied. Total rules applied 218 place count 449 transition count 394
Applied a total of 218 rules in 103 ms. Remains 449 /560 variables (removed 111) and now considering 394/501 (removed 107) transitions.
// Phase 1: matrix 394 rows 449 cols
[2024-05-25 15:30:49] [INFO ] Computed 91 invariants in 39 ms
[2024-05-25 15:30:49] [INFO ] Implicit Places using invariants in 359 ms returned []
[2024-05-25 15:30:49] [INFO ] Invariant cache hit.
[2024-05-25 15:30:49] [INFO ] Implicit Places using invariants and state equation in 494 ms returned []
Implicit Place search using SMT with State Equation took 885 ms to find 0 implicit places.
[2024-05-25 15:30:49] [INFO ] Invariant cache hit.
[2024-05-25 15:30:50] [INFO ] Dead Transitions using invariants and state equation in 296 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 449/560 places, 394/501 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1287 ms. Remains : 449/560 places, 394/501 transitions.
Support contains 47 out of 449 places after structural reductions.
[2024-05-25 15:30:50] [INFO ] Flatten gal took : 63 ms
[2024-05-25 15:30:50] [INFO ] Flatten gal took : 26 ms
[2024-05-25 15:30:50] [INFO ] Input system was already deterministic with 394 transitions.
Incomplete random walk after 10000 steps, including 76 resets, run finished after 678 ms. (steps per millisecond=14 ) properties (out of 28) seen :11
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) seen :0
Running SMT prover for 17 properties.
[2024-05-25 15:30:51] [INFO ] Invariant cache hit.
[2024-05-25 15:30:51] [INFO ] [Real]Absence check using 49 positive place invariants in 12 ms returned sat
[2024-05-25 15:30:51] [INFO ] [Real]Absence check using 49 positive and 42 generalized place invariants in 18 ms returned sat
[2024-05-25 15:30:51] [INFO ] After 267ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:17
[2024-05-25 15:30:51] [INFO ] [Nat]Absence check using 49 positive place invariants in 15 ms returned sat
[2024-05-25 15:30:51] [INFO ] [Nat]Absence check using 49 positive and 42 generalized place invariants in 9 ms returned sat
[2024-05-25 15:30:52] [INFO ] After 495ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :15
[2024-05-25 15:30:52] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 5 ms to minimize.
[2024-05-25 15:30:52] [INFO ] Deduced a trap composed of 8 places in 80 ms of which 1 ms to minimize.
[2024-05-25 15:30:52] [INFO ] Deduced a trap composed of 20 places in 74 ms of which 1 ms to minimize.
[2024-05-25 15:30:52] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 2 ms to minimize.
[2024-05-25 15:30:52] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 1 ms to minimize.
[2024-05-25 15:30:53] [INFO ] Deduced a trap composed of 27 places in 57 ms of which 0 ms to minimize.
[2024-05-25 15:30:53] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 550 ms
[2024-05-25 15:30:53] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 1 ms to minimize.
[2024-05-25 15:30:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 115 ms
[2024-05-25 15:30:53] [INFO ] Deduced a trap composed of 76 places in 136 ms of which 1 ms to minimize.
[2024-05-25 15:30:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 184 ms
[2024-05-25 15:30:53] [INFO ] After 1874ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :15
Attempting to minimize the solution found.
Minimization took 448 ms.
[2024-05-25 15:30:54] [INFO ] After 2692ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :15
Fused 17 Parikh solutions to 15 different solutions.
Parikh walk visited 1 properties in 217 ms.
Support contains 23 out of 449 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 449/449 places, 394/394 transitions.
Graph (complete) has 1005 edges and 449 vertex of which 448 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 46 place count 448 transition count 348
Reduce places removed 45 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 48 rules applied. Total rules applied 94 place count 403 transition count 345
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 97 place count 400 transition count 345
Performed 86 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 86 Pre rules applied. Total rules applied 97 place count 400 transition count 259
Deduced a syphon composed of 86 places in 1 ms
Ensure Unique test removed 16 places
Reduce places removed 102 places and 0 transitions.
Iterating global reduction 3 with 188 rules applied. Total rules applied 285 place count 298 transition count 259
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 289 place count 294 transition count 255
Iterating global reduction 3 with 4 rules applied. Total rules applied 293 place count 294 transition count 255
Performed 107 Post agglomeration using F-continuation condition.Transition count delta: 107
Deduced a syphon composed of 107 places in 0 ms
Reduce places removed 107 places and 0 transitions.
Iterating global reduction 3 with 214 rules applied. Total rules applied 507 place count 187 transition count 148
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 508 place count 187 transition count 147
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 510 place count 186 transition count 151
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 514 place count 186 transition count 151
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 515 place count 185 transition count 150
Applied a total of 515 rules in 98 ms. Remains 185 /449 variables (removed 264) and now considering 150/394 (removed 244) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 98 ms. Remains : 185/449 places, 150/394 transitions.
Incomplete random walk after 10000 steps, including 757 resets, run finished after 385 ms. (steps per millisecond=25 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 131 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 135 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 14) seen :1
Incomplete Best-First random walk after 10001 steps, including 165 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 175 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 175 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 176 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 177 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 179 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 183 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 181 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 176 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 179 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 178 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 13) seen :0
Finished probabilistic random walk after 120933 steps, run visited all 13 properties in 440 ms. (steps per millisecond=274 )
Probabilistic random walk after 120933 steps, saw 28189 distinct states, run finished after 440 ms. (steps per millisecond=274 ) properties seen :13
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 2 atomic propositions for a total of 12 simplifications.
FORMULA BusinessProcesses-PT-11-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 434 stabilizing places and 379 stable transitions
Graph (complete) has 1005 edges and 449 vertex of which 448 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.15 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p1)&&p0)))'
Support contains 8 out of 449 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 449/449 places, 394/394 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 439 transition count 384
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 439 transition count 384
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 438 transition count 383
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 438 transition count 383
Applied a total of 22 rules in 34 ms. Remains 438 /449 variables (removed 11) and now considering 383/394 (removed 11) transitions.
// Phase 1: matrix 383 rows 438 cols
[2024-05-25 15:30:57] [INFO ] Computed 91 invariants in 8 ms
[2024-05-25 15:30:57] [INFO ] Implicit Places using invariants in 258 ms returned []
[2024-05-25 15:30:57] [INFO ] Invariant cache hit.
[2024-05-25 15:30:58] [INFO ] Implicit Places using invariants and state equation in 606 ms returned []
Implicit Place search using SMT with State Equation took 869 ms to find 0 implicit places.
[2024-05-25 15:30:58] [INFO ] Invariant cache hit.
[2024-05-25 15:30:58] [INFO ] Dead Transitions using invariants and state equation in 222 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 438/449 places, 383/394 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1126 ms. Remains : 438/449 places, 383/394 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 392 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : BusinessProcesses-PT-11-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(OR (AND (EQ s5 1) (EQ s88 1) (EQ s261 1) (EQ s366 1)) (EQ s5 1)), p0:(AND (EQ s254 1) (EQ s201 1) (EQ s264 1) (EQ s399 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA BusinessProcesses-PT-11-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-11-LTLFireability-00 finished in 1584 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&F(G(p1))))'
Support contains 4 out of 449 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 449/449 places, 394/394 transitions.
Graph (complete) has 1005 edges and 449 vertex of which 448 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 50 place count 447 transition count 343
Reduce places removed 49 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 51 rules applied. Total rules applied 101 place count 398 transition count 341
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 103 place count 396 transition count 341
Performed 97 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 97 Pre rules applied. Total rules applied 103 place count 396 transition count 244
Deduced a syphon composed of 97 places in 1 ms
Ensure Unique test removed 18 places
Reduce places removed 115 places and 0 transitions.
Iterating global reduction 3 with 212 rules applied. Total rules applied 315 place count 281 transition count 244
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 323 place count 273 transition count 236
Iterating global reduction 3 with 8 rules applied. Total rules applied 331 place count 273 transition count 236
Performed 109 Post agglomeration using F-continuation condition.Transition count delta: 109
Deduced a syphon composed of 109 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 112 places and 0 transitions.
Iterating global reduction 3 with 221 rules applied. Total rules applied 552 place count 161 transition count 127
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 553 place count 161 transition count 126
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 555 place count 160 transition count 130
Applied a total of 555 rules in 81 ms. Remains 160 /449 variables (removed 289) and now considering 130/394 (removed 264) transitions.
// Phase 1: matrix 130 rows 160 cols
[2024-05-25 15:30:58] [INFO ] Computed 70 invariants in 1 ms
[2024-05-25 15:30:58] [INFO ] Implicit Places using invariants in 171 ms returned [1, 4, 5, 28, 29, 30, 31, 39, 40, 41, 46, 47, 48, 49, 50, 51, 52, 53]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 184 ms to find 18 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 142/449 places, 130/394 transitions.
Applied a total of 0 rules in 6 ms. Remains 142 /142 variables (removed 0) and now considering 130/130 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 271 ms. Remains : 142/449 places, 130/394 transitions.
Stuttering acceptance computed with spot in 218 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-11-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s28 0) (EQ s67 0) (EQ s117 0)), p1:(EQ s38 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-11-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-11-LTLFireability-01 finished in 516 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(X(p0))||(p1&&G(p2)))))'
Support contains 4 out of 449 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 449/449 places, 394/394 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 440 transition count 385
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 440 transition count 385
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 439 transition count 384
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 439 transition count 384
Applied a total of 20 rules in 35 ms. Remains 439 /449 variables (removed 10) and now considering 384/394 (removed 10) transitions.
// Phase 1: matrix 384 rows 439 cols
[2024-05-25 15:30:59] [INFO ] Computed 91 invariants in 13 ms
[2024-05-25 15:30:59] [INFO ] Implicit Places using invariants in 322 ms returned []
[2024-05-25 15:30:59] [INFO ] Invariant cache hit.
[2024-05-25 15:31:00] [INFO ] Implicit Places using invariants and state equation in 745 ms returned []
Implicit Place search using SMT with State Equation took 1083 ms to find 0 implicit places.
[2024-05-25 15:31:00] [INFO ] Invariant cache hit.
[2024-05-25 15:31:00] [INFO ] Dead Transitions using invariants and state equation in 316 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 439/449 places, 384/394 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1436 ms. Remains : 439/449 places, 384/394 transitions.
Stuttering acceptance computed with spot in 246 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : BusinessProcesses-PT-11-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND p1 p2), acceptance={} source=0 dest: 2}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND p1 p2), acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={} source=2 dest: 3}, { cond=p2, acceptance={} source=2 dest: 4}], [{ cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0))), acceptance={0} source=3 dest: 3}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=4 dest: 3}, { cond=(AND p2 (NOT p0)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(EQ s24 0), p2:(EQ s179 1), p0:(AND (EQ s17 0) (EQ s290 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 480 ms.
Product exploration explored 100000 steps with 33333 reset in 305 ms.
Computed a total of 424 stabilizing places and 369 stable transitions
Graph (complete) has 993 edges and 439 vertex of which 438 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.28 ms
Computed a total of 424 stabilizing places and 369 stable transitions
Detected a total of 424/439 stabilizing places and 369/384 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p2) p0), (X (NOT (AND p1 p2))), (X (NOT p2)), (X (OR (NOT p1) (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0)))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 11 factoid took 899 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-11-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-11-LTLFireability-02 finished in 3441 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(p1)&&p0)))'
Support contains 2 out of 449 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 449/449 places, 394/394 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 439 transition count 384
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 439 transition count 384
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 438 transition count 383
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 438 transition count 383
Applied a total of 22 rules in 46 ms. Remains 438 /449 variables (removed 11) and now considering 383/394 (removed 11) transitions.
// Phase 1: matrix 383 rows 438 cols
[2024-05-25 15:31:02] [INFO ] Computed 91 invariants in 5 ms
[2024-05-25 15:31:03] [INFO ] Implicit Places using invariants in 482 ms returned []
[2024-05-25 15:31:03] [INFO ] Invariant cache hit.
[2024-05-25 15:31:03] [INFO ] Implicit Places using invariants and state equation in 558 ms returned []
Implicit Place search using SMT with State Equation took 1056 ms to find 0 implicit places.
[2024-05-25 15:31:03] [INFO ] Invariant cache hit.
[2024-05-25 15:31:04] [INFO ] Dead Transitions using invariants and state equation in 224 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 438/449 places, 383/394 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1341 ms. Remains : 438/449 places, 383/394 transitions.
Stuttering acceptance computed with spot in 93 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-11-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s242 1) (EQ s72 1)), p1:(EQ s72 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 124 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-11-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-11-LTLFireability-03 finished in 1452 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||X(F(p1))))))'
Support contains 3 out of 449 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 449/449 places, 394/394 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 440 transition count 385
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 440 transition count 385
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 439 transition count 384
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 439 transition count 384
Applied a total of 20 rules in 24 ms. Remains 439 /449 variables (removed 10) and now considering 384/394 (removed 10) transitions.
// Phase 1: matrix 384 rows 439 cols
[2024-05-25 15:31:04] [INFO ] Computed 91 invariants in 3 ms
[2024-05-25 15:31:04] [INFO ] Implicit Places using invariants in 168 ms returned []
[2024-05-25 15:31:04] [INFO ] Invariant cache hit.
[2024-05-25 15:31:04] [INFO ] Implicit Places using invariants and state equation in 451 ms returned []
Implicit Place search using SMT with State Equation took 634 ms to find 0 implicit places.
[2024-05-25 15:31:04] [INFO ] Invariant cache hit.
[2024-05-25 15:31:04] [INFO ] Dead Transitions using invariants and state equation in 190 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 439/449 places, 384/394 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 863 ms. Remains : 439/449 places, 384/394 transitions.
Stuttering acceptance computed with spot in 120 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-11-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s22 1), p1:(OR (EQ s125 1) (EQ s54 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 220 ms.
Product exploration explored 100000 steps with 33333 reset in 216 ms.
Computed a total of 424 stabilizing places and 369 stable transitions
Graph (complete) has 993 edges and 439 vertex of which 438 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 424 stabilizing places and 369 stable transitions
Detected a total of 424/439 stabilizing places and 369/384 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)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 39 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-11-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-11-LTLFireability-04 finished in 1494 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0 U (G(p0)||(p0&&G(p1)))))))'
Support contains 2 out of 449 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 449/449 places, 394/394 transitions.
Graph (trivial) has 206 edges and 449 vertex of which 6 / 449 are part of one of the 1 SCC in 3 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 999 edges and 444 vertex of which 443 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 52 place count 442 transition count 336
Reduce places removed 50 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 51 rules applied. Total rules applied 103 place count 392 transition count 335
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 104 place count 391 transition count 335
Performed 94 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 94 Pre rules applied. Total rules applied 104 place count 391 transition count 241
Deduced a syphon composed of 94 places in 0 ms
Ensure Unique test removed 18 places
Reduce places removed 112 places and 0 transitions.
Iterating global reduction 3 with 206 rules applied. Total rules applied 310 place count 279 transition count 241
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 317 place count 272 transition count 234
Iterating global reduction 3 with 7 rules applied. Total rules applied 324 place count 272 transition count 234
Performed 110 Post agglomeration using F-continuation condition.Transition count delta: 110
Deduced a syphon composed of 110 places in 0 ms
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 3 with 220 rules applied. Total rules applied 544 place count 162 transition count 124
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 546 place count 161 transition count 128
Applied a total of 546 rules in 46 ms. Remains 161 /449 variables (removed 288) and now considering 128/394 (removed 266) transitions.
// Phase 1: matrix 128 rows 161 cols
[2024-05-25 15:31:05] [INFO ] Computed 73 invariants in 6 ms
[2024-05-25 15:31:05] [INFO ] Implicit Places using invariants in 117 ms returned [1, 4, 5, 28, 29, 30, 31, 38, 39, 40, 49, 50, 51, 52, 53, 54, 55, 56, 155, 157, 159]
Discarding 21 places :
Implicit Place search using SMT only with invariants took 119 ms to find 21 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 140/449 places, 128/394 transitions.
Applied a total of 0 rules in 12 ms. Remains 140 /140 variables (removed 0) and now considering 128/128 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 177 ms. Remains : 140/449 places, 128/394 transitions.
Stuttering acceptance computed with spot in 162 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-11-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={1} source=2 dest: 2}]], initial=0, aps=[p1:(NEQ s75 1), p0:(EQ s32 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-11-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-11-LTLFireability-06 finished in 356 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 449 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 449/449 places, 394/394 transitions.
Graph (trivial) has 206 edges and 449 vertex of which 6 / 449 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 999 edges and 444 vertex of which 443 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 52 place count 442 transition count 336
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 1 with 50 rules applied. Total rules applied 102 place count 392 transition count 336
Performed 94 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 94 Pre rules applied. Total rules applied 102 place count 392 transition count 242
Deduced a syphon composed of 94 places in 0 ms
Ensure Unique test removed 18 places
Reduce places removed 112 places and 0 transitions.
Iterating global reduction 2 with 206 rules applied. Total rules applied 308 place count 280 transition count 242
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 315 place count 273 transition count 235
Iterating global reduction 2 with 7 rules applied. Total rules applied 322 place count 273 transition count 235
Performed 111 Post agglomeration using F-continuation condition.Transition count delta: 111
Deduced a syphon composed of 111 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 2 with 225 rules applied. Total rules applied 547 place count 159 transition count 124
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 549 place count 158 transition count 128
Applied a total of 549 rules in 35 ms. Remains 158 /449 variables (removed 291) and now considering 128/394 (removed 266) transitions.
// Phase 1: matrix 128 rows 158 cols
[2024-05-25 15:31:06] [INFO ] Computed 70 invariants in 2 ms
[2024-05-25 15:31:06] [INFO ] Implicit Places using invariants in 122 ms returned [1, 4, 5, 28, 29, 30, 31, 38, 39, 40, 45, 46, 47, 48, 49, 50, 51, 52]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 131 ms to find 18 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 140/449 places, 128/394 transitions.
Applied a total of 0 rules in 7 ms. Remains 140 /140 variables (removed 0) and now considering 128/128 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 173 ms. Remains : 140/449 places, 128/394 transitions.
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-11-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s78 0)], 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 38 steps with 6 reset in 1 ms.
FORMULA BusinessProcesses-PT-11-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-11-LTLFireability-07 finished in 275 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||G((F(p1)&&F(p2)))))'
Support contains 3 out of 449 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 449/449 places, 394/394 transitions.
Graph (trivial) has 206 edges and 449 vertex of which 6 / 449 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 999 edges and 444 vertex of which 443 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 52 place count 442 transition count 336
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 1 with 50 rules applied. Total rules applied 102 place count 392 transition count 336
Performed 94 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 94 Pre rules applied. Total rules applied 102 place count 392 transition count 242
Deduced a syphon composed of 94 places in 0 ms
Ensure Unique test removed 17 places
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 2 with 205 rules applied. Total rules applied 307 place count 281 transition count 242
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 315 place count 273 transition count 234
Iterating global reduction 2 with 8 rules applied. Total rules applied 323 place count 273 transition count 234
Performed 108 Post agglomeration using F-continuation condition.Transition count delta: 108
Deduced a syphon composed of 108 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 2 with 219 rules applied. Total rules applied 542 place count 162 transition count 126
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 544 place count 161 transition count 130
Applied a total of 544 rules in 64 ms. Remains 161 /449 variables (removed 288) and now considering 130/394 (removed 264) transitions.
// Phase 1: matrix 130 rows 161 cols
[2024-05-25 15:31:06] [INFO ] Computed 71 invariants in 3 ms
[2024-05-25 15:31:06] [INFO ] Implicit Places using invariants in 165 ms returned [1, 4, 5, 28, 29, 30, 31, 38, 39, 40, 45, 46, 47, 48, 49, 50, 51, 52, 53]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 167 ms to find 19 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 142/449 places, 130/394 transitions.
Applied a total of 0 rules in 6 ms. Remains 142 /142 variables (removed 0) and now considering 130/130 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 237 ms. Remains : 142/449 places, 130/394 transitions.
Stuttering acceptance computed with spot in 181 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : BusinessProcesses-PT-11-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=(NOT p2), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s37 0), p1:(EQ s110 0), p2:(EQ s98 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-11-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-11-LTLFireability-08 finished in 433 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((G(p0)||G(F(p1)))) U !p2))'
Support contains 4 out of 449 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 449/449 places, 394/394 transitions.
Graph (trivial) has 204 edges and 449 vertex of which 6 / 449 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 999 edges and 444 vertex of which 443 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 52 place count 443 transition count 337
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 1 with 50 rules applied. Total rules applied 102 place count 393 transition count 337
Performed 94 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 94 Pre rules applied. Total rules applied 102 place count 393 transition count 243
Deduced a syphon composed of 94 places in 1 ms
Ensure Unique test removed 17 places
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 2 with 205 rules applied. Total rules applied 307 place count 282 transition count 243
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 313 place count 276 transition count 237
Iterating global reduction 2 with 6 rules applied. Total rules applied 319 place count 276 transition count 237
Performed 111 Post agglomeration using F-continuation condition.Transition count delta: 111
Deduced a syphon composed of 111 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 2 with 225 rules applied. Total rules applied 544 place count 162 transition count 126
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 546 place count 161 transition count 130
Applied a total of 546 rules in 84 ms. Remains 161 /449 variables (removed 288) and now considering 130/394 (removed 264) transitions.
// Phase 1: matrix 130 rows 161 cols
[2024-05-25 15:31:06] [INFO ] Computed 71 invariants in 2 ms
[2024-05-25 15:31:06] [INFO ] Implicit Places using invariants in 208 ms returned [1, 4, 5, 28, 29, 30, 31, 38, 39, 40, 45, 46, 47, 48, 49, 50, 53, 54, 134]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 210 ms to find 19 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 142/449 places, 130/394 transitions.
Applied a total of 0 rules in 7 ms. Remains 142 /142 variables (removed 0) and now considering 130/130 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 301 ms. Remains : 142/449 places, 130/394 transitions.
Stuttering acceptance computed with spot in 194 ms :[p2, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-11-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={0} source=0 dest: 0}, { cond=p2, acceptance={} source=0 dest: 1}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(OR (EQ s0 1) (EQ s105 1)), p0:(EQ s97 1), p1:(NEQ s36 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 28851 reset in 423 ms.
Product exploration explored 100000 steps with 28982 reset in 356 ms.
Computed a total of 133 stabilizing places and 122 stable transitions
Computed a total of 133 stabilizing places and 122 stable transitions
Detected a total of 133/142 stabilizing places and 122/130 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND p2 (NOT p0) p1), (X (NOT p2)), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT p2))), true, (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 855 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 93 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2208 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10000 steps, including 701 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 130 rows 142 cols
[2024-05-25 15:31:09] [INFO ] Computed 52 invariants in 1 ms
[2024-05-25 15:31:09] [INFO ] [Real]Absence check using 32 positive place invariants in 5 ms returned sat
[2024-05-25 15:31:09] [INFO ] [Real]Absence check using 32 positive and 20 generalized place invariants in 6 ms returned sat
[2024-05-25 15:31:09] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p2 (NOT p0) p1), (X (NOT p2)), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT p2))), true, (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 14 factoid took 1215 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 111 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 110 ms :[(NOT p1), (NOT p1)]
Support contains 1 out of 142 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 142/142 places, 130/130 transitions.
Applied a total of 0 rules in 13 ms. Remains 142 /142 variables (removed 0) and now considering 130/130 (removed 0) transitions.
[2024-05-25 15:31:10] [INFO ] Invariant cache hit.
[2024-05-25 15:31:10] [INFO ] Implicit Places using invariants in 138 ms returned []
[2024-05-25 15:31:10] [INFO ] Invariant cache hit.
[2024-05-25 15:31:10] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-25 15:31:11] [INFO ] Implicit Places using invariants and state equation in 266 ms returned [3, 25, 27, 29, 31, 43, 45, 51, 53, 55, 57, 59, 61, 63, 65, 67, 69, 71, 73, 75, 77, 79, 80, 82, 84, 86, 88, 90]
Discarding 28 places :
Implicit Place search using SMT with State Equation took 407 ms to find 28 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 114/142 places, 130/130 transitions.
Graph (complete) has 374 edges and 114 vertex of which 102 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.0 ms
Discarding 12 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 102 transition count 113
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 25 place count 90 transition count 113
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 36 place count 79 transition count 74
Iterating global reduction 2 with 11 rules applied. Total rules applied 47 place count 79 transition count 74
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 61 place count 71 transition count 68
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 63 place count 70 transition count 67
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 64 place count 70 transition count 67
Applied a total of 64 rules in 17 ms. Remains 70 /114 variables (removed 44) and now considering 67/130 (removed 63) transitions.
// Phase 1: matrix 67 rows 70 cols
[2024-05-25 15:31:11] [INFO ] Computed 16 invariants in 1 ms
[2024-05-25 15:31:11] [INFO ] Implicit Places using invariants in 73 ms returned [3, 4, 5]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 75 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 67/142 places, 67/130 transitions.
Applied a total of 0 rules in 4 ms. Remains 67 /67 variables (removed 0) and now considering 67/67 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 518 ms. Remains : 67/142 places, 67/130 transitions.
Computed a total of 58 stabilizing places and 59 stable transitions
Computed a total of 58 stabilizing places and 59 stable transitions
Detected a total of 58/67 stabilizing places and 59/67 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p1, (X p1), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 134 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 105 ms :[(NOT p1), (NOT p1)]
Finished random walk after 26 steps, including 6 resets, run visited all 1 properties in 1 ms. (steps per millisecond=26 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p1, (X p1), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 4 factoid took 147 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 98 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 85 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 94 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 21159 reset in 117 ms.
Product exploration explored 100000 steps with 21160 reset in 112 ms.
Built C files in :
/tmp/ltsmin5239817708579949027
[2024-05-25 15:31:12] [INFO ] Computing symmetric may disable matrix : 67 transitions.
[2024-05-25 15:31:12] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 15:31:12] [INFO ] Computing symmetric may enable matrix : 67 transitions.
[2024-05-25 15:31:12] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 15:31:12] [INFO ] Computing Do-Not-Accords matrix : 67 transitions.
[2024-05-25 15:31:12] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 15:31:12] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5239817708579949027
Running compilation step : cd /tmp/ltsmin5239817708579949027;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 298 ms.
Running link step : cd /tmp/ltsmin5239817708579949027;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin5239817708579949027;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10947832065637315789.hoa' '--buchi-type=spotba'
LTSmin run took 242 ms.
FORMULA BusinessProcesses-PT-11-LTLFireability-10 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property BusinessProcesses-PT-11-LTLFireability-10 finished in 5984 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0&&(G(p1)||X(F(p2))))) U X(X(G(!p2)))))'
Support contains 3 out of 449 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 449/449 places, 394/394 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 441 transition count 386
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 441 transition count 386
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 440 transition count 385
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 440 transition count 385
Applied a total of 18 rules in 41 ms. Remains 440 /449 variables (removed 9) and now considering 385/394 (removed 9) transitions.
// Phase 1: matrix 385 rows 440 cols
[2024-05-25 15:31:12] [INFO ] Computed 91 invariants in 4 ms
[2024-05-25 15:31:12] [INFO ] Implicit Places using invariants in 197 ms returned []
[2024-05-25 15:31:12] [INFO ] Invariant cache hit.
[2024-05-25 15:31:13] [INFO ] Implicit Places using invariants and state equation in 548 ms returned []
Implicit Place search using SMT with State Equation took 751 ms to find 0 implicit places.
[2024-05-25 15:31:13] [INFO ] Invariant cache hit.
[2024-05-25 15:31:13] [INFO ] Dead Transitions using invariants and state equation in 225 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 440/449 places, 385/394 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1021 ms. Remains : 440/449 places, 385/394 transitions.
Stuttering acceptance computed with spot in 338 ms :[p2, (AND (NOT p0) p2), p2, true, (AND (NOT p0) p2), p2, (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : BusinessProcesses-PT-11-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={} source=2 dest: 2}, { cond=p2, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) p2), acceptance={} source=4 dest: 3}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=4 dest: 6}, { cond=(AND p0 p2), acceptance={} source=4 dest: 7}], [{ cond=(NOT p0), acceptance={} source=5 dest: 0}, { cond=p0, acceptance={} source=5 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=5 dest: 5}, { cond=(AND p0 p2), acceptance={0} source=5 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=7 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=7 dest: 6}, { cond=(AND p0 (NOT p2)), acceptance={} source=7 dest: 7}]], initial=5, aps=[p0:(NEQ s59 1), p2:(NEQ s240 1), p1:(NEQ s374 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 20022 reset in 203 ms.
Stack based approach found an accepted trace after 6121 steps with 1240 reset with depth 5 and stack size 5 in 13 ms.
FORMULA BusinessProcesses-PT-11-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property BusinessProcesses-PT-11-LTLFireability-12 finished in 1618 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(F(p1))))'
Support contains 7 out of 449 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 449/449 places, 394/394 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 440 transition count 385
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 440 transition count 385
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 439 transition count 384
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 439 transition count 384
Applied a total of 20 rules in 22 ms. Remains 439 /449 variables (removed 10) and now considering 384/394 (removed 10) transitions.
// Phase 1: matrix 384 rows 439 cols
[2024-05-25 15:31:14] [INFO ] Computed 91 invariants in 3 ms
[2024-05-25 15:31:14] [INFO ] Implicit Places using invariants in 206 ms returned []
[2024-05-25 15:31:14] [INFO ] Invariant cache hit.
[2024-05-25 15:31:14] [INFO ] Implicit Places using invariants and state equation in 427 ms returned []
Implicit Place search using SMT with State Equation took 648 ms to find 0 implicit places.
[2024-05-25 15:31:14] [INFO ] Invariant cache hit.
[2024-05-25 15:31:15] [INFO ] Dead Transitions using invariants and state equation in 183 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 439/449 places, 384/394 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 854 ms. Remains : 439/449 places, 384/394 transitions.
Stuttering acceptance computed with spot in 125 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-11-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(OR (EQ s403 0) (EQ s406 0) (EQ s409 0)), p0:(OR (EQ s329 0) (EQ s143 0) (EQ s293 0) (EQ s382 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 484 ms.
Product exploration explored 100000 steps with 50000 reset in 376 ms.
Computed a total of 424 stabilizing places and 369 stable transitions
Graph (complete) has 993 edges and 439 vertex of which 438 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 424 stabilizing places and 369 stable transitions
Detected a total of 424/439 stabilizing places and 369/384 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 35 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-11-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-11-LTLFireability-13 finished in 1895 ms.
All properties solved by simple procedures.
Total runtime 27646 ms.

BK_STOP 1716651076429

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BusinessProcesses-PT-11"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is BusinessProcesses-PT-11, 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 r065-tajo-171620414900333"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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