fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r026-tajo-162038143800364
Last Updated
Jun 28, 2021

About the Execution of ITS-Tools for BusinessProcesses-PT-06

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
2373.256 132411.00 326410.00 503.60 FFTFTFTTFFFTTFFF normal

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 452K
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 130K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.8K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 68K 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.2K Mar 28 15:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 28 15:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 28 15:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 15:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 23 03:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 23 03:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 22 12:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Mar 22 12:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 85K 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-06-00
FORMULA_NAME BusinessProcesses-PT-06-01
FORMULA_NAME BusinessProcesses-PT-06-02
FORMULA_NAME BusinessProcesses-PT-06-03
FORMULA_NAME BusinessProcesses-PT-06-04
FORMULA_NAME BusinessProcesses-PT-06-05
FORMULA_NAME BusinessProcesses-PT-06-06
FORMULA_NAME BusinessProcesses-PT-06-07
FORMULA_NAME BusinessProcesses-PT-06-08
FORMULA_NAME BusinessProcesses-PT-06-09
FORMULA_NAME BusinessProcesses-PT-06-10
FORMULA_NAME BusinessProcesses-PT-06-11
FORMULA_NAME BusinessProcesses-PT-06-12
FORMULA_NAME BusinessProcesses-PT-06-13
FORMULA_NAME BusinessProcesses-PT-06-14
FORMULA_NAME BusinessProcesses-PT-06-15

=== Now, execution of the tool begins

BK_START 1620543293195

