fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r121-tall-162075406900387
Last Updated
Jun 28, 2021

About the Execution of ITS-Tools for JoinFreeModules-PT-0003

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
276.472 33923.00 42651.00 160.50 5 4 5 3 1 3 3 5 4 4 3 3 5 4 3 5 normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r121-tall-162075406900387.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/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 JoinFreeModules-PT-0003, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r121-tall-162075406900387
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 396K
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 134K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.4K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 90K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.3K Mar 28 16:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 28 16:17 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 26 06:42 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 26 06:42 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 24 10:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 24 10:40 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 5 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 18K 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 positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME JoinFreeModules-PT-0003-UpperBounds-00
FORMULA_NAME JoinFreeModules-PT-0003-UpperBounds-01
FORMULA_NAME JoinFreeModules-PT-0003-UpperBounds-02
FORMULA_NAME JoinFreeModules-PT-0003-UpperBounds-03
FORMULA_NAME JoinFreeModules-PT-0003-UpperBounds-04
FORMULA_NAME JoinFreeModules-PT-0003-UpperBounds-05
FORMULA_NAME JoinFreeModules-PT-0003-UpperBounds-06
FORMULA_NAME JoinFreeModules-PT-0003-UpperBounds-07
FORMULA_NAME JoinFreeModules-PT-0003-UpperBounds-08
FORMULA_NAME JoinFreeModules-PT-0003-UpperBounds-09
FORMULA_NAME JoinFreeModules-PT-0003-UpperBounds-10
FORMULA_NAME JoinFreeModules-PT-0003-UpperBounds-11
FORMULA_NAME JoinFreeModules-PT-0003-UpperBounds-12
FORMULA_NAME JoinFreeModules-PT-0003-UpperBounds-13
FORMULA_NAME JoinFreeModules-PT-0003-UpperBounds-14
FORMULA_NAME JoinFreeModules-PT-0003-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1620840957124

