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-165251918500419.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-13, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r024-tall-165251918500419
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 376K
-rw-r--r-- 1 mcc users 6.3K Apr 29 23:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Apr 29 23:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Apr 29 23:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 29 23:57 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.6K May 9 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 9 07:10 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 07:10 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 07:10 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 07:10 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 148K 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-13-LTLCardinality-00
FORMULA_NAME BusinessProcesses-PT-13-LTLCardinality-01
FORMULA_NAME BusinessProcesses-PT-13-LTLCardinality-02
FORMULA_NAME BusinessProcesses-PT-13-LTLCardinality-03
FORMULA_NAME BusinessProcesses-PT-13-LTLCardinality-04
FORMULA_NAME BusinessProcesses-PT-13-LTLCardinality-05
FORMULA_NAME BusinessProcesses-PT-13-LTLCardinality-06
FORMULA_NAME BusinessProcesses-PT-13-LTLCardinality-07
FORMULA_NAME BusinessProcesses-PT-13-LTLCardinality-08
FORMULA_NAME BusinessProcesses-PT-13-LTLCardinality-09
FORMULA_NAME BusinessProcesses-PT-13-LTLCardinality-10
FORMULA_NAME BusinessProcesses-PT-13-LTLCardinality-11
FORMULA_NAME BusinessProcesses-PT-13-LTLCardinality-12
FORMULA_NAME BusinessProcesses-PT-13-LTLCardinality-13
FORMULA_NAME BusinessProcesses-PT-13-LTLCardinality-14
FORMULA_NAME BusinessProcesses-PT-13-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1652630852764

