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.r041-tajo-167813694900595.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 ltsminxred
Input is BusinessProcesses-PT-19, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r041-tajo-167813694900595
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 628K
-rw-r--r-- 1 mcc users 7.0K Feb 25 16:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 25 16:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Feb 25 16:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Feb 25 16:45 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:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 16:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K Feb 25 16:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Feb 25 16:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K Feb 25 16:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:39 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 189K 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-19-LTLCardinality-00
FORMULA_NAME BusinessProcesses-PT-19-LTLCardinality-01
FORMULA_NAME BusinessProcesses-PT-19-LTLCardinality-02
FORMULA_NAME BusinessProcesses-PT-19-LTLCardinality-03
FORMULA_NAME BusinessProcesses-PT-19-LTLCardinality-04
FORMULA_NAME BusinessProcesses-PT-19-LTLCardinality-05
FORMULA_NAME BusinessProcesses-PT-19-LTLCardinality-06
FORMULA_NAME BusinessProcesses-PT-19-LTLCardinality-07
FORMULA_NAME BusinessProcesses-PT-19-LTLCardinality-08
FORMULA_NAME BusinessProcesses-PT-19-LTLCardinality-09
FORMULA_NAME BusinessProcesses-PT-19-LTLCardinality-10
FORMULA_NAME BusinessProcesses-PT-19-LTLCardinality-11
FORMULA_NAME BusinessProcesses-PT-19-LTLCardinality-12
FORMULA_NAME BusinessProcesses-PT-19-LTLCardinality-13
FORMULA_NAME BusinessProcesses-PT-19-LTLCardinality-14
FORMULA_NAME BusinessProcesses-PT-19-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678649182215

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=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-19
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 19:26:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-12 19:26:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 19:26:23] [INFO ] Load time of PNML (sax parser for PT used): 77 ms
[2023-03-12 19:26:23] [INFO ] Transformed 772 places.
[2023-03-12 19:26:23] [INFO ] Transformed 685 transitions.
[2023-03-12 19:26:23] [INFO ] Found NUPN structural information;
[2023-03-12 19:26:23] [INFO ] Parsed PT model containing 772 places and 685 transitions and 1981 arcs in 153 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 15 places in 20 ms
Reduce places removed 15 places and 15 transitions.
FORMULA BusinessProcesses-PT-19-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-19-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-19-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-19-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-19-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-19-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-19-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-19-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-19-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 27 out of 757 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 757/757 places, 670/670 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 749 transition count 670
Discarding 105 places :
Symmetric choice reduction at 1 with 105 rule applications. Total rules 113 place count 644 transition count 565
Iterating global reduction 1 with 105 rules applied. Total rules applied 218 place count 644 transition count 565
Discarding 52 places :
Symmetric choice reduction at 1 with 52 rule applications. Total rules 270 place count 592 transition count 513
Iterating global reduction 1 with 52 rules applied. Total rules applied 322 place count 592 transition count 513
Applied a total of 322 rules in 144 ms. Remains 592 /757 variables (removed 165) and now considering 513/670 (removed 157) transitions.
// Phase 1: matrix 513 rows 592 cols
[2023-03-12 19:26:24] [INFO ] Computed 117 place invariants in 39 ms
[2023-03-12 19:26:24] [INFO ] Implicit Places using invariants in 385 ms returned []
[2023-03-12 19:26:24] [INFO ] Invariant cache hit.
[2023-03-12 19:26:25] [INFO ] Implicit Places using invariants and state equation in 755 ms returned []
Implicit Place search using SMT with State Equation took 1168 ms to find 0 implicit places.
[2023-03-12 19:26:25] [INFO ] Invariant cache hit.
[2023-03-12 19:26:25] [INFO ] Dead Transitions using invariants and state equation in 476 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 592/757 places, 513/670 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1791 ms. Remains : 592/757 places, 513/670 transitions.
Support contains 27 out of 592 places after structural reductions.
[2023-03-12 19:26:26] [INFO ] Flatten gal took : 96 ms
[2023-03-12 19:26:26] [INFO ] Flatten gal took : 40 ms
[2023-03-12 19:26:26] [INFO ] Input system was already deterministic with 513 transitions.
Incomplete random walk after 10000 steps, including 55 resets, run finished after 621 ms. (steps per millisecond=16 ) properties (out of 18) seen :3
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Running SMT prover for 15 properties.
[2023-03-12 19:26:27] [INFO ] Invariant cache hit.
[2023-03-12 19:26:27] [INFO ] After 255ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2023-03-12 19:26:27] [INFO ] [Nat]Absence check using 70 positive place invariants in 25 ms returned sat
[2023-03-12 19:26:27] [INFO ] [Nat]Absence check using 70 positive and 47 generalized place invariants in 20 ms returned sat
[2023-03-12 19:26:28] [INFO ] After 591ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :15
[2023-03-12 19:26:28] [INFO ] Deduced a trap composed of 14 places in 117 ms of which 7 ms to minimize.
[2023-03-12 19:26:28] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 1 ms to minimize.
[2023-03-12 19:26:28] [INFO ] Deduced a trap composed of 14 places in 89 ms of which 1 ms to minimize.
[2023-03-12 19:26:28] [INFO ] Deduced a trap composed of 31 places in 53 ms of which 2 ms to minimize.
[2023-03-12 19:26:28] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 457 ms
[2023-03-12 19:26:29] [INFO ] Deduced a trap composed of 16 places in 95 ms of which 1 ms to minimize.
[2023-03-12 19:26:29] [INFO ] Deduced a trap composed of 44 places in 67 ms of which 1 ms to minimize.
[2023-03-12 19:26:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 226 ms
[2023-03-12 19:26:29] [INFO ] Deduced a trap composed of 100 places in 136 ms of which 1 ms to minimize.
[2023-03-12 19:26:29] [INFO ] Deduced a trap composed of 106 places in 165 ms of which 0 ms to minimize.
[2023-03-12 19:26:29] [INFO ] Deduced a trap composed of 98 places in 209 ms of which 0 ms to minimize.
[2023-03-12 19:26:30] [INFO ] Deduced a trap composed of 102 places in 218 ms of which 1 ms to minimize.
[2023-03-12 19:26:30] [INFO ] Deduced a trap composed of 102 places in 249 ms of which 1 ms to minimize.
[2023-03-12 19:26:31] [INFO ] Deduced a trap composed of 106 places in 1119 ms of which 1 ms to minimize.
[2023-03-12 19:26:31] [INFO ] Deduced a trap composed of 111 places in 173 ms of which 1 ms to minimize.
[2023-03-12 19:26:31] [INFO ] Deduced a trap composed of 97 places in 175 ms of which 1 ms to minimize.
[2023-03-12 19:26:32] [INFO ] Deduced a trap composed of 114 places in 150 ms of which 0 ms to minimize.
[2023-03-12 19:26:32] [INFO ] Deduced a trap composed of 101 places in 187 ms of which 1 ms to minimize.
[2023-03-12 19:26:32] [INFO ] Deduced a trap composed of 119 places in 161 ms of which 1 ms to minimize.
[2023-03-12 19:26:32] [INFO ] Deduced a trap composed of 107 places in 137 ms of which 1 ms to minimize.
[2023-03-12 19:26:32] [INFO ] Deduced a trap composed of 126 places in 131 ms of which 0 ms to minimize.
[2023-03-12 19:26:32] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 3655 ms
[2023-03-12 19:26:33] [INFO ] After 5644ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :15
Attempting to minimize the solution found.
Minimization took 426 ms.
[2023-03-12 19:26:33] [INFO ] After 6460ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :15
Fused 15 Parikh solutions to 14 different solutions.
Parikh walk visited 1 properties in 348 ms.
Support contains 20 out of 592 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 592/592 places, 513/513 transitions.
Graph (trivial) has 264 edges and 592 vertex of which 6 / 592 are part of one of the 1 SCC in 4 ms
Free SCC test removed 5 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1309 edges and 587 vertex of which 586 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 0 with 63 rules applied. Total rules applied 65 place count 586 transition count 442
Reduce places removed 63 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 66 rules applied. Total rules applied 131 place count 523 transition count 439
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 134 place count 520 transition count 439
Performed 114 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 114 Pre rules applied. Total rules applied 134 place count 520 transition count 325
Deduced a syphon composed of 114 places in 1 ms
Ensure Unique test removed 23 places
Reduce places removed 137 places and 0 transitions.
Iterating global reduction 3 with 251 rules applied. Total rules applied 385 place count 383 transition count 325
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 386 place count 382 transition count 324
Iterating global reduction 3 with 1 rules applied. Total rules applied 387 place count 382 transition count 324
Performed 155 Post agglomeration using F-continuation condition.Transition count delta: 155
Deduced a syphon composed of 155 places in 1 ms
Ensure Unique test removed 4 places
Reduce places removed 159 places and 0 transitions.
Iterating global reduction 3 with 314 rules applied. Total rules applied 701 place count 223 transition count 169
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 703 place count 222 transition count 172
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 705 place count 222 transition count 170
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 707 place count 220 transition count 170
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 708 place count 220 transition count 170
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 709 place count 219 transition count 169
Applied a total of 709 rules in 148 ms. Remains 219 /592 variables (removed 373) and now considering 169/513 (removed 344) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 148 ms. Remains : 219/592 places, 169/513 transitions.
Finished random walk after 2163 steps, including 79 resets, run visited all 14 properties in 31 ms. (steps per millisecond=69 )
FORMULA BusinessProcesses-PT-19-LTLCardinality-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 533 stabilizing places and 464 stable transitions
Graph (complete) has 1316 edges and 592 vertex of which 591 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.18 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&&F((X((!p1 U (p2||G(!p1))))||(p0&&F(G(!p1))))))||G(F(((!p1 U (p2||G(!p1)))||(p0&&F(G(!p1)))))))))'
Support contains 4 out of 592 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 592/592 places, 513/513 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 585 transition count 506
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 585 transition count 506
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 18 place count 581 transition count 502
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 581 transition count 502
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 580 transition count 501
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 580 transition count 501
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 579 transition count 500
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 579 transition count 500
Applied a total of 26 rules in 117 ms. Remains 579 /592 variables (removed 13) and now considering 500/513 (removed 13) transitions.
// Phase 1: matrix 500 rows 579 cols
[2023-03-12 19:26:34] [INFO ] Computed 117 place invariants in 10 ms
[2023-03-12 19:26:35] [INFO ] Implicit Places using invariants in 226 ms returned []
[2023-03-12 19:26:35] [INFO ] Invariant cache hit.
[2023-03-12 19:26:35] [INFO ] Implicit Places using invariants and state equation in 697 ms returned []
Implicit Place search using SMT with State Equation took 932 ms to find 0 implicit places.
[2023-03-12 19:26:35] [INFO ] Invariant cache hit.
[2023-03-12 19:26:36] [INFO ] Dead Transitions using invariants and state equation in 291 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 579/592 places, 500/513 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1343 ms. Remains : 579/592 places, 500/513 transitions.
Stuttering acceptance computed with spot in 221 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2))]
Running random walk in product with property : BusinessProcesses-PT-19-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(OR (NOT p0) (AND p1 (NOT p2))), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(NEQ s572 1), p1:(OR (EQ s465 0) (EQ s329 1)), p2:(AND (NOT (OR (EQ s465 0) (EQ s329 1))) (NEQ s198 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 203 steps with 0 reset in 6 ms.
FORMULA BusinessProcesses-PT-19-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-19-LTLCardinality-01 finished in 1653 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(G(p0)))'
Support contains 2 out of 592 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 592/592 places, 513/513 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 584 transition count 505
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 584 transition count 505
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 20 place count 580 transition count 501
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 580 transition count 501
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 579 transition count 500
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 579 transition count 500
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 578 transition count 499
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 578 transition count 499
Applied a total of 28 rules in 72 ms. Remains 578 /592 variables (removed 14) and now considering 499/513 (removed 14) transitions.
// Phase 1: matrix 499 rows 578 cols
[2023-03-12 19:26:36] [INFO ] Computed 117 place invariants in 6 ms
[2023-03-12 19:26:36] [INFO ] Implicit Places using invariants in 202 ms returned []
[2023-03-12 19:26:36] [INFO ] Invariant cache hit.
[2023-03-12 19:26:37] [INFO ] Implicit Places using invariants and state equation in 627 ms returned []
Implicit Place search using SMT with State Equation took 832 ms to find 0 implicit places.
[2023-03-12 19:26:37] [INFO ] Invariant cache hit.
[2023-03-12 19:26:37] [INFO ] Dead Transitions using invariants and state equation in 305 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 578/592 places, 499/513 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1210 ms. Remains : 578/592 places, 499/513 transitions.
Stuttering acceptance computed with spot in 86 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-19-LTLCardinality-02 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:(OR (EQ s324 0) (EQ s473 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 160 steps with 0 reset in 2 ms.
FORMULA BusinessProcesses-PT-19-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-19-LTLCardinality-02 finished in 1320 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(G(p0))&&F(p1))))'
Support contains 2 out of 592 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 592/592 places, 513/513 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 584 transition count 505
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 584 transition count 505
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 20 place count 580 transition count 501
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 580 transition count 501
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 579 transition count 500
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 579 transition count 500
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 578 transition count 499
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 578 transition count 499
Applied a total of 28 rules in 102 ms. Remains 578 /592 variables (removed 14) and now considering 499/513 (removed 14) transitions.
[2023-03-12 19:26:37] [INFO ] Invariant cache hit.
[2023-03-12 19:26:37] [INFO ] Implicit Places using invariants in 266 ms returned []
[2023-03-12 19:26:37] [INFO ] Invariant cache hit.
[2023-03-12 19:26:38] [INFO ] Implicit Places using invariants and state equation in 717 ms returned []
Implicit Place search using SMT with State Equation took 991 ms to find 0 implicit places.
[2023-03-12 19:26:38] [INFO ] Invariant cache hit.
[2023-03-12 19:26:39] [INFO ] Dead Transitions using invariants and state equation in 375 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 578/592 places, 499/513 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1471 ms. Remains : 578/592 places, 499/513 transitions.
Stuttering acceptance computed with spot in 174 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-19-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(OR (EQ s196 0) (EQ s567 1)), p0:(AND (EQ s567 0) (EQ s196 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 174 steps with 0 reset in 2 ms.
FORMULA BusinessProcesses-PT-19-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-19-LTLCardinality-06 finished in 1669 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((p0&&X(X(X(F(p1)))))) U G(p0))))'
Support contains 4 out of 592 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 592/592 places, 513/513 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 584 transition count 505
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 584 transition count 505
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 20 place count 580 transition count 501
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 580 transition count 501
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 579 transition count 500
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 579 transition count 500
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 578 transition count 499
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 578 transition count 499
Applied a total of 28 rules in 72 ms. Remains 578 /592 variables (removed 14) and now considering 499/513 (removed 14) transitions.
[2023-03-12 19:26:39] [INFO ] Invariant cache hit.
[2023-03-12 19:26:39] [INFO ] Implicit Places using invariants in 206 ms returned []
[2023-03-12 19:26:39] [INFO ] Invariant cache hit.
[2023-03-12 19:26:40] [INFO ] Implicit Places using invariants and state equation in 715 ms returned []
Implicit Place search using SMT with State Equation took 923 ms to find 0 implicit places.
[2023-03-12 19:26:40] [INFO ] Invariant cache hit.
[2023-03-12 19:26:40] [INFO ] Dead Transitions using invariants and state equation in 295 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 578/592 places, 499/513 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1291 ms. Remains : 578/592 places, 499/513 transitions.
Stuttering acceptance computed with spot in 351 ms :[(NOT p0), (NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true, (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-19-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 5}, { cond=p0, acceptance={} source=0 dest: 7}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=(NOT p0), acceptance={} source=2 dest: 4}, { cond=p0, acceptance={} source=2 dest: 6}], [{ cond=p0, acceptance={} source=3 dest: 2}, { cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=p0, acceptance={} source=5 dest: 3}, { cond=(NOT p0), acceptance={} source=5 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=6 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0} source=6 dest: 6}, { cond=(AND p0 p1), acceptance={0} source=6 dest: 7}], [{ cond=(NOT p0), acceptance={} source=7 dest: 4}, { cond=p0, acceptance={} source=7 dest: 7}]], initial=1, aps=[p0:(OR (EQ s73 0) (EQ s9 1)), p1:(OR (EQ s386 0) (EQ s416 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 18191 steps with 99 reset in 104 ms.
FORMULA BusinessProcesses-PT-19-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-19-LTLCardinality-07 finished in 1768 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)||G(p1))))'
Support contains 4 out of 592 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 592/592 places, 513/513 transitions.
Graph (trivial) has 279 edges and 592 vertex of which 6 / 592 are part of one of the 1 SCC in 2 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1310 edges and 587 vertex of which 586 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 68 transitions
Trivial Post-agglo rules discarded 68 transitions
Performed 68 trivial Post agglomeration. Transition count delta: 68
Iterating post reduction 0 with 68 rules applied. Total rules applied 70 place count 585 transition count 437
Reduce places removed 68 places and 0 transitions.
Iterating post reduction 1 with 68 rules applied. Total rules applied 138 place count 517 transition count 437
Performed 124 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 124 Pre rules applied. Total rules applied 138 place count 517 transition count 313
Deduced a syphon composed of 124 places in 1 ms
Ensure Unique test removed 24 places
Reduce places removed 148 places and 0 transitions.
Iterating global reduction 2 with 272 rules applied. Total rules applied 410 place count 369 transition count 313
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 416 place count 363 transition count 307
Iterating global reduction 2 with 6 rules applied. Total rules applied 422 place count 363 transition count 307
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 423 place count 362 transition count 306
Iterating global reduction 2 with 1 rules applied. Total rules applied 424 place count 362 transition count 306
Performed 157 Post agglomeration using F-continuation condition.Transition count delta: 157
Deduced a syphon composed of 157 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 162 places and 0 transitions.
Iterating global reduction 2 with 319 rules applied. Total rules applied 743 place count 200 transition count 149
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 745 place count 199 transition count 152
Applied a total of 745 rules in 78 ms. Remains 199 /592 variables (removed 393) and now considering 152/513 (removed 361) transitions.
// Phase 1: matrix 152 rows 199 cols
[2023-03-12 19:26:41] [INFO ] Computed 88 place invariants in 5 ms
[2023-03-12 19:26:41] [INFO ] Implicit Places using invariants in 161 ms returned [1, 2, 3, 4, 5, 13, 14, 15, 16, 17, 18, 21, 22, 23, 24, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61]
Discarding 29 places :
Implicit Place search using SMT only with invariants took 164 ms to find 29 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 170/592 places, 152/513 transitions.
Applied a total of 0 rules in 10 ms. Remains 170 /170 variables (removed 0) and now considering 152/152 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 252 ms. Remains : 170/592 places, 152/513 transitions.
Stuttering acceptance computed with spot in 33 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-19-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s86 0) (EQ s122 1)), p1:(OR (EQ s20 0) (EQ s141 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 21216 reset in 429 ms.
Product exploration explored 100000 steps with 21349 reset in 345 ms.
Computed a total of 145 stabilizing places and 132 stable transitions
Computed a total of 145 stabilizing places and 132 stable transitions
Detected a total of 145/170 stabilizing places and 132/152 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 384 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2420 resets, run finished after 298 ms. (steps per millisecond=33 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 716 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 759 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 730 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 760 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 4) seen :0
Finished probabilistic random walk after 182 steps, run visited all 4 properties in 17 ms. (steps per millisecond=10 )
Probabilistic random walk after 182 steps, saw 117 distinct states, run finished after 18 ms. (steps per millisecond=10 ) properties seen :4
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT (AND p0 p1))), (F (AND p0 (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 10 factoid took 480 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 45 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 38 ms :[(AND (NOT p0) (NOT p1))]
Support contains 4 out of 170 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 170/170 places, 152/152 transitions.
Applied a total of 0 rules in 8 ms. Remains 170 /170 variables (removed 0) and now considering 152/152 (removed 0) transitions.
// Phase 1: matrix 152 rows 170 cols
[2023-03-12 19:26:43] [INFO ] Computed 59 place invariants in 2 ms
[2023-03-12 19:26:43] [INFO ] Implicit Places using invariants in 120 ms returned []
[2023-03-12 19:26:43] [INFO ] Invariant cache hit.
[2023-03-12 19:26:43] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-12 19:26:44] [INFO ] Implicit Places using invariants and state equation in 284 ms returned [1, 3, 5, 10, 34, 35, 37, 39, 41, 43, 45, 47, 49, 51, 53, 55, 57, 59, 60, 75, 77, 81, 87, 89, 91, 93, 95, 97, 99, 101, 103, 105, 107, 109]
Discarding 34 places :
Implicit Place search using SMT with State Equation took 416 ms to find 34 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 136/170 places, 152/152 transitions.
Graph (complete) has 427 edges and 136 vertex of which 125 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.1 ms
Discarding 11 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 125 transition count 135
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 25 place count 113 transition count 135
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 37 place count 101 transition count 98
Iterating global reduction 2 with 12 rules applied. Total rules applied 49 place count 101 transition count 98
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 3 rules applied. Total rules applied 52 place count 101 transition count 95
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 55 place count 98 transition count 95
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 57 place count 96 transition count 93
Iterating global reduction 4 with 2 rules applied. Total rules applied 59 place count 96 transition count 93
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 61 place count 96 transition count 91
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 62 place count 95 transition count 91
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 6 with 15 rules applied. Total rules applied 77 place count 87 transition count 84
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 6 with 2 rules applied. Total rules applied 79 place count 86 transition count 83
Applied a total of 79 rules in 19 ms. Remains 86 /136 variables (removed 50) and now considering 83/152 (removed 69) transitions.
// Phase 1: matrix 83 rows 86 cols
[2023-03-12 19:26:44] [INFO ] Computed 20 place invariants in 1 ms
[2023-03-12 19:26:44] [INFO ] Implicit Places using invariants in 64 ms returned [5, 6]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 65 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 84/170 places, 83/152 transitions.
Applied a total of 0 rules in 5 ms. Remains 84 /84 variables (removed 0) and now considering 83/83 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 513 ms. Remains : 84/170 places, 83/152 transitions.
Computed a total of 59 stabilizing places and 63 stable transitions
Graph (complete) has 266 edges and 84 vertex of which 83 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 59 stabilizing places and 63 stable transitions
Detected a total of 59/84 stabilizing places and 63/83 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 301 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2504 resets, run finished after 151 ms. (steps per millisecond=66 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 725 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 767 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 746 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 763 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 4) seen :0
Finished probabilistic random walk after 188 steps, run visited all 4 properties in 10 ms. (steps per millisecond=18 )
Probabilistic random walk after 188 steps, saw 121 distinct states, run finished after 11 ms. (steps per millisecond=17 ) properties seen :4
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT (AND p0 p1))), (F (AND p0 (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 10 factoid took 429 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 48 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 42 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 21807 reset in 129 ms.
Product exploration explored 100000 steps with 21786 reset in 189 ms.
Support contains 4 out of 84 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 84/84 places, 83/83 transitions.
Applied a total of 0 rules in 8 ms. Remains 84 /84 variables (removed 0) and now considering 83/83 (removed 0) transitions.
// Phase 1: matrix 83 rows 84 cols
[2023-03-12 19:26:45] [INFO ] Computed 18 place invariants in 1 ms
[2023-03-12 19:26:45] [INFO ] Implicit Places using invariants in 95 ms returned []
[2023-03-12 19:26:45] [INFO ] Invariant cache hit.
[2023-03-12 19:26:46] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-12 19:26:46] [INFO ] Implicit Places using invariants and state equation in 141 ms returned [34, 37]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 240 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 82/84 places, 83/83 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 82 transition count 81
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 80 transition count 81
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 18 place count 72 transition count 75
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 20 place count 71 transition count 74
Applied a total of 20 rules in 11 ms. Remains 71 /82 variables (removed 11) and now considering 74/83 (removed 9) transitions.
// Phase 1: matrix 74 rows 71 cols
[2023-03-12 19:26:46] [INFO ] Computed 14 place invariants in 0 ms
[2023-03-12 19:26:46] [INFO ] Implicit Places using invariants in 47 ms returned [62, 65, 68]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 49 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 68/84 places, 74/83 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 66 transition count 72
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 66 transition count 72
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 64 transition count 68
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 64 transition count 68
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 10 place count 63 transition count 67
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 62 transition count 65
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 62 transition count 65
Applied a total of 12 rules in 10 ms. Remains 62 /68 variables (removed 6) and now considering 65/74 (removed 9) transitions.
// Phase 1: matrix 65 rows 62 cols
[2023-03-12 19:26:46] [INFO ] Computed 11 place invariants in 0 ms
[2023-03-12 19:26:46] [INFO ] Implicit Places using invariants in 59 ms returned [58]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 60 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 61/84 places, 65/83 transitions.
Applied a total of 0 rules in 2 ms. Remains 61 /61 variables (removed 0) and now considering 65/65 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 4 iterations and 382 ms. Remains : 61/84 places, 65/83 transitions.
Treatment of property BusinessProcesses-PT-19-LTLCardinality-09 finished in 5301 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' '!(((p0||(p1&&G(p2))) U X(G((!p2 U p0)))))'
Support contains 5 out of 592 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 592/592 places, 513/513 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 587 transition count 508
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 587 transition count 508
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 585 transition count 506
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 585 transition count 506
Applied a total of 14 rules in 51 ms. Remains 585 /592 variables (removed 7) and now considering 506/513 (removed 7) transitions.
// Phase 1: matrix 506 rows 585 cols
[2023-03-12 19:26:46] [INFO ] Computed 117 place invariants in 5 ms
[2023-03-12 19:26:46] [INFO ] Implicit Places using invariants in 343 ms returned []
[2023-03-12 19:26:46] [INFO ] Invariant cache hit.
[2023-03-12 19:26:47] [INFO ] Implicit Places using invariants and state equation in 620 ms returned []
Implicit Place search using SMT with State Equation took 964 ms to find 0 implicit places.
[2023-03-12 19:26:47] [INFO ] Invariant cache hit.
[2023-03-12 19:26:47] [INFO ] Dead Transitions using invariants and state equation in 258 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 585/592 places, 506/513 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1275 ms. Remains : 585/592 places, 506/513 transitions.
Stuttering acceptance computed with spot in 224 ms :[(NOT p0), false, (NOT p0), true, (NOT p0), (NOT p2)]
Running random walk in product with property : BusinessProcesses-PT-19-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(OR p0 (NOT p2)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 4}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 0}, { cond=(AND p0 p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 5}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p1 p2), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) p2), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 3}, { cond=p2, acceptance={} source=5 dest: 5}]], initial=2, aps=[p0:(EQ s88 1), p2:(OR (EQ s531 0) (EQ s516 1)), p1:(OR (EQ s266 0) (EQ s562 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 550 reset in 276 ms.
Stack based approach found an accepted trace after 19698 steps with 109 reset with depth 5 and stack size 5 in 56 ms.
FORMULA BusinessProcesses-PT-19-LTLCardinality-12 FALSE TECHNIQUES STACK_TEST
Treatment of property BusinessProcesses-PT-19-LTLCardinality-12 finished in 1878 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)||G(p1))))'
[2023-03-12 19:26:48] [INFO ] Flatten gal took : 30 ms
[2023-03-12 19:26:48] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-12 19:26:48] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 592 places, 513 transitions and 1629 arcs took 5 ms.
Total runtime 24771 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/919/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : BusinessProcesses-PT-19-LTLCardinality-09

BK_STOP 1678649208920

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2023
ltl formula name BusinessProcesses-PT-19-LTLCardinality-09
ltl formula formula --ltl=/tmp/919/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 592 places, 513 transitions and 1629 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.070 real 0.010 user 0.030 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/919/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/919/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/919/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/919/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:

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-19"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is BusinessProcesses-PT-19, 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 r041-tajo-167813694900595"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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