Running Version 0
[2021-05-09 06:54:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-09 06:54:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 06:54:54] [INFO ] Load time of PNML (sax parser for PT used): 57 ms
[2021-05-09 06:54:55] [INFO ] Transformed 376 places.
[2021-05-09 06:54:55] [INFO ] Transformed 297 transitions.
[2021-05-09 06:54:55] [INFO ] Found NUPN structural information;
[2021-05-09 06:54:55] [INFO ] Parsed PT model containing 376 places and 297 transitions in 112 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2021-05-09 06:54:55] [INFO ] Initial state test concluded for 2 properties.
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 1 transitions.
FORMULA BusinessProcesses-PT-06-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-06-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-06-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-06-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-06-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-06-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-06-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 36 out of 375 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 375/375 places, 296/296 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 373 transition count 296
Discarding 39 places :
Symmetric choice reduction at 1 with 39 rule applications. Total rules 41 place count 334 transition count 257
Iterating global reduction 1 with 39 rules applied. Total rules applied 80 place count 334 transition count 257
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 97 place count 317 transition count 240
Iterating global reduction 1 with 17 rules applied. Total rules applied 114 place count 317 transition count 240
Applied a total of 114 rules in 65 ms. Remains 317 /375 variables (removed 58) and now considering 240/296 (removed 56) transitions.
// Phase 1: matrix 240 rows 317 cols
[2021-05-09 06:54:55] [INFO ] Computed 79 place invariants in 19 ms
[2021-05-09 06:54:55] [INFO ] Implicit Places using invariants in 227 ms returned []
// Phase 1: matrix 240 rows 317 cols
[2021-05-09 06:54:55] [INFO ] Computed 79 place invariants in 9 ms
[2021-05-09 06:54:55] [INFO ] Implicit Places using invariants and state equation in 259 ms returned []
Implicit Place search using SMT with State Equation took 516 ms to find 0 implicit places.
// Phase 1: matrix 240 rows 317 cols
[2021-05-09 06:54:55] [INFO ] Computed 79 place invariants in 8 ms
[2021-05-09 06:54:55] [INFO ] Dead Transitions using invariants and state equation in 121 ms returned []
Finished structural reductions, in 1 iterations. Remains : 317/375 places, 240/296 transitions.
[2021-05-09 06:54:56] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-05-09 06:54:56] [INFO ] Flatten gal took : 70 ms
FORMULA BusinessProcesses-PT-06-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-06-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-09 06:54:56] [INFO ] Flatten gal took : 23 ms
[2021-05-09 06:54:56] [INFO ] Input system was already deterministic with 240 transitions.
Incomplete random walk after 100000 steps, including 1017 resets, run finished after 215 ms. (steps per millisecond=465 ) properties (out of 18) seen :15
Running SMT prover for 3 properties.
// Phase 1: matrix 240 rows 317 cols
[2021-05-09 06:54:56] [INFO ] Computed 79 place invariants in 15 ms
[2021-05-09 06:54:56] [INFO ] [Real]Absence check using 34 positive place invariants in 10 ms returned sat
[2021-05-09 06:54:56] [INFO ] [Real]Absence check using 34 positive and 45 generalized place invariants in 11 ms returned sat
[2021-05-09 06:54:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 06:54:56] [INFO ] [Real]Absence check using state equation in 87 ms returned sat
[2021-05-09 06:54:56] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 06:54:56] [INFO ] [Nat]Absence check using 34 positive place invariants in 11 ms returned unsat
[2021-05-09 06:54:56] [INFO ] [Real]Absence check using 34 positive place invariants in 10 ms returned sat
[2021-05-09 06:54:56] [INFO ] [Real]Absence check using 34 positive and 45 generalized place invariants in 12 ms returned sat
[2021-05-09 06:54:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 06:54:56] [INFO ] [Real]Absence check using state equation in 87 ms returned sat
[2021-05-09 06:54:56] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 06:54:56] [INFO ] [Nat]Absence check using 34 positive place invariants in 3 ms returned unsat
[2021-05-09 06:54:56] [INFO ] [Real]Absence check using 34 positive place invariants in 8 ms returned sat
[2021-05-09 06:54:56] [INFO ] [Real]Absence check using 34 positive and 45 generalized place invariants in 9 ms returned sat
[2021-05-09 06:54:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 06:54:57] [INFO ] [Real]Absence check using state equation in 77 ms returned sat
[2021-05-09 06:54:57] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 06:54:57] [INFO ] [Nat]Absence check using 34 positive place invariants in 7 ms returned sat
[2021-05-09 06:54:57] [INFO ] [Nat]Absence check using 34 positive and 45 generalized place invariants in 7 ms returned unsat
Successfully simplified 3 atomic propositions for a total of 7 simplifications.
FORMULA BusinessProcesses-PT-06-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((F(p0)||G(p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 317 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 317/317 places, 240/240 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 311 transition count 234
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 311 transition count 234
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 310 transition count 233
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 310 transition count 233
Applied a total of 14 rules in 49 ms. Remains 310 /317 variables (removed 7) and now considering 233/240 (removed 7) transitions.
// Phase 1: matrix 233 rows 310 cols
[2021-05-09 06:54:57] [INFO ] Computed 79 place invariants in 2 ms
[2021-05-09 06:54:57] [INFO ] Implicit Places using invariants in 103 ms returned []
// Phase 1: matrix 233 rows 310 cols
[2021-05-09 06:54:57] [INFO ] Computed 79 place invariants in 2 ms
[2021-05-09 06:54:57] [INFO ] Implicit Places using invariants and state equation in 260 ms returned []
Implicit Place search using SMT with State Equation took 369 ms to find 0 implicit places.
// Phase 1: matrix 233 rows 310 cols
[2021-05-09 06:54:57] [INFO ] Computed 79 place invariants in 2 ms
[2021-05-09 06:54:57] [INFO ] Dead Transitions using invariants and state equation in 143 ms returned []
Finished structural reductions, in 1 iterations. Remains : 310/317 places, 233/240 transitions.
Stuttering acceptance computed with spot in 274 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-06-00 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(EQ s91 1), p1:(OR (NEQ s217 0) (NEQ s226 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]]
Product exploration explored 100000 steps with 2371 reset in 390 ms.
Stack based approach found an accepted trace after 3311 steps with 84 reset with depth 52 and stack size 52 in 6 ms.
FORMULA BusinessProcesses-PT-06-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-06-00 finished in 1289 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 317 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 317/317 places, 240/240 transitions.
Graph (trivial) has 136 edges and 317 vertex of which 6 / 317 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 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 30 place count 311 transition count 204
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 1 with 29 rules applied. Total rules applied 59 place count 282 transition count 204
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 65 Pre rules applied. Total rules applied 59 place count 282 transition count 139
Deduced a syphon composed of 65 places in 1 ms
Ensure Unique test removed 10 places
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 2 with 140 rules applied. Total rules applied 199 place count 207 transition count 139
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 205 place count 201 transition count 133
Iterating global reduction 2 with 6 rules applied. Total rules applied 211 place count 201 transition count 133
Performed 83 Post agglomeration using F-continuation condition.Transition count delta: 83
Deduced a syphon composed of 83 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 91 places and 0 transitions.
Iterating global reduction 2 with 174 rules applied. Total rules applied 385 place count 110 transition count 50
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 386 place count 109 transition count 49
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 387 place count 108 transition count 49
Applied a total of 387 rules in 57 ms. Remains 108 /317 variables (removed 209) and now considering 49/240 (removed 191) transitions.
// Phase 1: matrix 49 rows 108 cols
[2021-05-09 06:54:58] [INFO ] Computed 60 place invariants in 1 ms
[2021-05-09 06:54:58] [INFO ] Implicit Places using invariants in 63 ms returned []
// Phase 1: matrix 49 rows 108 cols
[2021-05-09 06:54:58] [INFO ] Computed 60 place invariants in 1 ms
[2021-05-09 06:54:58] [INFO ] Implicit Places using invariants and state equation in 92 ms returned [0, 1, 2, 3, 4, 7, 8, 9, 10, 12, 14, 16, 18, 20, 22, 24, 26, 35, 36, 38, 44, 46, 48, 50, 52, 54, 56, 58, 60, 62, 64, 66, 68, 70, 72, 74, 76, 78]
Discarding 38 places :
Implicit Place search using SMT with State Equation took 159 ms to find 38 implicit places.
[2021-05-09 06:54:58] [INFO ] Redundant transitions in 7 ms returned []
// Phase 1: matrix 49 rows 70 cols
[2021-05-09 06:54:58] [INFO ] Computed 22 place invariants in 0 ms
[2021-05-09 06:54:58] [INFO ] Dead Transitions using invariants and state equation in 36 ms returned []
Starting structural reductions, iteration 1 : 70/317 places, 49/240 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 70 transition count 40
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 61 transition count 40
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Ensure Unique test removed 14 places
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 48 place count 39 transition count 32
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 52 place count 37 transition count 30
Applied a total of 52 rules in 4 ms. Remains 37 /70 variables (removed 33) and now considering 30/49 (removed 19) transitions.
// Phase 1: matrix 30 rows 37 cols
[2021-05-09 06:54:58] [INFO ] Computed 8 place invariants in 0 ms
[2021-05-09 06:54:58] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 30 rows 37 cols
[2021-05-09 06:54:58] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-09 06:54:58] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 37/317 places, 30/240 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-06-01 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s15 0) (EQ s0 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-06-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-06-01 finished in 360 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G((X(p1)||p0))||F(p2)))], workingDir=/home/mcc/execution]
Support contains 5 out of 317 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 317/317 places, 240/240 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 311 transition count 234
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 311 transition count 234
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 310 transition count 233
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 310 transition count 233
Applied a total of 14 rules in 18 ms. Remains 310 /317 variables (removed 7) and now considering 233/240 (removed 7) transitions.
// Phase 1: matrix 233 rows 310 cols
[2021-05-09 06:54:58] [INFO ] Computed 79 place invariants in 2 ms
[2021-05-09 06:54:58] [INFO ] Implicit Places using invariants in 122 ms returned []
// Phase 1: matrix 233 rows 310 cols
[2021-05-09 06:54:58] [INFO ] Computed 79 place invariants in 1 ms
[2021-05-09 06:54:59] [INFO ] Implicit Places using invariants and state equation in 296 ms returned []
Implicit Place search using SMT with State Equation took 422 ms to find 0 implicit places.
// Phase 1: matrix 233 rows 310 cols
[2021-05-09 06:54:59] [INFO ] Computed 79 place invariants in 4 ms
[2021-05-09 06:54:59] [INFO ] Dead Transitions using invariants and state equation in 177 ms returned []
Finished structural reductions, in 1 iterations. Remains : 310/317 places, 233/240 transitions.
Stuttering acceptance computed with spot in 127 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : BusinessProcesses-PT-06-04 automaton TGBA [mat=[[{ cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p2) p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s77 0) (EQ s206 1)), p2:(EQ s169 1), p1:(OR (EQ s37 0) (EQ s136 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 1178 reset in 249 ms.
Product exploration explored 100000 steps with 1183 reset in 404 ms.
Graph (complete) has 618 edges and 310 vertex of which 309 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Knowledge obtained : [p0, (NOT p2), p1]
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Product exploration explored 100000 steps with 1180 reset in 205 ms.
Product exploration explored 100000 steps with 1186 reset in 223 ms.
Applying partial POR strategy [false, false, true]
Stuttering acceptance computed with spot in 139 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Support contains 5 out of 310 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 310/310 places, 233/233 transitions.
Graph (trivial) has 127 edges and 310 vertex of which 6 / 310 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 26 rules applied. Total rules applied 27 place count 305 transition count 227
Performed 61 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 61 Pre rules applied. Total rules applied 27 place count 305 transition count 900
Deduced a syphon composed of 87 places in 2 ms
Iterating global reduction 1 with 61 rules applied. Total rules applied 88 place count 305 transition count 900
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 97 place count 296 transition count 867
Deduced a syphon composed of 78 places in 1 ms
Iterating global reduction 1 with 9 rules applied. Total rules applied 106 place count 296 transition count 867
Performed 86 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 164 places in 1 ms
Iterating global reduction 1 with 86 rules applied. Total rules applied 192 place count 296 transition count 867
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 208 place count 280 transition count 851
Deduced a syphon composed of 148 places in 0 ms
Iterating global reduction 1 with 16 rules applied. Total rules applied 224 place count 280 transition count 851
Deduced a syphon composed of 148 places in 1 ms
Applied a total of 224 rules in 138 ms. Remains 280 /310 variables (removed 30) and now considering 851/233 (removed -618) transitions.
[2021-05-09 06:55:01] [INFO ] Redundant transitions in 81 ms returned []
// Phase 1: matrix 851 rows 280 cols
[2021-05-09 06:55:01] [INFO ] Computed 79 place invariants in 15 ms
[2021-05-09 06:55:01] [INFO ] Dead Transitions using invariants and state equation in 388 ms returned []
Finished structural reductions, in 1 iterations. Remains : 280/310 places, 851/233 transitions.
Product exploration explored 100000 steps with 1175 reset in 243 ms.
Product exploration explored 100000 steps with 1177 reset in 297 ms.
[2021-05-09 06:55:02] [INFO ] Flatten gal took : 18 ms
[2021-05-09 06:55:02] [INFO ] Flatten gal took : 17 ms
[2021-05-09 06:55:02] [INFO ] Time to serialize gal into /tmp/LTL5558161522070362929.gal : 9 ms
[2021-05-09 06:55:02] [INFO ] Time to serialize properties into /tmp/LTL3719738635431867535.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/LTL5558161522070362929.gal, -t, CGAL, -LTL, /tmp/LTL3719738635431867535.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/LTL5558161522070362929.gal -t CGAL -LTL /tmp/LTL3719738635431867535.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((G(("((p77==0)||(p216==1))")||(X("((p37==0)||(p136==1))"))))||(F("(p170==1)"))))
Formula 0 simplified : !(G("((p77==0)||(p216==1))" | X"((p37==0)||(p136==1))") | F"(p170==1)")
Detected timeout of ITS tools.
[2021-05-09 06:55:17] [INFO ] Flatten gal took : 30 ms
[2021-05-09 06:55:17] [INFO ] Applying decomposition
[2021-05-09 06:55:17] [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/graph15290657188885054766.txt, -o, /tmp/graph15290657188885054766.bin, -w, /tmp/graph15290657188885054766.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/graph15290657188885054766.bin, -l, -1, -v, -w, /tmp/graph15290657188885054766.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 06:55:17] [INFO ] Decomposing Gal with order
[2021-05-09 06:55:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 06:55:17] [INFO ] Removed a total of 34 redundant transitions.
[2021-05-09 06:55:17] [INFO ] Flatten gal took : 60 ms
[2021-05-09 06:55:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 6 ms.
[2021-05-09 06:55:17] [INFO ] Time to serialize gal into /tmp/LTL9940051564449679318.gal : 9 ms
[2021-05-09 06:55:17] [INFO ] Time to serialize properties into /tmp/LTL539991588760659141.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/LTL9940051564449679318.gal, -t, CGAL, -LTL, /tmp/LTL539991588760659141.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/LTL9940051564449679318.gal -t CGAL -LTL /tmp/LTL539991588760659141.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !(((G(("((i6.i1.u28.p77==0)||(i14.i1.u77.p216==1))")||(X("((i3.i1.u13.p37==0)||(i14.i0.u53.p136==1))"))))||(F("(i7.u67.p170==1)"))))
Formula 0 simplified : !(G("((i6.i1.u28.p77==0)||(i14.i1.u77.p216==1))" | X"((i3.i1.u13.p37==0)||(i14.i0.u53.p136==1))") | F"(i7.u67.p170==1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15762066009717319923
[2021-05-09 06:55:32] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15762066009717319923
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/ltsmin15762066009717319923]
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/ltsmin15762066009717319923] 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/ltsmin15762066009717319923] 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-06-04 finished in 35182 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)&&X(X((F(p2)||p1)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 317 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 317/317 places, 240/240 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 310 transition count 233
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 310 transition count 233
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 309 transition count 232
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 309 transition count 232
Applied a total of 16 rules in 70 ms. Remains 309 /317 variables (removed 8) and now considering 232/240 (removed 8) transitions.
// Phase 1: matrix 232 rows 309 cols
[2021-05-09 06:55:34] [INFO ] Computed 79 place invariants in 7 ms
[2021-05-09 06:55:34] [INFO ] Implicit Places using invariants in 149 ms returned []
// Phase 1: matrix 232 rows 309 cols
[2021-05-09 06:55:34] [INFO ] Computed 79 place invariants in 3 ms
[2021-05-09 06:55:34] [INFO ] Implicit Places using invariants and state equation in 308 ms returned []
Implicit Place search using SMT with State Equation took 458 ms to find 0 implicit places.
// Phase 1: matrix 232 rows 309 cols
[2021-05-09 06:55:34] [INFO ] Computed 79 place invariants in 5 ms
[2021-05-09 06:55:34] [INFO ] Dead Transitions using invariants and state equation in 187 ms returned []
Finished structural reductions, in 1 iterations. Remains : 309/317 places, 232/240 transitions.
Stuttering acceptance computed with spot in 191 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : BusinessProcesses-PT-06-12 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p2), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(OR (EQ s253 0) (EQ s14 1)), p1:(OR (EQ s19 0) (EQ s48 1)), p2:(AND (EQ s48 0) (EQ s19 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 331 ms.
Product exploration explored 100000 steps with 33333 reset in 299 ms.
Graph (complete) has 617 edges and 309 vertex of which 308 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Knowledge obtained : [p0, p1, (NOT p2)]
Stuttering acceptance computed with spot in 201 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Product exploration explored 100000 steps with 33333 reset in 362 ms.
Product exploration explored 100000 steps with 33333 reset in 292 ms.
Applying partial POR strategy [false, true, false, true, true]
Stuttering acceptance computed with spot in 230 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Support contains 4 out of 309 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 309/309 places, 232/232 transitions.
Graph (trivial) has 127 edges and 309 vertex of which 4 / 309 are part of one of the 1 SCC in 1 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 24 rules applied. Total rules applied 25 place count 306 transition count 229
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 65 Pre rules applied. Total rules applied 25 place count 306 transition count 1285
Deduced a syphon composed of 89 places in 1 ms
Iterating global reduction 1 with 65 rules applied. Total rules applied 90 place count 306 transition count 1285
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 99 place count 297 transition count 1252
Deduced a syphon composed of 80 places in 1 ms
Iterating global reduction 1 with 9 rules applied. Total rules applied 108 place count 297 transition count 1252
Performed 87 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 167 places in 1 ms
Iterating global reduction 1 with 87 rules applied. Total rules applied 195 place count 297 transition count 1253
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 210 place count 282 transition count 1238
Deduced a syphon composed of 152 places in 1 ms
Iterating global reduction 1 with 15 rules applied. Total rules applied 225 place count 282 transition count 1238
Deduced a syphon composed of 152 places in 1 ms
Applied a total of 225 rules in 139 ms. Remains 282 /309 variables (removed 27) and now considering 1238/232 (removed -1006) transitions.
[2021-05-09 06:55:37] [INFO ] Redundant transitions in 57 ms returned []
// Phase 1: matrix 1238 rows 282 cols
[2021-05-09 06:55:37] [INFO ] Computed 79 place invariants in 11 ms
[2021-05-09 06:55:37] [INFO ] Dead Transitions using invariants and state equation in 819 ms returned []
Finished structural reductions, in 1 iterations. Remains : 282/309 places, 1238/232 transitions.
Product exploration explored 100000 steps with 33333 reset in 1146 ms.
Product exploration explored 100000 steps with 33333 reset in 1236 ms.
[2021-05-09 06:55:40] [INFO ] Flatten gal took : 24 ms
[2021-05-09 06:55:40] [INFO ] Flatten gal took : 35 ms
[2021-05-09 06:55:40] [INFO ] Time to serialize gal into /tmp/LTL14146276055835955904.gal : 3 ms
[2021-05-09 06:55:40] [INFO ] Time to serialize properties into /tmp/LTL4112545540365784951.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/LTL14146276055835955904.gal, -t, CGAL, -LTL, /tmp/LTL4112545540365784951.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/LTL14146276055835955904.gal -t CGAL -LTL /tmp/LTL4112545540365784951.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((F("((p276==0)||(p14==1))"))&&(X(X(("((p19==0)||(p48==1))")||(F("((p48==0)&&(p19==1))")))))))
Formula 0 simplified : !(F"((p276==0)||(p14==1))" & XX("((p19==0)||(p48==1))" | F"((p48==0)&&(p19==1))"))
Detected timeout of ITS tools.
[2021-05-09 06:55:55] [INFO ] Flatten gal took : 30 ms
[2021-05-09 06:55:55] [INFO ] Applying decomposition
[2021-05-09 06:55:55] [INFO ] Flatten gal took : 26 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/graph12338897772371393443.txt, -o, /tmp/graph12338897772371393443.bin, -w, /tmp/graph12338897772371393443.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/graph12338897772371393443.bin, -l, -1, -v, -w, /tmp/graph12338897772371393443.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 06:55:55] [INFO ] Decomposing Gal with order
[2021-05-09 06:55:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 06:55:55] [INFO ] Removed a total of 32 redundant transitions.
[2021-05-09 06:55:55] [INFO ] Flatten gal took : 24 ms
[2021-05-09 06:55:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2021-05-09 06:55:55] [INFO ] Time to serialize gal into /tmp/LTL16176222489650009677.gal : 5 ms
[2021-05-09 06:55:55] [INFO ] Time to serialize properties into /tmp/LTL18203892484915812489.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/LTL16176222489650009677.gal, -t, CGAL, -LTL, /tmp/LTL18203892484915812489.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/LTL16176222489650009677.gal -t CGAL -LTL /tmp/LTL18203892484915812489.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !(((F("((i19.u89.p276==0)||(i1.u6.p14==1))"))&&(X(X(("((i16.u8.p19==0)||(i5.u18.p48==1))")||(F("((i5.u18.p48==0)&&(i16.u8.p19==1))")))))))
Formula 0 simplified : !(F"((i19.u89.p276==0)||(i1.u6.p14==1))" & XX("((i16.u8.p19==0)||(i5.u18.p48==1))" | F"((i5.u18.p48==0)&&(i16.u8.p19==1))"))
Reverse transition relation is NOT exact ! Due to transitions t2, t113, t165, t169, t181, i0.t161, i0.t157, i0.u15.t172, i0.u19.t164, i0.u21.t160, i1.t177, i1.t173, i1.u11.t180, i1.u13.t176, i2.u9.t184, i5.u17.t168, i7.i0.u23.t156, i10.i0.t121, i10.i0.u38.t138, i10.i0.u54.t120, i10.i0.u60.t109, i10.i1.u58.t112, i11.i0.u56.t116, i11.i1.u86.t52, i11.i1.u87.t49, i11.i1.u88.t46, i12.u84.t58, i12.u85.t55, i13.u80.t70, i13.u81.t67, i13.u82.t64, i13.u83.t61, i14.u77.t81, i14.u78.t77, i14.u79.t74, i15.u73.t94, i15.u74.t91, i15.u75.t87, i15.u76.t84, i16.u7.t187, i17.u69.t106, i17.u70.t103, i17.u71.t100, i17.u72.t97, i19.u90.t37, i19.u90.t42, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/186/46/232
Computing Next relation with stutter on 13133 deadlock states
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
3 items max in DFS search stack
935 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,9.38325,267892,1,0,661647,567,3192,615692,207,1114,1828653
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA BusinessProcesses-PT-06-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property BusinessProcesses-PT-06-12 finished in 32943 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((X((X(G(p2))&&p1))&&p0)))], workingDir=/home/mcc/execution]
Support contains 7 out of 317 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 317/317 places, 240/240 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 311 transition count 234
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 311 transition count 234
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 310 transition count 233
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 310 transition count 233
Applied a total of 14 rules in 11 ms. Remains 310 /317 variables (removed 7) and now considering 233/240 (removed 7) transitions.
// Phase 1: matrix 233 rows 310 cols
[2021-05-09 06:56:06] [INFO ] Computed 79 place invariants in 5 ms
[2021-05-09 06:56:07] [INFO ] Implicit Places using invariants in 181 ms returned []
// Phase 1: matrix 233 rows 310 cols
[2021-05-09 06:56:07] [INFO ] Computed 79 place invariants in 2 ms
[2021-05-09 06:56:07] [INFO ] Implicit Places using invariants and state equation in 295 ms returned []
Implicit Place search using SMT with State Equation took 479 ms to find 0 implicit places.
// Phase 1: matrix 233 rows 310 cols
[2021-05-09 06:56:07] [INFO ] Computed 79 place invariants in 2 ms
[2021-05-09 06:56:07] [INFO ] Dead Transitions using invariants and state equation in 136 ms returned []
Finished structural reductions, in 1 iterations. Remains : 310/317 places, 233/240 transitions.
Stuttering acceptance computed with spot in 156 ms :[true, (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : BusinessProcesses-PT-06-13 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 4}], [{ cond=(NOT p2), acceptance={} source=4 dest: 0}, { cond=p2, acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(AND (NEQ s272 0) (NEQ s104 1)), p1:(AND (NEQ s108 0) (NEQ s30 1)), p2:(OR (NEQ s212 0) (AND (NEQ s112 0) (NEQ s72 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, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-06-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-06-13 finished in 808 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((F(p0) U X(p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 317 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 317/317 places, 240/240 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 310 transition count 233
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 310 transition count 233
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 309 transition count 232
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 309 transition count 232
Applied a total of 16 rules in 10 ms. Remains 309 /317 variables (removed 8) and now considering 232/240 (removed 8) transitions.
// Phase 1: matrix 232 rows 309 cols
[2021-05-09 06:56:07] [INFO ] Computed 79 place invariants in 2 ms
[2021-05-09 06:56:07] [INFO ] Implicit Places using invariants in 131 ms returned []
// Phase 1: matrix 232 rows 309 cols
[2021-05-09 06:56:07] [INFO ] Computed 79 place invariants in 2 ms
[2021-05-09 06:56:08] [INFO ] Implicit Places using invariants and state equation in 237 ms returned []
Implicit Place search using SMT with State Equation took 373 ms to find 0 implicit places.
// Phase 1: matrix 232 rows 309 cols
[2021-05-09 06:56:08] [INFO ] Computed 79 place invariants in 2 ms
[2021-05-09 06:56:08] [INFO ] Dead Transitions using invariants and state equation in 137 ms returned []
Finished structural reductions, in 1 iterations. Remains : 309/317 places, 232/240 transitions.
Stuttering acceptance computed with spot in 370 ms :[(NOT p1), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-06-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s38 1), p1:(AND (EQ s166 0) (EQ s22 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 94 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-06-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-06-15 finished in 906 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin4255080774187769906
[2021-05-09 06:56:08] [INFO ] Computing symmetric may disable matrix : 240 transitions.
[2021-05-09 06:56:08] [INFO ] Applying decomposition
[2021-05-09 06:56:08] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-09 06:56:08] [INFO ] Computing symmetric may enable matrix : 240 transitions.
[2021-05-09 06:56:08] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-09 06:56:08] [INFO ] Flatten gal took : 33 ms
[2021-05-09 06:56:08] [INFO ] Computing Do-Not-Accords matrix : 240 transitions.
[2021-05-09 06:56:08] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-09 06:56:08] [INFO ] Built C files in 52ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4255080774187769906
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/ltsmin4255080774187769906]
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/graph1369360825597106504.txt, -o, /tmp/graph1369360825597106504.bin, -w, /tmp/graph1369360825597106504.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/graph1369360825597106504.bin, -l, -1, -v, -w, /tmp/graph1369360825597106504.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 06:56:08] [INFO ] Decomposing Gal with order
[2021-05-09 06:56:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 06:56:08] [INFO ] Removed a total of 32 redundant transitions.
[2021-05-09 06:56:08] [INFO ] Flatten gal took : 66 ms
[2021-05-09 06:56:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 6 ms.
[2021-05-09 06:56:08] [INFO ] Time to serialize gal into /tmp/LTLCardinality13544844246699932289.gal : 23 ms
[2021-05-09 06:56:08] [INFO ] Time to serialize properties into /tmp/LTLCardinality3489117696346398993.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/LTLCardinality13544844246699932289.gal, -t, CGAL, -LTL, /tmp/LTLCardinality3489117696346398993.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/LTLCardinality13544844246699932289.gal -t CGAL -LTL /tmp/LTLCardinality3489117696346398993.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !(((G(("((i8.i2.u29.p77==0)||(i18.u81.p216==1))")||(X("((i3.u14.p37==0)||(i18.u55.p136==1))"))))||(F("(i16.u69.p170==1)"))))
Formula 0 simplified : !(G("((i8.i2.u29.p77==0)||(i18.u81.p216==1))" | X"((i3.u14.p37==0)||(i18.u55.p136==1))") | F"(i16.u69.p170==1)")
Compilation finished in 1255 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin4255080774187769906]
Link finished in 106 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((LTLAPp1==true))||(LTLAPp0==true)))||<>((LTLAPp2==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin4255080774187769906]
Reverse transition relation is NOT exact ! Due to transitions t2, t170, t214, t218, t222, t230, t238, i0.u56.t173, i0.u58.t169, i1.t178, i1.u21.t217, i1.u38.t195, i1.u54.t177, i2.u17.t225, i3.t226, i3.u13.t233, i3.u15.t229, i4.u7.t244, i5.t234, i5.u9.t241, i5.u11.t237, i6.u19.t221, i6.u89.t99, i8.i0.u23.t213, i12.i0.u60.t166, i12.i1.u88.t103, i12.i1.u90.t95, i12.i1.u91.t91, i12.i1.u92.t87, i13.u86.t111, i13.u87.t107, i15.u78.t135, i15.u79.t131, i16.t160, i16.u69.t162, i16.u70.t161, i16.u72.t155, i16.u73.t151, i17.i0.u74.t147, i17.i0.u75.t143, i17.i1.t140, i17.i1.u76.t141, i18.t128, i18.u81.t129, i18.u82.t123, i19.i0.u85.t115, i19.i1.t120, i19.i1.u84.t121, i20.t6, i20.u94.t74, i20.u103.t30, i20.u103.t44, i20.u103.t81, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/187/53/240
Computing Next relation with stutter on 13133 deadlock states
2 unique states visited
0 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
2258 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,22.6249,408244,1,0,799906,628,3964,1.7933e+06,231,1830,2217509
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA BusinessProcesses-PT-06-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.

BK_STOP 1620543425606

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -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 LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/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-06"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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