Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2021-input.r026-tajo-162038143800389.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is BusinessProcesses-PT-09, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r026-tajo-162038143800389
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 480K
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 126K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.7K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 77K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Mar 28 15:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 28 15:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 15:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 15:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Mar 23 03:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 23 03:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 22 12:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 22 12:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 104K May 5 16:51 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-09-00
FORMULA_NAME BusinessProcesses-PT-09-01
FORMULA_NAME BusinessProcesses-PT-09-02
FORMULA_NAME BusinessProcesses-PT-09-03
FORMULA_NAME BusinessProcesses-PT-09-04
FORMULA_NAME BusinessProcesses-PT-09-05
FORMULA_NAME BusinessProcesses-PT-09-06
FORMULA_NAME BusinessProcesses-PT-09-07
FORMULA_NAME BusinessProcesses-PT-09-08
FORMULA_NAME BusinessProcesses-PT-09-09
FORMULA_NAME BusinessProcesses-PT-09-10
FORMULA_NAME BusinessProcesses-PT-09-11
FORMULA_NAME BusinessProcesses-PT-09-12
FORMULA_NAME BusinessProcesses-PT-09-13
FORMULA_NAME BusinessProcesses-PT-09-14
FORMULA_NAME BusinessProcesses-PT-09-15

=== Now, execution of the tool begins

BK_START 1620544643562