Running Version 0
[2021-05-12 17:35:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -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-12 17:35:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-12 17:35:58] [INFO ] Load time of PNML (sax parser for PT used): 27 ms
[2021-05-12 17:35:58] [INFO ] Transformed 16 places.
[2021-05-12 17:35:58] [INFO ] Transformed 25 transitions.
[2021-05-12 17:35:58] [INFO ] Parsed PT model containing 16 places and 25 transitions in 62 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Reduce places removed 1 places and 0 transitions.
FORMULA JoinFreeModules-PT-0003-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 25 rows 15 cols
[2021-05-12 17:35:58] [INFO ] Computed 3 place invariants in 4 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 15) seen :59
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 15) seen :50
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 15) seen :46
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 15) seen :55
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 15) seen :46
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 15) seen :56
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 15) seen :56
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 15) seen :47
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 15) seen :52
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 15) seen :52
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 15) seen :43
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 15) seen :56
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 15) seen :55
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 15) seen :53
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 15) seen :46
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 15) seen :57
// Phase 1: matrix 25 rows 15 cols
[2021-05-12 17:35:58] [INFO ] Computed 3 place invariants in 3 ms
[2021-05-12 17:35:58] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2021-05-12 17:35:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 17:35:58] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2021-05-12 17:35:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 17:35:59] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-12 17:35:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 17:35:59] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2021-05-12 17:35:59] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2021-05-12 17:35:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 38 ms
[2021-05-12 17:35:59] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-12 17:35:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 17:35:59] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2021-05-12 17:35:59] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 17:35:59] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-12 17:35:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 17:35:59] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2021-05-12 17:35:59] [INFO ] Computed and/alt/rep : 18/45/18 causal constraints (skipped 0 transitions) in 3 ms.
[2021-05-12 17:35:59] [INFO ] Added : 12 causal constraints over 3 iterations in 36 ms. Result :sat
Minimization took 9 ms.
[2021-05-12 17:35:59] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2021-05-12 17:35:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 17:35:59] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2021-05-12 17:35:59] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 17:35:59] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2021-05-12 17:35:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 17:35:59] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2021-05-12 17:35:59] [INFO ] Computed and/alt/rep : 18/45/18 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-12 17:35:59] [INFO ] Added : 7 causal constraints over 2 iterations in 13 ms. Result :sat
Minimization took 8 ms.
[2021-05-12 17:35:59] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-12 17:35:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 17:35:59] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2021-05-12 17:35:59] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 17:35:59] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-12 17:35:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 17:35:59] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2021-05-12 17:35:59] [INFO ] Computed and/alt/rep : 18/45/18 causal constraints (skipped 0 transitions) in 7 ms.
[2021-05-12 17:35:59] [INFO ] Deduced a trap composed of 3 places in 9 ms of which 1 ms to minimize.
[2021-05-12 17:35:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 13 ms
[2021-05-12 17:35:59] [INFO ] Added : 18 causal constraints over 4 iterations in 47 ms. Result :sat
Minimization took 10 ms.
[2021-05-12 17:35:59] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-12 17:35:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 17:35:59] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2021-05-12 17:35:59] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 17:35:59] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-12 17:35:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 17:35:59] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2021-05-12 17:35:59] [INFO ] Computed and/alt/rep : 18/45/18 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-12 17:35:59] [INFO ] Added : 6 causal constraints over 2 iterations in 9 ms. Result :sat
Minimization took 8 ms.
[2021-05-12 17:35:59] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-12 17:35:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 17:35:59] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2021-05-12 17:35:59] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 17:35:59] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-12 17:35:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 17:35:59] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2021-05-12 17:35:59] [INFO ] Computed and/alt/rep : 18/45/18 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-12 17:35:59] [INFO ] Added : 6 causal constraints over 2 iterations in 8 ms. Result :sat
Minimization took 7 ms.
[2021-05-12 17:35:59] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-12 17:35:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 17:35:59] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2021-05-12 17:35:59] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 17:35:59] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-12 17:35:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 17:35:59] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2021-05-12 17:35:59] [INFO ] Deduced a trap composed of 3 places in 7 ms of which 1 ms to minimize.
[2021-05-12 17:35:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 9 ms
[2021-05-12 17:35:59] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-12 17:35:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 17:35:59] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-05-12 17:35:59] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 17:35:59] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-12 17:35:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 17:35:59] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2021-05-12 17:35:59] [INFO ] Computed and/alt/rep : 18/45/18 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-12 17:35:59] [INFO ] Added : 12 causal constraints over 3 iterations in 15 ms. Result :sat
Minimization took 7 ms.
[2021-05-12 17:35:59] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2021-05-12 17:35:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 17:35:59] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2021-05-12 17:35:59] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 17:35:59] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2021-05-12 17:35:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 17:35:59] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2021-05-12 17:35:59] [INFO ] Computed and/alt/rep : 18/45/18 causal constraints (skipped 0 transitions) in 3 ms.
[2021-05-12 17:35:59] [INFO ] Added : 12 causal constraints over 3 iterations in 16 ms. Result :sat
Minimization took 8 ms.
[2021-05-12 17:35:59] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-12 17:35:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 17:35:59] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-05-12 17:35:59] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 17:35:59] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2021-05-12 17:35:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 17:35:59] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2021-05-12 17:35:59] [INFO ] Computed and/alt/rep : 18/45/18 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-12 17:35:59] [INFO ] Deduced a trap composed of 3 places in 6 ms of which 2 ms to minimize.
[2021-05-12 17:35:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 9 ms
[2021-05-12 17:35:59] [INFO ] Added : 12 causal constraints over 3 iterations in 21 ms. Result :sat
Minimization took 13 ms.
[2021-05-12 17:35:59] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2021-05-12 17:35:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 17:35:59] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-05-12 17:35:59] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 17:35:59] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2021-05-12 17:35:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 17:35:59] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2021-05-12 17:35:59] [INFO ] Computed and/alt/rep : 18/45/18 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-12 17:35:59] [INFO ] Added : 6 causal constraints over 2 iterations in 8 ms. Result :sat
Minimization took 8 ms.
[2021-05-12 17:35:59] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-12 17:35:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 17:35:59] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2021-05-12 17:35:59] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 17:35:59] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-12 17:35:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 17:35:59] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2021-05-12 17:35:59] [INFO ] Computed and/alt/rep : 18/45/18 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-12 17:35:59] [INFO ] Added : 7 causal constraints over 2 iterations in 10 ms. Result :sat
Minimization took 8 ms.
[2021-05-12 17:35:59] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-12 17:35:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 17:35:59] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-05-12 17:35:59] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 17:35:59] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-12 17:35:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 17:35:59] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2021-05-12 17:35:59] [INFO ] Computed and/alt/rep : 18/45/18 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-12 17:35:59] [INFO ] Deduced a trap composed of 3 places in 6 ms of which 1 ms to minimize.
[2021-05-12 17:35:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 21 ms
[2021-05-12 17:35:59] [INFO ] Added : 18 causal constraints over 5 iterations in 62 ms. Result :sat
Minimization took 7 ms.
[2021-05-12 17:35:59] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-12 17:35:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 17:35:59] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-05-12 17:35:59] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 17:35:59] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-12 17:35:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 17:35:59] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2021-05-12 17:35:59] [INFO ] Computed and/alt/rep : 18/45/18 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-12 17:36:00] [INFO ] Deduced a trap composed of 3 places in 6 ms of which 1 ms to minimize.
[2021-05-12 17:36:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 10 ms
[2021-05-12 17:36:00] [INFO ] Added : 18 causal constraints over 4 iterations in 41 ms. Result :sat
Minimization took 9 ms.
[2021-05-12 17:36:00] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2021-05-12 17:36:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 17:36:00] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2021-05-12 17:36:00] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 17:36:00] [INFO ] [Nat]Absence check using 3 positive place invariants in 7 ms returned sat
[2021-05-12 17:36:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 17:36:00] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2021-05-12 17:36:00] [INFO ] Deduced a trap composed of 3 places in 5 ms of which 1 ms to minimize.
[2021-05-12 17:36:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 7 ms
Current structural bounds on expressions (after SMT) : [5, 6, 6, 6, 6, 6, 5, 6, 6, 6, 6, 6, 6, 6, 5] Max seen :[5, 4, 5, 3, 3, 3, 5, 4, 4, 3, 3, 5, 4, 3, 5]
FORMULA JoinFreeModules-PT-0003-UpperBounds-15 5 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA JoinFreeModules-PT-0003-UpperBounds-07 5 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA JoinFreeModules-PT-0003-UpperBounds-00 5 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Incomplete Parikh walk after 3600 steps, including 140 resets, run finished after 14 ms. (steps per millisecond=257 ) properties (out of 12) seen :40 could not realise parikh vector
Incomplete Parikh walk after 11000 steps, including 486 resets, run finished after 41 ms. (steps per millisecond=268 ) properties (out of 12) seen :44 could not realise parikh vector
Incomplete Parikh walk after 13400 steps, including 334 resets, run finished after 42 ms. (steps per millisecond=319 ) properties (out of 12) seen :34 could not realise parikh vector
Incomplete Parikh walk after 1700 steps, including 128 resets, run finished after 5 ms. (steps per millisecond=340 ) properties (out of 12) seen :21 could not realise parikh vector
Incomplete Parikh walk after 2800 steps, including 138 resets, run finished after 9 ms. (steps per millisecond=311 ) properties (out of 12) seen :36 could not realise parikh vector
Incomplete Parikh walk after 2400 steps, including 111 resets, run finished after 6 ms. (steps per millisecond=400 ) properties (out of 12) seen :31 could not realise parikh vector
Incomplete Parikh walk after 2400 steps, including 110 resets, run finished after 6 ms. (steps per millisecond=400 ) properties (out of 12) seen :31 could not realise parikh vector
Incomplete Parikh walk after 1700 steps, including 128 resets, run finished after 5 ms. (steps per millisecond=340 ) properties (out of 12) seen :21 could not realise parikh vector
Incomplete Parikh walk after 1700 steps, including 129 resets, run finished after 4 ms. (steps per millisecond=425 ) properties (out of 12) seen :21 could not realise parikh vector
Incomplete Parikh walk after 3600 steps, including 139 resets, run finished after 11 ms. (steps per millisecond=327 ) properties (out of 12) seen :40 could not realise parikh vector
Incomplete Parikh walk after 13400 steps, including 338 resets, run finished after 41 ms. (steps per millisecond=326 ) properties (out of 12) seen :34 could not realise parikh vector
Incomplete Parikh walk after 2400 steps, including 114 resets, run finished after 9 ms. (steps per millisecond=266 ) properties (out of 12) seen :34 could not realise parikh vector
Support contains 7 out of 15 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 15/15 places, 25/25 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 15 transition count 24
Applied a total of 1 rules in 10 ms. Remains 15 /15 variables (removed 0) and now considering 24/25 (removed 1) transitions.
// Phase 1: matrix 24 rows 15 cols
[2021-05-12 17:36:00] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-12 17:36:00] [INFO ] Dead Transitions using invariants and state equation in 31 ms returned []
Finished structural reductions, in 1 iterations. Remains : 15/15 places, 24/25 transitions.
// Phase 1: matrix 24 rows 15 cols
[2021-05-12 17:36:00] [INFO ] Computed 3 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1774 ms. (steps per millisecond=563 ) properties (out of 12) seen :44
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 473 ms. (steps per millisecond=2114 ) properties (out of 12) seen :34
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 476 ms. (steps per millisecond=2100 ) properties (out of 12) seen :42
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 446 ms. (steps per millisecond=2242 ) properties (out of 12) seen :34
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 443 ms. (steps per millisecond=2257 ) properties (out of 12) seen :44
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 443 ms. (steps per millisecond=2257 ) properties (out of 12) seen :44
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 468 ms. (steps per millisecond=2136 ) properties (out of 12) seen :40
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 475 ms. (steps per millisecond=2105 ) properties (out of 12) seen :40
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 448 ms. (steps per millisecond=2232 ) properties (out of 12) seen :31
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 443 ms. (steps per millisecond=2257 ) properties (out of 12) seen :44
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 479 ms. (steps per millisecond=2087 ) properties (out of 12) seen :42
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 460 ms. (steps per millisecond=2173 ) properties (out of 12) seen :40
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 446 ms. (steps per millisecond=2242 ) properties (out of 12) seen :34
// Phase 1: matrix 24 rows 15 cols
[2021-05-12 17:36:07] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-12 17:36:07] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2021-05-12 17:36:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 17:36:07] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-05-12 17:36:07] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 17:36:07] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2021-05-12 17:36:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 17:36:07] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2021-05-12 17:36:07] [INFO ] Computed and/alt/rep : 18/45/18 causal constraints (skipped 0 transitions) in 3 ms.
[2021-05-12 17:36:07] [INFO ] Deduced a trap composed of 3 places in 6 ms of which 0 ms to minimize.
[2021-05-12 17:36:07] [INFO ] Deduced a trap composed of 3 places in 6 ms of which 0 ms to minimize.
[2021-05-12 17:36:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 21 ms
[2021-05-12 17:36:07] [INFO ] Added : 18 causal constraints over 4 iterations in 90 ms. Result :sat
Minimization took 8 ms.
[2021-05-12 17:36:07] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-12 17:36:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 17:36:07] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-05-12 17:36:07] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 17:36:07] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2021-05-12 17:36:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 17:36:07] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2021-05-12 17:36:07] [INFO ] Computed and/alt/rep : 18/45/18 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-12 17:36:07] [INFO ] Added : 7 causal constraints over 2 iterations in 10 ms. Result :sat
Minimization took 8 ms.
[2021-05-12 17:36:07] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-12 17:36:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 17:36:07] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-05-12 17:36:07] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 17:36:07] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-12 17:36:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 17:36:07] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2021-05-12 17:36:07] [INFO ] Deduced a trap composed of 3 places in 5 ms of which 0 ms to minimize.
[2021-05-12 17:36:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 7 ms
[2021-05-12 17:36:07] [INFO ] Computed and/alt/rep : 18/45/18 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-12 17:36:07] [INFO ] Added : 11 causal constraints over 3 iterations in 62 ms. Result :sat
Minimization took 10 ms.
[2021-05-12 17:36:07] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-12 17:36:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 17:36:07] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2021-05-12 17:36:07] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 17:36:07] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2021-05-12 17:36:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 17:36:07] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2021-05-12 17:36:07] [INFO ] Computed and/alt/rep : 18/45/18 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-12 17:36:07] [INFO ] Deduced a trap composed of 3 places in 5 ms of which 1 ms to minimize.
[2021-05-12 17:36:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 8 ms
[2021-05-12 17:36:07] [INFO ] Added : 10 causal constraints over 3 iterations in 22 ms. Result :sat
Minimization took 15 ms.
[2021-05-12 17:36:07] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-12 17:36:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 17:36:07] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-05-12 17:36:07] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 17:36:08] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-12 17:36:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 17:36:08] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2021-05-12 17:36:08] [INFO ] Computed and/alt/rep : 18/45/18 causal constraints (skipped 0 transitions) in 4 ms.
[2021-05-12 17:36:08] [INFO ] Deduced a trap composed of 3 places in 5 ms of which 1 ms to minimize.
[2021-05-12 17:36:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 8 ms
[2021-05-12 17:36:08] [INFO ] Added : 10 causal constraints over 3 iterations in 25 ms. Result :sat
Minimization took 15 ms.
[2021-05-12 17:36:08] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-12 17:36:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 17:36:08] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2021-05-12 17:36:08] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 17:36:08] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-12 17:36:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 17:36:08] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2021-05-12 17:36:08] [INFO ] Computed and/alt/rep : 18/45/18 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-12 17:36:08] [INFO ] Deduced a trap composed of 3 places in 6 ms of which 1 ms to minimize.
[2021-05-12 17:36:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 10 ms
[2021-05-12 17:36:08] [INFO ] Added : 12 causal constraints over 3 iterations in 23 ms. Result :sat
Minimization took 8 ms.
[2021-05-12 17:36:08] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-12 17:36:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 17:36:08] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-05-12 17:36:08] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 17:36:08] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-12 17:36:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 17:36:08] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2021-05-12 17:36:08] [INFO ] Computed and/alt/rep : 18/45/18 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-12 17:36:08] [INFO ] Deduced a trap composed of 3 places in 6 ms of which 0 ms to minimize.
[2021-05-12 17:36:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 9 ms
[2021-05-12 17:36:08] [INFO ] Added : 12 causal constraints over 3 iterations in 23 ms. Result :sat
Minimization took 8 ms.
[2021-05-12 17:36:08] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-12 17:36:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 17:36:08] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-05-12 17:36:08] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 17:36:08] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-12 17:36:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 17:36:08] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2021-05-12 17:36:08] [INFO ] Deduced a trap composed of 3 places in 4 ms of which 0 ms to minimize.
[2021-05-12 17:36:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 7 ms
[2021-05-12 17:36:08] [INFO ] Computed and/alt/rep : 18/45/18 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-12 17:36:08] [INFO ] Deduced a trap composed of 3 places in 5 ms of which 0 ms to minimize.
[2021-05-12 17:36:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 7 ms
[2021-05-12 17:36:08] [INFO ] Added : 18 causal constraints over 4 iterations in 32 ms. Result :sat
Minimization took 11 ms.
[2021-05-12 17:36:08] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2021-05-12 17:36:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 17:36:08] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-05-12 17:36:08] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 17:36:08] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-12 17:36:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 17:36:08] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2021-05-12 17:36:08] [INFO ] Computed and/alt/rep : 18/45/18 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-12 17:36:08] [INFO ] Deduced a trap composed of 3 places in 5 ms of which 0 ms to minimize.
[2021-05-12 17:36:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 7 ms
[2021-05-12 17:36:08] [INFO ] Added : 10 causal constraints over 3 iterations in 21 ms. Result :sat
Minimization took 15 ms.
[2021-05-12 17:36:08] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-12 17:36:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 17:36:08] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2021-05-12 17:36:08] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 17:36:08] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2021-05-12 17:36:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 17:36:08] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2021-05-12 17:36:08] [INFO ] Computed and/alt/rep : 18/45/18 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-12 17:36:08] [INFO ] Added : 7 causal constraints over 2 iterations in 9 ms. Result :sat
Minimization took 8 ms.
[2021-05-12 17:36:08] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-12 17:36:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 17:36:08] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2021-05-12 17:36:08] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 17:36:08] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-12 17:36:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 17:36:08] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2021-05-12 17:36:08] [INFO ] Deduced a trap composed of 3 places in 5 ms of which 0 ms to minimize.
[2021-05-12 17:36:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 10 ms
[2021-05-12 17:36:08] [INFO ] Computed and/alt/rep : 18/45/18 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-12 17:36:08] [INFO ] Deduced a trap composed of 3 places in 4 ms of which 0 ms to minimize.
[2021-05-12 17:36:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 8 ms
[2021-05-12 17:36:08] [INFO ] Added : 17 causal constraints over 4 iterations in 22 ms. Result :sat
Minimization took 13 ms.
[2021-05-12 17:36:08] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2021-05-12 17:36:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 17:36:08] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2021-05-12 17:36:08] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 17:36:08] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-12 17:36:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 17:36:08] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2021-05-12 17:36:08] [INFO ] Deduced a trap composed of 3 places in 6 ms of which 0 ms to minimize.
[2021-05-12 17:36:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 8 ms
[2021-05-12 17:36:08] [INFO ] Computed and/alt/rep : 18/45/18 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-12 17:36:08] [INFO ] Added : 11 causal constraints over 3 iterations in 55 ms. Result :sat
Minimization took 10 ms.
Current structural bounds on expressions (after SMT) : [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6] Max seen :[4, 5, 3, 3, 3, 4, 4, 3, 3, 5, 4, 3]
Incomplete Parikh walk after 2600 steps, including 158 resets, run finished after 6 ms. (steps per millisecond=433 ) properties (out of 12) seen :27 could not realise parikh vector
Incomplete Parikh walk after 4900 steps, including 167 resets, run finished after 14 ms. (steps per millisecond=350 ) properties (out of 12) seen :40 could not realise parikh vector
Incomplete Parikh walk after 25600 steps, including 526 resets, run finished after 44 ms. (steps per millisecond=581 ) properties (out of 12) seen :34 could not realise parikh vector
Incomplete Parikh walk after 4900 steps, including 123 resets, run finished after 11 ms. (steps per millisecond=445 ) properties (out of 12) seen :34 could not realise parikh vector
Incomplete Parikh walk after 3200 steps, including 144 resets, run finished after 8 ms. (steps per millisecond=400 ) properties (out of 12) seen :39 could not realise parikh vector
Incomplete Parikh walk after 2500 steps, including 117 resets, run finished after 5 ms. (steps per millisecond=500 ) properties (out of 12) seen :31 could not realise parikh vector
Incomplete Parikh walk after 2500 steps, including 116 resets, run finished after 5 ms. (steps per millisecond=500 ) properties (out of 12) seen :31 could not realise parikh vector
Incomplete Parikh walk after 4900 steps, including 123 resets, run finished after 12 ms. (steps per millisecond=408 ) properties (out of 12) seen :34 could not realise parikh vector
Incomplete Parikh walk after 4900 steps, including 123 resets, run finished after 12 ms. (steps per millisecond=408 ) properties (out of 12) seen :34 could not realise parikh vector
Incomplete Parikh walk after 2600 steps, including 160 resets, run finished after 6 ms. (steps per millisecond=433 ) properties (out of 12) seen :27 could not realise parikh vector
Incomplete Parikh walk after 25600 steps, including 529 resets, run finished after 47 ms. (steps per millisecond=544 ) properties (out of 12) seen :34 could not realise parikh vector
Incomplete Parikh walk after 5600 steps, including 150 resets, run finished after 13 ms. (steps per millisecond=430 ) properties (out of 12) seen :44 could not realise parikh vector
Support contains 7 out of 15 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 15/15 places, 24/24 transitions.
Applied a total of 0 rules in 1 ms. Remains 15 /15 variables (removed 0) and now considering 24/24 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 15/15 places, 24/24 transitions.
Starting structural reductions, iteration 0 : 15/15 places, 24/24 transitions.
Applied a total of 0 rules in 1 ms. Remains 15 /15 variables (removed 0) and now considering 24/24 (removed 0) transitions.
// Phase 1: matrix 24 rows 15 cols
[2021-05-12 17:36:08] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-12 17:36:08] [INFO ] Implicit Places using invariants in 7 ms returned []
// Phase 1: matrix 24 rows 15 cols
[2021-05-12 17:36:08] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-12 17:36:08] [INFO ] Implicit Places using invariants and state equation in 13 ms returned []
Implicit Place search using SMT with State Equation took 20 ms to find 0 implicit places.
[2021-05-12 17:36:08] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 24 rows 15 cols
[2021-05-12 17:36:08] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-12 17:36:08] [INFO ] Dead Transitions using invariants and state equation in 24 ms returned []
Finished structural reductions, in 1 iterations. Remains : 15/15 places, 24/24 transitions.
Starting property specific reduction for JoinFreeModules-PT-0003-UpperBounds-01
// Phase 1: matrix 24 rows 15 cols
[2021-05-12 17:36:08] [INFO ] Computed 3 place invariants in 1 ms
Incomplete random walk after 10002 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :4
// Phase 1: matrix 24 rows 15 cols
[2021-05-12 17:36:08] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-12 17:36:08] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-12 17:36:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 17:36:08] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-05-12 17:36:08] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 17:36:08] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2021-05-12 17:36:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 17:36:08] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2021-05-12 17:36:08] [INFO ] Computed and/alt/rep : 18/45/18 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-12 17:36:08] [INFO ] Deduced a trap composed of 3 places in 7 ms of which 0 ms to minimize.
[2021-05-12 17:36:08] [INFO ] Deduced a trap composed of 3 places in 5 ms of which 1 ms to minimize.
[2021-05-12 17:36:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 27 ms
[2021-05-12 17:36:08] [INFO ] Added : 18 causal constraints over 4 iterations in 89 ms. Result :sat
Minimization took 8 ms.
Current structural bounds on expressions (after SMT) : [6] Max seen :[4]
Incomplete Parikh walk after 5600 steps, including 150 resets, run finished after 11 ms. (steps per millisecond=509 ) properties (out of 1) seen :4 could not realise parikh vector
Support contains 1 out of 15 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 15/15 places, 24/24 transitions.
Graph (complete) has 36 edges and 15 vertex of which 5 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.3 ms
Discarding 10 places :
Also discarding 16 output transitions
Drop transitions removed 16 transitions
Applied a total of 1 rules in 5 ms. Remains 5 /15 variables (removed 10) and now considering 8/24 (removed 16) transitions.
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:36:08] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 17:36:08] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/15 places, 8/24 transitions.
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:36:08] [INFO ] Computed 1 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1241 ms. (steps per millisecond=805 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 544 ms. (steps per millisecond=1838 ) properties (out of 1) seen :4
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:36:10] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 17:36:10] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2021-05-12 17:36:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 17:36:10] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2021-05-12 17:36:10] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 17:36:10] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2021-05-12 17:36:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 17:36:10] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2021-05-12 17:36:10] [INFO ] Deduced a trap composed of 3 places in 5 ms of which 1 ms to minimize.
[2021-05-12 17:36:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 6 ms
[2021-05-12 17:36:10] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-12 17:36:10] [INFO ] Added : 6 causal constraints over 2 iterations in 5 ms. Result :sat
Minimization took 3 ms.
Current structural bounds on expressions (after SMT) : [6] Max seen :[4]
Incomplete Parikh walk after 1600 steps, including 106 resets, run finished after 5 ms. (steps per millisecond=320 ) properties (out of 1) seen :4 could not realise parikh vector
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:36:10] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 17:36:10] [INFO ] Implicit Places using invariants in 6 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:36:10] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 17:36:10] [INFO ] Implicit Places using invariants and state equation in 8 ms returned []
Implicit Place search using SMT with State Equation took 14 ms to find 0 implicit places.
[2021-05-12 17:36:10] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:36:10] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 17:36:10] [INFO ] Dead Transitions using invariants and state equation in 7 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-0003-UpperBounds-01 in 2053 ms.
Starting property specific reduction for JoinFreeModules-PT-0003-UpperBounds-02
// Phase 1: matrix 24 rows 15 cols
[2021-05-12 17:36:10] [INFO ] Computed 3 place invariants in 0 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :5
// Phase 1: matrix 24 rows 15 cols
[2021-05-12 17:36:10] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-12 17:36:10] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-12 17:36:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 17:36:10] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-05-12 17:36:10] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 17:36:10] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-12 17:36:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 17:36:10] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2021-05-12 17:36:10] [INFO ] Computed and/alt/rep : 18/45/18 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-12 17:36:10] [INFO ] Added : 7 causal constraints over 2 iterations in 10 ms. Result :sat
Minimization took 8 ms.
Current structural bounds on expressions (after SMT) : [6] Max seen :[5]
Incomplete Parikh walk after 25600 steps, including 532 resets, run finished after 75 ms. (steps per millisecond=341 ) properties (out of 1) seen :5 could not realise parikh vector
Support contains 1 out of 15 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 15/15 places, 24/24 transitions.
Graph (complete) has 36 edges and 15 vertex of which 5 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.0 ms
Discarding 10 places :
Also discarding 16 output transitions
Drop transitions removed 16 transitions
Applied a total of 1 rules in 0 ms. Remains 5 /15 variables (removed 10) and now considering 8/24 (removed 16) transitions.
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:36:11] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 17:36:11] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/15 places, 8/24 transitions.
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:36:11] [INFO ] Computed 1 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1095 ms. (steps per millisecond=913 ) properties (out of 1) seen :5
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 573 ms. (steps per millisecond=1745 ) properties (out of 1) seen :5
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:36:12] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 17:36:12] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2021-05-12 17:36:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 17:36:12] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2021-05-12 17:36:12] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 17:36:12] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2021-05-12 17:36:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 17:36:12] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2021-05-12 17:36:12] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-12 17:36:12] [INFO ] Added : 5 causal constraints over 1 iterations in 3 ms. Result :sat
Minimization took 3 ms.
Current structural bounds on expressions (after SMT) : [6] Max seen :[5]
Incomplete Parikh walk after 3100 steps, including 354 resets, run finished after 6 ms. (steps per millisecond=516 ) properties (out of 1) seen :5 could not realise parikh vector
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:36:12] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 17:36:12] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:36:12] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 17:36:12] [INFO ] Implicit Places using invariants and state equation in 7 ms returned []
Implicit Place search using SMT with State Equation took 28 ms to find 0 implicit places.
[2021-05-12 17:36:12] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:36:12] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 17:36:12] [INFO ] Dead Transitions using invariants and state equation in 7 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-0003-UpperBounds-02 in 1905 ms.
Starting property specific reduction for JoinFreeModules-PT-0003-UpperBounds-03
// Phase 1: matrix 24 rows 15 cols
[2021-05-12 17:36:12] [INFO ] Computed 3 place invariants in 3 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :3
// Phase 1: matrix 24 rows 15 cols
[2021-05-12 17:36:12] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-12 17:36:12] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-12 17:36:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 17:36:12] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-05-12 17:36:12] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 17:36:12] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2021-05-12 17:36:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 17:36:12] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2021-05-12 17:36:12] [INFO ] Deduced a trap composed of 3 places in 6 ms of which 0 ms to minimize.
[2021-05-12 17:36:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 8 ms
[2021-05-12 17:36:12] [INFO ] Computed and/alt/rep : 18/45/18 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-12 17:36:12] [INFO ] Added : 11 causal constraints over 3 iterations in 55 ms. Result :sat
Minimization took 10 ms.
Current structural bounds on expressions (after SMT) : [6] Max seen :[3]
Incomplete Parikh walk after 2600 steps, including 156 resets, run finished after 5 ms. (steps per millisecond=520 ) properties (out of 1) seen :3 could not realise parikh vector
Support contains 1 out of 15 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 15/15 places, 24/24 transitions.
Graph (complete) has 36 edges and 15 vertex of which 5 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.0 ms
Discarding 10 places :
Also discarding 16 output transitions
Drop transitions removed 16 transitions
Applied a total of 1 rules in 0 ms. Remains 5 /15 variables (removed 10) and now considering 8/24 (removed 16) transitions.
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:36:12] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 17:36:12] [INFO ] Dead Transitions using invariants and state equation in 12 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/15 places, 8/24 transitions.
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:36:12] [INFO ] Computed 1 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1080 ms. (steps per millisecond=925 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 384 ms. (steps per millisecond=2604 ) properties (out of 1) seen :3
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:36:14] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 17:36:14] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2021-05-12 17:36:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 17:36:14] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2021-05-12 17:36:14] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 17:36:14] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2021-05-12 17:36:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 17:36:14] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2021-05-12 17:36:14] [INFO ] Deduced a trap composed of 3 places in 5 ms of which 0 ms to minimize.
[2021-05-12 17:36:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 6 ms
[2021-05-12 17:36:14] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 0 ms.
[2021-05-12 17:36:14] [INFO ] Added : 6 causal constraints over 2 iterations in 7 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : [6] Max seen :[3]
Incomplete Parikh walk after 1200 steps, including 146 resets, run finished after 3 ms. (steps per millisecond=400 ) properties (out of 1) seen :3 could not realise parikh vector
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:36:14] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-12 17:36:14] [INFO ] Implicit Places using invariants in 5 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:36:14] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 17:36:14] [INFO ] Implicit Places using invariants and state equation in 7 ms returned []
Implicit Place search using SMT with State Equation took 13 ms to find 0 implicit places.
[2021-05-12 17:36:14] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:36:14] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-12 17:36:14] [INFO ] Dead Transitions using invariants and state equation in 7 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-0003-UpperBounds-03 in 1680 ms.
Starting property specific reduction for JoinFreeModules-PT-0003-UpperBounds-05
// Phase 1: matrix 24 rows 15 cols
[2021-05-12 17:36:14] [INFO ] Computed 3 place invariants in 0 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :3
// Phase 1: matrix 24 rows 15 cols
[2021-05-12 17:36:14] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-12 17:36:14] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-12 17:36:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 17:36:14] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2021-05-12 17:36:14] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 17:36:14] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-12 17:36:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 17:36:14] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2021-05-12 17:36:14] [INFO ] Computed and/alt/rep : 18/45/18 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-12 17:36:14] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2021-05-12 17:36:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 32 ms
[2021-05-12 17:36:14] [INFO ] Added : 10 causal constraints over 3 iterations in 46 ms. Result :sat
Minimization took 15 ms.
Current structural bounds on expressions (after SMT) : [6] Max seen :[3]
Incomplete Parikh walk after 4900 steps, including 126 resets, run finished after 9 ms. (steps per millisecond=544 ) properties (out of 1) seen :3 could not realise parikh vector
Support contains 1 out of 15 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 15/15 places, 24/24 transitions.
Graph (complete) has 36 edges and 15 vertex of which 5 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.0 ms
Discarding 10 places :
Also discarding 16 output transitions
Drop transitions removed 16 transitions
Applied a total of 1 rules in 0 ms. Remains 5 /15 variables (removed 10) and now considering 8/24 (removed 16) transitions.
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:36:14] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 17:36:14] [INFO ] Dead Transitions using invariants and state equation in 8 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/15 places, 8/24 transitions.
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:36:14] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1082 ms. (steps per millisecond=924 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 385 ms. (steps per millisecond=2597 ) properties (out of 1) seen :3
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:36:16] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 17:36:16] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2021-05-12 17:36:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 17:36:16] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2021-05-12 17:36:16] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 17:36:16] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2021-05-12 17:36:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 17:36:16] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2021-05-12 17:36:16] [INFO ] Deduced a trap composed of 3 places in 4 ms of which 0 ms to minimize.
[2021-05-12 17:36:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 6 ms
[2021-05-12 17:36:16] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-12 17:36:16] [INFO ] Added : 6 causal constraints over 2 iterations in 7 ms. Result :sat
Minimization took 14 ms.
Current structural bounds on expressions (after SMT) : [6] Max seen :[3]
Incomplete Parikh walk after 1200 steps, including 148 resets, run finished after 3 ms. (steps per millisecond=400 ) properties (out of 1) seen :3 could not realise parikh vector
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:36:16] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 17:36:16] [INFO ] Implicit Places using invariants in 8 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:36:16] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 17:36:16] [INFO ] Implicit Places using invariants and state equation in 7 ms returned []
Implicit Place search using SMT with State Equation took 15 ms to find 0 implicit places.
[2021-05-12 17:36:16] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:36:16] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 17:36:16] [INFO ] Dead Transitions using invariants and state equation in 7 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-0003-UpperBounds-05 in 1670 ms.
Starting property specific reduction for JoinFreeModules-PT-0003-UpperBounds-06
// Phase 1: matrix 24 rows 15 cols
[2021-05-12 17:36:16] [INFO ] Computed 3 place invariants in 0 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :3
// Phase 1: matrix 24 rows 15 cols
[2021-05-12 17:36:16] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-12 17:36:16] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-12 17:36:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 17:36:16] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-05-12 17:36:16] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 17:36:16] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-12 17:36:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 17:36:16] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2021-05-12 17:36:16] [INFO ] Computed and/alt/rep : 18/45/18 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-12 17:36:16] [INFO ] Deduced a trap composed of 3 places in 5 ms of which 0 ms to minimize.
[2021-05-12 17:36:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 7 ms
[2021-05-12 17:36:16] [INFO ] Added : 10 causal constraints over 3 iterations in 20 ms. Result :sat
Minimization took 14 ms.
Current structural bounds on expressions (after SMT) : [6] Max seen :[3]
Incomplete Parikh walk after 4900 steps, including 125 resets, run finished after 9 ms. (steps per millisecond=544 ) properties (out of 1) seen :3 could not realise parikh vector
Support contains 1 out of 15 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 15/15 places, 24/24 transitions.
Graph (complete) has 36 edges and 15 vertex of which 5 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.0 ms
Discarding 10 places :
Also discarding 16 output transitions
Drop transitions removed 16 transitions
Applied a total of 1 rules in 0 ms. Remains 5 /15 variables (removed 10) and now considering 8/24 (removed 16) transitions.
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:36:16] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 17:36:16] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/15 places, 8/24 transitions.
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:36:16] [INFO ] Computed 1 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1090 ms. (steps per millisecond=917 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 387 ms. (steps per millisecond=2583 ) properties (out of 1) seen :3
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:36:17] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 17:36:17] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2021-05-12 17:36:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 17:36:17] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2021-05-12 17:36:17] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 17:36:17] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2021-05-12 17:36:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 17:36:17] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2021-05-12 17:36:17] [INFO ] Deduced a trap composed of 3 places in 5 ms of which 0 ms to minimize.
[2021-05-12 17:36:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 6 ms
[2021-05-12 17:36:17] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-12 17:36:17] [INFO ] Added : 6 causal constraints over 2 iterations in 7 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : [6] Max seen :[3]
Incomplete Parikh walk after 1200 steps, including 147 resets, run finished after 2 ms. (steps per millisecond=600 ) properties (out of 1) seen :3 could not realise parikh vector
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:36:17] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 17:36:17] [INFO ] Implicit Places using invariants in 5 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:36:17] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 17:36:17] [INFO ] Implicit Places using invariants and state equation in 8 ms returned []
Implicit Place search using SMT with State Equation took 13 ms to find 0 implicit places.
[2021-05-12 17:36:17] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:36:17] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 17:36:17] [INFO ] Dead Transitions using invariants and state equation in 7 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-0003-UpperBounds-06 in 1653 ms.
Starting property specific reduction for JoinFreeModules-PT-0003-UpperBounds-08
// Phase 1: matrix 24 rows 15 cols
[2021-05-12 17:36:17] [INFO ] Computed 3 place invariants in 0 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :4
// Phase 1: matrix 24 rows 15 cols
[2021-05-12 17:36:17] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-12 17:36:17] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2021-05-12 17:36:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 17:36:17] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2021-05-12 17:36:17] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 17:36:17] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-12 17:36:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 17:36:17] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2021-05-12 17:36:17] [INFO ] Computed and/alt/rep : 18/45/18 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-12 17:36:17] [INFO ] Deduced a trap composed of 3 places in 5 ms of which 0 ms to minimize.
[2021-05-12 17:36:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 15 ms
[2021-05-12 17:36:17] [INFO ] Added : 12 causal constraints over 3 iterations in 29 ms. Result :sat
Minimization took 8 ms.
Current structural bounds on expressions (after SMT) : [6] Max seen :[4]
Incomplete Parikh walk after 2500 steps, including 117 resets, run finished after 5 ms. (steps per millisecond=500 ) properties (out of 1) seen :4 could not realise parikh vector
Support contains 1 out of 15 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 15/15 places, 24/24 transitions.
Graph (complete) has 36 edges and 15 vertex of which 5 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.0 ms
Discarding 10 places :
Also discarding 16 output transitions
Drop transitions removed 16 transitions
Applied a total of 1 rules in 0 ms. Remains 5 /15 variables (removed 10) and now considering 8/24 (removed 16) transitions.
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:36:17] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 17:36:17] [INFO ] Dead Transitions using invariants and state equation in 8 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/15 places, 8/24 transitions.
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:36:17] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000001 steps, including 2 resets, run finished after 1086 ms. (steps per millisecond=920 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 455 ms. (steps per millisecond=2197 ) properties (out of 1) seen :4
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:36:19] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 17:36:19] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2021-05-12 17:36:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 17:36:19] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2021-05-12 17:36:19] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 17:36:19] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2021-05-12 17:36:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 17:36:19] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2021-05-12 17:36:19] [INFO ] Deduced a trap composed of 3 places in 6 ms of which 1 ms to minimize.
[2021-05-12 17:36:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 7 ms
[2021-05-12 17:36:19] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 0 ms.
[2021-05-12 17:36:19] [INFO ] Added : 6 causal constraints over 2 iterations in 4 ms. Result :sat
Minimization took 3 ms.
Current structural bounds on expressions (after SMT) : [6] Max seen :[4]
Incomplete Parikh walk after 1600 steps, including 105 resets, run finished after 4 ms. (steps per millisecond=400 ) properties (out of 1) seen :4 could not realise parikh vector
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:36:19] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 17:36:19] [INFO ] Implicit Places using invariants in 5 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:36:19] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-12 17:36:19] [INFO ] Implicit Places using invariants and state equation in 7 ms returned []
Implicit Place search using SMT with State Equation took 13 ms to find 0 implicit places.
[2021-05-12 17:36:19] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:36:19] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 17:36:19] [INFO ] Dead Transitions using invariants and state equation in 7 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-0003-UpperBounds-08 in 1697 ms.
Starting property specific reduction for JoinFreeModules-PT-0003-UpperBounds-09
// Phase 1: matrix 24 rows 15 cols
[2021-05-12 17:36:19] [INFO ] Computed 3 place invariants in 0 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :4
// Phase 1: matrix 24 rows 15 cols
[2021-05-12 17:36:19] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-12 17:36:19] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2021-05-12 17:36:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 17:36:19] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-05-12 17:36:19] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 17:36:19] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-12 17:36:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 17:36:19] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2021-05-12 17:36:19] [INFO ] Computed and/alt/rep : 18/45/18 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-12 17:36:19] [INFO ] Deduced a trap composed of 3 places in 5 ms of which 0 ms to minimize.
[2021-05-12 17:36:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 11 ms
[2021-05-12 17:36:19] [INFO ] Added : 12 causal constraints over 3 iterations in 34 ms. Result :sat
Minimization took 8 ms.
Current structural bounds on expressions (after SMT) : [6] Max seen :[4]
Incomplete Parikh walk after 2500 steps, including 116 resets, run finished after 6 ms. (steps per millisecond=416 ) properties (out of 1) seen :4 could not realise parikh vector
Support contains 1 out of 15 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 15/15 places, 24/24 transitions.
Graph (complete) has 36 edges and 15 vertex of which 5 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.0 ms
Discarding 10 places :
Also discarding 16 output transitions
Drop transitions removed 16 transitions
Applied a total of 1 rules in 0 ms. Remains 5 /15 variables (removed 10) and now considering 8/24 (removed 16) transitions.
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:36:19] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-12 17:36:19] [INFO ] Dead Transitions using invariants and state equation in 7 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/15 places, 8/24 transitions.
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:36:19] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1076 ms. (steps per millisecond=929 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 457 ms. (steps per millisecond=2188 ) properties (out of 1) seen :4
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:36:21] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 17:36:21] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2021-05-12 17:36:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 17:36:21] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2021-05-12 17:36:21] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 17:36:21] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2021-05-12 17:36:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 17:36:21] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2021-05-12 17:36:21] [INFO ] Deduced a trap composed of 3 places in 4 ms of which 0 ms to minimize.
[2021-05-12 17:36:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 5 ms
[2021-05-12 17:36:21] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-12 17:36:21] [INFO ] Added : 6 causal constraints over 2 iterations in 5 ms. Result :sat
Minimization took 4 ms.
Current structural bounds on expressions (after SMT) : [6] Max seen :[4]
Incomplete Parikh walk after 1600 steps, including 105 resets, run finished after 3 ms. (steps per millisecond=533 ) properties (out of 1) seen :4 could not realise parikh vector
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:36:21] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 17:36:21] [INFO ] Implicit Places using invariants in 6 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:36:21] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 17:36:21] [INFO ] Implicit Places using invariants and state equation in 9 ms returned []
Implicit Place search using SMT with State Equation took 15 ms to find 0 implicit places.
[2021-05-12 17:36:21] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:36:21] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 17:36:21] [INFO ] Dead Transitions using invariants and state equation in 17 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-0003-UpperBounds-09 in 1705 ms.
Starting property specific reduction for JoinFreeModules-PT-0003-UpperBounds-10
// Phase 1: matrix 24 rows 15 cols
[2021-05-12 17:36:21] [INFO ] Computed 3 place invariants in 0 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :3
// Phase 1: matrix 24 rows 15 cols
[2021-05-12 17:36:21] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-12 17:36:21] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-12 17:36:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 17:36:21] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2021-05-12 17:36:21] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 17:36:21] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-12 17:36:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 17:36:21] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2021-05-12 17:36:21] [INFO ] Deduced a trap composed of 3 places in 5 ms of which 1 ms to minimize.
[2021-05-12 17:36:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 8 ms
[2021-05-12 17:36:21] [INFO ] Computed and/alt/rep : 18/45/18 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-12 17:36:21] [INFO ] Deduced a trap composed of 3 places in 8 ms of which 4 ms to minimize.
[2021-05-12 17:36:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 11 ms
[2021-05-12 17:36:21] [INFO ] Added : 18 causal constraints over 4 iterations in 35 ms. Result :sat
Minimization took 11 ms.
Current structural bounds on expressions (after SMT) : [6] Max seen :[3]
Incomplete Parikh walk after 3200 steps, including 146 resets, run finished after 7 ms. (steps per millisecond=457 ) properties (out of 1) seen :3 could not realise parikh vector
Support contains 1 out of 15 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 15/15 places, 24/24 transitions.
Graph (complete) has 36 edges and 15 vertex of which 5 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.0 ms
Discarding 10 places :
Also discarding 16 output transitions
Drop transitions removed 16 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /15 variables (removed 10) and now considering 8/24 (removed 16) transitions.
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:36:21] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 17:36:21] [INFO ] Dead Transitions using invariants and state equation in 7 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/15 places, 8/24 transitions.
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:36:21] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1080 ms. (steps per millisecond=925 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 386 ms. (steps per millisecond=2590 ) properties (out of 1) seen :3
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:36:22] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 17:36:22] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2021-05-12 17:36:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 17:36:22] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2021-05-12 17:36:22] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 17:36:22] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2021-05-12 17:36:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 17:36:22] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2021-05-12 17:36:22] [INFO ] Deduced a trap composed of 3 places in 5 ms of which 1 ms to minimize.
[2021-05-12 17:36:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 6 ms
[2021-05-12 17:36:22] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-12 17:36:22] [INFO ] Added : 6 causal constraints over 2 iterations in 10 ms. Result :sat
Minimization took 15 ms.
Current structural bounds on expressions (after SMT) : [6] Max seen :[3]
Incomplete Parikh walk after 1200 steps, including 146 resets, run finished after 3 ms. (steps per millisecond=400 ) properties (out of 1) seen :3 could not realise parikh vector
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:36:22] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 17:36:22] [INFO ] Implicit Places using invariants in 6 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:36:22] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 17:36:22] [INFO ] Implicit Places using invariants and state equation in 8 ms returned []
Implicit Place search using SMT with State Equation took 14 ms to find 0 implicit places.
[2021-05-12 17:36:22] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:36:22] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 17:36:22] [INFO ] Dead Transitions using invariants and state equation in 13 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-0003-UpperBounds-10 in 1664 ms.
Starting property specific reduction for JoinFreeModules-PT-0003-UpperBounds-11
// Phase 1: matrix 24 rows 15 cols
[2021-05-12 17:36:22] [INFO ] Computed 3 place invariants in 0 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :3
// Phase 1: matrix 24 rows 15 cols
[2021-05-12 17:36:22] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-12 17:36:22] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2021-05-12 17:36:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 17:36:22] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-05-12 17:36:22] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 17:36:22] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-12 17:36:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 17:36:22] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2021-05-12 17:36:22] [INFO ] Computed and/alt/rep : 18/45/18 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-12 17:36:22] [INFO ] Deduced a trap composed of 3 places in 5 ms of which 1 ms to minimize.
[2021-05-12 17:36:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 7 ms
[2021-05-12 17:36:22] [INFO ] Added : 10 causal constraints over 3 iterations in 20 ms. Result :sat
Minimization took 15 ms.
Current structural bounds on expressions (after SMT) : [6] Max seen :[3]
Incomplete Parikh walk after 4900 steps, including 125 resets, run finished after 8 ms. (steps per millisecond=612 ) properties (out of 1) seen :3 could not realise parikh vector
Support contains 1 out of 15 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 15/15 places, 24/24 transitions.
Graph (complete) has 36 edges and 15 vertex of which 5 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.0 ms
Discarding 10 places :
Also discarding 16 output transitions
Drop transitions removed 16 transitions
Applied a total of 1 rules in 0 ms. Remains 5 /15 variables (removed 10) and now considering 8/24 (removed 16) transitions.
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:36:22] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 17:36:22] [INFO ] Dead Transitions using invariants and state equation in 8 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/15 places, 8/24 transitions.
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:36:22] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1087 ms. (steps per millisecond=919 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 383 ms. (steps per millisecond=2610 ) properties (out of 1) seen :3
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:36:24] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-12 17:36:24] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2021-05-12 17:36:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 17:36:24] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2021-05-12 17:36:24] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 17:36:24] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2021-05-12 17:36:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 17:36:24] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2021-05-12 17:36:24] [INFO ] Deduced a trap composed of 3 places in 5 ms of which 0 ms to minimize.
[2021-05-12 17:36:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 6 ms
[2021-05-12 17:36:24] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 0 ms.
[2021-05-12 17:36:24] [INFO ] Added : 6 causal constraints over 2 iterations in 7 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : [6] Max seen :[3]
Incomplete Parikh walk after 1200 steps, including 146 resets, run finished after 2 ms. (steps per millisecond=600 ) properties (out of 1) seen :3 could not realise parikh vector
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:36:24] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 17:36:24] [INFO ] Implicit Places using invariants in 9 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:36:24] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 17:36:24] [INFO ] Implicit Places using invariants and state equation in 14 ms returned []
Implicit Place search using SMT with State Equation took 24 ms to find 0 implicit places.
[2021-05-12 17:36:24] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:36:24] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-12 17:36:24] [INFO ] Dead Transitions using invariants and state equation in 7 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-0003-UpperBounds-11 in 1650 ms.
Starting property specific reduction for JoinFreeModules-PT-0003-UpperBounds-12
// Phase 1: matrix 24 rows 15 cols
[2021-05-12 17:36:24] [INFO ] Computed 3 place invariants in 0 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :5
// Phase 1: matrix 24 rows 15 cols
[2021-05-12 17:36:24] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-12 17:36:24] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2021-05-12 17:36:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 17:36:24] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-05-12 17:36:24] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 17:36:24] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-12 17:36:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 17:36:24] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2021-05-12 17:36:24] [INFO ] Computed and/alt/rep : 18/45/18 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-12 17:36:24] [INFO ] Added : 7 causal constraints over 2 iterations in 10 ms. Result :sat
Minimization took 8 ms.
Current structural bounds on expressions (after SMT) : [6] Max seen :[5]
Incomplete Parikh walk after 25600 steps, including 527 resets, run finished after 40 ms. (steps per millisecond=640 ) properties (out of 1) seen :5 could not realise parikh vector
Support contains 1 out of 15 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 15/15 places, 24/24 transitions.
Graph (complete) has 36 edges and 15 vertex of which 5 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.0 ms
Discarding 10 places :
Also discarding 16 output transitions
Drop transitions removed 16 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /15 variables (removed 10) and now considering 8/24 (removed 16) transitions.
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:36:24] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 17:36:24] [INFO ] Dead Transitions using invariants and state equation in 8 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/15 places, 8/24 transitions.
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:36:24] [INFO ] Computed 1 place invariants in 1 ms
Incomplete random walk after 1000001 steps, including 2 resets, run finished after 1081 ms. (steps per millisecond=925 ) properties (out of 1) seen :5
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 568 ms. (steps per millisecond=1760 ) properties (out of 1) seen :5
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:36:26] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 17:36:26] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2021-05-12 17:36:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 17:36:26] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2021-05-12 17:36:26] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 17:36:26] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2021-05-12 17:36:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 17:36:26] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2021-05-12 17:36:26] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-12 17:36:26] [INFO ] Added : 5 causal constraints over 1 iterations in 4 ms. Result :sat
Minimization took 3 ms.
Current structural bounds on expressions (after SMT) : [6] Max seen :[5]
Incomplete Parikh walk after 3100 steps, including 349 resets, run finished after 6 ms. (steps per millisecond=516 ) properties (out of 1) seen :5 could not realise parikh vector
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:36:26] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 17:36:26] [INFO ] Implicit Places using invariants in 8 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:36:26] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 17:36:26] [INFO ] Implicit Places using invariants and state equation in 7 ms returned []
Implicit Place search using SMT with State Equation took 15 ms to find 0 implicit places.
[2021-05-12 17:36:26] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:36:26] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 17:36:26] [INFO ] Dead Transitions using invariants and state equation in 7 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-0003-UpperBounds-12 in 1831 ms.
Starting property specific reduction for JoinFreeModules-PT-0003-UpperBounds-13
// Phase 1: matrix 24 rows 15 cols
[2021-05-12 17:36:26] [INFO ] Computed 3 place invariants in 0 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :4
// Phase 1: matrix 24 rows 15 cols
[2021-05-12 17:36:26] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-12 17:36:26] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2021-05-12 17:36:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 17:36:26] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-05-12 17:36:26] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 17:36:26] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2021-05-12 17:36:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 17:36:26] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2021-05-12 17:36:26] [INFO ] Deduced a trap composed of 3 places in 5 ms of which 0 ms to minimize.
[2021-05-12 17:36:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 10 ms
[2021-05-12 17:36:26] [INFO ] Computed and/alt/rep : 18/45/18 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-12 17:36:26] [INFO ] Deduced a trap composed of 3 places in 5 ms of which 1 ms to minimize.
[2021-05-12 17:36:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 8 ms
[2021-05-12 17:36:26] [INFO ] Added : 17 causal constraints over 4 iterations in 23 ms. Result :sat
Minimization took 13 ms.
Current structural bounds on expressions (after SMT) : [6] Max seen :[4]
Incomplete Parikh walk after 4900 steps, including 167 resets, run finished after 9 ms. (steps per millisecond=544 ) properties (out of 1) seen :4 could not realise parikh vector
Support contains 1 out of 15 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 15/15 places, 24/24 transitions.
Graph (complete) has 36 edges and 15 vertex of which 5 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.0 ms
Discarding 10 places :
Also discarding 16 output transitions
Drop transitions removed 16 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /15 variables (removed 10) and now considering 8/24 (removed 16) transitions.
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:36:26] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 17:36:26] [INFO ] Dead Transitions using invariants and state equation in 7 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/15 places, 8/24 transitions.
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:36:26] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000001 steps, including 2 resets, run finished after 1072 ms. (steps per millisecond=932 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 633 ms. (steps per millisecond=1579 ) properties (out of 1) seen :4
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:36:28] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 17:36:28] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2021-05-12 17:36:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 17:36:28] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2021-05-12 17:36:28] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 17:36:28] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2021-05-12 17:36:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 17:36:28] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2021-05-12 17:36:28] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 0 ms.
[2021-05-12 17:36:28] [INFO ] Added : 6 causal constraints over 2 iterations in 8 ms. Result :sat
Minimization took 4 ms.
Current structural bounds on expressions (after SMT) : [6] Max seen :[4]
Incomplete Parikh walk after 2800 steps, including 144 resets, run finished after 4 ms. (steps per millisecond=700 ) properties (out of 1) seen :4 could not realise parikh vector
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:36:28] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 17:36:28] [INFO ] Implicit Places using invariants in 6 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:36:28] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 17:36:28] [INFO ] Implicit Places using invariants and state equation in 7 ms returned []
Implicit Place search using SMT with State Equation took 14 ms to find 0 implicit places.
[2021-05-12 17:36:28] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:36:28] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 17:36:28] [INFO ] Dead Transitions using invariants and state equation in 8 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-0003-UpperBounds-13 in 1895 ms.
Starting property specific reduction for JoinFreeModules-PT-0003-UpperBounds-14
// Phase 1: matrix 24 rows 15 cols
[2021-05-12 17:36:28] [INFO ] Computed 3 place invariants in 0 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :3
// Phase 1: matrix 24 rows 15 cols
[2021-05-12 17:36:28] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-12 17:36:28] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2021-05-12 17:36:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 17:36:28] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-05-12 17:36:28] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 17:36:28] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-12 17:36:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 17:36:28] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2021-05-12 17:36:28] [INFO ] Deduced a trap composed of 3 places in 5 ms of which 1 ms to minimize.
[2021-05-12 17:36:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 7 ms
[2021-05-12 17:36:28] [INFO ] Computed and/alt/rep : 18/45/18 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-12 17:36:28] [INFO ] Added : 11 causal constraints over 3 iterations in 56 ms. Result :sat
Minimization took 11 ms.
Current structural bounds on expressions (after SMT) : [6] Max seen :[3]
Incomplete Parikh walk after 2600 steps, including 155 resets, run finished after 5 ms. (steps per millisecond=520 ) properties (out of 1) seen :3 could not realise parikh vector
Support contains 1 out of 15 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 15/15 places, 24/24 transitions.
Graph (complete) has 36 edges and 15 vertex of which 5 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.0 ms
Discarding 10 places :
Also discarding 16 output transitions
Drop transitions removed 16 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /15 variables (removed 10) and now considering 8/24 (removed 16) transitions.
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:36:28] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 17:36:28] [INFO ] Dead Transitions using invariants and state equation in 7 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/15 places, 8/24 transitions.
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:36:28] [INFO ] Computed 1 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1067 ms. (steps per millisecond=937 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 382 ms. (steps per millisecond=2617 ) properties (out of 1) seen :3
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:36:29] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-12 17:36:29] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2021-05-12 17:36:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 17:36:29] [INFO ] [Real]Absence check using state equation in 1 ms returned sat
[2021-05-12 17:36:29] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 17:36:29] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2021-05-12 17:36:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 17:36:29] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2021-05-12 17:36:29] [INFO ] Deduced a trap composed of 3 places in 4 ms of which 0 ms to minimize.
[2021-05-12 17:36:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 6 ms
[2021-05-12 17:36:29] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 0 ms.
[2021-05-12 17:36:29] [INFO ] Added : 6 causal constraints over 2 iterations in 7 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : [6] Max seen :[3]
Incomplete Parikh walk after 1200 steps, including 148 resets, run finished after 2 ms. (steps per millisecond=600 ) properties (out of 1) seen :3 could not realise parikh vector
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:36:29] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 17:36:29] [INFO ] Implicit Places using invariants in 5 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:36:29] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 17:36:29] [INFO ] Implicit Places using invariants and state equation in 7 ms returned []
Implicit Place search using SMT with State Equation took 13 ms to find 0 implicit places.
[2021-05-12 17:36:29] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:36:29] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 17:36:29] [INFO ] Dead Transitions using invariants and state equation in 7 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-0003-UpperBounds-14 in 1648 ms.
[2021-05-12 17:36:29] [INFO ] Flatten gal took : 20 ms
[2021-05-12 17:36:29] [INFO ] Applying decomposition
[2021-05-12 17:36:29] [INFO ] Flatten gal took : 4 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/graph3503676953532254669.txt, -o, /tmp/graph3503676953532254669.bin, -w, /tmp/graph3503676953532254669.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/graph3503676953532254669.bin, -l, -1, -v, -w, /tmp/graph3503676953532254669.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-12 17:36:30] [INFO ] Decomposing Gal with order
[2021-05-12 17:36:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-12 17:36:30] [INFO ] Flatten gal took : 23 ms
[2021-05-12 17:36:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2021-05-12 17:36:30] [INFO ] Time to serialize gal into /tmp/UpperBounds16635544752161082628.gal : 1 ms
[2021-05-12 17:36:30] [INFO ] Time to serialize properties into /tmp/UpperBounds13875409581151208377.prop : 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-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds16635544752161082628.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds13875409581151208377.prop, --nowitness], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds16635544752161082628.gal -t CGAL -reachable-file /tmp/UpperBounds13875409581151208377.prop --nowitness
Loading property file /tmp/UpperBounds13875409581151208377.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,35937,0.011167,3856,32,29,214,190,67,233,45,389,0
Total reachable state count : 35937

