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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 612K
-rw-r--r-- 1 mcc users 9.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 109K 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 41K 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.5K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 17:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 11 16:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 179K Apr 11 16:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Apr 11 16:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K 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.8K Apr 22 14:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 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-06-LTLFireability-00
FORMULA_NAME BusinessProcesses-PT-06-LTLFireability-01
FORMULA_NAME BusinessProcesses-PT-06-LTLFireability-02
FORMULA_NAME BusinessProcesses-PT-06-LTLFireability-03
FORMULA_NAME BusinessProcesses-PT-06-LTLFireability-04
FORMULA_NAME BusinessProcesses-PT-06-LTLFireability-05
FORMULA_NAME BusinessProcesses-PT-06-LTLFireability-06
FORMULA_NAME BusinessProcesses-PT-06-LTLFireability-07
FORMULA_NAME BusinessProcesses-PT-06-LTLFireability-08
FORMULA_NAME BusinessProcesses-PT-06-LTLFireability-09
FORMULA_NAME BusinessProcesses-PT-06-LTLFireability-10
FORMULA_NAME BusinessProcesses-PT-06-LTLFireability-11
FORMULA_NAME BusinessProcesses-PT-06-LTLFireability-12
FORMULA_NAME BusinessProcesses-PT-06-LTLFireability-13
FORMULA_NAME BusinessProcesses-PT-06-LTLFireability-14
FORMULA_NAME BusinessProcesses-PT-06-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716650518901

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-06
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-25 15:22:00] [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:22:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 15:22:00] [INFO ] Load time of PNML (sax parser for PT used): 70 ms
[2024-05-25 15:22:00] [INFO ] Transformed 376 places.
[2024-05-25 15:22:00] [INFO ] Transformed 297 transitions.
[2024-05-25 15:22:00] [INFO ] Found NUPN structural information;
[2024-05-25 15:22:00] [INFO ] Parsed PT model containing 376 places and 297 transitions and 830 arcs in 149 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 2 formulas.
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 1 transitions.
FORMULA BusinessProcesses-PT-06-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-06-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 41 out of 375 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 375/375 places, 296/296 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 373 transition count 296
Discarding 36 places :
Symmetric choice reduction at 1 with 36 rule applications. Total rules 38 place count 337 transition count 260
Iterating global reduction 1 with 36 rules applied. Total rules applied 74 place count 337 transition count 260
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 90 place count 321 transition count 244
Iterating global reduction 1 with 16 rules applied. Total rules applied 106 place count 321 transition count 244
Applied a total of 106 rules in 133 ms. Remains 321 /375 variables (removed 54) and now considering 244/296 (removed 52) transitions.
// Phase 1: matrix 244 rows 321 cols
[2024-05-25 15:22:01] [INFO ] Computed 79 invariants in 35 ms
[2024-05-25 15:22:02] [INFO ] Implicit Places using invariants in 787 ms returned []
[2024-05-25 15:22:02] [INFO ] Invariant cache hit.
[2024-05-25 15:22:03] [INFO ] Implicit Places using invariants and state equation in 632 ms returned []
Implicit Place search using SMT with State Equation took 2139 ms to find 0 implicit places.
[2024-05-25 15:22:03] [INFO ] Invariant cache hit.
[2024-05-25 15:22:03] [INFO ] Dead Transitions using invariants and state equation in 210 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 321/375 places, 244/296 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2497 ms. Remains : 321/375 places, 244/296 transitions.
Support contains 41 out of 321 places after structural reductions.
[2024-05-25 15:22:03] [INFO ] Flatten gal took : 90 ms
[2024-05-25 15:22:03] [INFO ] Flatten gal took : 31 ms
[2024-05-25 15:22:04] [INFO ] Input system was already deterministic with 244 transitions.
Support contains 40 out of 321 places (down from 41) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 102 resets, run finished after 719 ms. (steps per millisecond=13 ) properties (out of 32) seen :25
Incomplete Best-First random walk after 10000 steps, including 19 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 7) seen :4
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-25 15:22:05] [INFO ] Invariant cache hit.
[2024-05-25 15:22:05] [INFO ] [Real]Absence check using 34 positive place invariants in 47 ms returned sat
[2024-05-25 15:22:05] [INFO ] [Real]Absence check using 34 positive and 45 generalized place invariants in 32 ms returned sat
[2024-05-25 15:22:05] [INFO ] After 235ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3
[2024-05-25 15:22:05] [INFO ] Deduced a trap composed of 22 places in 122 ms of which 7 ms to minimize.
[2024-05-25 15:22:05] [INFO ] Deduced a trap composed of 12 places in 83 ms of which 1 ms to minimize.
[2024-05-25 15:22:05] [INFO ] Deduced a trap composed of 18 places in 85 ms of which 1 ms to minimize.
[2024-05-25 15:22:06] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
[2024-05-25 15:22:06] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 457 ms
[2024-05-25 15:22:06] [INFO ] After 777ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-25 15:22:06] [INFO ] After 1123ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-25 15:22:06] [INFO ] [Nat]Absence check using 34 positive place invariants in 18 ms returned sat
[2024-05-25 15:22:06] [INFO ] [Nat]Absence check using 34 positive and 45 generalized place invariants in 24 ms returned sat
[2024-05-25 15:22:06] [INFO ] After 205ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-25 15:22:06] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
[2024-05-25 15:22:06] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 1 ms to minimize.
[2024-05-25 15:22:06] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 0 ms to minimize.
[2024-05-25 15:22:06] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 0 ms to minimize.
[2024-05-25 15:22:06] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 320 ms
[2024-05-25 15:22:06] [INFO ] After 605ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 33 ms.
[2024-05-25 15:22:06] [INFO ] After 834ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 186 steps, including 0 resets, run visited all 2 properties in 4 ms. (steps per millisecond=46 )
Parikh walk visited 3 properties in 17 ms.
FORMULA BusinessProcesses-PT-06-LTLFireability-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 314 stabilizing places and 235 stable transitions
Graph (complete) has 632 edges and 321 vertex of which 320 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.10 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(F(p0))&&(p1||X(p2)))))'
Support contains 5 out of 321 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 321/321 places, 244/244 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 311 transition count 234
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 311 transition count 234
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 309 transition count 232
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 309 transition count 232
Applied a total of 24 rules in 38 ms. Remains 309 /321 variables (removed 12) and now considering 232/244 (removed 12) transitions.
// Phase 1: matrix 232 rows 309 cols
[2024-05-25 15:22:07] [INFO ] Computed 79 invariants in 7 ms
[2024-05-25 15:22:07] [INFO ] Implicit Places using invariants in 131 ms returned []
[2024-05-25 15:22:07] [INFO ] Invariant cache hit.
[2024-05-25 15:22:08] [INFO ] Implicit Places using invariants and state equation in 380 ms returned []
Implicit Place search using SMT with State Equation took 514 ms to find 0 implicit places.
[2024-05-25 15:22:08] [INFO ] Invariant cache hit.
[2024-05-25 15:22:08] [INFO ] Dead Transitions using invariants and state equation in 213 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 309/321 places, 232/244 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 767 ms. Remains : 309/321 places, 232/244 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 437 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : BusinessProcesses-PT-06-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (OR (EQ s116 0) (EQ s200 0) (EQ s294 0)) (EQ s102 0)), p1:(EQ s70 0), p2:(OR (EQ s116 0) (EQ s200 0) (EQ s294 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][false, false, false, false]]
Product exploration explored 100000 steps with 1072 reset in 393 ms.
Product exploration explored 100000 steps with 1081 reset in 315 ms.
Computed a total of 302 stabilizing places and 223 stable transitions
Graph (complete) has 617 edges and 309 vertex of which 308 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Computed a total of 302 stabilizing places and 223 stable transitions
Detected a total of 302/309 stabilizing places and 223/232 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND p0 p1 p2), (X p0), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X p0)), true, (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 434 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 131 ms :[(NOT p0), (NOT p0)]
Finished random walk after 2825 steps, including 29 resets, run visited all 1 properties in 27 ms. (steps per millisecond=104 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1 p2), (X p0), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X p0)), true, (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 9 factoid took 700 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 120 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 152 ms :[(NOT p0), (NOT p0)]
Support contains 4 out of 309 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 : 309/309 places, 232/232 transitions.
Graph (trivial) has 131 edges and 309 vertex of which 6 / 309 are part of one of the 1 SCC in 6 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 611 edges and 304 vertex of which 303 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 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 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 28 place count 302 transition count 198
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 54 place count 276 transition count 198
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 65 Pre rules applied. Total rules applied 54 place count 276 transition count 133
Deduced a syphon composed of 65 places in 1 ms
Ensure Unique test removed 10 places
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 2 with 140 rules applied. Total rules applied 194 place count 201 transition count 133
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 6 ms
Ensure Unique test removed 1 places
Reduce places removed 81 places and 0 transitions.
Iterating global reduction 2 with 161 rules applied. Total rules applied 355 place count 120 transition count 53
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 356 place count 119 transition count 52
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 357 place count 118 transition count 52
Applied a total of 357 rules in 117 ms. Remains 118 /309 variables (removed 191) and now considering 52/232 (removed 180) transitions.
// Phase 1: matrix 52 rows 118 cols
[2024-05-25 15:22:11] [INFO ] Computed 67 invariants in 15 ms
[2024-05-25 15:22:11] [INFO ] Implicit Places using invariants in 188 ms returned [110, 112, 114]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 190 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 115/309 places, 52/232 transitions.
Applied a total of 0 rules in 18 ms. Remains 115 /115 variables (removed 0) and now considering 52/52 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 328 ms. Remains : 115/309 places, 52/232 transitions.
Computed a total of 115 stabilizing places and 51 stable transitions
Computed a total of 115 stabilizing places and 51 stable transitions
Detected a total of 115/115 stabilizing places and 51/52 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 : []
Knowledge based reduction with 4 factoid took 174 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 155 ms :[(NOT p0), (NOT p0)]
Finished random walk after 637 steps, including 117 resets, run visited all 1 properties in 8 ms. (steps per millisecond=79 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 194 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 131 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 128 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 15976 reset in 471 ms.
Product exploration explored 100000 steps with 15953 reset in 432 ms.
Built C files in :
/tmp/ltsmin11458450171480116780
[2024-05-25 15:22:13] [INFO ] Computing symmetric may disable matrix : 52 transitions.
[2024-05-25 15:22:13] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 15:22:13] [INFO ] Computing symmetric may enable matrix : 52 transitions.
[2024-05-25 15:22:13] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 15:22:13] [INFO ] Computing Do-Not-Accords matrix : 52 transitions.
[2024-05-25 15:22:13] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 15:22:13] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11458450171480116780
Running compilation step : cd /tmp/ltsmin11458450171480116780;'/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 447 ms.
Running link step : cd /tmp/ltsmin11458450171480116780;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 62 ms.
Running LTSmin : cd /tmp/ltsmin11458450171480116780;'/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/stateBased18372450583348881078.hoa' '--buchi-type=spotba'
LTSmin run took 1340 ms.
FORMULA BusinessProcesses-PT-06-LTLFireability-02 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property BusinessProcesses-PT-06-LTLFireability-02 finished in 7815 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((X(p0)||(p1 U (p2||G(p1)))))))'
Support contains 5 out of 321 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 321/321 places, 244/244 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 312 transition count 235
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 312 transition count 235
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 311 transition count 234
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 311 transition count 234
Applied a total of 20 rules in 34 ms. Remains 311 /321 variables (removed 10) and now considering 234/244 (removed 10) transitions.
// Phase 1: matrix 234 rows 311 cols
[2024-05-25 15:22:15] [INFO ] Computed 79 invariants in 2 ms
[2024-05-25 15:22:15] [INFO ] Implicit Places using invariants in 201 ms returned []
[2024-05-25 15:22:15] [INFO ] Invariant cache hit.
[2024-05-25 15:22:16] [INFO ] Implicit Places using invariants and state equation in 329 ms returned []
Implicit Place search using SMT with State Equation took 546 ms to find 0 implicit places.
[2024-05-25 15:22:16] [INFO ] Invariant cache hit.
[2024-05-25 15:22:18] [INFO ] Dead Transitions using invariants and state equation in 2063 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 311/321 places, 234/244 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2647 ms. Remains : 311/321 places, 234/244 transitions.
Stuttering acceptance computed with spot in 268 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-06-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 2}], [{ cond=(AND p2 p0), acceptance={} source=1 dest: 0}, { cond=(AND p2 (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=1 dest: 2}], [{ cond=p2, acceptance={} source=2 dest: 0}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=p2, acceptance={} source=3 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 3}]], initial=1, aps=[p2:(AND (NEQ s238 1) (NEQ s273 1)), p1:(NEQ s273 1), p0:(AND (EQ s94 1) (EQ s223 1) (EQ s280 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1041 reset in 357 ms.
Product exploration explored 100000 steps with 1025 reset in 266 ms.
Computed a total of 304 stabilizing places and 225 stable transitions
Graph (complete) has 620 edges and 311 vertex of which 310 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Computed a total of 304 stabilizing places and 225 stable transitions
Detected a total of 304/311 stabilizing places and 225/234 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p2 p1 (NOT p0)), (X p2), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (AND p2 (NOT p0))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND p2 p0))), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) p1 p0))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 21 factoid took 993 ms. Reduced automaton from 4 states, 17 edges and 3 AP (stutter sensitive) to 3 states, 12 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 267 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 101 resets, run finished after 464 ms. (steps per millisecond=21 ) properties (out of 9) seen :6
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 3) seen :2
Running SMT prover for 1 properties.
[2024-05-25 15:22:20] [INFO ] Invariant cache hit.
[2024-05-25 15:22:20] [INFO ] [Real]Absence check using 34 positive place invariants in 9 ms returned sat
[2024-05-25 15:22:20] [INFO ] [Real]Absence check using 34 positive and 45 generalized place invariants in 15 ms returned sat
[2024-05-25 15:22:21] [INFO ] After 314ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p2 p1 (NOT p0)), (X p2), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (AND p2 (NOT p0))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND p2 p0))), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) p1 p0))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND p0 (NOT p2) (NOT p1))))]
False Knowledge obtained : [(F (OR (AND p0 p2) (AND p0 p1))), (F (AND (NOT p0) (NOT p2) p1)), (F (NOT p2)), (F (NOT (AND (NOT p0) p2))), (F (NOT (OR (AND p0 p1) p2))), (F (AND (NOT p0) (NOT p2) (NOT p1))), (F (AND (NOT p2) p1)), (F (AND (NOT p2) (NOT p1)))]
Knowledge based reduction with 22 factoid took 3501 ms. Reduced automaton from 3 states, 12 edges and 3 AP (stutter insensitive) to 2 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 114 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 5 out of 311 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 311/311 places, 234/234 transitions.
Graph (complete) has 620 edges and 311 vertex of which 310 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 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 28 place count 309 transition count 205
Reduce places removed 27 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 29 rules applied. Total rules applied 57 place count 282 transition count 203
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 59 place count 280 transition count 203
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 65 Pre rules applied. Total rules applied 59 place count 280 transition count 138
Deduced a syphon composed of 65 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 3 with 140 rules applied. Total rules applied 199 place count 205 transition count 138
Performed 87 Post agglomeration using F-continuation condition.Transition count delta: 87
Deduced a syphon composed of 87 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 3 with 182 rules applied. Total rules applied 381 place count 110 transition count 51
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 382 place count 110 transition count 50
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 383 place count 109 transition count 49
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 384 place count 108 transition count 49
Applied a total of 384 rules in 68 ms. Remains 108 /311 variables (removed 203) and now considering 49/234 (removed 185) transitions.
// Phase 1: matrix 49 rows 108 cols
[2024-05-25 15:22:24] [INFO ] Computed 60 invariants in 2 ms
[2024-05-25 15:22:25] [INFO ] Implicit Places using invariants in 118 ms returned []
[2024-05-25 15:22:25] [INFO ] Invariant cache hit.
[2024-05-25 15:22:25] [INFO ] Implicit Places using invariants and state equation in 196 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 25, 34, 35, 37, 39, 41, 43, 45, 47, 49, 51, 53, 55, 57, 59, 61, 63, 65, 67, 69, 73, 74, 76]
Discarding 31 places :
Implicit Place search using SMT with State Equation took 318 ms to find 31 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 77/311 places, 49/234 transitions.
Graph (complete) has 174 edges and 77 vertex of which 69 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 69 transition count 39
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 19 place count 60 transition count 39
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Ensure Unique test removed 7 places
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 23 rules applied. Total rules applied 42 place count 45 transition count 31
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 44 place count 44 transition count 30
Applied a total of 44 rules in 9 ms. Remains 44 /77 variables (removed 33) and now considering 30/49 (removed 19) transitions.
// Phase 1: matrix 30 rows 44 cols
[2024-05-25 15:22:25] [INFO ] Computed 15 invariants in 1 ms
[2024-05-25 15:22:25] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-25 15:22:25] [INFO ] Invariant cache hit.
[2024-05-25 15:22:25] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 157 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 44/311 places, 30/234 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 553 ms. Remains : 44/311 places, 30/234 transitions.
Computed a total of 41 stabilizing places and 26 stable transitions
Graph (complete) has 134 edges and 44 vertex of which 43 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 41 stabilizing places and 26 stable transitions
Detected a total of 41/44 stabilizing places and 26/30 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p2 p1 (NOT p0)), (X (OR p2 p1)), (X (NOT (OR (AND p0 p2) (AND p0 p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (OR (AND (NOT p0) p2) (AND (NOT p0) p1))), (X (X (OR p2 p1))), (X (X (NOT (OR (AND p0 p2) (AND p0 p1))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (OR (AND (NOT p0) p2) (AND (NOT p0) p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 370 ms. Reduced automaton from 2 states, 5 edges and 3 AP (stutter insensitive) to 2 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 148 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Finished random walk after 863 steps, including 139 resets, run visited all 4 properties in 3 ms. (steps per millisecond=287 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p2 p1 (NOT p0)), (X (OR p2 p1)), (X (NOT (OR (AND p0 p2) (AND p0 p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (OR (AND (NOT p0) p2) (AND (NOT p0) p1))), (X (X (OR p2 p1))), (X (X (NOT (OR (AND p0 p2) (AND p0 p1))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (OR (AND (NOT p0) p2) (AND (NOT p0) p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (OR (AND p1 (NOT p0)) (AND p2 (NOT p0))))), (F (NOT (OR p1 p2))), (F (OR (AND p1 p0) (AND p2 p0))), (F (AND (NOT p1) (NOT p2)))]
Knowledge based reduction with 11 factoid took 702 ms. Reduced automaton from 2 states, 5 edges and 3 AP (stutter insensitive) to 2 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 149 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 148 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 144 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 16043 reset in 154 ms.
Product exploration explored 100000 steps with 16040 reset in 163 ms.
Built C files in :
/tmp/ltsmin10249285367640330783
[2024-05-25 15:22:27] [INFO ] Computing symmetric may disable matrix : 30 transitions.
[2024-05-25 15:22:27] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 15:22:27] [INFO ] Computing symmetric may enable matrix : 30 transitions.
[2024-05-25 15:22:27] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 15:22:27] [INFO ] Computing Do-Not-Accords matrix : 30 transitions.
[2024-05-25 15:22:27] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 15:22:27] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10249285367640330783
Running compilation step : cd /tmp/ltsmin10249285367640330783;'/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 205 ms.
Running link step : cd /tmp/ltsmin10249285367640330783;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin10249285367640330783;'/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/stateBased17892628866279831749.hoa' '--buchi-type=spotba'
LTSmin run took 1655 ms.
FORMULA BusinessProcesses-PT-06-LTLFireability-03 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property BusinessProcesses-PT-06-LTLFireability-03 finished in 13974 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 3 out of 321 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 321/321 places, 244/244 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 311 transition count 234
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 311 transition count 234
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 309 transition count 232
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 309 transition count 232
Applied a total of 24 rules in 14 ms. Remains 309 /321 variables (removed 12) and now considering 232/244 (removed 12) transitions.
// Phase 1: matrix 232 rows 309 cols
[2024-05-25 15:22:29] [INFO ] Computed 79 invariants in 6 ms
[2024-05-25 15:22:29] [INFO ] Implicit Places using invariants in 202 ms returned []
[2024-05-25 15:22:29] [INFO ] Invariant cache hit.
[2024-05-25 15:22:29] [INFO ] Implicit Places using invariants and state equation in 303 ms returned []
Implicit Place search using SMT with State Equation took 519 ms to find 0 implicit places.
[2024-05-25 15:22:29] [INFO ] Invariant cache hit.
[2024-05-25 15:22:30] [INFO ] Dead Transitions using invariants and state equation in 187 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 309/321 places, 232/244 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 721 ms. Remains : 309/321 places, 232/244 transitions.
Stuttering acceptance computed with spot in 120 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-06-LTLFireability-04 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:(OR (EQ s149 0) (EQ s248 0) (EQ s278 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 243 ms.
Product exploration explored 100000 steps with 33333 reset in 228 ms.
Computed a total of 302 stabilizing places and 223 stable transitions
Graph (complete) has 617 edges and 309 vertex of which 308 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 302 stabilizing places and 223 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 23 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-06-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-06-LTLFireability-04 finished in 1364 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((F(p0)||X(p1)))))'
Support contains 2 out of 321 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 321/321 places, 244/244 transitions.
Graph (trivial) has 140 edges and 321 vertex of which 6 / 321 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 626 edges and 316 vertex of which 315 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 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 314 transition count 204
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 66 place count 282 transition count 204
Performed 66 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 66 Pre rules applied. Total rules applied 66 place count 282 transition count 138
Deduced a syphon composed of 66 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 2 with 142 rules applied. Total rules applied 208 place count 206 transition count 138
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 216 place count 198 transition count 130
Iterating global reduction 2 with 8 rules applied. Total rules applied 224 place count 198 transition count 130
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 2 with 168 rules applied. Total rules applied 392 place count 110 transition count 50
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 393 place count 109 transition count 49
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 394 place count 108 transition count 49
Applied a total of 394 rules in 36 ms. Remains 108 /321 variables (removed 213) and now considering 49/244 (removed 195) transitions.
// Phase 1: matrix 49 rows 108 cols
[2024-05-25 15:22:30] [INFO ] Computed 60 invariants in 2 ms
[2024-05-25 15:22:30] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-05-25 15:22:30] [INFO ] Invariant cache hit.
[2024-05-25 15:22:31] [INFO ] Implicit Places using invariants and state equation in 211 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 10, 12, 14, 16, 18, 20, 22, 24, 26, 35, 36, 38, 40, 42, 44, 46, 48, 50, 52, 54, 56, 58, 60, 62, 64, 66, 68, 70, 72, 74, 76]
Discarding 39 places :
Implicit Place search using SMT with State Equation took 310 ms to find 39 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 69/321 places, 49/244 transitions.
Graph (complete) has 141 edges and 69 vertex of which 61 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.0 ms
Discarding 8 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 61 transition count 38
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 51 transition count 38
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Ensure Unique test removed 7 places
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 23 rules applied. Total rules applied 44 place count 36 transition count 30
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 46 place count 35 transition count 29
Applied a total of 46 rules in 5 ms. Remains 35 /69 variables (removed 34) and now considering 29/49 (removed 20) transitions.
// Phase 1: matrix 29 rows 35 cols
[2024-05-25 15:22:31] [INFO ] Computed 7 invariants in 3 ms
[2024-05-25 15:22:31] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-25 15:22:31] [INFO ] Invariant cache hit.
[2024-05-25 15:22:31] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 35/321 places, 29/244 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 466 ms. Remains : 35/321 places, 29/244 transitions.
Stuttering acceptance computed with spot in 128 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-06-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s32 0), p0:(AND (EQ s32 1) (EQ s0 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 31771 reset in 70 ms.
Product exploration explored 100000 steps with 31876 reset in 98 ms.
Computed a total of 35 stabilizing places and 28 stable transitions
Graph (complete) has 101 edges and 35 vertex of which 33 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Computed a total of 35 stabilizing places and 28 stable transitions
Detected a total of 35/35 stabilizing places and 28/29 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND 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 7 factoid took 236 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 148 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 868 steps, including 326 resets, run visited all 2 properties in 10 ms. (steps per millisecond=86 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND 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))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 7 factoid took 454 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 117 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 35 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 35/35 places, 29/29 transitions.
Applied a total of 0 rules in 2 ms. Remains 35 /35 variables (removed 0) and now considering 29/29 (removed 0) transitions.
[2024-05-25 15:22:32] [INFO ] Invariant cache hit.
[2024-05-25 15:22:32] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-25 15:22:32] [INFO ] Invariant cache hit.
[2024-05-25 15:22:32] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 146 ms to find 0 implicit places.
[2024-05-25 15:22:32] [INFO ] Redundant transitions in 45 ms returned []
[2024-05-25 15:22:32] [INFO ] Invariant cache hit.
[2024-05-25 15:22:32] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 257 ms. Remains : 35/35 places, 29/29 transitions.
Computed a total of 35 stabilizing places and 28 stable transitions
Graph (complete) has 101 edges and 35 vertex of which 33 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Computed a total of 35 stabilizing places and 28 stable transitions
Detected a total of 35/35 stabilizing places and 28/29 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) 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 173 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 120 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 784 steps, including 300 resets, run visited all 2 properties in 11 ms. (steps per millisecond=71 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 7 factoid took 296 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 31876 reset in 69 ms.
Product exploration explored 100000 steps with 31881 reset in 77 ms.
Built C files in :
/tmp/ltsmin1735819501472527509
[2024-05-25 15:22:34] [INFO ] Computing symmetric may disable matrix : 29 transitions.
[2024-05-25 15:22:34] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 15:22:34] [INFO ] Computing symmetric may enable matrix : 29 transitions.
[2024-05-25 15:22:34] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 15:22:34] [INFO ] Computing Do-Not-Accords matrix : 29 transitions.
[2024-05-25 15:22:34] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 15:22:34] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1735819501472527509
Running compilation step : cd /tmp/ltsmin1735819501472527509;'/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 120 ms.
Running link step : cd /tmp/ltsmin1735819501472527509;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin1735819501472527509;'/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/stateBased214712754678056329.hoa' '--buchi-type=spotba'
LTSmin run took 1501 ms.
FORMULA BusinessProcesses-PT-06-LTLFireability-06 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property BusinessProcesses-PT-06-LTLFireability-06 finished in 4933 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 321 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 321/321 places, 244/244 transitions.
Graph (trivial) has 143 edges and 321 vertex of which 6 / 321 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 626 edges and 316 vertex of which 315 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.9 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 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 35 place count 314 transition count 203
Reduce places removed 33 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 34 rules applied. Total rules applied 69 place count 281 transition count 202
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 70 place count 280 transition count 202
Performed 66 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 66 Pre rules applied. Total rules applied 70 place count 280 transition count 136
Deduced a syphon composed of 66 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 3 with 142 rules applied. Total rules applied 212 place count 204 transition count 136
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 221 place count 195 transition count 127
Iterating global reduction 3 with 9 rules applied. Total rules applied 230 place count 195 transition count 127
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 3 with 168 rules applied. Total rules applied 398 place count 107 transition count 47
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 399 place count 106 transition count 46
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 400 place count 105 transition count 46
Applied a total of 400 rules in 38 ms. Remains 105 /321 variables (removed 216) and now considering 46/244 (removed 198) transitions.
// Phase 1: matrix 46 rows 105 cols
[2024-05-25 15:22:35] [INFO ] Computed 60 invariants in 1 ms
[2024-05-25 15:22:35] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-25 15:22:35] [INFO ] Invariant cache hit.
[2024-05-25 15:22:35] [INFO ] Implicit Places using invariants and state equation in 105 ms returned [0, 2, 3, 4, 5, 6, 7, 8, 9, 11, 13, 15, 17, 19, 21, 23, 25, 34, 35, 37, 39, 41, 43, 45, 47, 49, 51, 53, 55, 57, 59, 61, 63, 65, 67, 69, 71, 73, 75]
Discarding 39 places :
Implicit Place search using SMT with State Equation took 184 ms to find 39 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 66/321 places, 46/244 transitions.
Graph (complete) has 137 edges and 66 vertex of which 58 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 58 transition count 36
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 19 place count 49 transition count 36
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Ensure Unique test removed 7 places
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 23 rules applied. Total rules applied 42 place count 34 transition count 28
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 44 place count 33 transition count 27
Applied a total of 44 rules in 28 ms. Remains 33 /66 variables (removed 33) and now considering 27/46 (removed 19) transitions.
// Phase 1: matrix 27 rows 33 cols
[2024-05-25 15:22:35] [INFO ] Computed 7 invariants in 17 ms
[2024-05-25 15:22:36] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-25 15:22:36] [INFO ] Invariant cache hit.
[2024-05-25 15:22:36] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 126 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 33/321 places, 27/244 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 377 ms. Remains : 33/321 places, 27/244 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-06-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(NEQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 14 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-06-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-06-LTLFireability-07 finished in 434 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)))'
Support contains 1 out of 321 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 321/321 places, 244/244 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 311 transition count 234
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 311 transition count 234
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 309 transition count 232
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 309 transition count 232
Applied a total of 24 rules in 22 ms. Remains 309 /321 variables (removed 12) and now considering 232/244 (removed 12) transitions.
// Phase 1: matrix 232 rows 309 cols
[2024-05-25 15:22:36] [INFO ] Computed 79 invariants in 2 ms
[2024-05-25 15:22:36] [INFO ] Implicit Places using invariants in 181 ms returned []
[2024-05-25 15:22:36] [INFO ] Invariant cache hit.
[2024-05-25 15:22:36] [INFO ] Implicit Places using invariants and state equation in 340 ms returned []
Implicit Place search using SMT with State Equation took 524 ms to find 0 implicit places.
[2024-05-25 15:22:36] [INFO ] Invariant cache hit.
[2024-05-25 15:22:36] [INFO ] Dead Transitions using invariants and state equation in 153 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 309/321 places, 232/244 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 701 ms. Remains : 309/321 places, 232/244 transitions.
Stuttering acceptance computed with spot in 107 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-06-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s277 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-06-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-06-LTLFireability-08 finished in 822 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 (G(p1)||X((p2||X(((p3||F(!p2)) U (p2&&(p3||F(!p2)))))))))))'
Support contains 4 out of 321 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 321/321 places, 244/244 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 311 transition count 234
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 311 transition count 234
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 309 transition count 232
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 309 transition count 232
Applied a total of 24 rules in 10 ms. Remains 309 /321 variables (removed 12) and now considering 232/244 (removed 12) transitions.
[2024-05-25 15:22:36] [INFO ] Invariant cache hit.
[2024-05-25 15:22:37] [INFO ] Implicit Places using invariants in 110 ms returned []
[2024-05-25 15:22:37] [INFO ] Invariant cache hit.
[2024-05-25 15:22:37] [INFO ] Implicit Places using invariants and state equation in 380 ms returned []
Implicit Place search using SMT with State Equation took 493 ms to find 0 implicit places.
[2024-05-25 15:22:37] [INFO ] Invariant cache hit.
[2024-05-25 15:22:37] [INFO ] Dead Transitions using invariants and state equation in 186 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 309/321 places, 232/244 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 691 ms. Remains : 309/321 places, 232/244 transitions.
Stuttering acceptance computed with spot in 386 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p3)), p2, (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND p2 (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-06-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p2), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 6}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}, { cond=(AND p2 (NOT p3)), acceptance={} source=4 dest: 5}], [{ cond=p2, acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p1) p2 (NOT p3)), acceptance={} source=6 dest: 5}, { cond=(AND p1 (NOT p2)), acceptance={} source=6 dest: 6}, { cond=(AND p1 p2 (NOT p3)), acceptance={} source=6 dest: 7}], [{ cond=(AND (NOT p1) p2), acceptance={} source=7 dest: 5}, { cond=(AND p1 p2), acceptance={} source=7 dest: 7}]], initial=0, aps=[p1:(EQ s103 1), p0:(EQ s168 1), p2:(NEQ s11 1), p3:(EQ s28 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33334 reset in 193 ms.
Product exploration explored 100000 steps with 33144 reset in 214 ms.
Computed a total of 302 stabilizing places and 223 stable transitions
Graph (complete) has 617 edges and 309 vertex of which 308 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 302 stabilizing places and 223 stable transitions
Detected a total of 302/309 stabilizing places and 223/232 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 4/4 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2 (NOT p3)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 p0 (NOT p2)))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X p2), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (X (AND (NOT p1) p2 (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 p2 (NOT p3))))), (X (X p2)), (X (X (AND p2 (NOT p3)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 22 factoid took 3961 ms. Reduced automaton from 8 states, 20 edges and 4 AP (stutter sensitive) to 8 states, 20 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 523 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p3)), p2, (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND p2 (NOT p1))]
Incomplete random walk after 10000 steps, including 107 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 15) seen :12
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :0
Finished Best-First random walk after 6789 steps, including 10 resets, run visited all 3 properties in 12 ms. (steps per millisecond=565 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2 (NOT p3)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 p0 (NOT p2)))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X p2), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (X (AND (NOT p1) p2 (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 p2 (NOT p3))))), (X (X p2)), (X (X (AND p2 (NOT p3)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p2))), (F (AND p1 (NOT p2) (NOT p0))), (F (AND p1 (NOT p2))), (F (AND (NOT p1) (NOT p2) (NOT p0))), (F (AND p1 p2)), (F (NOT p2)), (F (NOT (AND (NOT p1) p2))), (F (AND (NOT p1) (NOT p2) p0)), (F (AND p1 p2 (NOT p3))), (F (AND p1 (NOT p2) p0)), (F (NOT (AND (NOT p1) (NOT p0)))), (F (AND p1 (NOT p0))), (F (AND (NOT p1) p0)), (F (NOT (AND (NOT p1) p2 (NOT p3)))), (F (NOT (AND p2 (NOT p3))))]
Knowledge based reduction with 22 factoid took 7760 ms. Reduced automaton from 8 states, 20 edges and 4 AP (stutter sensitive) to 8 states, 20 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 400 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p3)), p2, (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND p2 (NOT p1))]
Stuttering acceptance computed with spot in 552 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p3)), p2, (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND p2 (NOT p1))]
Support contains 4 out of 309 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 309/309 places, 232/232 transitions.
Applied a total of 0 rules in 3 ms. Remains 309 /309 variables (removed 0) and now considering 232/232 (removed 0) transitions.
[2024-05-25 15:22:51] [INFO ] Invariant cache hit.
[2024-05-25 15:22:52] [INFO ] Implicit Places using invariants in 159 ms returned []
[2024-05-25 15:22:52] [INFO ] Invariant cache hit.
[2024-05-25 15:22:52] [INFO ] Implicit Places using invariants and state equation in 371 ms returned []
Implicit Place search using SMT with State Equation took 555 ms to find 0 implicit places.
[2024-05-25 15:22:52] [INFO ] Invariant cache hit.
[2024-05-25 15:22:52] [INFO ] Dead Transitions using invariants and state equation in 220 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 782 ms. Remains : 309/309 places, 232/232 transitions.
Computed a total of 302 stabilizing places and 223 stable transitions
Graph (complete) has 617 edges and 309 vertex of which 308 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 302 stabilizing places and 223 stable transitions
Detected a total of 302/309 stabilizing places and 223/232 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 4/4 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2 (NOT p3)), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X p2), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p1 (NOT p2) p0))), (X (X (AND (NOT p1) p2 (NOT p3)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND p1 p2 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X p2)), (X (X (AND p2 (NOT p3)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p1 (NOT p2) p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 22 factoid took 3421 ms. Reduced automaton from 8 states, 20 edges and 4 AP (stutter sensitive) to 8 states, 20 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 590 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p3)), p2, (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND p2 (NOT p1))]
Incomplete random walk after 10000 steps, including 106 resets, run finished after 168 ms. (steps per millisecond=59 ) properties (out of 15) seen :12
Finished Best-First random walk after 8758 steps, including 15 resets, run visited all 3 properties in 43 ms. (steps per millisecond=203 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2 (NOT p3)), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X p2), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p1 (NOT p2) p0))), (X (X (AND (NOT p1) p2 (NOT p3)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND p1 p2 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X p2)), (X (X (AND p2 (NOT p3)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p1 (NOT p2) p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p2))), (F (AND (NOT p0) p1 (NOT p2))), (F (AND p1 (NOT p2))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND p1 p2)), (F (NOT p2)), (F (NOT (AND (NOT p1) p2))), (F (AND p0 (NOT p1) (NOT p2))), (F (AND p1 p2 (NOT p3))), (F (AND p0 p1 (NOT p2))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p1)), (F (AND p0 (NOT p1))), (F (NOT (AND (NOT p1) p2 (NOT p3)))), (F (NOT (AND p2 (NOT p3))))]
Knowledge based reduction with 22 factoid took 8138 ms. Reduced automaton from 8 states, 20 edges and 4 AP (stutter sensitive) to 8 states, 20 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 486 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p3)), p2, (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND p2 (NOT p1))]
Stuttering acceptance computed with spot in 617 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p3)), p2, (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND p2 (NOT p1))]
Stuttering acceptance computed with spot in 561 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p3)), p2, (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND p2 (NOT p1))]
Product exploration explored 100000 steps with 33348 reset in 372 ms.
Product exploration explored 100000 steps with 33324 reset in 258 ms.
Applying partial POR strategy [false, true, false, true, true, true, true, true]
Stuttering acceptance computed with spot in 482 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p3)), p2, (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND p2 (NOT p1))]
Support contains 4 out of 309 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 309/309 places, 232/232 transitions.
Graph (trivial) has 130 edges and 309 vertex of which 6 / 309 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 611 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
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 25 rules applied. Total rules applied 27 place count 303 transition count 225
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 37 Pre rules applied. Total rules applied 27 place count 303 transition count 249
Deduced a syphon composed of 62 places in 0 ms
Iterating global reduction 1 with 37 rules applied. Total rules applied 64 place count 303 transition count 249
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 75 place count 292 transition count 228
Deduced a syphon composed of 51 places in 1 ms
Iterating global reduction 1 with 11 rules applied. Total rules applied 86 place count 292 transition count 228
Performed 109 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 160 places in 0 ms
Iterating global reduction 1 with 109 rules applied. Total rules applied 195 place count 292 transition count 228
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 210 place count 277 transition count 213
Deduced a syphon composed of 145 places in 0 ms
Iterating global reduction 1 with 15 rules applied. Total rules applied 225 place count 277 transition count 213
Deduced a syphon composed of 145 places in 0 ms
Applied a total of 225 rules in 68 ms. Remains 277 /309 variables (removed 32) and now considering 213/232 (removed 19) transitions.
[2024-05-25 15:23:08] [INFO ] Redundant transitions in 32 ms returned []
// Phase 1: matrix 213 rows 277 cols
[2024-05-25 15:23:08] [INFO ] Computed 79 invariants in 3 ms
[2024-05-25 15:23:08] [INFO ] Dead Transitions using invariants and state equation in 139 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 277/309 places, 213/232 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 253 ms. Remains : 277/309 places, 213/232 transitions.
Built C files in :
/tmp/ltsmin3984188842852006862
[2024-05-25 15:23:08] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3984188842852006862
Running compilation step : cd /tmp/ltsmin3984188842852006862;'/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 415 ms.
Running link step : cd /tmp/ltsmin3984188842852006862;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin3984188842852006862;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased14634726086749820884.hoa' '--buchi-type=spotba'
LTSmin run took 216 ms.
FORMULA BusinessProcesses-PT-06-LTLFireability-09 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property BusinessProcesses-PT-06-LTLFireability-09 finished in 32088 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 321 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 321/321 places, 244/244 transitions.
Graph (trivial) has 143 edges and 321 vertex of which 6 / 321 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 626 edges and 316 vertex of which 315 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 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 314 transition count 202
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 70 place count 280 transition count 202
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 65 Pre rules applied. Total rules applied 70 place count 280 transition count 137
Deduced a syphon composed of 65 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 2 with 140 rules applied. Total rules applied 210 place count 205 transition count 137
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 219 place count 196 transition count 128
Iterating global reduction 2 with 9 rules applied. Total rules applied 228 place count 196 transition count 128
Performed 81 Post agglomeration using F-continuation condition.Transition count delta: 81
Deduced a syphon composed of 81 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 2 with 170 rules applied. Total rules applied 398 place count 107 transition count 47
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 399 place count 106 transition count 46
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 400 place count 105 transition count 46
Applied a total of 400 rules in 27 ms. Remains 105 /321 variables (removed 216) and now considering 46/244 (removed 198) transitions.
// Phase 1: matrix 46 rows 105 cols
[2024-05-25 15:23:09] [INFO ] Computed 60 invariants in 1 ms
[2024-05-25 15:23:09] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-05-25 15:23:09] [INFO ] Invariant cache hit.
[2024-05-25 15:23:09] [INFO ] Implicit Places using invariants and state equation in 122 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 8, 11, 13, 15, 17, 19, 21, 23, 25, 34, 35, 37, 39, 41, 43, 45, 47, 49, 51, 53, 55, 57, 59, 61, 63, 65, 67, 69, 71, 73, 75]
Discarding 39 places :
Implicit Place search using SMT with State Equation took 193 ms to find 39 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 66/321 places, 46/244 transitions.
Graph (complete) has 137 edges and 66 vertex of which 58 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.0 ms
Discarding 8 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 58 transition count 35
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 48 transition count 35
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Ensure Unique test removed 7 places
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 23 rules applied. Total rules applied 44 place count 33 transition count 27
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 46 place count 32 transition count 26
Applied a total of 46 rules in 7 ms. Remains 32 /66 variables (removed 34) and now considering 26/46 (removed 20) transitions.
// Phase 1: matrix 26 rows 32 cols
[2024-05-25 15:23:09] [INFO ] Computed 7 invariants in 0 ms
[2024-05-25 15:23:09] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-25 15:23:09] [INFO ] Invariant cache hit.
[2024-05-25 15:23:09] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 32/321 places, 26/244 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 316 ms. Remains : 32/321 places, 26/244 transitions.
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-06-LTLFireability-10 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 s1 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 149 steps with 45 reset in 0 ms.
FORMULA BusinessProcesses-PT-06-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-06-LTLFireability-10 finished in 388 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 (G(p0)||(X((F(p0)&&X(G(p2))))&&p1))))'
Support contains 3 out of 321 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 321/321 places, 244/244 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 312 transition count 235
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 312 transition count 235
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 310 transition count 233
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 310 transition count 233
Applied a total of 22 rules in 24 ms. Remains 310 /321 variables (removed 11) and now considering 233/244 (removed 11) transitions.
// Phase 1: matrix 233 rows 310 cols
[2024-05-25 15:23:09] [INFO ] Computed 79 invariants in 3 ms
[2024-05-25 15:23:09] [INFO ] Implicit Places using invariants in 108 ms returned []
[2024-05-25 15:23:09] [INFO ] Invariant cache hit.
[2024-05-25 15:23:09] [INFO ] Implicit Places using invariants and state equation in 259 ms returned []
Implicit Place search using SMT with State Equation took 372 ms to find 0 implicit places.
[2024-05-25 15:23:09] [INFO ] Invariant cache hit.
[2024-05-25 15:23:10] [INFO ] Dead Transitions using invariants and state equation in 260 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 310/321 places, 233/244 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 659 ms. Remains : 310/321 places, 233/244 transitions.
Stuttering acceptance computed with spot in 486 ms :[true, (OR (NOT p2) (NOT p0)), (NOT p2), (NOT p0), (NOT p0), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (OR (NOT p2) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-06-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p2), acceptance={0} source=1 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(OR p0 p2), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 3}, { cond=(AND p1 p0), acceptance={} source=3 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 8}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 6}, { cond=(AND p1 p0), acceptance={} source=4 dest: 7}, { cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 8}], [{ cond=(NOT p2), acceptance={} source=5 dest: 0}, { cond=p2, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=6 dest: 0}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=6 dest: 2}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=6 dest: 3}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=6 dest: 6}, { cond=(AND p1 p0 p2), acceptance={} source=6 dest: 7}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=6 dest: 8}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=7 dest: 1}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=7 dest: 2}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=7 dest: 5}, { cond=(AND (NOT p1) p0), acceptance={} source=7 dest: 6}, { cond=(AND p1 p0), acceptance={} source=7 dest: 7}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=7 dest: 8}], [{ cond=(NOT p0), acceptance={} source=8 dest: 1}, { cond=p0, acceptance={} source=8 dest: 5}]], initial=3, aps=[p2:(NEQ s272 1), p0:(NEQ s37 1), p1:(AND (NEQ s37 1) (NEQ s259 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1028 reset in 328 ms.
Product exploration explored 100000 steps with 1018 reset in 329 ms.
Computed a total of 303 stabilizing places and 224 stable transitions
Graph (complete) has 618 edges and 310 vertex of which 309 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 303 stabilizing places and 224 stable transitions
Detected a total of 303/310 stabilizing places and 224/233 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND p2 p0 p1), (X p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 p0)), (X (NOT (AND (NOT p1) p0))), (X (X p0)), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 p0 p2))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) p2)))), true, (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (AND p1 p0))), (X (X p2)), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p0 p2))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 26 factoid took 4182 ms. Reduced automaton from 9 states, 32 edges and 3 AP (stutter sensitive) to 9 states, 32 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 581 ms :[true, (OR (NOT p2) (NOT p0)), (NOT p2), (OR (NOT p2) (NOT p0)), (NOT p2), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 96 resets, run finished after 457 ms. (steps per millisecond=21 ) properties (out of 18) seen :11
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 19 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 18 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2024-05-25 15:23:16] [INFO ] Invariant cache hit.
[2024-05-25 15:23:16] [INFO ] [Real]Absence check using 40 positive place invariants in 9 ms returned sat
[2024-05-25 15:23:16] [INFO ] [Real]Absence check using 40 positive and 39 generalized place invariants in 14 ms returned sat
[2024-05-25 15:23:16] [INFO ] After 213ms SMT Verify possible using all constraints in real domain returned unsat :6 sat :0 real:1
[2024-05-25 15:23:17] [INFO ] [Nat]Absence check using 40 positive place invariants in 8 ms returned sat
[2024-05-25 15:23:17] [INFO ] [Nat]Absence check using 40 positive and 39 generalized place invariants in 10 ms returned sat
[2024-05-25 15:23:17] [INFO ] After 153ms SMT Verify possible using all constraints in natural domain returned unsat :7 sat :0
Fused 7 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 7 invariant AP formulas.
Knowledge obtained : [(AND p2 p0 p1), (X p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 p0)), (X (NOT (AND (NOT p1) p0))), (X (X p0)), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 p0 p2))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) p2)))), true, (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (AND p1 p0))), (X (X p2)), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p0 p2))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND p1 (NOT p0)))), (G (OR p0 p2)), (G (NOT (AND (NOT p1) p0 (NOT p2)))), (G (NOT (AND (NOT p0) (NOT p2)))), (G (NOT (AND p1 (NOT p0) (NOT p2)))), (G (NOT (AND p1 (NOT p0) p2))), (G (NOT (AND (NOT p1) (NOT p0) (NOT p2))))]
False Knowledge obtained : [(F (AND (NOT p1) p0)), (F (NOT (AND p1 p0))), (F (AND p1 p0 (NOT p2))), (F (AND (NOT p1) (NOT p0) p2)), (F (AND (NOT p1) (NOT p0))), (F (NOT p0)), (F (NOT p2)), (F (NOT (AND p1 p0 p2))), (F (NOT (AND p0 p2))), (F (AND (NOT p1) p0 p2)), (F (AND (NOT p0) p2))]
Knowledge based reduction with 33 factoid took 26598 ms. Reduced automaton from 9 states, 32 edges and 3 AP (stutter sensitive) to 7 states, 17 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 424 ms :[true, (OR (NOT p2) (NOT p0)), (NOT p0), (NOT p2), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 361 ms :[true, (OR (NOT p2) (NOT p0)), (NOT p0), (NOT p2), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 3 out of 310 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 310/310 places, 233/233 transitions.
Applied a total of 0 rules in 7 ms. Remains 310 /310 variables (removed 0) and now considering 233/233 (removed 0) transitions.
[2024-05-25 15:23:44] [INFO ] Invariant cache hit.
[2024-05-25 15:23:44] [INFO ] Implicit Places using invariants in 143 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 323 ms returned []
Implicit Place search using SMT with State Equation took 468 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 153 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 630 ms. Remains : 310/310 places, 233/233 transitions.
Computed a total of 303 stabilizing places and 224 stable transitions
Graph (complete) has 618 edges and 310 vertex of which 309 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 303 stabilizing places and 224 stable transitions
Detected a total of 303/310 stabilizing places and 224/233 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND p2 p0 p1), (X p0), (X (AND p1 p0)), (X (NOT (AND (NOT p1) p0))), (X (X p0)), (X (X (AND p1 p0 p2))), (X (X (AND p1 p0))), (X (X p2)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p0 p2))), (X (X (NOT (AND (NOT p0) p2)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 1168 ms. Reduced automaton from 7 states, 17 edges and 3 AP (stutter sensitive) to 7 states, 17 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 357 ms :[true, (OR (NOT p2) (NOT p0)), (NOT p0), (NOT p2), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Finished random walk after 4055 steps, including 41 resets, run visited all 7 properties in 126 ms. (steps per millisecond=32 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p2 p0 p1), (X p0), (X (AND p1 p0)), (X (NOT (AND (NOT p1) p0))), (X (X p0)), (X (X (AND p1 p0 p2))), (X (X (AND p1 p0))), (X (X p2)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p0 p2))), (X (X (NOT (AND (NOT p0) p2)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p1) p0)), (F (NOT p0)), (F (NOT (AND p1 p0 p2))), (F (NOT (AND p1 p0))), (F (NOT p2)), (F (NOT (AND p0 p2))), (F (AND (NOT p0) p2))]
Knowledge based reduction with 14 factoid took 3976 ms. Reduced automaton from 7 states, 17 edges and 3 AP (stutter sensitive) to 7 states, 17 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 393 ms :[true, (OR (NOT p2) (NOT p0)), (NOT p0), (NOT p2), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 369 ms :[true, (OR (NOT p2) (NOT p0)), (NOT p0), (NOT p2), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 414 ms :[true, (OR (NOT p2) (NOT p0)), (NOT p0), (NOT p2), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 998 reset in 235 ms.
Product exploration explored 100000 steps with 1028 reset in 241 ms.
Applying partial POR strategy [true, true, false, true, false, false, false]
Stuttering acceptance computed with spot in 415 ms :[true, (OR (NOT p2) (NOT p0)), (NOT p0), (NOT p2), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 3 out of 310 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 310/310 places, 233/233 transitions.
Graph (trivial) has 129 edges and 310 vertex of which 6 / 310 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 612 edges and 305 vertex of which 304 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
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 25 rules applied. Total rules applied 27 place count 304 transition count 226
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 37 Pre rules applied. Total rules applied 27 place count 304 transition count 249
Deduced a syphon composed of 62 places in 0 ms
Iterating global reduction 1 with 37 rules applied. Total rules applied 64 place count 304 transition count 249
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 74 place count 294 transition count 230
Deduced a syphon composed of 52 places in 0 ms
Iterating global reduction 1 with 10 rules applied. Total rules applied 84 place count 294 transition count 230
Performed 114 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 166 places in 1 ms
Iterating global reduction 1 with 114 rules applied. Total rules applied 198 place count 294 transition count 230
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 214 place count 278 transition count 214
Deduced a syphon composed of 150 places in 0 ms
Iterating global reduction 1 with 16 rules applied. Total rules applied 230 place count 278 transition count 214
Deduced a syphon composed of 150 places in 1 ms
Applied a total of 230 rules in 56 ms. Remains 278 /310 variables (removed 32) and now considering 214/233 (removed 19) transitions.
[2024-05-25 15:23:53] [INFO ] Redundant transitions in 62 ms returned []
// Phase 1: matrix 214 rows 278 cols
[2024-05-25 15:23:53] [INFO ] Computed 79 invariants in 5 ms
[2024-05-25 15:23:53] [INFO ] Dead Transitions using invariants and state equation in 161 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 278/310 places, 214/233 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 295 ms. Remains : 278/310 places, 214/233 transitions.
Built C files in :
/tmp/ltsmin10522473610545658494
[2024-05-25 15:23:53] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10522473610545658494
Running compilation step : cd /tmp/ltsmin10522473610545658494;'/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 506 ms.
Running link step : cd /tmp/ltsmin10522473610545658494;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin10522473610545658494;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased17924515670322496803.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 310 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 310/310 places, 233/233 transitions.
Applied a total of 0 rules in 4 ms. Remains 310 /310 variables (removed 0) and now considering 233/233 (removed 0) transitions.
// Phase 1: matrix 233 rows 310 cols
[2024-05-25 15:24:08] [INFO ] Computed 79 invariants in 3 ms
[2024-05-25 15:24:08] [INFO ] Implicit Places using invariants in 163 ms returned []
[2024-05-25 15:24:08] [INFO ] Invariant cache hit.
[2024-05-25 15:24:08] [INFO ] Implicit Places using invariants and state equation in 228 ms returned []
Implicit Place search using SMT with State Equation took 393 ms to find 0 implicit places.
[2024-05-25 15:24:08] [INFO ] Invariant cache hit.
[2024-05-25 15:24:09] [INFO ] Dead Transitions using invariants and state equation in 137 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 535 ms. Remains : 310/310 places, 233/233 transitions.
Built C files in :
/tmp/ltsmin705431971497624479
[2024-05-25 15:24:09] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin705431971497624479
Running compilation step : cd /tmp/ltsmin705431971497624479;'/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 326 ms.
Running link step : cd /tmp/ltsmin705431971497624479;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 24 ms.
Running LTSmin : cd /tmp/ltsmin705431971497624479;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7371928446899171535.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-25 15:24:24] [INFO ] Flatten gal took : 13 ms
[2024-05-25 15:24:24] [INFO ] Flatten gal took : 11 ms
[2024-05-25 15:24:24] [INFO ] Time to serialize gal into /tmp/LTL13515920664444161012.gal : 7 ms
[2024-05-25 15:24:24] [INFO ] Time to serialize properties into /tmp/LTL8526114173167823881.prop : 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/LTL13515920664444161012.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14691356329798455328.hoa' '-atoms' '/tmp/LTL8526114173167823881.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/LTL8526114173167823881.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14691356329798455328.hoa
Detected timeout of ITS tools.
[2024-05-25 15:24:39] [INFO ] Flatten gal took : 24 ms
[2024-05-25 15:24:39] [INFO ] Flatten gal took : 21 ms
[2024-05-25 15:24:39] [INFO ] Time to serialize gal into /tmp/LTL4758342195866461221.gal : 4 ms
[2024-05-25 15:24:39] [INFO ] Time to serialize properties into /tmp/LTL12101564915033845791.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/LTL4758342195866461221.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12101564915033845791.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 : !((("(p37!=1)")U((G("(p37!=1)"))||(("((p37!=1)&&(p291!=1))")&&(X((F("(p37!=1)"))&&(X(G("(p332!=1)")))))))))
Formula 0 simplified : !"(p37!=1)" M (!"((p37!=1)&&(p291!=1))" | X(G!"(p37!=1)" | XF!"(p332!=1)"))
Detected timeout of ITS tools.
[2024-05-25 15:24:54] [INFO ] Flatten gal took : 17 ms
[2024-05-25 15:24:54] [INFO ] Applying decomposition
[2024-05-25 15:24:54] [INFO ] Flatten gal took : 15 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/graph3890319652703361267.txt' '-o' '/tmp/graph3890319652703361267.bin' '-w' '/tmp/graph3890319652703361267.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph3890319652703361267.bin' '-l' '-1' '-v' '-w' '/tmp/graph3890319652703361267.weights' '-q' '0' '-e' '0.001'
[2024-05-25 15:24:54] [INFO ] Decomposing Gal with order
[2024-05-25 15:24:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 15:24:54] [INFO ] Removed a total of 42 redundant transitions.
[2024-05-25 15:24:54] [INFO ] Flatten gal took : 58 ms
[2024-05-25 15:24:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2024-05-25 15:24:54] [INFO ] Time to serialize gal into /tmp/LTL8469684288483939716.gal : 6 ms
[2024-05-25 15:24:54] [INFO ] Time to serialize properties into /tmp/LTL4921712032626116912.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/LTL8469684288483939716.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4921712032626116912.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...254
Read 1 LTL properties
Checking formula 0 : !((("(i4.u14.p37!=1)")U((G("(i4.u14.p37!=1)"))||(("((i4.u14.p37!=1)&&(i3.u91.p291!=1))")&&(X((F("(i4.u14.p37!=1)"))&&(X(G("(i18.u101.p...172
Formula 0 simplified : !"(i4.u14.p37!=1)" M (!"((i4.u14.p37!=1)&&(i3.u91.p291!=1))" | X(G!"(i4.u14.p37!=1)" | XF!"(i18.u101.p332!=1)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8543299586355935790
[2024-05-25 15:25:09] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8543299586355935790
Running compilation step : cd /tmp/ltsmin8543299586355935790;'/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 569 ms.
Running link step : cd /tmp/ltsmin8543299586355935790;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin8543299586355935790;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '((LTLAPp0==true) U ([]((LTLAPp0==true))||(X((<>((LTLAPp0==true))&&X([]((LTLAPp2==true)))))&&(LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property BusinessProcesses-PT-06-LTLFireability-11 finished in 135494 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((G(p0)||X(p1)))))'
Support contains 2 out of 321 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 321/321 places, 244/244 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 313 transition count 236
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 313 transition count 236
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 311 transition count 234
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 311 transition count 234
Applied a total of 20 rules in 22 ms. Remains 311 /321 variables (removed 10) and now considering 234/244 (removed 10) transitions.
// Phase 1: matrix 234 rows 311 cols
[2024-05-25 15:25:24] [INFO ] Computed 79 invariants in 2 ms
[2024-05-25 15:25:25] [INFO ] Implicit Places using invariants in 137 ms returned []
[2024-05-25 15:25:25] [INFO ] Invariant cache hit.
[2024-05-25 15:25:25] [INFO ] Implicit Places using invariants and state equation in 296 ms returned []
Implicit Place search using SMT with State Equation took 435 ms to find 0 implicit places.
[2024-05-25 15:25:25] [INFO ] Invariant cache hit.
[2024-05-25 15:25:25] [INFO ] Dead Transitions using invariants and state equation in 120 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 311/321 places, 234/244 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 579 ms. Remains : 311/321 places, 234/244 transitions.
Stuttering acceptance computed with spot in 208 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-06-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={} source=5 dest: 1}, { cond=p0, acceptance={} source=5 dest: 2}]], initial=4, aps=[p1:(EQ s267 1), p0:(EQ s170 0)], 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, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 12739 steps with 130 reset in 22 ms.
FORMULA BusinessProcesses-PT-06-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-06-LTLFireability-12 finished in 834 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 (G(p0)||(p0&&(p1||X(F(!p2)))))) U (G(p0)||(p3&&(p0 U (G(p0)||(p0&&(p1||X(F(!p2))))))&&X((p3 U (!p2||G(p3))))))))'
Support contains 6 out of 321 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 321/321 places, 244/244 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 313 transition count 236
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 313 transition count 236
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 311 transition count 234
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 311 transition count 234
Applied a total of 20 rules in 12 ms. Remains 311 /321 variables (removed 10) and now considering 234/244 (removed 10) transitions.
// Phase 1: matrix 234 rows 311 cols
[2024-05-25 15:25:25] [INFO ] Computed 79 invariants in 1 ms
[2024-05-25 15:25:25] [INFO ] Implicit Places using invariants in 122 ms returned []
[2024-05-25 15:25:25] [INFO ] Invariant cache hit.
[2024-05-25 15:25:26] [INFO ] Implicit Places using invariants and state equation in 322 ms returned []
Implicit Place search using SMT with State Equation took 446 ms to find 0 implicit places.
[2024-05-25 15:25:26] [INFO ] Invariant cache hit.
[2024-05-25 15:25:26] [INFO ] Dead Transitions using invariants and state equation in 139 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 311/321 places, 234/244 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 598 ms. Remains : 311/321 places, 234/244 transitions.
Stuttering acceptance computed with spot in 276 ms :[true, p2, (NOT p0), (AND (NOT p0) p2), (AND (NOT p3) p2), (AND (NOT p0) p2 (NOT p3))]
Running random walk in product with property : BusinessProcesses-PT-06-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p3) p2), acceptance={0} source=1 dest: 0}, { cond=(AND p3 p2), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p3)), acceptance={} source=2 dest: 2}, { cond=(AND p0 p3 (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND p0 p3 p1), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p0) (NOT p3) p2), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p3 p2), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p3) p2), acceptance={} source=3 dest: 2}, { cond=(AND p0 p3 (NOT p1) p2), acceptance={} source=3 dest: 3}, { cond=(AND p0 p3 p1 p2), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p3) p2), acceptance={} source=4 dest: 0}, { cond=(AND p3 p2), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p3) p2), acceptance={} source=5 dest: 0}, { cond=(AND p0 (NOT p3) p2), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p0) p3 p2), acceptance={} source=5 dest: 4}, { cond=(AND p0 p3 p2), acceptance={} source=5 dest: 5}]], initial=2, aps=[p3:(NEQ s181 1), p2:(AND (EQ s36 1) (EQ s185 1) (EQ s263 1)), p0:(NEQ s266 1), p1:(NEQ s273 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, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 340 ms.
Product exploration explored 100000 steps with 50000 reset in 295 ms.
Computed a total of 304 stabilizing places and 225 stable transitions
Graph (complete) has 620 edges and 311 vertex of which 310 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 304 stabilizing places and 225 stable transitions
Detected a total of 304/311 stabilizing places and 225/234 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 4/4 atomic propositions.
Knowledge obtained : [(AND p3 (NOT p2) p0 p1), (X p0), (X (NOT (AND p0 p3 (NOT p1) p2))), (X (NOT (AND p0 p3 (NOT p1)))), (X (NOT (AND p0 (NOT p3)))), (X (NOT (AND p0 p3 p2))), (X (NOT (AND p0 p3 p1 p2))), (X (NOT (AND p0 (NOT p3) p2))), (X (NOT (AND (NOT p0) p3 p2))), (X (AND p0 p3 p1)), (X (NOT (AND (NOT p0) (NOT p3) p2))), (X (X p0)), (X (X (NOT (AND p0 p3 (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (AND p0 p3 p1))), true, (X (X (NOT (AND p0 p3 (NOT p1))))), (X (X (NOT (AND p0 p3 p2)))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (NOT (AND p0 p3 p1 p2)))), (X (X (NOT (AND p0 (NOT p3) p2)))), (X (X (NOT (AND p3 p2)))), (X (X (NOT (AND (NOT p0) p3 p2)))), (X (X (NOT (AND (NOT p0) (NOT p3) p2)))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 28 factoid took 6548 ms. Reduced automaton from 6 states, 18 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-06-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-06-LTLFireability-13 finished in 8087 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 321 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 321/321 places, 244/244 transitions.
Graph (trivial) has 143 edges and 321 vertex of which 6 / 321 are part of one of the 1 SCC in 2 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 626 edges and 316 vertex of which 315 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 314 transition count 202
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 70 place count 280 transition count 202
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 65 Pre rules applied. Total rules applied 70 place count 280 transition count 137
Deduced a syphon composed of 65 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 2 with 140 rules applied. Total rules applied 210 place count 205 transition count 137
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 218 place count 197 transition count 129
Iterating global reduction 2 with 8 rules applied. Total rules applied 226 place count 197 transition count 129
Performed 82 Post agglomeration using F-continuation condition.Transition count delta: 82
Deduced a syphon composed of 82 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 2 with 172 rules applied. Total rules applied 398 place count 107 transition count 47
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 399 place count 106 transition count 46
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 400 place count 105 transition count 46
Applied a total of 400 rules in 45 ms. Remains 105 /321 variables (removed 216) and now considering 46/244 (removed 198) transitions.
// Phase 1: matrix 46 rows 105 cols
[2024-05-25 15:25:33] [INFO ] Computed 60 invariants in 2 ms
[2024-05-25 15:25:33] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-05-25 15:25:33] [INFO ] Invariant cache hit.
[2024-05-25 15:25:34] [INFO ] Implicit Places using invariants and state equation in 130 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 8, 10, 12, 14, 16, 18, 20, 22, 24, 33, 34, 36, 38, 40, 42, 44, 46, 48, 50, 52, 54, 56, 58, 60, 62, 64, 68, 69, 71, 73, 75]
Discarding 39 places :
Implicit Place search using SMT with State Equation took 234 ms to find 39 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 66/321 places, 46/244 transitions.
Graph (complete) has 138 edges and 66 vertex of which 58 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.0 ms
Discarding 8 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 58 transition count 36
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 19 place count 49 transition count 36
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Ensure Unique test removed 7 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 25 rules applied. Total rules applied 44 place count 33 transition count 27
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 46 place count 32 transition count 26
Applied a total of 46 rules in 5 ms. Remains 32 /66 variables (removed 34) and now considering 26/46 (removed 20) transitions.
// Phase 1: matrix 26 rows 32 cols
[2024-05-25 15:25:34] [INFO ] Computed 7 invariants in 1 ms
[2024-05-25 15:25:34] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-25 15:25:34] [INFO ] Invariant cache hit.
[2024-05-25 15:25:34] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 32/321 places, 26/244 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 367 ms. Remains : 32/321 places, 26/244 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-06-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s24 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-06-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-06-LTLFireability-14 finished in 447 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((G(F(p0))&&(!p1 U (p2||G(!p1)))))))))'
Support contains 5 out of 321 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 321/321 places, 244/244 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 312 transition count 235
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 312 transition count 235
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 311 transition count 234
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 311 transition count 234
Applied a total of 20 rules in 13 ms. Remains 311 /321 variables (removed 10) and now considering 234/244 (removed 10) transitions.
// Phase 1: matrix 234 rows 311 cols
[2024-05-25 15:25:34] [INFO ] Computed 79 invariants in 2 ms
[2024-05-25 15:25:34] [INFO ] Implicit Places using invariants in 146 ms returned []
[2024-05-25 15:25:34] [INFO ] Invariant cache hit.
[2024-05-25 15:25:34] [INFO ] Implicit Places using invariants and state equation in 334 ms returned []
Implicit Place search using SMT with State Equation took 482 ms to find 0 implicit places.
[2024-05-25 15:25:34] [INFO ] Invariant cache hit.
[2024-05-25 15:25:34] [INFO ] Dead Transitions using invariants and state equation in 157 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 311/321 places, 234/244 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 655 ms. Remains : 311/321 places, 234/244 transitions.
Stuttering acceptance computed with spot in 433 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (NOT p0), (AND p1 (NOT p2))]
Running random walk in product with property : BusinessProcesses-PT-06-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=2 dest: 2}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p0) (NOT p1))), acceptance={} source=2 dest: 3}, { cond=(OR p2 (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=5 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=5 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(EQ s272 0), p2:(AND (NEQ s104 1) (NOT (AND (EQ s39 1) (EQ s227 1) (EQ s280 1)))), p1:(AND (EQ s39 1) (EQ s227 1) (EQ s280 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 1035 reset in 211 ms.
Product exploration explored 100000 steps with 1024 reset in 233 ms.
Computed a total of 304 stabilizing places and 225 stable transitions
Graph (complete) has 620 edges and 311 vertex of which 310 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 304 stabilizing places and 225 stable transitions
Detected a total of 304/311 stabilizing places and 225/234 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X p0), (X (X p0)), (X (X (OR p2 (NOT p1)))), (X (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) (NOT p1)))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 229 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 113 ms :[(NOT p0), (NOT p0)]
Finished random walk after 4431 steps, including 45 resets, run visited all 1 properties in 27 ms. (steps per millisecond=164 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X p0), (X (X p0)), (X (X (OR p2 (NOT p1)))), (X (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) (NOT p1)))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 9 factoid took 243 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 117 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 311 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 : 311/311 places, 234/234 transitions.
Graph (complete) has 620 edges and 311 vertex of which 310 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 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 309 transition count 207
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 284 transition count 205
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 55 place count 282 transition count 205
Performed 67 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 67 Pre rules applied. Total rules applied 55 place count 282 transition count 138
Deduced a syphon composed of 67 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 3 with 144 rules applied. Total rules applied 199 place count 205 transition count 138
Performed 84 Post agglomeration using F-continuation condition.Transition count delta: 84
Deduced a syphon composed of 84 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 87 places and 0 transitions.
Iterating global reduction 3 with 171 rules applied. Total rules applied 370 place count 118 transition count 54
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 371 place count 118 transition count 53
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 372 place count 117 transition count 52
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 373 place count 116 transition count 52
Applied a total of 373 rules in 37 ms. Remains 116 /311 variables (removed 195) and now considering 52/234 (removed 182) transitions.
// Phase 1: matrix 52 rows 116 cols
[2024-05-25 15:25:36] [INFO ] Computed 65 invariants in 2 ms
[2024-05-25 15:25:36] [INFO ] Implicit Places using invariants in 107 ms returned [100, 102, 104, 106, 108]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 110 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 111/311 places, 52/234 transitions.
Applied a total of 0 rules in 3 ms. Remains 111 /111 variables (removed 0) and now considering 52/52 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 151 ms. Remains : 111/311 places, 52/234 transitions.
Computed a total of 108 stabilizing places and 48 stable transitions
Computed a total of 108 stabilizing places and 48 stable transitions
Detected a total of 108/111 stabilizing places and 48/52 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 : []
Knowledge based reduction with 4 factoid took 115 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Finished random walk after 3665 steps, including 572 resets, run visited all 1 properties in 15 ms. (steps per millisecond=244 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 147 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 110 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 119 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 14463 reset in 239 ms.
Product exploration explored 100000 steps with 14534 reset in 289 ms.
Built C files in :
/tmp/ltsmin3252475002470837103
[2024-05-25 15:25:38] [INFO ] Computing symmetric may disable matrix : 52 transitions.
[2024-05-25 15:25:38] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 15:25:38] [INFO ] Computing symmetric may enable matrix : 52 transitions.
[2024-05-25 15:25:38] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 15:25:38] [INFO ] Computing Do-Not-Accords matrix : 52 transitions.
[2024-05-25 15:25:38] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 15:25:38] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3252475002470837103
Running compilation step : cd /tmp/ltsmin3252475002470837103;'/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 237 ms.
Running link step : cd /tmp/ltsmin3252475002470837103;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin3252475002470837103;'/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/stateBased10014085875190611993.hoa' '--buchi-type=spotba'
LTSmin run took 651 ms.
FORMULA BusinessProcesses-PT-06-LTLFireability-15 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property BusinessProcesses-PT-06-LTLFireability-15 finished in 4862 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 (G(p0)||(X((F(p0)&&X(G(p2))))&&p1))))'
[2024-05-25 15:25:39] [INFO ] Flatten gal took : 23 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin15764519314217787299
[2024-05-25 15:25:39] [INFO ] Computing symmetric may disable matrix : 244 transitions.
[2024-05-25 15:25:39] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 15:25:39] [INFO ] Computing symmetric may enable matrix : 244 transitions.
[2024-05-25 15:25:39] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 15:25:39] [INFO ] Applying decomposition
[2024-05-25 15:25:39] [INFO ] Flatten gal took : 15 ms
[2024-05-25 15:25:39] [INFO ] Computing Do-Not-Accords matrix : 244 transitions.
[2024-05-25 15:25:39] [INFO ] Computation of Completed DNA matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 15:25:39] [INFO ] Built C files in 50ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15764519314217787299
Running compilation step : cd /tmp/ltsmin15764519314217787299;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '720' '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'
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/graph8304536140798964330.txt' '-o' '/tmp/graph8304536140798964330.bin' '-w' '/tmp/graph8304536140798964330.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph8304536140798964330.bin' '-l' '-1' '-v' '-w' '/tmp/graph8304536140798964330.weights' '-q' '0' '-e' '0.001'
[2024-05-25 15:25:39] [INFO ] Decomposing Gal with order
[2024-05-25 15:25:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 15:25:39] [INFO ] Removed a total of 32 redundant transitions.
[2024-05-25 15:25:39] [INFO ] Flatten gal took : 23 ms
[2024-05-25 15:25:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2024-05-25 15:25:39] [INFO ] Time to serialize gal into /tmp/LTLFireability1583370509837679200.gal : 7 ms
[2024-05-25 15:25:39] [INFO ] Time to serialize properties into /tmp/LTLFireability11811269550147349154.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/LTLFireability1583370509837679200.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability11811269550147349154.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...277
Read 1 LTL properties
Checking formula 0 : !((("(i14.i0.u14.p37!=1)")U((G("(i14.i0.u14.p37!=1)"))||(("((i14.i0.u14.p37!=1)&&(i2.i1.u99.p291!=1))")&&(X((F("(i14.i0.u14.p37!=1)"))...190
Formula 0 simplified : !"(i14.i0.u14.p37!=1)" M (!"((i14.i0.u14.p37!=1)&&(i2.i1.u99.p291!=1))" | X(G!"(i14.i0.u14.p37!=1)" | XF!"(i17.u95.p332!=1)"))
Compilation finished in 671 ms.
Running link step : cd /tmp/ltsmin15764519314217787299;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin15764519314217787299;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '((LTLAPp0==true) U ([]((LTLAPp0==true))||(X((<>((LTLAPp0==true))&&X([]((LTLAPp2==true)))))&&(LTLAPp1==true))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t117, t161, t177, t181, i0.t125, i0.u21.t164, i0.u38.t142, i1.t173, i1.t169, i1.t165, i1.u15....870
Computing Next relation with stutter on 13133 deadlock states
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.004: LTL layer: formula: ((LTLAPp0==true) U ([]((LTLAPp0==true))||(X((<>((LTLAPp0==true))&&X([]((LTLAPp2==true)))))&&(LTLAPp1==true))))
pins2lts-mc-linux64( 1/ 8), 0.004: "((LTLAPp0==true) U ([]((LTLAPp0==true))||(X((<>((LTLAPp0==true))&&X([]((LTLAPp2==true)))))&&(LTLAPp1==true))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.004: Using Spin LTL semantics
pins2lts-mc-linux64( 3/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.009: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.017: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.017: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.017: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.017: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.026: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.027: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.085: There are 248 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.085: State length is 322, there are 277 groups
pins2lts-mc-linux64( 0/ 8), 0.085: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.085: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.085: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.085: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 3/ 8), 0.144: [Blue] ~91 levels ~960 states ~4192 transitions
pins2lts-mc-linux64( 2/ 8), 0.155: [Blue] ~87 levels ~1920 states ~8040 transitions
pins2lts-mc-linux64( 2/ 8), 0.179: [Blue] ~87 levels ~3840 states ~16840 transitions
pins2lts-mc-linux64( 2/ 8), 0.229: [Blue] ~87 levels ~7680 states ~34992 transitions
pins2lts-mc-linux64( 2/ 8), 0.335: [Blue] ~87 levels ~15360 states ~75416 transitions
pins2lts-mc-linux64( 5/ 8), 0.496: [Blue] ~90 levels ~30720 states ~170256 transitions
pins2lts-mc-linux64( 6/ 8), 0.831: [Blue] ~98 levels ~61440 states ~358392 transitions
pins2lts-mc-linux64( 5/ 8), 1.433: [Blue] ~90 levels ~122880 states ~795616 transitions
pins2lts-mc-linux64( 1/ 8), 2.626: [Blue] ~86 levels ~245760 states ~1435368 transitions
pins2lts-mc-linux64( 4/ 8), 4.470: [Blue] ~135 levels ~491520 states ~3136816 transitions
pins2lts-mc-linux64( 4/ 8), 7.623: [Blue] ~135 levels ~983040 states ~6617560 transitions
pins2lts-mc-linux64( 4/ 8), 13.455: [Blue] ~135 levels ~1966080 states ~13481128 transitions
pins2lts-mc-linux64( 4/ 8), 24.961: [Blue] ~135 levels ~3932160 states ~27457688 transitions
pins2lts-mc-linux64( 4/ 8), 47.833: [Blue] ~627 levels ~7864320 states ~56492912 transitions
pins2lts-mc-linux64( 4/ 8), 94.473: [Blue] ~631 levels ~15728640 states ~118947928 transitions
pins2lts-mc-linux64( 4/ 8), 192.081: [Blue] ~631 levels ~31457280 states ~256888608 transitions
pins2lts-mc-linux64( 4/ 8), 391.260: [Blue] ~631 levels ~62914560 states ~542094392 transitions
pins2lts-mc-linux64( 4/ 8), 807.559: [Blue] ~631 levels ~125829120 states ~1147681600 transitions
pins2lts-mc-linux64( 0/ 8), 956.837: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 956.900:
pins2lts-mc-linux64( 0/ 8), 956.900: Explored 134646088 states 1323716217 transitions, fanout: 9.831
pins2lts-mc-linux64( 0/ 8), 956.900: Total exploration time 956.810 sec (956.740 sec minimum, 956.778 sec on average)
pins2lts-mc-linux64( 0/ 8), 956.900: States per second: 140724, Transitions per second: 1383468
pins2lts-mc-linux64( 0/ 8), 956.900:
pins2lts-mc-linux64( 0/ 8), 956.900: State space has 134217331 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 956.900: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 956.900: blue states: 134646088 (100.32%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 956.900: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 956.900: all-red states: 0 (0.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 956.900:
pins2lts-mc-linux64( 0/ 8), 956.900: Total memory used for local state coloring: 0.0MB
pins2lts-mc-linux64( 0/ 8), 956.900:
pins2lts-mc-linux64( 0/ 8), 956.900: Queue width: 8B, total height: 1842, memory: 0.01MB
pins2lts-mc-linux64( 0/ 8), 956.900: Tree memory: 1035.0MB, 8.1 B/state, compr.: 0.6%
pins2lts-mc-linux64( 0/ 8), 956.900: Tree fill ratio (roots/leafs): 99.0%/4.0%
pins2lts-mc-linux64( 0/ 8), 956.900: Stored 244 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 956.901: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 956.901: Est. total memory use: 1035.1MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin15764519314217787299;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '((LTLAPp0==true) U ([]((LTLAPp0==true))||(X((<>((LTLAPp0==true))&&X([]((LTLAPp2==true)))))&&(LTLAPp1==true))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin15764519314217787299;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '((LTLAPp0==true) U ([]((LTLAPp0==true))||(X((<>((LTLAPp0==true))&&X([]((LTLAPp2==true)))))&&(LTLAPp1==true))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2024-05-25 15:46:51] [INFO ] Applying decomposition
[2024-05-25 15:46:51] [INFO ] Flatten gal took : 8 ms
[2024-05-25 15:46:51] [INFO ] Decomposing Gal with order
[2024-05-25 15:46:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 15:46:51] [INFO ] Removed a total of 6 redundant transitions.
[2024-05-25 15:46:51] [INFO ] Flatten gal took : 14 ms
[2024-05-25 15:46:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2024-05-25 15:46:51] [INFO ] Time to serialize gal into /tmp/LTLFireability10287542178081470448.gal : 5 ms
[2024-05-25 15:46:51] [INFO ] Time to serialize properties into /tmp/LTLFireability4418533704733547133.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/LTLFireability10287542178081470448.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability4418533704733547133.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...277
Read 1 LTL properties
Checking formula 0 : !((("(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u18.p37!=1)")U((G("(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u18.p37!=1)"))||(("((i0.i0.i0.i0.i0....304
Formula 0 simplified : !"(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u18.p37!=1)" M (!"((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u18.p37!=1)&&(i1.u118.p291!=1))" | X(...234
Detected timeout of ITS tools.
[2024-05-25 16:08:07] [INFO ] Flatten gal took : 329 ms
[2024-05-25 16:08:07] [INFO ] Input system was already deterministic with 244 transitions.
[2024-05-25 16:08:08] [INFO ] Transformed 321 places.
[2024-05-25 16:08:08] [INFO ] Transformed 244 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-25 16:08:08] [INFO ] Time to serialize gal into /tmp/LTLFireability9747011781851370818.gal : 10 ms
[2024-05-25 16:08:08] [INFO ] Time to serialize properties into /tmp/LTLFireability15837911815079171180.ltl : 2 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/LTLFireability9747011781851370818.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability15837911815079171180.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--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...343
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((("(p37!=1)")U((G("(p37!=1)"))||(("((p37!=1)&&(p291!=1))")&&(X((F("(p37!=1)"))&&(X(G("(p332!=1)")))))))))
Formula 0 simplified : !"(p37!=1)" M (!"((p37!=1)&&(p291!=1))" | X(G!"(p37!=1)" | XF!"(p332!=1)"))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 149788 kB
After kill :
MemTotal: 16393340 kB
MemFree: 15855200 kB

BK_TIME_CONFINEMENT_REACHED

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

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