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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 528K
-rw-r--r-- 1 mcc users 7.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 15:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.1K Apr 11 16:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 66K Apr 11 16:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Apr 11 16:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Apr 11 16:31 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 131K 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-10-LTLCardinality-00
FORMULA_NAME BusinessProcesses-PT-10-LTLCardinality-01
FORMULA_NAME BusinessProcesses-PT-10-LTLCardinality-02
FORMULA_NAME BusinessProcesses-PT-10-LTLCardinality-03
FORMULA_NAME BusinessProcesses-PT-10-LTLCardinality-04
FORMULA_NAME BusinessProcesses-PT-10-LTLCardinality-05
FORMULA_NAME BusinessProcesses-PT-10-LTLCardinality-06
FORMULA_NAME BusinessProcesses-PT-10-LTLCardinality-07
FORMULA_NAME BusinessProcesses-PT-10-LTLCardinality-08
FORMULA_NAME BusinessProcesses-PT-10-LTLCardinality-09
FORMULA_NAME BusinessProcesses-PT-10-LTLCardinality-10
FORMULA_NAME BusinessProcesses-PT-10-LTLCardinality-11
FORMULA_NAME BusinessProcesses-PT-10-LTLCardinality-12
FORMULA_NAME BusinessProcesses-PT-10-LTLCardinality-13
FORMULA_NAME BusinessProcesses-PT-10-LTLCardinality-14
FORMULA_NAME BusinessProcesses-PT-10-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716650881051

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=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-10
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-25 15:28:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-25 15:28:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 15:28:03] [INFO ] Load time of PNML (sax parser for PT used): 83 ms
[2024-05-25 15:28:03] [INFO ] Transformed 518 places.
[2024-05-25 15:28:03] [INFO ] Transformed 471 transitions.
[2024-05-25 15:28:03] [INFO ] Found NUPN structural information;
[2024-05-25 15:28:03] [INFO ] Parsed PT model containing 518 places and 471 transitions and 1415 arcs in 179 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Initial state reduction rules removed 2 formulas.
FORMULA BusinessProcesses-PT-10-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-10-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-10-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-10-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-10-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 31 out of 518 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 518/518 places, 471/471 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 517 transition count 471
Discarding 71 places :
Symmetric choice reduction at 1 with 71 rule applications. Total rules 72 place count 446 transition count 400
Iterating global reduction 1 with 71 rules applied. Total rules applied 143 place count 446 transition count 400
Discarding 31 places :
Symmetric choice reduction at 1 with 31 rule applications. Total rules 174 place count 415 transition count 369
Iterating global reduction 1 with 31 rules applied. Total rules applied 205 place count 415 transition count 369
Applied a total of 205 rules in 114 ms. Remains 415 /518 variables (removed 103) and now considering 369/471 (removed 102) transitions.
// Phase 1: matrix 369 rows 415 cols
[2024-05-25 15:28:03] [INFO ] Computed 84 invariants in 28 ms
[2024-05-25 15:28:04] [INFO ] Implicit Places using invariants in 361 ms returned []
[2024-05-25 15:28:04] [INFO ] Invariant cache hit.
[2024-05-25 15:28:04] [INFO ] Implicit Places using invariants and state equation in 516 ms returned []
Implicit Place search using SMT with State Equation took 906 ms to find 0 implicit places.
[2024-05-25 15:28:04] [INFO ] Invariant cache hit.
[2024-05-25 15:28:04] [INFO ] Dead Transitions using invariants and state equation in 356 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 415/518 places, 369/471 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1379 ms. Remains : 415/518 places, 369/471 transitions.
Support contains 31 out of 415 places after structural reductions.
[2024-05-25 15:28:05] [INFO ] Flatten gal took : 83 ms
[2024-05-25 15:28:05] [INFO ] Flatten gal took : 36 ms
[2024-05-25 15:28:05] [INFO ] Input system was already deterministic with 369 transitions.
Incomplete random walk after 10000 steps, including 81 resets, run finished after 499 ms. (steps per millisecond=20 ) properties (out of 19) seen :14
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-25 15:28:06] [INFO ] Invariant cache hit.
[2024-05-25 15:28:06] [INFO ] After 139ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-25 15:28:06] [INFO ] [Nat]Absence check using 45 positive place invariants in 44 ms returned sat
[2024-05-25 15:28:06] [INFO ] [Nat]Absence check using 45 positive and 39 generalized place invariants in 11 ms returned sat
[2024-05-25 15:28:06] [INFO ] After 191ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2024-05-25 15:28:06] [INFO ] Deduced a trap composed of 8 places in 90 ms of which 7 ms to minimize.
[2024-05-25 15:28:07] [INFO ] Deduced a trap composed of 38 places in 133 ms of which 14 ms to minimize.
[2024-05-25 15:28:07] [INFO ] Deduced a trap composed of 34 places in 104 ms of which 1 ms to minimize.
[2024-05-25 15:28:07] [INFO ] Deduced a trap composed of 11 places in 102 ms of which 2 ms to minimize.
[2024-05-25 15:28:07] [INFO ] Deduced a trap composed of 21 places in 108 ms of which 21 ms to minimize.
[2024-05-25 15:28:07] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 0 ms to minimize.
[2024-05-25 15:28:07] [INFO ] Deduced a trap composed of 18 places in 73 ms of which 1 ms to minimize.
[2024-05-25 15:28:07] [INFO ] Deduced a trap composed of 18 places in 108 ms of which 1 ms to minimize.
[2024-05-25 15:28:07] [INFO ] Deduced a trap composed of 15 places in 91 ms of which 0 ms to minimize.
[2024-05-25 15:28:07] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 1 ms to minimize.
[2024-05-25 15:28:08] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 1 ms to minimize.
[2024-05-25 15:28:08] [INFO ] Deduced a trap composed of 22 places in 71 ms of which 0 ms to minimize.
[2024-05-25 15:28:08] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1303 ms
[2024-05-25 15:28:08] [INFO ] After 1588ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 29 ms.
[2024-05-25 15:28:08] [INFO ] After 1974ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 11 ms.
Support contains 2 out of 415 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 415/415 places, 369/369 transitions.
Graph (trivial) has 190 edges and 415 vertex of which 6 / 415 are part of one of the 1 SCC in 4 ms
Free SCC test removed 5 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 942 edges and 410 vertex of which 409 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 41 rules applied. Total rules applied 43 place count 409 transition count 320
Reduce places removed 41 places and 0 transitions.
Iterating post reduction 1 with 41 rules applied. Total rules applied 84 place count 368 transition count 320
Performed 86 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 86 Pre rules applied. Total rules applied 84 place count 368 transition count 234
Deduced a syphon composed of 86 places in 1 ms
Ensure Unique test removed 13 places
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 2 with 185 rules applied. Total rules applied 269 place count 269 transition count 234
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 278 place count 260 transition count 225
Iterating global reduction 2 with 9 rules applied. Total rules applied 287 place count 260 transition count 225
Performed 105 Post agglomeration using F-continuation condition.Transition count delta: 105
Deduced a syphon composed of 105 places in 1 ms
Ensure Unique test removed 4 places
Reduce places removed 109 places and 0 transitions.
Iterating global reduction 2 with 214 rules applied. Total rules applied 501 place count 151 transition count 120
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 503 place count 150 transition count 123
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 505 place count 150 transition count 121
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 507 place count 148 transition count 121
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 508 place count 148 transition count 121
Applied a total of 508 rules in 81 ms. Remains 148 /415 variables (removed 267) and now considering 121/369 (removed 248) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 81 ms. Remains : 148/415 places, 121/369 transitions.
Finished random walk after 279 steps, including 20 resets, run visited all 2 properties in 5 ms. (steps per millisecond=55 )
Parikh walk visited 0 properties in 0 ms.
FORMULA BusinessProcesses-PT-10-LTLCardinality-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 10 simplifications.
Computed a total of 205 stabilizing places and 210 stable transitions
Graph (complete) has 949 edges and 415 vertex of which 414 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.21 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 2 out of 415 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 415/415 places, 369/369 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 405 transition count 359
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 405 transition count 359
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 24 place count 401 transition count 355
Iterating global reduction 0 with 4 rules applied. Total rules applied 28 place count 401 transition count 355
Applied a total of 28 rules in 95 ms. Remains 401 /415 variables (removed 14) and now considering 355/369 (removed 14) transitions.
// Phase 1: matrix 355 rows 401 cols
[2024-05-25 15:28:08] [INFO ] Computed 84 invariants in 20 ms
[2024-05-25 15:28:09] [INFO ] Implicit Places using invariants in 237 ms returned []
[2024-05-25 15:28:09] [INFO ] Invariant cache hit.
[2024-05-25 15:28:09] [INFO ] Implicit Places using invariants and state equation in 311 ms returned []
Implicit Place search using SMT with State Equation took 550 ms to find 0 implicit places.
[2024-05-25 15:28:09] [INFO ] Invariant cache hit.
[2024-05-25 15:28:09] [INFO ] Dead Transitions using invariants and state equation in 167 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 401/415 places, 355/369 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 842 ms. Remains : 401/415 places, 355/369 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 240 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-10-LTLCardinality-00 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:(AND (EQ s105 0) (EQ s143 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 2 ms.
FORMULA BusinessProcesses-PT-10-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-10-LTLCardinality-00 finished in 1150 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 1 out of 415 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 415/415 places, 369/369 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 405 transition count 359
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 405 transition count 359
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 24 place count 401 transition count 355
Iterating global reduction 0 with 4 rules applied. Total rules applied 28 place count 401 transition count 355
Applied a total of 28 rules in 51 ms. Remains 401 /415 variables (removed 14) and now considering 355/369 (removed 14) transitions.
// Phase 1: matrix 355 rows 401 cols
[2024-05-25 15:28:09] [INFO ] Computed 84 invariants in 4 ms
[2024-05-25 15:28:10] [INFO ] Implicit Places using invariants in 487 ms returned []
[2024-05-25 15:28:10] [INFO ] Invariant cache hit.
[2024-05-25 15:28:10] [INFO ] Implicit Places using invariants and state equation in 360 ms returned []
Implicit Place search using SMT with State Equation took 849 ms to find 0 implicit places.
[2024-05-25 15:28:10] [INFO ] Invariant cache hit.
[2024-05-25 15:28:10] [INFO ] Dead Transitions using invariants and state equation in 181 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 401/415 places, 355/369 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1096 ms. Remains : 401/415 places, 355/369 transitions.
Stuttering acceptance computed with spot in 133 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-10-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(EQ s264 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 47657 steps with 394 reset in 208 ms.
FORMULA BusinessProcesses-PT-10-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-10-LTLCardinality-01 finished in 1458 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 415 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 415/415 places, 369/369 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 404 transition count 358
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 404 transition count 358
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 26 place count 400 transition count 354
Iterating global reduction 0 with 4 rules applied. Total rules applied 30 place count 400 transition count 354
Applied a total of 30 rules in 21 ms. Remains 400 /415 variables (removed 15) and now considering 354/369 (removed 15) transitions.
// Phase 1: matrix 354 rows 400 cols
[2024-05-25 15:28:11] [INFO ] Computed 84 invariants in 5 ms
[2024-05-25 15:28:11] [INFO ] Implicit Places using invariants in 284 ms returned []
[2024-05-25 15:28:11] [INFO ] Invariant cache hit.
[2024-05-25 15:28:12] [INFO ] Implicit Places using invariants and state equation in 427 ms returned []
Implicit Place search using SMT with State Equation took 713 ms to find 0 implicit places.
[2024-05-25 15:28:12] [INFO ] Invariant cache hit.
[2024-05-25 15:28:12] [INFO ] Dead Transitions using invariants and state equation in 171 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 400/415 places, 354/369 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 919 ms. Remains : 400/415 places, 354/369 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-10-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s9 0) (EQ s389 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 341 ms.
Product exploration explored 100000 steps with 50000 reset in 393 ms.
Computed a total of 195 stabilizing places and 200 stable transitions
Graph (complete) has 927 edges and 400 vertex of which 399 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.11 ms
Computed a total of 195 stabilizing places and 200 stable transitions
Detected a total of 195/400 stabilizing places and 200/354 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 29 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-10-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-10-LTLCardinality-02 finished in 1793 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 1 out of 415 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 415/415 places, 369/369 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 404 transition count 358
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 404 transition count 358
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 26 place count 400 transition count 354
Iterating global reduction 0 with 4 rules applied. Total rules applied 30 place count 400 transition count 354
Applied a total of 30 rules in 28 ms. Remains 400 /415 variables (removed 15) and now considering 354/369 (removed 15) transitions.
[2024-05-25 15:28:13] [INFO ] Invariant cache hit.
[2024-05-25 15:28:13] [INFO ] Implicit Places using invariants in 216 ms returned []
[2024-05-25 15:28:13] [INFO ] Invariant cache hit.
[2024-05-25 15:28:13] [INFO ] Implicit Places using invariants and state equation in 463 ms returned []
Implicit Place search using SMT with State Equation took 681 ms to find 0 implicit places.
[2024-05-25 15:28:13] [INFO ] Invariant cache hit.
[2024-05-25 15:28:14] [INFO ] Dead Transitions using invariants and state equation in 303 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 400/415 places, 354/369 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1017 ms. Remains : 400/415 places, 354/369 transitions.
Stuttering acceptance computed with spot in 188 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-10-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(EQ s241 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 108 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-10-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-10-LTLCardinality-03 finished in 1227 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 415 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 415/415 places, 369/369 transitions.
Graph (trivial) has 189 edges and 415 vertex of which 6 / 415 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 943 edges and 410 vertex of which 409 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 42 place count 408 transition count 321
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 1 with 40 rules applied. Total rules applied 82 place count 368 transition count 321
Performed 86 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 86 Pre rules applied. Total rules applied 82 place count 368 transition count 235
Deduced a syphon composed of 86 places in 0 ms
Ensure Unique test removed 12 places
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 2 with 184 rules applied. Total rules applied 266 place count 270 transition count 235
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 277 place count 259 transition count 224
Iterating global reduction 2 with 11 rules applied. Total rules applied 288 place count 259 transition count 224
Performed 102 Post agglomeration using F-continuation condition.Transition count delta: 102
Deduced a syphon composed of 102 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 107 places and 0 transitions.
Iterating global reduction 2 with 209 rules applied. Total rules applied 497 place count 152 transition count 122
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 499 place count 151 transition count 125
Applied a total of 499 rules in 49 ms. Remains 151 /415 variables (removed 264) and now considering 125/369 (removed 244) transitions.
// Phase 1: matrix 125 rows 151 cols
[2024-05-25 15:28:14] [INFO ] Computed 67 invariants in 2 ms
[2024-05-25 15:28:14] [INFO ] Implicit Places using invariants in 117 ms returned [1, 2, 3, 7, 11, 12, 25, 26, 27, 28, 29, 30, 53, 54, 113]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 120 ms to find 15 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 136/415 places, 125/369 transitions.
Applied a total of 0 rules in 7 ms. Remains 136 /136 variables (removed 0) and now considering 125/125 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 176 ms. Remains : 136/415 places, 125/369 transitions.
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-10-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (NEQ s5 0) (NEQ s2 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-10-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-10-LTLCardinality-06 finished in 293 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((!p0 U (F(p2)||p1))))))'
Support contains 4 out of 415 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 415/415 places, 369/369 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 407 transition count 361
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 407 transition count 361
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 19 place count 404 transition count 358
Iterating global reduction 0 with 3 rules applied. Total rules applied 22 place count 404 transition count 358
Applied a total of 22 rules in 25 ms. Remains 404 /415 variables (removed 11) and now considering 358/369 (removed 11) transitions.
// Phase 1: matrix 358 rows 404 cols
[2024-05-25 15:28:14] [INFO ] Computed 84 invariants in 5 ms
[2024-05-25 15:28:14] [INFO ] Implicit Places using invariants in 215 ms returned []
[2024-05-25 15:28:14] [INFO ] Invariant cache hit.
[2024-05-25 15:28:15] [INFO ] Implicit Places using invariants and state equation in 783 ms returned []
Implicit Place search using SMT with State Equation took 1022 ms to find 0 implicit places.
[2024-05-25 15:28:15] [INFO ] Invariant cache hit.
[2024-05-25 15:28:15] [INFO ] Dead Transitions using invariants and state equation in 219 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 404/415 places, 358/369 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1271 ms. Remains : 404/415 places, 358/369 transitions.
Stuttering acceptance computed with spot in 251 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : BusinessProcesses-PT-10-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2) p0), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(OR (EQ s323 0) (EQ s326 1)), p2:(OR (EQ s339 0) (EQ s196 1)), p0:(OR (EQ s323 0) (EQ s326 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 817 reset in 286 ms.
Product exploration explored 100000 steps with 829 reset in 314 ms.
Computed a total of 195 stabilizing places and 200 stable transitions
Graph (complete) has 936 edges and 404 vertex of which 403 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 195 stabilizing places and 200 stable transitions
Knowledge obtained : [(AND p1 p2 p0), true, (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 113 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 213 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 84 resets, run finished after 137 ms. (steps per millisecond=72 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 17 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 3) 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 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 905028 steps, run timeout after 3001 ms. (steps per millisecond=301 ) properties seen :{2=1}
Probabilistic random walk after 905028 steps, saw 128864 distinct states, run finished after 3003 ms. (steps per millisecond=301 ) properties seen :1
Running SMT prover for 2 properties.
[2024-05-25 15:28:20] [INFO ] Invariant cache hit.
[2024-05-25 15:28:20] [INFO ] After 57ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2024-05-25 15:28:20] [INFO ] [Nat]Absence check using 45 positive place invariants in 11 ms returned sat
[2024-05-25 15:28:20] [INFO ] [Nat]Absence check using 45 positive and 39 generalized place invariants in 10 ms returned sat
[2024-05-25 15:28:20] [INFO ] After 81ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p1 p2 p0), true, (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (G (NOT (AND p0 (NOT p1) (NOT p2)))), (G (NOT (AND (NOT p0) (NOT p1) (NOT p2))))]
False Knowledge obtained : [(F (NOT p2))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 14 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-10-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-10-LTLCardinality-08 finished in 5932 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((G(p0)||(G(p2)&&p1)))))'
Support contains 4 out of 415 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 415/415 places, 369/369 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 405 transition count 359
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 405 transition count 359
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 23 place count 402 transition count 356
Iterating global reduction 0 with 3 rules applied. Total rules applied 26 place count 402 transition count 356
Applied a total of 26 rules in 39 ms. Remains 402 /415 variables (removed 13) and now considering 356/369 (removed 13) transitions.
// Phase 1: matrix 356 rows 402 cols
[2024-05-25 15:28:20] [INFO ] Computed 84 invariants in 3 ms
[2024-05-25 15:28:20] [INFO ] Implicit Places using invariants in 183 ms returned []
[2024-05-25 15:28:20] [INFO ] Invariant cache hit.
[2024-05-25 15:28:21] [INFO ] Implicit Places using invariants and state equation in 364 ms returned []
Implicit Place search using SMT with State Equation took 562 ms to find 0 implicit places.
[2024-05-25 15:28:21] [INFO ] Invariant cache hit.
[2024-05-25 15:28:21] [INFO ] Dead Transitions using invariants and state equation in 210 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 402/415 places, 356/369 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 818 ms. Remains : 402/415 places, 356/369 transitions.
Stuttering acceptance computed with spot in 126 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : BusinessProcesses-PT-10-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), acceptance={0} source=0 dest: 0}, { cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p0 p1 p2), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1 p2), acceptance={1} source=0 dest: 1}], [{ cond=(AND p0 (NOT p2)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=1 dest: 0}, { cond=(AND p0 p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={1} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p0:(OR (EQ s360 0) (EQ s99 1)), p1:(AND (EQ s99 0) (EQ s360 1)), p2:(OR (EQ s299 0) (EQ s6 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 816 reset in 263 ms.
Product exploration explored 100000 steps with 828 reset in 346 ms.
Computed a total of 197 stabilizing places and 202 stable transitions
Graph (complete) has 929 edges and 402 vertex of which 401 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Computed a total of 197 stabilizing places and 202 stable transitions
Detected a total of 197/402 stabilizing places and 202/356 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))), (X (NOT (AND p0 p1 p2))), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (X (NOT (AND (NOT p0) p1 p2))), (X (X (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (AND p0 p2))), (X (X (NOT (AND (NOT p0) 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 16 factoid took 1386 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 16 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 281 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), false, false]
Incomplete random walk after 10000 steps, including 81 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 8) seen :5
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-25 15:28:24] [INFO ] Invariant cache hit.
[2024-05-25 15:28:24] [INFO ] After 137ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:2
[2024-05-25 15:28:24] [INFO ] [Nat]Absence check using 45 positive place invariants in 13 ms returned sat
[2024-05-25 15:28:24] [INFO ] [Nat]Absence check using 45 positive and 39 generalized place invariants in 11 ms returned sat
[2024-05-25 15:28:24] [INFO ] After 266ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :0
Fused 3 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))), (X (NOT (AND p0 p1 p2))), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (X (NOT (AND (NOT p0) p1 p2))), (X (X (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (AND p0 p2))), (X (X (NOT (AND (NOT p0) p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (G (NOT (AND (NOT p0) (NOT p2)))), (G (NOT (AND p0 p1 p2))), (G (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(F (AND p0 (NOT p2))), (F (AND (NOT p0) p1 p2)), (F (NOT (AND p0 p2))), (F (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))))), (F (AND (NOT p0) p2))]
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 19 factoid took 1648 ms. Reduced automaton from 5 states, 16 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-10-LTLCardinality-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-10-LTLCardinality-09 finished in 5632 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F((p1 U F((X(X(p1))||X(p1)))))||p0)))'
Support contains 4 out of 415 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 415/415 places, 369/369 transitions.
Graph (trivial) has 187 edges and 415 vertex of which 6 / 415 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 943 edges and 410 vertex of which 409 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 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 40 place count 408 transition count 323
Reduce places removed 38 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 40 rules applied. Total rules applied 80 place count 370 transition count 321
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 82 place count 368 transition count 321
Performed 85 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 85 Pre rules applied. Total rules applied 82 place count 368 transition count 236
Deduced a syphon composed of 85 places in 0 ms
Ensure Unique test removed 12 places
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 3 with 182 rules applied. Total rules applied 264 place count 271 transition count 236
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 273 place count 262 transition count 227
Iterating global reduction 3 with 9 rules applied. Total rules applied 282 place count 262 transition count 227
Performed 103 Post agglomeration using F-continuation condition.Transition count delta: 103
Deduced a syphon composed of 103 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 108 places and 0 transitions.
Iterating global reduction 3 with 211 rules applied. Total rules applied 493 place count 154 transition count 124
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 495 place count 153 transition count 127
Applied a total of 495 rules in 65 ms. Remains 153 /415 variables (removed 262) and now considering 127/369 (removed 242) transitions.
// Phase 1: matrix 127 rows 153 cols
[2024-05-25 15:28:26] [INFO ] Computed 67 invariants in 1 ms
[2024-05-25 15:28:26] [INFO ] Implicit Places using invariants in 143 ms returned [1, 2, 3, 4, 5, 6, 7, 21, 22, 23, 26, 27, 28, 51, 52, 116]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 145 ms to find 16 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 137/415 places, 127/369 transitions.
Applied a total of 0 rules in 5 ms. Remains 137 /137 variables (removed 0) and now considering 127/127 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 215 ms. Remains : 137/415 places, 127/369 transitions.
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-10-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s105 0) (EQ s8 1)), p1:(OR (EQ s15 0) (EQ s108 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 20149 reset in 209 ms.
Product exploration explored 100000 steps with 20194 reset in 198 ms.
Computed a total of 66 stabilizing places and 81 stable transitions
Computed a total of 66 stabilizing places and 81 stable transitions
Knowledge obtained : [(AND p0 p1), (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 139 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Finished random walk after 6873 steps, including 1606 resets, run visited all 2 properties in 28 ms. (steps per millisecond=245 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 3 factoid took 197 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 4 out of 137 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 137/137 places, 127/127 transitions.
Applied a total of 0 rules in 4 ms. Remains 137 /137 variables (removed 0) and now considering 127/127 (removed 0) transitions.
// Phase 1: matrix 127 rows 137 cols
[2024-05-25 15:28:27] [INFO ] Computed 51 invariants in 2 ms
[2024-05-25 15:28:27] [INFO ] Implicit Places using invariants in 116 ms returned []
[2024-05-25 15:28:27] [INFO ] Invariant cache hit.
[2024-05-25 15:28:27] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-25 15:28:27] [INFO ] Implicit Places using invariants and state equation in 188 ms returned [16, 73, 79, 85, 87]
Discarding 5 places :
Implicit Place search using SMT with State Equation took 317 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 132/137 places, 127/127 transitions.
Graph (complete) has 485 edges and 132 vertex of which 123 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.0 ms
Discarding 9 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 123 transition count 122
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 122 transition count 122
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 12 place count 113 transition count 86
Iterating global reduction 2 with 9 rules applied. Total rules applied 21 place count 113 transition count 86
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 25 place count 111 transition count 84
Applied a total of 25 rules in 9 ms. Remains 111 /132 variables (removed 21) and now considering 84/127 (removed 43) transitions.
// Phase 1: matrix 84 rows 111 cols
[2024-05-25 15:28:27] [INFO ] Computed 41 invariants in 1 ms
[2024-05-25 15:28:27] [INFO ] Implicit Places using invariants in 78 ms returned [16, 17, 18]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 79 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 108/137 places, 84/127 transitions.
Applied a total of 0 rules in 4 ms. Remains 108 /108 variables (removed 0) and now considering 84/84 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 413 ms. Remains : 108/137 places, 84/127 transitions.
Computed a total of 37 stabilizing places and 38 stable transitions
Computed a total of 37 stabilizing places and 38 stable transitions
Knowledge obtained : [(AND p0 p1), (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 108 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Finished random walk after 601 steps, including 140 resets, run visited all 2 properties in 3 ms. (steps per millisecond=200 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 3 factoid took 126 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 87 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 20929 reset in 126 ms.
Product exploration explored 100000 steps with 20906 reset in 209 ms.
Built C files in :
/tmp/ltsmin8339446360939344900
[2024-05-25 15:28:28] [INFO ] Computing symmetric may disable matrix : 84 transitions.
[2024-05-25 15:28:28] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 15:28:28] [INFO ] Computing symmetric may enable matrix : 84 transitions.
[2024-05-25 15:28:28] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 15:28:28] [INFO ] Computing Do-Not-Accords matrix : 84 transitions.
[2024-05-25 15:28:28] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 15:28:28] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8339446360939344900
Running compilation step : cd /tmp/ltsmin8339446360939344900;'/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 407 ms.
Running link step : cd /tmp/ltsmin8339446360939344900;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 60 ms.
Running LTSmin : cd /tmp/ltsmin8339446360939344900;'/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/stateBased15192670255799634988.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 84/84 transitions.
Applied a total of 0 rules in 10 ms. Remains 108 /108 variables (removed 0) and now considering 84/84 (removed 0) transitions.
// Phase 1: matrix 84 rows 108 cols
[2024-05-25 15:28:44] [INFO ] Computed 38 invariants in 1 ms
[2024-05-25 15:28:44] [INFO ] Implicit Places using invariants in 108 ms returned []
[2024-05-25 15:28:44] [INFO ] Invariant cache hit.
[2024-05-25 15:28:44] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-25 15:28:44] [INFO ] Implicit Places using invariants and state equation in 115 ms returned [54, 57, 59]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 225 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 105/108 places, 84/84 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 105 transition count 81
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 102 transition count 81
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 7 place count 101 transition count 79
Iterating global reduction 2 with 1 rules applied. Total rules applied 8 place count 101 transition count 79
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 5 places
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 23 rules applied. Total rules applied 31 place count 87 transition count 70
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 34 place count 84 transition count 67
Iterating global reduction 2 with 3 rules applied. Total rules applied 37 place count 84 transition count 67
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 39 place count 83 transition count 66
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 40 place count 83 transition count 65
Applied a total of 40 rules in 15 ms. Remains 83 /105 variables (removed 22) and now considering 65/84 (removed 19) transitions.
// Phase 1: matrix 65 rows 83 cols
[2024-05-25 15:28:44] [INFO ] Computed 30 invariants in 1 ms
[2024-05-25 15:28:44] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-05-25 15:28:44] [INFO ] Invariant cache hit.
[2024-05-25 15:28:44] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-25 15:28:44] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 179 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 83/108 places, 65/84 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 430 ms. Remains : 83/108 places, 65/84 transitions.
Built C files in :
/tmp/ltsmin889057933337712522
[2024-05-25 15:28:44] [INFO ] Computing symmetric may disable matrix : 65 transitions.
[2024-05-25 15:28:44] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 15:28:44] [INFO ] Computing symmetric may enable matrix : 65 transitions.
[2024-05-25 15:28:44] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 15:28:44] [INFO ] Computing Do-Not-Accords matrix : 65 transitions.
[2024-05-25 15:28:44] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 15:28:44] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin889057933337712522
Running compilation step : cd /tmp/ltsmin889057933337712522;'/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 162 ms.
Running link step : cd /tmp/ltsmin889057933337712522;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin889057933337712522;'/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/stateBased4734402150246562646.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-25 15:28:59] [INFO ] Flatten gal took : 9 ms
[2024-05-25 15:28:59] [INFO ] Flatten gal took : 8 ms
[2024-05-25 15:28:59] [INFO ] Time to serialize gal into /tmp/LTL6270520895455391101.gal : 3 ms
[2024-05-25 15:28:59] [INFO ] Time to serialize properties into /tmp/LTL15126360947154652934.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/LTL6270520895455391101.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5251326610531485747.hoa' '-atoms' '/tmp/LTL15126360947154652934.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...318
Loading property file /tmp/LTL15126360947154652934.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5251326610531485747.hoa
Detected timeout of ITS tools.
[2024-05-25 15:29:14] [INFO ] Flatten gal took : 9 ms
[2024-05-25 15:29:14] [INFO ] Flatten gal took : 7 ms
[2024-05-25 15:29:14] [INFO ] Time to serialize gal into /tmp/LTL10866618945609969371.gal : 2 ms
[2024-05-25 15:29:14] [INFO ] Time to serialize properties into /tmp/LTL6864561595975807278.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/LTL10866618945609969371.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6864561595975807278.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 : !((G(((F(("((p131==0)||(p468==1))")U(F((X(X("((p131==0)||(p468==1))")))||(X("((p131==0)||(p468==1))"))))))||("(p465==0)"))||("(p90==1)...160
Formula 0 simplified : F(!"(p90==1)" & !"(p465==0)" & XG(!"((p131==0)||(p468==1))" & X!"((p131==0)||(p468==1))"))
Detected timeout of ITS tools.
[2024-05-25 15:29:29] [INFO ] Flatten gal took : 14 ms
[2024-05-25 15:29:29] [INFO ] Applying decomposition
[2024-05-25 15:29:29] [INFO ] Flatten gal took : 13 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/graph5759819406407042431.txt' '-o' '/tmp/graph5759819406407042431.bin' '-w' '/tmp/graph5759819406407042431.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph5759819406407042431.bin' '-l' '-1' '-v' '-w' '/tmp/graph5759819406407042431.weights' '-q' '0' '-e' '0.001'
[2024-05-25 15:29:29] [INFO ] Decomposing Gal with order
[2024-05-25 15:29:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 15:29:30] [INFO ] Removed a total of 82 redundant transitions.
[2024-05-25 15:29:30] [INFO ] Flatten gal took : 39 ms
[2024-05-25 15:29:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 25 labels/synchronizations in 13 ms.
[2024-05-25 15:29:30] [INFO ] Time to serialize gal into /tmp/LTL6208504632515124548.gal : 4 ms
[2024-05-25 15:29:30] [INFO ] Time to serialize properties into /tmp/LTL2804097398812534112.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6208504632515124548.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2804097398812534112.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 : !((G(((F(("((i3.u6.p131==0)||(i8.i1.u32.p468==1))")U(F((X(X("((i3.u6.p131==0)||(i8.i1.u32.p468==1))")))||(X("((i3.u6.p131==0)||(i8.i1....224
Formula 0 simplified : F(!"(i4.i1.u4.p90==1)" & !"(i7.u31.p465==0)" & XG(!"((i3.u6.p131==0)||(i8.i1.u32.p468==1))" & X!"((i3.u6.p131==0)||(i8.i1.u32.p468==...161
Reverse transition relation is NOT exact ! Due to transitions t16, t18, t41_t43_t44_t6, t29_t31_t32_t7, t26_t27_t8, t23_t24_t9, t20_t21_t10, t49_t121_t234_...1193
Computing Next relation with stutter on 4.98893e+07 deadlock states
2 unique states visited
0 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
206 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,2.09631,52516,1,0,58733,5727,1875,178489,312,39077,85858
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA BusinessProcesses-PT-10-LTLCardinality-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property BusinessProcesses-PT-10-LTLCardinality-10 finished in 66217 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 415 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 415/415 places, 369/369 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 404 transition count 358
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 404 transition count 358
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 26 place count 400 transition count 354
Iterating global reduction 0 with 4 rules applied. Total rules applied 30 place count 400 transition count 354
Applied a total of 30 rules in 39 ms. Remains 400 /415 variables (removed 15) and now considering 354/369 (removed 15) transitions.
// Phase 1: matrix 354 rows 400 cols
[2024-05-25 15:29:32] [INFO ] Computed 84 invariants in 2 ms
[2024-05-25 15:29:33] [INFO ] Implicit Places using invariants in 629 ms returned []
[2024-05-25 15:29:33] [INFO ] Invariant cache hit.
[2024-05-25 15:29:33] [INFO ] Implicit Places using invariants and state equation in 402 ms returned []
Implicit Place search using SMT with State Equation took 1040 ms to find 0 implicit places.
[2024-05-25 15:29:33] [INFO ] Invariant cache hit.
[2024-05-25 15:29:33] [INFO ] Dead Transitions using invariants and state equation in 214 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 400/415 places, 354/369 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1306 ms. Remains : 400/415 places, 354/369 transitions.
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-10-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s281 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 150 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-10-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-10-LTLCardinality-13 finished in 1398 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((X((!p0 U (G(!p0)||(!p0&&G(!p1))))) U (X(G(!p0))||(G(!p2)&&X((!p0 U (G(!p0)||(!p0&&G(!p1)))))))) U p1)))'
Support contains 6 out of 415 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 415/415 places, 369/369 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 406 transition count 360
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 406 transition count 360
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 22 place count 402 transition count 356
Iterating global reduction 0 with 4 rules applied. Total rules applied 26 place count 402 transition count 356
Applied a total of 26 rules in 21 ms. Remains 402 /415 variables (removed 13) and now considering 356/369 (removed 13) transitions.
// Phase 1: matrix 356 rows 402 cols
[2024-05-25 15:29:33] [INFO ] Computed 84 invariants in 2 ms
[2024-05-25 15:29:34] [INFO ] Implicit Places using invariants in 123 ms returned []
[2024-05-25 15:29:34] [INFO ] Invariant cache hit.
[2024-05-25 15:29:34] [INFO ] Implicit Places using invariants and state equation in 383 ms returned []
Implicit Place search using SMT with State Equation took 524 ms to find 0 implicit places.
[2024-05-25 15:29:34] [INFO ] Invariant cache hit.
[2024-05-25 15:29:34] [INFO ] Dead Transitions using invariants and state equation in 197 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 402/415 places, 356/369 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 747 ms. Remains : 402/415 places, 356/369 transitions.
Stuttering acceptance computed with spot in 290 ms :[(NOT p1), true, (NOT p1), (OR (NOT p1) p0), p0, p0, (OR (AND p0 p1) (AND p0 p2)), (OR p2 p1)]
Running random walk in product with property : BusinessProcesses-PT-10-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=p0, acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 3}, { cond=(AND p1 p2 (NOT p0)), acceptance={0} source=3 dest: 4}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={0} source=3 dest: 5}], [{ cond=p0, acceptance={} source=4 dest: 1}, { cond=(AND p2 (NOT p0)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=4 dest: 5}], [{ cond=p0, acceptance={} source=5 dest: 1}, { cond=(AND p2 (NOT p0)), acceptance={} source=5 dest: 4}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=5 dest: 6}], [{ cond=(OR (AND p1 p0) (AND p2 p0)), acceptance={} source=6 dest: 1}, { cond=(AND p2 (NOT p0)), acceptance={} source=6 dest: 4}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=6 dest: 7}], [{ cond=(OR p1 p2), acceptance={} source=7 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=7 dest: 7}]], initial=2, aps=[p1:(OR (EQ s188 0) (EQ s283 1)), p0:(OR (EQ s296 0) (EQ s328 1)), p2:(OR (EQ s227 0) (EQ s326 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, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 269 ms.
Product exploration explored 100000 steps with 50000 reset in 286 ms.
Computed a total of 196 stabilizing places and 201 stable transitions
Graph (complete) has 931 edges and 402 vertex of which 401 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 196 stabilizing places and 201 stable transitions
Detected a total of 196/402 stabilizing places and 201/356 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p1 p0 p2), (X p1), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 15 ms. Reduced automaton from 8 states, 21 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-10-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-10-LTLCardinality-14 finished in 1653 ms.
All properties solved by simple procedures.
Total runtime 92303 ms.

BK_STOP 1716650975703

--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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-10"
export BK_EXAMINATION="LTLCardinality"
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-10, examination is LTLCardinality"
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-171620414900327"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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