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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 532K
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K 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.4K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 11 16:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 129K Apr 11 16:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Apr 11 16:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Apr 11 16:35 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 85K 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-05-LTLFireability-00
FORMULA_NAME BusinessProcesses-PT-05-LTLFireability-01
FORMULA_NAME BusinessProcesses-PT-05-LTLFireability-02
FORMULA_NAME BusinessProcesses-PT-05-LTLFireability-03
FORMULA_NAME BusinessProcesses-PT-05-LTLFireability-04
FORMULA_NAME BusinessProcesses-PT-05-LTLFireability-05
FORMULA_NAME BusinessProcesses-PT-05-LTLFireability-06
FORMULA_NAME BusinessProcesses-PT-05-LTLFireability-07
FORMULA_NAME BusinessProcesses-PT-05-LTLFireability-08
FORMULA_NAME BusinessProcesses-PT-05-LTLFireability-09
FORMULA_NAME BusinessProcesses-PT-05-LTLFireability-10
FORMULA_NAME BusinessProcesses-PT-05-LTLFireability-11
FORMULA_NAME BusinessProcesses-PT-05-LTLFireability-12
FORMULA_NAME BusinessProcesses-PT-05-LTLFireability-13
FORMULA_NAME BusinessProcesses-PT-05-LTLFireability-14
FORMULA_NAME BusinessProcesses-PT-05-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716650427470

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-05
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-25 15:20:29] [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:20:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 15:20:29] [INFO ] Load time of PNML (sax parser for PT used): 67 ms
[2024-05-25 15:20:29] [INFO ] Transformed 368 places.
[2024-05-25 15:20:29] [INFO ] Transformed 319 transitions.
[2024-05-25 15:20:29] [INFO ] Found NUPN structural information;
[2024-05-25 15:20:29] [INFO ] Parsed PT model containing 368 places and 319 transitions and 854 arcs in 134 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 1 transitions.
FORMULA BusinessProcesses-PT-05-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-05-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-05-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 367 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 367/367 places, 318/318 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 365 transition count 318
Discarding 51 places :
Symmetric choice reduction at 1 with 51 rule applications. Total rules 53 place count 314 transition count 267
Iterating global reduction 1 with 51 rules applied. Total rules applied 104 place count 314 transition count 267
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 105 place count 314 transition count 266
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 135 place count 284 transition count 236
Iterating global reduction 2 with 30 rules applied. Total rules applied 165 place count 284 transition count 236
Applied a total of 165 rules in 66 ms. Remains 284 /367 variables (removed 83) and now considering 236/318 (removed 82) transitions.
// Phase 1: matrix 236 rows 284 cols
[2024-05-25 15:20:29] [INFO ] Computed 55 invariants in 19 ms
[2024-05-25 15:20:29] [INFO ] Implicit Places using invariants in 255 ms returned []
[2024-05-25 15:20:29] [INFO ] Invariant cache hit.
[2024-05-25 15:20:30] [INFO ] Implicit Places using invariants and state equation in 280 ms returned []
Implicit Place search using SMT with State Equation took 558 ms to find 0 implicit places.
[2024-05-25 15:20:30] [INFO ] Invariant cache hit.
[2024-05-25 15:20:30] [INFO ] Dead Transitions using invariants and state equation in 162 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 284/367 places, 236/318 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 790 ms. Remains : 284/367 places, 236/318 transitions.
Support contains 33 out of 284 places after structural reductions.
[2024-05-25 15:20:30] [INFO ] Flatten gal took : 51 ms
[2024-05-25 15:20:30] [INFO ] Flatten gal took : 22 ms
[2024-05-25 15:20:30] [INFO ] Input system was already deterministic with 236 transitions.
Support contains 30 out of 284 places (down from 33) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 95 resets, run finished after 350 ms. (steps per millisecond=28 ) properties (out of 27) seen :10
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 17) seen :0
Running SMT prover for 17 properties.
[2024-05-25 15:20:30] [INFO ] Invariant cache hit.
[2024-05-25 15:20:31] [INFO ] [Real]Absence check using 55 positive place invariants in 14 ms returned sat
[2024-05-25 15:20:31] [INFO ] After 189ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:16
[2024-05-25 15:20:31] [INFO ] [Nat]Absence check using 55 positive place invariants in 11 ms returned sat
[2024-05-25 15:20:31] [INFO ] After 241ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :16
[2024-05-25 15:20:31] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 6 ms to minimize.
[2024-05-25 15:20:31] [INFO ] Deduced a trap composed of 30 places in 84 ms of which 1 ms to minimize.
[2024-05-25 15:20:31] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
[2024-05-25 15:20:31] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 2 ms to minimize.
[2024-05-25 15:20:31] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 1 ms to minimize.
[2024-05-25 15:20:31] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2024-05-25 15:20:32] [INFO ] Deduced a trap composed of 31 places in 46 ms of which 1 ms to minimize.
[2024-05-25 15:20:32] [INFO ] Deduced a trap composed of 58 places in 44 ms of which 0 ms to minimize.
[2024-05-25 15:20:32] [INFO ] Deduced a trap composed of 56 places in 42 ms of which 0 ms to minimize.
[2024-05-25 15:20:32] [INFO ] Deduced a trap composed of 37 places in 44 ms of which 1 ms to minimize.
[2024-05-25 15:20:32] [INFO ] Deduced a trap composed of 40 places in 44 ms of which 0 ms to minimize.
[2024-05-25 15:20:32] [INFO ] Deduced a trap composed of 65 places in 59 ms of which 0 ms to minimize.
[2024-05-25 15:20:32] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 756 ms
[2024-05-25 15:20:32] [INFO ] Deduced a trap composed of 12 places in 77 ms of which 1 ms to minimize.
[2024-05-25 15:20:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 106 ms
[2024-05-25 15:20:32] [INFO ] Deduced a trap composed of 29 places in 70 ms of which 0 ms to minimize.
[2024-05-25 15:20:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 97 ms
[2024-05-25 15:20:32] [INFO ] Deduced a trap composed of 44 places in 81 ms of which 1 ms to minimize.
[2024-05-25 15:20:33] [INFO ] Deduced a trap composed of 33 places in 72 ms of which 0 ms to minimize.
[2024-05-25 15:20:33] [INFO ] Deduced a trap composed of 37 places in 69 ms of which 1 ms to minimize.
[2024-05-25 15:20:33] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 305 ms
[2024-05-25 15:20:33] [INFO ] After 1864ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :16
Attempting to minimize the solution found.
Minimization took 189 ms.
[2024-05-25 15:20:33] [INFO ] After 2251ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :16
Fused 17 Parikh solutions to 13 different solutions.
Finished Parikh walk after 171 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=85 )
Parikh walk visited 16 properties in 48 ms.
FORMULA BusinessProcesses-PT-05-LTLFireability-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
Computed a total of 278 stabilizing places and 228 stable transitions
Graph (complete) has 596 edges and 284 vertex of which 283 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.22 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(p1))))'
Support contains 2 out of 284 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 284/284 places, 236/236 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 271 transition count 223
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 271 transition count 223
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 28 place count 269 transition count 221
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 269 transition count 221
Applied a total of 30 rules in 56 ms. Remains 269 /284 variables (removed 15) and now considering 221/236 (removed 15) transitions.
// Phase 1: matrix 221 rows 269 cols
[2024-05-25 15:20:34] [INFO ] Computed 55 invariants in 6 ms
[2024-05-25 15:20:34] [INFO ] Implicit Places using invariants in 127 ms returned []
[2024-05-25 15:20:34] [INFO ] Invariant cache hit.
[2024-05-25 15:20:34] [INFO ] Implicit Places using invariants and state equation in 281 ms returned []
Implicit Place search using SMT with State Equation took 411 ms to find 0 implicit places.
[2024-05-25 15:20:34] [INFO ] Invariant cache hit.
[2024-05-25 15:20:34] [INFO ] Dead Transitions using invariants and state equation in 130 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 269/284 places, 221/236 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 598 ms. Remains : 269/284 places, 221/236 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 365 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-05-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s232 1), p0:(EQ s142 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1049 reset in 451 ms.
Stack based approach found an accepted trace after 794 steps with 9 reset with depth 6 and stack size 6 in 3 ms.
FORMULA BusinessProcesses-PT-05-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property BusinessProcesses-PT-05-LTLFireability-00 finished in 1513 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))&&G(p1))))'
Support contains 2 out of 284 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 284/284 places, 236/236 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 271 transition count 223
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 271 transition count 223
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 28 place count 269 transition count 221
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 269 transition count 221
Applied a total of 30 rules in 44 ms. Remains 269 /284 variables (removed 15) and now considering 221/236 (removed 15) transitions.
// Phase 1: matrix 221 rows 269 cols
[2024-05-25 15:20:35] [INFO ] Computed 55 invariants in 5 ms
[2024-05-25 15:20:35] [INFO ] Implicit Places using invariants in 141 ms returned []
[2024-05-25 15:20:35] [INFO ] Invariant cache hit.
[2024-05-25 15:20:35] [INFO ] Implicit Places using invariants and state equation in 232 ms returned []
Implicit Place search using SMT with State Equation took 377 ms to find 0 implicit places.
[2024-05-25 15:20:35] [INFO ] Invariant cache hit.
[2024-05-25 15:20:36] [INFO ] Dead Transitions using invariants and state equation in 134 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 269/284 places, 221/236 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 561 ms. Remains : 269/284 places, 221/236 transitions.
Stuttering acceptance computed with spot in 209 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : BusinessProcesses-PT-05-LTLFireability-01 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}]], initial=3, aps=[p1:(EQ s167 1), p0:(EQ s179 1)], 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][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-05-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-05-LTLFireability-01 finished in 803 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 2 out of 284 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 284/284 places, 236/236 transitions.
Graph (trivial) has 147 edges and 284 vertex of which 6 / 284 are part of one of the 1 SCC in 4 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 590 edges and 279 vertex of which 278 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 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 41 place count 277 transition count 189
Reduce places removed 39 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 40 rules applied. Total rules applied 81 place count 238 transition count 188
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 82 place count 237 transition count 188
Performed 54 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 54 Pre rules applied. Total rules applied 82 place count 237 transition count 134
Deduced a syphon composed of 54 places in 1 ms
Ensure Unique test removed 13 places
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 3 with 121 rules applied. Total rules applied 203 place count 170 transition count 134
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 216 place count 157 transition count 121
Ensure Unique test removed 1 places
Iterating global reduction 3 with 14 rules applied. Total rules applied 230 place count 156 transition count 121
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 230 place count 156 transition count 120
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 232 place count 155 transition count 120
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 2 places
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 3 with 142 rules applied. Total rules applied 374 place count 83 transition count 50
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 375 place count 82 transition count 49
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 376 place count 81 transition count 49
Applied a total of 376 rules in 72 ms. Remains 81 /284 variables (removed 203) and now considering 49/236 (removed 187) transitions.
// Phase 1: matrix 49 rows 81 cols
[2024-05-25 15:20:36] [INFO ] Computed 38 invariants in 1 ms
[2024-05-25 15:20:36] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-05-25 15:20:36] [INFO ] Invariant cache hit.
[2024-05-25 15:20:36] [INFO ] Implicit Places using invariants and state equation in 103 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 9, 10, 11, 12, 13, 14, 15, 16, 18, 20, 22, 24, 26, 28, 30, 32, 34, 36, 38, 40, 42, 44, 46, 48, 50, 52, 54, 56, 58, 60]
Discarding 38 places :
Implicit Place search using SMT with State Equation took 173 ms to find 38 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 43/284 places, 49/236 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 43 transition count 42
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 36 transition count 42
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 19 place count 31 transition count 37
Iterating global reduction 2 with 5 rules applied. Total rules applied 24 place count 31 transition count 37
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 3 rules applied. Total rules applied 27 place count 31 transition count 34
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 30 place count 28 transition count 34
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 40 place count 23 transition count 29
Applied a total of 40 rules in 9 ms. Remains 23 /43 variables (removed 20) and now considering 29/49 (removed 20) transitions.
// Phase 1: matrix 29 rows 23 cols
[2024-05-25 15:20:36] [INFO ] Computed 0 invariants in 7 ms
[2024-05-25 15:20:36] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-25 15:20:36] [INFO ] Invariant cache hit.
[2024-05-25 15:20:36] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 23/284 places, 29/236 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 325 ms. Remains : 23/284 places, 29/236 transitions.
Stuttering acceptance computed with spot in 42 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-05-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s0 0), p1:(EQ s20 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 850 steps with 211 reset in 3 ms.
FORMULA BusinessProcesses-PT-05-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-05-LTLFireability-02 finished in 387 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 284 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 284/284 places, 236/236 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 269 transition count 221
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 269 transition count 221
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 32 place count 267 transition count 219
Iterating global reduction 0 with 2 rules applied. Total rules applied 34 place count 267 transition count 219
Applied a total of 34 rules in 18 ms. Remains 267 /284 variables (removed 17) and now considering 219/236 (removed 17) transitions.
// Phase 1: matrix 219 rows 267 cols
[2024-05-25 15:20:36] [INFO ] Computed 55 invariants in 3 ms
[2024-05-25 15:20:36] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-05-25 15:20:36] [INFO ] Invariant cache hit.
[2024-05-25 15:20:37] [INFO ] Implicit Places using invariants and state equation in 237 ms returned []
Implicit Place search using SMT with State Equation took 339 ms to find 0 implicit places.
[2024-05-25 15:20:37] [INFO ] Invariant cache hit.
[2024-05-25 15:20:37] [INFO ] Dead Transitions using invariants and state equation in 139 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 267/284 places, 219/236 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 498 ms. Remains : 267/284 places, 219/236 transitions.
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-05-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 s20 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 277 ms.
Product exploration explored 100000 steps with 50000 reset in 294 ms.
Computed a total of 261 stabilizing places and 211 stable transitions
Graph (complete) has 574 edges and 267 vertex of which 266 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Computed a total of 261 stabilizing places and 211 stable transitions
Detected a total of 261/267 stabilizing places and 211/219 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 15 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-05-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-05-LTLFireability-03 finished in 1203 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(F(p1)))))'
Support contains 3 out of 284 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 284/284 places, 236/236 transitions.
Graph (trivial) has 147 edges and 284 vertex of which 6 / 284 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 590 edges and 279 vertex of which 278 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 41 rules applied. Total rules applied 43 place count 277 transition count 187
Reduce places removed 41 places and 0 transitions.
Iterating post reduction 1 with 41 rules applied. Total rules applied 84 place count 236 transition count 187
Performed 53 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 53 Pre rules applied. Total rules applied 84 place count 236 transition count 134
Deduced a syphon composed of 53 places in 0 ms
Ensure Unique test removed 13 places
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 2 with 119 rules applied. Total rules applied 203 place count 170 transition count 134
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 215 place count 158 transition count 122
Ensure Unique test removed 1 places
Iterating global reduction 2 with 13 rules applied. Total rules applied 228 place count 157 transition count 122
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 2 places
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 372 place count 84 transition count 51
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 373 place count 83 transition count 50
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 374 place count 82 transition count 50
Applied a total of 374 rules in 22 ms. Remains 82 /284 variables (removed 202) and now considering 50/236 (removed 186) transitions.
// Phase 1: matrix 50 rows 82 cols
[2024-05-25 15:20:37] [INFO ] Computed 38 invariants in 0 ms
[2024-05-25 15:20:37] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-25 15:20:37] [INFO ] Invariant cache hit.
[2024-05-25 15:20:38] [INFO ] Implicit Places using invariants and state equation in 85 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 59, 61, 63]
Discarding 19 places :
Implicit Place search using SMT with State Equation took 139 ms to find 19 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 63/284 places, 50/236 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 1 place count 63 transition count 49
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 62 transition count 49
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 61 transition count 48
Applied a total of 4 rules in 5 ms. Remains 61 /63 variables (removed 2) and now considering 48/50 (removed 2) transitions.
// Phase 1: matrix 48 rows 61 cols
[2024-05-25 15:20:38] [INFO ] Computed 19 invariants in 2 ms
[2024-05-25 15:20:38] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-25 15:20:38] [INFO ] Invariant cache hit.
[2024-05-25 15:20:38] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 61/284 places, 48/236 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 261 ms. Remains : 61/284 places, 48/236 transitions.
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-05-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s11 1), p1:(AND (EQ s40 0) (EQ s8 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-05-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-05-LTLFireability-04 finished in 355 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X((p1||G(p2)))))'
Support contains 3 out of 284 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 284/284 places, 236/236 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 272 transition count 224
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 272 transition count 224
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 26 place count 270 transition count 222
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 270 transition count 222
Applied a total of 28 rules in 11 ms. Remains 270 /284 variables (removed 14) and now considering 222/236 (removed 14) transitions.
// Phase 1: matrix 222 rows 270 cols
[2024-05-25 15:20:38] [INFO ] Computed 55 invariants in 2 ms
[2024-05-25 15:20:38] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-05-25 15:20:38] [INFO ] Invariant cache hit.
[2024-05-25 15:20:38] [INFO ] Implicit Places using invariants and state equation in 174 ms returned []
Implicit Place search using SMT with State Equation took 258 ms to find 0 implicit places.
[2024-05-25 15:20:38] [INFO ] Invariant cache hit.
[2024-05-25 15:20:38] [INFO ] Dead Transitions using invariants and state equation in 141 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 270/284 places, 222/236 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 410 ms. Remains : 270/284 places, 222/236 transitions.
Stuttering acceptance computed with spot in 207 ms :[true, (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-05-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={} source=2 dest: 0}, { cond=p2, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=4 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=4 dest: 5}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=4 dest: 6}], [{ cond=(NOT p0), acceptance={} source=5 dest: 0}, { cond=p0, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=6 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={} source=6 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=6 dest: 5}, { cond=(AND p0 p2), acceptance={} source=6 dest: 6}]], initial=1, aps=[p0:(EQ s223 0), p2:(EQ s254 1), p1:(EQ s151 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, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 279 ms.
Product exploration explored 100000 steps with 50000 reset in 280 ms.
Computed a total of 264 stabilizing places and 214 stable transitions
Graph (complete) has 579 edges and 270 vertex of which 269 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 264 stabilizing places and 214 stable transitions
Detected a total of 264/270 stabilizing places and 214/222 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p1) p2))), true, (X (X p0)), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p2))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 17 factoid took 31 ms. Reduced automaton from 7 states, 17 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-05-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-05-LTLFireability-07 finished in 1237 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||(p1&&G(p2))))))'
Support contains 3 out of 284 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 284/284 places, 236/236 transitions.
Graph (trivial) has 145 edges and 284 vertex of which 6 / 284 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 590 edges and 279 vertex of which 278 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 41 place count 277 transition count 189
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 1 with 39 rules applied. Total rules applied 80 place count 238 transition count 189
Performed 52 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 52 Pre rules applied. Total rules applied 80 place count 238 transition count 137
Deduced a syphon composed of 52 places in 0 ms
Ensure Unique test removed 12 places
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 2 with 116 rules applied. Total rules applied 196 place count 174 transition count 137
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 209 place count 161 transition count 124
Ensure Unique test removed 1 places
Iterating global reduction 2 with 14 rules applied. Total rules applied 223 place count 160 transition count 124
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 223 place count 160 transition count 123
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 225 place count 159 transition count 123
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: 71
Deduced a syphon composed of 71 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 369 place count 86 transition count 52
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 370 place count 85 transition count 51
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 371 place count 84 transition count 51
Applied a total of 371 rules in 33 ms. Remains 84 /284 variables (removed 200) and now considering 51/236 (removed 185) transitions.
// Phase 1: matrix 51 rows 84 cols
[2024-05-25 15:20:39] [INFO ] Computed 39 invariants in 0 ms
[2024-05-25 15:20:39] [INFO ] Implicit Places using invariants in 68 ms returned [12]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 70 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 83/284 places, 51/236 transitions.
Applied a total of 0 rules in 3 ms. Remains 83 /83 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 107 ms. Remains : 83/284 places, 51/236 transitions.
Stuttering acceptance computed with spot in 127 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : BusinessProcesses-PT-05-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2))), acceptance={} source=0 dest: 1}], [{ cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2))), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(EQ s60 0), p0:(EQ s7 0), p2:(NEQ s75 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 15312 reset in 243 ms.
Product exploration explored 100000 steps with 15421 reset in 282 ms.
Computed a total of 83 stabilizing places and 50 stable transitions
Computed a total of 83 stabilizing places and 50 stable transitions
Detected a total of 83/83 stabilizing places and 50/51 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND p1 p0 p2), (X (NOT (AND p1 (NOT p0) p2))), (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2)))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 770 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 164 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 1821 resets, run finished after 183 ms. (steps per millisecond=54 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 646 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10000 steps, including 727 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 51 rows 83 cols
[2024-05-25 15:20:41] [INFO ] Computed 38 invariants in 1 ms
[2024-05-25 15:20:41] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 15:20:41] [INFO ] [Nat]Absence check using 38 positive place invariants in 8 ms returned sat
[2024-05-25 15:20:41] [INFO ] After 81ms 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 p1 p0 p2), (X (NOT (AND p1 (NOT p0) p2))), (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2)))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (G (NOT (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : [(F (AND (NOT p0) p2)), (F (OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2)))), (F (AND p1 (NOT p0) p2))]
Knowledge based reduction with 11 factoid took 1587 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 131 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 83 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 83/83 places, 51/51 transitions.
Applied a total of 0 rules in 9 ms. Remains 83 /83 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2024-05-25 15:20:43] [INFO ] Invariant cache hit.
[2024-05-25 15:20:43] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-05-25 15:20:43] [INFO ] Invariant cache hit.
[2024-05-25 15:20:43] [INFO ] Implicit Places using invariants and state equation in 109 ms returned [0, 1, 2, 3, 4, 5, 6, 9, 10, 11, 12, 13, 14, 15, 16, 17, 19, 21, 23, 25, 27, 29, 31, 33, 35, 37, 39, 41, 43, 45, 47, 49, 51, 53, 55, 61, 63]
Discarding 37 places :
Implicit Place search using SMT with State Equation took 199 ms to find 37 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 46/83 places, 51/51 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 46 transition count 44
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 39 transition count 44
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 19 place count 34 transition count 39
Iterating global reduction 2 with 5 rules applied. Total rules applied 24 place count 34 transition count 39
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 3 rules applied. Total rules applied 27 place count 34 transition count 36
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 30 place count 31 transition count 36
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 31 place count 30 transition count 35
Iterating global reduction 4 with 1 rules applied. Total rules applied 32 place count 30 transition count 35
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 42 place count 25 transition count 30
Applied a total of 42 rules in 9 ms. Remains 25 /46 variables (removed 21) and now considering 30/51 (removed 21) transitions.
// Phase 1: matrix 30 rows 25 cols
[2024-05-25 15:20:43] [INFO ] Computed 1 invariants in 0 ms
[2024-05-25 15:20:43] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-05-25 15:20:43] [INFO ] Invariant cache hit.
[2024-05-25 15:20:43] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 25/83 places, 30/51 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 281 ms. Remains : 25/83 places, 30/51 transitions.
Computed a total of 25 stabilizing places and 29 stable transitions
Graph (complete) has 66 edges and 25 vertex of which 23 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Computed a total of 25 stabilizing places and 29 stable transitions
Detected a total of 25/25 stabilizing places and 29/30 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 196 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 8309 steps, including 1608 resets, run visited all 1 properties in 10 ms. (steps per millisecond=830 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 177 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 87 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering criterion allowed to conclude after 22749 steps with 3713 reset in 15 ms.
FORMULA BusinessProcesses-PT-05-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-05-LTLFireability-09 finished in 5042 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(G(p1))&&p0))))'
Support contains 4 out of 284 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 284/284 places, 236/236 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 270 transition count 222
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 270 transition count 222
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 269 transition count 221
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 269 transition count 221
Applied a total of 30 rules in 12 ms. Remains 269 /284 variables (removed 15) and now considering 221/236 (removed 15) transitions.
// Phase 1: matrix 221 rows 269 cols
[2024-05-25 15:20:44] [INFO ] Computed 55 invariants in 2 ms
[2024-05-25 15:20:44] [INFO ] Implicit Places using invariants in 99 ms returned []
[2024-05-25 15:20:44] [INFO ] Invariant cache hit.
[2024-05-25 15:20:44] [INFO ] Implicit Places using invariants and state equation in 229 ms returned []
Implicit Place search using SMT with State Equation took 330 ms to find 0 implicit places.
[2024-05-25 15:20:44] [INFO ] Invariant cache hit.
[2024-05-25 15:20:44] [INFO ] Dead Transitions using invariants and state equation in 139 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 269/284 places, 221/236 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 482 ms. Remains : 269/284 places, 221/236 transitions.
Stuttering acceptance computed with spot in 166 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-05-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s22 1) (EQ s143 1) (EQ s233 1)), p1:(NEQ s26 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-05-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-05-LTLFireability-10 finished in 667 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 284 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 284/284 places, 236/236 transitions.
Graph (trivial) has 148 edges and 284 vertex of which 6 / 284 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 590 edges and 279 vertex of which 278 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 42 place count 277 transition count 188
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 1 with 40 rules applied. Total rules applied 82 place count 237 transition count 188
Performed 53 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 53 Pre rules applied. Total rules applied 82 place count 237 transition count 135
Deduced a syphon composed of 53 places in 0 ms
Ensure Unique test removed 13 places
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 2 with 119 rules applied. Total rules applied 201 place count 171 transition count 135
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 214 place count 158 transition count 122
Ensure Unique test removed 1 places
Iterating global reduction 2 with 14 rules applied. Total rules applied 228 place count 157 transition count 122
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 228 place count 157 transition count 121
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 230 place count 156 transition count 121
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 2 with 146 rules applied. Total rules applied 376 place count 82 transition count 49
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 377 place count 81 transition count 48
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 378 place count 80 transition count 48
Applied a total of 378 rules in 25 ms. Remains 80 /284 variables (removed 204) and now considering 48/236 (removed 188) transitions.
// Phase 1: matrix 48 rows 80 cols
[2024-05-25 15:20:45] [INFO ] Computed 38 invariants in 0 ms
[2024-05-25 15:20:45] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-25 15:20:45] [INFO ] Invariant cache hit.
[2024-05-25 15:20:45] [INFO ] Implicit Places using invariants and state equation in 101 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 17, 19, 21, 23, 25, 27, 29, 31, 37, 39, 41, 43, 45, 47, 49, 51, 53, 55, 57, 59, 61]
Discarding 37 places :
Implicit Place search using SMT with State Equation took 165 ms to find 37 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 43/284 places, 48/236 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 43 transition count 41
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 36 transition count 41
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 19 place count 31 transition count 36
Iterating global reduction 2 with 5 rules applied. Total rules applied 24 place count 31 transition count 36
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 2 rules applied. Total rules applied 26 place count 31 transition count 34
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 28 place count 29 transition count 34
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 29 place count 28 transition count 33
Iterating global reduction 4 with 1 rules applied. Total rules applied 30 place count 28 transition count 33
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 42 place count 22 transition count 27
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 43 place count 22 transition count 26
Applied a total of 43 rules in 7 ms. Remains 22 /43 variables (removed 21) and now considering 26/48 (removed 22) transitions.
// Phase 1: matrix 26 rows 22 cols
[2024-05-25 15:20:45] [INFO ] Computed 1 invariants in 0 ms
[2024-05-25 15:20:45] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-25 15:20:45] [INFO ] Invariant cache hit.
[2024-05-25 15:20:45] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 22/284 places, 26/236 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 256 ms. Remains : 22/284 places, 26/236 transitions.
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-05-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s11 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-05-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-05-LTLFireability-12 finished in 377 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((p0&&(p1 U p2))))'
Support contains 3 out of 284 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 284/284 places, 236/236 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 270 transition count 222
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 270 transition count 222
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 269 transition count 221
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 269 transition count 221
Applied a total of 30 rules in 15 ms. Remains 269 /284 variables (removed 15) and now considering 221/236 (removed 15) transitions.
// Phase 1: matrix 221 rows 269 cols
[2024-05-25 15:20:45] [INFO ] Computed 55 invariants in 2 ms
[2024-05-25 15:20:45] [INFO ] Implicit Places using invariants in 129 ms returned []
[2024-05-25 15:20:45] [INFO ] Invariant cache hit.
[2024-05-25 15:20:45] [INFO ] Implicit Places using invariants and state equation in 254 ms returned []
Implicit Place search using SMT with State Equation took 386 ms to find 0 implicit places.
[2024-05-25 15:20:45] [INFO ] Invariant cache hit.
[2024-05-25 15:20:46] [INFO ] Dead Transitions using invariants and state equation in 125 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 269/284 places, 221/236 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 527 ms. Remains : 269/284 places, 221/236 transitions.
Stuttering acceptance computed with spot in 174 ms :[(NOT p2), (OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), true]
Running random walk in product with property : BusinessProcesses-PT-05-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 3}], [{ cond=(AND p0 (NOT p2) p1), acceptance={} source=1 dest: 0}, { cond=(OR (NOT p0) (AND (NOT p2) (NOT p1))), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p2:(EQ s227 1), p1:(EQ s257 1), p0:(EQ s158 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-05-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-05-LTLFireability-13 finished in 721 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)))))'
Support contains 1 out of 284 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 284/284 places, 236/236 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 269 transition count 221
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 269 transition count 221
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 32 place count 267 transition count 219
Iterating global reduction 0 with 2 rules applied. Total rules applied 34 place count 267 transition count 219
Applied a total of 34 rules in 23 ms. Remains 267 /284 variables (removed 17) and now considering 219/236 (removed 17) transitions.
// Phase 1: matrix 219 rows 267 cols
[2024-05-25 15:20:46] [INFO ] Computed 55 invariants in 3 ms
[2024-05-25 15:20:46] [INFO ] Implicit Places using invariants in 115 ms returned []
[2024-05-25 15:20:46] [INFO ] Invariant cache hit.
[2024-05-25 15:20:46] [INFO ] Implicit Places using invariants and state equation in 255 ms returned []
Implicit Place search using SMT with State Equation took 372 ms to find 0 implicit places.
[2024-05-25 15:20:46] [INFO ] Invariant cache hit.
[2024-05-25 15:20:46] [INFO ] Dead Transitions using invariants and state equation in 157 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 267/284 places, 219/236 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 554 ms. Remains : 267/284 places, 219/236 transitions.
Stuttering acceptance computed with spot in 207 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-05-LTLFireability-14 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: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(EQ s29 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 97 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-05-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-05-LTLFireability-14 finished in 785 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' '!((p0 U (p1&&G(p2))))'
Support contains 5 out of 284 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 284/284 places, 236/236 transitions.
Graph (trivial) has 145 edges and 284 vertex of which 6 / 284 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 590 edges and 279 vertex of which 278 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 42 place count 277 transition count 188
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 1 with 40 rules applied. Total rules applied 82 place count 237 transition count 188
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 51 Pre rules applied. Total rules applied 82 place count 237 transition count 137
Deduced a syphon composed of 51 places in 0 ms
Ensure Unique test removed 12 places
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 2 with 114 rules applied. Total rules applied 196 place count 174 transition count 137
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 208 place count 162 transition count 125
Iterating global reduction 2 with 12 rules applied. Total rules applied 220 place count 162 transition count 125
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Deduced a syphon composed of 73 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 2 with 148 rules applied. Total rules applied 368 place count 87 transition count 52
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 369 place count 86 transition count 51
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 370 place count 85 transition count 51
Applied a total of 370 rules in 27 ms. Remains 85 /284 variables (removed 199) and now considering 51/236 (removed 185) transitions.
// Phase 1: matrix 51 rows 85 cols
[2024-05-25 15:20:47] [INFO ] Computed 40 invariants in 1 ms
[2024-05-25 15:20:47] [INFO ] Implicit Places using invariants in 57 ms returned [69]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 59 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 84/284 places, 51/236 transitions.
Applied a total of 0 rules in 2 ms. Remains 84 /84 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 90 ms. Remains : 84/284 places, 51/236 transitions.
Stuttering acceptance computed with spot in 187 ms :[(OR (NOT p1) (NOT p2)), true, (NOT p2), (NOT p2)]
Running random walk in product with property : BusinessProcesses-PT-05-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p1) p0) (AND (NOT p2) p0)), acceptance={0} source=0 dest: 0}, { cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0))), acceptance={} source=0 dest: 1}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND p1 p2 p0), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 1}, { cond=p2, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p2) p0), acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND p2 (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND p2 p0), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s4 1), p0:(NEQ s42 1), p2:(AND (EQ s18 1) (EQ s35 1) (EQ s81 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-05-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-05-LTLFireability-15 finished in 295 ms.
All properties solved by simple procedures.
Total runtime 18219 ms.

BK_STOP 1716650447569

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

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