Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r024-tall-165251918400347.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is BusinessProcesses-PT-04, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r024-tall-165251918400347
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 300K
-rw-r--r-- 1 mcc users 6.9K Apr 30 00:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Apr 30 00:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Apr 30 00:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Apr 30 00:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K May 9 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 07:09 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 07:09 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 07:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:09 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 79K May 10 09:33 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME BusinessProcesses-PT-04-LTLCardinality-00
FORMULA_NAME BusinessProcesses-PT-04-LTLCardinality-01
FORMULA_NAME BusinessProcesses-PT-04-LTLCardinality-02
FORMULA_NAME BusinessProcesses-PT-04-LTLCardinality-03
FORMULA_NAME BusinessProcesses-PT-04-LTLCardinality-04
FORMULA_NAME BusinessProcesses-PT-04-LTLCardinality-05
FORMULA_NAME BusinessProcesses-PT-04-LTLCardinality-06
FORMULA_NAME BusinessProcesses-PT-04-LTLCardinality-07
FORMULA_NAME BusinessProcesses-PT-04-LTLCardinality-08
FORMULA_NAME BusinessProcesses-PT-04-LTLCardinality-09
FORMULA_NAME BusinessProcesses-PT-04-LTLCardinality-10
FORMULA_NAME BusinessProcesses-PT-04-LTLCardinality-11
FORMULA_NAME BusinessProcesses-PT-04-LTLCardinality-12
FORMULA_NAME BusinessProcesses-PT-04-LTLCardinality-13
FORMULA_NAME BusinessProcesses-PT-04-LTLCardinality-14
FORMULA_NAME BusinessProcesses-PT-04-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1652623355731

