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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 6.9K Feb 25 16:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Feb 25 16:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 25 16:42 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K Feb 25 16:42 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.7K Feb 25 15:38 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 15:38 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:38 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.7K Feb 25 16:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 101K Feb 25 16:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Feb 25 16:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K Feb 25 16:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:38 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:38 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 91K 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-08-LTLCardinality-00
FORMULA_NAME BusinessProcesses-PT-08-LTLCardinality-01
FORMULA_NAME BusinessProcesses-PT-08-LTLCardinality-02
FORMULA_NAME BusinessProcesses-PT-08-LTLCardinality-03
FORMULA_NAME BusinessProcesses-PT-08-LTLCardinality-04
FORMULA_NAME BusinessProcesses-PT-08-LTLCardinality-05
FORMULA_NAME BusinessProcesses-PT-08-LTLCardinality-06
FORMULA_NAME BusinessProcesses-PT-08-LTLCardinality-07
FORMULA_NAME BusinessProcesses-PT-08-LTLCardinality-08
FORMULA_NAME BusinessProcesses-PT-08-LTLCardinality-09
FORMULA_NAME BusinessProcesses-PT-08-LTLCardinality-10
FORMULA_NAME BusinessProcesses-PT-08-LTLCardinality-11
FORMULA_NAME BusinessProcesses-PT-08-LTLCardinality-12
FORMULA_NAME BusinessProcesses-PT-08-LTLCardinality-13
FORMULA_NAME BusinessProcesses-PT-08-LTLCardinality-14
FORMULA_NAME BusinessProcesses-PT-08-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678641174265

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-08
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 17:12:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-12 17:12:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 17:12:56] [INFO ] Load time of PNML (sax parser for PT used): 58 ms
[2023-03-12 17:12:56] [INFO ] Transformed 393 places.
[2023-03-12 17:12:56] [INFO ] Transformed 344 transitions.
[2023-03-12 17:12:56] [INFO ] Found NUPN structural information;
[2023-03-12 17:12:56] [INFO ] Parsed PT model containing 393 places and 344 transitions and 911 arcs in 124 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 13 places in 5 ms
Reduce places removed 13 places and 13 transitions.
Initial state reduction rules removed 3 formulas.
FORMULA BusinessProcesses-PT-08-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-08-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-08-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-08-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-08-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-08-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-08-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 37 out of 380 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 380/380 places, 331/331 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 372 transition count 331
Discarding 59 places :
Symmetric choice reduction at 1 with 59 rule applications. Total rules 67 place count 313 transition count 272
Iterating global reduction 1 with 59 rules applied. Total rules applied 126 place count 313 transition count 272
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 127 place count 313 transition count 271
Discarding 32 places :
Symmetric choice reduction at 2 with 32 rule applications. Total rules 159 place count 281 transition count 239
Iterating global reduction 2 with 32 rules applied. Total rules applied 191 place count 281 transition count 239
Applied a total of 191 rules in 73 ms. Remains 281 /380 variables (removed 99) and now considering 239/331 (removed 92) transitions.
// Phase 1: matrix 239 rows 281 cols
[2023-03-12 17:12:56] [INFO ] Computed 50 place invariants in 13 ms
[2023-03-12 17:12:56] [INFO ] Implicit Places using invariants in 261 ms returned []
[2023-03-12 17:12:56] [INFO ] Invariant cache hit.
[2023-03-12 17:12:56] [INFO ] Implicit Places using invariants and state equation in 204 ms returned []
Implicit Place search using SMT with State Equation took 492 ms to find 0 implicit places.
[2023-03-12 17:12:56] [INFO ] Invariant cache hit.
[2023-03-12 17:12:56] [INFO ] Dead Transitions using invariants and state equation in 126 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 281/380 places, 239/331 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 695 ms. Remains : 281/380 places, 239/331 transitions.
Support contains 37 out of 281 places after structural reductions.
[2023-03-12 17:12:57] [INFO ] Flatten gal took : 39 ms
[2023-03-12 17:12:57] [INFO ] Flatten gal took : 16 ms
[2023-03-12 17:12:57] [INFO ] Input system was already deterministic with 239 transitions.
Incomplete random walk after 10000 steps, including 85 resets, run finished after 394 ms. (steps per millisecond=25 ) properties (out of 23) seen :17
Incomplete Best-First random walk after 10000 steps, including 15 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 5) seen :2
Running SMT prover for 3 properties.
[2023-03-12 17:12:57] [INFO ] Invariant cache hit.
[2023-03-12 17:12:57] [INFO ] [Real]Absence check using 50 positive place invariants in 10 ms returned sat
[2023-03-12 17:12:57] [INFO ] After 73ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2023-03-12 17:12:57] [INFO ] Deduced a trap composed of 8 places in 55 ms of which 5 ms to minimize.
[2023-03-12 17:12:58] [INFO ] Deduced a trap composed of 37 places in 62 ms of which 1 ms to minimize.
[2023-03-12 17:12:58] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2023-03-12 17:12:58] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
[2023-03-12 17:12:58] [INFO ] Deduced a trap composed of 30 places in 29 ms of which 1 ms to minimize.
[2023-03-12 17:12:58] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 307 ms
[2023-03-12 17:12:58] [INFO ] After 391ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 17:12:58] [INFO ] After 477ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 17:12:58] [INFO ] [Nat]Absence check using 50 positive place invariants in 9 ms returned sat
[2023-03-12 17:12:58] [INFO ] After 96ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 17:12:58] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2023-03-12 17:12:58] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2023-03-12 17:12:58] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 1 ms to minimize.
[2023-03-12 17:12:58] [INFO ] Deduced a trap composed of 26 places in 27 ms of which 1 ms to minimize.
[2023-03-12 17:12:58] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 1 ms to minimize.
[2023-03-12 17:12:58] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 210 ms
[2023-03-12 17:12:58] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
[2023-03-12 17:12:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 43 ms
[2023-03-12 17:12:58] [INFO ] After 380ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 24 ms.
[2023-03-12 17:12:58] [INFO ] After 482ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 2 properties in 9 ms.
Support contains 1 out of 281 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 281/281 places, 239/239 transitions.
Graph (trivial) has 150 edges and 281 vertex of which 6 / 281 are part of one of the 1 SCC in 3 ms
Free SCC test removed 5 places
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (complete) has 577 edges and 276 vertex of which 275 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 40 place count 275 transition count 192
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 1 with 38 rules applied. Total rules applied 78 place count 237 transition count 192
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 56 Pre rules applied. Total rules applied 78 place count 237 transition count 136
Deduced a syphon composed of 56 places in 0 ms
Ensure Unique test removed 11 places
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 2 with 123 rules applied. Total rules applied 201 place count 170 transition count 136
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 216 place count 155 transition count 121
Iterating global reduction 2 with 15 rules applied. Total rules applied 231 place count 155 transition count 121
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Deduced a syphon composed of 73 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 2 with 149 rules applied. Total rules applied 380 place count 79 transition count 48
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 381 place count 78 transition count 47
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 382 place count 77 transition count 47
Applied a total of 382 rules in 33 ms. Remains 77 /281 variables (removed 204) and now considering 47/239 (removed 192) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 77/281 places, 47/239 transitions.
Finished random walk after 26 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=13 )
FORMULA BusinessProcesses-PT-08-LTLCardinality-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA BusinessProcesses-PT-08-LTLCardinality-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 100 stabilizing places and 96 stable transitions
Graph (complete) has 589 edges and 281 vertex of which 280 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 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(p1)&&X(F((F(p3)&&p2)))&&p0)))'
Support contains 6 out of 281 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 281/281 places, 239/239 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 267 transition count 225
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 267 transition count 225
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 32 place count 263 transition count 221
Iterating global reduction 0 with 4 rules applied. Total rules applied 36 place count 263 transition count 221
Applied a total of 36 rules in 13 ms. Remains 263 /281 variables (removed 18) and now considering 221/239 (removed 18) transitions.
// Phase 1: matrix 221 rows 263 cols
[2023-03-12 17:12:59] [INFO ] Computed 50 place invariants in 2 ms
[2023-03-12 17:12:59] [INFO ] Implicit Places using invariants in 72 ms returned []
[2023-03-12 17:12:59] [INFO ] Invariant cache hit.
[2023-03-12 17:12:59] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 236 ms to find 0 implicit places.
[2023-03-12 17:12:59] [INFO ] Invariant cache hit.
[2023-03-12 17:12:59] [INFO ] Dead Transitions using invariants and state equation in 101 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 263/281 places, 221/239 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 351 ms. Remains : 263/281 places, 221/239 transitions.
Stuttering acceptance computed with spot in 329 ms :[(NOT p1), (OR (NOT p1) (NOT p2) (NOT p3)), (OR (NOT p1) (NOT p3)), (OR (NOT p2) (NOT p0) (NOT p3) (NOT p1)), (OR (NOT p1) (NOT p2) (NOT p3) (NOT p0)), true]
Running random walk in product with property : BusinessProcesses-PT-08-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 5}], [{ cond=(AND p1 p2 p3), acceptance={0} source=1 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 p2 (NOT p3)), acceptance={0} source=1 dest: 2}, { cond=(NOT p1), acceptance={0} source=1 dest: 5}], [{ cond=(AND p1 p3), acceptance={0} source=2 dest: 0}, { cond=(AND p1 (NOT p3)), acceptance={0} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 5}], [{ cond=(AND p0 p1), acceptance={} source=3 dest: 1}, { cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=4, aps=[p1:(AND (EQ s243 0) (EQ s39 1)), p2:(AND (EQ s57 0) (EQ s204 1)), p3:(AND (EQ s57 0) (EQ s204 1)), p0:(AND (EQ s237 0) (EQ s104 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][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA BusinessProcesses-PT-08-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-08-LTLCardinality-00 finished in 735 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(F((G(p1)||p0)))))))'
Support contains 4 out of 281 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 281/281 places, 239/239 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 267 transition count 225
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 267 transition count 225
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 33 place count 262 transition count 220
Iterating global reduction 0 with 5 rules applied. Total rules applied 38 place count 262 transition count 220
Applied a total of 38 rules in 9 ms. Remains 262 /281 variables (removed 19) and now considering 220/239 (removed 19) transitions.
// Phase 1: matrix 220 rows 262 cols
[2023-03-12 17:12:59] [INFO ] Computed 50 place invariants in 2 ms
[2023-03-12 17:12:59] [INFO ] Implicit Places using invariants in 80 ms returned []
[2023-03-12 17:12:59] [INFO ] Invariant cache hit.
[2023-03-12 17:12:59] [INFO ] Implicit Places using invariants and state equation in 168 ms returned []
Implicit Place search using SMT with State Equation took 250 ms to find 0 implicit places.
[2023-03-12 17:12:59] [INFO ] Invariant cache hit.
[2023-03-12 17:13:00] [INFO ] Dead Transitions using invariants and state equation in 97 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 262/281 places, 220/239 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 357 ms. Remains : 262/281 places, 220/239 transitions.
Stuttering acceptance computed with spot in 136 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-08-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p1:(OR (EQ s235 0) (EQ s134 1)), p0:(OR (EQ s102 0) (EQ s67 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 20000 reset in 238 ms.
Product exploration explored 100000 steps with 20000 reset in 164 ms.
Computed a total of 92 stabilizing places and 88 stable transitions
Graph (complete) has 558 edges and 262 vertex of which 261 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Computed a total of 92 stabilizing places and 88 stable transitions
Knowledge obtained : [(AND p1 p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 86 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 147 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 84 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-12 17:13:00] [INFO ] Invariant cache hit.
[2023-03-12 17:13:00] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 17:13:01] [INFO ] [Nat]Absence check using 50 positive place invariants in 9 ms returned sat
[2023-03-12 17:13:01] [INFO ] After 103ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), true, (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) p1))]
Property proved to be true thanks to knowledge :(G (NOT (AND (NOT p0) (NOT p1))))
Knowledge based reduction with 3 factoid took 84 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-08-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-08-LTLCardinality-03 finished in 1455 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(((p0||(p1&&X(!p2))) U (G((p0||(p1&&X(!p2))))||(X(!p2)&&p3)))))'
Support contains 4 out of 281 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 281/281 places, 239/239 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 267 transition count 225
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 267 transition count 225
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 31 place count 264 transition count 222
Iterating global reduction 0 with 3 rules applied. Total rules applied 34 place count 264 transition count 222
Applied a total of 34 rules in 9 ms. Remains 264 /281 variables (removed 17) and now considering 222/239 (removed 17) transitions.
// Phase 1: matrix 222 rows 264 cols
[2023-03-12 17:13:01] [INFO ] Computed 50 place invariants in 5 ms
[2023-03-12 17:13:01] [INFO ] Implicit Places using invariants in 104 ms returned []
[2023-03-12 17:13:01] [INFO ] Invariant cache hit.
[2023-03-12 17:13:01] [INFO ] Implicit Places using invariants and state equation in 180 ms returned []
Implicit Place search using SMT with State Equation took 286 ms to find 0 implicit places.
[2023-03-12 17:13:01] [INFO ] Invariant cache hit.
[2023-03-12 17:13:01] [INFO ] Dead Transitions using invariants and state equation in 105 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 264/281 places, 222/239 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 401 ms. Remains : 264/281 places, 222/239 transitions.
Stuttering acceptance computed with spot in 154 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) p2)), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) p2)), true, p2, (AND (NOT p0) p2)]
Running random walk in product with property : BusinessProcesses-PT-08-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (AND (NOT p3) p0) (AND (NOT p3) p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p3) (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(OR (AND p3 (NOT p0)) (AND (NOT p0) p1)), acceptance={} source=1 dest: 3}, { cond=(AND p3 p0), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p2, acceptance={} source=3 dest: 2}], [{ cond=(OR (AND (NOT p3) p0 p2) (AND (NOT p3) p1 p2)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p3) (NOT p0) (NOT p1) p2), acceptance={} source=4 dest: 2}, { cond=(OR (AND p3 (NOT p0) p2) (AND (NOT p0) p1 p2)), acceptance={} source=4 dest: 3}, { cond=(AND p3 p0 p2), acceptance={} source=4 dest: 4}]], initial=0, aps=[p3:(AND (EQ s221 1) (NEQ s58 1)), p0:(NEQ s221 1), p1:(NEQ s58 1), p2:(OR (EQ s259 0) (EQ s6 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 96 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-08-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-08-LTLCardinality-09 finished in 573 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(((!p0 U (p0&&G(p1))) U G(p2))))'
Support contains 6 out of 281 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 281/281 places, 239/239 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 266 transition count 224
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 266 transition count 224
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 35 place count 261 transition count 219
Iterating global reduction 0 with 5 rules applied. Total rules applied 40 place count 261 transition count 219
Applied a total of 40 rules in 9 ms. Remains 261 /281 variables (removed 20) and now considering 219/239 (removed 20) transitions.
// Phase 1: matrix 219 rows 261 cols
[2023-03-12 17:13:01] [INFO ] Computed 50 place invariants in 2 ms
[2023-03-12 17:13:01] [INFO ] Implicit Places using invariants in 75 ms returned []
[2023-03-12 17:13:01] [INFO ] Invariant cache hit.
[2023-03-12 17:13:02] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 253 ms to find 0 implicit places.
[2023-03-12 17:13:02] [INFO ] Invariant cache hit.
[2023-03-12 17:13:02] [INFO ] Dead Transitions using invariants and state equation in 105 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 261/281 places, 219/239 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 369 ms. Remains : 261/281 places, 219/239 transitions.
Stuttering acceptance computed with spot in 201 ms :[(NOT p2), (NOT p2), true, (NOT p1), (OR (NOT p0) (NOT p1)), (NOT p2), (AND (NOT p1) (NOT p2) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-08-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (AND p2 (NOT p0)) (AND p2 p1)), acceptance={} source=1 dest: 1}, { cond=(OR (AND (NOT p2) (NOT p0)) (AND (NOT p2) p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) p0 p1), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 4}, { cond=(AND p2 p0 (NOT p1)), acceptance={} source=1 dest: 5}, { cond=(AND p2 p0 p1), acceptance={} source=1 dest: 6}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(AND p0 p1), acceptance={} source=4 dest: 3}, { cond=(NOT p0), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 2}, { cond=p2, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=6 dest: 2}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=6 dest: 3}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={} source=6 dest: 5}, { cond=(AND p2 (NOT p0) p1), acceptance={} source=6 dest: 6}]], initial=0, aps=[p2:(OR (EQ s4 0) (EQ s181 1)), p0:(OR (EQ s178 0) (EQ s24 1)), p1:(OR (EQ s258 0) (EQ s195 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 602 steps with 96 reset in 3 ms.
FORMULA BusinessProcesses-PT-08-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-08-LTLCardinality-10 finished in 592 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||G(F(p1))))'
Support contains 4 out of 281 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 281/281 places, 239/239 transitions.
Graph (trivial) has 149 edges and 281 vertex of which 6 / 281 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 582 edges and 276 vertex of which 275 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 41 place count 274 transition count 192
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 1 with 39 rules applied. Total rules applied 80 place count 235 transition count 192
Performed 55 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 55 Pre rules applied. Total rules applied 80 place count 235 transition count 137
Deduced a syphon composed of 55 places in 0 ms
Ensure Unique test removed 11 places
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 2 with 121 rules applied. Total rules applied 201 place count 169 transition count 137
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 215 place count 155 transition count 123
Iterating global reduction 2 with 14 rules applied. Total rules applied 229 place count 155 transition count 123
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: 71
Deduced a syphon composed of 71 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 2 with 145 rules applied. Total rules applied 374 place count 81 transition count 52
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 375 place count 80 transition count 51
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 376 place count 79 transition count 51
Applied a total of 376 rules in 26 ms. Remains 79 /281 variables (removed 202) and now considering 51/239 (removed 188) transitions.
// Phase 1: matrix 51 rows 79 cols
[2023-03-12 17:13:02] [INFO ] Computed 35 place invariants in 1 ms
[2023-03-12 17:13:02] [INFO ] Implicit Places using invariants in 48 ms returned []
[2023-03-12 17:13:02] [INFO ] Invariant cache hit.
[2023-03-12 17:13:02] [INFO ] Implicit Places using invariants and state equation in 77 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 59, 61]
Discarding 16 places :
Implicit Place search using SMT with State Equation took 128 ms to find 16 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 63/281 places, 51/239 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 63 transition count 50
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 62 transition count 50
Applied a total of 2 rules in 5 ms. Remains 62 /63 variables (removed 1) and now considering 50/51 (removed 1) transitions.
// Phase 1: matrix 50 rows 62 cols
[2023-03-12 17:13:02] [INFO ] Computed 19 place invariants in 1 ms
[2023-03-12 17:13:02] [INFO ] Implicit Places using invariants in 39 ms returned []
[2023-03-12 17:13:02] [INFO ] Invariant cache hit.
[2023-03-12 17:13:02] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 62/281 places, 50/239 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 254 ms. Remains : 62/281 places, 50/239 transitions.
Stuttering acceptance computed with spot in 87 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-08-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s53 0) (EQ s23 1)), p1:(AND (EQ s42 0) (EQ s29 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 894 steps with 145 reset in 4 ms.
FORMULA BusinessProcesses-PT-08-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-08-LTLCardinality-11 finished in 357 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 281 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 281/281 places, 239/239 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 264 transition count 222
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 264 transition count 222
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 39 place count 259 transition count 217
Iterating global reduction 0 with 5 rules applied. Total rules applied 44 place count 259 transition count 217
Applied a total of 44 rules in 11 ms. Remains 259 /281 variables (removed 22) and now considering 217/239 (removed 22) transitions.
// Phase 1: matrix 217 rows 259 cols
[2023-03-12 17:13:02] [INFO ] Computed 50 place invariants in 2 ms
[2023-03-12 17:13:02] [INFO ] Implicit Places using invariants in 69 ms returned []
[2023-03-12 17:13:02] [INFO ] Invariant cache hit.
[2023-03-12 17:13:02] [INFO ] Implicit Places using invariants and state equation in 182 ms returned []
Implicit Place search using SMT with State Equation took 253 ms to find 0 implicit places.
[2023-03-12 17:13:02] [INFO ] Invariant cache hit.
[2023-03-12 17:13:03] [INFO ] Dead Transitions using invariants and state equation in 107 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 259/281 places, 217/239 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 373 ms. Remains : 259/281 places, 217/239 transitions.
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-08-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s115 0) (EQ s204 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 179 ms.
Product exploration explored 100000 steps with 50000 reset in 180 ms.
Computed a total of 90 stabilizing places and 86 stable transitions
Graph (complete) has 551 edges and 259 vertex of which 258 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 90 stabilizing places and 86 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 59 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-08-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-08-LTLCardinality-12 finished in 866 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(p1)&&p0)))'
Support contains 3 out of 281 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 281/281 places, 239/239 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 265 transition count 223
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 265 transition count 223
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 36 place count 261 transition count 219
Iterating global reduction 0 with 4 rules applied. Total rules applied 40 place count 261 transition count 219
Applied a total of 40 rules in 14 ms. Remains 261 /281 variables (removed 20) and now considering 219/239 (removed 20) transitions.
// Phase 1: matrix 219 rows 261 cols
[2023-03-12 17:13:03] [INFO ] Computed 50 place invariants in 2 ms
[2023-03-12 17:13:03] [INFO ] Implicit Places using invariants in 79 ms returned []
[2023-03-12 17:13:03] [INFO ] Invariant cache hit.
[2023-03-12 17:13:03] [INFO ] Implicit Places using invariants and state equation in 174 ms returned []
Implicit Place search using SMT with State Equation took 257 ms to find 0 implicit places.
[2023-03-12 17:13:03] [INFO ] Invariant cache hit.
[2023-03-12 17:13:03] [INFO ] Dead Transitions using invariants and state equation in 110 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 261/281 places, 219/239 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 384 ms. Remains : 261/281 places, 219/239 transitions.
Stuttering acceptance computed with spot in 129 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : BusinessProcesses-PT-08-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(EQ s125 0), p0:(AND (EQ s138 0) (EQ s89 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-08-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-08-LTLCardinality-13 finished in 525 ms.
All properties solved by simple procedures.
Total runtime 8177 ms.
ITS solved all properties within timeout

BK_STOP 1678641184260

--------------------
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

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-08"
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-08, 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-167813694800507"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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