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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 576K
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K 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.7K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 17:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 11 16:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 169K Apr 11 16:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Apr 11 16:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Apr 11 16:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K 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 100K 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-07-LTLFireability-00
FORMULA_NAME BusinessProcesses-PT-07-LTLFireability-01
FORMULA_NAME BusinessProcesses-PT-07-LTLFireability-02
FORMULA_NAME BusinessProcesses-PT-07-LTLFireability-03
FORMULA_NAME BusinessProcesses-PT-07-LTLFireability-04
FORMULA_NAME BusinessProcesses-PT-07-LTLFireability-05
FORMULA_NAME BusinessProcesses-PT-07-LTLFireability-06
FORMULA_NAME BusinessProcesses-PT-07-LTLFireability-07
FORMULA_NAME BusinessProcesses-PT-07-LTLFireability-08
FORMULA_NAME BusinessProcesses-PT-07-LTLFireability-09
FORMULA_NAME BusinessProcesses-PT-07-LTLFireability-10
FORMULA_NAME BusinessProcesses-PT-07-LTLFireability-11
FORMULA_NAME BusinessProcesses-PT-07-LTLFireability-12
FORMULA_NAME BusinessProcesses-PT-07-LTLFireability-13
FORMULA_NAME BusinessProcesses-PT-07-LTLFireability-14
FORMULA_NAME BusinessProcesses-PT-07-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716650614816

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-07
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-25 15:23:37] [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:23:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 15:23:37] [INFO ] Load time of PNML (sax parser for PT used): 116 ms
[2024-05-25 15:23:37] [INFO ] Transformed 386 places.
[2024-05-25 15:23:37] [INFO ] Transformed 360 transitions.
[2024-05-25 15:23:37] [INFO ] Found NUPN structural information;
[2024-05-25 15:23:37] [INFO ] Parsed PT model containing 386 places and 360 transitions and 1110 arcs in 240 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 1 formulas.
FORMULA BusinessProcesses-PT-07-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 54 out of 386 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 386/386 places, 360/360 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 385 transition count 360
Discarding 47 places :
Symmetric choice reduction at 1 with 47 rule applications. Total rules 48 place count 338 transition count 313
Iterating global reduction 1 with 47 rules applied. Total rules applied 95 place count 338 transition count 313
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 116 place count 317 transition count 292
Iterating global reduction 1 with 21 rules applied. Total rules applied 137 place count 317 transition count 292
Applied a total of 137 rules in 95 ms. Remains 317 /386 variables (removed 69) and now considering 292/360 (removed 68) transitions.
// Phase 1: matrix 292 rows 317 cols
[2024-05-25 15:23:38] [INFO ] Computed 61 invariants in 31 ms
[2024-05-25 15:23:38] [INFO ] Implicit Places using invariants in 370 ms returned []
[2024-05-25 15:23:38] [INFO ] Invariant cache hit.
[2024-05-25 15:23:38] [INFO ] Implicit Places using invariants and state equation in 328 ms returned []
Implicit Place search using SMT with State Equation took 727 ms to find 0 implicit places.
[2024-05-25 15:23:38] [INFO ] Invariant cache hit.
[2024-05-25 15:23:39] [INFO ] Dead Transitions using invariants and state equation in 176 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 317/386 places, 292/360 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1004 ms. Remains : 317/386 places, 292/360 transitions.
Support contains 54 out of 317 places after structural reductions.
[2024-05-25 15:23:39] [INFO ] Flatten gal took : 51 ms
[2024-05-25 15:23:39] [INFO ] Flatten gal took : 25 ms
[2024-05-25 15:23:39] [INFO ] Input system was already deterministic with 292 transitions.
Incomplete random walk after 10000 steps, including 109 resets, run finished after 502 ms. (steps per millisecond=19 ) properties (out of 34) seen :26
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2024-05-25 15:23:40] [INFO ] Invariant cache hit.
[2024-05-25 15:23:40] [INFO ] [Real]Absence check using 33 positive place invariants in 8 ms returned sat
[2024-05-25 15:23:40] [INFO ] [Real]Absence check using 33 positive and 28 generalized place invariants in 9 ms returned sat
[2024-05-25 15:23:40] [INFO ] After 113ms SMT Verify possible using state equation in real domain returned unsat :1 sat :1 real:6
[2024-05-25 15:23:40] [INFO ] Deduced a trap composed of 8 places in 91 ms of which 8 ms to minimize.
[2024-05-25 15:23:40] [INFO ] Deduced a trap composed of 16 places in 108 ms of which 1 ms to minimize.
[2024-05-25 15:23:40] [INFO ] Deduced a trap composed of 12 places in 76 ms of which 2 ms to minimize.
[2024-05-25 15:23:41] [INFO ] Deduced a trap composed of 80 places in 85 ms of which 2 ms to minimize.
[2024-05-25 15:23:41] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 1 ms to minimize.
[2024-05-25 15:23:41] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 0 ms to minimize.
[2024-05-25 15:23:41] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 0 ms to minimize.
[2024-05-25 15:23:41] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 1 ms to minimize.
[2024-05-25 15:23:41] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 0 ms to minimize.
[2024-05-25 15:23:41] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 775 ms
[2024-05-25 15:23:41] [INFO ] After 905ms SMT Verify possible using trap constraints in real domain returned unsat :1 sat :0 real:7
[2024-05-25 15:23:41] [INFO ] After 1071ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:7
[2024-05-25 15:23:41] [INFO ] [Nat]Absence check using 33 positive place invariants in 7 ms returned sat
[2024-05-25 15:23:41] [INFO ] [Nat]Absence check using 33 positive and 28 generalized place invariants in 7 ms returned sat
[2024-05-25 15:23:41] [INFO ] After 131ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :4
[2024-05-25 15:23:41] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 0 ms to minimize.
[2024-05-25 15:23:41] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
[2024-05-25 15:23:41] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 0 ms to minimize.
[2024-05-25 15:23:41] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 1 ms to minimize.
[2024-05-25 15:23:41] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 176 ms
[2024-05-25 15:23:41] [INFO ] After 371ms SMT Verify possible using trap constraints in natural domain returned unsat :4 sat :4
Attempting to minimize the solution found.
Minimization took 40 ms.
[2024-05-25 15:23:41] [INFO ] After 544ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :4
Fused 8 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 30 ms.
Support contains 8 out of 317 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 317/317 places, 292/292 transitions.
Graph (trivial) has 140 edges and 317 vertex of which 6 / 317 are part of one of the 1 SCC in 5 ms
Free SCC test removed 5 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 731 edges and 312 vertex of which 311 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 34 place count 311 transition count 252
Reduce places removed 32 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 33 rules applied. Total rules applied 67 place count 279 transition count 251
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 68 place count 278 transition count 251
Performed 61 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 61 Pre rules applied. Total rules applied 68 place count 278 transition count 190
Deduced a syphon composed of 61 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 3 with 130 rules applied. Total rules applied 198 place count 209 transition count 190
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 208 place count 199 transition count 180
Iterating global reduction 3 with 10 rules applied. Total rules applied 218 place count 199 transition count 180
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 218 place count 199 transition count 178
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 222 place count 197 transition count 178
Performed 67 Post agglomeration using F-continuation condition.Transition count delta: 67
Deduced a syphon composed of 67 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 3 with 137 rules applied. Total rules applied 359 place count 127 transition count 111
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 3 with 2 rules applied. Total rules applied 361 place count 126 transition count 114
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 363 place count 126 transition count 112
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 365 place count 124 transition count 112
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 369 place count 124 transition count 112
Applied a total of 369 rules in 68 ms. Remains 124 /317 variables (removed 193) and now considering 112/292 (removed 180) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68 ms. Remains : 124/317 places, 112/292 transitions.
Incomplete random walk after 10000 steps, including 581 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 4) seen :3
Finished Best-First random walk after 1793 steps, including 41 resets, run visited all 1 properties in 12 ms. (steps per millisecond=149 )
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 4 atomic propositions for a total of 15 simplifications.
FORMULA BusinessProcesses-PT-07-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 199 stabilizing places and 201 stable transitions
Graph (complete) has 738 edges and 317 vertex of which 316 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 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||X(X(p0))))) U p1)||G(F(p1))))'
Support contains 4 out of 317 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 317/317 places, 292/292 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 304 transition count 279
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 304 transition count 279
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 303 transition count 278
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 303 transition count 278
Applied a total of 28 rules in 10 ms. Remains 303 /317 variables (removed 14) and now considering 278/292 (removed 14) transitions.
// Phase 1: matrix 278 rows 303 cols
[2024-05-25 15:23:42] [INFO ] Computed 61 invariants in 5 ms
[2024-05-25 15:23:42] [INFO ] Implicit Places using invariants in 137 ms returned []
[2024-05-25 15:23:42] [INFO ] Invariant cache hit.
[2024-05-25 15:23:43] [INFO ] Implicit Places using invariants and state equation in 309 ms returned []
Implicit Place search using SMT with State Equation took 447 ms to find 0 implicit places.
[2024-05-25 15:23:43] [INFO ] Invariant cache hit.
[2024-05-25 15:23:43] [INFO ] Dead Transitions using invariants and state equation in 159 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 303/317 places, 278/292 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 616 ms. Remains : 303/317 places, 278/292 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 517 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-07-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 3}, { cond=(NOT p1), acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 5}, { cond=(NOT p1), acceptance={} source=1 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=6 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=6 dest: 2}]], initial=0, aps=[p1:(EQ s80 1), p0:(AND (EQ s62 1) (EQ s223 1) (EQ s268 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 104 steps with 0 reset in 3 ms.
FORMULA BusinessProcesses-PT-07-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-07-LTLFireability-00 finished in 1226 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 317 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 317/317 places, 292/292 transitions.
Graph (trivial) has 145 edges and 317 vertex of which 6 / 317 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 732 edges and 312 vertex of which 311 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 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 36 place count 310 transition count 250
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 70 place count 276 transition count 250
Performed 63 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 63 Pre rules applied. Total rules applied 70 place count 276 transition count 187
Deduced a syphon composed of 63 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 135 rules applied. Total rules applied 205 place count 204 transition count 187
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 216 place count 193 transition count 176
Iterating global reduction 2 with 11 rules applied. Total rules applied 227 place count 193 transition count 176
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 227 place count 193 transition count 174
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 231 place count 191 transition count 174
Performed 67 Post agglomeration using F-continuation condition.Transition count delta: 67
Deduced a syphon composed of 67 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 2 with 137 rules applied. Total rules applied 368 place count 121 transition count 107
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
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 370 place count 120 transition count 110
Partial Post-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 376 place count 120 transition count 110
Applied a total of 376 rules in 41 ms. Remains 120 /317 variables (removed 197) and now considering 110/292 (removed 182) transitions.
// Phase 1: matrix 110 rows 120 cols
[2024-05-25 15:23:43] [INFO ] Computed 49 invariants in 2 ms
[2024-05-25 15:23:43] [INFO ] Implicit Places using invariants in 83 ms returned [4, 12, 38, 39, 40, 41, 42, 43, 44]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 85 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 111/317 places, 110/292 transitions.
Applied a total of 0 rules in 5 ms. Remains 111 /111 variables (removed 0) and now considering 110/110 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 131 ms. Remains : 111/317 places, 110/292 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-07-LTLFireability-01 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 s14 1) (EQ s2 1) (EQ s77 0))], 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 1 ms.
FORMULA BusinessProcesses-PT-07-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-07-LTLFireability-01 finished in 191 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 U (p1||G(!p0)))&&(p2||X(p3)))))'
Support contains 7 out of 317 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 317/317 places, 292/292 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 306 transition count 281
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 306 transition count 281
Applied a total of 22 rules in 8 ms. Remains 306 /317 variables (removed 11) and now considering 281/292 (removed 11) transitions.
// Phase 1: matrix 281 rows 306 cols
[2024-05-25 15:23:44] [INFO ] Computed 61 invariants in 4 ms
[2024-05-25 15:23:44] [INFO ] Implicit Places using invariants in 141 ms returned []
[2024-05-25 15:23:44] [INFO ] Invariant cache hit.
[2024-05-25 15:23:44] [INFO ] Implicit Places using invariants and state equation in 256 ms returned []
Implicit Place search using SMT with State Equation took 400 ms to find 0 implicit places.
[2024-05-25 15:23:44] [INFO ] Invariant cache hit.
[2024-05-25 15:23:44] [INFO ] Dead Transitions using invariants and state equation in 145 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 306/317 places, 281/292 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 555 ms. Remains : 306/317 places, 281/292 transitions.
Stuttering acceptance computed with spot in 132 ms :[true, (OR (AND (NOT p2) (NOT p3)) (AND p0 (NOT p1))), (OR (NOT p3) (AND p0 (NOT p1)))]
Running random walk in product with property : BusinessProcesses-PT-07-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 0}, { cond=(OR (AND p2 p1) (AND p2 (NOT p0))), acceptance={} source=1 dest: 1}, { cond=(OR (AND (NOT p2) p1) (AND (NOT p2) (NOT p0))), acceptance={} source=1 dest: 2}], [{ cond=(OR (AND (NOT p1) p0) (NOT p3)), acceptance={} source=2 dest: 0}, { cond=(OR (AND p2 p1 p3) (AND p2 (NOT p0) p3)), acceptance={} source=2 dest: 1}, { cond=(OR (AND (NOT p2) p1 p3) (AND (NOT p2) (NOT p0) p3)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(AND (NEQ s258 1) (NOT (AND (EQ s72 1) (EQ s254 1)))), p0:(AND (EQ s72 1) (EQ s254 1)), p2:(AND (EQ s129 1) (EQ s212 1) (EQ s265 1)), p3:(EQ s269 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-07-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-07-LTLFireability-02 finished in 710 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 317 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 317/317 places, 292/292 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 305 transition count 280
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 305 transition count 280
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 304 transition count 279
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 304 transition count 279
Applied a total of 26 rules in 21 ms. Remains 304 /317 variables (removed 13) and now considering 279/292 (removed 13) transitions.
// Phase 1: matrix 279 rows 304 cols
[2024-05-25 15:23:44] [INFO ] Computed 61 invariants in 5 ms
[2024-05-25 15:23:44] [INFO ] Implicit Places using invariants in 140 ms returned []
[2024-05-25 15:23:44] [INFO ] Invariant cache hit.
[2024-05-25 15:23:45] [INFO ] Implicit Places using invariants and state equation in 302 ms returned []
Implicit Place search using SMT with State Equation took 444 ms to find 0 implicit places.
[2024-05-25 15:23:45] [INFO ] Invariant cache hit.
[2024-05-25 15:23:45] [INFO ] Dead Transitions using invariants and state equation in 169 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 304/317 places, 279/292 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 635 ms. Remains : 304/317 places, 279/292 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-07-LTLFireability-03 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 s197 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]]
Product exploration explored 100000 steps with 2041 reset in 262 ms.
Stack based approach found an accepted trace after 316 steps with 6 reset with depth 5 and stack size 5 in 1 ms.
FORMULA BusinessProcesses-PT-07-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property BusinessProcesses-PT-07-LTLFireability-03 finished in 991 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((p0 U (X(!p0)||G(p0))))))))'
Support contains 1 out of 317 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 317/317 places, 292/292 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 304 transition count 279
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 304 transition count 279
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 303 transition count 278
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 303 transition count 278
Applied a total of 28 rules in 9 ms. Remains 303 /317 variables (removed 14) and now considering 278/292 (removed 14) transitions.
// Phase 1: matrix 278 rows 303 cols
[2024-05-25 15:23:45] [INFO ] Computed 61 invariants in 4 ms
[2024-05-25 15:23:45] [INFO ] Implicit Places using invariants in 136 ms returned []
[2024-05-25 15:23:45] [INFO ] Invariant cache hit.
[2024-05-25 15:23:46] [INFO ] Implicit Places using invariants and state equation in 329 ms returned []
Implicit Place search using SMT with State Equation took 469 ms to find 0 implicit places.
[2024-05-25 15:23:46] [INFO ] Invariant cache hit.
[2024-05-25 15:23:46] [INFO ] Dead Transitions using invariants and state equation in 156 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 303/317 places, 278/292 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 635 ms. Remains : 303/317 places, 278/292 transitions.
Stuttering acceptance computed with spot in 173 ms :[false, false, (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-07-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={0} source=3 dest: 1}, { cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(NEQ s278 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 227 ms.
Product exploration explored 100000 steps with 33333 reset in 227 ms.
Computed a total of 186 stabilizing places and 188 stable transitions
Graph (complete) has 719 edges and 303 vertex of which 302 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 186 stabilizing places and 188 stable transitions
Detected a total of 186/303 stabilizing places and 188/278 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 30 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-07-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-07-LTLFireability-04 finished in 1325 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(((p0 U p1)||F((G(p2)||(p2&&F(!p1)))))))))'
Support contains 7 out of 317 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 317/317 places, 292/292 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 305 transition count 280
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 305 transition count 280
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 304 transition count 279
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 304 transition count 279
Applied a total of 26 rules in 8 ms. Remains 304 /317 variables (removed 13) and now considering 279/292 (removed 13) transitions.
// Phase 1: matrix 279 rows 304 cols
[2024-05-25 15:23:47] [INFO ] Computed 61 invariants in 2 ms
[2024-05-25 15:23:47] [INFO ] Implicit Places using invariants in 146 ms returned []
[2024-05-25 15:23:47] [INFO ] Invariant cache hit.
[2024-05-25 15:23:47] [INFO ] Implicit Places using invariants and state equation in 304 ms returned []
Implicit Place search using SMT with State Equation took 454 ms to find 0 implicit places.
[2024-05-25 15:23:47] [INFO ] Invariant cache hit.
[2024-05-25 15:23:47] [INFO ] Dead Transitions using invariants and state equation in 157 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 304/317 places, 279/292 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 622 ms. Remains : 304/317 places, 279/292 transitions.
Stuttering acceptance computed with spot in 317 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND p1 (NOT p2))]
Running random walk in product with property : BusinessProcesses-PT-07-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}, { cond=(AND p1 p2), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=4 dest: 4}], [{ cond=(AND p1 p2), acceptance={} source=5 dest: 5}, { cond=(AND p1 (NOT p2)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(AND (EQ s45 1) (EQ s192 1) (EQ s273 1)), p0:(AND (EQ s21 1) (EQ s168 1) (EQ s241 1)), p2:(NEQ s221 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 2605 reset in 235 ms.
Stack based approach found an accepted trace after 15130 steps with 393 reset with depth 37 and stack size 32 in 33 ms.
FORMULA BusinessProcesses-PT-07-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property BusinessProcesses-PT-07-LTLFireability-05 finished in 1242 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(p0)||G(p1))))'
Support contains 2 out of 317 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 317/317 places, 292/292 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 304 transition count 279
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 304 transition count 279
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 303 transition count 278
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 303 transition count 278
Applied a total of 28 rules in 11 ms. Remains 303 /317 variables (removed 14) and now considering 278/292 (removed 14) transitions.
// Phase 1: matrix 278 rows 303 cols
[2024-05-25 15:23:48] [INFO ] Computed 61 invariants in 6 ms
[2024-05-25 15:23:48] [INFO ] Implicit Places using invariants in 151 ms returned []
[2024-05-25 15:23:48] [INFO ] Invariant cache hit.
[2024-05-25 15:23:48] [INFO ] Implicit Places using invariants and state equation in 307 ms returned []
Implicit Place search using SMT with State Equation took 462 ms to find 0 implicit places.
[2024-05-25 15:23:48] [INFO ] Invariant cache hit.
[2024-05-25 15:23:48] [INFO ] Dead Transitions using invariants and state equation in 197 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 303/317 places, 278/292 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 672 ms. Remains : 303/317 places, 278/292 transitions.
Stuttering acceptance computed with spot in 240 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-07-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=p1, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 5}], [{ cond=(NOT p1), acceptance={} source=5 dest: 0}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=2, aps=[p0:(EQ s24 0), p1:(EQ s165 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 173 ms.
Product exploration explored 100000 steps with 33333 reset in 179 ms.
Computed a total of 186 stabilizing places and 188 stable transitions
Graph (complete) has 719 edges and 303 vertex of which 302 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 186 stabilizing places and 188 stable transitions
Detected a total of 186/303 stabilizing places and 188/278 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X p1), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (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 6 factoid took 24 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-07-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-07-LTLFireability-06 finished in 1323 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 1 out of 317 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 317/317 places, 292/292 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 305 transition count 280
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 305 transition count 280
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 304 transition count 279
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 304 transition count 279
Applied a total of 26 rules in 9 ms. Remains 304 /317 variables (removed 13) and now considering 279/292 (removed 13) transitions.
// Phase 1: matrix 279 rows 304 cols
[2024-05-25 15:23:49] [INFO ] Computed 61 invariants in 3 ms
[2024-05-25 15:23:49] [INFO ] Implicit Places using invariants in 129 ms returned []
[2024-05-25 15:23:49] [INFO ] Invariant cache hit.
[2024-05-25 15:23:50] [INFO ] Implicit Places using invariants and state equation in 280 ms returned []
Implicit Place search using SMT with State Equation took 413 ms to find 0 implicit places.
[2024-05-25 15:23:50] [INFO ] Invariant cache hit.
[2024-05-25 15:23:50] [INFO ] Dead Transitions using invariants and state equation in 153 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 304/317 places, 279/292 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 578 ms. Remains : 304/317 places, 279/292 transitions.
Stuttering acceptance computed with spot in 128 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-07-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(EQ s247 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][false, false, false]]
Stuttering criterion allowed to conclude after 151 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-07-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-07-LTLFireability-07 finished in 729 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 317 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 317/317 places, 292/292 transitions.
Graph (trivial) has 147 edges and 317 vertex of which 6 / 317 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 732 edges and 312 vertex of which 311 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 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 38 place count 310 transition count 248
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 74 place count 274 transition count 248
Performed 62 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 62 Pre rules applied. Total rules applied 74 place count 274 transition count 186
Deduced a syphon composed of 62 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 2 with 133 rules applied. Total rules applied 207 place count 203 transition count 186
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 217 place count 193 transition count 176
Iterating global reduction 2 with 10 rules applied. Total rules applied 227 place count 193 transition count 176
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 227 place count 193 transition count 174
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 231 place count 191 transition count 174
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: 71
Deduced a syphon composed of 71 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 2 with 145 rules applied. Total rules applied 376 place count 117 transition count 103
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 378 place count 116 transition count 106
Applied a total of 378 rules in 50 ms. Remains 116 /317 variables (removed 201) and now considering 106/292 (removed 186) transitions.
// Phase 1: matrix 106 rows 116 cols
[2024-05-25 15:23:50] [INFO ] Computed 49 invariants in 1 ms
[2024-05-25 15:23:50] [INFO ] Implicit Places using invariants in 100 ms returned [1, 2, 10, 35, 36, 37, 38, 39, 40, 41]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 102 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 106/317 places, 106/292 transitions.
Applied a total of 0 rules in 5 ms. Remains 106 /106 variables (removed 0) and now considering 106/106 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 160 ms. Remains : 106/317 places, 106/292 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-07-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s51 0)], 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 324 steps with 70 reset in 3 ms.
FORMULA BusinessProcesses-PT-07-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-07-LTLFireability-08 finished in 222 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 317 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 317/317 places, 292/292 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 304 transition count 279
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 304 transition count 279
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 303 transition count 278
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 303 transition count 278
Applied a total of 28 rules in 14 ms. Remains 303 /317 variables (removed 14) and now considering 278/292 (removed 14) transitions.
// Phase 1: matrix 278 rows 303 cols
[2024-05-25 15:23:50] [INFO ] Computed 61 invariants in 3 ms
[2024-05-25 15:23:50] [INFO ] Implicit Places using invariants in 121 ms returned []
[2024-05-25 15:23:50] [INFO ] Invariant cache hit.
[2024-05-25 15:23:51] [INFO ] Implicit Places using invariants and state equation in 301 ms returned []
Implicit Place search using SMT with State Equation took 426 ms to find 0 implicit places.
[2024-05-25 15:23:51] [INFO ] Invariant cache hit.
[2024-05-25 15:23:51] [INFO ] Dead Transitions using invariants and state equation in 202 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 303/317 places, 278/292 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 644 ms. Remains : 303/317 places, 278/292 transitions.
Stuttering acceptance computed with spot in 153 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-07-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(EQ s15 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, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 63 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-07-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-07-LTLFireability-09 finished in 817 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((p0||F(p1)))||G(p2))))'
Support contains 7 out of 317 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 317/317 places, 292/292 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 305 transition count 280
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 305 transition count 280
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 304 transition count 279
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 304 transition count 279
Applied a total of 26 rules in 9 ms. Remains 304 /317 variables (removed 13) and now considering 279/292 (removed 13) transitions.
// Phase 1: matrix 279 rows 304 cols
[2024-05-25 15:23:51] [INFO ] Computed 61 invariants in 3 ms
[2024-05-25 15:23:51] [INFO ] Implicit Places using invariants in 134 ms returned []
[2024-05-25 15:23:51] [INFO ] Invariant cache hit.
[2024-05-25 15:23:51] [INFO ] Implicit Places using invariants and state equation in 255 ms returned []
Implicit Place search using SMT with State Equation took 402 ms to find 0 implicit places.
[2024-05-25 15:23:51] [INFO ] Invariant cache hit.
[2024-05-25 15:23:51] [INFO ] Dead Transitions using invariants and state equation in 168 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 304/317 places, 279/292 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 580 ms. Remains : 304/317 places, 279/292 transitions.
Stuttering acceptance computed with spot in 225 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2) p0)]
Running random walk in product with property : BusinessProcesses-PT-07-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(NOT p2), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(OR (EQ s111 0) (EQ s164 0) (EQ s259 0)), p0:(EQ s209 0), p1:(OR (EQ s108 0) (EQ s203 0) (EQ s269 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 1101 reset in 183 ms.
Product exploration explored 100000 steps with 1089 reset in 198 ms.
Computed a total of 187 stabilizing places and 189 stable transitions
Graph (complete) has 720 edges and 304 vertex of which 303 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 187 stabilizing places and 189 stable transitions
Detected a total of 187/304 stabilizing places and 189/279 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p2 p0 p1), (X p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (X p2)), true, (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X p1)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 14 factoid took 426 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 197 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2) p0)]
Incomplete random walk after 10000 steps, including 105 resets, run finished after 147 ms. (steps per millisecond=68 ) properties (out of 7) seen :3
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2024-05-25 15:23:53] [INFO ] Invariant cache hit.
[2024-05-25 15:23:53] [INFO ] After 87ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-25 15:23:53] [INFO ] [Nat]Absence check using 33 positive place invariants in 7 ms returned sat
[2024-05-25 15:23:53] [INFO ] [Nat]Absence check using 33 positive and 28 generalized place invariants in 7 ms returned sat
[2024-05-25 15:23:53] [INFO ] After 151ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :2
[2024-05-25 15:23:54] [INFO ] Deduced a trap composed of 8 places in 147 ms of which 1 ms to minimize.
[2024-05-25 15:23:54] [INFO ] Deduced a trap composed of 34 places in 77 ms of which 1 ms to minimize.
[2024-05-25 15:23:54] [INFO ] Deduced a trap composed of 35 places in 83 ms of which 0 ms to minimize.
[2024-05-25 15:23:54] [INFO ] Deduced a trap composed of 36 places in 101 ms of which 1 ms to minimize.
[2024-05-25 15:23:54] [INFO ] Deduced a trap composed of 36 places in 84 ms of which 1 ms to minimize.
[2024-05-25 15:23:54] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 594 ms
[2024-05-25 15:23:54] [INFO ] After 808ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :2
Attempting to minimize the solution found.
Minimization took 76 ms.
[2024-05-25 15:23:54] [INFO ] After 972ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :2
Fused 4 Parikh solutions to 2 different solutions.
Finished Parikh walk after 85 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=42 )
Parikh walk visited 1 properties in 1 ms.
Support contains 4 out of 304 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 304/304 places, 279/279 transitions.
Graph (complete) has 720 edges and 304 vertex of which 303 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 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 27 place count 303 transition count 252
Reduce places removed 26 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 28 rules applied. Total rules applied 55 place count 277 transition count 250
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 57 place count 275 transition count 250
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 65 Pre rules applied. Total rules applied 57 place count 275 transition count 185
Deduced a syphon composed of 65 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 3 with 139 rules applied. Total rules applied 196 place count 201 transition count 185
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 3 with 157 rules applied. Total rules applied 353 place count 121 transition count 108
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 354 place count 121 transition count 107
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 4 with 2 rules applied. Total rules applied 356 place count 120 transition count 110
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 362 place count 120 transition count 110
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 363 place count 119 transition count 109
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 364 place count 118 transition count 109
Applied a total of 364 rules in 45 ms. Remains 118 /304 variables (removed 186) and now considering 109/279 (removed 170) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 118/304 places, 109/279 transitions.
Finished random walk after 5805 steps, including 613 resets, run visited all 1 properties in 13 ms. (steps per millisecond=446 )
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p2 p0 p1), (X p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (X p2)), true, (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X p1)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND p0 (NOT p2) (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT p1)), (F (AND p0 p2 (NOT p1))), (F (NOT p2)), (F (AND (NOT p0) p2 (NOT p1))), (F (AND (NOT p0) (NOT p2) (NOT p1)))]
Knowledge based reduction with 15 factoid took 1210 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 128 ms :[(AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p0))]
Support contains 7 out of 304 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 304/304 places, 279/279 transitions.
Graph (complete) has 720 edges and 304 vertex of which 303 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 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 26 place count 302 transition count 252
Reduce places removed 25 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 27 rules applied. Total rules applied 53 place count 277 transition count 250
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 55 place count 275 transition count 250
Performed 63 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 63 Pre rules applied. Total rules applied 55 place count 275 transition count 187
Deduced a syphon composed of 63 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 3 with 134 rules applied. Total rules applied 189 place count 204 transition count 187
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 3 with 155 rules applied. Total rules applied 344 place count 125 transition count 111
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 345 place count 125 transition count 110
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 4 with 2 rules applied. Total rules applied 347 place count 124 transition count 113
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 348 place count 123 transition count 112
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 349 place count 122 transition count 112
Applied a total of 349 rules in 49 ms. Remains 122 /304 variables (removed 182) and now considering 112/279 (removed 167) transitions.
// Phase 1: matrix 112 rows 122 cols
[2024-05-25 15:23:56] [INFO ] Computed 49 invariants in 4 ms
[2024-05-25 15:23:56] [INFO ] Implicit Places using invariants in 268 ms returned [40, 41, 42, 43]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 278 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 118/304 places, 112/279 transitions.
Applied a total of 0 rules in 2 ms. Remains 118 /118 variables (removed 0) and now considering 112/112 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 329 ms. Remains : 118/304 places, 112/279 transitions.
Computed a total of 73 stabilizing places and 85 stable transitions
Computed a total of 73 stabilizing places and 85 stable transitions
Detected a total of 73/118 stabilizing places and 85/112 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p2 p1 p0), (X p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X p1), (X (X p2)), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p1)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 315 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 144 ms :[(AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 921 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 214 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 190 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
// Phase 1: matrix 112 rows 118 cols
[2024-05-25 15:23:57] [INFO ] Computed 45 invariants in 1 ms
[2024-05-25 15:23:57] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 15:23:57] [INFO ] [Nat]Absence check using 29 positive place invariants in 4 ms returned sat
[2024-05-25 15:23:57] [INFO ] [Nat]Absence check using 29 positive and 16 generalized place invariants in 8 ms returned sat
[2024-05-25 15:23:57] [INFO ] After 51ms SMT Verify possible using all constraints in natural 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 p1 p0), (X p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X p1), (X (X p2)), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p1)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND (NOT p2) (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT p2)), (F (NOT p1))]
Knowledge based reduction with 13 factoid took 665 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 118 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 9120 reset in 158 ms.
Product exploration explored 100000 steps with 9063 reset in 167 ms.
Built C files in :
/tmp/ltsmin7147042549664989390
[2024-05-25 15:23:58] [INFO ] Computing symmetric may disable matrix : 112 transitions.
[2024-05-25 15:23:58] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 15:23:58] [INFO ] Computing symmetric may enable matrix : 112 transitions.
[2024-05-25 15:23:58] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 15:23:58] [INFO ] Computing Do-Not-Accords matrix : 112 transitions.
[2024-05-25 15:23:58] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 15:23:58] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7147042549664989390
Running compilation step : cd /tmp/ltsmin7147042549664989390;'/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 377 ms.
Running link step : cd /tmp/ltsmin7147042549664989390;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin7147042549664989390;'/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/stateBased16908273371128563890.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 7 out of 118 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 118/118 places, 112/112 transitions.
Applied a total of 0 rules in 3 ms. Remains 118 /118 variables (removed 0) and now considering 112/112 (removed 0) transitions.
[2024-05-25 15:24:13] [INFO ] Invariant cache hit.
[2024-05-25 15:24:13] [INFO ] Implicit Places using invariants in 115 ms returned []
[2024-05-25 15:24:13] [INFO ] Invariant cache hit.
[2024-05-25 15:24:14] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-25 15:24:14] [INFO ] Implicit Places using invariants and state equation in 167 ms returned [68, 74, 76]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 283 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 115/118 places, 112/112 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 115 transition count 111
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 114 transition count 111
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 4 place count 113 transition count 110
Applied a total of 4 rules in 6 ms. Remains 113 /115 variables (removed 2) and now considering 110/112 (removed 2) transitions.
// Phase 1: matrix 110 rows 113 cols
[2024-05-25 15:24:14] [INFO ] Computed 42 invariants in 2 ms
[2024-05-25 15:24:14] [INFO ] Implicit Places using invariants in 111 ms returned []
[2024-05-25 15:24:14] [INFO ] Invariant cache hit.
[2024-05-25 15:24:14] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-25 15:24:14] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 228 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 113/118 places, 110/112 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 522 ms. Remains : 113/118 places, 110/112 transitions.
Built C files in :
/tmp/ltsmin6001585124160904622
[2024-05-25 15:24:14] [INFO ] Computing symmetric may disable matrix : 110 transitions.
[2024-05-25 15:24:14] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 15:24:14] [INFO ] Computing symmetric may enable matrix : 110 transitions.
[2024-05-25 15:24:14] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 15:24:14] [INFO ] Computing Do-Not-Accords matrix : 110 transitions.
[2024-05-25 15:24:14] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 15:24:14] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6001585124160904622
Running compilation step : cd /tmp/ltsmin6001585124160904622;'/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 238 ms.
Running link step : cd /tmp/ltsmin6001585124160904622;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 24 ms.
Running LTSmin : cd /tmp/ltsmin6001585124160904622;'/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/stateBased5816451587983285211.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-25 15:24:29] [INFO ] Flatten gal took : 13 ms
[2024-05-25 15:24:29] [INFO ] Flatten gal took : 22 ms
[2024-05-25 15:24:29] [INFO ] Time to serialize gal into /tmp/LTL11825409924421977753.gal : 10 ms
[2024-05-25 15:24:29] [INFO ] Time to serialize properties into /tmp/LTL1077637694871375772.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11825409924421977753.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17632822273934589565.hoa' '-atoms' '/tmp/LTL1077637694871375772.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL1077637694871375772.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17632822273934589565.hoa
Reverse transition relation is NOT exact ! Due to transitions t78, t158.t160.t161.t2.t162, t155.t156.t3.t162, t152.t153.t4.t162, t148.t149.t5.t162, t138.t1...889
Computing Next relation with stutter on 141120 deadlock states
Detected timeout of ITS tools.
[2024-05-25 15:24:44] [INFO ] Flatten gal took : 9 ms
[2024-05-25 15:24:44] [INFO ] Flatten gal took : 10 ms
[2024-05-25 15:24:44] [INFO ] Time to serialize gal into /tmp/LTL9179152432275693435.gal : 2 ms
[2024-05-25 15:24:44] [INFO ] Time to serialize properties into /tmp/LTL14332901089367362158.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9179152432275693435.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14332901089367362158.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X((G(("(p238==0)")||(F("(((p125==0)||(p231==0))||(p351==0))"))))||(G("(((p128==0)||(p182==0))||(p331==0))")))))
Formula 0 simplified : X(F(!"(p238==0)" & G!"(((p125==0)||(p231==0))||(p351==0))") & F!"(((p128==0)||(p182==0))||(p331==0))")
Reverse transition relation is NOT exact ! Due to transitions t78, t158.t160.t161.t2.t162, t155.t156.t3.t162, t152.t153.t4.t162, t148.t149.t5.t162, t138.t1...889
Computing Next relation with stutter on 141120 deadlock states
Detected timeout of ITS tools.
[2024-05-25 15:24:59] [INFO ] Flatten gal took : 10 ms
[2024-05-25 15:24:59] [INFO ] Applying decomposition
[2024-05-25 15:24:59] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph8361314383709606919.txt' '-o' '/tmp/graph8361314383709606919.bin' '-w' '/tmp/graph8361314383709606919.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph8361314383709606919.bin' '-l' '-1' '-v' '-w' '/tmp/graph8361314383709606919.weights' '-q' '0' '-e' '0.001'
[2024-05-25 15:24:59] [INFO ] Decomposing Gal with order
[2024-05-25 15:24:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 15:25:00] [INFO ] Removed a total of 73 redundant transitions.
[2024-05-25 15:25:00] [INFO ] Flatten gal took : 236 ms
[2024-05-25 15:25:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 30 labels/synchronizations in 15 ms.
[2024-05-25 15:25:00] [INFO ] Time to serialize gal into /tmp/LTL16134226238110310428.gal : 6 ms
[2024-05-25 15:25:00] [INFO ] Time to serialize properties into /tmp/LTL17254911649684484714.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16134226238110310428.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17254911649684484714.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X((G(("(u17.p238==0)")||(F("(((i2.u5.p125==0)||(i7.u16.p231==0))||(i0.u23.p351==0))"))))||(G("(((i2.u6.p128==0)||(i3.i0.u7.p182==0)...181
Formula 0 simplified : X(F(!"(u17.p238==0)" & G!"(((i2.u5.p125==0)||(i7.u16.p231==0))||(i0.u23.p351==0))") & F!"(((i2.u6.p128==0)||(i3.i0.u7.p182==0))||(i2...171
Reverse transition relation is NOT exact ! Due to transitions t158_t160_t161_t2_t162, t155_t156_t3_t162, t152_t153_t4_t162, t148_t149_t5_t162, t33_t35_t36_...766
Computing Next relation with stutter on 141120 deadlock states
12 unique states visited
0 strongly connected components in search stack
13 transitions explored
7 items max in DFS search stack
74 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.779403,43708,1,0,57239,4549,1889,75716,1490,17140,103077
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA BusinessProcesses-PT-07-LTLFireability-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property BusinessProcesses-PT-07-LTLFireability-12 finished in 69810 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(G(p0))&&F(p1))))'
Support contains 2 out of 317 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 317/317 places, 292/292 transitions.
Graph (trivial) has 145 edges and 317 vertex of which 6 / 317 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 732 edges and 312 vertex of which 311 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 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 37 place count 310 transition count 249
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 72 place count 275 transition count 249
Performed 63 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 63 Pre rules applied. Total rules applied 72 place count 275 transition count 186
Deduced a syphon composed of 63 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 135 rules applied. Total rules applied 207 place count 203 transition count 186
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 216 place count 194 transition count 177
Iterating global reduction 2 with 9 rules applied. Total rules applied 225 place count 194 transition count 177
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 225 place count 194 transition count 175
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 229 place count 192 transition count 175
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Deduced a syphon composed of 70 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 2 with 143 rules applied. Total rules applied 372 place count 119 transition count 105
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 374 place count 118 transition count 108
Applied a total of 374 rules in 37 ms. Remains 118 /317 variables (removed 199) and now considering 108/292 (removed 184) transitions.
// Phase 1: matrix 108 rows 118 cols
[2024-05-25 15:25:01] [INFO ] Computed 49 invariants in 1 ms
[2024-05-25 15:25:01] [INFO ] Implicit Places using invariants in 152 ms returned [1, 2, 10, 35, 36, 37, 38, 39, 40, 41]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 156 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 108/317 places, 108/292 transitions.
Applied a total of 0 rules in 5 ms. Remains 108 /108 variables (removed 0) and now considering 108/108 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 202 ms. Remains : 108/317 places, 108/292 transitions.
Stuttering acceptance computed with spot in 163 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-07-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s73 0), p1:(AND (EQ s83 0) (EQ s73 0))], 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 20601 reset in 245 ms.
Product exploration explored 100000 steps with 20571 reset in 183 ms.
Computed a total of 68 stabilizing places and 82 stable transitions
Computed a total of 68 stabilizing places and 82 stable transitions
Detected a total of 68/108 stabilizing places and 82/108 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 201 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 164 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 1104 steps, including 220 resets, run visited all 2 properties in 12 ms. (steps per millisecond=92 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 7 factoid took 270 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 130 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 140 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 2 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 108/108 transitions.
Applied a total of 0 rules in 5 ms. Remains 108 /108 variables (removed 0) and now considering 108/108 (removed 0) transitions.
// Phase 1: matrix 108 rows 108 cols
[2024-05-25 15:25:03] [INFO ] Computed 39 invariants in 1 ms
[2024-05-25 15:25:03] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-05-25 15:25:03] [INFO ] Invariant cache hit.
[2024-05-25 15:25:03] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-25 15:25:03] [INFO ] Implicit Places using invariants and state equation in 187 ms returned [10, 33, 55, 57, 63, 65]
Discarding 6 places :
Implicit Place search using SMT with State Equation took 280 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 102/108 places, 108/108 transitions.
Graph (complete) has 390 edges and 102 vertex of which 93 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 93 transition count 103
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 92 transition count 103
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 12 place count 83 transition count 67
Iterating global reduction 2 with 9 rules applied. Total rules applied 21 place count 83 transition count 67
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 27 place count 80 transition count 64
Applied a total of 27 rules in 19 ms. Remains 80 /102 variables (removed 22) and now considering 64/108 (removed 44) transitions.
// Phase 1: matrix 64 rows 80 cols
[2024-05-25 15:25:03] [INFO ] Computed 28 invariants in 0 ms
[2024-05-25 15:25:03] [INFO ] Implicit Places using invariants in 85 ms returned [10, 11, 12]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 88 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 77/108 places, 64/108 transitions.
Applied a total of 0 rules in 3 ms. Remains 77 /77 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 396 ms. Remains : 77/108 places, 64/108 transitions.
Computed a total of 37 stabilizing places and 38 stable transitions
Computed a total of 37 stabilizing places and 38 stable transitions
Detected a total of 37/77 stabilizing places and 38/64 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 125 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 177 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 5872 steps, including 1256 resets, run visited all 2 properties in 15 ms. (steps per millisecond=391 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 7 factoid took 300 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 127 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 139 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 138 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 20748 reset in 168 ms.
Product exploration explored 100000 steps with 20861 reset in 150 ms.
Built C files in :
/tmp/ltsmin1803829958901312534
[2024-05-25 15:25:04] [INFO ] Computing symmetric may disable matrix : 64 transitions.
[2024-05-25 15:25:04] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 15:25:04] [INFO ] Computing symmetric may enable matrix : 64 transitions.
[2024-05-25 15:25:04] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 15:25:04] [INFO ] Computing Do-Not-Accords matrix : 64 transitions.
[2024-05-25 15:25:04] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 15:25:04] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1803829958901312534
Running compilation step : cd /tmp/ltsmin1803829958901312534;'/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 204 ms.
Running link step : cd /tmp/ltsmin1803829958901312534;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin1803829958901312534;'/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/stateBased13760890621247238458.hoa' '--buchi-type=spotba'
LTSmin run took 6261 ms.
FORMULA BusinessProcesses-PT-07-LTLFireability-13 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property BusinessProcesses-PT-07-LTLFireability-13 finished in 10130 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((F(p0)||G((F(p0)||(F(p1) U p2)))))))'
Support contains 5 out of 317 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 317/317 places, 292/292 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 304 transition count 279
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 304 transition count 279
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 303 transition count 278
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 303 transition count 278
Applied a total of 28 rules in 30 ms. Remains 303 /317 variables (removed 14) and now considering 278/292 (removed 14) transitions.
// Phase 1: matrix 278 rows 303 cols
[2024-05-25 15:25:11] [INFO ] Computed 61 invariants in 3 ms
[2024-05-25 15:25:11] [INFO ] Implicit Places using invariants in 131 ms returned []
[2024-05-25 15:25:11] [INFO ] Invariant cache hit.
[2024-05-25 15:25:11] [INFO ] Implicit Places using invariants and state equation in 277 ms returned []
Implicit Place search using SMT with State Equation took 430 ms to find 0 implicit places.
[2024-05-25 15:25:11] [INFO ] Invariant cache hit.
[2024-05-25 15:25:11] [INFO ] Dead Transitions using invariants and state equation in 139 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 303/317 places, 278/292 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 600 ms. Remains : 303/317 places, 278/292 transitions.
Stuttering acceptance computed with spot in 179 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-07-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s25 1) (EQ s172 1) (EQ s241 1)), p2:(EQ s213 1), p1:(EQ s73 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 86 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-07-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-07-LTLFireability-14 finished in 804 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(F(p0))&&G(p1)))))'
Support contains 2 out of 317 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 317/317 places, 292/292 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 306 transition count 281
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 306 transition count 281
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 305 transition count 280
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 305 transition count 280
Applied a total of 24 rules in 10 ms. Remains 305 /317 variables (removed 12) and now considering 280/292 (removed 12) transitions.
// Phase 1: matrix 280 rows 305 cols
[2024-05-25 15:25:12] [INFO ] Computed 61 invariants in 1 ms
[2024-05-25 15:25:12] [INFO ] Implicit Places using invariants in 113 ms returned []
[2024-05-25 15:25:12] [INFO ] Invariant cache hit.
[2024-05-25 15:25:12] [INFO ] Implicit Places using invariants and state equation in 273 ms returned []
Implicit Place search using SMT with State Equation took 416 ms to find 0 implicit places.
[2024-05-25 15:25:12] [INFO ] Invariant cache hit.
[2024-05-25 15:25:12] [INFO ] Dead Transitions using invariants and state equation in 182 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 305/317 places, 280/292 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 610 ms. Remains : 305/317 places, 280/292 transitions.
Stuttering acceptance computed with spot in 195 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-07-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 4}], [{ cond=(AND p1 p0), acceptance={0} source=1 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 4}], [{ cond=p1, acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 3}]], initial=5, aps=[p1:(EQ s248 1), p0:(EQ s214 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, 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 0 ms.
FORMULA BusinessProcesses-PT-07-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-07-LTLFireability-15 finished in 822 ms.
All properties solved by simple procedures.
Total runtime 95337 ms.

BK_STOP 1716650713141

--------------------
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-07"
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-07, 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-171620414800313"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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