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

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

=== Now, execution of the tool begins

BK_START 1620548564071

Running Version 0
[2021-05-09 08:22:45] [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 08:22:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 08:22:45] [INFO ] Load time of PNML (sax parser for PT used): 83 ms
[2021-05-09 08:22:45] [INFO ] Transformed 772 places.
[2021-05-09 08:22:45] [INFO ] Transformed 685 transitions.
[2021-05-09 08:22:45] [INFO ] Found NUPN structural information;
[2021-05-09 08:22:46] [INFO ] Parsed PT model containing 772 places and 685 transitions in 128 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 08:22:46] [INFO ] Initial state test concluded for 3 properties.
Deduced a syphon composed of 15 places in 20 ms
Reduce places removed 15 places and 15 transitions.
FORMULA BusinessProcesses-PT-19-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-19-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-19-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-19-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-19-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-19-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-19-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 23 out of 757 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 757/757 places, 670/670 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 749 transition count 670
Discarding 106 places :
Symmetric choice reduction at 1 with 106 rule applications. Total rules 114 place count 643 transition count 564
Iterating global reduction 1 with 106 rules applied. Total rules applied 220 place count 643 transition count 564
Discarding 55 places :
Symmetric choice reduction at 1 with 55 rule applications. Total rules 275 place count 588 transition count 509
Iterating global reduction 1 with 55 rules applied. Total rules applied 330 place count 588 transition count 509
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 331 place count 587 transition count 508
Iterating global reduction 1 with 1 rules applied. Total rules applied 332 place count 587 transition count 508
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 333 place count 586 transition count 507
Iterating global reduction 1 with 1 rules applied. Total rules applied 334 place count 586 transition count 507
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 335 place count 585 transition count 506
Iterating global reduction 1 with 1 rules applied. Total rules applied 336 place count 585 transition count 506
Applied a total of 336 rules in 206 ms. Remains 585 /757 variables (removed 172) and now considering 506/670 (removed 164) transitions.
// Phase 1: matrix 506 rows 585 cols
[2021-05-09 08:22:46] [INFO ] Computed 117 place invariants in 41 ms
[2021-05-09 08:22:46] [INFO ] Implicit Places using invariants in 361 ms returned []
// Phase 1: matrix 506 rows 585 cols
[2021-05-09 08:22:46] [INFO ] Computed 117 place invariants in 11 ms
[2021-05-09 08:22:47] [INFO ] Implicit Places using invariants and state equation in 631 ms returned []
Implicit Place search using SMT with State Equation took 1023 ms to find 0 implicit places.
// Phase 1: matrix 506 rows 585 cols
[2021-05-09 08:22:47] [INFO ] Computed 117 place invariants in 15 ms
[2021-05-09 08:22:47] [INFO ] Dead Transitions using invariants and state equation in 286 ms returned []
Finished structural reductions, in 1 iterations. Remains : 585/757 places, 506/670 transitions.
[2021-05-09 08:22:47] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-05-09 08:22:47] [INFO ] Flatten gal took : 96 ms
FORMULA BusinessProcesses-PT-19-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-19-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-09 08:22:47] [INFO ] Flatten gal took : 41 ms
[2021-05-09 08:22:48] [INFO ] Input system was already deterministic with 506 transitions.
Incomplete random walk after 100000 steps, including 551 resets, run finished after 364 ms. (steps per millisecond=274 ) properties (out of 12) seen :6
Running SMT prover for 6 properties.
// Phase 1: matrix 506 rows 585 cols
[2021-05-09 08:22:48] [INFO ] Computed 117 place invariants in 20 ms
[2021-05-09 08:22:48] [INFO ] [Real]Absence check using 70 positive place invariants in 24 ms returned sat
[2021-05-09 08:22:48] [INFO ] [Real]Absence check using 70 positive and 47 generalized place invariants in 15 ms returned sat
[2021-05-09 08:22:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:22:48] [INFO ] [Real]Absence check using state equation in 188 ms returned sat
[2021-05-09 08:22:48] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:22:48] [INFO ] [Nat]Absence check using 70 positive place invariants in 17 ms returned sat
[2021-05-09 08:22:48] [INFO ] [Nat]Absence check using 70 positive and 47 generalized place invariants in 8 ms returned sat
[2021-05-09 08:22:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:22:49] [INFO ] [Nat]Absence check using state equation in 144 ms returned sat
[2021-05-09 08:22:49] [INFO ] Deduced a trap composed of 105 places in 153 ms of which 4 ms to minimize.
[2021-05-09 08:22:49] [INFO ] Deduced a trap composed of 11 places in 68 ms of which 1 ms to minimize.
[2021-05-09 08:22:49] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 1 ms to minimize.
[2021-05-09 08:22:49] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 1 ms to minimize.
[2021-05-09 08:22:49] [INFO ] Deduced a trap composed of 46 places in 60 ms of which 1 ms to minimize.
[2021-05-09 08:22:49] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 562 ms
[2021-05-09 08:22:49] [INFO ] Computed and/alt/rep : 499/937/499 causal constraints (skipped 6 transitions) in 34 ms.
[2021-05-09 08:22:51] [INFO ] Added : 277 causal constraints over 56 iterations in 1735 ms. Result :sat
[2021-05-09 08:22:51] [INFO ] [Real]Absence check using 70 positive place invariants in 34 ms returned sat
[2021-05-09 08:22:51] [INFO ] [Real]Absence check using 70 positive and 47 generalized place invariants in 14 ms returned sat
[2021-05-09 08:22:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:22:51] [INFO ] [Real]Absence check using state equation in 208 ms returned sat
[2021-05-09 08:22:51] [INFO ] Deduced a trap composed of 82 places in 184 ms of which 1 ms to minimize.
[2021-05-09 08:22:51] [INFO ] Deduced a trap composed of 36 places in 59 ms of which 0 ms to minimize.
[2021-05-09 08:22:52] [INFO ] Deduced a trap composed of 87 places in 148 ms of which 1 ms to minimize.
[2021-05-09 08:22:52] [INFO ] Deduced a trap composed of 84 places in 789 ms of which 0 ms to minimize.
[2021-05-09 08:22:53] [INFO ] Deduced a trap composed of 82 places in 144 ms of which 1 ms to minimize.
[2021-05-09 08:22:53] [INFO ] Deduced a trap composed of 83 places in 100 ms of which 1 ms to minimize.
[2021-05-09 08:22:53] [INFO ] Deduced a trap composed of 39 places in 47 ms of which 0 ms to minimize.
[2021-05-09 08:22:53] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1693 ms
[2021-05-09 08:22:53] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:22:53] [INFO ] [Nat]Absence check using 70 positive place invariants in 133 ms returned sat
[2021-05-09 08:22:53] [INFO ] [Nat]Absence check using 70 positive and 47 generalized place invariants in 8 ms returned sat
[2021-05-09 08:22:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:22:53] [INFO ] [Nat]Absence check using state equation in 175 ms returned sat
[2021-05-09 08:22:53] [INFO ] Deduced a trap composed of 82 places in 104 ms of which 1 ms to minimize.
[2021-05-09 08:22:53] [INFO ] Deduced a trap composed of 36 places in 37 ms of which 0 ms to minimize.
[2021-05-09 08:22:54] [INFO ] Deduced a trap composed of 87 places in 83 ms of which 0 ms to minimize.
[2021-05-09 08:22:54] [INFO ] Deduced a trap composed of 84 places in 127 ms of which 0 ms to minimize.
[2021-05-09 08:22:54] [INFO ] Deduced a trap composed of 82 places in 122 ms of which 1 ms to minimize.
[2021-05-09 08:22:54] [INFO ] Deduced a trap composed of 83 places in 96 ms of which 0 ms to minimize.
[2021-05-09 08:22:54] [INFO ] Deduced a trap composed of 39 places in 70 ms of which 0 ms to minimize.
[2021-05-09 08:22:54] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 799 ms
[2021-05-09 08:22:54] [INFO ] Computed and/alt/rep : 499/937/499 causal constraints (skipped 6 transitions) in 20 ms.
[2021-05-09 08:22:55] [INFO ] Added : 226 causal constraints over 46 iterations in 1274 ms. Result :sat
[2021-05-09 08:22:55] [INFO ] [Real]Absence check using 70 positive place invariants in 30 ms returned sat
[2021-05-09 08:22:56] [INFO ] [Real]Absence check using 70 positive and 47 generalized place invariants in 14 ms returned sat
[2021-05-09 08:22:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:22:56] [INFO ] [Real]Absence check using state equation in 208 ms returned sat
[2021-05-09 08:22:56] [INFO ] Deduced a trap composed of 11 places in 147 ms of which 0 ms to minimize.
[2021-05-09 08:22:56] [INFO ] Deduced a trap composed of 82 places in 144 ms of which 0 ms to minimize.
[2021-05-09 08:22:56] [INFO ] Deduced a trap composed of 81 places in 149 ms of which 1 ms to minimize.
[2021-05-09 08:22:56] [INFO ] Deduced a trap composed of 19 places in 126 ms of which 0 ms to minimize.
[2021-05-09 08:22:57] [INFO ] Deduced a trap composed of 81 places in 117 ms of which 1 ms to minimize.
[2021-05-09 08:22:57] [INFO ] Deduced a trap composed of 82 places in 153 ms of which 1 ms to minimize.
[2021-05-09 08:22:57] [INFO ] Deduced a trap composed of 8 places in 147 ms of which 1 ms to minimize.
[2021-05-09 08:22:57] [INFO ] Deduced a trap composed of 99 places in 112 ms of which 0 ms to minimize.
[2021-05-09 08:22:57] [INFO ] Deduced a trap composed of 97 places in 161 ms of which 0 ms to minimize.
[2021-05-09 08:22:57] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 0 ms to minimize.
[2021-05-09 08:22:57] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 0 ms to minimize.
[2021-05-09 08:22:57] [INFO ] Deduced a trap composed of 36 places in 85 ms of which 1 ms to minimize.
[2021-05-09 08:22:58] [INFO ] Deduced a trap composed of 100 places in 155 ms of which 1 ms to minimize.
[2021-05-09 08:22:58] [INFO ] Deduced a trap composed of 93 places in 165 ms of which 1 ms to minimize.
[2021-05-09 08:22:58] [INFO ] Deduced a trap composed of 101 places in 158 ms of which 1 ms to minimize.
[2021-05-09 08:22:58] [INFO ] Deduced a trap composed of 30 places in 141 ms of which 3 ms to minimize.
[2021-05-09 08:22:58] [INFO ] Deduced a trap composed of 26 places in 134 ms of which 1 ms to minimize.
[2021-05-09 08:22:59] [INFO ] Deduced a trap composed of 96 places in 137 ms of which 1 ms to minimize.
[2021-05-09 08:22:59] [INFO ] Deduced a trap composed of 52 places in 70 ms of which 2 ms to minimize.
[2021-05-09 08:22:59] [INFO ] Deduced a trap composed of 32 places in 61 ms of which 1 ms to minimize.
[2021-05-09 08:22:59] [INFO ] Deduced a trap composed of 32 places in 74 ms of which 0 ms to minimize.
[2021-05-09 08:22:59] [INFO ] Deduced a trap composed of 48 places in 70 ms of which 0 ms to minimize.
[2021-05-09 08:22:59] [INFO ] Deduced a trap composed of 49 places in 54 ms of which 1 ms to minimize.
[2021-05-09 08:22:59] [INFO ] Deduced a trap composed of 79 places in 70 ms of which 1 ms to minimize.
[2021-05-09 08:22:59] [INFO ] Deduced a trap composed of 52 places in 79 ms of which 1 ms to minimize.
[2021-05-09 08:22:59] [INFO ] Deduced a trap composed of 82 places in 69 ms of which 0 ms to minimize.
[2021-05-09 08:23:00] [INFO ] Deduced a trap composed of 105 places in 140 ms of which 1 ms to minimize.
[2021-05-09 08:23:00] [INFO ] Deduced a trap composed of 96 places in 164 ms of which 0 ms to minimize.
[2021-05-09 08:23:00] [INFO ] Deduced a trap composed of 99 places in 138 ms of which 0 ms to minimize.
[2021-05-09 08:23:00] [INFO ] Deduced a trap composed of 59 places in 136 ms of which 1 ms to minimize.
[2021-05-09 08:23:00] [INFO ] Deduced a trap composed of 99 places in 162 ms of which 1 ms to minimize.
[2021-05-09 08:23:00] [INFO ] Deduced a trap composed of 102 places in 160 ms of which 1 ms to minimize.
[2021-05-09 08:23:01] [INFO ] Deduced a trap composed of 103 places in 123 ms of which 0 ms to minimize.
[2021-05-09 08:23:01] [INFO ] Deduced a trap composed of 98 places in 174 ms of which 1 ms to minimize.
[2021-05-09 08:23:01] [INFO ] Deduced a trap composed of 94 places in 155 ms of which 1 ms to minimize.
[2021-05-09 08:23:01] [INFO ] Trap strengthening (SAT) tested/added 36/35 trap constraints in 5219 ms
[2021-05-09 08:23:01] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:23:01] [INFO ] [Nat]Absence check using 70 positive place invariants in 24 ms returned sat
[2021-05-09 08:23:01] [INFO ] [Nat]Absence check using 70 positive and 47 generalized place invariants in 12 ms returned sat
[2021-05-09 08:23:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:23:01] [INFO ] [Nat]Absence check using state equation in 173 ms returned sat
[2021-05-09 08:23:01] [INFO ] Deduced a trap composed of 11 places in 116 ms of which 1 ms to minimize.
[2021-05-09 08:23:02] [INFO ] Deduced a trap composed of 82 places in 136 ms of which 4 ms to minimize.
[2021-05-09 08:23:02] [INFO ] Deduced a trap composed of 81 places in 143 ms of which 1 ms to minimize.
[2021-05-09 08:23:02] [INFO ] Deduced a trap composed of 19 places in 126 ms of which 0 ms to minimize.
[2021-05-09 08:23:02] [INFO ] Deduced a trap composed of 81 places in 116 ms of which 1 ms to minimize.
[2021-05-09 08:23:02] [INFO ] Deduced a trap composed of 82 places in 109 ms of which 0 ms to minimize.
[2021-05-09 08:23:02] [INFO ] Deduced a trap composed of 8 places in 108 ms of which 0 ms to minimize.
[2021-05-09 08:23:02] [INFO ] Deduced a trap composed of 99 places in 107 ms of which 0 ms to minimize.
[2021-05-09 08:23:02] [INFO ] Deduced a trap composed of 97 places in 108 ms of which 0 ms to minimize.
[2021-05-09 08:23:03] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2021-05-09 08:23:03] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 0 ms to minimize.
[2021-05-09 08:23:03] [INFO ] Deduced a trap composed of 36 places in 49 ms of which 2 ms to minimize.
[2021-05-09 08:23:03] [INFO ] Deduced a trap composed of 100 places in 113 ms of which 0 ms to minimize.
[2021-05-09 08:23:03] [INFO ] Deduced a trap composed of 93 places in 115 ms of which 2 ms to minimize.
[2021-05-09 08:23:03] [INFO ] Deduced a trap composed of 101 places in 119 ms of which 6 ms to minimize.
[2021-05-09 08:23:03] [INFO ] Deduced a trap composed of 30 places in 98 ms of which 1 ms to minimize.
[2021-05-09 08:23:03] [INFO ] Deduced a trap composed of 26 places in 124 ms of which 0 ms to minimize.
[2021-05-09 08:23:03] [INFO ] Deduced a trap composed of 96 places in 128 ms of which 1 ms to minimize.
[2021-05-09 08:23:04] [INFO ] Deduced a trap composed of 100 places in 104 ms of which 0 ms to minimize.
[2021-05-09 08:23:04] [INFO ] Deduced a trap composed of 52 places in 46 ms of which 1 ms to minimize.
[2021-05-09 08:23:04] [INFO ] Deduced a trap composed of 32 places in 45 ms of which 0 ms to minimize.
[2021-05-09 08:23:04] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 1 ms to minimize.
[2021-05-09 08:23:04] [INFO ] Deduced a trap composed of 48 places in 46 ms of which 0 ms to minimize.
[2021-05-09 08:23:04] [INFO ] Deduced a trap composed of 49 places in 44 ms of which 1 ms to minimize.
[2021-05-09 08:23:04] [INFO ] Deduced a trap composed of 79 places in 42 ms of which 1 ms to minimize.
[2021-05-09 08:23:04] [INFO ] Deduced a trap composed of 52 places in 42 ms of which 0 ms to minimize.
[2021-05-09 08:23:04] [INFO ] Deduced a trap composed of 82 places in 41 ms of which 0 ms to minimize.
[2021-05-09 08:23:04] [INFO ] Trap strengthening (SAT) tested/added 28/27 trap constraints in 2886 ms
[2021-05-09 08:23:04] [INFO ] Computed and/alt/rep : 499/937/499 causal constraints (skipped 6 transitions) in 30 ms.
[2021-05-09 08:23:06] [INFO ] Added : 327 causal constraints over 66 iterations in 2234 ms. Result :sat
[2021-05-09 08:23:06] [INFO ] [Real]Absence check using 70 positive place invariants in 19 ms returned sat
[2021-05-09 08:23:06] [INFO ] [Real]Absence check using 70 positive and 47 generalized place invariants in 12 ms returned sat
[2021-05-09 08:23:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:23:07] [INFO ] [Real]Absence check using state equation in 185 ms returned sat
[2021-05-09 08:23:07] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:23:07] [INFO ] [Nat]Absence check using 70 positive place invariants in 23 ms returned sat
[2021-05-09 08:23:07] [INFO ] [Nat]Absence check using 70 positive and 47 generalized place invariants in 12 ms returned sat
[2021-05-09 08:23:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:23:07] [INFO ] [Nat]Absence check using state equation in 200 ms returned sat
[2021-05-09 08:23:07] [INFO ] Deduced a trap composed of 16 places in 161 ms of which 1 ms to minimize.
[2021-05-09 08:23:07] [INFO ] Deduced a trap composed of 19 places in 192 ms of which 0 ms to minimize.
[2021-05-09 08:23:08] [INFO ] Deduced a trap composed of 100 places in 158 ms of which 1 ms to minimize.
[2021-05-09 08:23:08] [INFO ] Deduced a trap composed of 30 places in 73 ms of which 0 ms to minimize.
[2021-05-09 08:23:08] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 0 ms to minimize.
[2021-05-09 08:23:08] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 0 ms to minimize.
[2021-05-09 08:23:08] [INFO ] Deduced a trap composed of 44 places in 67 ms of which 1 ms to minimize.
[2021-05-09 08:23:08] [INFO ] Deduced a trap composed of 31 places in 65 ms of which 0 ms to minimize.
[2021-05-09 08:23:08] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 0 ms to minimize.
[2021-05-09 08:23:08] [INFO ] Deduced a trap composed of 34 places in 76 ms of which 0 ms to minimize.
[2021-05-09 08:23:08] [INFO ] Deduced a trap composed of 45 places in 64 ms of which 0 ms to minimize.
[2021-05-09 08:23:08] [INFO ] Deduced a trap composed of 43 places in 66 ms of which 0 ms to minimize.
[2021-05-09 08:23:08] [INFO ] Deduced a trap composed of 46 places in 57 ms of which 1 ms to minimize.
[2021-05-09 08:23:09] [INFO ] Deduced a trap composed of 46 places in 74 ms of which 1 ms to minimize.
[2021-05-09 08:23:09] [INFO ] Deduced a trap composed of 54 places in 69 ms of which 0 ms to minimize.
[2021-05-09 08:23:09] [INFO ] Deduced a trap composed of 36 places in 64 ms of which 0 ms to minimize.
[2021-05-09 08:23:09] [INFO ] Deduced a trap composed of 47 places in 95 ms of which 1 ms to minimize.
[2021-05-09 08:23:09] [INFO ] Deduced a trap composed of 77 places in 72 ms of which 1 ms to minimize.
[2021-05-09 08:23:09] [INFO ] Deduced a trap composed of 79 places in 78 ms of which 0 ms to minimize.
[2021-05-09 08:23:09] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 2180 ms
[2021-05-09 08:23:09] [INFO ] Computed and/alt/rep : 499/937/499 causal constraints (skipped 6 transitions) in 33 ms.
[2021-05-09 08:23:12] [INFO ] Added : 334 causal constraints over 67 iterations in 2712 ms. Result :sat
[2021-05-09 08:23:12] [INFO ] [Real]Absence check using 70 positive place invariants in 26 ms returned sat
[2021-05-09 08:23:12] [INFO ] [Real]Absence check using 70 positive and 47 generalized place invariants in 15 ms returned sat
[2021-05-09 08:23:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:23:12] [INFO ] [Real]Absence check using state equation in 192 ms returned sat
[2021-05-09 08:23:12] [INFO ] Deduced a trap composed of 12 places in 170 ms of which 1 ms to minimize.
[2021-05-09 08:23:13] [INFO ] Deduced a trap composed of 19 places in 180 ms of which 0 ms to minimize.
[2021-05-09 08:23:13] [INFO ] Deduced a trap composed of 28 places in 208 ms of which 1 ms to minimize.
[2021-05-09 08:23:13] [INFO ] Deduced a trap composed of 16 places in 194 ms of which 1 ms to minimize.
[2021-05-09 08:23:13] [INFO ] Deduced a trap composed of 18 places in 194 ms of which 1 ms to minimize.
[2021-05-09 08:23:13] [INFO ] Deduced a trap composed of 103 places in 195 ms of which 0 ms to minimize.
[2021-05-09 08:23:14] [INFO ] Deduced a trap composed of 99 places in 145 ms of which 0 ms to minimize.
[2021-05-09 08:23:14] [INFO ] Deduced a trap composed of 99 places in 188 ms of which 1 ms to minimize.
[2021-05-09 08:23:14] [INFO ] Deduced a trap composed of 102 places in 186 ms of which 1 ms to minimize.
[2021-05-09 08:23:14] [INFO ] Deduced a trap composed of 99 places in 188 ms of which 1 ms to minimize.
[2021-05-09 08:23:14] [INFO ] Deduced a trap composed of 106 places in 193 ms of which 1 ms to minimize.
[2021-05-09 08:23:15] [INFO ] Deduced a trap composed of 16 places in 189 ms of which 1 ms to minimize.
[2021-05-09 08:23:15] [INFO ] Deduced a trap composed of 102 places in 207 ms of which 1 ms to minimize.
[2021-05-09 08:23:15] [INFO ] Deduced a trap composed of 95 places in 190 ms of which 1 ms to minimize.
[2021-05-09 08:23:15] [INFO ] Deduced a trap composed of 107 places in 170 ms of which 0 ms to minimize.
[2021-05-09 08:23:16] [INFO ] Deduced a trap composed of 104 places in 182 ms of which 1 ms to minimize.
[2021-05-09 08:23:16] [INFO ] Deduced a trap composed of 33 places in 172 ms of which 1 ms to minimize.
[2021-05-09 08:23:16] [INFO ] Deduced a trap composed of 26 places in 134 ms of which 1 ms to minimize.
[2021-05-09 08:23:16] [INFO ] Deduced a trap composed of 97 places in 184 ms of which 1 ms to minimize.
[2021-05-09 08:23:16] [INFO ] Deduced a trap composed of 96 places in 157 ms of which 0 ms to minimize.
[2021-05-09 08:23:16] [INFO ] Deduced a trap composed of 98 places in 162 ms of which 0 ms to minimize.
[2021-05-09 08:23:17] [INFO ] Deduced a trap composed of 98 places in 154 ms of which 0 ms to minimize.
[2021-05-09 08:23:17] [INFO ] Deduced a trap composed of 97 places in 379 ms of which 0 ms to minimize.
[2021-05-09 08:23:17] [INFO ] Deduced a trap composed of 97 places in 153 ms of which 0 ms to minimize.
[2021-05-09 08:23:17] [INFO ] Deduced a trap composed of 101 places in 151 ms of which 0 ms to minimize.
[2021-05-09 08:23:18] [INFO ] Deduced a trap composed of 95 places in 132 ms of which 0 ms to minimize.
[2021-05-09 08:23:18] [INFO ] Deduced a trap composed of 94 places in 165 ms of which 1 ms to minimize.
[2021-05-09 08:23:18] [INFO ] Deduced a trap composed of 106 places in 129 ms of which 0 ms to minimize.
[2021-05-09 08:23:18] [INFO ] Deduced a trap composed of 98 places in 129 ms of which 0 ms to minimize.
[2021-05-09 08:23:18] [INFO ] Deduced a trap composed of 99 places in 129 ms of which 1 ms to minimize.
[2021-05-09 08:23:18] [INFO ] Deduced a trap composed of 100 places in 131 ms of which 0 ms to minimize.
[2021-05-09 08:23:19] [INFO ] Deduced a trap composed of 36 places in 130 ms of which 0 ms to minimize.
[2021-05-09 08:23:19] [INFO ] Deduced a trap composed of 101 places in 114 ms of which 1 ms to minimize.
[2021-05-09 08:23:19] [INFO ] Deduced a trap composed of 109 places in 114 ms of which 1 ms to minimize.
[2021-05-09 08:23:19] [INFO ] Deduced a trap composed of 103 places in 136 ms of which 0 ms to minimize.
[2021-05-09 08:23:19] [INFO ] Deduced a trap composed of 104 places in 101 ms of which 1 ms to minimize.
[2021-05-09 08:23:19] [INFO ] Deduced a trap composed of 105 places in 128 ms of which 1 ms to minimize.
[2021-05-09 08:23:19] [INFO ] Deduced a trap composed of 102 places in 111 ms of which 1 ms to minimize.
[2021-05-09 08:23:20] [INFO ] Deduced a trap composed of 101 places in 115 ms of which 0 ms to minimize.
[2021-05-09 08:23:20] [INFO ] Deduced a trap composed of 107 places in 109 ms of which 0 ms to minimize.
[2021-05-09 08:23:20] [INFO ] Deduced a trap composed of 32 places in 152 ms of which 0 ms to minimize.
[2021-05-09 08:23:20] [INFO ] Deduced a trap composed of 97 places in 159 ms of which 1 ms to minimize.
[2021-05-09 08:23:20] [INFO ] Deduced a trap composed of 98 places in 148 ms of which 0 ms to minimize.
[2021-05-09 08:23:20] [INFO ] Deduced a trap composed of 98 places in 113 ms of which 1 ms to minimize.
[2021-05-09 08:23:20] [INFO ] Deduced a trap composed of 102 places in 121 ms of which 0 ms to minimize.
[2021-05-09 08:23:21] [INFO ] Deduced a trap composed of 49 places in 107 ms of which 0 ms to minimize.
[2021-05-09 08:23:21] [INFO ] Deduced a trap composed of 102 places in 123 ms of which 0 ms to minimize.
[2021-05-09 08:23:21] [INFO ] Deduced a trap composed of 100 places in 169 ms of which 0 ms to minimize.
[2021-05-09 08:23:21] [INFO ] Deduced a trap composed of 102 places in 142 ms of which 1 ms to minimize.
[2021-05-09 08:23:21] [INFO ] Deduced a trap composed of 106 places in 161 ms of which 1 ms to minimize.
[2021-05-09 08:23:22] [INFO ] Deduced a trap composed of 24 places in 173 ms of which 1 ms to minimize.
[2021-05-09 08:23:22] [INFO ] Deduced a trap composed of 19 places in 135 ms of which 1 ms to minimize.
[2021-05-09 08:23:22] [INFO ] Deduced a trap composed of 14 places in 140 ms of which 1 ms to minimize.
[2021-05-09 08:23:22] [INFO ] Deduced a trap composed of 103 places in 153 ms of which 0 ms to minimize.
[2021-05-09 08:23:22] [INFO ] Deduced a trap composed of 104 places in 138 ms of which 0 ms to minimize.
[2021-05-09 08:23:23] [INFO ] Deduced a trap composed of 97 places in 145 ms of which 0 ms to minimize.
[2021-05-09 08:23:23] [INFO ] Deduced a trap composed of 99 places in 194 ms of which 0 ms to minimize.
[2021-05-09 08:23:23] [INFO ] Deduced a trap composed of 104 places in 155 ms of which 0 ms to minimize.
[2021-05-09 08:23:23] [INFO ] Deduced a trap composed of 104 places in 151 ms of which 1 ms to minimize.
[2021-05-09 08:23:23] [INFO ] Deduced a trap composed of 23 places in 161 ms of which 1 ms to minimize.
[2021-05-09 08:23:23] [INFO ] Deduced a trap composed of 99 places in 130 ms of which 1 ms to minimize.
[2021-05-09 08:23:24] [INFO ] Deduced a trap composed of 96 places in 112 ms of which 1 ms to minimize.
[2021-05-09 08:23:24] [INFO ] Deduced a trap composed of 103 places in 134 ms of which 1 ms to minimize.
[2021-05-09 08:23:24] [INFO ] Deduced a trap composed of 99 places in 131 ms of which 0 ms to minimize.
[2021-05-09 08:23:24] [INFO ] Deduced a trap composed of 97 places in 134 ms of which 1 ms to minimize.
[2021-05-09 08:23:24] [INFO ] Deduced a trap composed of 97 places in 133 ms of which 1 ms to minimize.
[2021-05-09 08:23:24] [INFO ] Deduced a trap composed of 100 places in 132 ms of which 1 ms to minimize.
[2021-05-09 08:23:25] [INFO ] Deduced a trap composed of 31 places in 119 ms of which 1 ms to minimize.
[2021-05-09 08:23:25] [INFO ] Deduced a trap composed of 48 places in 98 ms of which 1 ms to minimize.
[2021-05-09 08:23:25] [INFO ] Deduced a trap composed of 39 places in 100 ms of which 0 ms to minimize.
[2021-05-09 08:23:25] [INFO ] Deduced a trap composed of 100 places in 114 ms of which 0 ms to minimize.
[2021-05-09 08:23:25] [INFO ] Deduced a trap composed of 103 places in 111 ms of which 0 ms to minimize.
[2021-05-09 08:23:25] [INFO ] Deduced a trap composed of 103 places in 117 ms of which 1 ms to minimize.
[2021-05-09 08:23:25] [INFO ] Deduced a trap composed of 105 places in 93 ms of which 0 ms to minimize.
[2021-05-09 08:23:25] [INFO ] Deduced a trap composed of 49 places in 92 ms of which 0 ms to minimize.
[2021-05-09 08:23:26] [INFO ] Deduced a trap composed of 104 places in 92 ms of which 0 ms to minimize.
[2021-05-09 08:23:26] [INFO ] Deduced a trap composed of 33 places in 126 ms of which 0 ms to minimize.
[2021-05-09 08:23:26] [INFO ] Deduced a trap composed of 95 places in 93 ms of which 0 ms to minimize.
[2021-05-09 08:23:26] [INFO ] Deduced a trap composed of 108 places in 93 ms of which 0 ms to minimize.
[2021-05-09 08:23:26] [INFO ] Deduced a trap composed of 109 places in 86 ms of which 0 ms to minimize.
[2021-05-09 08:23:26] [INFO ] Deduced a trap composed of 109 places in 111 ms of which 1 ms to minimize.
[2021-05-09 08:23:26] [INFO ] Deduced a trap composed of 107 places in 92 ms of which 0 ms to minimize.
[2021-05-09 08:23:26] [INFO ] Deduced a trap composed of 102 places in 90 ms of which 0 ms to minimize.
[2021-05-09 08:23:26] [INFO ] Deduced a trap composed of 102 places in 89 ms of which 1 ms to minimize.
[2021-05-09 08:23:27] [INFO ] Deduced a trap composed of 99 places in 93 ms of which 0 ms to minimize.
[2021-05-09 08:23:27] [INFO ] Deduced a trap composed of 100 places in 124 ms of which 1 ms to minimize.
[2021-05-09 08:23:27] [INFO ] Deduced a trap composed of 104 places in 173 ms of which 0 ms to minimize.
[2021-05-09 08:23:27] [INFO ] Deduced a trap composed of 101 places in 175 ms of which 0 ms to minimize.
[2021-05-09 08:23:27] [INFO ] Deduced a trap composed of 102 places in 148 ms of which 0 ms to minimize.
[2021-05-09 08:23:28] [INFO ] Deduced a trap composed of 104 places in 143 ms of which 1 ms to minimize.
[2021-05-09 08:23:28] [INFO ] Deduced a trap composed of 107 places in 141 ms of which 1 ms to minimize.
[2021-05-09 08:23:28] [INFO ] Deduced a trap composed of 114 places in 144 ms of which 0 ms to minimize.
[2021-05-09 08:23:28] [INFO ] Deduced a trap composed of 106 places in 112 ms of which 1 ms to minimize.
[2021-05-09 08:23:28] [INFO ] Deduced a trap composed of 105 places in 134 ms of which 1 ms to minimize.
[2021-05-09 08:23:28] [INFO ] Deduced a trap composed of 50 places in 76 ms of which 1 ms to minimize.
[2021-05-09 08:23:28] [INFO ] Deduced a trap composed of 47 places in 75 ms of which 1 ms to minimize.
[2021-05-09 08:23:28] [INFO ] Deduced a trap composed of 34 places in 38 ms of which 1 ms to minimize.
[2021-05-09 08:23:28] [INFO ] Trap strengthening (SAT) tested/added 98/97 trap constraints in 16285 ms
[2021-05-09 08:23:29] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:23:29] [INFO ] [Nat]Absence check using 70 positive place invariants in 122 ms returned sat
[2021-05-09 08:23:29] [INFO ] [Nat]Absence check using 70 positive and 47 generalized place invariants in 314 ms returned sat
[2021-05-09 08:23:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:23:29] [INFO ] [Nat]Absence check using state equation in 151 ms returned sat
[2021-05-09 08:23:29] [INFO ] Deduced a trap composed of 12 places in 158 ms of which 1 ms to minimize.
[2021-05-09 08:23:30] [INFO ] Deduced a trap composed of 19 places in 162 ms of which 0 ms to minimize.
[2021-05-09 08:23:30] [INFO ] Deduced a trap composed of 28 places in 133 ms of which 1 ms to minimize.
[2021-05-09 08:23:30] [INFO ] Deduced a trap composed of 16 places in 130 ms of which 0 ms to minimize.
[2021-05-09 08:23:30] [INFO ] Deduced a trap composed of 18 places in 121 ms of which 0 ms to minimize.
[2021-05-09 08:23:30] [INFO ] Deduced a trap composed of 103 places in 120 ms of which 0 ms to minimize.
[2021-05-09 08:23:30] [INFO ] Deduced a trap composed of 99 places in 133 ms of which 0 ms to minimize.
[2021-05-09 08:23:30] [INFO ] Deduced a trap composed of 99 places in 146 ms of which 1 ms to minimize.
[2021-05-09 08:23:31] [INFO ] Deduced a trap composed of 102 places in 130 ms of which 0 ms to minimize.
[2021-05-09 08:23:31] [INFO ] Deduced a trap composed of 99 places in 145 ms of which 0 ms to minimize.
[2021-05-09 08:23:31] [INFO ] Deduced a trap composed of 106 places in 141 ms of which 1 ms to minimize.
[2021-05-09 08:23:31] [INFO ] Deduced a trap composed of 16 places in 170 ms of which 1 ms to minimize.
[2021-05-09 08:23:31] [INFO ] Deduced a trap composed of 102 places in 146 ms of which 0 ms to minimize.
[2021-05-09 08:23:31] [INFO ] Deduced a trap composed of 95 places in 162 ms of which 0 ms to minimize.
[2021-05-09 08:23:32] [INFO ] Deduced a trap composed of 107 places in 160 ms of which 0 ms to minimize.
[2021-05-09 08:23:32] [INFO ] Deduced a trap composed of 104 places in 148 ms of which 1 ms to minimize.
[2021-05-09 08:23:32] [INFO ] Deduced a trap composed of 33 places in 175 ms of which 1 ms to minimize.
[2021-05-09 08:23:32] [INFO ] Deduced a trap composed of 26 places in 133 ms of which 0 ms to minimize.
[2021-05-09 08:23:32] [INFO ] Deduced a trap composed of 97 places in 122 ms of which 0 ms to minimize.
[2021-05-09 08:23:32] [INFO ] Deduced a trap composed of 96 places in 132 ms of which 1 ms to minimize.
[2021-05-09 08:23:33] [INFO ] Deduced a trap composed of 100 places in 120 ms of which 1 ms to minimize.
[2021-05-09 08:23:33] [INFO ] Deduced a trap composed of 103 places in 120 ms of which 1 ms to minimize.
[2021-05-09 08:23:33] [INFO ] Deduced a trap composed of 96 places in 113 ms of which 1 ms to minimize.
[2021-05-09 08:23:33] [INFO ] Deduced a trap composed of 23 places in 119 ms of which 0 ms to minimize.
[2021-05-09 08:23:33] [INFO ] Deduced a trap composed of 33 places in 108 ms of which 0 ms to minimize.
[2021-05-09 08:23:33] [INFO ] Deduced a trap composed of 101 places in 93 ms of which 1 ms to minimize.
[2021-05-09 08:23:33] [INFO ] Deduced a trap composed of 104 places in 101 ms of which 0 ms to minimize.
[2021-05-09 08:23:34] [INFO ] Deduced a trap composed of 101 places in 109 ms of which 0 ms to minimize.
[2021-05-09 08:23:34] [INFO ] Deduced a trap composed of 100 places in 110 ms of which 1 ms to minimize.
[2021-05-09 08:23:34] [INFO ] Deduced a trap composed of 103 places in 131 ms of which 0 ms to minimize.
[2021-05-09 08:23:34] [INFO ] Deduced a trap composed of 102 places in 100 ms of which 1 ms to minimize.
[2021-05-09 08:23:34] [INFO ] Deduced a trap composed of 107 places in 98 ms of which 0 ms to minimize.
[2021-05-09 08:23:34] [INFO ] Deduced a trap composed of 108 places in 103 ms of which 1 ms to minimize.
[2021-05-09 08:23:34] [INFO ] Deduced a trap composed of 103 places in 100 ms of which 0 ms to minimize.
[2021-05-09 08:23:34] [INFO ] Deduced a trap composed of 98 places in 101 ms of which 1 ms to minimize.
[2021-05-09 08:23:35] [INFO ] Deduced a trap composed of 97 places in 99 ms of which 0 ms to minimize.
[2021-05-09 08:23:35] [INFO ] Deduced a trap composed of 106 places in 97 ms of which 1 ms to minimize.
[2021-05-09 08:23:35] [INFO ] Deduced a trap composed of 98 places in 109 ms of which 0 ms to minimize.
[2021-05-09 08:23:35] [INFO ] Deduced a trap composed of 105 places in 118 ms of which 0 ms to minimize.
[2021-05-09 08:23:35] [INFO ] Deduced a trap composed of 105 places in 108 ms of which 1 ms to minimize.
[2021-05-09 08:23:35] [INFO ] Deduced a trap composed of 105 places in 117 ms of which 1 ms to minimize.
[2021-05-09 08:23:35] [INFO ] Deduced a trap composed of 20 places in 101 ms of which 1 ms to minimize.
[2021-05-09 08:23:35] [INFO ] Deduced a trap composed of 99 places in 111 ms of which 1 ms to minimize.
[2021-05-09 08:23:36] [INFO ] Deduced a trap composed of 108 places in 93 ms of which 0 ms to minimize.
[2021-05-09 08:23:36] [INFO ] Deduced a trap composed of 110 places in 116 ms of which 0 ms to minimize.
[2021-05-09 08:23:36] [INFO ] Deduced a trap composed of 105 places in 108 ms of which 1 ms to minimize.
[2021-05-09 08:23:36] [INFO ] Deduced a trap composed of 107 places in 99 ms of which 0 ms to minimize.
[2021-05-09 08:23:36] [INFO ] Deduced a trap composed of 107 places in 101 ms of which 0 ms to minimize.
[2021-05-09 08:23:36] [INFO ] Deduced a trap composed of 103 places in 116 ms of which 1 ms to minimize.
[2021-05-09 08:23:36] [INFO ] Deduced a trap composed of 115 places in 123 ms of which 1 ms to minimize.
[2021-05-09 08:23:36] [INFO ] Deduced a trap composed of 105 places in 97 ms of which 10 ms to minimize.
[2021-05-09 08:23:37] [INFO ] Deduced a trap composed of 107 places in 102 ms of which 13 ms to minimize.
[2021-05-09 08:23:37] [INFO ] Deduced a trap composed of 103 places in 112 ms of which 0 ms to minimize.
[2021-05-09 08:23:37] [INFO ] Deduced a trap composed of 102 places in 103 ms of which 0 ms to minimize.
[2021-05-09 08:23:37] [INFO ] Deduced a trap composed of 23 places in 127 ms of which 0 ms to minimize.
[2021-05-09 08:23:37] [INFO ] Deduced a trap composed of 14 places in 112 ms of which 1 ms to minimize.
[2021-05-09 08:23:37] [INFO ] Deduced a trap composed of 105 places in 112 ms of which 1 ms to minimize.
[2021-05-09 08:23:37] [INFO ] Deduced a trap composed of 97 places in 111 ms of which 1 ms to minimize.
[2021-05-09 08:23:38] [INFO ] Deduced a trap composed of 104 places in 114 ms of which 2 ms to minimize.
[2021-05-09 08:23:38] [INFO ] Deduced a trap composed of 98 places in 125 ms of which 0 ms to minimize.
[2021-05-09 08:23:38] [INFO ] Deduced a trap composed of 93 places in 147 ms of which 0 ms to minimize.
[2021-05-09 08:23:38] [INFO ] Deduced a trap composed of 100 places in 123 ms of which 1 ms to minimize.
[2021-05-09 08:23:38] [INFO ] Deduced a trap composed of 102 places in 130 ms of which 0 ms to minimize.
[2021-05-09 08:23:38] [INFO ] Deduced a trap composed of 97 places in 164 ms of which 1 ms to minimize.
[2021-05-09 08:23:39] [INFO ] Deduced a trap composed of 99 places in 156 ms of which 0 ms to minimize.
[2021-05-09 08:23:39] [INFO ] Deduced a trap composed of 96 places in 124 ms of which 1 ms to minimize.
[2021-05-09 08:23:39] [INFO ] Deduced a trap composed of 93 places in 118 ms of which 1 ms to minimize.
[2021-05-09 08:23:39] [INFO ] Deduced a trap composed of 94 places in 118 ms of which 0 ms to minimize.
[2021-05-09 08:23:39] [INFO ] Deduced a trap composed of 96 places in 116 ms of which 1 ms to minimize.
[2021-05-09 08:23:39] [INFO ] Deduced a trap composed of 93 places in 126 ms of which 0 ms to minimize.
[2021-05-09 08:23:39] [INFO ] Deduced a trap composed of 98 places in 117 ms of which 0 ms to minimize.
[2021-05-09 08:23:39] [INFO ] Deduced a trap composed of 47 places in 115 ms of which 0 ms to minimize.
[2021-05-09 08:23:40] [INFO ] Deduced a trap composed of 95 places in 90 ms of which 0 ms to minimize.
[2021-05-09 08:23:40] [INFO ] Deduced a trap composed of 34 places in 56 ms of which 0 ms to minimize.
[2021-05-09 08:23:40] [INFO ] Deduced a trap composed of 39 places in 53 ms of which 0 ms to minimize.
[2021-05-09 08:23:40] [INFO ] Deduced a trap composed of 57 places in 54 ms of which 0 ms to minimize.
[2021-05-09 08:23:40] [INFO ] Deduced a trap composed of 62 places in 47 ms of which 1 ms to minimize.
[2021-05-09 08:23:40] [INFO ] Trap strengthening (SAT) tested/added 78/77 trap constraints in 10767 ms
[2021-05-09 08:23:40] [INFO ] Computed and/alt/rep : 499/937/499 causal constraints (skipped 6 transitions) in 24 ms.
[2021-05-09 08:23:43] [INFO ] Deduced a trap composed of 102 places in 103 ms of which 0 ms to minimize.
[2021-05-09 08:23:43] [INFO ] Deduced a trap composed of 102 places in 112 ms of which 1 ms to minimize.
[2021-05-09 08:23:43] [INFO ] Deduced a trap composed of 111 places in 152 ms of which 0 ms to minimize.
[2021-05-09 08:23:43] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 606 ms
[2021-05-09 08:23:43] [INFO ] Added : 358 causal constraints over 72 iterations in 3455 ms. Result :sat
[2021-05-09 08:23:44] [INFO ] [Real]Absence check using 70 positive place invariants in 27 ms returned sat
[2021-05-09 08:23:44] [INFO ] [Real]Absence check using 70 positive and 47 generalized place invariants in 14 ms returned sat
[2021-05-09 08:23:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:23:44] [INFO ] [Real]Absence check using state equation in 201 ms returned sat
[2021-05-09 08:23:44] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:23:44] [INFO ] [Nat]Absence check using 70 positive place invariants in 24 ms returned sat
[2021-05-09 08:23:44] [INFO ] [Nat]Absence check using 70 positive and 47 generalized place invariants in 13 ms returned sat
[2021-05-09 08:23:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:23:44] [INFO ] [Nat]Absence check using state equation in 198 ms returned sat
[2021-05-09 08:23:44] [INFO ] Deduced a trap composed of 16 places in 85 ms of which 0 ms to minimize.
[2021-05-09 08:23:44] [INFO ] Deduced a trap composed of 14 places in 94 ms of which 0 ms to minimize.
[2021-05-09 08:23:44] [INFO ] Deduced a trap composed of 24 places in 80 ms of which 1 ms to minimize.
[2021-05-09 08:23:45] [INFO ] Deduced a trap composed of 12 places in 74 ms of which 1 ms to minimize.
[2021-05-09 08:23:45] [INFO ] Deduced a trap composed of 54 places in 68 ms of which 1 ms to minimize.
[2021-05-09 08:23:45] [INFO ] Deduced a trap composed of 24 places in 70 ms of which 1 ms to minimize.
[2021-05-09 08:23:45] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 0 ms to minimize.
[2021-05-09 08:23:45] [INFO ] Deduced a trap composed of 64 places in 71 ms of which 0 ms to minimize.
[2021-05-09 08:23:45] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 1 ms to minimize.
[2021-05-09 08:23:45] [INFO ] Deduced a trap composed of 26 places in 71 ms of which 0 ms to minimize.
[2021-05-09 08:23:45] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 959 ms
[2021-05-09 08:23:45] [INFO ] Computed and/alt/rep : 499/937/499 causal constraints (skipped 6 transitions) in 29 ms.
[2021-05-09 08:23:47] [INFO ] Deduced a trap composed of 101 places in 136 ms of which 1 ms to minimize.
[2021-05-09 08:23:47] [INFO ] Deduced a trap composed of 110 places in 137 ms of which 1 ms to minimize.
[2021-05-09 08:23:47] [INFO ] Deduced a trap composed of 108 places in 146 ms of which 0 ms to minimize.
[2021-05-09 08:23:48] [INFO ] Deduced a trap composed of 102 places in 107 ms of which 0 ms to minimize.
[2021-05-09 08:23:48] [INFO ] Deduced a trap composed of 106 places in 175 ms of which 0 ms to minimize.
[2021-05-09 08:23:48] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1028 ms
[2021-05-09 08:23:48] [INFO ] Added : 355 causal constraints over 72 iterations in 2974 ms. Result :sat
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(p0))], workingDir=/home/mcc/execution]
Support contains 2 out of 585 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 585/585 places, 506/506 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 581 transition count 502
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 581 transition count 502
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 579 transition count 500
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 579 transition count 500
Applied a total of 12 rules in 323 ms. Remains 579 /585 variables (removed 6) and now considering 500/506 (removed 6) transitions.
// Phase 1: matrix 500 rows 579 cols
[2021-05-09 08:23:48] [INFO ] Computed 117 place invariants in 9 ms
[2021-05-09 08:23:49] [INFO ] Implicit Places using invariants in 319 ms returned []
// Phase 1: matrix 500 rows 579 cols
[2021-05-09 08:23:49] [INFO ] Computed 117 place invariants in 4 ms
[2021-05-09 08:23:49] [INFO ] Implicit Places using invariants and state equation in 712 ms returned []
Implicit Place search using SMT with State Equation took 1033 ms to find 0 implicit places.
// Phase 1: matrix 500 rows 579 cols
[2021-05-09 08:23:49] [INFO ] Computed 117 place invariants in 5 ms
[2021-05-09 08:23:50] [INFO ] Dead Transitions using invariants and state equation in 293 ms returned []
Finished structural reductions, in 1 iterations. Remains : 579/585 places, 500/506 transitions.
Stuttering acceptance computed with spot in 199 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : BusinessProcesses-PT-19-02 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(AND (NEQ s216 0) (NEQ s222 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-19-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-19-02 finished in 1924 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((p0 U (p1||G(p0))))))], workingDir=/home/mcc/execution]
Support contains 2 out of 585 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 585/585 places, 506/506 transitions.
Graph (trivial) has 274 edges and 585 vertex of which 6 / 585 are part of one of the 1 SCC in 7 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 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 66 rules applied. Total rules applied 67 place count 579 transition count 433
Reduce places removed 66 places and 0 transitions.
Iterating post reduction 1 with 66 rules applied. Total rules applied 133 place count 513 transition count 433
Performed 123 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 123 Pre rules applied. Total rules applied 133 place count 513 transition count 310
Deduced a syphon composed of 123 places in 2 ms
Ensure Unique test removed 24 places
Reduce places removed 147 places and 0 transitions.
Iterating global reduction 2 with 270 rules applied. Total rules applied 403 place count 366 transition count 310
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 407 place count 362 transition count 306
Ensure Unique test removed 1 places
Iterating global reduction 2 with 5 rules applied. Total rules applied 412 place count 361 transition count 306
Performed 158 Post agglomeration using F-continuation condition.Transition count delta: 158
Deduced a syphon composed of 158 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 162 places and 0 transitions.
Iterating global reduction 2 with 320 rules applied. Total rules applied 732 place count 199 transition count 148
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 734 place count 198 transition count 151
Applied a total of 734 rules in 211 ms. Remains 198 /585 variables (removed 387) and now considering 151/506 (removed 355) transitions.
// Phase 1: matrix 151 rows 198 cols
[2021-05-09 08:23:50] [INFO ] Computed 88 place invariants in 3 ms
[2021-05-09 08:23:50] [INFO ] Implicit Places using invariants in 213 ms returned [1, 2, 3, 6, 7, 15, 16, 17, 18, 19, 20, 23, 24, 25, 26, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 147]
Discarding 29 places :
Implicit Place search using SMT only with invariants took 222 ms to find 29 implicit places.
[2021-05-09 08:23:50] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 151 rows 169 cols
[2021-05-09 08:23:50] [INFO ] Computed 59 place invariants in 2 ms
[2021-05-09 08:23:51] [INFO ] Dead Transitions using invariants and state equation in 84 ms returned []
Starting structural reductions, iteration 1 : 169/585 places, 151/506 transitions.
Applied a total of 0 rules in 8 ms. Remains 169 /169 variables (removed 0) and now considering 151/151 (removed 0) transitions.
[2021-05-09 08:23:51] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 151 rows 169 cols
[2021-05-09 08:23:51] [INFO ] Computed 59 place invariants in 1 ms
[2021-05-09 08:23:51] [INFO ] Dead Transitions using invariants and state equation in 104 ms returned []
Finished structural reductions, in 2 iterations. Remains : 169/585 places, 151/506 transitions.
Stuttering acceptance computed with spot in 57 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-19-03 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 (NOT p1) p0), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(AND (NEQ s1 1) (NEQ s93 1)), p0:(NEQ s1 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 15065 reset in 334 ms.
Product exploration explored 100000 steps with 15063 reset in 320 ms.
Knowledge obtained : [p1, p0]
Stuttering acceptance computed with spot in 97 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 14899 reset in 246 ms.
Product exploration explored 100000 steps with 15011 reset in 253 ms.
[2021-05-09 08:23:52] [INFO ] Flatten gal took : 24 ms
[2021-05-09 08:23:52] [INFO ] Flatten gal took : 17 ms
[2021-05-09 08:23:52] [INFO ] Time to serialize gal into /tmp/LTL7949270678068891831.gal : 30 ms
[2021-05-09 08:23:52] [INFO ] Time to serialize properties into /tmp/LTL9024071596367826921.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/LTL7949270678068891831.gal, -t, CGAL, -LTL, /tmp/LTL9024071596367826921.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/LTL7949270678068891831.gal -t CGAL -LTL /tmp/LTL9024071596367826921.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(F(("(p53!=1)")U((G("(p53!=1)"))||("((p53!=1)&&(p509!=1))"))))))
Formula 0 simplified : !GF("(p53!=1)" U ("((p53!=1)&&(p509!=1))" | G"(p53!=1)"))
Detected timeout of ITS tools.
[2021-05-09 08:24:07] [INFO ] Flatten gal took : 34 ms
[2021-05-09 08:24:07] [INFO ] Applying decomposition
[2021-05-09 08:24:07] [INFO ] Flatten gal took : 19 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph5291699043083984261.txt, -o, /tmp/graph5291699043083984261.bin, -w, /tmp/graph5291699043083984261.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/graph5291699043083984261.bin, -l, -1, -v, -w, /tmp/graph5291699043083984261.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 08:24:07] [INFO ] Decomposing Gal with order
[2021-05-09 08:24:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 08:24:08] [INFO ] Removed a total of 117 redundant transitions.
[2021-05-09 08:24:08] [INFO ] Flatten gal took : 89 ms
[2021-05-09 08:24:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 34 labels/synchronizations in 33 ms.
[2021-05-09 08:24:08] [INFO ] Time to serialize gal into /tmp/LTL16685043698440655227.gal : 14 ms
[2021-05-09 08:24:08] [INFO ] Time to serialize properties into /tmp/LTL10480090346424668792.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/LTL16685043698440655227.gal, -t, CGAL, -LTL, /tmp/LTL10480090346424668792.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/LTL16685043698440655227.gal -t CGAL -LTL /tmp/LTL10480090346424668792.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((G(F(("(i0.u0.p53!=1)")U((G("(i0.u0.p53!=1)"))||("((i0.u0.p53!=1)&&(u31.p509!=1))"))))))
Formula 0 simplified : !GF("(i0.u0.p53!=1)" U ("((i0.u0.p53!=1)&&(u31.p509!=1))" | G"(i0.u0.p53!=1)"))
Reverse transition relation is NOT exact ! Due to transitions t268_t270_t271_t2_t272, t265_t266_t3_t272, t262_t263_t4_t272, t259_t260_t5_t272, t39_t41_t42_t7, t36_t37_t8, t33_t34_t9, t30_t31_t10, t117_t413_t72, t48_t135_t302_t366_t474_t303_t304_t72, t123_t420_t257_t272_t72, t114_t410_t257_t272_t72, t74_t196_t198_t201_t202_t203_t204_t208_t212_t216_t220_t224_t228_t232_t238_t243_t247_t251_t255_t273_t277_t281_t285_t289_t297_t301_t305_t309_t313_t317_t321_t327_t333_t337_t342_t346_t328_t290_t296_t75_t78_t81_t84_t87_t90_t93_t96_t99_t102_t105_t109_t112_t115_t118_t121_t124_t127_t130_t133_t136_t139_t142_t145_t148_t149_t152_t155_t158_t161_t164_t167_t170_t173_t176_t179_t182_t185_t188_t191_t192_t189_t186_t183_t180_t177_t174_t171_t168_t165_t162_t159_t153_t146_t143_t140_t137_t134_t131_t128_t125_t122_t119_t116_t113_t110_t103_t100_t97_t94_t91_t88_t85_t82_t79_t76_t292_t293_t294_t295, t470_t72_t292_t293_t294_t295, u31.t107, i2.u3.t324.t325.t1.t326, i8.t49_t138_t306_t362_t476_t307_t308_t72, i8.t50_t141_t310_t478_t311_t312_t72, i8.t50_t144_t310_t479_t311_t312_t72, i8.t51_t147_t314_t363_t481_t315_t316_t72, i8.u42.t55.t56.t6, i8.u42.t62.t194.t195.t350.t501.t353.t354.t72, i8.u42.t52.t150.t151.t318.t483.t319.t320.t72, i8.u42.t47.t156.t157.t298.t361.t472.t299.t300.t72, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :25/86/24/135
Computing Next relation with stutter on 109584 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14898503532366500850
[2021-05-09 08:24:23] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14898503532366500850
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/ltsmin14898503532366500850]
Compilation finished in 946 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin14898503532366500850]
Link finished in 64 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) U ([]((LTLAPp0==true))||(LTLAPp1==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin14898503532366500850]
LTSmin run took 9196 ms.
FORMULA BusinessProcesses-PT-19-03 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property BusinessProcesses-PT-19-03 finished in 42921 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((X((p1 U (p2&&(p1||G(p2)))))||p0)))], workingDir=/home/mcc/execution]
Support contains 3 out of 585 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 585/585 places, 506/506 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 582 transition count 503
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 582 transition count 503
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 581 transition count 502
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 581 transition count 502
Applied a total of 8 rules in 39 ms. Remains 581 /585 variables (removed 4) and now considering 502/506 (removed 4) transitions.
// Phase 1: matrix 502 rows 581 cols
[2021-05-09 08:24:33] [INFO ] Computed 117 place invariants in 4 ms
[2021-05-09 08:24:33] [INFO ] Implicit Places using invariants in 234 ms returned []
// Phase 1: matrix 502 rows 581 cols
[2021-05-09 08:24:33] [INFO ] Computed 117 place invariants in 10 ms
[2021-05-09 08:24:34] [INFO ] Implicit Places using invariants and state equation in 666 ms returned []
Implicit Place search using SMT with State Equation took 910 ms to find 0 implicit places.
// Phase 1: matrix 502 rows 581 cols
[2021-05-09 08:24:34] [INFO ] Computed 117 place invariants in 5 ms
[2021-05-09 08:24:34] [INFO ] Dead Transitions using invariants and state equation in 284 ms returned []
Finished structural reductions, in 1 iterations. Remains : 581/585 places, 502/506 transitions.
Stuttering acceptance computed with spot in 112 ms :[(NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), true, (AND (NOT p0) (NOT p2))]
Running random walk in product with property : BusinessProcesses-PT-19-04 automaton TGBA [mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND p2 (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=4, aps=[p2:(OR (EQ s476 0) (EQ s426 1)), p0:(OR (EQ s476 0) (EQ s426 1)), p1:(EQ s188 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 402 ms.
Product exploration explored 100000 steps with 50000 reset in 350 ms.
Graph (complete) has 1298 edges and 581 vertex of which 580 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Knowledge obtained : [p2, p0, (NOT p1)]
Stuttering acceptance computed with spot in 114 ms :[(NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), true, (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 50000 reset in 542 ms.
Product exploration explored 100000 steps with 50000 reset in 483 ms.
Applying partial POR strategy [true, false, true, true, false]
Stuttering acceptance computed with spot in 127 ms :[(NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), true, (AND (NOT p0) (NOT p2))]
Support contains 3 out of 581 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 581/581 places, 502/502 transitions.
Graph (trivial) has 269 edges and 581 vertex of which 6 / 581 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 63 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 63 rules applied. Total rules applied 64 place count 576 transition count 496
Performed 117 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 117 Pre rules applied. Total rules applied 64 place count 576 transition count 752
Deduced a syphon composed of 180 places in 1 ms
Iterating global reduction 1 with 117 rules applied. Total rules applied 181 place count 576 transition count 752
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 203 place count 554 transition count 677
Deduced a syphon composed of 158 places in 1 ms
Iterating global reduction 1 with 22 rules applied. Total rules applied 225 place count 554 transition count 677
Performed 165 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 323 places in 0 ms
Iterating global reduction 1 with 165 rules applied. Total rules applied 390 place count 554 transition count 677
Discarding 43 places :
Symmetric choice reduction at 1 with 43 rule applications. Total rules 433 place count 511 transition count 634
Deduced a syphon composed of 280 places in 0 ms
Iterating global reduction 1 with 43 rules applied. Total rules applied 476 place count 511 transition count 634
Deduced a syphon composed of 280 places in 0 ms
Applied a total of 476 rules in 175 ms. Remains 511 /581 variables (removed 70) and now considering 634/502 (removed -132) transitions.
[2021-05-09 08:24:37] [INFO ] Redundant transitions in 56 ms returned []
// Phase 1: matrix 634 rows 511 cols
[2021-05-09 08:24:37] [INFO ] Computed 117 place invariants in 37 ms
[2021-05-09 08:24:37] [INFO ] Dead Transitions using invariants and state equation in 543 ms returned []
Finished structural reductions, in 1 iterations. Remains : 511/581 places, 634/502 transitions.
Product exploration explored 100000 steps with 50000 reset in 489 ms.
Product exploration explored 100000 steps with 50000 reset in 425 ms.
[2021-05-09 08:24:38] [INFO ] Flatten gal took : 35 ms
[2021-05-09 08:24:38] [INFO ] Flatten gal took : 41 ms
[2021-05-09 08:24:38] [INFO ] Time to serialize gal into /tmp/LTL1774650681005912198.gal : 6 ms
[2021-05-09 08:24:38] [INFO ] Time to serialize properties into /tmp/LTL16428264588644213942.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/LTL1774650681005912198.gal, -t, CGAL, -LTL, /tmp/LTL16428264588644213942.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/LTL1774650681005912198.gal -t CGAL -LTL /tmp/LTL16428264588644213942.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(("((p578==0)||(p509==1))")||(X(("(p215==1)")U(("((p578==0)||(p509==1))")&&(("(p215==1)")||(G("((p578==0)||(p509==1))")))))))))
Formula 0 simplified : !X("((p578==0)||(p509==1))" | X("(p215==1)" U ("((p578==0)||(p509==1))" & ("(p215==1)" | G"((p578==0)||(p509==1))"))))
Detected timeout of ITS tools.
[2021-05-09 08:24:53] [INFO ] Flatten gal took : 18 ms
[2021-05-09 08:24:53] [INFO ] Applying decomposition
[2021-05-09 08:24:53] [INFO ] Flatten gal took : 28 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/graph804181638888114142.txt, -o, /tmp/graph804181638888114142.bin, -w, /tmp/graph804181638888114142.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/graph804181638888114142.bin, -l, -1, -v, -w, /tmp/graph804181638888114142.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 08:24:54] [INFO ] Decomposing Gal with order
[2021-05-09 08:24:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 08:24:54] [INFO ] Removed a total of 287 redundant transitions.
[2021-05-09 08:24:54] [INFO ] Flatten gal took : 118 ms
[2021-05-09 08:24:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 8 ms.
[2021-05-09 08:24:54] [INFO ] Time to serialize gal into /tmp/LTL7504491848712939827.gal : 16 ms
[2021-05-09 08:24:54] [INFO ] Time to serialize properties into /tmp/LTL12000469003226836904.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/LTL7504491848712939827.gal, -t, CGAL, -LTL, /tmp/LTL12000469003226836904.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/LTL7504491848712939827.gal -t CGAL -LTL /tmp/LTL12000469003226836904.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(("((i20.u159.p578==0)||(i19.u146.p509==1))")||(X(("(i13.u60.p215==1)")U(("((i20.u159.p578==0)||(i19.u146.p509==1))")&&(("(i13.u60.p215==1)")||(G("((i20.u159.p578==0)||(i19.u146.p509==1))")))))))))
Formula 0 simplified : !X("((i20.u159.p578==0)||(i19.u146.p509==1))" | X("(i13.u60.p215==1)" U ("((i20.u159.p578==0)||(i19.u146.p509==1))" & ("(i13.u60.p215==1)" | G"((i20.u159.p578==0)||(i19.u146.p509==1))"))))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1429039064816426189
[2021-05-09 08:25:09] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1429039064816426189
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/ltsmin1429039064816426189]
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/ltsmin1429039064816426189] 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/ltsmin1429039064816426189] 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-19-04 finished in 37002 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 585 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 585/585 places, 506/506 transitions.
Graph (trivial) has 276 edges and 585 vertex of which 6 / 585 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 67 transitions
Trivial Post-agglo rules discarded 67 transitions
Performed 67 trivial Post agglomeration. Transition count delta: 67
Iterating post reduction 0 with 67 rules applied. Total rules applied 68 place count 579 transition count 432
Reduce places removed 67 places and 0 transitions.
Iterating post reduction 1 with 67 rules applied. Total rules applied 135 place count 512 transition count 432
Performed 124 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 124 Pre rules applied. Total rules applied 135 place count 512 transition count 308
Deduced a syphon composed of 124 places in 0 ms
Ensure Unique test removed 24 places
Reduce places removed 148 places and 0 transitions.
Iterating global reduction 2 with 272 rules applied. Total rules applied 407 place count 364 transition count 308
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 412 place count 359 transition count 303
Ensure Unique test removed 1 places
Iterating global reduction 2 with 6 rules applied. Total rules applied 418 place count 358 transition count 303
Performed 156 Post agglomeration using F-continuation condition.Transition count delta: 156
Deduced a syphon composed of 156 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 160 places and 0 transitions.
Iterating global reduction 2 with 316 rules applied. Total rules applied 734 place count 198 transition count 147
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 736 place count 197 transition count 150
Applied a total of 736 rules in 50 ms. Remains 197 /585 variables (removed 388) and now considering 150/506 (removed 356) transitions.
// Phase 1: matrix 150 rows 197 cols
[2021-05-09 08:25:10] [INFO ] Computed 88 place invariants in 1 ms
[2021-05-09 08:25:12] [INFO ] Implicit Places using invariants in 1665 ms returned [1, 2, 3, 4, 5, 13, 14, 17, 18, 19, 20, 23, 24, 25, 26, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 149]
Discarding 29 places :
Implicit Place search using SMT only with invariants took 1667 ms to find 29 implicit places.
[2021-05-09 08:25:12] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 150 rows 168 cols
[2021-05-09 08:25:12] [INFO ] Computed 59 place invariants in 1 ms
[2021-05-09 08:25:12] [INFO ] Dead Transitions using invariants and state equation in 127 ms returned []
Starting structural reductions, iteration 1 : 168/585 places, 150/506 transitions.
Applied a total of 0 rules in 6 ms. Remains 168 /168 variables (removed 0) and now considering 150/150 (removed 0) transitions.
[2021-05-09 08:25:12] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 150 rows 168 cols
[2021-05-09 08:25:12] [INFO ] Computed 59 place invariants in 1 ms
[2021-05-09 08:25:12] [INFO ] Dead Transitions using invariants and state equation in 300 ms returned []
Finished structural reductions, in 2 iterations. Remains : 168/585 places, 150/506 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-19-07 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:(AND (NEQ s162 0) (NEQ s8 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-19-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-19-07 finished in 2309 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((X(p0)||G(p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 585 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 585/585 places, 506/506 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 581 transition count 502
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 581 transition count 502
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 579 transition count 500
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 579 transition count 500
Applied a total of 12 rules in 30 ms. Remains 579 /585 variables (removed 6) and now considering 500/506 (removed 6) transitions.
// Phase 1: matrix 500 rows 579 cols
[2021-05-09 08:25:12] [INFO ] Computed 117 place invariants in 3 ms
[2021-05-09 08:25:13] [INFO ] Implicit Places using invariants in 277 ms returned []
// Phase 1: matrix 500 rows 579 cols
[2021-05-09 08:25:13] [INFO ] Computed 117 place invariants in 3 ms
[2021-05-09 08:25:13] [INFO ] Implicit Places using invariants and state equation in 531 ms returned []
Implicit Place search using SMT with State Equation took 833 ms to find 0 implicit places.
// Phase 1: matrix 500 rows 579 cols
[2021-05-09 08:25:13] [INFO ] Computed 117 place invariants in 4 ms
[2021-05-09 08:25:13] [INFO ] Dead Transitions using invariants and state equation in 239 ms returned []
Finished structural reductions, in 1 iterations. Remains : 579/585 places, 500/506 transitions.
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1), true]
Running random walk in product with property : BusinessProcesses-PT-19-11 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 1}, { cond=(AND p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(NEQ s370 1), p0:(OR (NEQ s433 0) (NEQ s528 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 554 reset in 300 ms.
Product exploration explored 100000 steps with 555 reset in 242 ms.
Graph (complete) has 1294 edges and 579 vertex of which 578 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Knowledge obtained : [p1, p0]
Stuttering acceptance computed with spot in 117 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1), true]
Product exploration explored 100000 steps with 550 reset in 305 ms.
Product exploration explored 100000 steps with 554 reset in 332 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 177 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1), true]
Support contains 3 out of 579 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 579/579 places, 500/500 transitions.
Graph (trivial) has 268 edges and 579 vertex of which 6 / 579 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 63 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 63 rules applied. Total rules applied 64 place count 574 transition count 494
Performed 117 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 117 Pre rules applied. Total rules applied 64 place count 574 transition count 750
Deduced a syphon composed of 180 places in 2 ms
Iterating global reduction 1 with 117 rules applied. Total rules applied 181 place count 574 transition count 750
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 203 place count 552 transition count 675
Deduced a syphon composed of 158 places in 2 ms
Iterating global reduction 1 with 22 rules applied. Total rules applied 225 place count 552 transition count 675
Performed 164 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 322 places in 0 ms
Iterating global reduction 1 with 164 rules applied. Total rules applied 389 place count 552 transition count 675
Discarding 43 places :
Symmetric choice reduction at 1 with 43 rule applications. Total rules 432 place count 509 transition count 632
Deduced a syphon composed of 279 places in 1 ms
Iterating global reduction 1 with 43 rules applied. Total rules applied 475 place count 509 transition count 632
Deduced a syphon composed of 279 places in 0 ms
Applied a total of 475 rules in 77 ms. Remains 509 /579 variables (removed 70) and now considering 632/500 (removed -132) transitions.
[2021-05-09 08:25:15] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 632 rows 509 cols
[2021-05-09 08:25:15] [INFO ] Computed 117 place invariants in 9 ms
[2021-05-09 08:25:16] [INFO ] Dead Transitions using invariants and state equation in 688 ms returned []
Finished structural reductions, in 1 iterations. Remains : 509/579 places, 632/500 transitions.
Product exploration explored 100000 steps with 14285 reset in 875 ms.
Product exploration explored 100000 steps with 14285 reset in 706 ms.
[2021-05-09 08:25:18] [INFO ] Flatten gal took : 54 ms
[2021-05-09 08:25:18] [INFO ] Flatten gal took : 53 ms
[2021-05-09 08:25:18] [INFO ] Time to serialize gal into /tmp/LTL11991764790226485206.gal : 4 ms
[2021-05-09 08:25:18] [INFO ] Time to serialize properties into /tmp/LTL3005966920261902143.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/LTL11991764790226485206.gal, -t, CGAL, -LTL, /tmp/LTL3005966920261902143.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/LTL11991764790226485206.gal -t CGAL -LTL /tmp/LTL3005966920261902143.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G((X("((p518!=0)||(p699!=1))"))||(G("(p440!=1)")))))
Formula 0 simplified : !G(X"((p518!=0)||(p699!=1))" | G"(p440!=1)")
Detected timeout of ITS tools.
[2021-05-09 08:25:33] [INFO ] Flatten gal took : 25 ms
[2021-05-09 08:25:33] [INFO ] Applying decomposition
[2021-05-09 08:25:33] [INFO ] Flatten gal took : 31 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/graph13681397768249427956.txt, -o, /tmp/graph13681397768249427956.bin, -w, /tmp/graph13681397768249427956.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/graph13681397768249427956.bin, -l, -1, -v, -w, /tmp/graph13681397768249427956.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 08:25:33] [INFO ] Decomposing Gal with order
[2021-05-09 08:25:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 08:25:33] [INFO ] Removed a total of 290 redundant transitions.
[2021-05-09 08:25:33] [INFO ] Flatten gal took : 67 ms
[2021-05-09 08:25:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 32 ms.
[2021-05-09 08:25:33] [INFO ] Time to serialize gal into /tmp/LTL12437440035423895995.gal : 46 ms
[2021-05-09 08:25:33] [INFO ] Time to serialize properties into /tmp/LTL16374316469982176354.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/LTL12437440035423895995.gal, -t, CGAL, -LTL, /tmp/LTL16374316469982176354.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/LTL12437440035423895995.gal -t CGAL -LTL /tmp/LTL16374316469982176354.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((G((X("((i12.i2.u150.p518!=0)||(i19.u183.p699!=1))"))||(G("(i14.i1.u135.p440!=1)")))))
Formula 0 simplified : !G(X"((i12.i2.u150.p518!=0)||(i19.u183.p699!=1))" | G"(i14.i1.u135.p440!=1)")
Reverse transition relation is NOT exact ! Due to transitions t7, t8, t9, t10, t204, t289, t305, t313, t346, t393, t396, t469, t474, t476, t478, t479, t481, t483, t492, t500, i0.i0.u158.t76, i0.i1.u101.t197, i0.i2.u97.t207, i0.i3.u99.t200, i1.i0.u91.t219, i1.i0.u95.t211, i1.i1.u93.t215, i2.u87.t227, i2.u89.t223, i3.i0.u83.t236, i3.i0.u84.t235, i3.i0.u85.t231, i3.i1.u153.t91, i3.i1.u154.t88, i3.i1.u155.t85, i3.i1.u156.t82, i3.i1.u157.t79, i4.u75.t254, i4.u147.t110, i4.u148.t106, i5.t301, i5.u42.t304, i5.u44.t300, i6.i0.t317, i6.i0.u25.t336, i6.i0.u27.t332, i6.i0.u34.t320, i7.i0.u21.t345, i7.i0.u23.t340, i7.i0.u24.t339, i7.i0.u124.t180, i7.i1.u19.t349, i7.i1.u122.t186, i7.i1.u123.t183, i7.i1.u125.t177, i8.i0.u17.t354, i8.i1.u120.t192, i8.i1.u121.t189, i9.u40.t308, i9.u137.t140, i9.u138.t137, i9.u139.t134, i10.t296, i11.i0.u50.t288, i11.i0.u54.t280, i11.i1.u56.t276, i12.i0.u79.t246, i12.i0.u81.t241, i12.i0.u82.t240, i12.i0.u149.t103, i12.i1.u77.t250, i12.i2.u150.t100, i12.i2.u151.t97, i12.i2.u152.t94, i13.u52.t284, i13.u140.t131, i13.u141.t128, i13.u142.t125, i13.u144.t119, i14.i0.t309, i14.i0.u38.t312, i14.i1.u36.t316, i14.i1.u135.t146, i14.i1.u136.t143, i15.u126.t174, i15.u127.t171, i15.u128.t168, i16.i0.u30.t326, i16.i1.u129.t165, i16.i1.u130.t162, i17.i0.u131.t159, i17.i0.u133.t153, i18.t3, i18.t2, i18.i0.u143.t122, i18.i1.u145.t116, i18.i2.t4, i18.i2.t5, i18.i2.t257, i18.i2.u58.t272, i18.i2.u146.t113, i19.t6, i19.u183.t20, i19.u183.t72, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :36/356/104/496
Computing Next relation with stutter on 109584 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17199628665970517257
[2021-05-09 08:25:48] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17199628665970517257
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/ltsmin17199628665970517257]
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/ltsmin17199628665970517257] 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/ltsmin17199628665970517257] 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-19-11 finished in 36900 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(p0))], workingDir=/home/mcc/execution]
Support contains 2 out of 585 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 585/585 places, 506/506 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 580 transition count 501
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 580 transition count 501
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 578 transition count 499
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 578 transition count 499
Applied a total of 14 rules in 102 ms. Remains 578 /585 variables (removed 7) and now considering 499/506 (removed 7) transitions.
// Phase 1: matrix 499 rows 578 cols
[2021-05-09 08:25:49] [INFO ] Computed 117 place invariants in 5 ms
[2021-05-09 08:25:50] [INFO ] Implicit Places using invariants in 393 ms returned []
// Phase 1: matrix 499 rows 578 cols
[2021-05-09 08:25:50] [INFO ] Computed 117 place invariants in 4 ms
[2021-05-09 08:25:51] [INFO ] Implicit Places using invariants and state equation in 960 ms returned []
Implicit Place search using SMT with State Equation took 1367 ms to find 0 implicit places.
// Phase 1: matrix 499 rows 578 cols
[2021-05-09 08:25:51] [INFO ] Computed 117 place invariants in 4 ms
[2021-05-09 08:25:51] [INFO ] Dead Transitions using invariants and state equation in 265 ms returned []
Finished structural reductions, in 1 iterations. Remains : 578/585 places, 499/506 transitions.
Stuttering acceptance computed with spot in 46 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : BusinessProcesses-PT-19-12 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s192 0) (EQ s199 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 375 ms.
Product exploration explored 100000 steps with 50000 reset in 378 ms.
Graph (complete) has 1293 edges and 578 vertex of which 577 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0), true]
Product exploration explored 100000 steps with 50000 reset in 538 ms.
Product exploration explored 100000 steps with 50000 reset in 420 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0), true]
Support contains 2 out of 578 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 578/578 places, 499/499 transitions.
Graph (trivial) has 267 edges and 578 vertex of which 6 / 578 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 62 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 62 rules applied. Total rules applied 63 place count 573 transition count 493
Performed 118 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 118 Pre rules applied. Total rules applied 63 place count 573 transition count 754
Deduced a syphon composed of 180 places in 1 ms
Iterating global reduction 1 with 118 rules applied. Total rules applied 181 place count 573 transition count 754
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 203 place count 551 transition count 677
Deduced a syphon composed of 158 places in 1 ms
Iterating global reduction 1 with 22 rules applied. Total rules applied 225 place count 551 transition count 677
Performed 164 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 322 places in 0 ms
Iterating global reduction 1 with 164 rules applied. Total rules applied 389 place count 551 transition count 677
Discarding 41 places :
Symmetric choice reduction at 1 with 41 rule applications. Total rules 430 place count 510 transition count 636
Deduced a syphon composed of 281 places in 0 ms
Iterating global reduction 1 with 41 rules applied. Total rules applied 471 place count 510 transition count 636
Deduced a syphon composed of 281 places in 1 ms
Applied a total of 471 rules in 56 ms. Remains 510 /578 variables (removed 68) and now considering 636/499 (removed -137) transitions.
[2021-05-09 08:25:53] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 636 rows 510 cols
[2021-05-09 08:25:53] [INFO ] Computed 117 place invariants in 6 ms
[2021-05-09 08:25:53] [INFO ] Dead Transitions using invariants and state equation in 380 ms returned []
Finished structural reductions, in 1 iterations. Remains : 510/578 places, 636/499 transitions.
Product exploration explored 100000 steps with 50000 reset in 1552 ms.
Product exploration explored 100000 steps with 50000 reset in 1570 ms.
[2021-05-09 08:25:57] [INFO ] Flatten gal took : 12 ms
[2021-05-09 08:25:57] [INFO ] Flatten gal took : 12 ms
[2021-05-09 08:25:57] [INFO ] Time to serialize gal into /tmp/LTL1240112274267060056.gal : 2 ms
[2021-05-09 08:25:57] [INFO ] Time to serialize properties into /tmp/LTL10462159079033347335.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/LTL1240112274267060056.gal, -t, CGAL, -LTL, /tmp/LTL10462159079033347335.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/LTL1240112274267060056.gal -t CGAL -LTL /tmp/LTL10462159079033347335.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X("((p219==0)||(p226==1))")))
Formula 0 simplified : !X"((p219==0)||(p226==1))"
Detected timeout of ITS tools.
[2021-05-09 08:26:12] [INFO ] Flatten gal took : 30 ms
[2021-05-09 08:26:12] [INFO ] Applying decomposition
[2021-05-09 08:26:12] [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/graph15051306893933920086.txt, -o, /tmp/graph15051306893933920086.bin, -w, /tmp/graph15051306893933920086.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/graph15051306893933920086.bin, -l, -1, -v, -w, /tmp/graph15051306893933920086.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 08:26:12] [INFO ] Decomposing Gal with order
[2021-05-09 08:26:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 08:26:12] [INFO ] Removed a total of 286 redundant transitions.
[2021-05-09 08:26:12] [INFO ] Flatten gal took : 69 ms
[2021-05-09 08:26:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 22 ms.
[2021-05-09 08:26:12] [INFO ] Time to serialize gal into /tmp/LTL13472828334416511453.gal : 5 ms
[2021-05-09 08:26:12] [INFO ] Time to serialize properties into /tmp/LTL13709520253545264416.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/LTL13472828334416511453.gal, -t, CGAL, -LTL, /tmp/LTL13709520253545264416.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/LTL13472828334416511453.gal -t CGAL -LTL /tmp/LTL13709520253545264416.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X("((i3.i0.u72.p219==0)||(i3.i0.u74.p226==1))")))
Formula 0 simplified : !X"((i3.i0.u72.p219==0)||(i3.i0.u74.p226==1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13185891685561710388
[2021-05-09 08:26:27] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13185891685561710388
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/ltsmin13185891685561710388]
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/ltsmin13185891685561710388] 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/ltsmin13185891685561710388] 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-19-12 finished in 38927 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(F(p0))||G(p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 585 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 585/585 places, 506/506 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 580 transition count 501
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 580 transition count 501
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 578 transition count 499
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 578 transition count 499
Applied a total of 14 rules in 53 ms. Remains 578 /585 variables (removed 7) and now considering 499/506 (removed 7) transitions.
// Phase 1: matrix 499 rows 578 cols
[2021-05-09 08:26:28] [INFO ] Computed 117 place invariants in 4 ms
[2021-05-09 08:26:29] [INFO ] Implicit Places using invariants in 396 ms returned []
// Phase 1: matrix 499 rows 578 cols
[2021-05-09 08:26:29] [INFO ] Computed 117 place invariants in 3 ms
[2021-05-09 08:26:30] [INFO ] Implicit Places using invariants and state equation in 996 ms returned []
Implicit Place search using SMT with State Equation took 1413 ms to find 0 implicit places.
// Phase 1: matrix 499 rows 578 cols
[2021-05-09 08:26:30] [INFO ] Computed 117 place invariants in 3 ms
[2021-05-09 08:26:30] [INFO ] Dead Transitions using invariants and state equation in 211 ms returned []
Finished structural reductions, in 1 iterations. Remains : 578/585 places, 499/506 transitions.
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-19-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(NEQ s275 1), p0:(AND (NEQ s267 0) (NEQ s485 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 179 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-19-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-19-15 finished in 1859 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin12888728705713043115
[2021-05-09 08:26:30] [INFO ] Computing symmetric may disable matrix : 506 transitions.
[2021-05-09 08:26:30] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-09 08:26:30] [INFO ] Computing symmetric may enable matrix : 506 transitions.
[2021-05-09 08:26:30] [INFO ] Applying decomposition
[2021-05-09 08:26:30] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-09 08:26:30] [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/graph9217068232871744786.txt, -o, /tmp/graph9217068232871744786.bin, -w, /tmp/graph9217068232871744786.weights], workingDir=null]
[2021-05-09 08:26:30] [INFO ] Computing Do-Not-Accords matrix : 506 transitions.
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph9217068232871744786.bin, -l, -1, -v, -w, /tmp/graph9217068232871744786.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 08:26:30] [INFO ] Decomposing Gal with order
[2021-05-09 08:26:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 08:26:30] [INFO ] Computation of Completed DNA matrix. took 21 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-09 08:26:30] [INFO ] Built C files in 119ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12888728705713043115
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/ltsmin12888728705713043115]
[2021-05-09 08:26:30] [INFO ] Removed a total of 289 redundant transitions.
[2021-05-09 08:26:30] [INFO ] Flatten gal took : 52 ms
[2021-05-09 08:26:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 5 ms.
[2021-05-09 08:26:30] [INFO ] Time to serialize gal into /tmp/LTLCardinality5670564677184173133.gal : 4 ms
[2021-05-09 08:26:30] [INFO ] Time to serialize properties into /tmp/LTLCardinality15037001673571831057.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/LTLCardinality5670564677184173133.gal, -t, CGAL, -LTL, /tmp/LTLCardinality15037001673571831057.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/LTLCardinality5670564677184173133.gal -t CGAL -LTL /tmp/LTLCardinality15037001673571831057.ltl -c -stutter-deadlock
Read 3 LTL properties
Checking formula 0 : !((X(("((i0.i2.u162.p578==0)||(i11.i2.u148.p509==1))")||(X((("(i17.i0.u71.p215==1)")||(G("((i0.i2.u162.p578==0)||(i11.i2.u148.p509==1))")))U(("((i0.i2.u162.p578==0)||(i11.i2.u148.p509==1))")&&(("(i17.i0.u71.p215==1)")||(G("((i0.i2.u162.p578==0)||(i11.i2.u148.p509==1))")))))))))
Formula 0 simplified : !X("((i0.i2.u162.p578==0)||(i11.i2.u148.p509==1))" | X(("(i17.i0.u71.p215==1)" | G"((i0.i2.u162.p578==0)||(i11.i2.u148.p509==1))") U ("((i0.i2.u162.p578==0)||(i11.i2.u148.p509==1))" & ("(i17.i0.u71.p215==1)" | G"((i0.i2.u162.p578==0)||(i11.i2.u148.p509==1))"))))
Compilation finished in 2647 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin12888728705713043115]
Link finished in 37 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((X(((LTLAPp1==true) U ((LTLAPp2==true)&&((LTLAPp1==true)||[]((LTLAPp2==true))))))||(LTLAPp0==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin12888728705713043115]
LTSmin run took 3702 ms.
FORMULA BusinessProcesses-PT-19-04 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, []((X((LTLAPp3==true))||[]((LTLAPp4==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin12888728705713043115]
Reverse transition relation is NOT exact ! Due to transitions t7, t8, t9, t10, t349, t477, t521, t574, t647, t652, t654, t656, t659, t662, t671, i0.i0.u101.t336, i0.i1.u99.t339, i0.i2.t6, i0.i2.t152, i0.i2.u187.t42, i0.i2.u187.t167, i1.u97.t352, i2.u89.t368, i2.u91.t364, i3.i0.u53.t442, i3.i0.u55.t438, i3.i0.u57.t434, i3.i1.u51.t446, i4.i0.t529, i4.i0.u17.t527, i4.i1.u120.t329, i4.i1.u121.t325, i4.i1.u122.t321, i5.i0.u23.t515, i5.i0.u24.t514, i5.i1.u123.t317, i5.i1.u124.t313, i6.u31.t498, i7.t483, i7.i0.t487, i7.i0.u28.t504, i7.i0.u35.t492, i7.i2.u37.t486, i8.t447, i8.i0.u45.t466, i8.i1.t462, i9.i0.t386, i9.i0.u84.t382, i9.i1.u152.t201, i9.i1.u153.t197, i9.i1.u154.t193, i10.i0.u81.t390, i10.i0.u83.t384, i10.i0.u85.t380, i10.i0.u87.t372, i10.i1.u158.t177, i10.i1.u159.t173, i10.i2.u155.t189, i10.i2.u156.t185, i10.i2.u157.t181, i11.i0.u78.t396, i11.i1.u80.t391, i11.i1.u147.t217, i11.i1.u150.t209, i11.i1.u151.t205, i11.i2.t214, i11.i2.u149.t215, i12.i0.u142.t237, i12.i0.u144.t229, i12.i1.u140.t245, i12.i1.u141.t241, i13.i0.u133.t277, i13.i0.u135.t265, i13.i1.u130.t289, i13.i1.u131.t285, i14.i0.u19.t524, i14.i0.u21.t520, i14.i1.u26.t510, i14.i2.u125.t309, i14.i2.u126.t305, i15.i0.u93.t360, i15.i0.u95.t356, i15.i1.u127.t301, i15.i1.u128.t297, i15.i1.u129.t293, i16.t471, i16.t467, i16.i0.u43.t470, i16.i1.u39.t482, i16.i2.u41.t474, i16.i2.u138.t253, i16.i2.u139.t249, i16.i3.u136.t261, i16.i3.u137.t257, i17.t5, i17.t2, i17.i0.u145.t225, i17.i1.t3, i17.i1.t4, i17.i1.u59.t411, i17.i1.u59.t430, i17.i1.u143.t233, i17.i1.u146.t221, i18.u74.t404, i18.u76.t400, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :36/361/105/502
Computing Next relation with stutter on 109584 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
12462 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,124.726,1007040,1,0,1.52849e+06,998,7950,3.35495e+06,299,2984,3254635
no accepting run found
Formula 0 is TRUE no accepting run found.
Checking formula 1 : !((G((X(!("((i11.i1.u151.p518==0)&&(i0.i2.u187.p699==1))")))||(G("(i13.i0.u135.p440!=1)")))))
Formula 1 simplified : !G(X!"((i11.i1.u151.p518==0)&&(i0.i2.u187.p699==1))" | G"(i13.i0.u135.p440!=1)")
Computing Next relation with stutter on 109584 deadlock states
WARNING : LTSmin timed out (>514 s) on command CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, []((X((LTLAPp3==true))||[]((LTLAPp4==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin12888728705713043115]
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((LTLAPp5==true)), --buchi-type=spotba], workingDir=/tmp/ltsmin12888728705713043115]
LTSmin run took 1749 ms.
FORMULA BusinessProcesses-PT-19-12 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Retrying LTSmin with larger timeout 4112 s
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, []((X((LTLAPp3==true))||[]((LTLAPp4==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin12888728705713043115]
Detected timeout of ITS tools.
[2021-05-09 08:47:45] [INFO ] Applying decomposition
[2021-05-09 08:47:45] [INFO ] Flatten gal took : 45 ms
[2021-05-09 08:47:45] [INFO ] Decomposing Gal with order
[2021-05-09 08:47:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 08:47:45] [INFO ] Removed a total of 144 redundant transitions.
[2021-05-09 08:47:45] [INFO ] Flatten gal took : 97 ms
[2021-05-09 08:47:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 120 labels/synchronizations in 787 ms.
[2021-05-09 08:47:46] [INFO ] Time to serialize gal into /tmp/LTLCardinality12722824112316439466.gal : 23 ms
[2021-05-09 08:47:46] [INFO ] Time to serialize properties into /tmp/LTLCardinality5819111833370007253.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/LTLCardinality12722824112316439466.gal, -t, CGAL, -LTL, /tmp/LTLCardinality5819111833370007253.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/LTLCardinality12722824112316439466.gal -t CGAL -LTL /tmp/LTLCardinality5819111833370007253.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((G((X(!("((i0.i1.i0.i0.i0.i0.i0.i0.i0.i0.u159.p518==0)&&(i1.u182.p699==1))")))||(G("(i0.i1.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u144.p440!=1)")))))
Formula 0 simplified : !G(X!"((i0.i1.i0.i0.i0.i0.i0.i0.i0.i0.u159.p518==0)&&(i1.u182.p699==1))" | G"(i0.i1.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u144.p440!=1)")
Detected timeout of ITS tools.
[2021-05-09 09:09:02] [INFO ] Flatten gal took : 343 ms
[2021-05-09 09:09:05] [INFO ] Input system was already deterministic with 506 transitions.
[2021-05-09 09:09:05] [INFO ] Transformed 585 places.
[2021-05-09 09:09:05] [INFO ] Transformed 506 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 09:09:36] [INFO ] Time to serialize gal into /tmp/LTLCardinality3286240673548738319.gal : 19 ms
[2021-05-09 09:09:36] [INFO ] Time to serialize properties into /tmp/LTLCardinality6298207091985504439.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/LTLCardinality3286240673548738319.gal, -t, CGAL, -LTL, /tmp/LTLCardinality6298207091985504439.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/LTLCardinality3286240673548738319.gal -t CGAL -LTL /tmp/LTLCardinality6298207091985504439.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 : !((G((X(!("((p518==0)&&(p699==1))")))||(G("(p440!=1)")))))
Formula 0 simplified : !G(X!"((p518==0)&&(p699==1))" | G"(p440!=1)")
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 6/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.010: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.010: LTL layer: formula: []((X((LTLAPp3==true))||[]((LTLAPp4==true))))
pins2lts-mc-linux64( 6/ 8), 0.010: "[]((X((LTLAPp3==true))||[]((LTLAPp4==true))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 6/ 8), 0.010: Using Spin LTL semantics
pins2lts-mc-linux64( 3/ 8), 0.015: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.015: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.015: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.015: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.015: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.015: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.015: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.015: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.015: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.012: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.013: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.018: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.018: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.039: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.042: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.223: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.704: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.758: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.760: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.763: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.764: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.760: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.768: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 1.680: DFS-FIFO for weak LTL, using special progress label 513
pins2lts-mc-linux64( 0/ 8), 1.680: There are 514 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 1.680: State length is 586, there are 518 groups
pins2lts-mc-linux64( 0/ 8), 1.680: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 1.680: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 1.680: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 1.680: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 2/ 8), 2.815: ~1 levels ~960 states ~4624 transitions
pins2lts-mc-linux64( 0/ 8), 2.842: ~1 levels ~1920 states ~13080 transitions
pins2lts-mc-linux64( 2/ 8), 2.911: ~1 levels ~3840 states ~21640 transitions
pins2lts-mc-linux64( 6/ 8), 2.990: ~1 levels ~7680 states ~57560 transitions
pins2lts-mc-linux64( 6/ 8), 3.188: ~1 levels ~15360 states ~127472 transitions
pins2lts-mc-linux64( 6/ 8), 3.654: ~1 levels ~30720 states ~263736 transitions
pins2lts-mc-linux64( 6/ 8), 4.556: ~1 levels ~61440 states ~582912 transitions
pins2lts-mc-linux64( 6/ 8), 6.184: ~1 levels ~122880 states ~1180008 transitions
pins2lts-mc-linux64( 6/ 8), 9.562: ~1 levels ~245760 states ~2509760 transitions
pins2lts-mc-linux64( 6/ 8), 15.646: ~1 levels ~491520 states ~5408168 transitions
pins2lts-mc-linux64( 2/ 8), 31.219: ~1 levels ~983040 states ~10453928 transitions
pins2lts-mc-linux64( 0/ 8), 67.795: ~1 levels ~1966080 states ~24088952 transitions
pins2lts-mc-linux64( 2/ 8), 131.558: ~1 levels ~3932160 states ~45806632 transitions
pins2lts-mc-linux64( 7/ 8), 254.160: ~1 levels ~7864320 states ~94040568 transitions
pins2lts-mc-linux64( 4/ 8), 504.553: ~1 levels ~15728640 states ~209479728 transitions
pins2lts-mc-linux64( 1/ 8), 986.175: ~1 levels ~31457280 states ~432801664 transitions
pins2lts-mc-linux64( 7/ 8), 1880.220: ~1 levels ~62914560 states ~848697328 transitions
pins2lts-mc-linux64( 6/ 8), 2195.047: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 2195.087:
pins2lts-mc-linux64( 0/ 8), 2195.098: mean standard work distribution: 3.6% (states) 2.6% (transitions)
pins2lts-mc-linux64( 0/ 8), 2195.099:
pins2lts-mc-linux64( 0/ 8), 2195.099: Explored 67730249 states 1015210338 transitions, fanout: 14.989
pins2lts-mc-linux64( 0/ 8), 2195.099: Total exploration time 2193.370 sec (2193.340 sec minimum, 2193.358 sec on average)
pins2lts-mc-linux64( 0/ 8), 2195.099: States per second: 30880, Transitions per second: 462854
pins2lts-mc-linux64( 0/ 8), 2195.099:
pins2lts-mc-linux64( 0/ 8), 2195.099: Progress states detected: 134216583
pins2lts-mc-linux64( 0/ 8), 2195.099: Redundant explorations: -49.5367
pins2lts-mc-linux64( 0/ 8), 2195.099:
pins2lts-mc-linux64( 0/ 8), 2195.099: Queue width: 8B, total height: 110226922, memory: 840.96MB
pins2lts-mc-linux64( 0/ 8), 2195.099: Tree memory: 1047.6MB, 8.2 B/state, compr.: 0.3%
pins2lts-mc-linux64( 0/ 8), 2195.099: Tree fill ratio (roots/leafs): 99.0%/9.0%
pins2lts-mc-linux64( 0/ 8), 2195.100: Stored 510 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 2195.105: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 2195.105: Est. total memory use: 1888.6MB (~1865.0MB 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((LTLAPp3==true))||[]((LTLAPp4==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin12888728705713043115]
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((LTLAPp3==true))||[]((LTLAPp4==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin12888728705713043115]
255
at fr.lip6.move.gal.application.LTSminRunner.checkProperty(LTSminRunner.java:214)
at fr.lip6.move.gal.application.LTSminRunner.access$10(LTSminRunner.java:165)
at fr.lip6.move.gal.application.LTSminRunner$1.checkProperties(LTSminRunner.java:154)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:102)
at java.base/java.lang.Thread.run(Thread.java:834)

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
+ [[ 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-19"
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-19, 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-162038143900468"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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