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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 133K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.3K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 72K 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.5K Mar 28 15:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 15:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 15:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 28 15:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 23 03:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 23 03:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Mar 22 12:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K 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 131K 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-10-00
FORMULA_NAME BusinessProcesses-PT-10-01
FORMULA_NAME BusinessProcesses-PT-10-02
FORMULA_NAME BusinessProcesses-PT-10-03
FORMULA_NAME BusinessProcesses-PT-10-04
FORMULA_NAME BusinessProcesses-PT-10-05
FORMULA_NAME BusinessProcesses-PT-10-06
FORMULA_NAME BusinessProcesses-PT-10-07
FORMULA_NAME BusinessProcesses-PT-10-08
FORMULA_NAME BusinessProcesses-PT-10-09
FORMULA_NAME BusinessProcesses-PT-10-10
FORMULA_NAME BusinessProcesses-PT-10-11
FORMULA_NAME BusinessProcesses-PT-10-12
FORMULA_NAME BusinessProcesses-PT-10-13
FORMULA_NAME BusinessProcesses-PT-10-14
FORMULA_NAME BusinessProcesses-PT-10-15

=== Now, execution of the tool begins

BK_START 1620544767183

Running Version 0
[2021-05-09 07:19:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-09 07:19:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 07:19:28] [INFO ] Load time of PNML (sax parser for PT used): 75 ms
[2021-05-09 07:19:28] [INFO ] Transformed 518 places.
[2021-05-09 07:19:28] [INFO ] Transformed 471 transitions.
[2021-05-09 07:19:28] [INFO ] Found NUPN structural information;
[2021-05-09 07:19:28] [INFO ] Parsed PT model containing 518 places and 471 transitions in 128 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2021-05-09 07:19:29] [INFO ] Initial state test concluded for 2 properties.
FORMULA BusinessProcesses-PT-10-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-10-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 38 out of 518 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 518/518 places, 471/471 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 517 transition count 471
Discarding 73 places :
Symmetric choice reduction at 1 with 73 rule applications. Total rules 74 place count 444 transition count 398
Iterating global reduction 1 with 73 rules applied. Total rules applied 147 place count 444 transition count 398
Discarding 36 places :
Symmetric choice reduction at 1 with 36 rule applications. Total rules 183 place count 408 transition count 362
Iterating global reduction 1 with 36 rules applied. Total rules applied 219 place count 408 transition count 362
Applied a total of 219 rules in 104 ms. Remains 408 /518 variables (removed 110) and now considering 362/471 (removed 109) transitions.
// Phase 1: matrix 362 rows 408 cols
[2021-05-09 07:19:29] [INFO ] Computed 84 place invariants in 33 ms
[2021-05-09 07:19:29] [INFO ] Implicit Places using invariants in 333 ms returned []
// Phase 1: matrix 362 rows 408 cols
[2021-05-09 07:19:29] [INFO ] Computed 84 place invariants in 17 ms
[2021-05-09 07:19:29] [INFO ] Implicit Places using invariants and state equation in 374 ms returned []
Implicit Place search using SMT with State Equation took 732 ms to find 0 implicit places.
// Phase 1: matrix 362 rows 408 cols
[2021-05-09 07:19:29] [INFO ] Computed 84 place invariants in 16 ms
[2021-05-09 07:19:30] [INFO ] Dead Transitions using invariants and state equation in 184 ms returned []
Finished structural reductions, in 1 iterations. Remains : 408/518 places, 362/471 transitions.
[2021-05-09 07:19:30] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-05-09 07:19:30] [INFO ] Flatten gal took : 51 ms
FORMULA BusinessProcesses-PT-10-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-10-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-09 07:19:30] [INFO ] Flatten gal took : 22 ms
[2021-05-09 07:19:30] [INFO ] Input system was already deterministic with 362 transitions.
Incomplete random walk after 100000 steps, including 816 resets, run finished after 243 ms. (steps per millisecond=411 ) properties (out of 25) seen :15
Running SMT prover for 10 properties.
// Phase 1: matrix 362 rows 408 cols
[2021-05-09 07:19:30] [INFO ] Computed 84 place invariants in 14 ms
[2021-05-09 07:19:30] [INFO ] [Real]Absence check using 45 positive place invariants in 15 ms returned sat
[2021-05-09 07:19:30] [INFO ] [Real]Absence check using 45 positive and 39 generalized place invariants in 10 ms returned sat
[2021-05-09 07:19:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:19:30] [INFO ] [Real]Absence check using state equation in 121 ms returned sat
[2021-05-09 07:19:30] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:19:31] [INFO ] [Nat]Absence check using 45 positive place invariants in 25 ms returned sat
[2021-05-09 07:19:31] [INFO ] [Nat]Absence check using 45 positive and 39 generalized place invariants in 9 ms returned sat
[2021-05-09 07:19:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:19:31] [INFO ] [Nat]Absence check using state equation in 194 ms returned unsat
[2021-05-09 07:19:31] [INFO ] [Real]Absence check using 45 positive place invariants in 23 ms returned sat
[2021-05-09 07:19:31] [INFO ] [Real]Absence check using 45 positive and 39 generalized place invariants in 18 ms returned sat
[2021-05-09 07:19:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:19:31] [INFO ] [Real]Absence check using state equation in 227 ms returned sat
[2021-05-09 07:19:31] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:19:31] [INFO ] [Nat]Absence check using 45 positive place invariants in 22 ms returned sat
[2021-05-09 07:19:31] [INFO ] [Nat]Absence check using 45 positive and 39 generalized place invariants in 9 ms returned sat
[2021-05-09 07:19:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:19:31] [INFO ] [Nat]Absence check using state equation in 189 ms returned sat
[2021-05-09 07:19:32] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 4 ms to minimize.
[2021-05-09 07:19:32] [INFO ] Deduced a trap composed of 25 places in 87 ms of which 1 ms to minimize.
[2021-05-09 07:19:32] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 1 ms to minimize.
[2021-05-09 07:19:32] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 342 ms
[2021-05-09 07:19:32] [INFO ] Computed and/alt/rep : 356/717/356 causal constraints (skipped 5 transitions) in 32 ms.
[2021-05-09 07:19:33] [INFO ] Added : 257 causal constraints over 52 iterations in 1493 ms. Result :sat
[2021-05-09 07:19:33] [INFO ] [Real]Absence check using 45 positive place invariants in 20 ms returned sat
[2021-05-09 07:19:33] [INFO ] [Real]Absence check using 45 positive and 39 generalized place invariants in 9 ms returned sat
[2021-05-09 07:19:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:19:33] [INFO ] [Real]Absence check using state equation in 102 ms returned unsat
[2021-05-09 07:19:34] [INFO ] [Real]Absence check using 45 positive place invariants in 10 ms returned sat
[2021-05-09 07:19:34] [INFO ] [Real]Absence check using 45 positive and 39 generalized place invariants in 6 ms returned sat
[2021-05-09 07:19:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:19:34] [INFO ] [Real]Absence check using state equation in 90 ms returned sat
[2021-05-09 07:19:34] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 1 ms to minimize.
[2021-05-09 07:19:34] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
[2021-05-09 07:19:34] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 1 ms to minimize.
[2021-05-09 07:19:34] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 1 ms to minimize.
[2021-05-09 07:19:34] [INFO ] Deduced a trap composed of 23 places in 23 ms of which 1 ms to minimize.
[2021-05-09 07:19:34] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 299 ms
[2021-05-09 07:19:34] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:19:34] [INFO ] [Nat]Absence check using 45 positive place invariants in 14 ms returned sat
[2021-05-09 07:19:34] [INFO ] [Nat]Absence check using 45 positive and 39 generalized place invariants in 9 ms returned sat
[2021-05-09 07:19:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:19:34] [INFO ] [Nat]Absence check using state equation in 120 ms returned sat
[2021-05-09 07:19:34] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
[2021-05-09 07:19:34] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 1 ms to minimize.
[2021-05-09 07:19:34] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 1 ms to minimize.
[2021-05-09 07:19:34] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 0 ms to minimize.
[2021-05-09 07:19:34] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 0 ms to minimize.
[2021-05-09 07:19:34] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 352 ms
[2021-05-09 07:19:35] [INFO ] Computed and/alt/rep : 356/717/356 causal constraints (skipped 5 transitions) in 23 ms.
[2021-05-09 07:19:36] [INFO ] Added : 244 causal constraints over 49 iterations in 1182 ms. Result :sat
[2021-05-09 07:19:36] [INFO ] [Real]Absence check using 45 positive place invariants in 13 ms returned sat
[2021-05-09 07:19:36] [INFO ] [Real]Absence check using 45 positive and 39 generalized place invariants in 9 ms returned sat
[2021-05-09 07:19:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:19:36] [INFO ] [Real]Absence check using state equation in 117 ms returned sat
[2021-05-09 07:19:36] [INFO ] Deduced a trap composed of 8 places in 78 ms of which 0 ms to minimize.
[2021-05-09 07:19:36] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 1 ms to minimize.
[2021-05-09 07:19:36] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
[2021-05-09 07:19:36] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 0 ms to minimize.
[2021-05-09 07:19:36] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 0 ms to minimize.
[2021-05-09 07:19:36] [INFO ] Deduced a trap composed of 25 places in 23 ms of which 0 ms to minimize.
[2021-05-09 07:19:36] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 393 ms
[2021-05-09 07:19:36] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:19:36] [INFO ] [Nat]Absence check using 45 positive place invariants in 10 ms returned sat
[2021-05-09 07:19:36] [INFO ] [Nat]Absence check using 45 positive and 39 generalized place invariants in 7 ms returned sat
[2021-05-09 07:19:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:19:36] [INFO ] [Nat]Absence check using state equation in 80 ms returned sat
[2021-05-09 07:19:36] [INFO ] Deduced a trap composed of 8 places in 64 ms of which 1 ms to minimize.
[2021-05-09 07:19:37] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 0 ms to minimize.
[2021-05-09 07:19:37] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 1 ms to minimize.
[2021-05-09 07:19:37] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 0 ms to minimize.
[2021-05-09 07:19:37] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
[2021-05-09 07:19:37] [INFO ] Deduced a trap composed of 25 places in 27 ms of which 0 ms to minimize.
[2021-05-09 07:19:37] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 398 ms
[2021-05-09 07:19:37] [INFO ] Computed and/alt/rep : 356/717/356 causal constraints (skipped 5 transitions) in 21 ms.
[2021-05-09 07:19:38] [INFO ] Added : 256 causal constraints over 52 iterations in 1362 ms. Result :sat
[2021-05-09 07:19:38] [INFO ] [Real]Absence check using 45 positive place invariants in 14 ms returned sat
[2021-05-09 07:19:38] [INFO ] [Real]Absence check using 45 positive and 39 generalized place invariants in 10 ms returned sat
[2021-05-09 07:19:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:19:38] [INFO ] [Real]Absence check using state equation in 131 ms returned sat
[2021-05-09 07:19:38] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 0 ms to minimize.
[2021-05-09 07:19:39] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 1 ms to minimize.
[2021-05-09 07:19:39] [INFO ] Deduced a trap composed of 23 places in 22 ms of which 1 ms to minimize.
[2021-05-09 07:19:39] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 240 ms
[2021-05-09 07:19:39] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:19:39] [INFO ] [Nat]Absence check using 45 positive place invariants in 34 ms returned sat
[2021-05-09 07:19:39] [INFO ] [Nat]Absence check using 45 positive and 39 generalized place invariants in 11 ms returned sat
[2021-05-09 07:19:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:19:39] [INFO ] [Nat]Absence check using state equation in 125 ms returned sat
[2021-05-09 07:19:39] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 1 ms to minimize.
[2021-05-09 07:19:39] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 1 ms to minimize.
[2021-05-09 07:19:39] [INFO ] Deduced a trap composed of 23 places in 21 ms of which 0 ms to minimize.
[2021-05-09 07:19:39] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 221 ms
[2021-05-09 07:19:39] [INFO ] Computed and/alt/rep : 356/717/356 causal constraints (skipped 5 transitions) in 26 ms.
[2021-05-09 07:19:41] [INFO ] Added : 253 causal constraints over 51 iterations in 1466 ms. Result :sat
[2021-05-09 07:19:41] [INFO ] [Real]Absence check using 45 positive place invariants in 18 ms returned sat
[2021-05-09 07:19:41] [INFO ] [Real]Absence check using 45 positive and 39 generalized place invariants in 12 ms returned sat
[2021-05-09 07:19:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:19:41] [INFO ] [Real]Absence check using state equation in 123 ms returned sat
[2021-05-09 07:19:41] [INFO ] Deduced a trap composed of 14 places in 113 ms of which 0 ms to minimize.
[2021-05-09 07:19:41] [INFO ] Deduced a trap composed of 65 places in 112 ms of which 0 ms to minimize.
[2021-05-09 07:19:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 292 ms
[2021-05-09 07:19:41] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:19:41] [INFO ] [Nat]Absence check using 45 positive place invariants in 16 ms returned sat
[2021-05-09 07:19:41] [INFO ] [Nat]Absence check using 45 positive and 39 generalized place invariants in 10 ms returned sat
[2021-05-09 07:19:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:19:41] [INFO ] [Nat]Absence check using state equation in 138 ms returned sat
[2021-05-09 07:19:41] [INFO ] Deduced a trap composed of 14 places in 100 ms of which 1 ms to minimize.
[2021-05-09 07:19:42] [INFO ] Deduced a trap composed of 65 places in 144 ms of which 6 ms to minimize.
[2021-05-09 07:19:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 315 ms
[2021-05-09 07:19:42] [INFO ] Computed and/alt/rep : 356/717/356 causal constraints (skipped 5 transitions) in 25 ms.
[2021-05-09 07:19:43] [INFO ] Deduced a trap composed of 71 places in 92 ms of which 1 ms to minimize.
[2021-05-09 07:19:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 181 ms
[2021-05-09 07:19:43] [INFO ] Added : 253 causal constraints over 51 iterations in 1441 ms. Result :sat
[2021-05-09 07:19:43] [INFO ] [Real]Absence check using 45 positive place invariants in 13 ms returned sat
[2021-05-09 07:19:43] [INFO ] [Real]Absence check using 45 positive and 39 generalized place invariants in 9 ms returned sat
[2021-05-09 07:19:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:19:43] [INFO ] [Real]Absence check using state equation in 118 ms returned sat
[2021-05-09 07:19:43] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:19:43] [INFO ] [Nat]Absence check using 45 positive place invariants in 17 ms returned sat
[2021-05-09 07:19:43] [INFO ] [Nat]Absence check using 45 positive and 39 generalized place invariants in 11 ms returned sat
[2021-05-09 07:19:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:19:44] [INFO ] [Nat]Absence check using state equation in 132 ms returned sat
[2021-05-09 07:19:44] [INFO ] Deduced a trap composed of 14 places in 118 ms of which 0 ms to minimize.
[2021-05-09 07:19:44] [INFO ] Deduced a trap composed of 40 places in 122 ms of which 1 ms to minimize.
[2021-05-09 07:19:44] [INFO ] Deduced a trap composed of 40 places in 93 ms of which 1 ms to minimize.
[2021-05-09 07:19:44] [INFO ] Deduced a trap composed of 49 places in 109 ms of which 0 ms to minimize.
[2021-05-09 07:19:44] [INFO ] Deduced a trap composed of 73 places in 89 ms of which 0 ms to minimize.
[2021-05-09 07:19:44] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 659 ms
[2021-05-09 07:19:44] [INFO ] Computed and/alt/rep : 356/717/356 causal constraints (skipped 5 transitions) in 24 ms.
[2021-05-09 07:19:45] [INFO ] Added : 244 causal constraints over 49 iterations in 1123 ms. Result :sat
[2021-05-09 07:19:45] [INFO ] [Real]Absence check using 45 positive place invariants in 17 ms returned sat
[2021-05-09 07:19:45] [INFO ] [Real]Absence check using 45 positive and 39 generalized place invariants in 11 ms returned sat
[2021-05-09 07:19:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:19:46] [INFO ] [Real]Absence check using state equation in 119 ms returned unsat
[2021-05-09 07:19:46] [INFO ] [Real]Absence check using 45 positive place invariants in 13 ms returned sat
[2021-05-09 07:19:46] [INFO ] [Real]Absence check using 45 positive and 39 generalized place invariants in 4 ms returned unsat
Successfully simplified 4 atomic propositions for a total of 12 simplifications.
[2021-05-09 07:19:46] [INFO ] Initial state test concluded for 2 properties.
FORMULA BusinessProcesses-PT-10-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-10-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 4 out of 408 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 408/408 places, 362/362 transitions.
Graph (trivial) has 184 edges and 408 vertex of which 6 / 408 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 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 41 rules applied. Total rules applied 42 place count 402 transition count 314
Reduce places removed 41 places and 0 transitions.
Iterating post reduction 1 with 41 rules applied. Total rules applied 83 place count 361 transition count 314
Performed 84 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 84 Pre rules applied. Total rules applied 83 place count 361 transition count 230
Deduced a syphon composed of 84 places in 1 ms
Ensure Unique test removed 13 places
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 2 with 181 rules applied. Total rules applied 264 place count 264 transition count 230
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 270 place count 258 transition count 224
Ensure Unique test removed 1 places
Iterating global reduction 2 with 7 rules applied. Total rules applied 277 place count 257 transition count 224
Performed 102 Post agglomeration using F-continuation condition.Transition count delta: 102
Deduced a syphon composed of 102 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 106 places and 0 transitions.
Iterating global reduction 2 with 208 rules applied. Total rules applied 485 place count 151 transition count 122
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 487 place count 150 transition count 125
Partial Post-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 493 place count 150 transition count 125
Applied a total of 493 rules in 63 ms. Remains 150 /408 variables (removed 258) and now considering 125/362 (removed 237) transitions.
// Phase 1: matrix 125 rows 150 cols
[2021-05-09 07:19:46] [INFO ] Computed 66 place invariants in 2 ms
[2021-05-09 07:19:46] [INFO ] Implicit Places using invariants in 87 ms returned [1, 2, 3, 4, 5, 6, 7, 20, 21, 22, 23, 24, 25, 48, 49]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 89 ms to find 15 implicit places.
[2021-05-09 07:19:46] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 125 rows 135 cols
[2021-05-09 07:19:46] [INFO ] Computed 51 place invariants in 1 ms
[2021-05-09 07:19:46] [INFO ] Dead Transitions using invariants and state equation in 61 ms returned []
Starting structural reductions, iteration 1 : 135/408 places, 125/362 transitions.
Applied a total of 0 rules in 6 ms. Remains 135 /135 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2021-05-09 07:19:46] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 125 rows 135 cols
[2021-05-09 07:19:46] [INFO ] Computed 51 place invariants in 1 ms
[2021-05-09 07:19:46] [INFO ] Dead Transitions using invariants and state equation in 66 ms returned []
Finished structural reductions, in 2 iterations. Remains : 135/408 places, 125/362 transitions.
Stuttering acceptance computed with spot in 154 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-10-00 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s42 1) (AND (EQ s15 1) (EQ s81 1) (EQ s125 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 2 ms.
FORMULA BusinessProcesses-PT-10-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-10-00 finished in 521 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((p0||G(p1)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 408 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 408/408 places, 362/362 transitions.
Graph (trivial) has 184 edges and 408 vertex of which 6 / 408 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 41 place count 402 transition count 315
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 1 with 40 rules applied. Total rules applied 81 place count 362 transition count 315
Performed 86 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 86 Pre rules applied. Total rules applied 81 place count 362 transition count 229
Deduced a syphon composed of 86 places in 1 ms
Ensure Unique test removed 13 places
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 2 with 185 rules applied. Total rules applied 266 place count 263 transition count 229
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 272 place count 257 transition count 223
Iterating global reduction 2 with 6 rules applied. Total rules applied 278 place count 257 transition count 223
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 101
Deduced a syphon composed of 101 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 105 places and 0 transitions.
Iterating global reduction 2 with 206 rules applied. Total rules applied 484 place count 152 transition count 122
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 486 place count 151 transition count 125
Applied a total of 486 rules in 58 ms. Remains 151 /408 variables (removed 257) and now considering 125/362 (removed 237) transitions.
// Phase 1: matrix 125 rows 151 cols
[2021-05-09 07:19:46] [INFO ] Computed 67 place invariants in 1 ms
[2021-05-09 07:19:46] [INFO ] Implicit Places using invariants in 104 ms returned [25, 26, 27, 28, 29, 30, 53, 54, 115]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 107 ms to find 9 implicit places.
[2021-05-09 07:19:46] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 125 rows 142 cols
[2021-05-09 07:19:46] [INFO ] Computed 58 place invariants in 2 ms
[2021-05-09 07:19:46] [INFO ] Dead Transitions using invariants and state equation in 83 ms returned []
Starting structural reductions, iteration 1 : 142/408 places, 125/362 transitions.
Applied a total of 0 rules in 14 ms. Remains 142 /142 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2021-05-09 07:19:46] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 125 rows 142 cols
[2021-05-09 07:19:46] [INFO ] Computed 58 place invariants in 7 ms
[2021-05-09 07:19:47] [INFO ] Dead Transitions using invariants and state equation in 84 ms returned []
Finished structural reductions, in 2 iterations. Remains : 142/408 places, 125/362 transitions.
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-10-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(NEQ s11 1), p0:(NEQ s10 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 14456 reset in 344 ms.
Product exploration explored 100000 steps with 14536 reset in 491 ms.
Knowledge obtained : [p1, p0]
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 14442 reset in 278 ms.
Product exploration explored 100000 steps with 14529 reset in 327 ms.
[2021-05-09 07:19:48] [INFO ] Flatten gal took : 11 ms
[2021-05-09 07:19:48] [INFO ] Flatten gal took : 10 ms
[2021-05-09 07:19:48] [INFO ] Time to serialize gal into /tmp/LTL13144124683133788555.gal : 5 ms
[2021-05-09 07:19:48] [INFO ] Time to serialize properties into /tmp/LTL6261019573906319809.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/LTL13144124683133788555.gal, -t, CGAL, -LTL, /tmp/LTL6261019573906319809.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/LTL13144124683133788555.gal -t CGAL -LTL /tmp/LTL6261019573906319809.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(F(("(p69!=1)")||(G("(p70!=1)"))))))
Formula 0 simplified : !GF("(p69!=1)" | G"(p70!=1)")
Detected timeout of ITS tools.
[2021-05-09 07:20:04] [INFO ] Flatten gal took : 34 ms
[2021-05-09 07:20:04] [INFO ] Applying decomposition
[2021-05-09 07:20:04] [INFO ] Flatten gal took : 20 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/graph1429324885777440068.txt, -o, /tmp/graph1429324885777440068.bin, -w, /tmp/graph1429324885777440068.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/graph1429324885777440068.bin, -l, -1, -v, -w, /tmp/graph1429324885777440068.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 07:20:04] [INFO ] Decomposing Gal with order
[2021-05-09 07:20:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 07:20:04] [INFO ] Removed a total of 104 redundant transitions.
[2021-05-09 07:20:04] [INFO ] Flatten gal took : 116 ms
[2021-05-09 07:20:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 39 labels/synchronizations in 24 ms.
[2021-05-09 07:20:04] [INFO ] Time to serialize gal into /tmp/LTL7897585159757018610.gal : 27 ms
[2021-05-09 07:20:04] [INFO ] Time to serialize properties into /tmp/LTL16159146627989390326.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/LTL7897585159757018610.gal, -t, CGAL, -LTL, /tmp/LTL16159146627989390326.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/LTL7897585159757018610.gal -t CGAL -LTL /tmp/LTL16159146627989390326.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((G(F(("(i0.u3.p69!=1)")||(G("(i2.i1.u4.p70!=1)"))))))
Formula 0 simplified : !GF("(i0.u3.p69!=1)" | G"(i2.i1.u4.p70!=1)")
Reverse transition relation is NOT exact ! Due to transitions t163_t165_t166_t2_t167, t160_t161_t3_t167, t157_t158_t4_t167, t154_t155_t5_t167, t27_t29_t30_t7, t24_t25_t8, t21_t22_t9, t18_t19_t10, t208_t216_t222_t226_t230_t234_t238, t71_t266_t60, t52_t136_t243_t250_t357_t244_t245_t60, t50_t51_t137_t138_t242_t353_t239_t240_t60, t49_t133_t235_t351_t236_t237_t60, t49_t120_t235_t349_t236_t237_t60, t48_t128_t129_t231_t251_t347_t232_t233_t60, t47_t114_t227_t249_t345_t228_t229_t60, t46_t126_t223_t252_t343_t224_t225_t60, t44_t45_t92_t340_t218_t219_t60, t37_t109_t110_t189_t248_t329_t190_t191_t60, t36_t104_t185_t253_t327_t186_t187_t60, t35_t107_t181_t247_t325_t182_t183_t60, t34_t89_t177_t254_t323_t178_t179_t60, t80_t277_t152_t167_t60, t74_t272_t152_t167_t60, t358_t143_t258_t144_t60, t62_t140_t142_t145_t149_t168_t172_t176_t180_t184_t188_t192_t200_t193_t199_t63_t66_t69_t72_t75_t78_t81_t84_t87_t90_t93_t96_t99_t102_t105_t108_t112_t115_t118_t121_t124_t127_t131_t134_t135_t132_t125_t122_t119_t116_t113_t106_t103_t100_t97_t94_t91_t88_t85_t82_t79_t76_t73_t70_t67_t64_t195_t196_t197_t198, t330_t60_t195_t196_t197_t198, i0.u3.t217, i4.i0.u5.t203.t205.t206.t1.t207, i4.i1.t331_t60_t195_t196_t194, i4.i1.u35.t40.t42.t43.t6, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :25/51/31/107
Computing Next relation with stutter on 4.98893e+07 deadlock states
2 unique states visited
0 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
820 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,8.26542,116780,1,0,138714,28000,2390,531374,1532,211641,177750
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA BusinessProcesses-PT-10-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property BusinessProcesses-PT-10-01 finished in 26675 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(((p0 U p1)&&G(p2)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 408 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 408/408 places, 362/362 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 402 transition count 356
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 402 transition count 356
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 401 transition count 355
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 401 transition count 355
Applied a total of 14 rules in 55 ms. Remains 401 /408 variables (removed 7) and now considering 355/362 (removed 7) transitions.
// Phase 1: matrix 355 rows 401 cols
[2021-05-09 07:20:13] [INFO ] Computed 84 place invariants in 2 ms
[2021-05-09 07:20:13] [INFO ] Implicit Places using invariants in 293 ms returned []
// Phase 1: matrix 355 rows 401 cols
[2021-05-09 07:20:13] [INFO ] Computed 84 place invariants in 2 ms
[2021-05-09 07:20:14] [INFO ] Implicit Places using invariants and state equation in 402 ms returned []
Implicit Place search using SMT with State Equation took 696 ms to find 0 implicit places.
// Phase 1: matrix 355 rows 401 cols
[2021-05-09 07:20:14] [INFO ] Computed 84 place invariants in 7 ms
[2021-05-09 07:20:14] [INFO ] Dead Transitions using invariants and state equation in 185 ms returned []
Finished structural reductions, in 1 iterations. Remains : 401/408 places, 355/362 transitions.
Stuttering acceptance computed with spot in 161 ms :[(NOT p2), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), true, (OR (NOT p1) (NOT p2))]
Running random walk in product with property : BusinessProcesses-PT-10-02 automaton TGBA [mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND p1 p2), acceptance={0} source=4 dest: 0}, { cond=(OR (AND (NOT p1) (NOT p0)) (NOT p2)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p1) p0 p2), acceptance={0} source=4 dest: 4}]], initial=2, aps=[p2:(AND (EQ s333 1) (EQ s215 1)), p1:(EQ s15 0), p0:(EQ s15 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-10-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-10-02 finished in 1116 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 408 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 408/408 places, 362/362 transitions.
Graph (trivial) has 184 edges and 408 vertex of which 6 / 408 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 41 place count 402 transition count 315
Reduce places removed 40 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 41 rules applied. Total rules applied 82 place count 362 transition count 314
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 83 place count 361 transition count 314
Performed 85 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 85 Pre rules applied. Total rules applied 83 place count 361 transition count 229
Deduced a syphon composed of 85 places in 1 ms
Ensure Unique test removed 13 places
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 3 with 183 rules applied. Total rules applied 266 place count 263 transition count 229
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 272 place count 257 transition count 223
Ensure Unique test removed 1 places
Iterating global reduction 3 with 7 rules applied. Total rules applied 279 place count 256 transition count 223
Performed 103 Post agglomeration using F-continuation condition.Transition count delta: 103
Deduced a syphon composed of 103 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 107 places and 0 transitions.
Iterating global reduction 3 with 210 rules applied. Total rules applied 489 place count 149 transition count 120
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 491 place count 148 transition count 123
Applied a total of 491 rules in 46 ms. Remains 148 /408 variables (removed 260) and now considering 123/362 (removed 239) transitions.
// Phase 1: matrix 123 rows 148 cols
[2021-05-09 07:20:14] [INFO ] Computed 66 place invariants in 2 ms
[2021-05-09 07:20:14] [INFO ] Implicit Places using invariants in 131 ms returned [1, 2, 3, 4, 5, 6, 7, 20, 21, 22, 23, 24, 25, 49]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 132 ms to find 14 implicit places.
[2021-05-09 07:20:14] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 123 rows 134 cols
[2021-05-09 07:20:14] [INFO ] Computed 52 place invariants in 9 ms
[2021-05-09 07:20:14] [INFO ] Dead Transitions using invariants and state equation in 85 ms returned []
Starting structural reductions, iteration 1 : 134/408 places, 123/362 transitions.
Applied a total of 0 rules in 6 ms. Remains 134 /134 variables (removed 0) and now considering 123/123 (removed 0) transitions.
[2021-05-09 07:20:14] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 123 rows 134 cols
[2021-05-09 07:20:14] [INFO ] Computed 52 place invariants in 1 ms
[2021-05-09 07:20:14] [INFO ] Dead Transitions using invariants and state equation in 69 ms returned []
Finished structural reductions, in 2 iterations. Remains : 134/408 places, 123/362 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-10-03 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:(OR (EQ s15 1) (EQ s37 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-10-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-10-03 finished in 411 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(G(p0))||((!p0 U p1)&&F(p2))))], workingDir=/home/mcc/execution]
Support contains 2 out of 408 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 408/408 places, 362/362 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 402 transition count 356
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 402 transition count 356
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 401 transition count 355
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 401 transition count 355
Applied a total of 14 rules in 22 ms. Remains 401 /408 variables (removed 7) and now considering 355/362 (removed 7) transitions.
// Phase 1: matrix 355 rows 401 cols
[2021-05-09 07:20:14] [INFO ] Computed 84 place invariants in 3 ms
[2021-05-09 07:20:14] [INFO ] Implicit Places using invariants in 133 ms returned []
// Phase 1: matrix 355 rows 401 cols
[2021-05-09 07:20:15] [INFO ] Computed 84 place invariants in 3 ms
[2021-05-09 07:20:15] [INFO ] Implicit Places using invariants and state equation in 318 ms returned []
Implicit Place search using SMT with State Equation took 457 ms to find 0 implicit places.
// Phase 1: matrix 355 rows 401 cols
[2021-05-09 07:20:15] [INFO ] Computed 84 place invariants in 2 ms
[2021-05-09 07:20:15] [INFO ] Dead Transitions using invariants and state equation in 165 ms returned []
Finished structural reductions, in 1 iterations. Remains : 401/408 places, 355/362 transitions.
Stuttering acceptance computed with spot in 155 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0)), true, (NOT p1), (NOT p2)]
Running random walk in product with property : BusinessProcesses-PT-10-04 automaton TGBA [mat=[[{ cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(OR (AND p1 (NOT p2)) (AND (NOT p0) (NOT p2))), acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 5}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 6}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=5 dest: 4}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=5 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p1:(AND (EQ s224 1) (EQ s39 1)), p0:(NEQ s39 1), p2:(EQ s224 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][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 819 reset in 207 ms.
Product exploration explored 100000 steps with 820 reset in 228 ms.
Graph (complete) has 928 edges and 401 vertex of which 400 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Knowledge obtained : [(NOT p1), p0, (NOT p2)]
Stuttering acceptance computed with spot in 202 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0)), true, (NOT p1), (NOT p2)]
Product exploration explored 100000 steps with 831 reset in 166 ms.
Product exploration explored 100000 steps with 823 reset in 177 ms.
Applying partial POR strategy [false, true, true, true, true, true, true]
Stuttering acceptance computed with spot in 191 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0)), true, (NOT p1), (NOT p2)]
Support contains 2 out of 401 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 401/401 places, 355/355 transitions.
Graph (trivial) has 176 edges and 401 vertex of which 6 / 401 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 36 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 36 rules applied. Total rules applied 37 place count 396 transition count 349
Performed 82 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 82 Pre rules applied. Total rules applied 37 place count 396 transition count 538
Deduced a syphon composed of 118 places in 0 ms
Iterating global reduction 1 with 82 rules applied. Total rules applied 119 place count 396 transition count 538
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 131 place count 384 transition count 495
Deduced a syphon composed of 106 places in 0 ms
Iterating global reduction 1 with 12 rules applied. Total rules applied 143 place count 384 transition count 495
Performed 109 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 215 places in 0 ms
Iterating global reduction 1 with 109 rules applied. Total rules applied 252 place count 384 transition count 495
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 277 place count 359 transition count 470
Deduced a syphon composed of 190 places in 0 ms
Iterating global reduction 1 with 25 rules applied. Total rules applied 302 place count 359 transition count 470
Deduced a syphon composed of 190 places in 0 ms
Applied a total of 302 rules in 60 ms. Remains 359 /401 variables (removed 42) and now considering 470/355 (removed -115) transitions.
[2021-05-09 07:20:17] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 470 rows 359 cols
[2021-05-09 07:20:17] [INFO ] Computed 84 place invariants in 4 ms
[2021-05-09 07:20:17] [INFO ] Dead Transitions using invariants and state equation in 255 ms returned []
Finished structural reductions, in 1 iterations. Remains : 359/401 places, 470/355 transitions.
Product exploration explored 100000 steps with 25000 reset in 768 ms.
Product exploration explored 100000 steps with 25000 reset in 632 ms.
[2021-05-09 07:20:18] [INFO ] Flatten gal took : 16 ms
[2021-05-09 07:20:18] [INFO ] Flatten gal took : 15 ms
[2021-05-09 07:20:19] [INFO ] Time to serialize gal into /tmp/LTL15049348340271065996.gal : 11 ms
[2021-05-09 07:20:19] [INFO ] Time to serialize properties into /tmp/LTL9502364215139178426.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/LTL15049348340271065996.gal, -t, CGAL, -LTL, /tmp/LTL9502364215139178426.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/LTL15049348340271065996.gal -t CGAL -LTL /tmp/LTL9502364215139178426.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((X(G("(p46!=1)")))||((("(p46==1)")U("((p252==1)&&(p46==1))"))&&(F("(p252==1)")))))
Formula 0 simplified : !(XG"(p46!=1)" | (("(p46==1)" U "((p252==1)&&(p46==1))") & F"(p252==1)"))
Detected timeout of ITS tools.
[2021-05-09 07:20:34] [INFO ] Flatten gal took : 50 ms
[2021-05-09 07:20:34] [INFO ] Applying decomposition
[2021-05-09 07:20:34] [INFO ] Flatten gal took : 25 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/graph10735780722455875561.txt, -o, /tmp/graph10735780722455875561.bin, -w, /tmp/graph10735780722455875561.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/graph10735780722455875561.bin, -l, -1, -v, -w, /tmp/graph10735780722455875561.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 07:20:34] [INFO ] Decomposing Gal with order
[2021-05-09 07:20:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 07:20:34] [INFO ] Removed a total of 249 redundant transitions.
[2021-05-09 07:20:34] [INFO ] Flatten gal took : 44 ms
[2021-05-09 07:20:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 10 ms.
[2021-05-09 07:20:34] [INFO ] Time to serialize gal into /tmp/LTL13350190924150979367.gal : 6 ms
[2021-05-09 07:20:34] [INFO ] Time to serialize properties into /tmp/LTL14246603113157962755.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/LTL13350190924150979367.gal, -t, CGAL, -LTL, /tmp/LTL14246603113157962755.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/LTL13350190924150979367.gal -t CGAL -LTL /tmp/LTL14246603113157962755.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !(((X(G("(i13.i0.u16.p46!=1)")))||((("(i13.i0.u16.p46==1)")U("((i13.i1.u85.p252==1)&&(i13.i0.u16.p46==1))"))&&(F("(i13.i1.u85.p252==1)")))))
Formula 0 simplified : !(XG"(i13.i0.u16.p46!=1)" | (("(i13.i0.u16.p46==1)" U "((i13.i1.u85.p252==1)&&(i13.i0.u16.p46==1))") & F"(i13.i1.u85.p252==1)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15044509227315661626
[2021-05-09 07:20:49] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15044509227315661626
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/ltsmin15044509227315661626]
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/ltsmin15044509227315661626] 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/ltsmin15044509227315661626] 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-10-04 finished in 35557 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((X(p0)||G((p1&&F(p2))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 408 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 408/408 places, 362/362 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 403 transition count 357
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 403 transition count 357
Applied a total of 10 rules in 59 ms. Remains 403 /408 variables (removed 5) and now considering 357/362 (removed 5) transitions.
// Phase 1: matrix 357 rows 403 cols
[2021-05-09 07:20:50] [INFO ] Computed 84 place invariants in 5 ms
[2021-05-09 07:20:50] [INFO ] Implicit Places using invariants in 179 ms returned []
// Phase 1: matrix 357 rows 403 cols
[2021-05-09 07:20:50] [INFO ] Computed 84 place invariants in 3 ms
[2021-05-09 07:20:51] [INFO ] Implicit Places using invariants and state equation in 372 ms returned []
Implicit Place search using SMT with State Equation took 555 ms to find 0 implicit places.
// Phase 1: matrix 357 rows 403 cols
[2021-05-09 07:20:51] [INFO ] Computed 84 place invariants in 3 ms
[2021-05-09 07:20:51] [INFO ] Dead Transitions using invariants and state equation in 221 ms returned []
Finished structural reductions, in 1 iterations. Remains : 403/408 places, 357/362 transitions.
Stuttering acceptance computed with spot in 135 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 p2) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-10-05 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(EQ s251 1), p2:(EQ s357 1), p0:(AND (EQ s163 1) (EQ s166 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 140 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-10-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-10-05 finished in 1006 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G(p0))))], workingDir=/home/mcc/execution]
Support contains 1 out of 408 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 408/408 places, 362/362 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 401 transition count 355
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 401 transition count 355
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 400 transition count 354
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 400 transition count 354
Applied a total of 16 rules in 37 ms. Remains 400 /408 variables (removed 8) and now considering 354/362 (removed 8) transitions.
// Phase 1: matrix 354 rows 400 cols
[2021-05-09 07:20:51] [INFO ] Computed 84 place invariants in 4 ms
[2021-05-09 07:20:51] [INFO ] Implicit Places using invariants in 177 ms returned []
// Phase 1: matrix 354 rows 400 cols
[2021-05-09 07:20:51] [INFO ] Computed 84 place invariants in 3 ms
[2021-05-09 07:20:52] [INFO ] Implicit Places using invariants and state equation in 406 ms returned []
Implicit Place search using SMT with State Equation took 585 ms to find 0 implicit places.
// Phase 1: matrix 354 rows 400 cols
[2021-05-09 07:20:52] [INFO ] Computed 84 place invariants in 3 ms
[2021-05-09 07:20:52] [INFO ] Dead Transitions using invariants and state equation in 234 ms returned []
Finished structural reductions, in 1 iterations. Remains : 400/408 places, 354/362 transitions.
Stuttering acceptance computed with spot in 129 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-10-06 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(NEQ s0 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, null][false, false, false, false]]
Product exploration explored 100000 steps with 823 reset in 177 ms.
Product exploration explored 100000 steps with 817 reset in 178 ms.
Graph (complete) has 927 edges and 400 vertex of which 399 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.9 ms
Knowledge obtained : [(NOT p0)]
Stuttering acceptance computed with spot in 106 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 814 reset in 169 ms.
Product exploration explored 100000 steps with 823 reset in 180 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 150 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 400 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 400/400 places, 354/354 transitions.
Graph (trivial) has 178 edges and 400 vertex of which 6 / 400 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 36 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 36 rules applied. Total rules applied 37 place count 395 transition count 348
Performed 83 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 83 Pre rules applied. Total rules applied 37 place count 395 transition count 542
Deduced a syphon composed of 119 places in 1 ms
Iterating global reduction 1 with 83 rules applied. Total rules applied 120 place count 395 transition count 542
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 132 place count 383 transition count 497
Deduced a syphon composed of 107 places in 0 ms
Iterating global reduction 1 with 12 rules applied. Total rules applied 144 place count 383 transition count 497
Performed 110 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 217 places in 0 ms
Iterating global reduction 1 with 110 rules applied. Total rules applied 254 place count 383 transition count 497
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 279 place count 358 transition count 472
Deduced a syphon composed of 192 places in 0 ms
Iterating global reduction 1 with 25 rules applied. Total rules applied 304 place count 358 transition count 472
Deduced a syphon composed of 192 places in 0 ms
Applied a total of 304 rules in 89 ms. Remains 358 /400 variables (removed 42) and now considering 472/354 (removed -118) transitions.
[2021-05-09 07:20:53] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 472 rows 358 cols
[2021-05-09 07:20:53] [INFO ] Computed 84 place invariants in 13 ms
[2021-05-09 07:20:53] [INFO ] Dead Transitions using invariants and state equation in 257 ms returned []
Finished structural reductions, in 1 iterations. Remains : 358/400 places, 472/354 transitions.
Product exploration explored 100000 steps with 14269 reset in 438 ms.
Product exploration explored 100000 steps with 14256 reset in 449 ms.
[2021-05-09 07:20:54] [INFO ] Flatten gal took : 14 ms
[2021-05-09 07:20:54] [INFO ] Flatten gal took : 13 ms
[2021-05-09 07:20:54] [INFO ] Time to serialize gal into /tmp/LTL16384508316365321282.gal : 2 ms
[2021-05-09 07:20:54] [INFO ] Time to serialize properties into /tmp/LTL13460422691378142531.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/LTL16384508316365321282.gal, -t, CGAL, -LTL, /tmp/LTL13460422691378142531.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/LTL16384508316365321282.gal -t CGAL -LTL /tmp/LTL13460422691378142531.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(G("(p0!=1)")))))
Formula 0 simplified : !XXG"(p0!=1)"
Detected timeout of ITS tools.
[2021-05-09 07:21:09] [INFO ] Flatten gal took : 62 ms
[2021-05-09 07:21:09] [INFO ] Applying decomposition
[2021-05-09 07:21:09] [INFO ] Flatten gal took : 24 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/graph16797073355383083797.txt, -o, /tmp/graph16797073355383083797.bin, -w, /tmp/graph16797073355383083797.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/graph16797073355383083797.bin, -l, -1, -v, -w, /tmp/graph16797073355383083797.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 07:21:10] [INFO ] Decomposing Gal with order
[2021-05-09 07:21:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 07:21:10] [INFO ] Removed a total of 249 redundant transitions.
[2021-05-09 07:21:10] [INFO ] Flatten gal took : 32 ms
[2021-05-09 07:21:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 6 ms.
[2021-05-09 07:21:10] [INFO ] Time to serialize gal into /tmp/LTL13782512890086725907.gal : 6 ms
[2021-05-09 07:21:10] [INFO ] Time to serialize properties into /tmp/LTL6213573767142019436.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/LTL13782512890086725907.gal, -t, CGAL, -LTL, /tmp/LTL6213573767142019436.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/LTL13782512890086725907.gal -t CGAL -LTL /tmp/LTL6213573767142019436.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(X(G("(i0.i0.u0.p0!=1)")))))
Formula 0 simplified : !XXG"(i0.i0.u0.p0!=1)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6376593944145492436
[2021-05-09 07:21:25] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6376593944145492436
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/ltsmin6376593944145492436]
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/ltsmin6376593944145492436] 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/ltsmin6376593944145492436] 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-10-06 finished in 34752 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 3 out of 408 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 408/408 places, 362/362 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 39 place count 407 transition count 322
Reduce places removed 39 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 41 rules applied. Total rules applied 80 place count 368 transition count 320
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 82 place count 366 transition count 320
Performed 88 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 88 Pre rules applied. Total rules applied 82 place count 366 transition count 232
Deduced a syphon composed of 88 places in 0 ms
Ensure Unique test removed 13 places
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 189 rules applied. Total rules applied 271 place count 265 transition count 232
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 278 place count 258 transition count 225
Ensure Unique test removed 1 places
Iterating global reduction 3 with 8 rules applied. Total rules applied 286 place count 257 transition count 225
Performed 103 Post agglomeration using F-continuation condition.Transition count delta: 103
Deduced a syphon composed of 103 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 107 places and 0 transitions.
Iterating global reduction 3 with 210 rules applied. Total rules applied 496 place count 150 transition count 122
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 497 place count 150 transition count 121
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 499 place count 149 transition count 124
Applied a total of 499 rules in 43 ms. Remains 149 /408 variables (removed 259) and now considering 124/362 (removed 238) transitions.
// Phase 1: matrix 124 rows 149 cols
[2021-05-09 07:21:26] [INFO ] Computed 66 place invariants in 2 ms
[2021-05-09 07:21:26] [INFO ] Implicit Places using invariants in 85 ms returned [22, 23, 24, 25, 26, 27, 50, 51]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 86 ms to find 8 implicit places.
[2021-05-09 07:21:26] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 124 rows 141 cols
[2021-05-09 07:21:26] [INFO ] Computed 58 place invariants in 2 ms
[2021-05-09 07:21:26] [INFO ] Dead Transitions using invariants and state equation in 80 ms returned []
Starting structural reductions, iteration 1 : 141/408 places, 124/362 transitions.
Applied a total of 0 rules in 4 ms. Remains 141 /141 variables (removed 0) and now considering 124/124 (removed 0) transitions.
[2021-05-09 07:21:26] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 124 rows 141 cols
[2021-05-09 07:21:26] [INFO ] Computed 58 place invariants in 2 ms
[2021-05-09 07:21:26] [INFO ] Dead Transitions using invariants and state equation in 55 ms returned []
Finished structural reductions, in 2 iterations. Remains : 141/408 places, 124/362 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-10-10 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(OR (NEQ s8 1) (NEQ s80 1) (NEQ s116 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 11535 reset in 199 ms.
Stack based approach found an accepted trace after 2389 steps with 273 reset with depth 21 and stack size 21 in 8 ms.
FORMULA BusinessProcesses-PT-10-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-10-10 finished in 551 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X(F(p0)))))], workingDir=/home/mcc/execution]
Support contains 1 out of 408 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 408/408 places, 362/362 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 401 transition count 355
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 401 transition count 355
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 400 transition count 354
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 400 transition count 354
Applied a total of 16 rules in 14 ms. Remains 400 /408 variables (removed 8) and now considering 354/362 (removed 8) transitions.
// Phase 1: matrix 354 rows 400 cols
[2021-05-09 07:21:26] [INFO ] Computed 84 place invariants in 4 ms
[2021-05-09 07:21:26] [INFO ] Implicit Places using invariants in 161 ms returned []
// Phase 1: matrix 354 rows 400 cols
[2021-05-09 07:21:26] [INFO ] Computed 84 place invariants in 6 ms
[2021-05-09 07:21:27] [INFO ] Implicit Places using invariants and state equation in 448 ms returned []
Implicit Place search using SMT with State Equation took 611 ms to find 0 implicit places.
// Phase 1: matrix 354 rows 400 cols
[2021-05-09 07:21:27] [INFO ] Computed 84 place invariants in 5 ms
[2021-05-09 07:21:27] [INFO ] Dead Transitions using invariants and state equation in 194 ms returned []
Finished structural reductions, in 1 iterations. Remains : 400/408 places, 354/362 transitions.
Stuttering acceptance computed with spot in 115 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-10-12 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(EQ s120 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 148 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-10-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-10-12 finished in 950 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)&&F(G(p1))))], workingDir=/home/mcc/execution]
Support contains 2 out of 408 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 408/408 places, 362/362 transitions.
Graph (trivial) has 185 edges and 408 vertex of which 6 / 408 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.
Drop transitions removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 41 rules applied. Total rules applied 42 place count 403 transition count 315
Reduce places removed 41 places and 0 transitions.
Iterating post reduction 1 with 41 rules applied. Total rules applied 83 place count 362 transition count 315
Performed 86 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 86 Pre rules applied. Total rules applied 83 place count 362 transition count 229
Deduced a syphon composed of 86 places in 0 ms
Ensure Unique test removed 13 places
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 2 with 185 rules applied. Total rules applied 268 place count 263 transition count 229
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 274 place count 257 transition count 223
Ensure Unique test removed 1 places
Iterating global reduction 2 with 7 rules applied. Total rules applied 281 place count 256 transition count 223
Performed 104 Post agglomeration using F-continuation condition.Transition count delta: 104
Deduced a syphon composed of 104 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 108 places and 0 transitions.
Iterating global reduction 2 with 212 rules applied. Total rules applied 493 place count 148 transition count 119
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 495 place count 147 transition count 122
Applied a total of 495 rules in 29 ms. Remains 147 /408 variables (removed 261) and now considering 122/362 (removed 240) transitions.
// Phase 1: matrix 122 rows 147 cols
[2021-05-09 07:21:27] [INFO ] Computed 66 place invariants in 3 ms
[2021-05-09 07:21:27] [INFO ] Implicit Places using invariants in 142 ms returned [1, 2, 3, 4, 5, 6, 7, 20, 21, 22, 23, 24, 25, 48, 49]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 143 ms to find 15 implicit places.
[2021-05-09 07:21:27] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 122 rows 132 cols
[2021-05-09 07:21:27] [INFO ] Computed 51 place invariants in 1 ms
[2021-05-09 07:21:27] [INFO ] Dead Transitions using invariants and state equation in 75 ms returned []
Starting structural reductions, iteration 1 : 132/408 places, 122/362 transitions.
Applied a total of 0 rules in 4 ms. Remains 132 /132 variables (removed 0) and now considering 122/122 (removed 0) transitions.
[2021-05-09 07:21:27] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 122 rows 132 cols
[2021-05-09 07:21:27] [INFO ] Computed 51 place invariants in 1 ms
[2021-05-09 07:21:28] [INFO ] Dead Transitions using invariants and state equation in 93 ms returned []
Finished structural reductions, in 2 iterations. Remains : 132/408 places, 122/362 transitions.
Stuttering acceptance computed with spot in 137 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-10-14 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(OR (AND (NEQ s100 1) (NEQ s0 1)) (NEQ s0 1)), p1:(NEQ s100 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 26675 reset in 345 ms.
Product exploration explored 100000 steps with 26758 reset in 345 ms.
Knowledge obtained : [(NOT p0), p1]
Stuttering acceptance computed with spot in 99 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 26487 reset in 281 ms.
Product exploration explored 100000 steps with 27003 reset in 363 ms.
[2021-05-09 07:21:29] [INFO ] Flatten gal took : 15 ms
[2021-05-09 07:21:29] [INFO ] Flatten gal took : 12 ms
[2021-05-09 07:21:29] [INFO ] Time to serialize gal into /tmp/LTL9044906397072598796.gal : 3 ms
[2021-05-09 07:21:29] [INFO ] Time to serialize properties into /tmp/LTL18384655108112953595.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/LTL9044906397072598796.gal, -t, CGAL, -LTL, /tmp/LTL18384655108112953595.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/LTL9044906397072598796.gal -t CGAL -LTL /tmp/LTL18384655108112953595.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((F("(((p447!=1)&&(p0!=1))||(p0!=1))"))&&(F(G("(p447!=1)")))))
Formula 0 simplified : !(F"(((p447!=1)&&(p0!=1))||(p0!=1))" & FG"(p447!=1)")
Reverse transition relation is NOT exact ! Due to transitions t33, t339, t163.t165.t166.t2.t167, t160.t161.t3.t167, t157.t158.t4.t167, t154.t155.t5.t167, t40.t42.t43.t6, t27.t29.t30.t7, t24.t25.t8, t21.t22.t9, t18.t19.t10, t52.t136.t243.t250.t357.t244.t245.t60, t50.t51.t137.t138.t242.t353.t239.t240.t60, t49.t133.t235.t351.t236.t237.t60, t49.t123.t235.t350.t236.t237.t60, t49.t120.t235.t349.t236.t237.t60, t48.t128.t129.t231.t251.t347.t232.t233.t60, t47.t114.t227.t249.t345.t228.t229.t60, t46.t126.t223.t252.t343.t224.t225.t60, t44.t45.t92.t220.t221.t340.t218.t219.t60, t37.t109.t110.t189.t248.t329.t190.t191.t60, t36.t104.t185.t253.t327.t186.t187.t60, t35.t107.t181.t247.t325.t182.t183.t60, t34.t89.t177.t254.t323.t178.t179.t60, t80.t277.t152.t167.t60, t74.t272.t152.t167.t60, t71.t267.t152.t167.t60, t330.t60.t195.t196.t194, t330.t60.t195.t196.t197.t198, t331.t60.t195.t196.t194, t331.t60.t195.t196.t197.t198, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :36/55/31/122
Computing Next relation with stutter on 4.98893e+07 deadlock states
Detected timeout of ITS tools.
[2021-05-09 07:21:44] [INFO ] Flatten gal took : 15 ms
[2021-05-09 07:21:44] [INFO ] Applying decomposition
[2021-05-09 07:21:44] [INFO ] Flatten gal took : 13 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/graph2510327913910991499.txt, -o, /tmp/graph2510327913910991499.bin, -w, /tmp/graph2510327913910991499.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/graph2510327913910991499.bin, -l, -1, -v, -w, /tmp/graph2510327913910991499.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 07:21:44] [INFO ] Decomposing Gal with order
[2021-05-09 07:21:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 07:21:44] [INFO ] Removed a total of 90 redundant transitions.
[2021-05-09 07:21:44] [INFO ] Flatten gal took : 20 ms
[2021-05-09 07:21:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 32 labels/synchronizations in 9 ms.
[2021-05-09 07:21:44] [INFO ] Time to serialize gal into /tmp/LTL8158112168715837132.gal : 3 ms
[2021-05-09 07:21:44] [INFO ] Time to serialize properties into /tmp/LTL17039178210161743363.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/LTL8158112168715837132.gal, -t, CGAL, -LTL, /tmp/LTL17039178210161743363.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/LTL8158112168715837132.gal -t CGAL -LTL /tmp/LTL17039178210161743363.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !(((F("(((i6.u29.p447!=1)&&(i1.i2.u28.p0!=1))||(i1.i2.u28.p0!=1))"))&&(F(G("(i6.u29.p447!=1)")))))
Formula 0 simplified : !(F"(((i6.u29.p447!=1)&&(i1.i2.u28.p0!=1))||(i1.i2.u28.p0!=1))" & FG"(i6.u29.p447!=1)")
Reverse transition relation is NOT exact ! Due to transitions t163_t165_t166_t2_t167, t160_t161_t3_t167, t157_t158_t4_t167, t154_t155_t5_t167, t27_t29_t30_t7, t24_t25_t8, t21_t22_t9, t18_t19_t10, t80_t275_t60, t44_t45_t92_t220_t221_t340_t218_t219_t60, t37_t109_t110_t189_t248_t329_t190_t191_t60, t36_t104_t185_t253_t327_t186_t187_t60, t35_t107_t181_t247_t325_t182_t183_t60, t74_t272_t152_t167_t60, t71_t267_t152_t167_t60, t330_t60_t195_t196_t194, t331_t60_t195_t196_t194, i6.t34_t89_t177_t254_t323_t178_t179_t60, i6.t46_t126_t223_t252_t343_t224_t225_t60, i6.t47_t114_t227_t249_t345_t228_t229_t60, i6.t48_t128_t129_t231_t251_t347_t232_t233_t60, i6.t49_t120_t235_t349_t236_t237_t60, i6.t49_t123_t235_t350_t236_t237_t60, i6.t49_t133_t235_t351_t236_t237_t60, i6.t50_t51_t137_t138_t242_t353_t239_t240_t60, i6.t52_t136_t243_t250_t357_t244_t245_t60, i6.t339, i6.u29.t33, i6.u29.t40.t42.t43.t6, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :25/53/29/107
Computing Next relation with stutter on 4.98893e+07 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17026681100140805283
[2021-05-09 07:21:59] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17026681100140805283
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/ltsmin17026681100140805283]
Compilation finished in 531 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin17026681100140805283]
Link finished in 53 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))&&<>([]((LTLAPp1==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin17026681100140805283]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property BusinessProcesses-PT-10-14 finished in 47286 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin14195679911622591075
[2021-05-09 07:22:14] [INFO ] Applying decomposition
[2021-05-09 07:22:14] [INFO ] Computing symmetric may disable matrix : 362 transitions.
[2021-05-09 07:22:14] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-09 07:22:14] [INFO ] Computing symmetric may enable matrix : 362 transitions.
[2021-05-09 07:22:14] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-09 07:22:14] [INFO ] Flatten gal took : 10 ms
[2021-05-09 07:22:15] [INFO ] Computing Do-Not-Accords matrix : 362 transitions.
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/graph6777110414872965166.txt, -o, /tmp/graph6777110414872965166.bin, -w, /tmp/graph6777110414872965166.weights], workingDir=null]
[2021-05-09 07:22:15] [INFO ] Computation of Completed DNA matrix. took 16 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph6777110414872965166.bin, -l, -1, -v, -w, /tmp/graph6777110414872965166.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 07:22:15] [INFO ] Built C files in 97ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14195679911622591075
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/ltsmin14195679911622591075]
[2021-05-09 07:22:15] [INFO ] Decomposing Gal with order
[2021-05-09 07:22:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 07:22:15] [INFO ] Removed a total of 250 redundant transitions.
[2021-05-09 07:22:15] [INFO ] Flatten gal took : 36 ms
[2021-05-09 07:22:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2021-05-09 07:22:15] [INFO ] Time to serialize gal into /tmp/LTLFireability7681105409812570045.gal : 4 ms
[2021-05-09 07:22:15] [INFO ] Time to serialize properties into /tmp/LTLFireability16763613392590468864.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/LTLFireability7681105409812570045.gal, -t, CGAL, -LTL, /tmp/LTLFireability16763613392590468864.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/LTLFireability7681105409812570045.gal -t CGAL -LTL /tmp/LTLFireability16763613392590468864.ltl -c -stutter-deadlock
Read 3 LTL properties
Checking formula 0 : !((((("(i2.u14.p46==1)")U("((i16.i1.u85.p252==1)&&(i2.u14.p46==1))"))&&(F("(i16.i1.u85.p252==1)")))||(X(G("(i2.u14.p46!=1)")))))
Formula 0 simplified : !((("(i2.u14.p46==1)" U "((i16.i1.u85.p252==1)&&(i2.u14.p46==1))") & F"(i16.i1.u85.p252==1)") | XG"(i2.u14.p46!=1)")
Compilation finished in 1704 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin14195679911622591075]
Link finished in 69 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, (X([]((LTLAPp0==true)))||((!(LTLAPp0==true) U (LTLAPp1==true))&&<>((LTLAPp2==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin14195679911622591075]
Reverse transition relation is NOT exact ! Due to transitions t2, t5, t7, t8, t9, t10, t20, t232, t236, t262, t286, t318, t328, t344, t432, t434, t436, t438, t439, t440, t449, t452, t454, t456, t458, t459, t460, t461, t462, t464, t466, i0.t266, i0.u41.t277, i0.u43.t273, i0.u45.t269, i1.u16.t331, i1.u18.t327, i2.t336, i2.u12.t343, i2.u14.t335, i2.u88.t205, i3.i0.u23.t317, i4.i1.u21.t321, i4.i1.u28.t309, i5.t301, i6.u37.t285, i6.u96.t177, i8.i0.t3, i8.i0.t4, i8.i0.u50.t240, i8.i0.u50.t242, i8.i0.u50.t261, i8.i0.u103.t149, i8.i1.u105.t141, i9.i0.u70.t228, i9.i1.u66.t235, i9.i1.u68.t231, i9.i2.u107.t133, i9.i2.u108.t129, i10.u47.t265, i11.i0.u104.t145, i11.i1.u101.t157, i11.i1.u102.t153, i12.i0.t323, i12.i0.u22.t319, i12.i1.u99.t165, i12.i1.u100.t161, i13.u39.t281, i13.u95.t181, i13.u97.t173, i13.u98.t169, i14.i0.u89.t201, i14.i0.u90.t197, i14.i0.u91.t193, i14.i0.u94.t185, i14.i1.t190, i14.i1.u92.t191, i15.i0.u8.t354, i15.i1.t225, i15.i1.u81.t226, i15.i1.u83.t221, i15.i1.u84.t217, i16.i0.u10.t347, i16.i0.u11.t350, i16.i1.t214, i16.i1.u85.t215, i16.i2.u87.t209, i17.t6, i17.u109.t47, i17.u109.t123, i18.u106.t137, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :36/235/91/362
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.007: Loading model from ./gal.so
pins2lts-mc-linux64( 2/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.010: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.010: LTL layer: formula: (X([]((LTLAPp0==true)))||((!(LTLAPp0==true) U (LTLAPp1==true))&&<>((LTLAPp2==true))))
pins2lts-mc-linux64( 1/ 8), 0.012: "(X([]((LTLAPp0==true)))||((!(LTLAPp0==true) U (LTLAPp1==true))&&<>((LTLAPp2==true))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 3/ 8), 0.016: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.018: Using Spin LTL semantics
pins2lts-mc-linux64( 6/ 8), 0.030: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.032: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.036: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.037: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.036: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.039: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.048: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.344: DFS-FIFO for weak LTL, using special progress label 369
pins2lts-mc-linux64( 0/ 8), 0.344: There are 370 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.344: State length is 409, there are 385 groups
pins2lts-mc-linux64( 0/ 8), 0.344: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.344: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.344: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.344: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 2/ 8), 0.548: ~1 levels ~960 states ~5800 transitions
pins2lts-mc-linux64( 2/ 8), 0.563: ~1 levels ~1920 states ~12992 transitions
pins2lts-mc-linux64( 0/ 8), 0.594: ~1 levels ~3840 states ~25184 transitions
pins2lts-mc-linux64( 3/ 8), 0.635: ~1 levels ~7680 states ~49768 transitions
pins2lts-mc-linux64( 3/ 8), 0.729: ~1 levels ~15360 states ~109576 transitions
pins2lts-mc-linux64( 4/ 8), 0.896: ~1 levels ~30720 states ~237328 transitions
pins2lts-mc-linux64( 4/ 8), 1.078: ~1 levels ~61440 states ~524456 transitions
pins2lts-mc-linux64( 4/ 8), 2.092: ~1 levels ~122880 states ~1117184 transitions
pins2lts-mc-linux64( 3/ 8), 4.176: ~1 levels ~245760 states ~2267504 transitions
pins2lts-mc-linux64( 3/ 8), 8.367: ~1 levels ~491520 states ~4893000 transitions
pins2lts-mc-linux64( 3/ 8), 15.984: ~1 levels ~983040 states ~10014312 transitions
pins2lts-mc-linux64( 3/ 8), 34.854: ~1 levels ~1966080 states ~22411728 transitions
pins2lts-mc-linux64( 3/ 8), 68.542: ~1 levels ~3932160 states ~44056352 transitions
pins2lts-mc-linux64( 3/ 8), 151.231: ~1 levels ~7864320 states ~98462472 transitions
pins2lts-mc-linux64( 3/ 8), 286.240: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 286.336:
pins2lts-mc-linux64( 0/ 8), 286.336: mean standard work distribution: 6.5% (states) 2.5% (transitions)
pins2lts-mc-linux64( 0/ 8), 286.336:
pins2lts-mc-linux64( 0/ 8), 286.336: Explored 12984294 states 175283146 transitions, fanout: 13.500
pins2lts-mc-linux64( 0/ 8), 286.336: Total exploration time 285.990 sec (285.880 sec minimum, 285.919 sec on average)
pins2lts-mc-linux64( 0/ 8), 286.336: States per second: 45401, Transitions per second: 612900
pins2lts-mc-linux64( 0/ 8), 286.336:
pins2lts-mc-linux64( 0/ 8), 286.336: Progress states detected: 26142290
pins2lts-mc-linux64( 0/ 8), 286.336: Redundant explorations: -50.3324
pins2lts-mc-linux64( 0/ 8), 286.336:
pins2lts-mc-linux64( 0/ 8), 286.336: Queue width: 8B, total height: 20881422, memory: 159.31MB
pins2lts-mc-linux64( 0/ 8), 286.336: Tree memory: 455.5MB, 18.3 B/state, compr.: 1.1%
pins2lts-mc-linux64( 0/ 8), 286.336: Tree fill ratio (roots/leafs): 19.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 286.336: Stored 364 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 286.336: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 286.336: Est. total memory use: 614.8MB (~1183.3MB 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, (X([]((LTLAPp0==true)))||((!(LTLAPp0==true) U (LTLAPp1==true))&&<>((LTLAPp2==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin14195679911622591075]
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, (X([]((LTLAPp0==true)))||((!(LTLAPp0==true) U (LTLAPp1==true))&&<>((LTLAPp2==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin14195679911622591075]
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:98)
at java.base/java.lang.Thread.run(Thread.java:834)
Computing Next relation with stutter on 4.98893e+07 deadlock states
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
21644 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,216.509,2289920,1,0,4.10836e+06,827,3310,6.6734e+06,165,3102,1046559
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA BusinessProcesses-PT-10-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((X(X(G("(i9.i0.u0.p0!=1)")))))
Formula 1 simplified : !XXG"(i9.i0.u0.p0!=1)"
Computing Next relation with stutter on 4.98893e+07 deadlock states
3 unique states visited
0 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
9355 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,310.057,2303700,1,0,4.10836e+06,827,3739,6.6734e+06,170,3102,6693089
no accepting run found
Formula 1 is TRUE no accepting run found.
FORMULA BusinessProcesses-PT-10-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !(((F(!("(((i17.u109.p447==1)||(i9.i0.u0.p0==1))&&(i9.i0.u0.p0==1))")))&&(F(G("(i17.u109.p447!=1)")))))
Formula 2 simplified : !(F!"(((i17.u109.p447==1)||(i9.i0.u0.p0==1))&&(i9.i0.u0.p0==1))" & FG"(i17.u109.p447!=1)")
Computing Next relation with stutter on 4.98893e+07 deadlock states
Detected timeout of ITS tools.
[2021-05-09 07:43:11] [INFO ] Applying decomposition
[2021-05-09 07:43:11] [INFO ] Flatten gal took : 345 ms
[2021-05-09 07:43:11] [INFO ] Decomposing Gal with order
[2021-05-09 07:43:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 07:43:12] [INFO ] Removed a total of 141 redundant transitions.
[2021-05-09 07:43:12] [INFO ] Flatten gal took : 339 ms
[2021-05-09 07:43:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 111 labels/synchronizations in 1251 ms.
[2021-05-09 07:43:13] [INFO ] Time to serialize gal into /tmp/LTLFireability9445228412744306665.gal : 29 ms
[2021-05-09 07:43:13] [INFO ] Time to serialize properties into /tmp/LTLFireability2626171497057677256.ltl : 2 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/LTLFireability9445228412744306665.gal, -t, CGAL, -LTL, /tmp/LTLFireability2626171497057677256.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/LTLFireability9445228412744306665.gal -t CGAL -LTL /tmp/LTLFireability2626171497057677256.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !(((F(!("(((i1.u138.p447==1)||(u146.p0==1))&&(u146.p0==1))")))&&(F(G("(i1.u138.p447!=1)")))))
Formula 0 simplified : !(F!"(((i1.u138.p447==1)||(u146.p0==1))&&(u146.p0==1))" & FG"(i1.u138.p447!=1)")
Detected timeout of ITS tools.
[2021-05-09 08:04:11] [INFO ] Flatten gal took : 789 ms
[2021-05-09 08:04:13] [INFO ] Input system was already deterministic with 362 transitions.
[2021-05-09 08:04:13] [INFO ] Transformed 408 places.
[2021-05-09 08:04:13] [INFO ] Transformed 362 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 08:04:43] [INFO ] Time to serialize gal into /tmp/LTLFireability1329525157432226790.gal : 6 ms
[2021-05-09 08:04:43] [INFO ] Time to serialize properties into /tmp/LTLFireability8826107255892000880.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/LTLFireability1329525157432226790.gal, -t, CGAL, -LTL, /tmp/LTLFireability8826107255892000880.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/LTLFireability1329525157432226790.gal -t CGAL -LTL /tmp/LTLFireability8826107255892000880.ltl -c -stutter-deadlock --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !(((F(!("(((p447==1)||(p0==1))&&(p0==1))")))&&(F(G("(p447!=1)")))))
Formula 0 simplified : !(F!"(((p447==1)||(p0==1))&&(p0==1))" & FG"(p447!=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-10"
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-10, 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-162038143800397"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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