Running Version 202205111006
[2022-05-15 16:07:33] [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 16:07:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 16:07:34] [INFO ] Load time of PNML (sax parser for PT used): 103 ms
[2022-05-15 16:07:34] [INFO ] Transformed 593 places.
[2022-05-15 16:07:34] [INFO ] Transformed 536 transitions.
[2022-05-15 16:07:34] [INFO ] Found NUPN structural information;
[2022-05-15 16:07:34] [INFO ] Parsed PT model containing 593 places and 536 transitions in 205 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 4 formulas.
Deduced a syphon composed of 8 places in 10 ms
Reduce places removed 8 places and 8 transitions.
FORMULA BusinessProcesses-PT-13-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-13-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-13-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-13-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-13-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-13-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-13-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 25 out of 585 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 585/585 places, 528/528 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 580 transition count 528
Discarding 83 places :
Symmetric choice reduction at 1 with 83 rule applications. Total rules 88 place count 497 transition count 445
Iterating global reduction 1 with 83 rules applied. Total rules applied 171 place count 497 transition count 445
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 213 place count 455 transition count 403
Iterating global reduction 1 with 42 rules applied. Total rules applied 255 place count 455 transition count 403
Applied a total of 255 rules in 101 ms. Remains 455 /585 variables (removed 130) and now considering 403/528 (removed 125) transitions.
// Phase 1: matrix 403 rows 455 cols
[2022-05-15 16:07:34] [INFO ] Computed 90 place invariants in 28 ms
[2022-05-15 16:07:34] [INFO ] Implicit Places using invariants in 308 ms returned []
// Phase 1: matrix 403 rows 455 cols
[2022-05-15 16:07:34] [INFO ] Computed 90 place invariants in 9 ms
[2022-05-15 16:07:35] [INFO ] Implicit Places using invariants and state equation in 509 ms returned []
Implicit Place search using SMT with State Equation took 842 ms to find 0 implicit places.
// Phase 1: matrix 403 rows 455 cols
[2022-05-15 16:07:35] [INFO ] Computed 90 place invariants in 5 ms
[2022-05-15 16:07:35] [INFO ] Dead Transitions using invariants and state equation in 199 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 455/585 places, 403/528 transitions.
Finished structural reductions, in 1 iterations. Remains : 455/585 places, 403/528 transitions.
Support contains 25 out of 455 places after structural reductions.
[2022-05-15 16:07:35] [INFO ] Flatten gal took : 66 ms
[2022-05-15 16:07:35] [INFO ] Flatten gal took : 35 ms
[2022-05-15 16:07:35] [INFO ] Input system was already deterministic with 403 transitions.
Incomplete random walk after 10000 steps, including 71 resets, run finished after 409 ms. (steps per millisecond=24 ) properties (out of 13) seen :7
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 6) seen :1
Running SMT prover for 5 properties.
// Phase 1: matrix 403 rows 455 cols
[2022-05-15 16:07:36] [INFO ] Computed 90 place invariants in 4 ms
[2022-05-15 16:07:36] [INFO ] After 113ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-05-15 16:07:37] [INFO ] [Nat]Absence check using 52 positive place invariants in 17 ms returned sat
[2022-05-15 16:07:37] [INFO ] [Nat]Absence check using 52 positive and 38 generalized place invariants in 11 ms returned sat
[2022-05-15 16:07:37] [INFO ] After 238ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2022-05-15 16:07:37] [INFO ] Deduced a trap composed of 8 places in 58 ms of which 4 ms to minimize.
[2022-05-15 16:07:37] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 1 ms to minimize.
[2022-05-15 16:07:37] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
[2022-05-15 16:07:37] [INFO ] Deduced a trap composed of 21 places in 73 ms of which 1 ms to minimize.
[2022-05-15 16:07:37] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 334 ms
[2022-05-15 16:07:38] [INFO ] Deduced a trap composed of 77 places in 105 ms of which 1 ms to minimize.
[2022-05-15 16:07:38] [INFO ] Deduced a trap composed of 79 places in 91 ms of which 1 ms to minimize.
[2022-05-15 16:07:38] [INFO ] Deduced a trap composed of 83 places in 95 ms of which 1 ms to minimize.
[2022-05-15 16:07:38] [INFO ] Deduced a trap composed of 80 places in 93 ms of which 1 ms to minimize.
[2022-05-15 16:07:38] [INFO ] Deduced a trap composed of 86 places in 92 ms of which 0 ms to minimize.
[2022-05-15 16:07:38] [INFO ] Deduced a trap composed of 84 places in 86 ms of which 1 ms to minimize.
[2022-05-15 16:07:38] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 702 ms
[2022-05-15 16:07:38] [INFO ] After 1428ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 137 ms.
[2022-05-15 16:07:38] [INFO ] After 2378ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 64 ms.
Support contains 10 out of 455 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 455/455 places, 403/403 transitions.
Graph (trivial) has 202 edges and 455 vertex of which 6 / 455 are part of one of the 1 SCC in 3 ms
Free SCC test removed 5 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1028 edges and 450 vertex of which 449 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 48 place count 449 transition count 349
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 1 with 46 rules applied. Total rules applied 94 place count 403 transition count 349
Performed 91 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 91 Pre rules applied. Total rules applied 94 place count 403 transition count 258
Deduced a syphon composed of 91 places in 0 ms
Ensure Unique test removed 16 places
Reduce places removed 107 places and 0 transitions.
Iterating global reduction 2 with 198 rules applied. Total rules applied 292 place count 296 transition count 258
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 295 place count 293 transition count 255
Iterating global reduction 2 with 3 rules applied. Total rules applied 298 place count 293 transition count 255
Performed 115 Post agglomeration using F-continuation condition.Transition count delta: 115
Deduced a syphon composed of 115 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 117 places and 0 transitions.
Iterating global reduction 2 with 232 rules applied. Total rules applied 530 place count 176 transition count 140
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
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 532 place count 175 transition count 144
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 534 place count 175 transition count 142
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 536 place count 173 transition count 142
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 537 place count 173 transition count 142
Applied a total of 537 rules in 83 ms. Remains 173 /455 variables (removed 282) and now considering 142/403 (removed 261) transitions.
Finished structural reductions, in 1 iterations. Remains : 173/455 places, 142/403 transitions.
Finished random walk after 2270 steps, including 94 resets, run visited all 5 properties in 31 ms. (steps per millisecond=73 )
Computed a total of 124 stabilizing places and 117 stable transitions
Graph (complete) has 1035 edges and 455 vertex of which 454 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.18 ms
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(F(p0))))'
Support contains 2 out of 455 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 455/455 places, 403/403 transitions.
Graph (trivial) has 212 edges and 455 vertex of which 6 / 455 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1029 edges and 450 vertex of which 449 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 52 place count 449 transition count 346
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 1 with 50 rules applied. Total rules applied 102 place count 399 transition count 346
Performed 94 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 94 Pre rules applied. Total rules applied 102 place count 399 transition count 252
Deduced a syphon composed of 94 places in 1 ms
Ensure Unique test removed 17 places
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 2 with 205 rules applied. Total rules applied 307 place count 288 transition count 252
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 313 place count 282 transition count 246
Iterating global reduction 2 with 6 rules applied. Total rules applied 319 place count 282 transition count 246
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 319 place count 282 transition count 245
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 321 place count 281 transition count 245
Performed 117 Post agglomeration using F-continuation condition.Transition count delta: 117
Deduced a syphon composed of 117 places in 1 ms
Ensure Unique test removed 4 places
Reduce places removed 121 places and 0 transitions.
Iterating global reduction 2 with 238 rules applied. Total rules applied 559 place count 160 transition count 128
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 561 place count 159 transition count 132
Applied a total of 561 rules in 57 ms. Remains 159 /455 variables (removed 296) and now considering 132/403 (removed 271) transitions.
// Phase 1: matrix 132 rows 159 cols
[2022-05-15 16:07:39] [INFO ] Computed 69 place invariants in 2 ms
[2022-05-15 16:07:39] [INFO ] Implicit Places using invariants in 106 ms returned [2, 3, 4, 5, 6, 7, 14, 15, 19, 20, 21, 22, 23, 24, 47, 48, 49, 50, 51]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 108 ms to find 19 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 140/455 places, 132/403 transitions.
Applied a total of 0 rules in 8 ms. Remains 140 /140 variables (removed 0) and now considering 132/132 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 140/455 places, 132/403 transitions.
Stuttering acceptance computed with spot in 151 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-13-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s1 0) (EQ s132 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 2 ms.
FORMULA BusinessProcesses-PT-13-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-13-LTLCardinality-01 finished in 365 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(F(X(X(X(F(p0))))))))'
Support contains 2 out of 455 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 455/455 places, 403/403 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 450 transition count 398
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 450 transition count 398
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 448 transition count 396
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 448 transition count 396
Applied a total of 14 rules in 36 ms. Remains 448 /455 variables (removed 7) and now considering 396/403 (removed 7) transitions.
// Phase 1: matrix 396 rows 448 cols
[2022-05-15 16:07:39] [INFO ] Computed 90 place invariants in 7 ms
[2022-05-15 16:07:39] [INFO ] Implicit Places using invariants in 151 ms returned []
// Phase 1: matrix 396 rows 448 cols
[2022-05-15 16:07:39] [INFO ] Computed 90 place invariants in 3 ms
[2022-05-15 16:07:40] [INFO ] Implicit Places using invariants and state equation in 456 ms returned []
Implicit Place search using SMT with State Equation took 614 ms to find 0 implicit places.
// Phase 1: matrix 396 rows 448 cols
[2022-05-15 16:07:40] [INFO ] Computed 90 place invariants in 3 ms
[2022-05-15 16:07:40] [INFO ] Dead Transitions using invariants and state equation in 190 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 448/455 places, 396/403 transitions.
Finished structural reductions, in 1 iterations. Remains : 448/455 places, 396/403 transitions.
Stuttering acceptance computed with spot in 137 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-13-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p0:(OR (EQ s154 0) (EQ s28 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, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 20000 reset in 327 ms.
Product exploration explored 100000 steps with 20000 reset in 215 ms.
Computed a total of 120 stabilizing places and 113 stable transitions
Graph (complete) has 1025 edges and 448 vertex of which 447 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 ms
Computed a total of 120 stabilizing places and 113 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 72 ms. Reduced automaton from 5 states, 5 edges and 1 AP to 5 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 153 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 70 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Finished probabilistic random walk after 22457 steps, run visited all 1 properties in 105 ms. (steps per millisecond=213 )
Probabilistic random walk after 22457 steps, saw 9600 distinct states, run finished after 105 ms. (steps per millisecond=213 ) properties seen :1
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 615 ms. Reduced automaton from 5 states, 5 edges and 1 AP to 5 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 170 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 169 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 448 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 448/448 places, 396/396 transitions.
Applied a total of 0 rules in 8 ms. Remains 448 /448 variables (removed 0) and now considering 396/396 (removed 0) transitions.
// Phase 1: matrix 396 rows 448 cols
[2022-05-15 16:07:42] [INFO ] Computed 90 place invariants in 7 ms
[2022-05-15 16:07:42] [INFO ] Implicit Places using invariants in 158 ms returned []
// Phase 1: matrix 396 rows 448 cols
[2022-05-15 16:07:42] [INFO ] Computed 90 place invariants in 10 ms
[2022-05-15 16:07:43] [INFO ] Implicit Places using invariants and state equation in 491 ms returned []
Implicit Place search using SMT with State Equation took 650 ms to find 0 implicit places.
// Phase 1: matrix 396 rows 448 cols
[2022-05-15 16:07:43] [INFO ] Computed 90 place invariants in 5 ms
[2022-05-15 16:07:43] [INFO ] Dead Transitions using invariants and state equation in 186 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 448/448 places, 396/396 transitions.
Computed a total of 120 stabilizing places and 113 stable transitions
Graph (complete) has 1025 edges and 448 vertex of which 447 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 120 stabilizing places and 113 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 71 ms. Reduced automaton from 5 states, 5 edges and 1 AP to 5 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 182 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 73 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Finished probabilistic random walk after 22457 steps, run visited all 1 properties in 80 ms. (steps per millisecond=280 )
Probabilistic random walk after 22457 steps, saw 9600 distinct states, run finished after 80 ms. (steps per millisecond=280 ) properties seen :1
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 123 ms. Reduced automaton from 5 states, 5 edges and 1 AP to 5 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 175 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 168 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 157 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 20000 reset in 189 ms.
Product exploration explored 100000 steps with 20000 reset in 242 ms.
Applying partial POR strategy [true, false, false, false, false]
Stuttering acceptance computed with spot in 181 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 448 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 448/448 places, 396/396 transitions.
Graph (trivial) has 203 edges and 448 vertex of which 6 / 448 are part of one of the 1 SCC in 2 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1019 edges and 443 vertex of which 442 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 44 rules applied. Total rules applied 46 place count 442 transition count 389
Performed 67 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 67 Pre rules applied. Total rules applied 46 place count 442 transition count 437
Deduced a syphon composed of 111 places in 0 ms
Iterating global reduction 1 with 67 rules applied. Total rules applied 113 place count 442 transition count 437
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 127 place count 428 transition count 411
Deduced a syphon composed of 97 places in 1 ms
Iterating global reduction 1 with 14 rules applied. Total rules applied 141 place count 428 transition count 411
Performed 148 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 245 places in 0 ms
Iterating global reduction 1 with 148 rules applied. Total rules applied 289 place count 428 transition count 411
Discarding 36 places :
Symmetric choice reduction at 1 with 36 rule applications. Total rules 325 place count 392 transition count 375
Deduced a syphon composed of 209 places in 1 ms
Iterating global reduction 1 with 36 rules applied. Total rules applied 361 place count 392 transition count 375
Deduced a syphon composed of 209 places in 1 ms
Applied a total of 361 rules in 86 ms. Remains 392 /448 variables (removed 56) and now considering 375/396 (removed 21) transitions.
[2022-05-15 16:07:45] [INFO ] Redundant transitions in 20 ms returned []
// Phase 1: matrix 375 rows 392 cols
[2022-05-15 16:07:45] [INFO ] Computed 90 place invariants in 9 ms
[2022-05-15 16:07:45] [INFO ] Dead Transitions using invariants and state equation in 189 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 392/448 places, 375/396 transitions.
Finished structural reductions, in 1 iterations. Remains : 392/448 places, 375/396 transitions.
Product exploration explored 100000 steps with 20000 reset in 700 ms.
Product exploration explored 100000 steps with 20000 reset in 648 ms.
Built C files in :
/tmp/ltsmin6329880113605108872
[2022-05-15 16:07:47] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6329880113605108872
Running compilation step : cd /tmp/ltsmin6329880113605108872;'/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 674 ms.
Running link step : cd /tmp/ltsmin6329880113605108872;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin6329880113605108872;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased6830471336402905621.hoa' '--buchi-type=spotba'
LTSmin run took 253 ms.
FORMULA BusinessProcesses-PT-13-LTLCardinality-05 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property BusinessProcesses-PT-13-LTLCardinality-05 finished in 9010 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 455 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 455/455 places, 403/403 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 450 transition count 398
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 450 transition count 398
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 447 transition count 395
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 447 transition count 395
Applied a total of 16 rules in 47 ms. Remains 447 /455 variables (removed 8) and now considering 395/403 (removed 8) transitions.
// Phase 1: matrix 395 rows 447 cols
[2022-05-15 16:07:48] [INFO ] Computed 90 place invariants in 8 ms
[2022-05-15 16:07:48] [INFO ] Implicit Places using invariants in 152 ms returned []
// Phase 1: matrix 395 rows 447 cols
[2022-05-15 16:07:48] [INFO ] Computed 90 place invariants in 2 ms
[2022-05-15 16:07:49] [INFO ] Implicit Places using invariants and state equation in 473 ms returned []
Implicit Place search using SMT with State Equation took 627 ms to find 0 implicit places.
// Phase 1: matrix 395 rows 447 cols
[2022-05-15 16:07:49] [INFO ] Computed 90 place invariants in 3 ms
[2022-05-15 16:07:49] [INFO ] Dead Transitions using invariants and state equation in 189 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 447/455 places, 395/403 transitions.
Finished structural reductions, in 1 iterations. Remains : 447/455 places, 395/403 transitions.
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-13-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s270 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]]
Stuttering criterion allowed to conclude after 139 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-13-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-13-LTLCardinality-06 finished in 937 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(X(G((X(p1)||p0)))))))'
Support contains 4 out of 455 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 455/455 places, 403/403 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 451 transition count 399
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 451 transition count 399
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 449 transition count 397
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 449 transition count 397
Applied a total of 12 rules in 32 ms. Remains 449 /455 variables (removed 6) and now considering 397/403 (removed 6) transitions.
// Phase 1: matrix 397 rows 449 cols
[2022-05-15 16:07:49] [INFO ] Computed 90 place invariants in 7 ms
[2022-05-15 16:07:49] [INFO ] Implicit Places using invariants in 147 ms returned []
// Phase 1: matrix 397 rows 449 cols
[2022-05-15 16:07:49] [INFO ] Computed 90 place invariants in 5 ms
[2022-05-15 16:07:50] [INFO ] Implicit Places using invariants and state equation in 499 ms returned []
Implicit Place search using SMT with State Equation took 649 ms to find 0 implicit places.
// Phase 1: matrix 397 rows 449 cols
[2022-05-15 16:07:50] [INFO ] Computed 90 place invariants in 3 ms
[2022-05-15 16:07:50] [INFO ] Dead Transitions using invariants and state equation in 192 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 449/455 places, 397/403 transitions.
Finished structural reductions, in 1 iterations. Remains : 449/455 places, 397/403 transitions.
Stuttering acceptance computed with spot in 211 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-13-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 3}]], initial=4, aps=[p1:(OR (EQ s2 0) (EQ s300 1)), p0:(OR (EQ s412 0) (EQ s367 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 714 reset in 195 ms.
Product exploration explored 100000 steps with 718 reset in 198 ms.
Computed a total of 120 stabilizing places and 113 stable transitions
Graph (complete) has 1027 edges and 449 vertex of which 448 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 120 stabilizing places and 113 stable transitions
Knowledge obtained : [(AND p1 p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 81 ms. Reduced automaton from 6 states, 9 edges and 2 AP to 6 states, 9 edges and 2 AP.
Stuttering acceptance computed with spot in 195 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 170 steps, including 1 resets, run visited all 4 properties in 4 ms. (steps per millisecond=42 )
Knowledge obtained : [(AND p1 p0), true]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (NOT (AND p1 p0))), (F (AND p1 (NOT p0)))]
Knowledge based reduction with 2 factoid took 155 ms. Reduced automaton from 6 states, 9 edges and 2 AP to 6 states, 9 edges and 2 AP.
Stuttering acceptance computed with spot in 204 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 574 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 449 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 449/449 places, 397/397 transitions.
Applied a total of 0 rules in 14 ms. Remains 449 /449 variables (removed 0) and now considering 397/397 (removed 0) transitions.
// Phase 1: matrix 397 rows 449 cols
[2022-05-15 16:07:52] [INFO ] Computed 90 place invariants in 6 ms
[2022-05-15 16:07:52] [INFO ] Implicit Places using invariants in 148 ms returned []
// Phase 1: matrix 397 rows 449 cols
[2022-05-15 16:07:52] [INFO ] Computed 90 place invariants in 4 ms
[2022-05-15 16:07:52] [INFO ] Implicit Places using invariants and state equation in 489 ms returned []
Implicit Place search using SMT with State Equation took 638 ms to find 0 implicit places.
// Phase 1: matrix 397 rows 449 cols
[2022-05-15 16:07:52] [INFO ] Computed 90 place invariants in 9 ms
[2022-05-15 16:07:53] [INFO ] Dead Transitions using invariants and state equation in 195 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 449/449 places, 397/397 transitions.
Computed a total of 120 stabilizing places and 113 stable transitions
Graph (complete) has 1027 edges and 449 vertex of which 448 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 120 stabilizing places and 113 stable transitions
Knowledge obtained : [(AND p1 p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 84 ms. Reduced automaton from 6 states, 9 edges and 2 AP to 6 states, 9 edges and 2 AP.
Stuttering acceptance computed with spot in 166 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 22 steps, including 0 resets, run visited all 4 properties in 2 ms. (steps per millisecond=11 )
Knowledge obtained : [(AND p1 p0), true]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (NOT (AND p1 p0))), (F (AND p1 (NOT p0)))]
Knowledge based reduction with 2 factoid took 157 ms. Reduced automaton from 6 states, 9 edges and 2 AP to 6 states, 9 edges and 2 AP.
Stuttering acceptance computed with spot in 217 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 193 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 176 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 716 reset in 165 ms.
Product exploration explored 100000 steps with 711 reset in 280 ms.
Built C files in :
/tmp/ltsmin5007306771189111540
[2022-05-15 16:07:54] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5007306771189111540
Running compilation step : cd /tmp/ltsmin5007306771189111540;'/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 562 ms.
Running link step : cd /tmp/ltsmin5007306771189111540;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin5007306771189111540;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7046056682494966941.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 449 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 449/449 places, 397/397 transitions.
Applied a total of 0 rules in 15 ms. Remains 449 /449 variables (removed 0) and now considering 397/397 (removed 0) transitions.
// Phase 1: matrix 397 rows 449 cols
[2022-05-15 16:08:09] [INFO ] Computed 90 place invariants in 4 ms
[2022-05-15 16:08:09] [INFO ] Implicit Places using invariants in 149 ms returned []
// Phase 1: matrix 397 rows 449 cols
[2022-05-15 16:08:09] [INFO ] Computed 90 place invariants in 3 ms
[2022-05-15 16:08:10] [INFO ] Implicit Places using invariants and state equation in 489 ms returned []
Implicit Place search using SMT with State Equation took 644 ms to find 0 implicit places.
// Phase 1: matrix 397 rows 449 cols
[2022-05-15 16:08:10] [INFO ] Computed 90 place invariants in 3 ms
[2022-05-15 16:08:10] [INFO ] Dead Transitions using invariants and state equation in 188 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 449/449 places, 397/397 transitions.
Built C files in :
/tmp/ltsmin9139581135321087823
[2022-05-15 16:08:10] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9139581135321087823
Running compilation step : cd /tmp/ltsmin9139581135321087823;'/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 574 ms.
Running link step : cd /tmp/ltsmin9139581135321087823;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin9139581135321087823;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased10434880977426292693.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-15 16:08:25] [INFO ] Flatten gal took : 24 ms
[2022-05-15 16:08:25] [INFO ] Flatten gal took : 23 ms
[2022-05-15 16:08:25] [INFO ] Time to serialize gal into /tmp/LTL3500728182902859356.gal : 5 ms
[2022-05-15 16:08:25] [INFO ] Time to serialize properties into /tmp/LTL4046810747599170179.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3500728182902859356.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4046810747599170179.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL3500728...266
Read 1 LTL properties
Checking formula 0 : !((X(X(G(X(G(((X("((p2==0)||(p355==1))"))||("(p556==0)"))||("(p454==1)"))))))))
Formula 0 simplified : !XXGXG("(p454==1)" | "(p556==0)" | X"((p2==0)||(p355==1))")
Detected timeout of ITS tools.
[2022-05-15 16:08:40] [INFO ] Flatten gal took : 24 ms
[2022-05-15 16:08:40] [INFO ] Applying decomposition
[2022-05-15 16:08:40] [INFO ] Flatten gal took : 19 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph16852487467527255769.txt' '-o' '/tmp/graph16852487467527255769.bin' '-w' '/tmp/graph16852487467527255769.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph16852487467527255769.bin' '-l' '-1' '-v' '-w' '/tmp/graph16852487467527255769.weights' '-q' '0' '-e' '0.001'
[2022-05-15 16:08:40] [INFO ] Decomposing Gal with order
[2022-05-15 16:08:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 16:08:41] [INFO ] Removed a total of 265 redundant transitions.
[2022-05-15 16:08:41] [INFO ] Flatten gal took : 68 ms
[2022-05-15 16:08:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 3 labels/synchronizations in 8 ms.
[2022-05-15 16:08:41] [INFO ] Time to serialize gal into /tmp/LTL14423444080075762616.gal : 8 ms
[2022-05-15 16:08:41] [INFO ] Time to serialize properties into /tmp/LTL1769669995332084864.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14423444080075762616.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1769669995332084864.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1442344...246
Read 1 LTL properties
Checking formula 0 : !((X(X(G(X(G(((X("((i0.i0.u1.p2==0)||(i12.u104.p355==1))"))||("(i16.u143.p556==0)"))||("(i16.u118.p454==1)"))))))))
Formula 0 simplified : !XXGXG("(i16.u118.p454==1)" | "(i16.u143.p556==0)" | X"((i0.i0.u1.p2==0)||(i12.u104.p355==1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin18242997470856231198
[2022-05-15 16:08:56] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18242997470856231198
Running compilation step : cd /tmp/ltsmin18242997470856231198;'/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 569 ms.
Running link step : cd /tmp/ltsmin18242997470856231198;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin18242997470856231198;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X([](X([]((X((LTLAPp1==true))||(LTLAPp0==true)))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property BusinessProcesses-PT-13-LTLCardinality-10 finished in 81786 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(X(X(G(p0))))))))'
Support contains 2 out of 455 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 455/455 places, 403/403 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 449 transition count 397
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 449 transition count 397
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 446 transition count 394
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 446 transition count 394
Applied a total of 18 rules in 27 ms. Remains 446 /455 variables (removed 9) and now considering 394/403 (removed 9) transitions.
// Phase 1: matrix 394 rows 446 cols
[2022-05-15 16:09:11] [INFO ] Computed 90 place invariants in 5 ms
[2022-05-15 16:09:11] [INFO ] Implicit Places using invariants in 154 ms returned []
// Phase 1: matrix 394 rows 446 cols
[2022-05-15 16:09:11] [INFO ] Computed 90 place invariants in 3 ms
[2022-05-15 16:09:11] [INFO ] Implicit Places using invariants and state equation in 465 ms returned []
Implicit Place search using SMT with State Equation took 621 ms to find 0 implicit places.
// Phase 1: matrix 394 rows 446 cols
[2022-05-15 16:09:11] [INFO ] Computed 90 place invariants in 3 ms
[2022-05-15 16:09:12] [INFO ] Dead Transitions using invariants and state equation in 192 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 446/455 places, 394/403 transitions.
Finished structural reductions, in 1 iterations. Remains : 446/455 places, 394/403 transitions.
Stuttering acceptance computed with spot in 238 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-13-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}], [{ cond=true, acceptance={} source=6 dest: 5}], [{ cond=true, acceptance={} source=7 dest: 6}]], initial=7, aps=[p0:(AND (NEQ s348 0) (NEQ s108 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 6 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-13-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-13-LTLCardinality-11 finished in 1109 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 455 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 455/455 places, 403/403 transitions.
Graph (trivial) has 210 edges and 455 vertex of which 6 / 455 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1029 edges and 450 vertex of which 449 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 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 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 50 place count 448 transition count 347
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 98 place count 400 transition count 347
Performed 95 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 95 Pre rules applied. Total rules applied 98 place count 400 transition count 252
Deduced a syphon composed of 95 places in 0 ms
Ensure Unique test removed 17 places
Reduce places removed 112 places and 0 transitions.
Iterating global reduction 2 with 207 rules applied. Total rules applied 305 place count 288 transition count 252
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 310 place count 283 transition count 247
Iterating global reduction 2 with 5 rules applied. Total rules applied 315 place count 283 transition count 247
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 315 place count 283 transition count 246
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 317 place count 282 transition count 246
Performed 116 Post agglomeration using F-continuation condition.Transition count delta: 116
Deduced a syphon composed of 116 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 118 places and 0 transitions.
Iterating global reduction 2 with 234 rules applied. Total rules applied 551 place count 164 transition count 130
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
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 553 place count 163 transition count 134
Applied a total of 553 rules in 39 ms. Remains 163 /455 variables (removed 292) and now considering 134/403 (removed 269) transitions.
// Phase 1: matrix 134 rows 163 cols
[2022-05-15 16:09:12] [INFO ] Computed 71 place invariants in 3 ms
[2022-05-15 16:09:12] [INFO ] Implicit Places using invariants in 98 ms returned [1, 2, 3, 4, 5, 6, 13, 14, 22, 23, 24, 25, 26, 27, 50, 51, 52, 53, 54, 141, 143]
Discarding 21 places :
Implicit Place search using SMT only with invariants took 100 ms to find 21 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 142/455 places, 134/403 transitions.
Applied a total of 0 rules in 5 ms. Remains 142 /142 variables (removed 0) and now considering 134/134 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 142/455 places, 134/403 transitions.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-13-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (NEQ s8 0) (NEQ s95 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 1 ms.
FORMULA BusinessProcesses-PT-13-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-13-LTLCardinality-12 finished in 186 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(!((p0 U p1) U (X(G(p0))&&p2)))))'
Support contains 6 out of 455 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 455/455 places, 403/403 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 449 transition count 397
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 449 transition count 397
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 446 transition count 394
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 446 transition count 394
Applied a total of 18 rules in 26 ms. Remains 446 /455 variables (removed 9) and now considering 394/403 (removed 9) transitions.
// Phase 1: matrix 394 rows 446 cols
[2022-05-15 16:09:12] [INFO ] Computed 90 place invariants in 4 ms
[2022-05-15 16:09:12] [INFO ] Implicit Places using invariants in 143 ms returned []
// Phase 1: matrix 394 rows 446 cols
[2022-05-15 16:09:12] [INFO ] Computed 90 place invariants in 2 ms
[2022-05-15 16:09:13] [INFO ] Implicit Places using invariants and state equation in 459 ms returned []
Implicit Place search using SMT with State Equation took 603 ms to find 0 implicit places.
// Phase 1: matrix 394 rows 446 cols
[2022-05-15 16:09:13] [INFO ] Computed 90 place invariants in 5 ms
[2022-05-15 16:09:13] [INFO ] Dead Transitions using invariants and state equation in 193 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 446/455 places, 394/403 transitions.
Finished structural reductions, in 1 iterations. Remains : 446/455 places, 394/403 transitions.
Stuttering acceptance computed with spot in 175 ms :[(AND p0 p2), (AND p0 p2), (AND p0 p2), (AND p1 p2 p0), (AND p1 p2 p0)]
Running random walk in product with property : BusinessProcesses-PT-13-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=p2, acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 p1 (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p2), acceptance={0, 1} source=2 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=p1, acceptance={} source=3 dest: 1}, { cond=(AND p1 p2), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=3 dest: 4}], [{ cond=(AND p0 p1 (NOT p2)), acceptance={0} source=4 dest: 2}, { cond=(AND p0 p1 p2), acceptance={0, 1} source=4 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=4 dest: 4}, { cond=(AND p0 (NOT p1) p2), acceptance={1} source=4 dest: 4}]], initial=0, aps=[p1:(OR (EQ s177 0) (EQ s376 1)), p2:(OR (EQ s105 0) (EQ s368 1)), p0:(OR (EQ s193 0) (EQ s313 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 3734 reset in 160 ms.
Stack based approach found an accepted trace after 278 steps with 10 reset with depth 7 and stack size 7 in 1 ms.
FORMULA BusinessProcesses-PT-13-LTLCardinality-13 FALSE TECHNIQUES STACK_TEST
Treatment of property BusinessProcesses-PT-13-LTLCardinality-13 finished in 1185 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&X(X(p0))))'
Support contains 2 out of 455 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 455/455 places, 403/403 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 449 transition count 397
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 449 transition count 397
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 446 transition count 394
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 446 transition count 394
Applied a total of 18 rules in 32 ms. Remains 446 /455 variables (removed 9) and now considering 394/403 (removed 9) transitions.
// Phase 1: matrix 394 rows 446 cols
[2022-05-15 16:09:13] [INFO ] Computed 90 place invariants in 5 ms
[2022-05-15 16:09:13] [INFO ] Implicit Places using invariants in 155 ms returned []
// Phase 1: matrix 394 rows 446 cols
[2022-05-15 16:09:13] [INFO ] Computed 90 place invariants in 5 ms
[2022-05-15 16:09:14] [INFO ] Implicit Places using invariants and state equation in 464 ms returned []
Implicit Place search using SMT with State Equation took 621 ms to find 0 implicit places.
// Phase 1: matrix 394 rows 446 cols
[2022-05-15 16:09:14] [INFO ] Computed 90 place invariants in 6 ms
[2022-05-15 16:09:14] [INFO ] Dead Transitions using invariants and state equation in 194 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 446/455 places, 394/403 transitions.
Finished structural reductions, in 1 iterations. Remains : 446/455 places, 394/403 transitions.
Stuttering acceptance computed with spot in 117 ms :[(NOT p0), (NOT p0), (NOT p0), true]
Running random walk in product with property : BusinessProcesses-PT-13-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=p0, 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=[p0:(AND (EQ s226 0) (EQ s84 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-13-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-13-LTLCardinality-14 finished in 986 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!(G(X(p0)) U X(p1)))'
Support contains 4 out of 455 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 455/455 places, 403/403 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 450 transition count 398
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 450 transition count 398
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 447 transition count 395
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 447 transition count 395
Applied a total of 16 rules in 26 ms. Remains 447 /455 variables (removed 8) and now considering 395/403 (removed 8) transitions.
// Phase 1: matrix 395 rows 447 cols
[2022-05-15 16:09:14] [INFO ] Computed 90 place invariants in 4 ms
[2022-05-15 16:09:14] [INFO ] Implicit Places using invariants in 140 ms returned []
// Phase 1: matrix 395 rows 447 cols
[2022-05-15 16:09:14] [INFO ] Computed 90 place invariants in 2 ms
[2022-05-15 16:09:15] [INFO ] Implicit Places using invariants and state equation in 447 ms returned []
Implicit Place search using SMT with State Equation took 589 ms to find 0 implicit places.
// Phase 1: matrix 395 rows 447 cols
[2022-05-15 16:09:15] [INFO ] Computed 90 place invariants in 8 ms
[2022-05-15 16:09:15] [INFO ] Dead Transitions using invariants and state equation in 191 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 447/455 places, 395/403 transitions.
Finished structural reductions, in 1 iterations. Remains : 447/455 places, 395/403 transitions.
Stuttering acceptance computed with spot in 152 ms :[true, p0, p1, p1, (AND p0 p1)]
Running random walk in product with property : BusinessProcesses-PT-13-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p1, acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(AND p0 p1), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p0:(OR (EQ s434 0) (EQ s363 1)), p1:(OR (EQ s330 0) (EQ s151 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, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-13-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-13-LTLCardinality-15 finished in 971 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(X(G((X(p1)||p0)))))))'
Found a SL insensitive property : BusinessProcesses-PT-13-LTLCardinality-10
Stuttering acceptance computed with spot in 169 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 455 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 455/455 places, 403/403 transitions.
Graph (trivial) has 209 edges and 455 vertex of which 6 / 455 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1029 edges and 450 vertex of which 449 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 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 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 51 place count 448 transition count 346
Reduce places removed 49 places and 0 transitions.
Iterating post reduction 1 with 49 rules applied. Total rules applied 100 place count 399 transition count 346
Performed 94 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 94 Pre rules applied. Total rules applied 100 place count 399 transition count 252
Deduced a syphon composed of 94 places in 0 ms
Ensure Unique test removed 17 places
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 2 with 205 rules applied. Total rules applied 305 place count 288 transition count 252
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 309 place count 284 transition count 248
Iterating global reduction 2 with 4 rules applied. Total rules applied 313 place count 284 transition count 248
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 313 place count 284 transition count 247
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 315 place count 283 transition count 247
Performed 116 Post agglomeration using F-continuation condition.Transition count delta: 116
Deduced a syphon composed of 116 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 2 with 236 rules applied. Total rules applied 551 place count 163 transition count 131
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 553 place count 162 transition count 135
Applied a total of 553 rules in 35 ms. Remains 162 /455 variables (removed 293) and now considering 135/403 (removed 268) transitions.
// Phase 1: matrix 135 rows 162 cols
[2022-05-15 16:09:16] [INFO ] Computed 69 place invariants in 1 ms
[2022-05-15 16:09:16] [INFO ] Implicit Places using invariants in 84 ms returned []
// Phase 1: matrix 135 rows 162 cols
[2022-05-15 16:09:16] [INFO ] Computed 69 place invariants in 2 ms
[2022-05-15 16:09:16] [INFO ] State equation strengthened by 6 read => feed constraints.
[2022-05-15 16:09:16] [INFO ] Implicit Places using invariants and state equation in 233 ms returned [2, 3, 4, 5, 6, 7, 8, 10, 14, 15, 16, 19, 20, 21, 22, 23, 24, 25, 47, 48, 49, 50, 53, 54, 55, 57, 59, 61, 63, 65, 67, 69, 71, 73, 75, 79, 81, 86, 88, 90, 92, 94, 102, 104, 106, 108, 110]
Discarding 47 places :
Implicit Place search using SMT with State Equation took 319 ms to find 47 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 115/455 places, 135/403 transitions.
Graph (complete) has 381 edges and 115 vertex of which 104 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.1 ms
Discarding 11 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 104 transition count 121
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 19 place count 95 transition count 121
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 31 place count 83 transition count 81
Iterating global reduction 2 with 12 rules applied. Total rules applied 43 place count 83 transition count 81
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 2 rules applied. Total rules applied 45 place count 83 transition count 79
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 47 place count 81 transition count 79
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 48 place count 80 transition count 78
Iterating global reduction 4 with 1 rules applied. Total rules applied 49 place count 80 transition count 78
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 15 rules applied. Total rules applied 64 place count 72 transition count 71
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 66 place count 71 transition count 70
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 67 place count 71 transition count 70
Applied a total of 67 rules in 14 ms. Remains 71 /115 variables (removed 44) and now considering 70/135 (removed 65) transitions.
// Phase 1: matrix 70 rows 71 cols
[2022-05-15 16:09:16] [INFO ] Computed 17 place invariants in 0 ms
[2022-05-15 16:09:16] [INFO ] Implicit Places using invariants in 43 ms returned [6, 7, 8]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 43 ms to find 3 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 2 : 68/455 places, 70/403 transitions.
Applied a total of 0 rules in 2 ms. Remains 68 /68 variables (removed 0) and now considering 70/70 (removed 0) transitions.
Finished structural reductions, in 3 iterations. Remains : 68/455 places, 70/403 transitions.
Running random walk in product with property : BusinessProcesses-PT-13-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 3}]], initial=4, aps=[p1:(OR (EQ s1 0) (EQ s22 1)), p0:(OR (EQ s47 0) (EQ s42 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 15392 reset in 127 ms.
Product exploration explored 100000 steps with 15370 reset in 120 ms.
Computed a total of 8 stabilizing places and 8 stable transitions
Computed a total of 8 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND p1 p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 82 ms. Reduced automaton from 6 states, 9 edges and 2 AP to 6 states, 9 edges and 2 AP.
Stuttering acceptance computed with spot in 196 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 5 steps, including 0 resets, run visited all 4 properties in 2 ms. (steps per millisecond=2 )
Knowledge obtained : [(AND p1 p0), true]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (NOT (AND p1 p0))), (F (AND p1 (NOT p0)))]
Knowledge based reduction with 2 factoid took 142 ms. Reduced automaton from 6 states, 9 edges and 2 AP to 6 states, 9 edges and 2 AP.
Stuttering acceptance computed with spot in 171 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 183 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 68 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 70/70 transitions.
Applied a total of 0 rules in 1 ms. Remains 68 /68 variables (removed 0) and now considering 70/70 (removed 0) transitions.
// Phase 1: matrix 70 rows 68 cols
[2022-05-15 16:09:17] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-15 16:09:17] [INFO ] Implicit Places using invariants in 41 ms returned []
// Phase 1: matrix 70 rows 68 cols
[2022-05-15 16:09:17] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-15 16:09:17] [INFO ] State equation strengthened by 5 read => feed constraints.
[2022-05-15 16:09:17] [INFO ] Implicit Places using invariants and state equation in 64 ms returned [28, 30, 32]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 106 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 65/68 places, 70/70 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 64 transition count 69
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 64 transition count 69
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 63 transition count 68
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 63 transition count 68
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 63 transition count 67
Applied a total of 5 rules in 1 ms. Remains 63 /65 variables (removed 2) and now considering 67/70 (removed 3) transitions.
// Phase 1: matrix 67 rows 63 cols
[2022-05-15 16:09:17] [INFO ] Computed 11 place invariants in 0 ms
[2022-05-15 16:09:17] [INFO ] Implicit Places using invariants in 36 ms returned []
// Phase 1: matrix 67 rows 63 cols
[2022-05-15 16:09:17] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-15 16:09:17] [INFO ] State equation strengthened by 5 read => feed constraints.
[2022-05-15 16:09:17] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 63/68 places, 67/70 transitions.
Finished structural reductions, in 2 iterations. Remains : 63/68 places, 67/70 transitions.
Computed a total of 8 stabilizing places and 8 stable transitions
Computed a total of 8 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND p1 p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 92 ms. Reduced automaton from 6 states, 9 edges and 2 AP to 6 states, 9 edges and 2 AP.
Stuttering acceptance computed with spot in 181 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 57 steps, including 9 resets, run visited all 4 properties in 4 ms. (steps per millisecond=14 )
Knowledge obtained : [(AND p1 p0), true]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (NOT (AND p1 p0))), (F (AND p1 (NOT p0)))]
Knowledge based reduction with 2 factoid took 134 ms. Reduced automaton from 6 states, 9 edges and 2 AP to 6 states, 9 edges and 2 AP.
Stuttering acceptance computed with spot in 165 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 173 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 194 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 15466 reset in 105 ms.
Product exploration explored 100000 steps with 15383 reset in 82 ms.
Built C files in :
/tmp/ltsmin15463634275950334608
[2022-05-15 16:09:18] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15463634275950334608
Running compilation step : cd /tmp/ltsmin15463634275950334608;'/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 140 ms.
Running link step : cd /tmp/ltsmin15463634275950334608;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin15463634275950334608;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15720968389987900624.hoa' '--buchi-type=spotba'
LTSmin run took 149 ms.
Treatment of property BusinessProcesses-PT-13-LTLCardinality-10 finished in 3481 ms.
CL/SL decision was in the wrong direction : SL + true
[2022-05-15 16:09:19] [INFO ] Flatten gal took : 19 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin394803043968246775
[2022-05-15 16:09:19] [INFO ] Computing symmetric may disable matrix : 403 transitions.
[2022-05-15 16:09:19] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 16:09:19] [INFO ] Applying decomposition
[2022-05-15 16:09:19] [INFO ] Computing symmetric may enable matrix : 403 transitions.
[2022-05-15 16:09:19] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 16:09:19] [INFO ] Flatten gal took : 15 ms
[2022-05-15 16:09:19] [INFO ] Computing Do-Not-Accords matrix : 403 transitions.
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph3088318695494146231.txt' '-o' '/tmp/graph3088318695494146231.bin' '-w' '/tmp/graph3088318695494146231.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph3088318695494146231.bin' '-l' '-1' '-v' '-w' '/tmp/graph3088318695494146231.weights' '-q' '0' '-e' '0.001'
[2022-05-15 16:09:19] [INFO ] Decomposing Gal with order
[2022-05-15 16:09:19] [INFO ] Computation of Completed DNA matrix. took 13 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 16:09:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 16:09:19] [INFO ] Built C files in 81ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin394803043968246775
Running compilation step : cd /tmp/ltsmin394803043968246775;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' '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'
[2022-05-15 16:09:19] [INFO ] Removed a total of 265 redundant transitions.
[2022-05-15 16:09:19] [INFO ] Flatten gal took : 29 ms
[2022-05-15 16:09:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 9 ms.
[2022-05-15 16:09:19] [INFO ] Time to serialize gal into /tmp/LTLCardinality329402820778483512.gal : 5 ms
[2022-05-15 16:09:19] [INFO ] Time to serialize properties into /tmp/LTLCardinality2693914783534989889.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality329402820778483512.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality2693914783534989889.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...266
Read 1 LTL properties
Checking formula 0 : !((X(X(G(X(G(((X("((i0.i2.u1.p2==0)||(i13.i1.u105.p355==1))"))||("(i17.u148.p556==0)"))||("(i17.u126.p454==1)"))))))))
Formula 0 simplified : !XXGXG("(i17.u126.p454==1)" | "(i17.u148.p556==0)" | X"((i0.i2.u1.p2==0)||(i13.i1.u105.p355==1))")
Compilation finished in 819 ms.
Running link step : cd /tmp/ltsmin394803043968246775;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin394803043968246775;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X([](X([]((X((LTLAPp1==true))||(LTLAPp0==true)))))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t7, t8, t9, t10, t165, t237, t259, t268, t376, t378, t386, t387, t393, i0.i0.u120.t68, i0.i1....1241
Computing Next relation with stutter on 1188 deadlock states
Detected timeout of ITS tools.
[2022-05-15 16:29:55] [INFO ] Applying decomposition
[2022-05-15 16:29:55] [INFO ] Flatten gal took : 40 ms
[2022-05-15 16:29:55] [INFO ] Decomposing Gal with order
[2022-05-15 16:29:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 16:29:55] [INFO ] Removed a total of 141 redundant transitions.
[2022-05-15 16:29:55] [INFO ] Flatten gal took : 89 ms
[2022-05-15 16:29:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 156 labels/synchronizations in 348 ms.
[2022-05-15 16:29:56] [INFO ] Time to serialize gal into /tmp/LTLCardinality17609408858687414773.gal : 18 ms
[2022-05-15 16:29:56] [INFO ] Time to serialize properties into /tmp/LTLCardinality9417239514171193635.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality17609408858687414773.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality9417239514171193635.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...268
Read 1 LTL properties
Checking formula 0 : !((X(X(G(X(G(((X("((i0.i0.u176.p2==0)||(i0.i1.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u112.p355==1))"))||("(i1.u193.p556==0)"))||("(i1....177
Formula 0 simplified : !XXGXG("(i1.u193.p454==1)" | "(i1.u193.p556==0)" | X"((i0.i0.u176.p2==0)||(i0.i1.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u112.p355==1...159
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.000: Loading model from ./gal.so
pins2lts-mc-linux64( 4/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.006: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.006: LTL layer: formula: X(X([](X([]((X((LTLAPp1==true))||(LTLAPp0==true)))))))
pins2lts-mc-linux64( 4/ 8), 0.006: "X(X([](X([]((X((LTLAPp1==true))||(LTLAPp0==true)))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 4/ 8), 0.007: Using Spin LTL semantics
pins2lts-mc-linux64( 3/ 8), 0.014: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.017: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.024: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.024: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.029: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.029: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.039: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.039: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.098: DFS-FIFO for weak LTL, using special progress label 406
pins2lts-mc-linux64( 0/ 8), 0.098: There are 407 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.098: State length is 456, there are 412 groups
pins2lts-mc-linux64( 0/ 8), 0.098: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.098: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.098: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.098: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 7/ 8), 0.115: ~1 levels ~960 states ~4544 transitions
pins2lts-mc-linux64( 7/ 8), 0.156: ~1 levels ~1920 states ~9792 transitions
pins2lts-mc-linux64( 1/ 8), 0.205: ~1 levels ~3840 states ~22304 transitions
pins2lts-mc-linux64( 1/ 8), 0.315: ~1 levels ~7680 states ~47624 transitions
pins2lts-mc-linux64( 1/ 8), 0.530: ~1 levels ~15360 states ~104232 transitions
pins2lts-mc-linux64( 7/ 8), 0.924: ~1 levels ~30720 states ~206376 transitions
pins2lts-mc-linux64( 7/ 8), 1.704: ~1 levels ~61440 states ~482488 transitions
pins2lts-mc-linux64( 7/ 8), 3.004: ~1 levels ~122880 states ~1007280 transitions
pins2lts-mc-linux64( 7/ 8), 5.361: ~1 levels ~245760 states ~2159320 transitions
pins2lts-mc-linux64( 7/ 8), 9.682: ~1 levels ~491520 states ~4505192 transitions
pins2lts-mc-linux64( 7/ 8), 18.018: ~1 levels ~983040 states ~9575912 transitions
pins2lts-mc-linux64( 5/ 8), 34.814: ~1 levels ~1966080 states ~20708672 transitions
pins2lts-mc-linux64( 7/ 8), 69.745: ~1 levels ~3932160 states ~43010536 transitions
pins2lts-mc-linux64( 5/ 8), 143.232: ~1 levels ~7864320 states ~92307336 transitions
pins2lts-mc-linux64( 7/ 8), 293.157: ~1 levels ~15728640 states ~195724816 transitions
pins2lts-mc-linux64( 7/ 8), 598.341: ~1 levels ~31457280 states ~407656128 transitions
pins2lts-mc-linux64( 7/ 8), 1226.238: ~1 levels ~62914560 states ~845821352 transitions
pins2lts-mc-linux64( 4/ 8), 1389.611: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 1389.670:
pins2lts-mc-linux64( 0/ 8), 1389.670: mean standard work distribution: 4.0% (states) 2.9% (transitions)
pins2lts-mc-linux64( 0/ 8), 1389.670:
pins2lts-mc-linux64( 0/ 8), 1389.670: Explored 66397702 states 986260952 transitions, fanout: 14.854
pins2lts-mc-linux64( 0/ 8), 1389.670: Total exploration time 1389.550 sec (1389.490 sec minimum, 1389.526 sec on average)
pins2lts-mc-linux64( 0/ 8), 1389.670: States per second: 47784, Transitions per second: 709770
pins2lts-mc-linux64( 0/ 8), 1389.670:
pins2lts-mc-linux64( 0/ 8), 1389.670: Progress states detected: 134217232
pins2lts-mc-linux64( 0/ 8), 1389.670: Redundant explorations: -50.5297
pins2lts-mc-linux64( 0/ 8), 1389.670:
pins2lts-mc-linux64( 0/ 8), 1389.670: Queue width: 8B, total height: 111785836, memory: 852.86MB
pins2lts-mc-linux64( 0/ 8), 1389.670: Tree memory: 1174.2MB, 9.2 B/state, compr.: 0.5%
pins2lts-mc-linux64( 0/ 8), 1389.670: Tree fill ratio (roots/leafs): 99.0%/58.0%
pins2lts-mc-linux64( 0/ 8), 1389.670: Stored 405 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 1389.670: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 1389.670: Est. total memory use: 2027.1MB (~1876.9MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin394803043968246775;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X([](X([]((X((LTLAPp1==true))||(LTLAPp0==true)))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin394803043968246775;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X([](X([]((X((LTLAPp1==true))||(LTLAPp0==true)))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:242)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:177)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:115)
at java.base/java.lang.Thread.run(Thread.java:829)
Detected timeout of ITS tools.
[2022-05-15 16:50:48] [INFO ] Flatten gal took : 333 ms
[2022-05-15 16:50:48] [INFO ] Input system was already deterministic with 403 transitions.
[2022-05-15 16:50:48] [INFO ] Transformed 455 places.
[2022-05-15 16:50:48] [INFO ] Transformed 403 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-05-15 16:51:18] [INFO ] Time to serialize gal into /tmp/LTLCardinality8071621990857396428.gal : 9 ms
[2022-05-15 16:51:18] [INFO ] Time to serialize properties into /tmp/LTLCardinality2177016140832960074.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality8071621990857396428.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality2177016140832960074.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...333
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(X(G(X(G(((X("((p2==0)||(p355==1))"))||("(p556==0)"))||("(p454==1)"))))))))
Formula 0 simplified : !XXGXG("(p454==1)" | "(p556==0)" | X"((p2==0)||(p355==1))")

BK_TIME_CONFINEMENT_REACHED

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

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