Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r037-tajo-167813690400467.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is BusinessProcesses-PT-03, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r037-tajo-167813690400467
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 7.4K Feb 25 16:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 25 16:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 25 16:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 25 16:50 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:38 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:38 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:38 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 16:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 123K Feb 25 16:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Feb 25 16:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 25 16:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:38 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:38 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 63K Mar 5 18:22 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-03-LTLCardinality-00
FORMULA_NAME BusinessProcesses-PT-03-LTLCardinality-01
FORMULA_NAME BusinessProcesses-PT-03-LTLCardinality-02
FORMULA_NAME BusinessProcesses-PT-03-LTLCardinality-03
FORMULA_NAME BusinessProcesses-PT-03-LTLCardinality-04
FORMULA_NAME BusinessProcesses-PT-03-LTLCardinality-05
FORMULA_NAME BusinessProcesses-PT-03-LTLCardinality-06
FORMULA_NAME BusinessProcesses-PT-03-LTLCardinality-07
FORMULA_NAME BusinessProcesses-PT-03-LTLCardinality-08
FORMULA_NAME BusinessProcesses-PT-03-LTLCardinality-09
FORMULA_NAME BusinessProcesses-PT-03-LTLCardinality-10
FORMULA_NAME BusinessProcesses-PT-03-LTLCardinality-11
FORMULA_NAME BusinessProcesses-PT-03-LTLCardinality-12
FORMULA_NAME BusinessProcesses-PT-03-LTLCardinality-13
FORMULA_NAME BusinessProcesses-PT-03-LTLCardinality-14
FORMULA_NAME BusinessProcesses-PT-03-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678360023938

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=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-03
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202303021504
[2023-03-09 11:07:05] [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]
[2023-03-09 11:07:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 11:07:05] [INFO ] Load time of PNML (sax parser for PT used): 44 ms
[2023-03-09 11:07:05] [INFO ] Transformed 274 places.
[2023-03-09 11:07:05] [INFO ] Transformed 237 transitions.
[2023-03-09 11:07:05] [INFO ] Found NUPN structural information;
[2023-03-09 11:07:05] [INFO ] Parsed PT model containing 274 places and 237 transitions and 632 arcs in 107 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 1 transitions.
FORMULA BusinessProcesses-PT-03-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-03-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-03-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-03-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Initial state reduction rules removed 1 formulas.
FORMULA BusinessProcesses-PT-03-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-03-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 31 out of 273 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 273/273 places, 236/236 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 271 transition count 236
Discarding 38 places :
Symmetric choice reduction at 1 with 38 rule applications. Total rules 40 place count 233 transition count 198
Iterating global reduction 1 with 38 rules applied. Total rules applied 78 place count 233 transition count 198
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 79 place count 233 transition count 197
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 99 place count 213 transition count 177
Iterating global reduction 2 with 20 rules applied. Total rules applied 119 place count 213 transition count 177
Applied a total of 119 rules in 43 ms. Remains 213 /273 variables (removed 60) and now considering 177/236 (removed 59) transitions.
// Phase 1: matrix 177 rows 213 cols
[2023-03-09 11:07:06] [INFO ] Computed 41 place invariants in 14 ms
[2023-03-09 11:07:06] [INFO ] Implicit Places using invariants in 207 ms returned []
[2023-03-09 11:07:06] [INFO ] Invariant cache hit.
[2023-03-09 11:07:06] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 390 ms to find 0 implicit places.
[2023-03-09 11:07:06] [INFO ] Invariant cache hit.
[2023-03-09 11:07:06] [INFO ] Dead Transitions using invariants and state equation in 107 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 213/273 places, 177/236 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 542 ms. Remains : 213/273 places, 177/236 transitions.
Support contains 31 out of 213 places after structural reductions.
[2023-03-09 11:07:06] [INFO ] Flatten gal took : 53 ms
[2023-03-09 11:07:06] [INFO ] Flatten gal took : 17 ms
[2023-03-09 11:07:06] [INFO ] Input system was already deterministic with 177 transitions.
Incomplete random walk after 10000 steps, including 113 resets, run finished after 402 ms. (steps per millisecond=24 ) properties (out of 17) seen :14
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-09 11:07:07] [INFO ] Invariant cache hit.
[2023-03-09 11:07:07] [INFO ] After 71ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-09 11:07:07] [INFO ] [Nat]Absence check using 41 positive place invariants in 8 ms returned sat
[2023-03-09 11:07:07] [INFO ] After 66ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-09 11:07:07] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 5 ms to minimize.
[2023-03-09 11:07:07] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
[2023-03-09 11:07:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 94 ms
[2023-03-09 11:07:07] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 0 ms to minimize.
[2023-03-09 11:07:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-09 11:07:07] [INFO ] After 201ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-03-09 11:07:07] [INFO ] After 275ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 126 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=63 )
Parikh walk visited 1 properties in 2 ms.
Successfully simplified 1 atomic propositions for a total of 10 simplifications.
Computed a total of 207 stabilizing places and 169 stable transitions
Graph (complete) has 442 edges and 213 vertex of which 212 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.8 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 4 out of 213 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 213/213 places, 177/177 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 206 transition count 170
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 206 transition count 170
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 205 transition count 169
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 205 transition count 169
Applied a total of 16 rules in 18 ms. Remains 205 /213 variables (removed 8) and now considering 169/177 (removed 8) transitions.
// Phase 1: matrix 169 rows 205 cols
[2023-03-09 11:07:07] [INFO ] Computed 41 place invariants in 1 ms
[2023-03-09 11:07:08] [INFO ] Implicit Places using invariants in 184 ms returned []
[2023-03-09 11:07:08] [INFO ] Invariant cache hit.
[2023-03-09 11:07:08] [INFO ] Implicit Places using invariants and state equation in 226 ms returned []
Implicit Place search using SMT with State Equation took 428 ms to find 0 implicit places.
[2023-03-09 11:07:08] [INFO ] Invariant cache hit.
[2023-03-09 11:07:08] [INFO ] Dead Transitions using invariants and state equation in 159 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 205/213 places, 169/177 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 608 ms. Remains : 205/213 places, 169/177 transitions.
Stuttering acceptance computed with spot in 239 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-03-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (AND (EQ s87 0) (EQ s194 1)) (AND (EQ s147 0) (EQ s178 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, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-03-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-03-LTLCardinality-00 finished in 908 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X((G(F(p0))||G(p1)))))))'
Support contains 3 out of 213 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 213/213 places, 177/177 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 204 transition count 168
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 204 transition count 168
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 202 transition count 166
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 202 transition count 166
Applied a total of 22 rules in 16 ms. Remains 202 /213 variables (removed 11) and now considering 166/177 (removed 11) transitions.
// Phase 1: matrix 166 rows 202 cols
[2023-03-09 11:07:08] [INFO ] Computed 41 place invariants in 2 ms
[2023-03-09 11:07:08] [INFO ] Implicit Places using invariants in 51 ms returned []
[2023-03-09 11:07:08] [INFO ] Invariant cache hit.
[2023-03-09 11:07:08] [INFO ] Implicit Places using invariants and state equation in 151 ms returned []
Implicit Place search using SMT with State Equation took 206 ms to find 0 implicit places.
[2023-03-09 11:07:08] [INFO ] Invariant cache hit.
[2023-03-09 11:07:09] [INFO ] Dead Transitions using invariants and state equation in 94 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 202/213 places, 166/177 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 329 ms. Remains : 202/213 places, 166/177 transitions.
Stuttering acceptance computed with spot in 227 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-03-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=p1, acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 5}, { cond=(NOT p1), acceptance={} source=4 dest: 6}], [{ cond=(NOT p0), acceptance={0} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 5}, { cond=true, acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(EQ s72 0), p0:(AND (EQ s85 0) (EQ s194 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, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 71 steps with 0 reset in 3 ms.
FORMULA BusinessProcesses-PT-03-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-03-LTLCardinality-01 finished in 574 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&(p1 U p2)))'
Support contains 5 out of 213 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 213/213 places, 177/177 transitions.
Graph (trivial) has 105 edges and 213 vertex of which 6 / 213 are part of one of the 1 SCC in 3 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 435 edges and 208 vertex of which 207 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 29 place count 206 transition count 142
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 56 place count 179 transition count 142
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 38 Pre rules applied. Total rules applied 56 place count 179 transition count 104
Deduced a syphon composed of 38 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 86 rules applied. Total rules applied 142 place count 131 transition count 104
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 147 place count 126 transition count 99
Ensure Unique test removed 1 places
Iterating global reduction 2 with 6 rules applied. Total rules applied 153 place count 125 transition count 99
Performed 55 Post agglomeration using F-continuation condition.Transition count delta: 55
Deduced a syphon composed of 55 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 111 rules applied. Total rules applied 264 place count 69 transition count 44
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 265 place count 68 transition count 43
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 266 place count 67 transition count 43
Applied a total of 266 rules in 27 ms. Remains 67 /213 variables (removed 146) and now considering 43/177 (removed 134) transitions.
// Phase 1: matrix 43 rows 67 cols
[2023-03-09 11:07:09] [INFO ] Computed 28 place invariants in 1 ms
[2023-03-09 11:07:09] [INFO ] Implicit Places using invariants in 39 ms returned []
[2023-03-09 11:07:09] [INFO ] Invariant cache hit.
[2023-03-09 11:07:09] [INFO ] Implicit Places using invariants and state equation in 77 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 8, 11, 12, 13, 48]
Discarding 13 places :
Implicit Place search using SMT with State Equation took 132 ms to find 13 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 54/213 places, 43/177 transitions.
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 2 place count 53 transition count 42
Applied a total of 2 rules in 3 ms. Remains 53 /54 variables (removed 1) and now considering 42/43 (removed 1) transitions.
// Phase 1: matrix 42 rows 53 cols
[2023-03-09 11:07:09] [INFO ] Computed 15 place invariants in 0 ms
[2023-03-09 11:07:09] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-03-09 11:07:09] [INFO ] Invariant cache hit.
[2023-03-09 11:07:09] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 53/213 places, 42/177 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 268 ms. Remains : 53/213 places, 42/177 transitions.
Stuttering acceptance computed with spot in 138 ms :[true, (NOT p2), (NOT p0), (OR (NOT p2) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-03-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 0}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=3 dest: 3}]], initial=3, aps=[p2:(OR (EQ s29 0) (EQ s24 1)), p1:(EQ s40 1), p0:(AND (EQ s35 0) (EQ s0 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, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-03-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-03-LTLCardinality-05 finished in 416 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 3 out of 213 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 213/213 places, 177/177 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 205 transition count 169
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 205 transition count 169
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 204 transition count 168
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 204 transition count 168
Applied a total of 18 rules in 13 ms. Remains 204 /213 variables (removed 9) and now considering 168/177 (removed 9) transitions.
// Phase 1: matrix 168 rows 204 cols
[2023-03-09 11:07:09] [INFO ] Computed 41 place invariants in 3 ms
[2023-03-09 11:07:09] [INFO ] Implicit Places using invariants in 66 ms returned []
[2023-03-09 11:07:09] [INFO ] Invariant cache hit.
[2023-03-09 11:07:09] [INFO ] Implicit Places using invariants and state equation in 162 ms returned []
Implicit Place search using SMT with State Equation took 230 ms to find 0 implicit places.
[2023-03-09 11:07:09] [INFO ] Invariant cache hit.
[2023-03-09 11:07:10] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 204/213 places, 168/177 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 324 ms. Remains : 204/213 places, 168/177 transitions.
Stuttering acceptance computed with spot in 53 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-03-LTLCardinality-06 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 s197 0) (EQ s80 1) (EQ s172 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 319 ms.
Product exploration explored 100000 steps with 50000 reset in 181 ms.
Computed a total of 198 stabilizing places and 160 stable transitions
Graph (complete) has 431 edges and 204 vertex of which 203 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 198 stabilizing places and 160 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 77 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-03-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-03-LTLCardinality-06 finished in 976 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 213 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 213/213 places, 177/177 transitions.
Graph (trivial) has 111 edges and 213 vertex of which 6 / 213 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 435 edges and 208 vertex of which 207 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 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 32 place count 206 transition count 139
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 62 place count 176 transition count 139
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 39 Pre rules applied. Total rules applied 62 place count 176 transition count 100
Deduced a syphon composed of 39 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 87 rules applied. Total rules applied 149 place count 128 transition count 100
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 157 place count 120 transition count 92
Ensure Unique test removed 1 places
Iterating global reduction 2 with 9 rules applied. Total rules applied 166 place count 119 transition count 92
Performed 53 Post agglomeration using F-continuation condition.Transition count delta: 53
Deduced a syphon composed of 53 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 2 with 107 rules applied. Total rules applied 273 place count 65 transition count 39
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 274 place count 64 transition count 38
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 275 place count 63 transition count 38
Applied a total of 275 rules in 26 ms. Remains 63 /213 variables (removed 150) and now considering 38/177 (removed 139) transitions.
// Phase 1: matrix 38 rows 63 cols
[2023-03-09 11:07:10] [INFO ] Computed 29 place invariants in 1 ms
[2023-03-09 11:07:10] [INFO ] Implicit Places using invariants in 52 ms returned [11]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 66 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 62/213 places, 38/177 transitions.
Applied a total of 0 rules in 5 ms. Remains 62 /62 variables (removed 0) and now considering 38/38 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 97 ms. Remains : 62/213 places, 38/177 transitions.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-03-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s58 1) (OR (EQ s17 0) (EQ s14 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-03-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-03-LTLCardinality-07 finished in 135 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0||X(X(p1))))&&X(F(p2))))'
Support contains 4 out of 213 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 213/213 places, 177/177 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 205 transition count 169
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 205 transition count 169
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 203 transition count 167
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 203 transition count 167
Applied a total of 20 rules in 6 ms. Remains 203 /213 variables (removed 10) and now considering 167/177 (removed 10) transitions.
// Phase 1: matrix 167 rows 203 cols
[2023-03-09 11:07:10] [INFO ] Computed 41 place invariants in 1 ms
[2023-03-09 11:07:11] [INFO ] Implicit Places using invariants in 191 ms returned []
[2023-03-09 11:07:11] [INFO ] Invariant cache hit.
[2023-03-09 11:07:11] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 348 ms to find 0 implicit places.
[2023-03-09 11:07:11] [INFO ] Invariant cache hit.
[2023-03-09 11:07:11] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 203/213 places, 167/177 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 436 ms. Remains : 203/213 places, 167/177 transitions.
Stuttering acceptance computed with spot in 194 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p2), (NOT p1), true]
Running random walk in product with property : BusinessProcesses-PT-03-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(EQ s180 1), p2:(EQ s166 1), p1:(OR (EQ s13 0) (EQ s67 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, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 12063 reset in 144 ms.
Stack based approach found an accepted trace after 176 steps with 23 reset with depth 15 and stack size 15 in 0 ms.
FORMULA BusinessProcesses-PT-03-LTLCardinality-08 FALSE TECHNIQUES STACK_TEST
Treatment of property BusinessProcesses-PT-03-LTLCardinality-08 finished in 790 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 213 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 213/213 places, 177/177 transitions.
Graph (trivial) has 112 edges and 213 vertex of which 6 / 213 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 435 edges and 208 vertex of which 207 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 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 32 place count 206 transition count 139
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 62 place count 176 transition count 139
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 62 place count 176 transition count 99
Deduced a syphon composed of 40 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 90 rules applied. Total rules applied 152 place count 126 transition count 99
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 159 place count 119 transition count 92
Iterating global reduction 2 with 7 rules applied. Total rules applied 166 place count 119 transition count 92
Performed 55 Post agglomeration using F-continuation condition.Transition count delta: 55
Deduced a syphon composed of 55 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 111 rules applied. Total rules applied 277 place count 63 transition count 37
Applied a total of 277 rules in 12 ms. Remains 63 /213 variables (removed 150) and now considering 37/177 (removed 140) transitions.
// Phase 1: matrix 37 rows 63 cols
[2023-03-09 11:07:11] [INFO ] Computed 30 place invariants in 0 ms
[2023-03-09 11:07:11] [INFO ] Implicit Places using invariants in 74 ms returned [52]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 76 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 62/213 places, 37/177 transitions.
Applied a total of 0 rules in 2 ms. Remains 62 /62 variables (removed 0) and now considering 37/37 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 90 ms. Remains : 62/213 places, 37/177 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-03-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (NEQ s1 0) (NEQ s6 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-03-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-03-LTLCardinality-11 finished in 174 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 213 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 213/213 places, 177/177 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 205 transition count 169
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 205 transition count 169
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 203 transition count 167
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 203 transition count 167
Applied a total of 20 rules in 5 ms. Remains 203 /213 variables (removed 10) and now considering 167/177 (removed 10) transitions.
// Phase 1: matrix 167 rows 203 cols
[2023-03-09 11:07:11] [INFO ] Computed 41 place invariants in 12 ms
[2023-03-09 11:07:11] [INFO ] Implicit Places using invariants in 111 ms returned []
[2023-03-09 11:07:11] [INFO ] Invariant cache hit.
[2023-03-09 11:07:12] [INFO ] Implicit Places using invariants and state equation in 200 ms returned []
Implicit Place search using SMT with State Equation took 316 ms to find 0 implicit places.
[2023-03-09 11:07:12] [INFO ] Invariant cache hit.
[2023-03-09 11:07:12] [INFO ] Dead Transitions using invariants and state equation in 90 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 203/213 places, 167/177 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 425 ms. Remains : 203/213 places, 167/177 transitions.
Stuttering acceptance computed with spot in 94 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-03-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (EQ s26 0) (EQ s185 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, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 13060 steps with 161 reset in 25 ms.
FORMULA BusinessProcesses-PT-03-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-03-LTLCardinality-13 finished in 558 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(G(p0))))))'
Support contains 2 out of 213 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 213/213 places, 177/177 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 205 transition count 169
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 205 transition count 169
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 203 transition count 167
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 203 transition count 167
Applied a total of 20 rules in 6 ms. Remains 203 /213 variables (removed 10) and now considering 167/177 (removed 10) transitions.
// Phase 1: matrix 167 rows 203 cols
[2023-03-09 11:07:12] [INFO ] Computed 41 place invariants in 1 ms
[2023-03-09 11:07:12] [INFO ] Implicit Places using invariants in 59 ms returned []
[2023-03-09 11:07:12] [INFO ] Invariant cache hit.
[2023-03-09 11:07:12] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
[2023-03-09 11:07:12] [INFO ] Invariant cache hit.
[2023-03-09 11:07:12] [INFO ] Dead Transitions using invariants and state equation in 100 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 203/213 places, 167/177 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 275 ms. Remains : 203/213 places, 167/177 transitions.
Stuttering acceptance computed with spot in 141 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-03-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}]], initial=5, aps=[p0:(OR (EQ s191 0) (EQ s157 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, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1194 reset in 139 ms.
Product exploration explored 100000 steps with 1195 reset in 160 ms.
Computed a total of 197 stabilizing places and 159 stable transitions
Graph (complete) has 430 edges and 203 vertex of which 202 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 197 stabilizing places and 159 stable transitions
Detected a total of 197/203 stabilizing places and 159/167 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 161 ms. Reduced automaton from 6 states, 7 edges and 1 AP (stutter sensitive) to 6 states, 7 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 220 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 114 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1721791 steps, run timeout after 3001 ms. (steps per millisecond=573 ) properties seen :{}
Probabilistic random walk after 1721791 steps, saw 210239 distinct states, run finished after 3002 ms. (steps per millisecond=573 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 11:07:16] [INFO ] Invariant cache hit.
[2023-03-09 11:07:16] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 11:07:16] [INFO ] [Nat]Absence check using 41 positive place invariants in 21 ms returned sat
[2023-03-09 11:07:16] [INFO ] After 53ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 11:07:16] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
[2023-03-09 11:07:16] [INFO ] Deduced a trap composed of 32 places in 55 ms of which 1 ms to minimize.
[2023-03-09 11:07:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 104 ms
[2023-03-09 11:07:16] [INFO ] After 166ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-09 11:07:16] [INFO ] After 236ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 203 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 203/203 places, 167/167 transitions.
Graph (trivial) has 101 edges and 203 vertex of which 6 / 203 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (complete) has 418 edges and 198 vertex of which 197 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 25 place count 197 transition count 135
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 48 place count 174 transition count 135
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 48 place count 174 transition count 95
Deduced a syphon composed of 40 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 90 rules applied. Total rules applied 138 place count 124 transition count 95
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 2 with 122 rules applied. Total rules applied 260 place count 62 transition count 35
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 261 place count 61 transition count 34
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 262 place count 60 transition count 34
Applied a total of 262 rules in 13 ms. Remains 60 /203 variables (removed 143) and now considering 34/167 (removed 133) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 60/203 places, 34/167 transitions.
Incomplete random walk after 10000 steps, including 469 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 1) seen :0
Finished Best-First random walk after 51 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=25 )
Knowledge obtained : [p0, true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 141 ms. Reduced automaton from 6 states, 7 edges and 1 AP (stutter sensitive) to 6 states, 7 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 183 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 178 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 203 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 203/203 places, 167/167 transitions.
Applied a total of 0 rules in 2 ms. Remains 203 /203 variables (removed 0) and now considering 167/167 (removed 0) transitions.
[2023-03-09 11:07:17] [INFO ] Invariant cache hit.
[2023-03-09 11:07:17] [INFO ] Implicit Places using invariants in 59 ms returned []
[2023-03-09 11:07:17] [INFO ] Invariant cache hit.
[2023-03-09 11:07:17] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 197 ms to find 0 implicit places.
[2023-03-09 11:07:17] [INFO ] Invariant cache hit.
[2023-03-09 11:07:17] [INFO ] Dead Transitions using invariants and state equation in 116 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 330 ms. Remains : 203/203 places, 167/167 transitions.
Computed a total of 197 stabilizing places and 159 stable transitions
Graph (complete) has 430 edges and 203 vertex of which 202 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 197 stabilizing places and 159 stable transitions
Detected a total of 197/203 stabilizing places and 159/167 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 150 ms. Reduced automaton from 6 states, 7 edges and 1 AP (stutter sensitive) to 6 states, 7 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 171 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 115 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 21 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1911138 steps, run timeout after 3001 ms. (steps per millisecond=636 ) properties seen :{}
Probabilistic random walk after 1911138 steps, saw 231012 distinct states, run finished after 3004 ms. (steps per millisecond=636 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 11:07:21] [INFO ] Invariant cache hit.
[2023-03-09 11:07:21] [INFO ] After 64ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 11:07:21] [INFO ] [Nat]Absence check using 41 positive place invariants in 9 ms returned sat
[2023-03-09 11:07:21] [INFO ] After 64ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 11:07:21] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 1 ms to minimize.
[2023-03-09 11:07:21] [INFO ] Deduced a trap composed of 32 places in 43 ms of which 1 ms to minimize.
[2023-03-09 11:07:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 101 ms
[2023-03-09 11:07:21] [INFO ] After 173ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-09 11:07:21] [INFO ] After 249ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 2 out of 203 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 203/203 places, 167/167 transitions.
Graph (trivial) has 101 edges and 203 vertex of which 6 / 203 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (complete) has 418 edges and 198 vertex of which 197 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 25 place count 197 transition count 135
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 48 place count 174 transition count 135
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 48 place count 174 transition count 95
Deduced a syphon composed of 40 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 90 rules applied. Total rules applied 138 place count 124 transition count 95
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 2 with 122 rules applied. Total rules applied 260 place count 62 transition count 35
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 261 place count 61 transition count 34
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 262 place count 60 transition count 34
Applied a total of 262 rules in 18 ms. Remains 60 /203 variables (removed 143) and now considering 34/167 (removed 133) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 60/203 places, 34/167 transitions.
Finished random walk after 9546 steps, including 442 resets, run visited all 1 properties in 17 ms. (steps per millisecond=561 )
Knowledge obtained : [p0, true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 132 ms. Reduced automaton from 6 states, 7 edges and 1 AP (stutter sensitive) to 6 states, 7 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 218 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 177 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 175 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1174 reset in 140 ms.
Product exploration explored 100000 steps with 1174 reset in 162 ms.
Applying partial POR strategy [true, true, false, false, false, false]
Stuttering acceptance computed with spot in 194 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 203 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 203/203 places, 167/167 transitions.
Graph (trivial) has 101 edges and 203 vertex of which 6 / 203 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 423 edges and 198 vertex of which 197 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 23 rules applied. Total rules applied 25 place count 197 transition count 160
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 29 Pre rules applied. Total rules applied 25 place count 197 transition count 186
Deduced a syphon composed of 52 places in 0 ms
Iterating global reduction 1 with 29 rules applied. Total rules applied 54 place count 197 transition count 186
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 62 place count 189 transition count 171
Deduced a syphon composed of 44 places in 0 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 70 place count 189 transition count 171
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 115 places in 0 ms
Iterating global reduction 1 with 71 rules applied. Total rules applied 141 place count 189 transition count 171
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 156 place count 174 transition count 156
Deduced a syphon composed of 100 places in 1 ms
Iterating global reduction 1 with 15 rules applied. Total rules applied 171 place count 174 transition count 156
Deduced a syphon composed of 100 places in 0 ms
Applied a total of 171 rules in 35 ms. Remains 174 /203 variables (removed 29) and now considering 156/167 (removed 11) transitions.
[2023-03-09 11:07:22] [INFO ] Redundant transitions in 26 ms returned []
// Phase 1: matrix 156 rows 174 cols
[2023-03-09 11:07:22] [INFO ] Computed 41 place invariants in 1 ms
[2023-03-09 11:07:22] [INFO ] Dead Transitions using invariants and state equation in 103 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 174/203 places, 156/167 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 175 ms. Remains : 174/203 places, 156/167 transitions.
Built C files in :
/tmp/ltsmin89690520498173746
[2023-03-09 11:07:23] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin89690520498173746
Running compilation step : cd /tmp/ltsmin89690520498173746;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 461 ms.
Running link step : cd /tmp/ltsmin89690520498173746;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 56 ms.
Running LTSmin : cd /tmp/ltsmin89690520498173746;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased86033241697189227.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 203 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 203/203 places, 167/167 transitions.
Applied a total of 0 rules in 9 ms. Remains 203 /203 variables (removed 0) and now considering 167/167 (removed 0) transitions.
// Phase 1: matrix 167 rows 203 cols
[2023-03-09 11:07:38] [INFO ] Computed 41 place invariants in 1 ms
[2023-03-09 11:07:38] [INFO ] Implicit Places using invariants in 86 ms returned []
[2023-03-09 11:07:38] [INFO ] Invariant cache hit.
[2023-03-09 11:07:38] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 251 ms to find 0 implicit places.
[2023-03-09 11:07:38] [INFO ] Invariant cache hit.
[2023-03-09 11:07:38] [INFO ] Dead Transitions using invariants and state equation in 86 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 347 ms. Remains : 203/203 places, 167/167 transitions.
Built C files in :
/tmp/ltsmin7107744898961106567
[2023-03-09 11:07:38] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7107744898961106567
Running compilation step : cd /tmp/ltsmin7107744898961106567;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 246 ms.
Running link step : cd /tmp/ltsmin7107744898961106567;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin7107744898961106567;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15449915524906499494.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-09 11:07:53] [INFO ] Flatten gal took : 16 ms
[2023-03-09 11:07:53] [INFO ] Flatten gal took : 14 ms
[2023-03-09 11:07:53] [INFO ] Time to serialize gal into /tmp/LTL202104290776500107.gal : 5 ms
[2023-03-09 11:07:53] [INFO ] Time to serialize properties into /tmp/LTL11151592244603126145.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL202104290776500107.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3699372157330066565.hoa' '-atoms' '/tmp/LTL11151592244603126145.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL11151592244603126145.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3699372157330066565.hoa
Reverse transition relation is NOT exact ! Due to transitions t11, t24, t31, t35, t39, t43, t46, t49, t53, t56, t59, t62, t65, t68, t71, t74, t77, t79, t82...407
Computing Next relation with stutter on 18 deadlock states
Detected timeout of ITS tools.
[2023-03-09 11:08:08] [INFO ] Flatten gal took : 15 ms
[2023-03-09 11:08:08] [INFO ] Flatten gal took : 14 ms
[2023-03-09 11:08:08] [INFO ] Time to serialize gal into /tmp/LTL6446241950509553921.gal : 4 ms
[2023-03-09 11:08:08] [INFO ] Time to serialize properties into /tmp/LTL13960749467031322940.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6446241950509553921.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13960749467031322940.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(X(X(G("((p252==0)||(p180==1))")))))))
Formula 0 simplified : XXXXF!"((p252==0)||(p180==1))"
Reverse transition relation is NOT exact ! Due to transitions t11, t24, t31, t35, t39, t43, t46, t49, t53, t56, t59, t62, t65, t68, t71, t74, t77, t79, t82...407
Computing Next relation with stutter on 18 deadlock states
Detected timeout of ITS tools.
[2023-03-09 11:08:23] [INFO ] Flatten gal took : 8 ms
[2023-03-09 11:08:23] [INFO ] Applying decomposition
[2023-03-09 11:08:23] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph17387971992294054247.txt' '-o' '/tmp/graph17387971992294054247.bin' '-w' '/tmp/graph17387971992294054247.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph17387971992294054247.bin' '-l' '-1' '-v' '-w' '/tmp/graph17387971992294054247.weights' '-q' '0' '-e' '0.001'
[2023-03-09 11:08:24] [INFO ] Decomposing Gal with order
[2023-03-09 11:08:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-09 11:08:24] [INFO ] Removed a total of 46 redundant transitions.
[2023-03-09 11:08:24] [INFO ] Flatten gal took : 157 ms
[2023-03-09 11:08:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2023-03-09 11:08:24] [INFO ] Time to serialize gal into /tmp/LTL8619807226996991412.gal : 18 ms
[2023-03-09 11:08:24] [INFO ] Time to serialize properties into /tmp/LTL18371267826627045807.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8619807226996991412.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18371267826627045807.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(X(X(X(G("((i20.u57.p252==0)||(i13.u53.p180==1))")))))))
Formula 0 simplified : XXXXF!"((i20.u57.p252==0)||(i13.u53.p180==1))"
Reverse transition relation is NOT exact ! Due to transitions t86, t106, t110, t122, t167, t169, t170, t173, i0.u21.t105, i0.u23.t101, i1.t114, i1.u15.t117...687
Computing Next relation with stutter on 18 deadlock states
7 unique states visited
7 strongly connected components in search stack
7 transitions explored
7 items max in DFS search stack
117 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,1.23254,57096,1,0,94050,507,2566,129469,190,1565,238678
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA BusinessProcesses-PT-03-LTLCardinality-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property BusinessProcesses-PT-03-LTLCardinality-14 finished in 73548 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 4 out of 213 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 213/213 places, 177/177 transitions.
Graph (trivial) has 107 edges and 213 vertex of which 6 / 213 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 435 edges and 208 vertex of which 207 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 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 29 place count 206 transition count 142
Reduce places removed 27 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 28 rules applied. Total rules applied 57 place count 179 transition count 141
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 58 place count 178 transition count 141
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 37 Pre rules applied. Total rules applied 58 place count 178 transition count 104
Deduced a syphon composed of 37 places in 0 ms
Ensure Unique test removed 7 places
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 81 rules applied. Total rules applied 139 place count 134 transition count 104
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 146 place count 127 transition count 97
Ensure Unique test removed 1 places
Iterating global reduction 3 with 8 rules applied. Total rules applied 154 place count 126 transition count 97
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 3 with 113 rules applied. Total rules applied 267 place count 69 transition count 41
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 268 place count 68 transition count 40
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 269 place count 67 transition count 40
Applied a total of 269 rules in 34 ms. Remains 67 /213 variables (removed 146) and now considering 40/177 (removed 137) transitions.
// Phase 1: matrix 40 rows 67 cols
[2023-03-09 11:08:25] [INFO ] Computed 31 place invariants in 1 ms
[2023-03-09 11:08:26] [INFO ] Implicit Places using invariants in 130 ms returned [60, 61, 62]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 132 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 64/213 places, 40/177 transitions.
Applied a total of 0 rules in 3 ms. Remains 64 /64 variables (removed 0) and now considering 40/40 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 170 ms. Remains : 64/213 places, 40/177 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-03-LTLCardinality-15 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 s7 0) (EQ s11 1) (AND (EQ s14 1) (EQ s51 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 15479 reset in 182 ms.
Product exploration explored 100000 steps with 15552 reset in 164 ms.
Computed a total of 64 stabilizing places and 39 stable transitions
Computed a total of 64 stabilizing places and 39 stable transitions
Detected a total of 64/64 stabilizing places and 39/40 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 187 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 65 ms :[(NOT p0), (NOT p0)]
Finished random walk after 9 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=9 )
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 162 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 57 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Support contains 4 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 40/40 transitions.
Applied a total of 0 rules in 2 ms. Remains 64 /64 variables (removed 0) and now considering 40/40 (removed 0) transitions.
// Phase 1: matrix 40 rows 64 cols
[2023-03-09 11:08:27] [INFO ] Computed 28 place invariants in 0 ms
[2023-03-09 11:08:27] [INFO ] Implicit Places using invariants in 53 ms returned []
[2023-03-09 11:08:27] [INFO ] Invariant cache hit.
[2023-03-09 11:08:27] [INFO ] Implicit Places using invariants and state equation in 75 ms returned [0, 1, 2, 3, 4, 5, 6, 9, 12, 16, 17, 18, 20, 22, 24, 26, 28, 30, 32, 34, 36, 38, 40, 42, 44, 46, 52]
Discarding 27 places :
Implicit Place search using SMT with State Equation took 142 ms to find 27 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 37/64 places, 40/40 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 37 transition count 36
Reduce places removed 4 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 6 rules applied. Total rules applied 10 place count 33 transition count 34
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 12 place count 31 transition count 34
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 15 place count 28 transition count 31
Iterating global reduction 3 with 3 rules applied. Total rules applied 18 place count 28 transition count 31
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 2 rules applied. Total rules applied 20 place count 28 transition count 29
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 22 place count 26 transition count 29
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 5 with 4 rules applied. Total rules applied 26 place count 24 transition count 27
Applied a total of 26 rules in 6 ms. Remains 24 /37 variables (removed 13) and now considering 27/40 (removed 13) transitions.
// Phase 1: matrix 27 rows 24 cols
[2023-03-09 11:08:27] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-09 11:08:27] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-09 11:08:27] [INFO ] Invariant cache hit.
[2023-03-09 11:08:27] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 24/64 places, 27/40 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 220 ms. Remains : 24/64 places, 27/40 transitions.
Computed a total of 24 stabilizing places and 26 stable transitions
Computed a total of 24 stabilizing places and 26 stable transitions
Detected a total of 24/24 stabilizing places and 26/27 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 116 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 62 ms :[(NOT p0), (NOT p0)]
Finished random walk after 74 steps, including 15 resets, run visited all 1 properties in 2 ms. (steps per millisecond=37 )
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 127 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 80 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 56 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 16242 reset in 74 ms.
Product exploration explored 100000 steps with 16301 reset in 65 ms.
Built C files in :
/tmp/ltsmin7954781788452712562
[2023-03-09 11:08:27] [INFO ] Computing symmetric may disable matrix : 27 transitions.
[2023-03-09 11:08:27] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 11:08:27] [INFO ] Computing symmetric may enable matrix : 27 transitions.
[2023-03-09 11:08:27] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 11:08:27] [INFO ] Computing Do-Not-Accords matrix : 27 transitions.
[2023-03-09 11:08:27] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 11:08:27] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7954781788452712562
Running compilation step : cd /tmp/ltsmin7954781788452712562;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 126 ms.
Running link step : cd /tmp/ltsmin7954781788452712562;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 22 ms.
Running LTSmin : cd /tmp/ltsmin7954781788452712562;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16178712268568720190.hoa' '--buchi-type=spotba'
LTSmin run took 101 ms.
FORMULA BusinessProcesses-PT-03-LTLCardinality-15 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property BusinessProcesses-PT-03-LTLCardinality-15 finished in 2364 ms.
All properties solved by simple procedures.
Total runtime 82602 ms.

BK_STOP 1678360108542

--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /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-03"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
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-5348"
echo " Executing tool itstools"
echo " Input is BusinessProcesses-PT-03, 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 r037-tajo-167813690400467"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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