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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 432K
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K 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 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 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 6.0K Apr 11 16:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 53K Apr 11 16:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Apr 11 16:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Apr 11 16:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.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 79K 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-04-LTLCardinality-00
FORMULA_NAME BusinessProcesses-PT-04-LTLCardinality-01
FORMULA_NAME BusinessProcesses-PT-04-LTLCardinality-02
FORMULA_NAME BusinessProcesses-PT-04-LTLCardinality-03
FORMULA_NAME BusinessProcesses-PT-04-LTLCardinality-04
FORMULA_NAME BusinessProcesses-PT-04-LTLCardinality-05
FORMULA_NAME BusinessProcesses-PT-04-LTLCardinality-06
FORMULA_NAME BusinessProcesses-PT-04-LTLCardinality-07
FORMULA_NAME BusinessProcesses-PT-04-LTLCardinality-08
FORMULA_NAME BusinessProcesses-PT-04-LTLCardinality-09
FORMULA_NAME BusinessProcesses-PT-04-LTLCardinality-10
FORMULA_NAME BusinessProcesses-PT-04-LTLCardinality-11
FORMULA_NAME BusinessProcesses-PT-04-LTLCardinality-12
FORMULA_NAME BusinessProcesses-PT-04-LTLCardinality-13
FORMULA_NAME BusinessProcesses-PT-04-LTLCardinality-14
FORMULA_NAME BusinessProcesses-PT-04-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716650379925

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-04
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-25 15:19:42] [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:19:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 15:19:42] [INFO ] Load time of PNML (sax parser for PT used): 63 ms
[2024-05-25 15:19:42] [INFO ] Transformed 288 places.
[2024-05-25 15:19:42] [INFO ] Transformed 283 transitions.
[2024-05-25 15:19:42] [INFO ] Found NUPN structural information;
[2024-05-25 15:19:42] [INFO ] Parsed PT model containing 288 places and 283 transitions and 916 arcs in 160 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 25 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 2 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA BusinessProcesses-PT-04-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-04-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-04-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-04-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-04-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-04-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-04-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-04-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-04-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 27 out of 286 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 286/286 places, 281/281 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 283 transition count 281
Discarding 36 places :
Symmetric choice reduction at 1 with 36 rule applications. Total rules 39 place count 247 transition count 245
Iterating global reduction 1 with 36 rules applied. Total rules applied 75 place count 247 transition count 245
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 91 place count 231 transition count 229
Iterating global reduction 1 with 16 rules applied. Total rules applied 107 place count 231 transition count 229
Applied a total of 107 rules in 100 ms. Remains 231 /286 variables (removed 55) and now considering 229/281 (removed 52) transitions.
// Phase 1: matrix 229 rows 231 cols
[2024-05-25 15:19:42] [INFO ] Computed 41 invariants in 23 ms
[2024-05-25 15:19:43] [INFO ] Implicit Places using invariants in 290 ms returned []
[2024-05-25 15:19:43] [INFO ] Invariant cache hit.
[2024-05-25 15:19:43] [INFO ] Implicit Places using invariants and state equation in 395 ms returned []
Implicit Place search using SMT with State Equation took 713 ms to find 0 implicit places.
[2024-05-25 15:19:43] [INFO ] Invariant cache hit.
[2024-05-25 15:19:43] [INFO ] Dead Transitions using invariants and state equation in 171 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 231/286 places, 229/281 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 993 ms. Remains : 231/286 places, 229/281 transitions.
Support contains 27 out of 231 places after structural reductions.
[2024-05-25 15:19:44] [INFO ] Flatten gal took : 54 ms
[2024-05-25 15:19:44] [INFO ] Flatten gal took : 33 ms
[2024-05-25 15:19:44] [INFO ] Input system was already deterministic with 229 transitions.
Incomplete random walk after 10000 steps, including 101 resets, run finished after 171 ms. (steps per millisecond=58 ) properties (out of 13) seen :12
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-25 15:19:44] [INFO ] Invariant cache hit.
[2024-05-25 15:19:44] [INFO ] After 96ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 15:19:44] [INFO ] [Nat]Absence check using 19 positive place invariants in 7 ms returned sat
[2024-05-25 15:19:44] [INFO ] [Nat]Absence check using 19 positive and 22 generalized place invariants in 5 ms returned sat
[2024-05-25 15:19:44] [INFO ] After 63ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 1 atomic propositions for a total of 7 simplifications.
Computed a total of 206 stabilizing places and 204 stable transitions
Graph (complete) has 569 edges and 231 vertex of which 230 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
FORMULA BusinessProcesses-PT-04-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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((F(p0)&&(X(X(p1))||(!p2 U (p3||G(!p2)))))))'
Support contains 8 out of 231 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 231/231 places, 229/229 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 224 transition count 222
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 224 transition count 222
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 224 transition count 221
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 17 place count 222 transition count 219
Iterating global reduction 1 with 2 rules applied. Total rules applied 19 place count 222 transition count 219
Applied a total of 19 rules in 18 ms. Remains 222 /231 variables (removed 9) and now considering 219/229 (removed 10) transitions.
// Phase 1: matrix 219 rows 222 cols
[2024-05-25 15:19:44] [INFO ] Computed 41 invariants in 4 ms
[2024-05-25 15:19:45] [INFO ] Implicit Places using invariants in 210 ms returned []
[2024-05-25 15:19:45] [INFO ] Invariant cache hit.
[2024-05-25 15:19:45] [INFO ] Implicit Places using invariants and state equation in 531 ms returned []
Implicit Place search using SMT with State Equation took 743 ms to find 0 implicit places.
[2024-05-25 15:19:45] [INFO ] Invariant cache hit.
[2024-05-25 15:19:45] [INFO ] Dead Transitions using invariants and state equation in 148 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 222/231 places, 219/229 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 910 ms. Remains : 222/231 places, 219/229 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 834 ms :[(OR (NOT p0) (AND (NOT p1) p2 (NOT p3))), (NOT p0), (AND (NOT p1) p2 (NOT p3)), (OR (AND (NOT p1) p2 (NOT p3)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p3) p2 (NOT p1)), (AND (NOT p1) p2 (NOT p3)), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p1) p2 (NOT p3)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p3) p2)]
Running random walk in product with property : BusinessProcesses-PT-04-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p3) p2), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p0) (NOT p3) p2), acceptance={} source=2 dest: 6}, { cond=(AND (NOT p3) p2), acceptance={} source=2 dest: 7}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=3 dest: 5}, { cond=(NOT p0), acceptance={} source=3 dest: 6}, { cond=(AND (NOT p3) p2), acceptance={} source=3 dest: 7}], [{ cond=(AND (NOT p0) (NOT p3) p2 (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=4 dest: 8}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p0) (NOT p3) p2 (NOT p1)), acceptance={} source=5 dest: 6}, { cond=(AND (NOT p3) p2 (NOT p1)), acceptance={0} source=5 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 1}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=7 dest: 5}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=7 dest: 6}, { cond=(AND (NOT p3) p2 (NOT p1)), acceptance={0} source=7 dest: 7}], [{ cond=(AND (NOT p0) (NOT p3) p2), acceptance={} source=8 dest: 1}, { cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=8 dest: 8}]], initial=0, aps=[p0:(OR (EQ s154 0) (EQ s164 1)), p3:(AND (NOT (OR (EQ s157 0) (EQ s204 1))) (NOT (OR (EQ s155 0) (EQ s136 1)))), p2:(OR (EQ s155 0) (EQ s136 1)), p1:(OR (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], 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 33333 reset in 427 ms.
Product exploration explored 100000 steps with 33333 reset in 401 ms.
Computed a total of 198 stabilizing places and 196 stable transitions
Graph (complete) has 559 edges and 222 vertex of which 221 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 198 stabilizing places and 196 stable transitions
Detected a total of 198/222 stabilizing places and 196/219 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/4 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p3) p2 p1), (X (NOT (AND (NOT p0) (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p3) p2))), (X p0), (X (AND (NOT p3) p2)), (X (X (NOT (AND (NOT p3) p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p3) p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 15 factoid took 769 ms. Reduced automaton from 9 states, 23 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-04-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-04-LTLCardinality-03 finished in 3448 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 2 out of 231 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 231/231 places, 229/229 transitions.
Graph (trivial) has 104 edges and 231 vertex of which 7 / 231 are part of one of the 1 SCC in 9 ms
Free SCC test removed 6 places
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 561 edges and 225 vertex of which 224 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 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 22 place count 223 transition count 199
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 42 place count 203 transition count 199
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 49 Pre rules applied. Total rules applied 42 place count 203 transition count 150
Deduced a syphon composed of 49 places in 14 ms
Ensure Unique test removed 6 places
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 2 with 104 rules applied. Total rules applied 146 place count 148 transition count 150
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 153 place count 141 transition count 143
Iterating global reduction 2 with 7 rules applied. Total rules applied 160 place count 141 transition count 143
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 44
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 2 with 88 rules applied. Total rules applied 248 place count 97 transition count 99
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 252 place count 95 transition count 101
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 253 place count 94 transition count 100
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 254 place count 93 transition count 100
Applied a total of 254 rules in 146 ms. Remains 93 /231 variables (removed 138) and now considering 100/229 (removed 129) transitions.
// Phase 1: matrix 100 rows 93 cols
[2024-05-25 15:19:48] [INFO ] Computed 34 invariants in 5 ms
[2024-05-25 15:19:49] [INFO ] Implicit Places using invariants in 600 ms returned [37]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 604 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 92/231 places, 100/229 transitions.
Applied a total of 0 rules in 5 ms. Remains 92 /92 variables (removed 0) and now considering 100/100 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 755 ms. Remains : 92/231 places, 100/229 transitions.
Stuttering acceptance computed with spot in 81 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-04-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s24 0) (EQ s1 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-04-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-04-LTLCardinality-05 finished in 875 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 231 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 231/231 places, 229/229 transitions.
Graph (trivial) has 103 edges and 231 vertex of which 7 / 231 are part of one of the 1 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 561 edges and 225 vertex of which 224 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 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 22 place count 223 transition count 199
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 42 place count 203 transition count 199
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 47 Pre rules applied. Total rules applied 42 place count 203 transition count 152
Deduced a syphon composed of 47 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 142 place count 150 transition count 152
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 149 place count 143 transition count 145
Iterating global reduction 2 with 7 rules applied. Total rules applied 156 place count 143 transition count 145
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 252 place count 95 transition count 97
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 256 place count 93 transition count 99
Applied a total of 256 rules in 23 ms. Remains 93 /231 variables (removed 138) and now considering 99/229 (removed 130) transitions.
// Phase 1: matrix 99 rows 93 cols
[2024-05-25 15:19:49] [INFO ] Computed 35 invariants in 2 ms
[2024-05-25 15:19:49] [INFO ] Implicit Places using invariants in 93 ms returned [1, 11, 35, 36, 37]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 103 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 88/231 places, 99/229 transitions.
Applied a total of 0 rules in 4 ms. Remains 88 /88 variables (removed 0) and now considering 99/99 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 130 ms. Remains : 88/231 places, 99/229 transitions.
Stuttering acceptance computed with spot in 108 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-04-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s17 0) (EQ s41 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 4028 steps with 455 reset in 19 ms.
FORMULA BusinessProcesses-PT-04-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-04-LTLCardinality-07 finished in 284 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)) U p1))'
Support contains 5 out of 231 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 231/231 places, 229/229 transitions.
Graph (trivial) has 99 edges and 231 vertex of which 7 / 231 are part of one of the 1 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 561 edges and 225 vertex of which 224 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 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 20 place count 223 transition count 201
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 38 place count 205 transition count 201
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 47 Pre rules applied. Total rules applied 38 place count 205 transition count 154
Deduced a syphon composed of 47 places in 1 ms
Ensure Unique test removed 5 places
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 2 with 99 rules applied. Total rules applied 137 place count 153 transition count 154
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 143 place count 147 transition count 148
Iterating global reduction 2 with 6 rules applied. Total rules applied 149 place count 147 transition count 148
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 2 with 92 rules applied. Total rules applied 241 place count 101 transition count 102
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 245 place count 99 transition count 104
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 247 place count 99 transition count 104
Applied a total of 247 rules in 28 ms. Remains 99 /231 variables (removed 132) and now considering 104/229 (removed 125) transitions.
// Phase 1: matrix 104 rows 99 cols
[2024-05-25 15:19:49] [INFO ] Computed 36 invariants in 1 ms
[2024-05-25 15:19:49] [INFO ] Implicit Places using invariants in 67 ms returned [1, 11, 34, 35, 36, 37]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 68 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 93/231 places, 104/229 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 93 transition count 103
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 92 transition count 103
Applied a total of 2 rules in 7 ms. Remains 92 /93 variables (removed 1) and now considering 103/104 (removed 1) transitions.
// Phase 1: matrix 103 rows 92 cols
[2024-05-25 15:19:49] [INFO ] Computed 30 invariants in 3 ms
[2024-05-25 15:19:49] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-25 15:19:49] [INFO ] Invariant cache hit.
[2024-05-25 15:19:49] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-25 15:19:49] [INFO ] Implicit Places using invariants and state equation in 321 ms returned [1, 10, 35, 44, 46, 52]
Discarding 6 places :
Implicit Place search using SMT with State Equation took 387 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 86/231 places, 103/229 transitions.
Graph (complete) has 336 edges and 86 vertex of which 75 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.1 ms
Discarding 11 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 13 place count 63 transition count 56
Iterating global reduction 0 with 12 rules applied. Total rules applied 25 place count 63 transition count 56
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 0 with 2 rules applied. Total rules applied 27 place count 62 transition count 55
Applied a total of 27 rules in 6 ms. Remains 62 /86 variables (removed 24) and now considering 55/103 (removed 48) transitions.
// Phase 1: matrix 55 rows 62 cols
[2024-05-25 15:19:50] [INFO ] Computed 19 invariants in 2 ms
[2024-05-25 15:19:50] [INFO ] Implicit Places using invariants in 110 ms returned [1, 2, 5, 6, 7]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 115 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 57/231 places, 55/229 transitions.
Applied a total of 0 rules in 11 ms. Remains 57 /57 variables (removed 0) and now considering 55/55 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 4 iterations and 622 ms. Remains : 57/231 places, 55/229 transitions.
Stuttering acceptance computed with spot in 108 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-04-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s5 1), p0:(AND (NOT (OR (EQ s24 0) (EQ s44 1))) (OR (EQ s26 0) (EQ s31 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-04-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-04-LTLCardinality-08 finished in 748 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 231 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 231/231 places, 229/229 transitions.
Graph (trivial) has 103 edges and 231 vertex of which 7 / 231 are part of one of the 1 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 561 edges and 225 vertex of which 224 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 22 place count 224 transition count 200
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 42 place count 204 transition count 200
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 49 Pre rules applied. Total rules applied 42 place count 204 transition count 151
Deduced a syphon composed of 49 places in 1 ms
Ensure Unique test removed 6 places
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 2 with 104 rules applied. Total rules applied 146 place count 149 transition count 151
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 152 place count 143 transition count 145
Iterating global reduction 2 with 6 rules applied. Total rules applied 158 place count 143 transition count 145
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 254 place count 95 transition count 97
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 256 place count 94 transition count 100
Applied a total of 256 rules in 34 ms. Remains 94 /231 variables (removed 137) and now considering 100/229 (removed 129) transitions.
// Phase 1: matrix 100 rows 94 cols
[2024-05-25 15:19:50] [INFO ] Computed 35 invariants in 2 ms
[2024-05-25 15:19:50] [INFO ] Implicit Places using invariants in 72 ms returned [1, 11, 35, 36, 37]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 75 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 89/231 places, 100/229 transitions.
Applied a total of 0 rules in 3 ms. Remains 89 /89 variables (removed 0) and now considering 100/100 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 112 ms. Remains : 89/231 places, 100/229 transitions.
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-04-LTLCardinality-11 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:(OR (EQ s25 0) (EQ s54 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 9539 reset in 300 ms.
Product exploration explored 100000 steps with 9665 reset in 196 ms.
Computed a total of 82 stabilizing places and 93 stable transitions
Computed a total of 82 stabilizing places and 93 stable transitions
Detected a total of 82/89 stabilizing places and 93/100 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 167 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 92 ms :[(NOT p0), (NOT p0)]
Finished random walk after 248 steps, including 26 resets, run visited all 1 properties in 3 ms. (steps per millisecond=82 )
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 133 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 106 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 89 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 89/89 places, 100/100 transitions.
Applied a total of 0 rules in 4 ms. Remains 89 /89 variables (removed 0) and now considering 100/100 (removed 0) transitions.
// Phase 1: matrix 100 rows 89 cols
[2024-05-25 15:19:51] [INFO ] Computed 30 invariants in 2 ms
[2024-05-25 15:19:51] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-25 15:19:51] [INFO ] Invariant cache hit.
[2024-05-25 15:19:51] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-25 15:19:51] [INFO ] Implicit Places using invariants and state equation in 328 ms returned [1, 10, 34, 35, 44, 46, 52]
Discarding 7 places :
Implicit Place search using SMT with State Equation took 399 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 82/89 places, 100/100 transitions.
Graph (complete) has 332 edges and 82 vertex of which 71 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.0 ms
Discarding 11 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 13 place count 59 transition count 56
Iterating global reduction 0 with 12 rules applied. Total rules applied 25 place count 59 transition count 56
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 26 place count 58 transition count 55
Iterating global reduction 0 with 1 rules applied. Total rules applied 27 place count 58 transition count 55
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 31 place count 56 transition count 53
Applied a total of 31 rules in 7 ms. Remains 56 /82 variables (removed 26) and now considering 53/100 (removed 47) transitions.
// Phase 1: matrix 53 rows 56 cols
[2024-05-25 15:19:52] [INFO ] Computed 19 invariants in 1 ms
[2024-05-25 15:19:52] [INFO ] Implicit Places using invariants in 75 ms returned [1, 2, 7]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 78 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 53/89 places, 53/100 transitions.
Applied a total of 0 rules in 2 ms. Remains 53 /53 variables (removed 0) and now considering 53/53 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 491 ms. Remains : 53/89 places, 53/100 transitions.
Computed a total of 46 stabilizing places and 46 stable transitions
Computed a total of 46 stabilizing places and 46 stable transitions
Detected a total of 46/53 stabilizing places and 46/53 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 93 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 72 ms :[(NOT p0), (NOT p0)]
Finished random walk after 176 steps, including 22 resets, run visited all 1 properties in 2 ms. (steps per millisecond=88 )
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 131 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 85 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 124 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 10438 reset in 154 ms.
Product exploration explored 100000 steps with 10340 reset in 246 ms.
Built C files in :
/tmp/ltsmin8935118547319083183
[2024-05-25 15:19:53] [INFO ] Computing symmetric may disable matrix : 53 transitions.
[2024-05-25 15:19:53] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 15:19:53] [INFO ] Computing symmetric may enable matrix : 53 transitions.
[2024-05-25 15:19:53] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 15:19:53] [INFO ] Computing Do-Not-Accords matrix : 53 transitions.
[2024-05-25 15:19:53] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 15:19:53] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8935118547319083183
Running compilation step : cd /tmp/ltsmin8935118547319083183;'/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 367 ms.
Running link step : cd /tmp/ltsmin8935118547319083183;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 71 ms.
Running LTSmin : cd /tmp/ltsmin8935118547319083183;'/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/stateBased1964137494879613892.hoa' '--buchi-type=spotba'
LTSmin run took 465 ms.
FORMULA BusinessProcesses-PT-04-LTLCardinality-11 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property BusinessProcesses-PT-04-LTLCardinality-11 finished in 3870 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(p1)||p0))))'
Support contains 4 out of 231 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 231/231 places, 229/229 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 225 transition count 223
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 225 transition count 223
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 225 transition count 222
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 16 place count 222 transition count 219
Iterating global reduction 1 with 3 rules applied. Total rules applied 19 place count 222 transition count 219
Applied a total of 19 rules in 13 ms. Remains 222 /231 variables (removed 9) and now considering 219/229 (removed 10) transitions.
// Phase 1: matrix 219 rows 222 cols
[2024-05-25 15:19:54] [INFO ] Computed 41 invariants in 3 ms
[2024-05-25 15:19:54] [INFO ] Implicit Places using invariants in 123 ms returned []
[2024-05-25 15:19:54] [INFO ] Invariant cache hit.
[2024-05-25 15:19:54] [INFO ] Implicit Places using invariants and state equation in 265 ms returned []
Implicit Place search using SMT with State Equation took 393 ms to find 0 implicit places.
[2024-05-25 15:19:54] [INFO ] Invariant cache hit.
[2024-05-25 15:19:54] [INFO ] Dead Transitions using invariants and state equation in 133 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 222/231 places, 219/229 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 541 ms. Remains : 222/231 places, 219/229 transitions.
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-04-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p0:(OR (EQ s163 0) (EQ s152 1)), p1:(OR (EQ s98 0) (EQ s113 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 1100 reset in 227 ms.
Product exploration explored 100000 steps with 1081 reset in 274 ms.
Computed a total of 199 stabilizing places and 197 stable transitions
Graph (complete) has 559 edges and 222 vertex of which 221 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 199 stabilizing places and 197 stable transitions
Detected a total of 199/222 stabilizing places and 197/219 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (AND p0 p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (AND p0 p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 12 factoid took 233 ms. Reduced automaton from 2 states, 6 edges and 2 AP (stutter sensitive) to 2 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 108 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-25 15:19:55] [INFO ] Invariant cache hit.
[2024-05-25 15:19:55] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 15:19:55] [INFO ] [Nat]Absence check using 17 positive place invariants in 11 ms returned sat
[2024-05-25 15:19:55] [INFO ] [Nat]Absence check using 17 positive and 24 generalized place invariants in 8 ms returned sat
[2024-05-25 15:19:55] [INFO ] After 81ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 15:19:55] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 4 ms to minimize.
[2024-05-25 15:19:56] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 1 ms to minimize.
[2024-05-25 15:19:56] [INFO ] Deduced a trap composed of 42 places in 49 ms of which 1 ms to minimize.
[2024-05-25 15:19:56] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 1 ms to minimize.
[2024-05-25 15:19:56] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 232 ms
[2024-05-25 15:19:56] [INFO ] After 325ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2024-05-25 15:19:56] [INFO ] After 430ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 115 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=57 )
Parikh walk visited 1 properties in 2 ms.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (AND p0 p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (AND p0 p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p1) p0)), (F (NOT (AND p1 p0))), (F (NOT p0)), (F (AND (NOT p1) (NOT p0))), (F (AND p1 (NOT p0)))]
Knowledge based reduction with 12 factoid took 394 ms. Reduced automaton from 2 states, 7 edges and 2 AP (stutter insensitive) to 2 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 222 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 222/222 places, 219/219 transitions.
Graph (trivial) has 88 edges and 222 vertex of which 6 / 222 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 552 edges and 217 vertex of which 216 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 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 15 place count 215 transition count 198
Reduce places removed 13 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 202 transition count 196
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 32 place count 200 transition count 196
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 47 Pre rules applied. Total rules applied 32 place count 200 transition count 149
Deduced a syphon composed of 47 places in 1 ms
Ensure Unique test removed 6 places
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 3 with 100 rules applied. Total rules applied 132 place count 147 transition count 149
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 226 place count 100 transition count 102
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 228 place count 99 transition count 105
Applied a total of 228 rules in 37 ms. Remains 99 /222 variables (removed 123) and now considering 105/219 (removed 114) transitions.
// Phase 1: matrix 105 rows 99 cols
[2024-05-25 15:19:56] [INFO ] Computed 35 invariants in 3 ms
[2024-05-25 15:19:56] [INFO ] Implicit Places using invariants in 127 ms returned [1, 11, 34, 35]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 129 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 95/222 places, 105/219 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 95 transition count 104
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 94 transition count 104
Applied a total of 2 rules in 6 ms. Remains 94 /95 variables (removed 1) and now considering 104/105 (removed 1) transitions.
// Phase 1: matrix 104 rows 94 cols
[2024-05-25 15:19:56] [INFO ] Computed 31 invariants in 2 ms
[2024-05-25 15:19:57] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-25 15:19:57] [INFO ] Invariant cache hit.
[2024-05-25 15:19:57] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-25 15:19:57] [INFO ] Implicit Places using invariants and state equation in 154 ms returned [1, 10, 48, 50, 58]
Discarding 5 places :
Implicit Place search using SMT with State Equation took 239 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 89/222 places, 104/219 transitions.
Graph (complete) has 347 edges and 89 vertex of which 78 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.1 ms
Discarding 11 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 13 place count 66 transition count 57
Iterating global reduction 0 with 12 rules applied. Total rules applied 25 place count 66 transition count 57
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 26 place count 65 transition count 56
Iterating global reduction 0 with 1 rules applied. Total rules applied 27 place count 65 transition count 56
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 0 with 2 rules applied. Total rules applied 29 place count 64 transition count 55
Applied a total of 29 rules in 8 ms. Remains 64 /89 variables (removed 25) and now considering 55/104 (removed 49) transitions.
// Phase 1: matrix 55 rows 64 cols
[2024-05-25 15:19:57] [INFO ] Computed 20 invariants in 1 ms
[2024-05-25 15:19:57] [INFO ] Implicit Places using invariants in 60 ms returned [1, 2, 5, 6, 7]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 63 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 59/222 places, 55/219 transitions.
Applied a total of 0 rules in 2 ms. Remains 59 /59 variables (removed 0) and now considering 55/55 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 4 iterations and 484 ms. Remains : 59/222 places, 55/219 transitions.
Computed a total of 49 stabilizing places and 46 stable transitions
Graph (complete) has 175 edges and 59 vertex of which 58 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 49 stabilizing places and 46 stable transitions
Detected a total of 49/59 stabilizing places and 46/55 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (AND p1 p0)), (X p0), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p1 p0))), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 164 ms. Reduced automaton from 2 states, 7 edges and 2 AP (stutter insensitive) to 2 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 2254 steps, including 228 resets, run visited all 5 properties in 8 ms. (steps per millisecond=281 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (AND p1 p0)), (X p0), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p1 p0))), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (NOT (AND p0 p1))), (F (NOT p0)), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 12 factoid took 446 ms. Reduced automaton from 2 states, 7 edges and 2 AP (stutter insensitive) to 2 states, 7 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 110 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 9074 reset in 146 ms.
Product exploration explored 100000 steps with 9080 reset in 139 ms.
Built C files in :
/tmp/ltsmin5914057437362647092
[2024-05-25 15:19:58] [INFO ] Computing symmetric may disable matrix : 55 transitions.
[2024-05-25 15:19:58] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 15:19:58] [INFO ] Computing symmetric may enable matrix : 55 transitions.
[2024-05-25 15:19:58] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 15:19:58] [INFO ] Computing Do-Not-Accords matrix : 55 transitions.
[2024-05-25 15:19:58] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 15:19:58] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5914057437362647092
Running compilation step : cd /tmp/ltsmin5914057437362647092;'/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/ltsmin5914057437362647092;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin5914057437362647092;'/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/stateBased2384556147292833321.hoa' '--buchi-type=spotba'
LTSmin run took 367 ms.
FORMULA BusinessProcesses-PT-04-LTLCardinality-12 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property BusinessProcesses-PT-04-LTLCardinality-12 finished in 5169 ms.
All properties solved by simple procedures.
Total runtime 16870 ms.

BK_STOP 1716650399521

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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-04"
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-04, 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-171620414800297"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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