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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.4K Apr 11 16:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 69K Apr 11 16:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.8K Apr 11 16:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 88K Apr 11 16:38 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 146K 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-12-LTLCardinality-00
FORMULA_NAME BusinessProcesses-PT-12-LTLCardinality-01
FORMULA_NAME BusinessProcesses-PT-12-LTLCardinality-02
FORMULA_NAME BusinessProcesses-PT-12-LTLCardinality-03
FORMULA_NAME BusinessProcesses-PT-12-LTLCardinality-04
FORMULA_NAME BusinessProcesses-PT-12-LTLCardinality-05
FORMULA_NAME BusinessProcesses-PT-12-LTLCardinality-06
FORMULA_NAME BusinessProcesses-PT-12-LTLCardinality-07
FORMULA_NAME BusinessProcesses-PT-12-LTLCardinality-08
FORMULA_NAME BusinessProcesses-PT-12-LTLCardinality-09
FORMULA_NAME BusinessProcesses-PT-12-LTLCardinality-10
FORMULA_NAME BusinessProcesses-PT-12-LTLCardinality-11
FORMULA_NAME BusinessProcesses-PT-12-LTLCardinality-12
FORMULA_NAME BusinessProcesses-PT-12-LTLCardinality-13
FORMULA_NAME BusinessProcesses-PT-12-LTLCardinality-14
FORMULA_NAME BusinessProcesses-PT-12-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716651098709

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-12
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-25 15:31: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:31:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 15:31:42] [INFO ] Load time of PNML (sax parser for PT used): 138 ms
[2024-05-25 15:31:42] [INFO ] Transformed 586 places.
[2024-05-25 15:31:42] [INFO ] Transformed 525 transitions.
[2024-05-25 15:31:42] [INFO ] Found NUPN structural information;
[2024-05-25 15:31:42] [INFO ] Parsed PT model containing 586 places and 525 transitions and 1560 arcs in 318 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 21 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 4 places in 23 ms
Reduce places removed 4 places and 4 transitions.
FORMULA BusinessProcesses-PT-12-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-12-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-12-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-12-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-12-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-12-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 25 out of 582 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 582/582 places, 521/521 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 580 transition count 521
Discarding 78 places :
Symmetric choice reduction at 1 with 78 rule applications. Total rules 80 place count 502 transition count 443
Iterating global reduction 1 with 78 rules applied. Total rules applied 158 place count 502 transition count 443
Discarding 40 places :
Symmetric choice reduction at 1 with 40 rule applications. Total rules 198 place count 462 transition count 403
Iterating global reduction 1 with 40 rules applied. Total rules applied 238 place count 462 transition count 403
Applied a total of 238 rules in 233 ms. Remains 462 /582 variables (removed 120) and now considering 403/521 (removed 118) transitions.
// Phase 1: matrix 403 rows 462 cols
[2024-05-25 15:31:43] [INFO ] Computed 96 invariants in 45 ms
[2024-05-25 15:31:44] [INFO ] Implicit Places using invariants in 847 ms returned []
[2024-05-25 15:31:44] [INFO ] Invariant cache hit.
[2024-05-25 15:31:45] [INFO ] Implicit Places using invariants and state equation in 1263 ms returned []
Implicit Place search using SMT with State Equation took 2163 ms to find 0 implicit places.
[2024-05-25 15:31:45] [INFO ] Invariant cache hit.
[2024-05-25 15:31:46] [INFO ] Dead Transitions using invariants and state equation in 263 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 462/582 places, 403/521 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2662 ms. Remains : 462/582 places, 403/521 transitions.
Support contains 25 out of 462 places after structural reductions.
[2024-05-25 15:31:46] [INFO ] Flatten gal took : 70 ms
[2024-05-25 15:31:46] [INFO ] Flatten gal took : 26 ms
[2024-05-25 15:31:46] [INFO ] Input system was already deterministic with 403 transitions.
Incomplete random walk after 10000 steps, including 74 resets, run finished after 483 ms. (steps per millisecond=20 ) properties (out of 15) seen :8
Incomplete Best-First random walk after 10000 steps, including 14 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2024-05-25 15:31:47] [INFO ] Invariant cache hit.
[2024-05-25 15:31:47] [INFO ] After 163ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2024-05-25 15:31:47] [INFO ] [Nat]Absence check using 53 positive place invariants in 15 ms returned sat
[2024-05-25 15:31:47] [INFO ] [Nat]Absence check using 53 positive and 43 generalized place invariants in 16 ms returned sat
[2024-05-25 15:31:48] [INFO ] After 274ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2024-05-25 15:31:48] [INFO ] Deduced a trap composed of 26 places in 118 ms of which 6 ms to minimize.
[2024-05-25 15:31:48] [INFO ] Deduced a trap composed of 66 places in 147 ms of which 1 ms to minimize.
[2024-05-25 15:31:48] [INFO ] Deduced a trap composed of 40 places in 148 ms of which 2 ms to minimize.
[2024-05-25 15:31:48] [INFO ] Deduced a trap composed of 67 places in 122 ms of which 2 ms to minimize.
[2024-05-25 15:31:48] [INFO ] Deduced a trap composed of 18 places in 123 ms of which 0 ms to minimize.
[2024-05-25 15:31:48] [INFO ] Deduced a trap composed of 18 places in 115 ms of which 1 ms to minimize.
[2024-05-25 15:31:49] [INFO ] Deduced a trap composed of 63 places in 123 ms of which 1 ms to minimize.
[2024-05-25 15:31:49] [INFO ] Deduced a trap composed of 66 places in 128 ms of which 1 ms to minimize.
[2024-05-25 15:31:49] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 0 ms to minimize.
[2024-05-25 15:31:49] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1283 ms
[2024-05-25 15:31:49] [INFO ] Deduced a trap composed of 38 places in 59 ms of which 1 ms to minimize.
[2024-05-25 15:31:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 106 ms
[2024-05-25 15:31:49] [INFO ] Deduced a trap composed of 30 places in 80 ms of which 1 ms to minimize.
[2024-05-25 15:31:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 122 ms
[2024-05-25 15:31:49] [INFO ] After 2041ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 180 ms.
[2024-05-25 15:31:49] [INFO ] After 2447ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Fused 7 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 100 ms.
Support contains 11 out of 462 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 462/462 places, 403/403 transitions.
Graph (trivial) has 204 edges and 462 vertex of which 6 / 462 are part of one of the 1 SCC in 5 ms
Free SCC test removed 5 places
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 1035 edges and 457 vertex of which 455 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 47 place count 455 transition count 350
Reduce places removed 45 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 46 rules applied. Total rules applied 93 place count 410 transition count 349
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 94 place count 409 transition count 349
Performed 94 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 94 Pre rules applied. Total rules applied 94 place count 409 transition count 255
Deduced a syphon composed of 94 places in 1 ms
Ensure Unique test removed 16 places
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 3 with 204 rules applied. Total rules applied 298 place count 299 transition count 255
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 300 place count 297 transition count 253
Iterating global reduction 3 with 2 rules applied. Total rules applied 302 place count 297 transition count 253
Performed 115 Post agglomeration using F-continuation condition.Transition count delta: 115
Deduced a syphon composed of 115 places in 1 ms
Ensure Unique test removed 4 places
Reduce places removed 119 places and 0 transitions.
Iterating global reduction 3 with 234 rules applied. Total rules applied 536 place count 178 transition count 138
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 538 place count 177 transition count 142
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 540 place count 177 transition count 140
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 542 place count 175 transition count 140
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 547 place count 175 transition count 140
Applied a total of 547 rules in 116 ms. Remains 175 /462 variables (removed 287) and now considering 140/403 (removed 263) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 116 ms. Remains : 175/462 places, 140/403 transitions.
Incomplete random walk after 10000 steps, including 278 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 7) seen :6
Finished Best-First random walk after 455 steps, including 5 resets, run visited all 1 properties in 6 ms. (steps per millisecond=75 )
Parikh walk visited 0 properties in 0 ms.
FORMULA BusinessProcesses-PT-12-LTLCardinality-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 447 stabilizing places and 388 stable transitions
Graph (complete) has 1042 edges and 462 vertex of which 460 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.17 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 2 out of 462 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 462/462 places, 403/403 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 461 transition count 403
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 7 place count 455 transition count 397
Iterating global reduction 1 with 6 rules applied. Total rules applied 13 place count 455 transition count 397
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 454 transition count 396
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 454 transition count 396
Applied a total of 15 rules in 60 ms. Remains 454 /462 variables (removed 8) and now considering 396/403 (removed 7) transitions.
// Phase 1: matrix 396 rows 454 cols
[2024-05-25 15:31:50] [INFO ] Computed 95 invariants in 12 ms
[2024-05-25 15:31:50] [INFO ] Implicit Places using invariants in 182 ms returned []
[2024-05-25 15:31:50] [INFO ] Invariant cache hit.
[2024-05-25 15:31:51] [INFO ] Implicit Places using invariants and state equation in 580 ms returned []
Implicit Place search using SMT with State Equation took 767 ms to find 0 implicit places.
[2024-05-25 15:31:51] [INFO ] Invariant cache hit.
[2024-05-25 15:31:51] [INFO ] Dead Transitions using invariants and state equation in 234 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 454/462 places, 396/403 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1064 ms. Remains : 454/462 places, 396/403 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 351 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-12-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(OR (EQ s63 0) (EQ s110 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 434 ms.
Product exploration explored 100000 steps with 25000 reset in 307 ms.
Computed a total of 439 stabilizing places and 381 stable transitions
Graph (complete) has 1032 edges and 454 vertex of which 453 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Computed a total of 439 stabilizing places and 381 stable transitions
Detected a total of 439/454 stabilizing places and 381/396 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 125 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 223 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 72 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Finished probabilistic random walk after 978112 steps, run visited all 1 properties in 2802 ms. (steps per millisecond=349 )
Probabilistic random walk after 978112 steps, saw 148402 distinct states, run finished after 2804 ms. (steps per millisecond=348 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 148 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 209 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 214 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 454 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 454/454 places, 396/396 transitions.
Applied a total of 0 rules in 31 ms. Remains 454 /454 variables (removed 0) and now considering 396/396 (removed 0) transitions.
[2024-05-25 15:31:56] [INFO ] Invariant cache hit.
[2024-05-25 15:31:56] [INFO ] Implicit Places using invariants in 223 ms returned []
[2024-05-25 15:31:56] [INFO ] Invariant cache hit.
[2024-05-25 15:31:57] [INFO ] Implicit Places using invariants and state equation in 723 ms returned []
Implicit Place search using SMT with State Equation took 951 ms to find 0 implicit places.
[2024-05-25 15:31:57] [INFO ] Invariant cache hit.
[2024-05-25 15:31:57] [INFO ] Dead Transitions using invariants and state equation in 287 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1274 ms. Remains : 454/454 places, 396/396 transitions.
Computed a total of 439 stabilizing places and 381 stable transitions
Graph (complete) has 1032 edges and 454 vertex of which 453 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Computed a total of 439 stabilizing places and 381 stable transitions
Detected a total of 439/454 stabilizing places and 381/396 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 98 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 184 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 73 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 14 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Finished probabilistic random walk after 978112 steps, run visited all 1 properties in 2841 ms. (steps per millisecond=344 )
Probabilistic random walk after 978112 steps, saw 148402 distinct states, run finished after 2842 ms. (steps per millisecond=344 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 172 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 197 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 237 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 220 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 296 ms.
Product exploration explored 100000 steps with 25000 reset in 293 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 211 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 454 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 454/454 places, 396/396 transitions.
Graph (trivial) has 204 edges and 454 vertex of which 6 / 454 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 1026 edges and 449 vertex of which 448 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
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 44 rules applied. Total rules applied 46 place count 448 transition count 389
Performed 69 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 69 Pre rules applied. Total rules applied 46 place count 448 transition count 438
Deduced a syphon composed of 113 places in 1 ms
Iterating global reduction 1 with 69 rules applied. Total rules applied 115 place count 448 transition count 438
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 131 place count 432 transition count 407
Deduced a syphon composed of 97 places in 1 ms
Iterating global reduction 1 with 16 rules applied. Total rules applied 147 place count 432 transition count 407
Performed 147 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 244 places in 0 ms
Iterating global reduction 1 with 147 rules applied. Total rules applied 294 place count 432 transition count 407
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 327 place count 399 transition count 374
Deduced a syphon composed of 211 places in 0 ms
Iterating global reduction 1 with 33 rules applied. Total rules applied 360 place count 399 transition count 374
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 212 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 361 place count 399 transition count 388
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 362 place count 398 transition count 386
Deduced a syphon composed of 211 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 363 place count 398 transition count 386
Deduced a syphon composed of 211 places in 0 ms
Applied a total of 363 rules in 133 ms. Remains 398 /454 variables (removed 56) and now considering 386/396 (removed 10) transitions.
[2024-05-25 15:32:03] [INFO ] Redundant transitions in 27 ms returned []
// Phase 1: matrix 386 rows 398 cols
[2024-05-25 15:32:03] [INFO ] Computed 95 invariants in 11 ms
[2024-05-25 15:32:03] [INFO ] Dead Transitions using invariants and state equation in 246 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 398/454 places, 386/396 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 418 ms. Remains : 398/454 places, 386/396 transitions.
Built C files in :
/tmp/ltsmin7700530233623937147
[2024-05-25 15:32:03] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7700530233623937147
Running compilation step : cd /tmp/ltsmin7700530233623937147;'/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 1041 ms.
Running link step : cd /tmp/ltsmin7700530233623937147;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 84 ms.
Running LTSmin : cd /tmp/ltsmin7700530233623937147;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased6290551845566534167.hoa' '--buchi-type=spotba'
LTSmin run took 297 ms.
FORMULA BusinessProcesses-PT-12-LTLCardinality-00 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property BusinessProcesses-PT-12-LTLCardinality-00 finished in 14346 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 462 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 462/462 places, 403/403 transitions.
Graph (trivial) has 212 edges and 462 vertex of which 6 / 462 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 1036 edges and 457 vertex of which 455 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 51 place count 454 transition count 346
Reduce places removed 49 places and 0 transitions.
Iterating post reduction 1 with 49 rules applied. Total rules applied 100 place count 405 transition count 346
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 96 Pre rules applied. Total rules applied 100 place count 405 transition count 250
Deduced a syphon composed of 96 places in 1 ms
Ensure Unique test removed 18 places
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 2 with 210 rules applied. Total rules applied 310 place count 291 transition count 250
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 316 place count 285 transition count 244
Iterating global reduction 2 with 6 rules applied. Total rules applied 322 place count 285 transition count 244
Performed 115 Post agglomeration using F-continuation condition.Transition count delta: 115
Deduced a syphon composed of 115 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 119 places and 0 transitions.
Iterating global reduction 2 with 234 rules applied. Total rules applied 556 place count 166 transition count 129
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -3
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 560 place count 164 transition count 132
Partial Post-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 566 place count 164 transition count 132
Applied a total of 566 rules in 57 ms. Remains 164 /462 variables (removed 298) and now considering 132/403 (removed 271) transitions.
// Phase 1: matrix 132 rows 164 cols
[2024-05-25 15:32:04] [INFO ] Computed 73 invariants in 2 ms
[2024-05-25 15:32:05] [INFO ] Implicit Places using invariants in 143 ms returned [1, 2, 5, 6, 29, 30, 31, 32, 41, 42, 43, 48, 49, 50, 51, 52, 53, 54, 55]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 147 ms to find 19 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 145/462 places, 132/403 transitions.
Applied a total of 0 rules in 7 ms. Remains 145 /145 variables (removed 0) and now considering 132/132 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 211 ms. Remains : 145/462 places, 132/403 transitions.
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-12-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (NEQ s104 0) (NEQ s27 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-12-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-12-LTLCardinality-01 finished in 277 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 462 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 462/462 places, 403/403 transitions.
Graph (trivial) has 210 edges and 462 vertex of which 6 / 462 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 1036 edges and 457 vertex of which 455 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 50 place count 454 transition count 347
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 98 place count 406 transition count 347
Performed 97 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 97 Pre rules applied. Total rules applied 98 place count 406 transition count 250
Deduced a syphon composed of 97 places in 0 ms
Ensure Unique test removed 18 places
Reduce places removed 115 places and 0 transitions.
Iterating global reduction 2 with 212 rules applied. Total rules applied 310 place count 291 transition count 250
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 314 place count 287 transition count 246
Iterating global reduction 2 with 4 rules applied. Total rules applied 318 place count 287 transition count 246
Performed 117 Post agglomeration using F-continuation condition.Transition count delta: 117
Deduced a syphon composed of 117 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 121 places and 0 transitions.
Iterating global reduction 2 with 238 rules applied. Total rules applied 556 place count 166 transition count 129
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -3
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 560 place count 164 transition count 132
Applied a total of 560 rules in 51 ms. Remains 164 /462 variables (removed 298) and now considering 132/403 (removed 271) transitions.
// Phase 1: matrix 132 rows 164 cols
[2024-05-25 15:32:05] [INFO ] Computed 73 invariants in 4 ms
[2024-05-25 15:32:05] [INFO ] Implicit Places using invariants in 150 ms returned [1, 2, 5, 6, 29, 30, 31, 32, 39, 40, 41, 46, 47, 48, 49, 50, 51, 52, 53]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 152 ms to find 19 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 145/462 places, 132/403 transitions.
Applied a total of 0 rules in 13 ms. Remains 145 /145 variables (removed 0) and now considering 132/132 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 216 ms. Remains : 145/462 places, 132/403 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-12-LTLCardinality-02 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 s78 0) (EQ s104 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-12-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-12-LTLCardinality-02 finished in 290 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 462 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 462/462 places, 403/403 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 461 transition count 403
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 6 place count 456 transition count 398
Iterating global reduction 1 with 5 rules applied. Total rules applied 11 place count 456 transition count 398
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 455 transition count 397
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 455 transition count 397
Applied a total of 13 rules in 31 ms. Remains 455 /462 variables (removed 7) and now considering 397/403 (removed 6) transitions.
// Phase 1: matrix 397 rows 455 cols
[2024-05-25 15:32:05] [INFO ] Computed 95 invariants in 9 ms
[2024-05-25 15:32:05] [INFO ] Implicit Places using invariants in 214 ms returned []
[2024-05-25 15:32:05] [INFO ] Invariant cache hit.
[2024-05-25 15:32:06] [INFO ] Implicit Places using invariants and state equation in 555 ms returned []
Implicit Place search using SMT with State Equation took 775 ms to find 0 implicit places.
[2024-05-25 15:32:06] [INFO ] Invariant cache hit.
[2024-05-25 15:32:06] [INFO ] Dead Transitions using invariants and state equation in 277 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 455/462 places, 397/403 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1085 ms. Remains : 455/462 places, 397/403 transitions.
Stuttering acceptance computed with spot in 111 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-12-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s339 0) (EQ s138 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-12-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-12-LTLCardinality-05 finished in 1219 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((F(p0)&&G((X(G(p1))||F(p2))))))'
Support contains 5 out of 462 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 462/462 places, 403/403 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 461 transition count 403
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 6 place count 456 transition count 398
Iterating global reduction 1 with 5 rules applied. Total rules applied 11 place count 456 transition count 398
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 455 transition count 397
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 455 transition count 397
Applied a total of 13 rules in 44 ms. Remains 455 /462 variables (removed 7) and now considering 397/403 (removed 6) transitions.
// Phase 1: matrix 397 rows 455 cols
[2024-05-25 15:32:06] [INFO ] Computed 95 invariants in 6 ms
[2024-05-25 15:32:06] [INFO ] Implicit Places using invariants in 191 ms returned []
[2024-05-25 15:32:06] [INFO ] Invariant cache hit.
[2024-05-25 15:32:07] [INFO ] Implicit Places using invariants and state equation in 605 ms returned []
Implicit Place search using SMT with State Equation took 802 ms to find 0 implicit places.
[2024-05-25 15:32:07] [INFO ] Invariant cache hit.
[2024-05-25 15:32:07] [INFO ] Dead Transitions using invariants and state equation in 283 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 455/462 places, 397/403 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1132 ms. Remains : 455/462 places, 397/403 transitions.
Stuttering acceptance computed with spot in 367 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), false]
Running random walk in product with property : BusinessProcesses-PT-12-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0, 1} source=1 dest: 1}], [{ cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0, 1} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p2) (NOT p1)), acceptance={1} source=2 dest: 5}], [{ cond=(NOT p2), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=4 dest: 4}], [{ cond=(AND (NOT p2) p1), acceptance={0, 1} source=5 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={1} source=5 dest: 5}]], initial=0, aps=[p0:(OR (EQ s338 0) (EQ s228 1)), p2:(AND (EQ s264 0) (EQ s237 1)), p1:(EQ s325 0)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1815 reset in 250 ms.
Product exploration explored 100000 steps with 1809 reset in 360 ms.
Computed a total of 440 stabilizing places and 382 stable transitions
Graph (complete) has 1033 edges and 455 vertex of which 454 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 440 stabilizing places and 382 stable transitions
Detected a total of 440/455 stabilizing places and 382/397 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (AND (NOT p2) p1)), (X p0), (X (NOT (AND (NOT p2) (NOT p1)))), true, (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND (NOT p2) p1))), (X (X p0)), (X (X (NOT (AND (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 : []
Knowledge based reduction with 16 factoid took 1334 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 317 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0)), false]
Finished random walk after 559 steps, including 4 resets, run visited all 5 properties in 9 ms. (steps per millisecond=62 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (AND (NOT p2) p1)), (X p0), (X (NOT (AND (NOT p2) (NOT p1)))), true, (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND (NOT p2) p1))), (X (X p0)), (X (X (NOT (AND (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 : [(F (AND (NOT p2) (NOT p0))), (F p2), (F (NOT (AND p1 (NOT p2)))), (F (AND (NOT p1) (NOT p2) (NOT p0))), (F (AND (NOT p1) (NOT p2)))]
Knowledge based reduction with 16 factoid took 3228 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 332 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0)), false]
Stuttering acceptance computed with spot in 321 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0)), false]
Support contains 5 out of 455 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 455/455 places, 397/397 transitions.
Applied a total of 0 rules in 15 ms. Remains 455 /455 variables (removed 0) and now considering 397/397 (removed 0) transitions.
[2024-05-25 15:32:14] [INFO ] Invariant cache hit.
[2024-05-25 15:32:14] [INFO ] Implicit Places using invariants in 246 ms returned []
[2024-05-25 15:32:14] [INFO ] Invariant cache hit.
[2024-05-25 15:32:15] [INFO ] Implicit Places using invariants and state equation in 634 ms returned []
Implicit Place search using SMT with State Equation took 882 ms to find 0 implicit places.
[2024-05-25 15:32:15] [INFO ] Invariant cache hit.
[2024-05-25 15:32:15] [INFO ] Dead Transitions using invariants and state equation in 276 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1180 ms. Remains : 455/455 places, 397/397 transitions.
Computed a total of 440 stabilizing places and 382 stable transitions
Graph (complete) has 1033 edges and 455 vertex of which 454 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 440 stabilizing places and 382 stable transitions
Detected a total of 440/455 stabilizing places and 382/397 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p2) p0), (X (AND p1 (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT p2)), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), true, (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p2))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 967 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 300 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0)), false]
Finished random walk after 2444 steps, including 18 resets, run visited all 5 properties in 15 ms. (steps per millisecond=162 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 (NOT p2) p0), (X (AND p1 (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT p2)), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), true, (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p2))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p2) (NOT p0))), (F p2), (F (NOT (AND p1 (NOT p2)))), (F (AND (NOT p1) (NOT p2) (NOT p0))), (F (AND (NOT p1) (NOT p2)))]
Knowledge based reduction with 14 factoid took 2532 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 248 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0)), false]
Stuttering acceptance computed with spot in 211 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0)), false]
Stuttering acceptance computed with spot in 228 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0)), false]
Product exploration explored 100000 steps with 1809 reset in 236 ms.
Product exploration explored 100000 steps with 1800 reset in 246 ms.
Applying partial POR strategy [false, true, false, true, true]
Stuttering acceptance computed with spot in 286 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0)), false]
Support contains 5 out of 455 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 455/455 places, 397/397 transitions.
Graph (trivial) has 203 edges and 455 vertex of which 6 / 455 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 1027 edges and 450 vertex of which 449 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 45 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 45 rules applied. Total rules applied 47 place count 449 transition count 390
Performed 68 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 68 Pre rules applied. Total rules applied 47 place count 449 transition count 439
Deduced a syphon composed of 113 places in 1 ms
Iterating global reduction 1 with 68 rules applied. Total rules applied 115 place count 449 transition count 439
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 131 place count 433 transition count 408
Deduced a syphon composed of 97 places in 1 ms
Iterating global reduction 1 with 16 rules applied. Total rules applied 147 place count 433 transition count 408
Performed 144 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 241 places in 0 ms
Iterating global reduction 1 with 144 rules applied. Total rules applied 291 place count 433 transition count 408
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 325 place count 399 transition count 374
Deduced a syphon composed of 207 places in 1 ms
Iterating global reduction 1 with 34 rules applied. Total rules applied 359 place count 399 transition count 374
Deduced a syphon composed of 207 places in 0 ms
Applied a total of 359 rules in 57 ms. Remains 399 /455 variables (removed 56) and now considering 374/397 (removed 23) transitions.
[2024-05-25 15:32:21] [INFO ] Redundant transitions in 7 ms returned []
// Phase 1: matrix 374 rows 399 cols
[2024-05-25 15:32:21] [INFO ] Computed 95 invariants in 11 ms
[2024-05-25 15:32:21] [INFO ] Dead Transitions using invariants and state equation in 264 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 399/455 places, 374/397 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 340 ms. Remains : 399/455 places, 374/397 transitions.
Built C files in :
/tmp/ltsmin12796130303497658253
[2024-05-25 15:32:21] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12796130303497658253
Running compilation step : cd /tmp/ltsmin12796130303497658253;'/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 711 ms.
Running link step : cd /tmp/ltsmin12796130303497658253;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 59 ms.
Running LTSmin : cd /tmp/ltsmin12796130303497658253;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased8340517805417424505.hoa' '--buchi-type=spotba'
LTSmin run took 211 ms.
FORMULA BusinessProcesses-PT-12-LTLCardinality-06 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property BusinessProcesses-PT-12-LTLCardinality-06 finished in 15781 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(X(p1))||p0))))'
Support contains 3 out of 462 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 462/462 places, 403/403 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 461 transition count 403
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 6 place count 456 transition count 398
Iterating global reduction 1 with 5 rules applied. Total rules applied 11 place count 456 transition count 398
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 455 transition count 397
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 455 transition count 397
Applied a total of 13 rules in 25 ms. Remains 455 /462 variables (removed 7) and now considering 397/403 (removed 6) transitions.
// Phase 1: matrix 397 rows 455 cols
[2024-05-25 15:32:22] [INFO ] Computed 95 invariants in 6 ms
[2024-05-25 15:32:22] [INFO ] Implicit Places using invariants in 201 ms returned []
[2024-05-25 15:32:22] [INFO ] Invariant cache hit.
[2024-05-25 15:32:23] [INFO ] Implicit Places using invariants and state equation in 560 ms returned []
Implicit Place search using SMT with State Equation took 769 ms to find 0 implicit places.
[2024-05-25 15:32:23] [INFO ] Invariant cache hit.
[2024-05-25 15:32:23] [INFO ] Dead Transitions using invariants and state equation in 252 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 455/462 places, 397/403 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1047 ms. Remains : 455/462 places, 397/403 transitions.
Stuttering acceptance computed with spot in 220 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-12-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}]], initial=0, aps=[p0:(OR (EQ s289 0) (EQ s335 1)), p1:(EQ s256 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 322 ms.
Product exploration explored 100000 steps with 50000 reset in 298 ms.
Computed a total of 440 stabilizing places and 382 stable transitions
Graph (complete) has 1033 edges and 455 vertex of which 454 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 440 stabilizing places and 382 stable transitions
Detected a total of 440/455 stabilizing places and 382/397 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 25 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-12-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-12-LTLCardinality-07 finished in 1941 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(p0))&&(G(F(!p1))||(F(!p1)&&F(G(p2)))))))'
Support contains 3 out of 462 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 462/462 places, 403/403 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 461 transition count 403
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 7 place count 455 transition count 397
Iterating global reduction 1 with 6 rules applied. Total rules applied 13 place count 455 transition count 397
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 454 transition count 396
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 454 transition count 396
Applied a total of 15 rules in 35 ms. Remains 454 /462 variables (removed 8) and now considering 396/403 (removed 7) transitions.
// Phase 1: matrix 396 rows 454 cols
[2024-05-25 15:32:24] [INFO ] Computed 95 invariants in 6 ms
[2024-05-25 15:32:24] [INFO ] Implicit Places using invariants in 226 ms returned []
[2024-05-25 15:32:24] [INFO ] Invariant cache hit.
[2024-05-25 15:32:25] [INFO ] Implicit Places using invariants and state equation in 625 ms returned []
Implicit Place search using SMT with State Equation took 853 ms to find 0 implicit places.
[2024-05-25 15:32:25] [INFO ] Invariant cache hit.
[2024-05-25 15:32:25] [INFO ] Dead Transitions using invariants and state equation in 237 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 454/462 places, 396/403 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1127 ms. Remains : 454/462 places, 396/403 transitions.
Stuttering acceptance computed with spot in 308 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (NOT p0), (OR (NOT p0) (AND p1 (NOT p2))), p1, (AND p1 (NOT p2))]
Running random walk in product with property : BusinessProcesses-PT-12-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}, { cond=p1, acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 5}], [{ cond=p1, acceptance={0} source=4 dest: 4}], [{ cond=(AND p1 p2), acceptance={} source=5 dest: 5}, { cond=(AND p1 (NOT p2)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(EQ s103 0), p1:(OR (EQ s2 0) (EQ s430 1)), p2:(NEQ s103 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1429 reset in 204 ms.
Stack based approach found an accepted trace after 6146 steps with 84 reset with depth 6 and stack size 6 in 15 ms.
FORMULA BusinessProcesses-PT-12-LTLCardinality-08 FALSE TECHNIQUES STACK_TEST
Treatment of property BusinessProcesses-PT-12-LTLCardinality-08 finished in 1697 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 462 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 462/462 places, 403/403 transitions.
Graph (trivial) has 210 edges and 462 vertex of which 6 / 462 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 1036 edges and 457 vertex of which 455 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 50 place count 454 transition count 347
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 98 place count 406 transition count 347
Performed 97 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 97 Pre rules applied. Total rules applied 98 place count 406 transition count 250
Deduced a syphon composed of 97 places in 0 ms
Ensure Unique test removed 17 places
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 2 with 211 rules applied. Total rules applied 309 place count 292 transition count 250
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 314 place count 287 transition count 245
Iterating global reduction 2 with 5 rules applied. Total rules applied 319 place count 287 transition count 245
Performed 116 Post agglomeration using F-continuation condition.Transition count delta: 116
Deduced a syphon composed of 116 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 2 with 236 rules applied. Total rules applied 555 place count 167 transition count 129
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -3
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 559 place count 165 transition count 132
Applied a total of 559 rules in 33 ms. Remains 165 /462 variables (removed 297) and now considering 132/403 (removed 271) transitions.
// Phase 1: matrix 132 rows 165 cols
[2024-05-25 15:32:26] [INFO ] Computed 74 invariants in 2 ms
[2024-05-25 15:32:26] [INFO ] Implicit Places using invariants in 141 ms returned [1, 2, 3, 6, 7, 30, 31, 32, 33, 40, 41, 42, 47, 48, 49, 50, 51, 55, 56]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 144 ms to find 19 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 146/462 places, 132/403 transitions.
Applied a total of 0 rules in 4 ms. Remains 146 /146 variables (removed 0) and now considering 132/132 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 182 ms. Remains : 146/462 places, 132/403 transitions.
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-12-LTLCardinality-09 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 s36 0) (EQ s100 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 414 steps with 89 reset in 4 ms.
FORMULA BusinessProcesses-PT-12-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-12-LTLCardinality-09 finished in 292 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 462 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 462/462 places, 403/403 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 461 transition count 403
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 6 place count 456 transition count 398
Iterating global reduction 1 with 5 rules applied. Total rules applied 11 place count 456 transition count 398
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 455 transition count 397
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 455 transition count 397
Applied a total of 13 rules in 23 ms. Remains 455 /462 variables (removed 7) and now considering 397/403 (removed 6) transitions.
// Phase 1: matrix 397 rows 455 cols
[2024-05-25 15:32:26] [INFO ] Computed 95 invariants in 3 ms
[2024-05-25 15:32:26] [INFO ] Implicit Places using invariants in 209 ms returned []
[2024-05-25 15:32:26] [INFO ] Invariant cache hit.
[2024-05-25 15:32:27] [INFO ] Implicit Places using invariants and state equation in 537 ms returned []
Implicit Place search using SMT with State Equation took 748 ms to find 0 implicit places.
[2024-05-25 15:32:27] [INFO ] Invariant cache hit.
[2024-05-25 15:32:27] [INFO ] Dead Transitions using invariants and state equation in 274 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 455/462 places, 397/403 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1046 ms. Remains : 455/462 places, 397/403 transitions.
Stuttering acceptance computed with spot in 149 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-12-LTLCardinality-11 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:(AND (EQ s358 0) (EQ s442 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 0 ms.
FORMULA BusinessProcesses-PT-12-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-12-LTLCardinality-11 finished in 1214 ms.
All properties solved by simple procedures.
Total runtime 45250 ms.

BK_STOP 1716651147821

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BusinessProcesses-PT-12"
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-12, 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-171620414900337"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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