Running Version 0
[2021-05-09 07:17:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -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]
[2021-05-09 07:17:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 07:17:26] [INFO ] Load time of PNML (sax parser for PT used): 102 ms
[2021-05-09 07:17:26] [INFO ] Transformed 403 places.
[2021-05-09 07:17:26] [INFO ] Transformed 374 transitions.
[2021-05-09 07:17:26] [INFO ] Found NUPN structural information;
[2021-05-09 07:17:26] [INFO ] Parsed PT model containing 403 places and 374 transitions in 189 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Support contains 47 out of 403 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 403/403 places, 374/374 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 402 transition count 374
Discarding 52 places :
Symmetric choice reduction at 1 with 52 rule applications. Total rules 53 place count 350 transition count 322
Iterating global reduction 1 with 52 rules applied. Total rules applied 105 place count 350 transition count 322
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 125 place count 330 transition count 302
Iterating global reduction 1 with 20 rules applied. Total rules applied 145 place count 330 transition count 302
Applied a total of 145 rules in 74 ms. Remains 330 /403 variables (removed 73) and now considering 302/374 (removed 72) transitions.
// Phase 1: matrix 302 rows 330 cols
[2021-05-09 07:17:26] [INFO ] Computed 64 place invariants in 23 ms
[2021-05-09 07:17:26] [INFO ] Implicit Places using invariants in 330 ms returned []
// Phase 1: matrix 302 rows 330 cols
[2021-05-09 07:17:26] [INFO ] Computed 64 place invariants in 16 ms
[2021-05-09 07:17:27] [INFO ] Implicit Places using invariants and state equation in 356 ms returned []
Implicit Place search using SMT with State Equation took 724 ms to find 0 implicit places.
// Phase 1: matrix 302 rows 330 cols
[2021-05-09 07:17:27] [INFO ] Computed 64 place invariants in 21 ms
[2021-05-09 07:17:27] [INFO ] Dead Transitions using invariants and state equation in 205 ms returned []
Finished structural reductions, in 1 iterations. Remains : 330/403 places, 302/374 transitions.
[2021-05-09 07:17:27] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-05-09 07:17:27] [INFO ] Flatten gal took : 70 ms
FORMULA BusinessProcesses-PT-09-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-09-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-09 07:17:27] [INFO ] Flatten gal took : 25 ms
[2021-05-09 07:17:27] [INFO ] Input system was already deterministic with 302 transitions.
Incomplete random walk after 100000 steps, including 1048 resets, run finished after 245 ms. (steps per millisecond=408 ) properties (out of 26) seen :22
Running SMT prover for 4 properties.
// Phase 1: matrix 302 rows 330 cols
[2021-05-09 07:17:28] [INFO ] Computed 64 place invariants in 5 ms
[2021-05-09 07:17:28] [INFO ] [Real]Absence check using 35 positive place invariants in 160 ms returned sat
[2021-05-09 07:17:28] [INFO ] [Real]Absence check using 35 positive and 29 generalized place invariants in 6 ms returned sat
[2021-05-09 07:17:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:17:28] [INFO ] [Real]Absence check using state equation in 61 ms returned unsat
[2021-05-09 07:17:28] [INFO ] [Real]Absence check using 35 positive place invariants in 13 ms returned sat
[2021-05-09 07:17:28] [INFO ] [Real]Absence check using 35 positive and 29 generalized place invariants in 10 ms returned sat
[2021-05-09 07:17:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:17:28] [INFO ] [Real]Absence check using state equation in 96 ms returned unsat
[2021-05-09 07:17:28] [INFO ] [Real]Absence check using 35 positive place invariants in 7 ms returned sat
[2021-05-09 07:17:28] [INFO ] [Real]Absence check using 35 positive and 29 generalized place invariants in 5 ms returned sat
[2021-05-09 07:17:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:17:28] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2021-05-09 07:17:28] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:17:28] [INFO ] [Nat]Absence check using 35 positive place invariants in 11 ms returned sat
[2021-05-09 07:17:28] [INFO ] [Nat]Absence check using 35 positive and 29 generalized place invariants in 8 ms returned sat
[2021-05-09 07:17:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:17:29] [INFO ] [Nat]Absence check using state equation in 87 ms returned unsat
[2021-05-09 07:17:29] [INFO ] [Real]Absence check using 35 positive place invariants in 7 ms returned sat
[2021-05-09 07:17:29] [INFO ] [Real]Absence check using 35 positive and 29 generalized place invariants in 4 ms returned unsat
Successfully simplified 4 atomic propositions for a total of 14 simplifications.
FORMULA BusinessProcesses-PT-09-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 330 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 330/330 places, 302/302 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 322 transition count 294
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 322 transition count 294
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 20 place count 318 transition count 290
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 318 transition count 290
Applied a total of 24 rules in 45 ms. Remains 318 /330 variables (removed 12) and now considering 290/302 (removed 12) transitions.
// Phase 1: matrix 290 rows 318 cols
[2021-05-09 07:17:29] [INFO ] Computed 64 place invariants in 3 ms
[2021-05-09 07:17:29] [INFO ] Implicit Places using invariants in 391 ms returned []
// Phase 1: matrix 290 rows 318 cols
[2021-05-09 07:17:29] [INFO ] Computed 64 place invariants in 4 ms
[2021-05-09 07:17:29] [INFO ] Implicit Places using invariants and state equation in 233 ms returned []
Implicit Place search using SMT with State Equation took 632 ms to find 0 implicit places.
// Phase 1: matrix 290 rows 318 cols
[2021-05-09 07:17:29] [INFO ] Computed 64 place invariants in 1 ms
[2021-05-09 07:17:30] [INFO ] Dead Transitions using invariants and state equation in 217 ms returned []
Finished structural reductions, in 1 iterations. Remains : 318/330 places, 290/302 transitions.
Stuttering acceptance computed with spot in 200 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-09-00 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s72 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 86 steps with 0 reset in 2 ms.
FORMULA BusinessProcesses-PT-09-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-09-00 finished in 1146 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(G(p0))&&F(((p1&&F(p2))||G(p1))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 330 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 330/330 places, 302/302 transitions.
Graph (trivial) has 149 edges and 330 vertex of which 6 / 330 are part of one of the 1 SCC in 4 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 34 place count 324 transition count 262
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 67 place count 291 transition count 262
Performed 66 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 66 Pre rules applied. Total rules applied 67 place count 291 transition count 196
Deduced a syphon composed of 66 places in 1 ms
Ensure Unique test removed 10 places
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 2 with 142 rules applied. Total rules applied 209 place count 215 transition count 196
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 214 place count 210 transition count 191
Iterating global reduction 2 with 5 rules applied. Total rules applied 219 place count 210 transition count 191
Performed 82 Post agglomeration using F-continuation condition.Transition count delta: 82
Deduced a syphon composed of 82 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 2 with 166 rules applied. Total rules applied 385 place count 126 transition count 109
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 387 place count 125 transition count 112
Applied a total of 387 rules in 69 ms. Remains 125 /330 variables (removed 205) and now considering 112/302 (removed 190) transitions.
// Phase 1: matrix 112 rows 125 cols
[2021-05-09 07:17:30] [INFO ] Computed 52 place invariants in 1 ms
[2021-05-09 07:17:30] [INFO ] Implicit Places using invariants in 80 ms returned [1, 2, 3, 4, 12, 37, 38, 39, 40, 41, 42, 43]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 84 ms to find 12 implicit places.
[2021-05-09 07:17:30] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 112 rows 113 cols
[2021-05-09 07:17:30] [INFO ] Computed 40 place invariants in 3 ms
[2021-05-09 07:17:30] [INFO ] Dead Transitions using invariants and state equation in 68 ms returned []
Starting structural reductions, iteration 1 : 113/330 places, 112/302 transitions.
Applied a total of 0 rules in 8 ms. Remains 113 /113 variables (removed 0) and now considering 112/112 (removed 0) transitions.
[2021-05-09 07:17:30] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 112 rows 113 cols
[2021-05-09 07:17:30] [INFO ] Computed 40 place invariants in 1 ms
[2021-05-09 07:17:30] [INFO ] Dead Transitions using invariants and state equation in 76 ms returned []
Finished structural reductions, in 2 iterations. Remains : 113/330 places, 112/302 transitions.
Stuttering acceptance computed with spot in 154 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : BusinessProcesses-PT-09-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s79 1), p1:(NEQ s75 1), p2:(NEQ s70 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-09-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-09-01 finished in 510 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0&&G(F(p1)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 330 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 330/330 places, 302/302 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 322 transition count 294
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 322 transition count 294
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 20 place count 318 transition count 290
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 318 transition count 290
Applied a total of 24 rules in 39 ms. Remains 318 /330 variables (removed 12) and now considering 290/302 (removed 12) transitions.
// Phase 1: matrix 290 rows 318 cols
[2021-05-09 07:17:30] [INFO ] Computed 64 place invariants in 2 ms
[2021-05-09 07:17:30] [INFO ] Implicit Places using invariants in 123 ms returned []
// Phase 1: matrix 290 rows 318 cols
[2021-05-09 07:17:30] [INFO ] Computed 64 place invariants in 3 ms
[2021-05-09 07:17:31] [INFO ] Implicit Places using invariants and state equation in 279 ms returned []
Implicit Place search using SMT with State Equation took 404 ms to find 0 implicit places.
// Phase 1: matrix 290 rows 318 cols
[2021-05-09 07:17:31] [INFO ] Computed 64 place invariants in 4 ms
[2021-05-09 07:17:31] [INFO ] Dead Transitions using invariants and state equation in 146 ms returned []
Finished structural reductions, in 1 iterations. Remains : 318/330 places, 290/302 transitions.
Stuttering acceptance computed with spot in 117 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-09-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(OR (NEQ s135 0) (NEQ s282 0)), p1:(EQ s135 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, 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 1 ms.
FORMULA BusinessProcesses-PT-09-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-09-03 finished in 737 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((p0 U X(X(G(!p0)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 330 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 330/330 places, 302/302 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 321 transition count 293
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 321 transition count 293
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 22 place count 317 transition count 289
Iterating global reduction 0 with 4 rules applied. Total rules applied 26 place count 317 transition count 289
Applied a total of 26 rules in 17 ms. Remains 317 /330 variables (removed 13) and now considering 289/302 (removed 13) transitions.
// Phase 1: matrix 289 rows 317 cols
[2021-05-09 07:17:31] [INFO ] Computed 64 place invariants in 2 ms
[2021-05-09 07:17:31] [INFO ] Implicit Places using invariants in 104 ms returned []
// Phase 1: matrix 289 rows 317 cols
[2021-05-09 07:17:31] [INFO ] Computed 64 place invariants in 2 ms
[2021-05-09 07:17:31] [INFO ] Implicit Places using invariants and state equation in 240 ms returned []
Implicit Place search using SMT with State Equation took 347 ms to find 0 implicit places.
// Phase 1: matrix 289 rows 317 cols
[2021-05-09 07:17:31] [INFO ] Computed 64 place invariants in 4 ms
[2021-05-09 07:17:32] [INFO ] Dead Transitions using invariants and state equation in 150 ms returned []
Finished structural reductions, in 1 iterations. Remains : 317/330 places, 289/302 transitions.
Stuttering acceptance computed with spot in 163 ms :[true, p0, p0, p0]
Running random walk in product with property : BusinessProcesses-PT-09-04 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=p0, acceptance={0} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(AND (EQ s115 1) (EQ s215 1) (EQ s282 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 7596 steps with 81 reset in 37 ms.
FORMULA BusinessProcesses-PT-09-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-09-04 finished in 739 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((p0||X((p1||X(p2)))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 330 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 330/330 places, 302/302 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 321 transition count 293
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 321 transition count 293
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 22 place count 317 transition count 289
Iterating global reduction 0 with 4 rules applied. Total rules applied 26 place count 317 transition count 289
Applied a total of 26 rules in 17 ms. Remains 317 /330 variables (removed 13) and now considering 289/302 (removed 13) transitions.
// Phase 1: matrix 289 rows 317 cols
[2021-05-09 07:17:32] [INFO ] Computed 64 place invariants in 5 ms
[2021-05-09 07:17:32] [INFO ] Implicit Places using invariants in 166 ms returned []
// Phase 1: matrix 289 rows 317 cols
[2021-05-09 07:17:32] [INFO ] Computed 64 place invariants in 16 ms
[2021-05-09 07:17:32] [INFO ] Implicit Places using invariants and state equation in 360 ms returned []
Implicit Place search using SMT with State Equation took 531 ms to find 0 implicit places.
// Phase 1: matrix 289 rows 317 cols
[2021-05-09 07:17:32] [INFO ] Computed 64 place invariants in 2 ms
[2021-05-09 07:17:32] [INFO ] Dead Transitions using invariants and state equation in 164 ms returned []
Finished structural reductions, in 1 iterations. Remains : 317/330 places, 289/302 transitions.
Stuttering acceptance computed with spot in 164 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), true]
Running random walk in product with property : BusinessProcesses-PT-09-06 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(NOT p2), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s68 1), p1:(NEQ s146 1), p2:(NEQ s159 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 25004 reset in 268 ms.
Product exploration explored 100000 steps with 24969 reset in 196 ms.
Graph (complete) has 748 edges and 317 vertex of which 316 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Knowledge obtained : [(NOT p0), p1, p2]
Stuttering acceptance computed with spot in 124 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), true]
Product exploration explored 100000 steps with 24898 reset in 242 ms.
Product exploration explored 100000 steps with 25001 reset in 186 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 169 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), true]
Support contains 3 out of 317 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 317/317 places, 289/289 transitions.
Graph (trivial) has 136 edges and 317 vertex of which 6 / 317 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 26 rules applied. Total rules applied 27 place count 312 transition count 283
Performed 68 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 68 Pre rules applied. Total rules applied 27 place count 312 transition count 433
Deduced a syphon composed of 94 places in 1 ms
Iterating global reduction 1 with 68 rules applied. Total rules applied 95 place count 312 transition count 433
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 104 place count 303 transition count 397
Deduced a syphon composed of 85 places in 0 ms
Iterating global reduction 1 with 9 rules applied. Total rules applied 113 place count 303 transition count 397
Performed 79 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 164 places in 0 ms
Iterating global reduction 1 with 79 rules applied. Total rules applied 192 place count 303 transition count 397
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 209 place count 286 transition count 380
Deduced a syphon composed of 147 places in 0 ms
Iterating global reduction 1 with 17 rules applied. Total rules applied 226 place count 286 transition count 380
Deduced a syphon composed of 147 places in 0 ms
Applied a total of 226 rules in 61 ms. Remains 286 /317 variables (removed 31) and now considering 380/289 (removed -91) transitions.
[2021-05-09 07:17:34] [INFO ] Redundant transitions in 22 ms returned []
// Phase 1: matrix 380 rows 286 cols
[2021-05-09 07:17:34] [INFO ] Computed 64 place invariants in 4 ms
[2021-05-09 07:17:34] [INFO ] Dead Transitions using invariants and state equation in 215 ms returned []
Finished structural reductions, in 1 iterations. Remains : 286/317 places, 380/289 transitions.
Product exploration explored 100000 steps with 25047 reset in 170 ms.
Product exploration explored 100000 steps with 24984 reset in 181 ms.
[2021-05-09 07:17:35] [INFO ] Flatten gal took : 21 ms
[2021-05-09 07:17:35] [INFO ] Flatten gal took : 21 ms
[2021-05-09 07:17:35] [INFO ] Time to serialize gal into /tmp/LTL3015959910255208151.gal : 21 ms
[2021-05-09 07:17:35] [INFO ] Time to serialize properties into /tmp/LTL16442520852425056027.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL3015959910255208151.gal, -t, CGAL, -LTL, /tmp/LTL16442520852425056027.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL3015959910255208151.gal -t CGAL -LTL /tmp/LTL16442520852425056027.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(G(("(p74==1)")||(X(("(p163!=1)")||(X("(p177!=1)"))))))))
Formula 0 simplified : !XG("(p74==1)" | X("(p163!=1)" | X"(p177!=1)"))
Detected timeout of ITS tools.
[2021-05-09 07:17:50] [INFO ] Flatten gal took : 16 ms
[2021-05-09 07:17:50] [INFO ] Applying decomposition
[2021-05-09 07:17:50] [INFO ] Flatten gal took : 16 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph18304928670806722091.txt, -o, /tmp/graph18304928670806722091.bin, -w, /tmp/graph18304928670806722091.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph18304928670806722091.bin, -l, -1, -v, -w, /tmp/graph18304928670806722091.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 07:17:50] [INFO ] Decomposing Gal with order
[2021-05-09 07:17:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 07:17:50] [INFO ] Removed a total of 226 redundant transitions.
[2021-05-09 07:17:50] [INFO ] Flatten gal took : 53 ms
[2021-05-09 07:17:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2021-05-09 07:17:50] [INFO ] Time to serialize gal into /tmp/LTL13838947623765795912.gal : 8 ms
[2021-05-09 07:17:50] [INFO ] Time to serialize properties into /tmp/LTL14394805998538831059.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL13838947623765795912.gal, -t, CGAL, -LTL, /tmp/LTL14394805998538831059.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL13838947623765795912.gal -t CGAL -LTL /tmp/LTL14394805998538831059.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(G(("(i8.u26.p74==1)")||(X(("(i9.i1.u55.p163!=1)")||(X("(i11.i1.u61.p177!=1)"))))))))
Formula 0 simplified : !XG("(i8.u26.p74==1)" | X("(i9.i1.u55.p163!=1)" | X"(i11.i1.u61.p177!=1)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5358465639821385400
[2021-05-09 07:18:05] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5358465639821385400
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin5358465639821385400]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin5358465639821385400] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin5358465639821385400] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property BusinessProcesses-PT-09-06 finished in 34518 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G((p0||X((p1||X(G(p2))))))))], workingDir=/home/mcc/execution]
Support contains 2 out of 330 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 330/330 places, 302/302 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 321 transition count 293
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 321 transition count 293
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 22 place count 317 transition count 289
Iterating global reduction 0 with 4 rules applied. Total rules applied 26 place count 317 transition count 289
Applied a total of 26 rules in 56 ms. Remains 317 /330 variables (removed 13) and now considering 289/302 (removed 13) transitions.
// Phase 1: matrix 289 rows 317 cols
[2021-05-09 07:18:06] [INFO ] Computed 64 place invariants in 4 ms
[2021-05-09 07:18:06] [INFO ] Implicit Places using invariants in 165 ms returned []
// Phase 1: matrix 289 rows 317 cols
[2021-05-09 07:18:07] [INFO ] Computed 64 place invariants in 1 ms
[2021-05-09 07:18:07] [INFO ] Implicit Places using invariants and state equation in 272 ms returned []
Implicit Place search using SMT with State Equation took 437 ms to find 0 implicit places.
// Phase 1: matrix 289 rows 317 cols
[2021-05-09 07:18:07] [INFO ] Computed 64 place invariants in 7 ms
[2021-05-09 07:18:07] [INFO ] Dead Transitions using invariants and state equation in 145 ms returned []
Finished structural reductions, in 1 iterations. Remains : 317/330 places, 289/302 transitions.
Stuttering acceptance computed with spot in 93 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : BusinessProcesses-PT-09-07 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 (NOT p2)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=p2, acceptance={} source=2 dest: 2}]], initial=2, aps=[p0:(NEQ s249 0), p1:(NEQ s249 1), p2:(NEQ s193 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 1045 reset in 238 ms.
Stack based approach found an accepted trace after 620 steps with 7 reset with depth 5 and stack size 5 in 2 ms.
FORMULA BusinessProcesses-PT-09-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-09-07 finished in 1004 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 330 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 330/330 places, 302/302 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 322 transition count 294
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 322 transition count 294
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 20 place count 318 transition count 290
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 318 transition count 290
Applied a total of 24 rules in 32 ms. Remains 318 /330 variables (removed 12) and now considering 290/302 (removed 12) transitions.
// Phase 1: matrix 290 rows 318 cols
[2021-05-09 07:18:07] [INFO ] Computed 64 place invariants in 5 ms
[2021-05-09 07:18:07] [INFO ] Implicit Places using invariants in 147 ms returned []
// Phase 1: matrix 290 rows 318 cols
[2021-05-09 07:18:07] [INFO ] Computed 64 place invariants in 2 ms
[2021-05-09 07:18:08] [INFO ] Implicit Places using invariants and state equation in 354 ms returned []
Implicit Place search using SMT with State Equation took 505 ms to find 0 implicit places.
// Phase 1: matrix 290 rows 318 cols
[2021-05-09 07:18:08] [INFO ] Computed 64 place invariants in 1 ms
[2021-05-09 07:18:08] [INFO ] Dead Transitions using invariants and state equation in 199 ms returned []
Finished structural reductions, in 1 iterations. Remains : 318/330 places, 290/302 transitions.
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-09-09 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s280 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 89 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-09-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-09-09 finished in 855 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((p0||G(p1))))], workingDir=/home/mcc/execution]
Support contains 4 out of 330 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 330/330 places, 302/302 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 329 transition count 271
Reduce places removed 30 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 32 rules applied. Total rules applied 62 place count 299 transition count 269
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 64 place count 297 transition count 269
Performed 71 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 71 Pre rules applied. Total rules applied 64 place count 297 transition count 198
Deduced a syphon composed of 71 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 3 with 151 rules applied. Total rules applied 215 place count 217 transition count 198
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 223 place count 209 transition count 190
Iterating global reduction 3 with 8 rules applied. Total rules applied 231 place count 209 transition count 190
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 3 with 163 rules applied. Total rules applied 394 place count 126 transition count 110
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 395 place count 126 transition count 109
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 397 place count 125 transition count 112
Applied a total of 397 rules in 39 ms. Remains 125 /330 variables (removed 205) and now considering 112/302 (removed 190) transitions.
// Phase 1: matrix 112 rows 125 cols
[2021-05-09 07:18:08] [INFO ] Computed 52 place invariants in 1 ms
[2021-05-09 07:18:08] [INFO ] Implicit Places using invariants in 114 ms returned [38, 39, 40, 41, 45, 46, 47, 99]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 115 ms to find 8 implicit places.
[2021-05-09 07:18:08] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 112 rows 117 cols
[2021-05-09 07:18:08] [INFO ] Computed 44 place invariants in 1 ms
[2021-05-09 07:18:08] [INFO ] Dead Transitions using invariants and state equation in 139 ms returned []
Starting structural reductions, iteration 1 : 117/330 places, 112/302 transitions.
Applied a total of 0 rules in 4 ms. Remains 117 /117 variables (removed 0) and now considering 112/112 (removed 0) transitions.
[2021-05-09 07:18:08] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 112 rows 117 cols
[2021-05-09 07:18:08] [INFO ] Computed 44 place invariants in 2 ms
[2021-05-09 07:18:09] [INFO ] Dead Transitions using invariants and state equation in 79 ms returned []
Finished structural reductions, in 2 iterations. Remains : 117/330 places, 112/302 transitions.
Stuttering acceptance computed with spot in 33 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-09-10 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}]], initial=0, aps=[p1:(AND (EQ s12 1) (EQ s63 1) (EQ s94 1)), p0:(EQ s39 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-09-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-09-10 finished in 440 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 3 out of 330 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 330/330 places, 302/302 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 322 transition count 294
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 322 transition count 294
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 19 place count 319 transition count 291
Iterating global reduction 0 with 3 rules applied. Total rules applied 22 place count 319 transition count 291
Applied a total of 22 rules in 19 ms. Remains 319 /330 variables (removed 11) and now considering 291/302 (removed 11) transitions.
// Phase 1: matrix 291 rows 319 cols
[2021-05-09 07:18:09] [INFO ] Computed 64 place invariants in 2 ms
[2021-05-09 07:18:09] [INFO ] Implicit Places using invariants in 112 ms returned []
// Phase 1: matrix 291 rows 319 cols
[2021-05-09 07:18:09] [INFO ] Computed 64 place invariants in 7 ms
[2021-05-09 07:18:09] [INFO ] Implicit Places using invariants and state equation in 333 ms returned []
Implicit Place search using SMT with State Equation took 446 ms to find 0 implicit places.
// Phase 1: matrix 291 rows 319 cols
[2021-05-09 07:18:09] [INFO ] Computed 64 place invariants in 9 ms
[2021-05-09 07:18:09] [INFO ] Dead Transitions using invariants and state equation in 184 ms returned []
Finished structural reductions, in 1 iterations. Remains : 319/330 places, 291/302 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-09-11 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s244 1) (AND (EQ s246 0) (EQ s237 0)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 226 ms.
Product exploration explored 100000 steps with 50000 reset in 241 ms.
Graph (complete) has 750 edges and 319 vertex of which 318 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 50000 reset in 228 ms.
Product exploration explored 100000 steps with 50000 reset in 236 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Support contains 3 out of 319 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 319/319 places, 291/291 transitions.
Graph (trivial) has 137 edges and 319 vertex of which 4 / 319 are part of one of the 1 SCC in 0 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 29 rules applied. Total rules applied 30 place count 316 transition count 288
Performed 66 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 66 Pre rules applied. Total rules applied 30 place count 316 transition count 438
Deduced a syphon composed of 95 places in 1 ms
Iterating global reduction 1 with 66 rules applied. Total rules applied 96 place count 316 transition count 438
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 106 place count 306 transition count 401
Deduced a syphon composed of 85 places in 1 ms
Iterating global reduction 1 with 10 rules applied. Total rules applied 116 place count 306 transition count 401
Performed 81 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 166 places in 0 ms
Iterating global reduction 1 with 81 rules applied. Total rules applied 197 place count 306 transition count 401
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 217 place count 286 transition count 381
Deduced a syphon composed of 146 places in 0 ms
Iterating global reduction 1 with 20 rules applied. Total rules applied 237 place count 286 transition count 381
Deduced a syphon composed of 146 places in 0 ms
Applied a total of 237 rules in 61 ms. Remains 286 /319 variables (removed 33) and now considering 381/291 (removed -90) transitions.
[2021-05-09 07:18:11] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 381 rows 286 cols
[2021-05-09 07:18:11] [INFO ] Computed 64 place invariants in 5 ms
[2021-05-09 07:18:11] [INFO ] Dead Transitions using invariants and state equation in 238 ms returned []
Finished structural reductions, in 1 iterations. Remains : 286/319 places, 381/291 transitions.
Product exploration explored 100000 steps with 50000 reset in 1106 ms.
Product exploration explored 100000 steps with 50000 reset in 970 ms.
[2021-05-09 07:18:13] [INFO ] Flatten gal took : 14 ms
[2021-05-09 07:18:13] [INFO ] Flatten gal took : 13 ms
[2021-05-09 07:18:13] [INFO ] Time to serialize gal into /tmp/LTL18056995428304329508.gal : 2 ms
[2021-05-09 07:18:13] [INFO ] Time to serialize properties into /tmp/LTL4893930345064830188.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL18056995428304329508.gal, -t, CGAL, -LTL, /tmp/LTL4893930345064830188.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL18056995428304329508.gal -t CGAL -LTL /tmp/LTL4893930345064830188.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F("((p282==1)||((p285==0)&&(p272==0)))"))))
Formula 0 simplified : !XF"((p282==1)||((p285==0)&&(p272==0)))"
Detected timeout of ITS tools.
[2021-05-09 07:18:28] [INFO ] Flatten gal took : 17 ms
[2021-05-09 07:18:28] [INFO ] Applying decomposition
[2021-05-09 07:18:28] [INFO ] Flatten gal took : 14 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph13273007962920090025.txt, -o, /tmp/graph13273007962920090025.bin, -w, /tmp/graph13273007962920090025.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph13273007962920090025.bin, -l, -1, -v, -w, /tmp/graph13273007962920090025.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 07:18:28] [INFO ] Decomposing Gal with order
[2021-05-09 07:18:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 07:18:28] [INFO ] Removed a total of 225 redundant transitions.
[2021-05-09 07:18:28] [INFO ] Flatten gal took : 25 ms
[2021-05-09 07:18:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2021-05-09 07:18:28] [INFO ] Time to serialize gal into /tmp/LTL15868138964230198173.gal : 5 ms
[2021-05-09 07:18:28] [INFO ] Time to serialize properties into /tmp/LTL5963580229376941709.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL15868138964230198173.gal, -t, CGAL, -LTL, /tmp/LTL5963580229376941709.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL15868138964230198173.gal -t CGAL -LTL /tmp/LTL5963580229376941709.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(F("((i13.u82.p282==1)||((i13.u83.p285==0)&&(i0.i0.u81.p272==0)))"))))
Formula 0 simplified : !XF"((i13.u82.p282==1)||((i13.u83.p285==0)&&(i0.i0.u81.p272==0)))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17219153255602360378
[2021-05-09 07:18:43] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17219153255602360378
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin17219153255602360378]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin17219153255602360378] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin17219153255602360378] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property BusinessProcesses-PT-09-11 finished in 35700 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((p0 U p1)||X(p1)))], workingDir=/home/mcc/execution]
Support contains 2 out of 330 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 330/330 places, 302/302 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 321 transition count 293
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 321 transition count 293
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 22 place count 317 transition count 289
Iterating global reduction 0 with 4 rules applied. Total rules applied 26 place count 317 transition count 289
Applied a total of 26 rules in 26 ms. Remains 317 /330 variables (removed 13) and now considering 289/302 (removed 13) transitions.
// Phase 1: matrix 289 rows 317 cols
[2021-05-09 07:18:44] [INFO ] Computed 64 place invariants in 4 ms
[2021-05-09 07:18:44] [INFO ] Implicit Places using invariants in 161 ms returned []
// Phase 1: matrix 289 rows 317 cols
[2021-05-09 07:18:44] [INFO ] Computed 64 place invariants in 3 ms
[2021-05-09 07:18:45] [INFO ] Implicit Places using invariants and state equation in 312 ms returned []
Implicit Place search using SMT with State Equation took 475 ms to find 0 implicit places.
// Phase 1: matrix 289 rows 317 cols
[2021-05-09 07:18:45] [INFO ] Computed 64 place invariants in 4 ms
[2021-05-09 07:18:45] [INFO ] Dead Transitions using invariants and state equation in 201 ms returned []
Finished structural reductions, in 1 iterations. Remains : 317/330 places, 289/302 transitions.
Stuttering acceptance computed with spot in 149 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-09-12 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p1:(EQ s7 1), p0:(EQ s148 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, 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 0 ms.
FORMULA BusinessProcesses-PT-09-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-09-12 finished in 876 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G(p0))))], workingDir=/home/mcc/execution]
Support contains 1 out of 330 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 330/330 places, 302/302 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 322 transition count 294
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 322 transition count 294
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 19 place count 319 transition count 291
Iterating global reduction 0 with 3 rules applied. Total rules applied 22 place count 319 transition count 291
Applied a total of 22 rules in 19 ms. Remains 319 /330 variables (removed 11) and now considering 291/302 (removed 11) transitions.
// Phase 1: matrix 291 rows 319 cols
[2021-05-09 07:18:45] [INFO ] Computed 64 place invariants in 4 ms
[2021-05-09 07:18:45] [INFO ] Implicit Places using invariants in 121 ms returned []
// Phase 1: matrix 291 rows 319 cols
[2021-05-09 07:18:45] [INFO ] Computed 64 place invariants in 3 ms
[2021-05-09 07:18:46] [INFO ] Implicit Places using invariants and state equation in 279 ms returned []
Implicit Place search using SMT with State Equation took 402 ms to find 0 implicit places.
// Phase 1: matrix 291 rows 319 cols
[2021-05-09 07:18:46] [INFO ] Computed 64 place invariants in 10 ms
[2021-05-09 07:18:46] [INFO ] Dead Transitions using invariants and state equation in 199 ms returned []
Finished structural reductions, in 1 iterations. Remains : 319/330 places, 291/302 transitions.
Stuttering acceptance computed with spot in 100 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-09-13 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(EQ s242 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1286 steps with 11 reset in 4 ms.
FORMULA BusinessProcesses-PT-09-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-09-13 finished in 741 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((!p0||G(p0))))], workingDir=/home/mcc/execution]
Support contains 3 out of 330 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 330/330 places, 302/302 transitions.
Graph (trivial) has 150 edges and 330 vertex of which 6 / 330 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 34 place count 324 transition count 262
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 67 place count 291 transition count 262
Performed 67 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 67 Pre rules applied. Total rules applied 67 place count 291 transition count 195
Deduced a syphon composed of 67 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 211 place count 214 transition count 195
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 219 place count 206 transition count 187
Iterating global reduction 2 with 8 rules applied. Total rules applied 227 place count 206 transition count 187
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 2 with 162 rules applied. Total rules applied 389 place count 124 transition count 107
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 391 place count 123 transition count 110
Applied a total of 391 rules in 27 ms. Remains 123 /330 variables (removed 207) and now considering 110/302 (removed 192) transitions.
// Phase 1: matrix 110 rows 123 cols
[2021-05-09 07:18:46] [INFO ] Computed 52 place invariants in 1 ms
[2021-05-09 07:18:46] [INFO ] Implicit Places using invariants in 94 ms returned [1, 2, 5, 13, 38, 39, 40, 41, 42, 43, 44]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 96 ms to find 11 implicit places.
[2021-05-09 07:18:46] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 110 rows 112 cols
[2021-05-09 07:18:46] [INFO ] Computed 41 place invariants in 1 ms
[2021-05-09 07:18:46] [INFO ] Dead Transitions using invariants and state equation in 69 ms returned []
Starting structural reductions, iteration 1 : 112/330 places, 110/302 transitions.
Applied a total of 0 rules in 5 ms. Remains 112 /112 variables (removed 0) and now considering 110/110 (removed 0) transitions.
[2021-05-09 07:18:46] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 110 rows 112 cols
[2021-05-09 07:18:46] [INFO ] Computed 41 place invariants in 3 ms
[2021-05-09 07:18:46] [INFO ] Dead Transitions using invariants and state equation in 77 ms returned []
Finished structural reductions, in 2 iterations. Remains : 112/330 places, 110/302 transitions.
Stuttering acceptance computed with spot in 86 ms :[false, (NOT p0), true]
Running random walk in product with property : BusinessProcesses-PT-09-14 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (NEQ s2 1) (NEQ s39 1) (NEQ s77 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 606 steps with 105 reset in 6 ms.
FORMULA BusinessProcesses-PT-09-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-09-14 finished in 394 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 330 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 330/330 places, 302/302 transitions.
Graph (trivial) has 153 edges and 330 vertex of which 6 / 330 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.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 36 place count 324 transition count 260
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 71 place count 289 transition count 260
Performed 68 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 68 Pre rules applied. Total rules applied 71 place count 289 transition count 192
Deduced a syphon composed of 68 places in 1 ms
Ensure Unique test removed 10 places
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 2 with 146 rules applied. Total rules applied 217 place count 211 transition count 192
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 224 place count 204 transition count 185
Iterating global reduction 2 with 7 rules applied. Total rules applied 231 place count 204 transition count 185
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 2 with 163 rules applied. Total rules applied 394 place count 121 transition count 105
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 396 place count 120 transition count 108
Applied a total of 396 rules in 25 ms. Remains 120 /330 variables (removed 210) and now considering 108/302 (removed 194) transitions.
// Phase 1: matrix 108 rows 120 cols
[2021-05-09 07:18:46] [INFO ] Computed 51 place invariants in 2 ms
[2021-05-09 07:18:46] [INFO ] Implicit Places using invariants in 100 ms returned [1, 2, 3, 11, 36, 37, 38, 39, 40, 41, 42]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 101 ms to find 11 implicit places.
[2021-05-09 07:18:46] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 108 rows 109 cols
[2021-05-09 07:18:46] [INFO ] Computed 40 place invariants in 8 ms
[2021-05-09 07:18:46] [INFO ] Dead Transitions using invariants and state equation in 66 ms returned []
Starting structural reductions, iteration 1 : 109/330 places, 108/302 transitions.
Applied a total of 0 rules in 5 ms. Remains 109 /109 variables (removed 0) and now considering 108/108 (removed 0) transitions.
[2021-05-09 07:18:46] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 108 rows 109 cols
[2021-05-09 07:18:46] [INFO ] Computed 40 place invariants in 2 ms
[2021-05-09 07:18:47] [INFO ] Dead Transitions using invariants and state equation in 74 ms returned []
Finished structural reductions, in 2 iterations. Remains : 109/330 places, 108/302 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-09-15 automaton TGBA [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:(EQ s75 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 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-09-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-09-15 finished in 378 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin17674298980946317545
[2021-05-09 07:18:47] [INFO ] Applying decomposition
[2021-05-09 07:18:47] [INFO ] Computing symmetric may disable matrix : 302 transitions.
[2021-05-09 07:18:47] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-09 07:18:47] [INFO ] Computing symmetric may enable matrix : 302 transitions.
[2021-05-09 07:18:47] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-09 07:18:47] [INFO ] Flatten gal took : 19 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph10454738397696515748.txt, -o, /tmp/graph10454738397696515748.bin, -w, /tmp/graph10454738397696515748.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph10454738397696515748.bin, -l, -1, -v, -w, /tmp/graph10454738397696515748.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 07:18:47] [INFO ] Computing Do-Not-Accords matrix : 302 transitions.
[2021-05-09 07:18:47] [INFO ] Decomposing Gal with order
[2021-05-09 07:18:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 07:18:47] [INFO ] Computation of Completed DNA matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-09 07:18:47] [INFO ] Built C files in 99ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17674298980946317545
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin17674298980946317545]
[2021-05-09 07:18:47] [INFO ] Removed a total of 222 redundant transitions.
[2021-05-09 07:18:47] [INFO ] Flatten gal took : 29 ms
[2021-05-09 07:18:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2021-05-09 07:18:47] [INFO ] Time to serialize gal into /tmp/LTLFireability18382530087676525341.gal : 4 ms
[2021-05-09 07:18:47] [INFO ] Time to serialize properties into /tmp/LTLFireability17578985976288528593.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLFireability18382530087676525341.gal, -t, CGAL, -LTL, /tmp/LTLFireability17578985976288528593.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireability18382530087676525341.gal -t CGAL -LTL /tmp/LTLFireability17578985976288528593.ltl -c -stutter-deadlock
Read 2 LTL properties
Checking formula 0 : !((X(G(("(i5.u25.p74==1)")||(X(("(i0.i1.u54.p163!=1)")||(X("(i8.i1.u60.p177!=1)"))))))))
Formula 0 simplified : !XG("(i5.u25.p74==1)" | X("(i0.i1.u54.p163!=1)" | X"(i8.i1.u60.p177!=1)"))
Compilation finished in 1753 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin17674298980946317545]
Link finished in 88 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X([](((LTLAPp0==true)||X(((LTLAPp1==true)||X((LTLAPp2==true))))))), --buchi-type=spotba], workingDir=/tmp/ltsmin17674298980946317545]
Reverse transition relation is NOT exact ! Due to transitions t2, t4, t7, t8, t9, t10, t179, t203, t229, t245, t249, t255, t265, t293, t297, t354, t355, t357, t364, t366, t369, i0.i0.u80.t108, i0.i1.u52.t182, i0.i1.u54.t178, i0.i2.u56.t175, i0.i3.t105, i0.i3.u81.t106, i1.u44.t198, i1.u46.t194, i2.u16.t254, i3.t261, i3.u9.t269, i3.u10.t268, i3.u11.t264, i4.i0.u13.t260, i5.t244, i6.u48.t190, i6.u50.t186, i7.u76.t124, i7.u77.t120, i8.i0.u20.t248, i8.i1.u73.t136, i8.i1.u74.t132, i9.u42.t202, i9.u70.t148, i9.u71.t144, i9.u72.t140, i10.u67.t160, i10.u68.t156, i10.u69.t152, i11.u7.t273, i11.u64.t171, i11.u65.t168, i11.u66.t164, i12.i0.u75.t128, i12.i1.u78.t116, i13.i0.t5, i13.i0.u26.t209, i13.i0.u26.t222, i13.i0.u26.t228, i13.i0.u79.t112, i14.t99, i14.t92, i14.t23, i14.t6, i14.u83.t13, i14.u83.t16, i14.u83.t70, i14.u83.t86, i15.t78, i15.u89.t82, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :36/195/71/302
Computing Next relation with stutter on 301440 deadlock states
4 unique states visited
0 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
2498 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,25.0419,554244,1,0,1.13458e+06,980,5637,1.55042e+06,327,4154,2322122
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA BusinessProcesses-PT-09-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((X(F("(((i14.u86.p285==0)&&(i0.i3.u82.p272==0))||(i14.u85.p282==1))"))))
Formula 1 simplified : !XF"(((i14.u86.p285==0)&&(i0.i3.u82.p272==0))||(i14.u85.p282==1))"
Computing Next relation with stutter on 301440 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,25.0441,554568,1,0,1.13458e+06,980,5668,1.55042e+06,328,4154,2322161
no accepting run found
Formula 1 is TRUE no accepting run found.
FORMULA BusinessProcesses-PT-09-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.

BK_STOP 1620544790547

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLFireability -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=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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-09"
export BK_EXAMINATION="LTLFireability"
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-09, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r026-tajo-162038143800389"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-09.tgz
mv BusinessProcesses-PT-09 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;