Verifying 12 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 4
Bounds property JoinFreeModules-PT-0003-UpperBounds-01 :0 <= i2.u5.p12 <= 4
FORMULA JoinFreeModules-PT-0003-UpperBounds-01 4 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
JoinFreeModules-PT-0003-UpperBounds-01,0,0.011702,3856,1,0,214,190,102,233,59,389,60
Min sum of variable value : 0
Maximum sum along a path : 5
Bounds property JoinFreeModules-PT-0003-UpperBounds-02 :0 <= i2.u4.p15 <= 5
FORMULA JoinFreeModules-PT-0003-UpperBounds-02 5 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
JoinFreeModules-PT-0003-UpperBounds-02,0,0.011802,3856,1,0,214,190,111,233,65,389,67
Min sum of variable value : 0
Maximum sum along a path : 3
Bounds property JoinFreeModules-PT-0003-UpperBounds-03 :0 <= i1.u2.p8 <= 3
FORMULA JoinFreeModules-PT-0003-UpperBounds-03 3 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
JoinFreeModules-PT-0003-UpperBounds-03,0,0.011885,3856,1,0,214,190,122,233,72,389,77
Min sum of variable value : 0
Maximum sum along a path : 3
Bounds property JoinFreeModules-PT-0003-UpperBounds-05 :0 <= i0.u1.p3 <= 3
FORMULA JoinFreeModules-PT-0003-UpperBounds-05 3 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
JoinFreeModules-PT-0003-UpperBounds-05,0,0.012079,3856,1,0,214,190,131,233,72,389,92
Min sum of variable value : 0
Maximum sum along a path : 3
Bounds property JoinFreeModules-PT-0003-UpperBounds-06 :0 <= i0.u1.p3 <= 3
FORMULA JoinFreeModules-PT-0003-UpperBounds-06 3 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
JoinFreeModules-PT-0003-UpperBounds-06,0,0.012136,3856,1,0,214,190,131,233,72,389,92
Min sum of variable value : 0
Maximum sum along a path : 4
Bounds property JoinFreeModules-PT-0003-UpperBounds-08 :0 <= i1.u2.p7 <= 4
FORMULA JoinFreeModules-PT-0003-UpperBounds-08 4 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
JoinFreeModules-PT-0003-UpperBounds-08,0,0.012225,3856,1,0,214,190,140,233,72,389,101
Min sum of variable value : 0
Maximum sum along a path : 4
Bounds property JoinFreeModules-PT-0003-UpperBounds-09 :0 <= i1.u2.p7 <= 4
FORMULA JoinFreeModules-PT-0003-UpperBounds-09 4 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
JoinFreeModules-PT-0003-UpperBounds-09,0,0.012278,3856,1,0,214,190,140,233,72,389,101
Min sum of variable value : 0
Maximum sum along a path : 3
Bounds property JoinFreeModules-PT-0003-UpperBounds-10 :0 <= i2.u5.p13 <= 3
FORMULA JoinFreeModules-PT-0003-UpperBounds-10 3 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
JoinFreeModules-PT-0003-UpperBounds-10,0,0.012335,3856,1,0,214,190,145,233,72,389,104
Min sum of variable value : 0
Maximum sum along a path : 3
Bounds property JoinFreeModules-PT-0003-UpperBounds-11 :0 <= i0.u1.p3 <= 3
FORMULA JoinFreeModules-PT-0003-UpperBounds-11 3 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
JoinFreeModules-PT-0003-UpperBounds-11,0,0.012392,3856,1,0,214,190,145,233,72,389,104
Min sum of variable value : 0
Maximum sum along a path : 5
Bounds property JoinFreeModules-PT-0003-UpperBounds-12 :0 <= i2.u4.p15 <= 5
FORMULA JoinFreeModules-PT-0003-UpperBounds-12 5 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
JoinFreeModules-PT-0003-UpperBounds-12,0,0.012443,3856,1,0,214,190,145,233,72,389,104
Min sum of variable value : 0
Maximum sum along a path : 4
Bounds property JoinFreeModules-PT-0003-UpperBounds-13 :0 <= i1.u3.p9 <= 4
FORMULA JoinFreeModules-PT-0003-UpperBounds-13 4 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
JoinFreeModules-PT-0003-UpperBounds-13,0,0.012696,3856,1,0,214,190,155,233,75,389,121
Min sum of variable value : 0
Maximum sum along a path : 3
Bounds property JoinFreeModules-PT-0003-UpperBounds-14 :0 <= i1.u2.p8 <= 3
FORMULA JoinFreeModules-PT-0003-UpperBounds-14 3 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
JoinFreeModules-PT-0003-UpperBounds-14,0,0.01275,3856,1,0,214,190,155,233,75,389,121

BK_STOP 1620840991047

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -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 UpperBounds -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="JoinFreeModules-PT-0003"
export BK_EXAMINATION="UpperBounds"
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 JoinFreeModules-PT-0003, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r121-tall-162075406900387"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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