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-162038143800373.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-07, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r026-tajo-162038143800373
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 15K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 141K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.8K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 92K 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.1K Mar 28 15:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 15:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 23 03:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 23 03:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 22 12:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 11K 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.8K 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 100K 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-07-00
FORMULA_NAME BusinessProcesses-PT-07-01
FORMULA_NAME BusinessProcesses-PT-07-02
FORMULA_NAME BusinessProcesses-PT-07-03
FORMULA_NAME BusinessProcesses-PT-07-04
FORMULA_NAME BusinessProcesses-PT-07-05
FORMULA_NAME BusinessProcesses-PT-07-06
FORMULA_NAME BusinessProcesses-PT-07-07
FORMULA_NAME BusinessProcesses-PT-07-08
FORMULA_NAME BusinessProcesses-PT-07-09
FORMULA_NAME BusinessProcesses-PT-07-10
FORMULA_NAME BusinessProcesses-PT-07-11
FORMULA_NAME BusinessProcesses-PT-07-12
FORMULA_NAME BusinessProcesses-PT-07-13
FORMULA_NAME BusinessProcesses-PT-07-14
FORMULA_NAME BusinessProcesses-PT-07-15

=== Now, execution of the tool begins

BK_START 1620543512050

Running Version 0
[2021-05-09 06:58:33] [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 06:58:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 06:58:33] [INFO ] Load time of PNML (sax parser for PT used): 60 ms
[2021-05-09 06:58:33] [INFO ] Transformed 386 places.
[2021-05-09 06:58:33] [INFO ] Transformed 360 transitions.
[2021-05-09 06:58:33] [INFO ] Found NUPN structural information;
[2021-05-09 06:58:33] [INFO ] Parsed PT model containing 386 places and 360 transitions in 103 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Support contains 48 out of 386 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 386/386 places, 360/360 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 385 transition count 360
Discarding 52 places :
Symmetric choice reduction at 1 with 52 rule applications. Total rules 53 place count 333 transition count 308
Iterating global reduction 1 with 52 rules applied. Total rules applied 105 place count 333 transition count 308
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 126 place count 312 transition count 287
Iterating global reduction 1 with 21 rules applied. Total rules applied 147 place count 312 transition count 287
Applied a total of 147 rules in 87 ms. Remains 312 /386 variables (removed 74) and now considering 287/360 (removed 73) transitions.
// Phase 1: matrix 287 rows 312 cols
[2021-05-09 06:58:34] [INFO ] Computed 61 place invariants in 18 ms
[2021-05-09 06:58:34] [INFO ] Implicit Places using invariants in 238 ms returned []
// Phase 1: matrix 287 rows 312 cols
[2021-05-09 06:58:34] [INFO ] Computed 61 place invariants in 16 ms
[2021-05-09 06:58:34] [INFO ] Implicit Places using invariants and state equation in 251 ms returned []
Implicit Place search using SMT with State Equation took 518 ms to find 0 implicit places.
// Phase 1: matrix 287 rows 312 cols
[2021-05-09 06:58:34] [INFO ] Computed 61 place invariants in 3 ms
[2021-05-09 06:58:34] [INFO ] Dead Transitions using invariants and state equation in 153 ms returned []
Finished structural reductions, in 1 iterations. Remains : 312/386 places, 287/360 transitions.
[2021-05-09 06:58:34] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-05-09 06:58:34] [INFO ] Flatten gal took : 48 ms
FORMULA BusinessProcesses-PT-07-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-09 06:58:34] [INFO ] Flatten gal took : 22 ms
[2021-05-09 06:58:34] [INFO ] Input system was already deterministic with 287 transitions.
Incomplete random walk after 100000 steps, including 1106 resets, run finished after 205 ms. (steps per millisecond=487 ) properties (out of 32) seen :25
Running SMT prover for 7 properties.
// Phase 1: matrix 287 rows 312 cols
[2021-05-09 06:58:35] [INFO ] Computed 61 place invariants in 6 ms
[2021-05-09 06:58:35] [INFO ] [Real]Absence check using 32 positive place invariants in 11 ms returned sat
[2021-05-09 06:58:35] [INFO ] [Real]Absence check using 32 positive and 29 generalized place invariants in 9 ms returned sat
[2021-05-09 06:58:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 06:58:35] [INFO ] [Real]Absence check using state equation in 79 ms returned unsat
[2021-05-09 06:58:35] [INFO ] [Real]Absence check using 32 positive place invariants in 8 ms returned sat
[2021-05-09 06:58:35] [INFO ] [Real]Absence check using 32 positive and 29 generalized place invariants in 2 ms returned unsat
[2021-05-09 06:58:35] [INFO ] [Real]Absence check using 32 positive place invariants in 7 ms returned sat
[2021-05-09 06:58:35] [INFO ] [Real]Absence check using 32 positive and 29 generalized place invariants in 4 ms returned unsat
[2021-05-09 06:58:35] [INFO ] [Real]Absence check using 32 positive place invariants in 8 ms returned sat
[2021-05-09 06:58:35] [INFO ] [Real]Absence check using 32 positive and 29 generalized place invariants in 2 ms returned unsat
[2021-05-09 06:58:35] [INFO ] [Real]Absence check using 32 positive place invariants in 9 ms returned sat
[2021-05-09 06:58:35] [INFO ] [Real]Absence check using 32 positive and 29 generalized place invariants in 7 ms returned sat
[2021-05-09 06:58:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 06:58:35] [INFO ] [Real]Absence check using state equation in 82 ms returned sat
[2021-05-09 06:58:35] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 06:58:35] [INFO ] [Nat]Absence check using 32 positive place invariants in 8 ms returned sat
[2021-05-09 06:58:35] [INFO ] [Nat]Absence check using 32 positive and 29 generalized place invariants in 9 ms returned sat
[2021-05-09 06:58:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 06:58:35] [INFO ] [Nat]Absence check using state equation in 79 ms returned sat
[2021-05-09 06:58:35] [INFO ] Deduced a trap composed of 39 places in 107 ms of which 3 ms to minimize.
[2021-05-09 06:58:36] [INFO ] Deduced a trap composed of 8 places in 86 ms of which 1 ms to minimize.
[2021-05-09 06:58:36] [INFO ] Deduced a trap composed of 12 places in 86 ms of which 1 ms to minimize.
[2021-05-09 06:58:36] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 0 ms to minimize.
[2021-05-09 06:58:36] [INFO ] Deduced a trap composed of 46 places in 50 ms of which 0 ms to minimize.
[2021-05-09 06:58:36] [INFO ] Deduced a trap composed of 38 places in 44 ms of which 0 ms to minimize.
[2021-05-09 06:58:36] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 546 ms
[2021-05-09 06:58:36] [INFO ] Computed and/alt/rep : 281/591/281 causal constraints (skipped 5 transitions) in 21 ms.
[2021-05-09 06:58:36] [INFO ] Added : 135 causal constraints over 27 iterations in 417 ms. Result :unsat
[2021-05-09 06:58:36] [INFO ] [Real]Absence check using 32 positive place invariants in 8 ms returned sat
[2021-05-09 06:58:36] [INFO ] [Real]Absence check using 32 positive and 29 generalized place invariants in 6 ms returned unsat
[2021-05-09 06:58:36] [INFO ] [Real]Absence check using 32 positive place invariants in 7 ms returned sat
[2021-05-09 06:58:36] [INFO ] [Real]Absence check using 32 positive and 29 generalized place invariants in 9 ms returned sat
[2021-05-09 06:58:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 06:58:36] [INFO ] [Real]Absence check using state equation in 76 ms returned unsat
Successfully simplified 7 atomic propositions for a total of 15 simplifications.
[2021-05-09 06:58:36] [INFO ] Initial state test concluded for 2 properties.
FORMULA BusinessProcesses-PT-07-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-07-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((G(p0) U X((p1||X(p2)))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 312 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 312/312 places, 287/287 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 306 transition count 281
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 306 transition count 281
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 304 transition count 279
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 304 transition count 279
Applied a total of 16 rules in 25 ms. Remains 304 /312 variables (removed 8) and now considering 279/287 (removed 8) transitions.
// Phase 1: matrix 279 rows 304 cols
[2021-05-09 06:58:37] [INFO ] Computed 61 place invariants in 7 ms
[2021-05-09 06:58:37] [INFO ] Implicit Places using invariants in 99 ms returned []
// Phase 1: matrix 279 rows 304 cols
[2021-05-09 06:58:37] [INFO ] Computed 61 place invariants in 3 ms
[2021-05-09 06:58:37] [INFO ] Implicit Places using invariants and state equation in 260 ms returned []
Implicit Place search using SMT with State Equation took 362 ms to find 0 implicit places.
// Phase 1: matrix 279 rows 304 cols
[2021-05-09 06:58:37] [INFO ] Computed 61 place invariants in 7 ms
[2021-05-09 06:58:37] [INFO ] Dead Transitions using invariants and state equation in 123 ms returned []
Finished structural reductions, in 1 iterations. Remains : 304/312 places, 279/287 transitions.
Stuttering acceptance computed with spot in 480 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), true, (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-07-00 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 7}], [{ cond=(NOT p2), acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=7 dest: 6}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=7 dest: 7}, { cond=(AND p0 (NOT p2)), acceptance={0} source=7 dest: 8}], [{ cond=(NOT p0), acceptance={} source=8 dest: 6}, { cond=p0, acceptance={} source=8 dest: 8}]], initial=0, aps=[p0:(EQ s146 1), p1:(EQ s137 1), p2:(EQ s266 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-07-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-07-00 finished in 1045 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 312 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 312/312 places, 287/287 transitions.
Graph (trivial) has 141 edges and 312 vertex of which 6 / 312 are part of one of the 1 SCC in 3 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 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 31 place count 306 transition count 250
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 61 place count 276 transition count 250
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 65 Pre rules applied. Total rules applied 61 place count 276 transition count 185
Deduced a syphon composed of 65 places in 1 ms
Ensure Unique test removed 9 places
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 2 with 139 rules applied. Total rules applied 200 place count 202 transition count 185
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 206 place count 196 transition count 179
Iterating global reduction 2 with 6 rules applied. Total rules applied 212 place count 196 transition count 179
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 2 with 153 rules applied. Total rules applied 365 place count 118 transition count 104
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 367 place count 117 transition count 107
Applied a total of 367 rules in 60 ms. Remains 117 /312 variables (removed 195) and now considering 107/287 (removed 180) transitions.
// Phase 1: matrix 107 rows 117 cols
[2021-05-09 06:58:38] [INFO ] Computed 49 place invariants in 1 ms
[2021-05-09 06:58:38] [INFO ] Implicit Places using invariants in 82 ms returned [1, 2, 10, 35, 36, 37, 38, 39, 40, 41]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 85 ms to find 10 implicit places.
[2021-05-09 06:58:38] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 107 rows 107 cols
[2021-05-09 06:58:38] [INFO ] Computed 39 place invariants in 2 ms
[2021-05-09 06:58:38] [INFO ] Dead Transitions using invariants and state equation in 49 ms returned []
Starting structural reductions, iteration 1 : 107/312 places, 107/287 transitions.
Applied a total of 0 rules in 6 ms. Remains 107 /107 variables (removed 0) and now considering 107/107 (removed 0) transitions.
[2021-05-09 06:58:38] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 107 rows 107 cols
[2021-05-09 06:58:38] [INFO ] Computed 39 place invariants in 4 ms
[2021-05-09 06:58:38] [INFO ] Dead Transitions using invariants and state equation in 64 ms returned []
Finished structural reductions, in 2 iterations. Remains : 107/312 places, 107/287 transitions.
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-07-01 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 s76 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-07-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-07-01 finished in 359 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(p0))], workingDir=/home/mcc/execution]
Support contains 1 out of 312 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 312/312 places, 287/287 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 305 transition count 280
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 305 transition count 280
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 303 transition count 278
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 303 transition count 278
Applied a total of 18 rules in 12 ms. Remains 303 /312 variables (removed 9) and now considering 278/287 (removed 9) transitions.
// Phase 1: matrix 278 rows 303 cols
[2021-05-09 06:58:38] [INFO ] Computed 61 place invariants in 2 ms
[2021-05-09 06:58:38] [INFO ] Implicit Places using invariants in 122 ms returned []
// Phase 1: matrix 278 rows 303 cols
[2021-05-09 06:58:38] [INFO ] Computed 61 place invariants in 5 ms
[2021-05-09 06:58:38] [INFO ] Implicit Places using invariants and state equation in 257 ms returned []
Implicit Place search using SMT with State Equation took 380 ms to find 0 implicit places.
// Phase 1: matrix 278 rows 303 cols
[2021-05-09 06:58:38] [INFO ] Computed 61 place invariants in 12 ms
[2021-05-09 06:58:38] [INFO ] Dead Transitions using invariants and state equation in 130 ms returned []
Finished structural reductions, in 1 iterations. Remains : 303/312 places, 278/287 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : BusinessProcesses-PT-07-02 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s209 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-07-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-07-02 finished in 608 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0||(F(p1)&&G(!p2)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 312 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 312/312 places, 287/287 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 306 transition count 281
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 306 transition count 281
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 304 transition count 279
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 304 transition count 279
Applied a total of 16 rules in 10 ms. Remains 304 /312 variables (removed 8) and now considering 279/287 (removed 8) transitions.
// Phase 1: matrix 279 rows 304 cols
[2021-05-09 06:58:39] [INFO ] Computed 61 place invariants in 3 ms
[2021-05-09 06:58:39] [INFO ] Implicit Places using invariants in 128 ms returned []
// Phase 1: matrix 279 rows 304 cols
[2021-05-09 06:58:39] [INFO ] Computed 61 place invariants in 3 ms
[2021-05-09 06:58:39] [INFO ] Implicit Places using invariants and state equation in 299 ms returned []
Implicit Place search using SMT with State Equation took 430 ms to find 0 implicit places.
// Phase 1: matrix 279 rows 304 cols
[2021-05-09 06:58:39] [INFO ] Computed 61 place invariants in 7 ms
[2021-05-09 06:58:39] [INFO ] Dead Transitions using invariants and state equation in 151 ms returned []
Finished structural reductions, in 1 iterations. Remains : 304/312 places, 279/287 transitions.
Stuttering acceptance computed with spot in 150 ms :[p2, (OR (NOT p1) p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), true]
Running random walk in product with property : BusinessProcesses-PT-07-04 automaton TGBA [mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 0}, { cond=p2, acceptance={} source=0 dest: 4}], [{ cond=(AND p1 (NOT p2)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=p2, acceptance={0} source=1 dest: 4}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p2:(EQ s266 1), p1:(EQ s285 1), p0:(EQ s50 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, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 94 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-07-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-07-04 finished in 756 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F((p0&&X(p0)))&&F(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 312 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 312/312 places, 287/287 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 305 transition count 280
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 305 transition count 280
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 303 transition count 278
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 303 transition count 278
Applied a total of 18 rules in 14 ms. Remains 303 /312 variables (removed 9) and now considering 278/287 (removed 9) transitions.
// Phase 1: matrix 278 rows 303 cols
[2021-05-09 06:58:39] [INFO ] Computed 61 place invariants in 3 ms
[2021-05-09 06:58:39] [INFO ] Implicit Places using invariants in 120 ms returned []
// Phase 1: matrix 278 rows 303 cols
[2021-05-09 06:58:39] [INFO ] Computed 61 place invariants in 2 ms
[2021-05-09 06:58:40] [INFO ] Implicit Places using invariants and state equation in 285 ms returned []
Implicit Place search using SMT with State Equation took 408 ms to find 0 implicit places.
// Phase 1: matrix 278 rows 303 cols
[2021-05-09 06:58:40] [INFO ] Computed 61 place invariants in 4 ms
[2021-05-09 06:58:40] [INFO ] Dead Transitions using invariants and state equation in 175 ms returned []
Finished structural reductions, in 1 iterations. Remains : 303/312 places, 278/287 transitions.
Stuttering acceptance computed with spot in 177 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-07-05 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=p0, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 1}]], initial=0, aps=[p0:(NEQ s39 1), p1:(OR (EQ s277 0) (EQ s280 0) (EQ s283 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33356 reset in 372 ms.
Product exploration explored 100000 steps with 33275 reset in 286 ms.
Graph (complete) has 719 edges and 303 vertex of which 302 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Knowledge obtained : [p0, p1]
Stuttering acceptance computed with spot in 142 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0)]
Product exploration explored 100000 steps with 33475 reset in 284 ms.
Product exploration explored 100000 steps with 33287 reset in 245 ms.
Applying partial POR strategy [false, false, true, false]
Stuttering acceptance computed with spot in 127 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0)]
Support contains 4 out of 303 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 303/303 places, 278/278 transitions.
Graph (trivial) has 130 edges and 303 vertex of which 6 / 303 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 298 transition count 272
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 60 Pre rules applied. Total rules applied 27 place count 298 transition count 411
Deduced a syphon composed of 86 places in 0 ms
Iterating global reduction 1 with 60 rules applied. Total rules applied 87 place count 298 transition count 411
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 96 place count 289 transition count 378
Deduced a syphon composed of 77 places in 0 ms
Iterating global reduction 1 with 9 rules applied. Total rules applied 105 place count 289 transition count 378
Performed 79 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 156 places in 0 ms
Iterating global reduction 1 with 79 rules applied. Total rules applied 184 place count 289 transition count 378
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 203 place count 270 transition count 359
Deduced a syphon composed of 137 places in 0 ms
Iterating global reduction 1 with 19 rules applied. Total rules applied 222 place count 270 transition count 359
Deduced a syphon composed of 137 places in 0 ms
Applied a total of 222 rules in 73 ms. Remains 270 /303 variables (removed 33) and now considering 359/278 (removed -81) transitions.
[2021-05-09 06:58:42] [INFO ] Redundant transitions in 22 ms returned []
// Phase 1: matrix 359 rows 270 cols
[2021-05-09 06:58:42] [INFO ] Computed 61 place invariants in 5 ms
[2021-05-09 06:58:42] [INFO ] Dead Transitions using invariants and state equation in 204 ms returned []
Finished structural reductions, in 1 iterations. Remains : 270/303 places, 359/278 transitions.
Product exploration explored 100000 steps with 33187 reset in 300 ms.
Product exploration explored 100000 steps with 33430 reset in 273 ms.
[2021-05-09 06:58:43] [INFO ] Flatten gal took : 16 ms
[2021-05-09 06:58:43] [INFO ] Flatten gal took : 16 ms
[2021-05-09 06:58:43] [INFO ] Time to serialize gal into /tmp/LTL13421161219555350435.gal : 7 ms
[2021-05-09 06:58:43] [INFO ] Time to serialize properties into /tmp/LTL12125913186205006780.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/LTL13421161219555350435.gal, -t, CGAL, -LTL, /tmp/LTL12125913186205006780.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/LTL13421161219555350435.gal -t CGAL -LTL /tmp/LTL12125913186205006780.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G((F(("(p40!=1)")&&(X("(p40!=1)"))))&&(F(G("(((p360==0)||(p363==0))||(p366==0))"))))))
Formula 0 simplified : !G(F("(p40!=1)" & X"(p40!=1)") & FG"(((p360==0)||(p363==0))||(p366==0))")
Detected timeout of ITS tools.
[2021-05-09 06:58:58] [INFO ] Flatten gal took : 18 ms
[2021-05-09 06:58:58] [INFO ] Applying decomposition
[2021-05-09 06:58:58] [INFO ] Flatten gal took : 15 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/graph10880614403352876073.txt, -o, /tmp/graph10880614403352876073.bin, -w, /tmp/graph10880614403352876073.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/graph10880614403352876073.bin, -l, -1, -v, -w, /tmp/graph10880614403352876073.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 06:58:58] [INFO ] Decomposing Gal with order
[2021-05-09 06:58:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 06:58:58] [INFO ] Removed a total of 225 redundant transitions.
[2021-05-09 06:58:58] [INFO ] Flatten gal took : 60 ms
[2021-05-09 06:58:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 9 ms.
[2021-05-09 06:58:58] [INFO ] Time to serialize gal into /tmp/LTL2696784310773537466.gal : 7 ms
[2021-05-09 06:58:58] [INFO ] Time to serialize properties into /tmp/LTL6519528297500414272.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/LTL2696784310773537466.gal, -t, CGAL, -LTL, /tmp/LTL6519528297500414272.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/LTL2696784310773537466.gal -t CGAL -LTL /tmp/LTL6519528297500414272.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((G((F(("(i5.u14.p40!=1)")&&(X("(i5.u14.p40!=1)"))))&&(F(G("(((i16.i0.u99.p360==0)||(i16.i1.u100.p363==0))||(i7.u101.p366==0))"))))))
Formula 0 simplified : !G(F("(i5.u14.p40!=1)" & X"(i5.u14.p40!=1)") & FG"(((i16.i0.u99.p360==0)||(i16.i1.u100.p363==0))||(i7.u101.p366==0))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10838452106161699569
[2021-05-09 06:59:13] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10838452106161699569
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/ltsmin10838452106161699569]
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/ltsmin10838452106161699569] 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/ltsmin10838452106161699569] 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-07-05 finished in 34899 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((p0 U (G(p0)||(p0&&G(p1)&&X(p2)))))], workingDir=/home/mcc/execution]
Support contains 5 out of 312 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 312/312 places, 287/287 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 306 transition count 281
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 306 transition count 281
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 304 transition count 279
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 304 transition count 279
Applied a total of 16 rules in 31 ms. Remains 304 /312 variables (removed 8) and now considering 279/287 (removed 8) transitions.
// Phase 1: matrix 279 rows 304 cols
[2021-05-09 06:59:14] [INFO ] Computed 61 place invariants in 20 ms
[2021-05-09 06:59:14] [INFO ] Implicit Places using invariants in 167 ms returned []
// Phase 1: matrix 279 rows 304 cols
[2021-05-09 06:59:14] [INFO ] Computed 61 place invariants in 2 ms
[2021-05-09 06:59:15] [INFO ] Implicit Places using invariants and state equation in 294 ms returned []
Implicit Place search using SMT with State Equation took 461 ms to find 0 implicit places.
// Phase 1: matrix 279 rows 304 cols
[2021-05-09 06:59:15] [INFO ] Computed 61 place invariants in 5 ms
[2021-05-09 06:59:15] [INFO ] Dead Transitions using invariants and state equation in 175 ms returned []
Finished structural reductions, in 1 iterations. Remains : 304/312 places, 279/287 transitions.
Stuttering acceptance computed with spot in 204 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p1), (AND (NOT p0) (NOT p1)), true]
Running random walk in product with property : BusinessProcesses-PT-07-06 automaton TGBA [mat=[[{ cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 0}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=1 dest: 2}, { cond=(AND p1 p0 p2), acceptance={} source=1 dest: 3}, { cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2))), acceptance={} source=1 dest: 4}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND p1 p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(NEQ s288 1), p0:(NEQ s70 1), p2:(AND (OR (NEQ s76 1) (NEQ s205 1) (NEQ s277 1)) (NEQ s70 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 1108 reset in 248 ms.
Product exploration explored 100000 steps with 1085 reset in 266 ms.
Graph (complete) has 720 edges and 304 vertex of which 303 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Knowledge obtained : [p1, p0, p2]
Stuttering acceptance computed with spot in 182 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p1), (AND (NOT p0) (NOT p1)), true]
Product exploration explored 100000 steps with 1094 reset in 224 ms.
Product exploration explored 100000 steps with 1084 reset in 227 ms.
Applying partial POR strategy [false, false, true, false, true]
Stuttering acceptance computed with spot in 228 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p1), (AND (NOT p0) (NOT p1)), true]
Support contains 5 out of 304 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 304/304 places, 279/279 transitions.
Graph (trivial) has 132 edges and 304 vertex of which 6 / 304 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.
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 27 rules applied. Total rules applied 28 place count 299 transition count 273
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 60 Pre rules applied. Total rules applied 28 place count 299 transition count 400
Deduced a syphon composed of 87 places in 1 ms
Iterating global reduction 1 with 60 rules applied. Total rules applied 88 place count 299 transition count 400
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 97 place count 290 transition count 367
Deduced a syphon composed of 78 places in 0 ms
Iterating global reduction 1 with 9 rules applied. Total rules applied 106 place count 290 transition count 367
Performed 78 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 156 places in 0 ms
Iterating global reduction 1 with 78 rules applied. Total rules applied 184 place count 290 transition count 367
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 203 place count 271 transition count 348
Deduced a syphon composed of 137 places in 0 ms
Iterating global reduction 1 with 19 rules applied. Total rules applied 222 place count 271 transition count 348
Deduced a syphon composed of 137 places in 0 ms
Applied a total of 222 rules in 67 ms. Remains 271 /304 variables (removed 33) and now considering 348/279 (removed -69) transitions.
[2021-05-09 06:59:17] [INFO ] Redundant transitions in 7 ms returned []
// Phase 1: matrix 348 rows 271 cols
[2021-05-09 06:59:17] [INFO ] Computed 61 place invariants in 4 ms
[2021-05-09 06:59:17] [INFO ] Dead Transitions using invariants and state equation in 211 ms returned []
Finished structural reductions, in 1 iterations. Remains : 271/304 places, 348/279 transitions.
Product exploration explored 100000 steps with 1107 reset in 276 ms.
Product exploration explored 100000 steps with 1083 reset in 270 ms.
[2021-05-09 06:59:18] [INFO ] Flatten gal took : 14 ms
[2021-05-09 06:59:18] [INFO ] Flatten gal took : 12 ms
[2021-05-09 06:59:18] [INFO ] Time to serialize gal into /tmp/LTL17112856309351144581.gal : 2 ms
[2021-05-09 06:59:18] [INFO ] Time to serialize properties into /tmp/LTL17328999091328915026.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/LTL17112856309351144581.gal, -t, CGAL, -LTL, /tmp/LTL17328999091328915026.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/LTL17112856309351144581.gal -t CGAL -LTL /tmp/LTL17328999091328915026.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((("(p84!=1)")U((G("(p84!=1)"))||((("(p84!=1)")&&(G("(p370!=1)")))&&(X("((((p92!=1)||(p232!=1))||(p359!=1))&&(p84!=1))"))))))
Formula 0 simplified : !("(p84!=1)" U (G"(p84!=1)" | ("(p84!=1)" & G"(p370!=1)" & X"((((p92!=1)||(p232!=1))||(p359!=1))&&(p84!=1))")))
Detected timeout of ITS tools.
[2021-05-09 06:59:33] [INFO ] Flatten gal took : 13 ms
[2021-05-09 06:59:33] [INFO ] Applying decomposition
[2021-05-09 06:59:33] [INFO ] Flatten gal took : 10 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/graph1365486258767531976.txt, -o, /tmp/graph1365486258767531976.bin, -w, /tmp/graph1365486258767531976.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/graph1365486258767531976.bin, -l, -1, -v, -w, /tmp/graph1365486258767531976.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 06:59:33] [INFO ] Decomposing Gal with order
[2021-05-09 06:59:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 06:59:33] [INFO ] Removed a total of 222 redundant transitions.
[2021-05-09 06:59:33] [INFO ] Flatten gal took : 21 ms
[2021-05-09 06:59:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 4 ms.
[2021-05-09 06:59:33] [INFO ] Time to serialize gal into /tmp/LTL9889582023770092827.gal : 3 ms
[2021-05-09 06:59:33] [INFO ] Time to serialize properties into /tmp/LTL16776237983720075371.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/LTL9889582023770092827.gal, -t, CGAL, -LTL, /tmp/LTL16776237983720075371.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/LTL9889582023770092827.gal -t CGAL -LTL /tmp/LTL16776237983720075371.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((("(i15.i1.u25.p84!=1)")U((G("(i15.i1.u25.p84!=1)"))||((("(i15.i1.u25.p84!=1)")&&(G("(i15.i1.u100.p370!=1)")))&&(X("((((i13.u30.p92!=1)||(i15.i1.u72.p232!=1))||(i15.i0.u85.p359!=1))&&(i15.i1.u25.p84!=1))"))))))
Formula 0 simplified : !("(i15.i1.u25.p84!=1)" U (G"(i15.i1.u25.p84!=1)" | ("(i15.i1.u25.p84!=1)" & G"(i15.i1.u100.p370!=1)" & X"((((i13.u30.p92!=1)||(i15.i1.u72.p232!=1))||(i15.i0.u85.p359!=1))&&(i15.i1.u25.p84!=1))")))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16806983159822207638
[2021-05-09 06:59:48] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16806983159822207638
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/ltsmin16806983159822207638]
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/ltsmin16806983159822207638] 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/ltsmin16806983159822207638] 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-07-06 finished in 34734 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(((p0 U p1)||G(p2))))], workingDir=/home/mcc/execution]
Support contains 4 out of 312 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 312/312 places, 287/287 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 29 place count 311 transition count 257
Reduce places removed 29 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 31 rules applied. Total rules applied 60 place count 282 transition count 255
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 62 place count 280 transition count 255
Performed 66 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 66 Pre rules applied. Total rules applied 62 place count 280 transition count 189
Deduced a syphon composed of 66 places in 1 ms
Ensure Unique test removed 9 places
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 3 with 141 rules applied. Total rules applied 203 place count 205 transition count 189
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 209 place count 199 transition count 183
Iterating global reduction 3 with 6 rules applied. Total rules applied 215 place count 199 transition count 183
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 3 with 155 rules applied. Total rules applied 370 place count 120 transition count 107
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 371 place count 120 transition count 106
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 373 place count 119 transition count 109
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 374 place count 118 transition count 108
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 375 place count 117 transition count 108
Applied a total of 375 rules in 50 ms. Remains 117 /312 variables (removed 195) and now considering 108/287 (removed 179) transitions.
// Phase 1: matrix 108 rows 117 cols
[2021-05-09 06:59:49] [INFO ] Computed 48 place invariants in 2 ms
[2021-05-09 06:59:49] [INFO ] Implicit Places using invariants in 95 ms returned [37, 38, 39, 40, 41, 42]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 97 ms to find 6 implicit places.
[2021-05-09 06:59:49] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 108 rows 111 cols
[2021-05-09 06:59:49] [INFO ] Computed 42 place invariants in 1 ms
[2021-05-09 06:59:49] [INFO ] Dead Transitions using invariants and state equation in 75 ms returned []
Starting structural reductions, iteration 1 : 111/312 places, 108/287 transitions.
Applied a total of 0 rules in 10 ms. Remains 111 /111 variables (removed 0) and now considering 108/108 (removed 0) transitions.
[2021-05-09 06:59:49] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 108 rows 111 cols
[2021-05-09 06:59:49] [INFO ] Computed 42 place invariants in 1 ms
[2021-05-09 06:59:49] [INFO ] Dead Transitions using invariants and state equation in 115 ms returned []
Finished structural reductions, in 2 iterations. Remains : 111/312 places, 108/287 transitions.
Stuttering acceptance computed with spot in 41 ms :[(AND (NOT p2) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-07-07 automaton TGBA [mat=[[{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND p2 (NOT p1)), acceptance={} source=0 dest: 0}]], initial=0, aps=[p2:(EQ s17 0), p1:(AND (EQ s13 1) (EQ s69 1) (EQ s88 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 14784 reset in 211 ms.
Product exploration explored 100000 steps with 14803 reset in 229 ms.
Knowledge obtained : [p2, (NOT p1)]
Stuttering acceptance computed with spot in 40 ms :[(AND (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 14708 reset in 237 ms.
Product exploration explored 100000 steps with 14841 reset in 233 ms.
Starting structural reductions, iteration 0 : 111/111 places, 108/108 transitions.
Graph (trivial) has 6 edges and 111 vertex of which 2 / 111 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 108 transition count 105
Applied a total of 5 rules in 6 ms. Remains 108 /111 variables (removed 3) and now considering 105/108 (removed 3) transitions.
// Phase 1: matrix 105 rows 108 cols
[2021-05-09 06:59:50] [INFO ] Computed 42 place invariants in 1 ms
[2021-05-09 06:59:51] [INFO ] Implicit Places using invariants in 156 ms returned []
// Phase 1: matrix 105 rows 108 cols
[2021-05-09 06:59:51] [INFO ] Computed 42 place invariants in 1 ms
[2021-05-09 06:59:51] [INFO ] State equation strengthened by 4 read => feed constraints.
[2021-05-09 06:59:51] [INFO ] Implicit Places using invariants and state equation in 194 ms returned [36, 58, 60, 66, 68]
Discarding 5 places :
Implicit Place search using SMT with State Equation took 366 ms to find 5 implicit places.
[2021-05-09 06:59:51] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 105 rows 103 cols
[2021-05-09 06:59:51] [INFO ] Computed 37 place invariants in 2 ms
[2021-05-09 06:59:51] [INFO ] Dead Transitions using invariants and state equation in 69 ms returned []
Starting structural reductions, iteration 1 : 103/111 places, 105/108 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 103 transition count 104
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 102 transition count 104
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 3 place count 101 transition count 102
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 101 transition count 102
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 5 place count 100 transition count 101
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 100 transition count 101
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 10 place count 98 transition count 99
Applied a total of 10 rules in 12 ms. Remains 98 /103 variables (removed 5) and now considering 99/105 (removed 6) transitions.
// Phase 1: matrix 99 rows 98 cols
[2021-05-09 06:59:51] [INFO ] Computed 37 place invariants in 1 ms
[2021-05-09 06:59:51] [INFO ] Implicit Places using invariants in 112 ms returned []
// Phase 1: matrix 99 rows 98 cols
[2021-05-09 06:59:51] [INFO ] Computed 37 place invariants in 1 ms
[2021-05-09 06:59:51] [INFO ] State equation strengthened by 3 read => feed constraints.
[2021-05-09 06:59:51] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 283 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 98/111 places, 99/108 transitions.
[2021-05-09 06:59:51] [INFO ] Flatten gal took : 20 ms
[2021-05-09 06:59:51] [INFO ] Flatten gal took : 15 ms
[2021-05-09 06:59:51] [INFO ] Time to serialize gal into /tmp/LTL1285525317461890167.gal : 10 ms
[2021-05-09 06:59:51] [INFO ] Time to serialize properties into /tmp/LTL12317523272292108312.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/LTL1285525317461890167.gal, -t, CGAL, -LTL, /tmp/LTL12317523272292108312.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/LTL1285525317461890167.gal -t CGAL -LTL /tmp/LTL12317523272292108312.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 9 LTL properties
Checking formula 0 : !((G((F(("(p40!=1)")&&(X("(p40!=1)"))))&&(F(G("(((p360==0)||(p363==0))||(p366==0))"))))))
Formula 0 simplified : !G(F("(p40!=1)" & X"(p40!=1)") & FG"(((p360==0)||(p363==0))||(p366==0))")
Detected timeout of ITS tools.
[2021-05-09 07:00:06] [INFO ] Flatten gal took : 27 ms
[2021-05-09 07:00:06] [INFO ] Applying decomposition
[2021-05-09 07:00:06] [INFO ] Flatten gal took : 22 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/graph9267509277835823979.txt, -o, /tmp/graph9267509277835823979.bin, -w, /tmp/graph9267509277835823979.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/graph9267509277835823979.bin, -l, -1, -v, -w, /tmp/graph9267509277835823979.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 07:00:06] [INFO ] Decomposing Gal with order
[2021-05-09 07:00:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 07:00:07] [INFO ] Removed a total of 221 redundant transitions.
[2021-05-09 07:00:07] [INFO ] Flatten gal took : 40 ms
[2021-05-09 07:00:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2021-05-09 07:00:07] [INFO ] Time to serialize gal into /tmp/LTL1974544855948691581.gal : 7 ms
[2021-05-09 07:00:07] [INFO ] Time to serialize properties into /tmp/LTL6409697737221337870.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/LTL1974544855948691581.gal, -t, CGAL, -LTL, /tmp/LTL6409697737221337870.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/LTL1974544855948691581.gal -t CGAL -LTL /tmp/LTL6409697737221337870.ltl -c -stutter-deadlock
Read 9 LTL properties
Checking formula 0 : !((G((F(("(i5.u14.p40!=1)")&&(X("(i5.u14.p40!=1)"))))&&(F(G("(((i7.u101.p360==0)||(i15.i1.u102.p363==0))||(i12.u103.p366==0))"))))))
Formula 0 simplified : !G(F("(i5.u14.p40!=1)" & X"(i5.u14.p40!=1)") & FG"(((i7.u101.p360==0)||(i15.i1.u102.p363==0))||(i12.u103.p366==0))")
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t4, t7, t8, t9, t10, t114, t138, t158, t170, t176, t208, t270, t272, t279, t280, t281, i0.u43.t129, i0.u45.t125, i0.u47.t121, i1.u39.t137, i1.u41.t133, i2.i0.t182, i2.i0.u7.t188, i2.i0.u8.t187, i2.i0.u9.t185, i2.i1.u61.t107, i2.i1.u62.t105, i2.i1.u63.t102, i3.i0.u11.t181, i3.i1.u64.t99, i3.i1.u65.t96, i4.t166, i4.u18.t169, i5.u14.t175, i6.t165, i7.u71.t78, i8.u51.t113, i9.i0.u70.t81, i9.i0.u72.t75, i9.i1.t72, i9.i1.u74.t73, i11.u66.t93, i11.u67.t90, i11.u68.t87, i11.u69.t84, i12.u76.t65, i13.i0.u49.t117, i13.i0.u53.t110, i13.i1.u77.t62, i13.i2.t59, i13.i2.u78.t60, i14.t46, i14.t21, i14.t6, i14.u80.t14, i14.u80.t54, i15.i1.t5, i15.i1.u23.t140, i15.i1.u23.t141, i15.i1.u23.t142, i15.i1.u23.t157, i15.i1.u75.t68, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :36/187/64/287
Computing Next relation with stutter on 141120 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin18002500939948907249
[2021-05-09 07:00:22] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18002500939948907249
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/ltsmin18002500939948907249]
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/ltsmin18002500939948907249] 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/ltsmin18002500939948907249] 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-07-07 finished in 33723 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 312 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 312/312 places, 287/287 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 305 transition count 280
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 305 transition count 280
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 303 transition count 278
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 303 transition count 278
Applied a total of 18 rules in 22 ms. Remains 303 /312 variables (removed 9) and now considering 278/287 (removed 9) transitions.
// Phase 1: matrix 278 rows 303 cols
[2021-05-09 07:00:23] [INFO ] Computed 61 place invariants in 7 ms
[2021-05-09 07:00:23] [INFO ] Implicit Places using invariants in 167 ms returned []
// Phase 1: matrix 278 rows 303 cols
[2021-05-09 07:00:23] [INFO ] Computed 61 place invariants in 3 ms
[2021-05-09 07:00:23] [INFO ] Implicit Places using invariants and state equation in 316 ms returned []
Implicit Place search using SMT with State Equation took 486 ms to find 0 implicit places.
// Phase 1: matrix 278 rows 303 cols
[2021-05-09 07:00:23] [INFO ] Computed 61 place invariants in 5 ms
[2021-05-09 07:00:23] [INFO ] Dead Transitions using invariants and state equation in 175 ms returned []
Finished structural reductions, in 1 iterations. Remains : 303/312 places, 278/287 transitions.
Stuttering acceptance computed with spot in 81 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-07-08 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(NEQ s217 1)], 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 10 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-07-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-07-08 finished in 799 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((p0 U X(G(p1))))], workingDir=/home/mcc/execution]
Support contains 2 out of 312 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 312/312 places, 287/287 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 306 transition count 281
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 306 transition count 281
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 304 transition count 279
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 304 transition count 279
Applied a total of 16 rules in 12 ms. Remains 304 /312 variables (removed 8) and now considering 279/287 (removed 8) transitions.
// Phase 1: matrix 279 rows 304 cols
[2021-05-09 07:00:23] [INFO ] Computed 61 place invariants in 4 ms
[2021-05-09 07:00:24] [INFO ] Implicit Places using invariants in 145 ms returned []
// Phase 1: matrix 279 rows 304 cols
[2021-05-09 07:00:24] [INFO ] Computed 61 place invariants in 2 ms
[2021-05-09 07:00:24] [INFO ] Implicit Places using invariants and state equation in 318 ms returned []
Implicit Place search using SMT with State Equation took 469 ms to find 0 implicit places.
// Phase 1: matrix 279 rows 304 cols
[2021-05-09 07:00:24] [INFO ] Computed 61 place invariants in 3 ms
[2021-05-09 07:00:24] [INFO ] Dead Transitions using invariants and state equation in 167 ms returned []
Finished structural reductions, in 1 iterations. Remains : 304/312 places, 279/287 transitions.
Stuttering acceptance computed with spot in 82 ms :[(NOT p1), (NOT p1), true]
Running random walk in product with property : BusinessProcesses-PT-07-10 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(NEQ s226 1), p0:(EQ s282 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 443 steps with 4 reset in 3 ms.
FORMULA BusinessProcesses-PT-07-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-07-10 finished in 750 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(((F(p1)&&X(p2))||p0))))], workingDir=/home/mcc/execution]
Support contains 4 out of 312 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 312/312 places, 287/287 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 305 transition count 280
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 305 transition count 280
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 303 transition count 278
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 303 transition count 278
Applied a total of 18 rules in 18 ms. Remains 303 /312 variables (removed 9) and now considering 278/287 (removed 9) transitions.
// Phase 1: matrix 278 rows 303 cols
[2021-05-09 07:00:24] [INFO ] Computed 61 place invariants in 2 ms
[2021-05-09 07:00:24] [INFO ] Implicit Places using invariants in 115 ms returned []
// Phase 1: matrix 278 rows 303 cols
[2021-05-09 07:00:24] [INFO ] Computed 61 place invariants in 4 ms
[2021-05-09 07:00:25] [INFO ] Implicit Places using invariants and state equation in 257 ms returned []
Implicit Place search using SMT with State Equation took 376 ms to find 0 implicit places.
// Phase 1: matrix 278 rows 303 cols
[2021-05-09 07:00:25] [INFO ] Computed 61 place invariants in 4 ms
[2021-05-09 07:00:25] [INFO ] Dead Transitions using invariants and state equation in 184 ms returned []
Finished structural reductions, in 1 iterations. Remains : 303/312 places, 278/287 transitions.
Stuttering acceptance computed with spot in 228 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-07-11 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (NEQ s42 1) (NEQ s188 1) (NEQ s269 1)), p1:(AND (OR (NEQ s42 1) (NEQ s188 1) (NEQ s269 1)) (NEQ s232 1)), p2:(OR (NEQ s42 1) (NEQ s188 1) (NEQ s269 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 407 ms.
Product exploration explored 100000 steps with 50000 reset in 427 ms.
Graph (complete) has 719 edges and 303 vertex of which 302 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Knowledge obtained : [p0, p1, p2]
Stuttering acceptance computed with spot in 178 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 50000 reset in 378 ms.
Product exploration explored 100000 steps with 50000 reset in 337 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 210 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 303 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 303/303 places, 278/278 transitions.
Graph (trivial) has 130 edges and 303 vertex of which 4 / 303 are part of one of the 1 SCC in 1 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 25 rules applied. Total rules applied 26 place count 300 transition count 275
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 64 Pre rules applied. Total rules applied 26 place count 300 transition count 418
Deduced a syphon composed of 89 places in 0 ms
Iterating global reduction 1 with 64 rules applied. Total rules applied 90 place count 300 transition count 418
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 99 place count 291 transition count 385
Deduced a syphon composed of 80 places in 1 ms
Iterating global reduction 1 with 9 rules applied. Total rules applied 108 place count 291 transition count 385
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 157 places in 0 ms
Iterating global reduction 1 with 77 rules applied. Total rules applied 185 place count 291 transition count 385
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 202 place count 274 transition count 368
Deduced a syphon composed of 140 places in 0 ms
Iterating global reduction 1 with 17 rules applied. Total rules applied 219 place count 274 transition count 368
Deduced a syphon composed of 140 places in 1 ms
Applied a total of 219 rules in 49 ms. Remains 274 /303 variables (removed 29) and now considering 368/278 (removed -90) transitions.
[2021-05-09 07:00:27] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 368 rows 274 cols
[2021-05-09 07:00:27] [INFO ] Computed 61 place invariants in 4 ms
[2021-05-09 07:00:28] [INFO ] Dead Transitions using invariants and state equation in 222 ms returned []
Finished structural reductions, in 1 iterations. Remains : 274/303 places, 368/278 transitions.
Product exploration explored 100000 steps with 50000 reset in 321 ms.
Product exploration explored 100000 steps with 50000 reset in 309 ms.
[2021-05-09 07:00:28] [INFO ] Flatten gal took : 10 ms
[2021-05-09 07:00:28] [INFO ] Flatten gal took : 9 ms
[2021-05-09 07:00:28] [INFO ] Time to serialize gal into /tmp/LTL551450572466336007.gal : 2 ms
[2021-05-09 07:00:28] [INFO ] Time to serialize properties into /tmp/LTL13112059238736060467.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/LTL551450572466336007.gal, -t, CGAL, -LTL, /tmp/LTL13112059238736060467.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/LTL551450572466336007.gal -t CGAL -LTL /tmp/LTL13112059238736060467.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F(("(((p43!=1)||(p212!=1))||(p352!=1))")||((F("((((p43!=1)||(p212!=1))||(p352!=1))&&(p269!=1))"))&&(X("(((p43!=1)||(p212!=1))||(p352!=1))")))))))
Formula 0 simplified : !XF("(((p43!=1)||(p212!=1))||(p352!=1))" | (F"((((p43!=1)||(p212!=1))||(p352!=1))&&(p269!=1))" & X"(((p43!=1)||(p212!=1))||(p352!=1))"))
Detected timeout of ITS tools.
[2021-05-09 07:00:43] [INFO ] Flatten gal took : 23 ms
[2021-05-09 07:00:43] [INFO ] Applying decomposition
[2021-05-09 07:00:43] [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/graph9731901126605488643.txt, -o, /tmp/graph9731901126605488643.bin, -w, /tmp/graph9731901126605488643.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/graph9731901126605488643.bin, -l, -1, -v, -w, /tmp/graph9731901126605488643.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 07:00:43] [INFO ] Decomposing Gal with order
[2021-05-09 07:00:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 07:00:43] [INFO ] Removed a total of 225 redundant transitions.
[2021-05-09 07:00:43] [INFO ] Flatten gal took : 27 ms
[2021-05-09 07:00:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2021-05-09 07:00:43] [INFO ] Time to serialize gal into /tmp/LTL17098773377817304244.gal : 4 ms
[2021-05-09 07:00:43] [INFO ] Time to serialize properties into /tmp/LTL1760211772091012722.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/LTL17098773377817304244.gal, -t, CGAL, -LTL, /tmp/LTL1760211772091012722.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/LTL17098773377817304244.gal -t CGAL -LTL /tmp/LTL1760211772091012722.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(F(("(((i12.u15.p43!=1)||(i13.u67.p212!=1))||(i12.u82.p352!=1))")||((F("((((i12.u15.p43!=1)||(i13.u67.p212!=1))||(i12.u82.p352!=1))&&(i15.u78.p269!=1))"))&&(X("(((i12.u15.p43!=1)||(i13.u67.p212!=1))||(i12.u82.p352!=1))")))))))
Formula 0 simplified : !XF("(((i12.u15.p43!=1)||(i13.u67.p212!=1))||(i12.u82.p352!=1))" | (F"((((i12.u15.p43!=1)||(i13.u67.p212!=1))||(i12.u82.p352!=1))&&(i15.u78.p269!=1))" & X"(((i12.u15.p43!=1)||(i13.u67.p212!=1))||(i12.u82.p352!=1))"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17671635704712363418
[2021-05-09 07:00:58] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17671635704712363418
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/ltsmin17671635704712363418]
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/ltsmin17671635704712363418] 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/ltsmin17671635704712363418] 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-07-11 finished in 35243 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 312 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 312/312 places, 287/287 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 305 transition count 280
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 305 transition count 280
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 303 transition count 278
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 303 transition count 278
Applied a total of 18 rules in 19 ms. Remains 303 /312 variables (removed 9) and now considering 278/287 (removed 9) transitions.
// Phase 1: matrix 278 rows 303 cols
[2021-05-09 07:00:59] [INFO ] Computed 61 place invariants in 4 ms
[2021-05-09 07:01:00] [INFO ] Implicit Places using invariants in 165 ms returned []
// Phase 1: matrix 278 rows 303 cols
[2021-05-09 07:01:00] [INFO ] Computed 61 place invariants in 6 ms
[2021-05-09 07:01:00] [INFO ] Implicit Places using invariants and state equation in 319 ms returned []
Implicit Place search using SMT with State Equation took 485 ms to find 0 implicit places.
// Phase 1: matrix 278 rows 303 cols
[2021-05-09 07:01:00] [INFO ] Computed 61 place invariants in 4 ms
[2021-05-09 07:01:00] [INFO ] Dead Transitions using invariants and state equation in 189 ms returned []
Finished structural reductions, in 1 iterations. Remains : 303/312 places, 278/287 transitions.
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-07-12 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s244 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 90 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-07-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-07-12 finished in 779 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 1 out of 312 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 312/312 places, 287/287 transitions.
Graph (trivial) has 141 edges and 312 vertex of which 6 / 312 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 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 31 place count 306 transition count 250
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 61 place count 276 transition count 250
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 65 Pre rules applied. Total rules applied 61 place count 276 transition count 185
Deduced a syphon composed of 65 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 2 with 139 rules applied. Total rules applied 200 place count 202 transition count 185
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 206 place count 196 transition count 179
Iterating global reduction 2 with 6 rules applied. Total rules applied 212 place count 196 transition count 179
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 2 with 153 rules applied. Total rules applied 365 place count 118 transition count 104
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 367 place count 117 transition count 107
Applied a total of 367 rules in 30 ms. Remains 117 /312 variables (removed 195) and now considering 107/287 (removed 180) transitions.
// Phase 1: matrix 107 rows 117 cols
[2021-05-09 07:01:00] [INFO ] Computed 49 place invariants in 5 ms
[2021-05-09 07:01:00] [INFO ] Implicit Places using invariants in 96 ms returned [1, 2, 10, 35, 36, 37, 38, 39, 40, 41]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 97 ms to find 10 implicit places.
[2021-05-09 07:01:00] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 107 rows 107 cols
[2021-05-09 07:01:00] [INFO ] Computed 39 place invariants in 0 ms
[2021-05-09 07:01:00] [INFO ] Dead Transitions using invariants and state equation in 73 ms returned []
Starting structural reductions, iteration 1 : 107/312 places, 107/287 transitions.
Applied a total of 0 rules in 4 ms. Remains 107 /107 variables (removed 0) and now considering 107/107 (removed 0) transitions.
[2021-05-09 07:01:00] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 107 rows 107 cols
[2021-05-09 07:01:00] [INFO ] Computed 39 place invariants in 1 ms
[2021-05-09 07:01:00] [INFO ] Dead Transitions using invariants and state equation in 55 ms returned []
Finished structural reductions, in 2 iterations. Remains : 107/312 places, 107/287 transitions.
Stuttering acceptance computed with spot in 35 ms :[true, (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-07-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}]], initial=1, aps=[p0:(NEQ s70 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][true, true]]
Entered a terminal (fully accepting) state of product in 1508 steps with 306 reset in 4 ms.
FORMULA BusinessProcesses-PT-07-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-07-13 finished in 329 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((G(F(p0))||(p1&&X(p0))))))], workingDir=/home/mcc/execution]
Support contains 2 out of 312 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 312/312 places, 287/287 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 305 transition count 280
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 305 transition count 280
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 303 transition count 278
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 303 transition count 278
Applied a total of 18 rules in 11 ms. Remains 303 /312 variables (removed 9) and now considering 278/287 (removed 9) transitions.
// Phase 1: matrix 278 rows 303 cols
[2021-05-09 07:01:01] [INFO ] Computed 61 place invariants in 2 ms
[2021-05-09 07:01:01] [INFO ] Implicit Places using invariants in 101 ms returned []
// Phase 1: matrix 278 rows 303 cols
[2021-05-09 07:01:01] [INFO ] Computed 61 place invariants in 2 ms
[2021-05-09 07:01:01] [INFO ] Implicit Places using invariants and state equation in 249 ms returned []
Implicit Place search using SMT with State Equation took 352 ms to find 0 implicit places.
// Phase 1: matrix 278 rows 303 cols
[2021-05-09 07:01:01] [INFO ] Computed 61 place invariants in 2 ms
[2021-05-09 07:01:01] [INFO ] Dead Transitions using invariants and state equation in 159 ms returned []
Finished structural reductions, in 1 iterations. Remains : 303/312 places, 278/287 transitions.
Stuttering acceptance computed with spot in 159 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-07-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=p1, acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(NEQ s134 1), p0:(NEQ s119 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 285 ms.
Product exploration explored 100000 steps with 33333 reset in 283 ms.
Graph (complete) has 719 edges and 303 vertex of which 302 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Knowledge obtained : [p1, p0]
Stuttering acceptance computed with spot in 182 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 33333 reset in 280 ms.
Product exploration explored 100000 steps with 33333 reset in 309 ms.
Applying partial POR strategy [false, false, false, true]
Stuttering acceptance computed with spot in 201 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 303 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 303/303 places, 278/278 transitions.
Graph (trivial) has 132 edges and 303 vertex of which 6 / 303 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.
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 27 rules applied. Total rules applied 28 place count 298 transition count 272
Performed 62 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 62 Pre rules applied. Total rules applied 28 place count 298 transition count 409
Deduced a syphon composed of 89 places in 0 ms
Iterating global reduction 1 with 62 rules applied. Total rules applied 90 place count 298 transition count 409
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 98 place count 290 transition count 380
Deduced a syphon composed of 81 places in 1 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 106 place count 290 transition count 380
Performed 78 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 159 places in 0 ms
Iterating global reduction 1 with 78 rules applied. Total rules applied 184 place count 290 transition count 380
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 202 place count 272 transition count 362
Deduced a syphon composed of 141 places in 0 ms
Iterating global reduction 1 with 18 rules applied. Total rules applied 220 place count 272 transition count 362
Deduced a syphon composed of 141 places in 0 ms
Applied a total of 220 rules in 44 ms. Remains 272 /303 variables (removed 31) and now considering 362/278 (removed -84) transitions.
[2021-05-09 07:01:03] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 362 rows 272 cols
[2021-05-09 07:01:03] [INFO ] Computed 61 place invariants in 4 ms
[2021-05-09 07:01:03] [INFO ] Dead Transitions using invariants and state equation in 219 ms returned []
Finished structural reductions, in 1 iterations. Remains : 272/303 places, 362/278 transitions.
Product exploration explored 100000 steps with 33333 reset in 269 ms.
Product exploration explored 100000 steps with 33333 reset in 322 ms.
[2021-05-09 07:01:04] [INFO ] Flatten gal took : 11 ms
[2021-05-09 07:01:04] [INFO ] Flatten gal took : 10 ms
[2021-05-09 07:01:04] [INFO ] Time to serialize gal into /tmp/LTL17594188470796676117.gal : 2 ms
[2021-05-09 07:01:04] [INFO ] Time to serialize properties into /tmp/LTL9818695304336980223.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/LTL17594188470796676117.gal, -t, CGAL, -LTL, /tmp/LTL9818695304336980223.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/LTL17594188470796676117.gal -t CGAL -LTL /tmp/LTL9818695304336980223.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F((G(F("(p136!=1)")))||(("(p151!=1)")&&(X("(p136!=1)")))))))
Formula 0 simplified : !XF(GF"(p136!=1)" | ("(p151!=1)" & X"(p136!=1)"))
Detected timeout of ITS tools.
[2021-05-09 07:01:19] [INFO ] Flatten gal took : 21 ms
[2021-05-09 07:01:19] [INFO ] Applying decomposition
[2021-05-09 07:01:19] [INFO ] Flatten gal took : 22 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/graph11584464263606912886.txt, -o, /tmp/graph11584464263606912886.bin, -w, /tmp/graph11584464263606912886.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/graph11584464263606912886.bin, -l, -1, -v, -w, /tmp/graph11584464263606912886.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 07:01:19] [INFO ] Decomposing Gal with order
[2021-05-09 07:01:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 07:01:19] [INFO ] Removed a total of 226 redundant transitions.
[2021-05-09 07:01:19] [INFO ] Flatten gal took : 22 ms
[2021-05-09 07:01:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 4 ms.
[2021-05-09 07:01:19] [INFO ] Time to serialize gal into /tmp/LTL15306748286942558750.gal : 3 ms
[2021-05-09 07:01:19] [INFO ] Time to serialize properties into /tmp/LTL13429755411456021372.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/LTL15306748286942558750.gal, -t, CGAL, -LTL, /tmp/LTL13429755411456021372.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/LTL15306748286942558750.gal -t CGAL -LTL /tmp/LTL13429755411456021372.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(F((G(F("(i1.u45.p136!=1)")))||(("(i0.i1.u50.p151!=1)")&&(X("(i1.u45.p136!=1)")))))))
Formula 0 simplified : !XF(GF"(i1.u45.p136!=1)" | ("(i0.i1.u50.p151!=1)" & X"(i1.u45.p136!=1)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1663195126378096808
[2021-05-09 07:01:34] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1663195126378096808
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/ltsmin1663195126378096808]
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/ltsmin1663195126378096808] 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/ltsmin1663195126378096808] 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-07-15 finished in 34600 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin15337746334209862244
[2021-05-09 07:01:35] [INFO ] Computing symmetric may disable matrix : 287 transitions.
[2021-05-09 07:01:35] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-09 07:01:35] [INFO ] Applying decomposition
[2021-05-09 07:01:35] [INFO ] Computing symmetric may enable matrix : 287 transitions.
[2021-05-09 07:01:35] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-09 07:01:35] [INFO ] Computing Do-Not-Accords matrix : 287 transitions.
[2021-05-09 07:01:35] [INFO ] Flatten gal took : 24 ms
[2021-05-09 07:01:35] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-09 07:01:35] [INFO ] Built C files in 42ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15337746334209862244
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/ltsmin15337746334209862244]
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/graph5488607017483842254.txt, -o, /tmp/graph5488607017483842254.bin, -w, /tmp/graph5488607017483842254.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/graph5488607017483842254.bin, -l, -1, -v, -w, /tmp/graph5488607017483842254.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 07:01:35] [INFO ] Decomposing Gal with order
[2021-05-09 07:01:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 07:01:35] [INFO ] Removed a total of 232 redundant transitions.
[2021-05-09 07:01:35] [INFO ] Flatten gal took : 26 ms
[2021-05-09 07:01:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 5 ms.
[2021-05-09 07:01:35] [INFO ] Time to serialize gal into /tmp/LTLFireability11735589941212224249.gal : 3 ms
[2021-05-09 07:01:35] [INFO ] Time to serialize properties into /tmp/LTLFireability7230596985276232692.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/LTLFireability11735589941212224249.gal, -t, CGAL, -LTL, /tmp/LTLFireability7230596985276232692.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/LTLFireability11735589941212224249.gal -t CGAL -LTL /tmp/LTLFireability7230596985276232692.ltl -c -stutter-deadlock
Read 5 LTL properties
Checking formula 0 : !((G((F(("(i4.u15.p40!=1)")&&(X("(i4.u15.p40!=1)"))))&&(F(G("(((i11.u102.p360==0)||(i14.i0.u103.p363==0))||(i12.u104.p366==0))"))))))
Formula 0 simplified : !G(F("(i4.u15.p40!=1)" & X"(i4.u15.p40!=1)") & FG"(((i11.u102.p360==0)||(i14.i0.u103.p363==0))||(i12.u104.p366==0))")
Compilation finished in 1237 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin15337746334209862244]
Link finished in 82 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, []((<>(((LTLAPp0==true)&&X((LTLAPp0==true))))&&<>([]((LTLAPp1==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin15337746334209862244]
LTSmin run took 740 ms.
FORMULA BusinessProcesses-PT-07-05 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
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, ((LTLAPp2==true) U ([]((LTLAPp2==true))||((LTLAPp2==true)&&[]((LTLAPp3==true))&&X((LTLAPp4==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin15337746334209862244]
Reverse transition relation is NOT exact ! Due to transitions t2, t4, t7, t8, t9, t10, t95, t172, t196, t222, t238, t242, t254, t281, t343, t345, t352, t353, t354, i0.i0.u73.t121, i0.i1.t118, i0.i1.u74.t119, i1.u47.t183, i2.u43.t191, i2.u45.t187, i3.t253, i3.t248, i3.u9.t257, i4.u15.t247, i5.u19.t241, i5.u41.t195, i6.t237, i7.i0.u53.t171, i7.i1.u49.t179, i7.i1.u55.t168, i8.u68.t141, i8.u69.t137, i8.u70.t133, i8.u71.t129, i9.i1.u66.t149, i9.i1.u67.t145, i10.i0.u7.t261, i10.i0.u8.t260, i10.i1.u62.t164, i10.i1.u63.t161, i10.i1.u64.t157, i10.i1.u65.t153, i11.u72.t125, i12.u77.t109, i13.i0.u78.t105, i13.i1.u51.t175, i13.i2.t102, i13.i2.u79.t103, i14.i0.t3, i14.i0.t5, i14.i0.u24.t198, i14.i0.u24.t200, i14.i0.u24.t202, i14.i0.u24.t221, i14.i0.u76.t113, i15.t32, i15.t6, i15.u81.t16, i15.u85.t84, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :36/186/64/286
Computing Next relation with stutter on 141120 deadlock states
57 unique states visited
57 strongly connected components in search stack
58 transitions explored
57 items max in DFS search stack
5600 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,56.0499,826012,1,0,1.3699e+06,810,5608,4.23388e+06,317,3714,2038660
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
Checking formula 1 : !(((("(i14.i0.u24.p84!=1)")U(((("(i14.i0.u24.p84!=1)")&&(G("(i11.u106.p370!=1)")))&&(X("((!(((i11.u28.p92==1)&&(i11.u72.p232==1))&&(i14.i0.u90.p359==1)))&&(i14.i0.u24.p84!=1))")))||(G("(i14.i0.u24.p84!=1)"))))U(((!("((((i11.u28.p92==1)&&(i11.u72.p232==1))&&(i14.i0.u105.p368==1))&&(i14.i0.u32.p75==1))"))&&(("(i14.i0.u24.p84!=1)")U(((("(i14.i0.u24.p84!=1)")&&(G("(i11.u106.p370!=1)")))&&(X("((!(((i11.u28.p92==1)&&(i11.u72.p232==1))&&(i14.i0.u90.p359==1)))&&(i14.i0.u24.p84!=1))")))||(G("(i14.i0.u24.p84!=1)")))))||(G(("(i14.i0.u24.p84!=1)")U(((("(i14.i0.u24.p84!=1)")&&(G("(i11.u106.p370!=1)")))&&(X("((!(((i11.u28.p92==1)&&(i11.u72.p232==1))&&(i14.i0.u90.p359==1)))&&(i14.i0.u24.p84!=1))")))||(G("(i14.i0.u24.p84!=1)"))))))))
Formula 1 simplified : !(("(i14.i0.u24.p84!=1)" U (("(i14.i0.u24.p84!=1)" & G"(i11.u106.p370!=1)" & X"((!(((i11.u28.p92==1)&&(i11.u72.p232==1))&&(i14.i0.u90.p359==1)))&&(i14.i0.u24.p84!=1))") | G"(i14.i0.u24.p84!=1)")) U ((!"((((i11.u28.p92==1)&&(i11.u72.p232==1))&&(i14.i0.u105.p368==1))&&(i14.i0.u32.p75==1))" & ("(i14.i0.u24.p84!=1)" U (("(i14.i0.u24.p84!=1)" & G"(i11.u106.p370!=1)" & X"((!(((i11.u28.p92==1)&&(i11.u72.p232==1))&&(i14.i0.u90.p359==1)))&&(i14.i0.u24.p84!=1))") | G"(i14.i0.u24.p84!=1)"))) | G("(i14.i0.u24.p84!=1)" U (("(i14.i0.u24.p84!=1)" & G"(i11.u106.p370!=1)" & X"((!(((i11.u28.p92==1)&&(i11.u72.p232==1))&&(i14.i0.u90.p359==1)))&&(i14.i0.u24.p84!=1))") | G"(i14.i0.u24.p84!=1)"))))
Computing Next relation with stutter on 141120 deadlock states
WARNING : LTSmin timed out (>240 s) on command 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, ((LTLAPp2==true) U ([]((LTLAPp2==true))||((LTLAPp2==true)&&[]((LTLAPp3==true))&&X((LTLAPp4==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin15337746334209862244]
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, -p, --pins-guards, --when, --ltl, <>((((LTLAPp5==true) U (LTLAPp6==true))||[]((LTLAPp7==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin15337746334209862244]
WARNING : LTSmin timed out (>240 s) on command 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, -p, --pins-guards, --when, --ltl, <>((((LTLAPp5==true) U (LTLAPp6==true))||[]((LTLAPp7==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin15337746334209862244]
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(<>(((<>((LTLAPp9==true))&&X((LTLAPp10==true)))||(LTLAPp8==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin15337746334209862244]
LTSmin run took 355 ms.
FORMULA BusinessProcesses-PT-07-11 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
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(<>(([](<>((LTLAPp11==true)))||((LTLAPp12==true)&&X((LTLAPp11==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin15337746334209862244]
LTSmin run took 368 ms.
FORMULA BusinessProcesses-PT-07-15 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Retrying LTSmin with larger timeout 1920 s
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, ((LTLAPp2==true) U ([]((LTLAPp2==true))||((LTLAPp2==true)&&[]((LTLAPp3==true))&&X((LTLAPp4==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin15337746334209862244]
Detected timeout of ITS tools.
[2021-05-09 07:22:36] [INFO ] Applying decomposition
[2021-05-09 07:22:36] [INFO ] Flatten gal took : 46 ms
[2021-05-09 07:22:36] [INFO ] Decomposing Gal with order
[2021-05-09 07:22:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 07:22:36] [INFO ] Removed a total of 132 redundant transitions.
[2021-05-09 07:22:36] [INFO ] Flatten gal took : 56 ms
[2021-05-09 07:22:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 33 ms.
[2021-05-09 07:22:36] [INFO ] Time to serialize gal into /tmp/LTLFireability12530585884307408378.gal : 4 ms
[2021-05-09 07:22:36] [INFO ] Time to serialize properties into /tmp/LTLFireability17961542514207606170.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/LTLFireability12530585884307408378.gal, -t, CGAL, -LTL, /tmp/LTLFireability17961542514207606170.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/LTLFireability12530585884307408378.gal -t CGAL -LTL /tmp/LTLFireability17961542514207606170.ltl -c -stutter-deadlock
Read 2 LTL properties
Checking formula 0 : !(((("(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u127.p84!=1)")U(((("(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u127.p84!=1)")&&(G("(i1.u85.p370!=1)")))&&(X("((!(((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u28.p92==1)&&(i0.i1.i0.i0.i0.i0.i0.i0.u71.p232==1))&&(i1.i2.u82.p359==1)))&&(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u127.p84!=1))")))||(G("(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u127.p84!=1)"))))U(((!("((((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u28.p92==1)&&(i0.i1.i0.i0.i0.i0.i0.i0.u71.p232==1))&&(i1.u85.p368==1))&&(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u127.p75==1))"))&&(("(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u127.p84!=1)")U(((("(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u127.p84!=1)")&&(G("(i1.u85.p370!=1)")))&&(X("((!(((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u28.p92==1)&&(i0.i1.i0.i0.i0.i0.i0.i0.u71.p232==1))&&(i1.i2.u82.p359==1)))&&(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u127.p84!=1))")))||(G("(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u127.p84!=1)")))))||(G(("(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u127.p84!=1)")U(((("(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u127.p84!=1)")&&(G("(i1.u85.p370!=1)")))&&(X("((!(((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u28.p92==1)&&(i0.i1.i0.i0.i0.i0.i0.i0.u71.p232==1))&&(i1.i2.u82.p359==1)))&&(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u127.p84!=1))")))||(G("(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u127.p84!=1)"))))))))
Formula 0 simplified : !(("(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u127.p84!=1)" U (("(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u127.p84!=1)" & G"(i1.u85.p370!=1)" & X"((!(((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u28.p92==1)&&(i0.i1.i0.i0.i0.i0.i0.i0.u71.p232==1))&&(i1.i2.u82.p359==1)))&&(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u127.p84!=1))") | G"(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u127.p84!=1)")) U ((!"((((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u28.p92==1)&&(i0.i1.i0.i0.i0.i0.i0.i0.u71.p232==1))&&(i1.u85.p368==1))&&(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u127.p75==1))" & ("(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u127.p84!=1)" U (("(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u127.p84!=1)" & G"(i1.u85.p370!=1)" & X"((!(((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u28.p92==1)&&(i0.i1.i0.i0.i0.i0.i0.i0.u71.p232==1))&&(i1.i2.u82.p359==1)))&&(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u127.p84!=1))") | G"(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u127.p84!=1)"))) | G("(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u127.p84!=1)" U (("(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u127.p84!=1)" & G"(i1.u85.p370!=1)" & X"((!(((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u28.p92==1)&&(i0.i1.i0.i0.i0.i0.i0.i0.u71.p232==1))&&(i1.i2.u82.p359==1)))&&(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u127.p84!=1))") | G"(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u127.p84!=1)"))))
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 2/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.006: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.006: LTL layer: formula: ((LTLAPp2==true) U ([]((LTLAPp2==true))||((LTLAPp2==true)&&[]((LTLAPp3==true))&&X((LTLAPp4==true)))))
pins2lts-mc-linux64( 2/ 8), 0.006: "((LTLAPp2==true) U ([]((LTLAPp2==true))||((LTLAPp2==true)&&[]((LTLAPp3==true))&&X((LTLAPp4==true)))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 0.006: Using Spin LTL semantics
pins2lts-mc-linux64( 4/ 8), 0.012: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.012: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.012: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.013: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.013: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.013: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.012: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.013: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.013: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.012: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.012: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.012: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.012: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.015: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.018: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.020: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.020: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.020: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.021: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.018: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.025: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.315: DFS-FIFO for weak LTL, using special progress label 301
pins2lts-mc-linux64( 0/ 8), 0.316: There are 302 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.316: State length is 313, there are 303 groups
pins2lts-mc-linux64( 0/ 8), 0.316: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.316: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.316: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.316: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 1/ 8), 0.532: ~1 levels ~960 states ~5968 transitions
pins2lts-mc-linux64( 4/ 8), 0.541: ~1 levels ~1920 states ~11416 transitions
pins2lts-mc-linux64( 0/ 8), 0.560: ~1 levels ~3840 states ~25680 transitions
pins2lts-mc-linux64( 4/ 8), 0.582: ~1 levels ~7680 states ~54184 transitions
pins2lts-mc-linux64( 4/ 8), 0.670: ~1 levels ~15360 states ~121944 transitions
pins2lts-mc-linux64( 4/ 8), 0.838: ~1 levels ~30720 states ~255592 transitions
pins2lts-mc-linux64( 3/ 8), 1.167: ~1 levels ~61440 states ~517912 transitions
pins2lts-mc-linux64( 3/ 8), 1.750: ~1 levels ~122880 states ~1040128 transitions
pins2lts-mc-linux64( 3/ 8), 3.465: ~1 levels ~245760 states ~2346024 transitions
pins2lts-mc-linux64( 0/ 8), 6.713: ~1 levels ~491520 states ~5069032 transitions
pins2lts-mc-linux64( 0/ 8), 13.637: ~1 levels ~983040 states ~10472208 transitions
pins2lts-mc-linux64( 3/ 8), 28.245: ~1 levels ~1966080 states ~21611856 transitions
pins2lts-mc-linux64( 3/ 8), 56.963: ~1 levels ~3932160 states ~45822592 transitions
pins2lts-mc-linux64( 3/ 8), 118.984: ~1 levels ~7864320 states ~95011624 transitions
pins2lts-mc-linux64( 3/ 8), 248.265: ~1 levels ~15728640 states ~198816168 transitions
pins2lts-mc-linux64( 2/ 8), 516.237: ~1 levels ~31457280 states ~412971056 transitions
pins2lts-mc-linux64( 2/ 8), 1074.292: ~1 levels ~62914560 states ~866306224 transitions
pins2lts-mc-linux64( 6/ 8), 1299.689: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 1299.728:
pins2lts-mc-linux64( 0/ 8), 1299.728: mean standard work distribution: 5.4% (states) 1.7% (transitions)
pins2lts-mc-linux64( 0/ 8), 1299.728:
pins2lts-mc-linux64( 0/ 8), 1299.728: Explored 68568359 states 1002538195 transitions, fanout: 14.621
pins2lts-mc-linux64( 0/ 8), 1299.728: Total exploration time 1299.400 sec (1299.370 sec minimum, 1299.384 sec on average)
pins2lts-mc-linux64( 0/ 8), 1299.728: States per second: 52769, Transitions per second: 771539
pins2lts-mc-linux64( 0/ 8), 1299.728:
pins2lts-mc-linux64( 0/ 8), 1299.728: Progress states detected: 134216915
pins2lts-mc-linux64( 0/ 8), 1299.728: Redundant explorations: -48.9123
pins2lts-mc-linux64( 0/ 8), 1299.728:
pins2lts-mc-linux64( 0/ 8), 1299.728: Queue width: 8B, total height: 109994450, memory: 839.19MB
pins2lts-mc-linux64( 0/ 8), 1299.728: Tree memory: 1047.4MB, 8.2 B/state, compr.: 0.7%
pins2lts-mc-linux64( 0/ 8), 1299.728: Tree fill ratio (roots/leafs): 99.0%/9.0%
pins2lts-mc-linux64( 0/ 8), 1299.728: Stored 289 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 1299.728: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 1299.728: Est. total memory use: 1886.6MB (~1863.2MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing 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, ((LTLAPp2==true) U ([]((LTLAPp2==true))||((LTLAPp2==true)&&[]((LTLAPp3==true))&&X((LTLAPp4==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin15337746334209862244]
255
java.lang.RuntimeException: Unexpected exception when executing 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, ((LTLAPp2==true) U ([]((LTLAPp2==true))||((LTLAPp2==true)&&[]((LTLAPp3==true))&&X((LTLAPp4==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin15337746334209862244]
255
at fr.lip6.move.gal.application.LTSminRunner.checkProperty(LTSminRunner.java:214)
at fr.lip6.move.gal.application.LTSminRunner.access$10(LTSminRunner.java:165)
at fr.lip6.move.gal.application.LTSminRunner$1.checkProperties(LTSminRunner.java:154)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:102)
at java.base/java.lang.Thread.run(Thread.java:834)
Detected timeout of ITS tools.
[2021-05-09 07:43:38] [INFO ] Flatten gal took : 281 ms
[2021-05-09 07:43:39] [INFO ] Input system was already deterministic with 287 transitions.
[2021-05-09 07:43:39] [INFO ] Transformed 312 places.
[2021-05-09 07:43:39] [INFO ] Transformed 287 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2021-05-09 07:44:09] [INFO ] Time to serialize gal into /tmp/LTLFireability7378375236495148505.gal : 14 ms
[2021-05-09 07:44:09] [INFO ] Time to serialize properties into /tmp/LTLFireability17109922415165977706.ltl : 6 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/LTLFireability7378375236495148505.gal, -t, CGAL, -LTL, /tmp/LTLFireability17109922415165977706.ltl, -c, -stutter-deadlock, --load-order, /home/mcc/execution/model.ord, --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/LTLFireability7378375236495148505.gal -t CGAL -LTL /tmp/LTLFireability17109922415165977706.ltl -c -stutter-deadlock --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !(((("(p84!=1)")U(((("(p84!=1)")&&(G("(p370!=1)")))&&(X("((!(((p92==1)&&(p232==1))&&(p359==1)))&&(p84!=1))")))||(G("(p84!=1)"))))U(((!("((((p92==1)&&(p232==1))&&(p368==1))&&(p75==1))"))&&(("(p84!=1)")U(((("(p84!=1)")&&(G("(p370!=1)")))&&(X("((!(((p92==1)&&(p232==1))&&(p359==1)))&&(p84!=1))")))||(G("(p84!=1)")))))||(G(("(p84!=1)")U(((("(p84!=1)")&&(G("(p370!=1)")))&&(X("((!(((p92==1)&&(p232==1))&&(p359==1)))&&(p84!=1))")))||(G("(p84!=1)"))))))))
Formula 0 simplified : !(("(p84!=1)" U (("(p84!=1)" & G"(p370!=1)" & X"((!(((p92==1)&&(p232==1))&&(p359==1)))&&(p84!=1))") | G"(p84!=1)")) U ((!"((((p92==1)&&(p232==1))&&(p368==1))&&(p75==1))" & ("(p84!=1)" U (("(p84!=1)" & G"(p370!=1)" & X"((!(((p92==1)&&(p232==1))&&(p359==1)))&&(p84!=1))") | G"(p84!=1)"))) | G("(p84!=1)" U (("(p84!=1)" & G"(p370!=1)" & X"((!(((p92==1)&&(p232==1))&&(p359==1)))&&(p84!=1))") | G"(p84!=1)"))))

BK_TIME_CONFINEMENT_REACHED

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

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