Running Version 202205111006
[2022-05-15 14:02:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-15 14:02:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 14:02:37] [INFO ] Load time of PNML (sax parser for PT used): 89 ms
[2022-05-15 14:02:37] [INFO ] Transformed 288 places.
[2022-05-15 14:02:37] [INFO ] Transformed 283 transitions.
[2022-05-15 14:02:37] [INFO ] Found NUPN structural information;
[2022-05-15 14:02:37] [INFO ] Parsed PT model containing 288 places and 283 transitions in 196 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 2 transitions.
FORMULA BusinessProcesses-PT-04-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-04-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-04-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-04-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-04-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-04-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-04-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-04-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 19 out of 286 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 286/286 places, 281/281 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 283 transition count 281
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 45 place count 241 transition count 239
Iterating global reduction 1 with 42 rules applied. Total rules applied 87 place count 241 transition count 239
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 88 place count 241 transition count 238
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 108 place count 221 transition count 218
Iterating global reduction 2 with 20 rules applied. Total rules applied 128 place count 221 transition count 218
Applied a total of 128 rules in 54 ms. Remains 221 /286 variables (removed 65) and now considering 218/281 (removed 63) transitions.
// Phase 1: matrix 218 rows 221 cols
[2022-05-15 14:02:37] [INFO ] Computed 41 place invariants in 28 ms
[2022-05-15 14:02:37] [INFO ] Implicit Places using invariants in 278 ms returned []
// Phase 1: matrix 218 rows 221 cols
[2022-05-15 14:02:37] [INFO ] Computed 41 place invariants in 6 ms
[2022-05-15 14:02:37] [INFO ] Implicit Places using invariants and state equation in 253 ms returned []
Implicit Place search using SMT with State Equation took 563 ms to find 0 implicit places.
// Phase 1: matrix 218 rows 221 cols
[2022-05-15 14:02:37] [INFO ] Computed 41 place invariants in 9 ms
[2022-05-15 14:02:38] [INFO ] Dead Transitions using invariants and state equation in 172 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 221/286 places, 218/281 transitions.
Finished structural reductions, in 1 iterations. Remains : 221/286 places, 218/281 transitions.
Support contains 19 out of 221 places after structural reductions.
[2022-05-15 14:02:38] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2022-05-15 14:02:38] [INFO ] Flatten gal took : 61 ms
FORMULA BusinessProcesses-PT-04-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-15 14:02:38] [INFO ] Flatten gal took : 46 ms
[2022-05-15 14:02:38] [INFO ] Input system was already deterministic with 218 transitions.
Finished random walk after 2790 steps, including 24 resets, run visited all 9 properties in 117 ms. (steps per millisecond=23 )
FORMULA BusinessProcesses-PT-04-LTLCardinality-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA BusinessProcesses-PT-04-LTLCardinality-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 198 stabilizing places and 196 stable transitions
Graph (complete) has 558 edges and 221 vertex of which 220 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.11 ms
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0))&&F(X(F(G(p0))))))'
Support contains 2 out of 221 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 221/221 places, 218/218 transitions.
Graph (trivial) has 93 edges and 221 vertex of which 6 / 221 are part of one of the 1 SCC in 5 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 551 edges and 216 vertex of which 215 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 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 18 place count 214 transition count 194
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 34 place count 198 transition count 194
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 48 Pre rules applied. Total rules applied 34 place count 198 transition count 146
Deduced a syphon composed of 48 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 136 place count 144 transition count 146
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 137 place count 143 transition count 145
Iterating global reduction 2 with 1 rules applied. Total rules applied 138 place count 143 transition count 145
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 138 place count 143 transition count 144
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 140 place count 142 transition count 144
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 45
Deduced a syphon composed of 45 places in 1 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 2 with 90 rules applied. Total rules applied 230 place count 97 transition count 99
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 232 place count 96 transition count 102
Partial Post-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 238 place count 96 transition count 102
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 239 place count 95 transition count 101
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 240 place count 94 transition count 101
Applied a total of 240 rules in 95 ms. Remains 94 /221 variables (removed 127) and now considering 101/218 (removed 117) transitions.
// Phase 1: matrix 101 rows 94 cols
[2022-05-15 14:02:38] [INFO ] Computed 34 place invariants in 1 ms
[2022-05-15 14:02:38] [INFO ] Implicit Places using invariants in 104 ms returned [36]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 108 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 93/221 places, 101/218 transitions.
Applied a total of 0 rules in 5 ms. Remains 93 /93 variables (removed 0) and now considering 101/101 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 93/221 places, 101/218 transitions.
Stuttering acceptance computed with spot in 137 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-04-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s63 0) (EQ s1 1))], nbAcceptance=1, 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 10360 reset in 264 ms.
Product exploration explored 100000 steps with 10198 reset in 210 ms.
Computed a total of 86 stabilizing places and 94 stable transitions
Computed a total of 86 stabilizing places and 94 stable transitions
Detected a total of 86/93 stabilizing places and 94/101 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 151 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Finished random walk after 727 steps, including 96 resets, run visited all 1 properties in 8 ms. (steps per millisecond=90 )
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 152 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Support contains 2 out of 93 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 93/93 places, 101/101 transitions.
Applied a total of 0 rules in 10 ms. Remains 93 /93 variables (removed 0) and now considering 101/101 (removed 0) transitions.
// Phase 1: matrix 101 rows 93 cols
[2022-05-15 14:02:39] [INFO ] Computed 33 place invariants in 2 ms
[2022-05-15 14:02:40] [INFO ] Implicit Places using invariants in 107 ms returned []
// Phase 1: matrix 101 rows 93 cols
[2022-05-15 14:02:40] [INFO ] Computed 33 place invariants in 2 ms
[2022-05-15 14:02:40] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-15 14:02:40] [INFO ] Implicit Places using invariants and state equation in 151 ms returned [37, 38, 47, 49, 55]
Discarding 5 places :
Implicit Place search using SMT with State Equation took 261 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 88/93 places, 101/101 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 87 transition count 99
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 87 transition count 99
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 10 place count 83 transition count 95
Applied a total of 10 rules in 11 ms. Remains 83 /88 variables (removed 5) and now considering 95/101 (removed 6) transitions.
// Phase 1: matrix 95 rows 83 cols
[2022-05-15 14:02:40] [INFO ] Computed 30 place invariants in 1 ms
[2022-05-15 14:02:40] [INFO ] Implicit Places using invariants in 60 ms returned []
// Phase 1: matrix 95 rows 83 cols
[2022-05-15 14:02:40] [INFO ] Computed 30 place invariants in 1 ms
[2022-05-15 14:02:40] [INFO ] State equation strengthened by 6 read => feed constraints.
[2022-05-15 14:02:40] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 192 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 83/93 places, 95/101 transitions.
Finished structural reductions, in 2 iterations. Remains : 83/93 places, 95/101 transitions.
Computed a total of 76 stabilizing places and 88 stable transitions
Computed a total of 76 stabilizing places and 88 stable transitions
Detected a total of 76/83 stabilizing places and 88/95 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 145 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Finished random walk after 124 steps, including 14 resets, run visited all 1 properties in 2 ms. (steps per millisecond=62 )
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 194 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Product exploration explored 100000 steps with 10602 reset in 203 ms.
Product exploration explored 100000 steps with 10699 reset in 161 ms.
Built C files in :
/tmp/ltsmin7032455728435212243
[2022-05-15 14:02:41] [INFO ] Computing symmetric may disable matrix : 95 transitions.
[2022-05-15 14:02:41] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 14:02:41] [INFO ] Computing symmetric may enable matrix : 95 transitions.
[2022-05-15 14:02:41] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 14:02:41] [INFO ] Computing Do-Not-Accords matrix : 95 transitions.
[2022-05-15 14:02:41] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 14:02:41] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7032455728435212243
Running compilation step : cd /tmp/ltsmin7032455728435212243;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 350 ms.
Running link step : cd /tmp/ltsmin7032455728435212243;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin7032455728435212243;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6066520487258948499.hoa' '--buchi-type=spotba'
LTSmin run took 194 ms.
FORMULA BusinessProcesses-PT-04-LTLCardinality-04 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property BusinessProcesses-PT-04-LTLCardinality-04 finished in 3345 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(X(X(F(G(p0)))))))'
Support contains 2 out of 221 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 221/221 places, 218/218 transitions.
Graph (trivial) has 93 edges and 221 vertex of which 6 / 221 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 551 edges and 216 vertex of which 215 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 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 18 place count 214 transition count 194
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 34 place count 198 transition count 194
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 48 Pre rules applied. Total rules applied 34 place count 198 transition count 146
Deduced a syphon composed of 48 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 136 place count 144 transition count 146
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 137 place count 143 transition count 145
Iterating global reduction 2 with 1 rules applied. Total rules applied 138 place count 143 transition count 145
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 138 place count 143 transition count 144
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 140 place count 142 transition count 144
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 2 with 94 rules applied. Total rules applied 234 place count 95 transition count 97
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 236 place count 94 transition count 100
Partial Post-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 242 place count 94 transition count 100
Applied a total of 242 rules in 32 ms. Remains 94 /221 variables (removed 127) and now considering 100/218 (removed 118) transitions.
// Phase 1: matrix 100 rows 94 cols
[2022-05-15 14:02:42] [INFO ] Computed 35 place invariants in 1 ms
[2022-05-15 14:02:42] [INFO ] Implicit Places using invariants in 111 ms returned [1, 11, 35, 36, 37]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 112 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 89/221 places, 100/218 transitions.
Applied a total of 0 rules in 5 ms. Remains 89 /89 variables (removed 0) and now considering 100/100 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 89/221 places, 100/218 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-04-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s13 0) (EQ s31 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-04-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-04-LTLCardinality-05 finished in 239 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 221 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 221/221 places, 218/218 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 219 transition count 216
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 219 transition count 216
Applied a total of 4 rules in 8 ms. Remains 219 /221 variables (removed 2) and now considering 216/218 (removed 2) transitions.
// Phase 1: matrix 216 rows 219 cols
[2022-05-15 14:02:42] [INFO ] Computed 41 place invariants in 2 ms
[2022-05-15 14:02:42] [INFO ] Implicit Places using invariants in 86 ms returned []
// Phase 1: matrix 216 rows 219 cols
[2022-05-15 14:02:42] [INFO ] Computed 41 place invariants in 8 ms
[2022-05-15 14:02:42] [INFO ] Implicit Places using invariants and state equation in 258 ms returned []
Implicit Place search using SMT with State Equation took 348 ms to find 0 implicit places.
// Phase 1: matrix 216 rows 219 cols
[2022-05-15 14:02:42] [INFO ] Computed 41 place invariants in 3 ms
[2022-05-15 14:02:42] [INFO ] Dead Transitions using invariants and state equation in 136 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 219/221 places, 216/218 transitions.
Finished structural reductions, in 1 iterations. Remains : 219/221 places, 216/218 transitions.
Stuttering acceptance computed with spot in 110 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-04-LTLCardinality-08 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 s147 0) (EQ s55 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 282 ms.
Product exploration explored 100000 steps with 50000 reset in 226 ms.
Computed a total of 196 stabilizing places and 194 stable transitions
Graph (complete) has 556 edges and 219 vertex of which 218 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 196 stabilizing places and 194 stable transitions
Detected a total of 196/219 stabilizing places and 194/216 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 4 factoid took 69 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA BusinessProcesses-PT-04-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-04-LTLCardinality-08 finished in 1203 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U (F(X(p0))&&p1)) U p0))'
Support contains 3 out of 221 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 221/221 places, 218/218 transitions.
Graph (trivial) has 91 edges and 221 vertex of which 6 / 221 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 551 edges and 216 vertex of which 215 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 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 17 place count 214 transition count 195
Reduce places removed 15 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 16 rules applied. Total rules applied 33 place count 199 transition count 194
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 34 place count 198 transition count 194
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 47 Pre rules applied. Total rules applied 34 place count 198 transition count 147
Deduced a syphon composed of 47 places in 1 ms
Ensure Unique test removed 5 places
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 3 with 99 rules applied. Total rules applied 133 place count 146 transition count 147
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 3 with 98 rules applied. Total rules applied 231 place count 97 transition count 98
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 233 place count 96 transition count 101
Applied a total of 233 rules in 26 ms. Remains 96 /221 variables (removed 125) and now considering 101/218 (removed 117) transitions.
// Phase 1: matrix 101 rows 96 cols
[2022-05-15 14:02:43] [INFO ] Computed 36 place invariants in 1 ms
[2022-05-15 14:02:43] [INFO ] Implicit Places using invariants in 61 ms returned [1, 11, 36, 37, 38, 66]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 63 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 90/221 places, 101/218 transitions.
Applied a total of 0 rules in 3 ms. Remains 90 /90 variables (removed 0) and now considering 101/101 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 90/221 places, 101/218 transitions.
Stuttering acceptance computed with spot in 85 ms :[true, (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-04-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p0:(EQ s11 1), p1:(OR (EQ s84 0) (EQ s39 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-04-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-04-LTLCardinality-09 finished in 193 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 4 out of 221 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 221/221 places, 218/218 transitions.
Graph (trivial) has 90 edges and 221 vertex of which 6 / 221 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 551 edges and 216 vertex of which 215 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 16 place count 214 transition count 196
Reduce places removed 14 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 200 transition count 194
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 34 place count 198 transition count 194
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 45 Pre rules applied. Total rules applied 34 place count 198 transition count 149
Deduced a syphon composed of 45 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 3 with 95 rules applied. Total rules applied 129 place count 148 transition count 149
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 130 place count 147 transition count 148
Iterating global reduction 3 with 1 rules applied. Total rules applied 131 place count 147 transition count 148
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 131 place count 147 transition count 147
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 133 place count 146 transition count 147
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 229 place count 98 transition count 99
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 231 place count 97 transition count 102
Applied a total of 231 rules in 23 ms. Remains 97 /221 variables (removed 124) and now considering 102/218 (removed 116) transitions.
// Phase 1: matrix 102 rows 97 cols
[2022-05-15 14:02:43] [INFO ] Computed 36 place invariants in 1 ms
[2022-05-15 14:02:43] [INFO ] Implicit Places using invariants in 60 ms returned [1, 11, 37, 40, 73]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 62 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 92/221 places, 102/218 transitions.
Applied a total of 0 rules in 4 ms. Remains 92 /92 variables (removed 0) and now considering 102/102 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 92/221 places, 102/218 transitions.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-04-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (NEQ s34 0) (NEQ s36 1)) (AND (NEQ s25 0) (NEQ s82 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-04-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-04-LTLCardinality-10 finished in 127 ms.
All properties solved by simple procedures.
Total runtime 6815 ms.

BK_STOP 1652623363831

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BusinessProcesses-PT-04"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is BusinessProcesses-PT-04, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r024-tall-165251918400347"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-04.tgz
mv BusinessProcesses-PT-04 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;