Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2021-input.r159-oct2-162089267700043.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2021-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is PhilosophersDyn-PT-03, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r159-oct2-162089267700043
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 840K
-rw-r--r-- 1 mcc users 30K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 172K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 56K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 299K 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 5.0K Mar 28 16:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 28 16:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Mar 28 16:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 31K Mar 28 16:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.3K Mar 27 09:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 27 09:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Mar 25 11:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 44K Mar 25 11:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K Mar 22 09:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.6K Mar 22 09:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 87K 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 PhilosophersDyn-PT-03-UpperBounds-00
FORMULA_NAME PhilosophersDyn-PT-03-UpperBounds-01
FORMULA_NAME PhilosophersDyn-PT-03-UpperBounds-02
FORMULA_NAME PhilosophersDyn-PT-03-UpperBounds-03
FORMULA_NAME PhilosophersDyn-PT-03-UpperBounds-04
FORMULA_NAME PhilosophersDyn-PT-03-UpperBounds-05
FORMULA_NAME PhilosophersDyn-PT-03-UpperBounds-06
FORMULA_NAME PhilosophersDyn-PT-03-UpperBounds-07
FORMULA_NAME PhilosophersDyn-PT-03-UpperBounds-08
FORMULA_NAME PhilosophersDyn-PT-03-UpperBounds-09
FORMULA_NAME PhilosophersDyn-PT-03-UpperBounds-10
FORMULA_NAME PhilosophersDyn-PT-03-UpperBounds-11
FORMULA_NAME PhilosophersDyn-PT-03-UpperBounds-12
FORMULA_NAME PhilosophersDyn-PT-03-UpperBounds-13
FORMULA_NAME PhilosophersDyn-PT-03-UpperBounds-14
FORMULA_NAME PhilosophersDyn-PT-03-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1621179161977

Running Version 0
[2021-05-16 15:32:44] [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-16 15:32:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-16 15:32:44] [INFO ] Load time of PNML (sax parser for PT used): 37 ms
[2021-05-16 15:32:44] [INFO ] Transformed 30 places.
[2021-05-16 15:32:44] [INFO ] Transformed 84 transitions.
[2021-05-16 15:32:44] [INFO ] Parsed PT model containing 30 places and 84 transitions in 83 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 9 ms.
Ensure Unique test removed 3 transitions
Reduce redundant transitions removed 3 transitions.
Normalized transition count is 57 out of 81 initially.
// Phase 1: matrix 57 rows 30 cols
[2021-05-16 15:32:44] [INFO ] Computed 11 place invariants in 17 ms
FORMULA PhilosophersDyn-PT-03-UpperBounds-05 3 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-PT-03-UpperBounds-03 3 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 1443 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 14) seen :22
FORMULA PhilosophersDyn-PT-03-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PhilosophersDyn-PT-03-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PhilosophersDyn-PT-03-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PhilosophersDyn-PT-03-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PhilosophersDyn-PT-03-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PhilosophersDyn-PT-03-UpperBounds-07 3 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 250 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 8) seen :13
Incomplete Best-First random walk after 10001 steps, including 383 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 8) seen :14
Incomplete Best-First random walk after 10000 steps, including 348 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 8) seen :14
Incomplete Best-First random walk after 10001 steps, including 381 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 8) seen :12
Incomplete Best-First random walk after 10000 steps, including 345 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 8) seen :12
Incomplete Best-First random walk after 10000 steps, including 509 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 8) seen :14
Incomplete Best-First random walk after 10001 steps, including 314 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 8) seen :13
Incomplete Best-First random walk after 10001 steps, including 315 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 8) seen :13
[2021-05-16 15:32:45] [INFO ] Flow matrix only has 57 transitions (discarded 24 similar events)
// Phase 1: matrix 57 rows 30 cols
[2021-05-16 15:32:45] [INFO ] Computed 11 place invariants in 4 ms
[2021-05-16 15:32:45] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2021-05-16 15:32:45] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned unsat
[2021-05-16 15:32:45] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2021-05-16 15:32:45] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 2 ms returned sat
[2021-05-16 15:32:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:32:45] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2021-05-16 15:32:45] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:32:45] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2021-05-16 15:32:45] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 3 ms returned sat
[2021-05-16 15:32:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 15:32:45] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2021-05-16 15:32:45] [INFO ] State equation strengthened by 36 read => feed constraints.
[2021-05-16 15:32:45] [INFO ] [Nat]Added 36 Read/Feed constraints in 5 ms returned sat
[2021-05-16 15:32:45] [INFO ] Computed and/alt/rep : 6/45/6 causal constraints (skipped 48 transitions) in 19 ms.
[2021-05-16 15:32:45] [INFO ] Added : 6 causal constraints over 2 iterations in 40 ms. Result :sat
Minimization took 14 ms.
[2021-05-16 15:32:45] [INFO ] [Real]Absence check using 8 positive place invariants in 1 ms returned sat
[2021-05-16 15:32:45] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-16 15:32:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:32:45] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2021-05-16 15:32:45] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:32:45] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2021-05-16 15:32:45] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-16 15:32:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 15:32:45] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2021-05-16 15:32:45] [INFO ] [Nat]Added 36 Read/Feed constraints in 9 ms returned sat
[2021-05-16 15:32:45] [INFO ] Computed and/alt/rep : 6/45/6 causal constraints (skipped 48 transitions) in 5 ms.
[2021-05-16 15:32:45] [INFO ] Added : 5 causal constraints over 1 iterations in 27 ms. Result :sat
Minimization took 10 ms.
[2021-05-16 15:32:45] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2021-05-16 15:32:45] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-16 15:32:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:32:45] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2021-05-16 15:32:45] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:32:45] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2021-05-16 15:32:45] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 2 ms returned sat
[2021-05-16 15:32:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 15:32:45] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2021-05-16 15:32:45] [INFO ] [Nat]Added 36 Read/Feed constraints in 5 ms returned sat
[2021-05-16 15:32:45] [INFO ] Computed and/alt/rep : 6/45/6 causal constraints (skipped 48 transitions) in 10 ms.
[2021-05-16 15:32:45] [INFO ] Added : 6 causal constraints over 2 iterations in 55 ms. Result :sat
Minimization took 10 ms.
[2021-05-16 15:32:45] [INFO ] [Real]Absence check using 8 positive place invariants in 15 ms returned sat
[2021-05-16 15:32:45] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 3 ms returned sat
[2021-05-16 15:32:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:32:45] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2021-05-16 15:32:45] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:32:45] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2021-05-16 15:32:45] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 3 ms returned sat
[2021-05-16 15:32:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 15:32:46] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2021-05-16 15:32:46] [INFO ] [Nat]Added 36 Read/Feed constraints in 4 ms returned sat
[2021-05-16 15:32:46] [INFO ] Computed and/alt/rep : 6/45/6 causal constraints (skipped 48 transitions) in 6 ms.
[2021-05-16 15:32:46] [INFO ] Added : 5 causal constraints over 1 iterations in 17 ms. Result :sat
Minimization took 10 ms.
[2021-05-16 15:32:46] [INFO ] [Real]Absence check using 8 positive place invariants in 1 ms returned sat
[2021-05-16 15:32:46] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned unsat
[2021-05-16 15:32:46] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2021-05-16 15:32:46] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 2 ms returned sat
[2021-05-16 15:32:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:32:46] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2021-05-16 15:32:46] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:32:46] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2021-05-16 15:32:46] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-16 15:32:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 15:32:46] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2021-05-16 15:32:46] [INFO ] [Nat]Added 36 Read/Feed constraints in 4 ms returned sat
[2021-05-16 15:32:46] [INFO ] Computed and/alt/rep : 6/45/6 causal constraints (skipped 48 transitions) in 5 ms.
[2021-05-16 15:32:46] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 3 ms to minimize.
[2021-05-16 15:32:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 78 ms
[2021-05-16 15:32:46] [INFO ] Added : 6 causal constraints over 2 iterations in 122 ms. Result :sat
Minimization took 17 ms.
[2021-05-16 15:32:46] [INFO ] [Real]Absence check using 8 positive place invariants in 24 ms returned sat
[2021-05-16 15:32:46] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-16 15:32:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:32:46] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2021-05-16 15:32:46] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:32:46] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2021-05-16 15:32:46] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-16 15:32:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 15:32:46] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2021-05-16 15:32:46] [INFO ] [Nat]Added 36 Read/Feed constraints in 5 ms returned sat
[2021-05-16 15:32:46] [INFO ] Computed and/alt/rep : 6/45/6 causal constraints (skipped 48 transitions) in 4 ms.
[2021-05-16 15:32:46] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 2 ms to minimize.
[2021-05-16 15:32:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 63 ms
[2021-05-16 15:32:46] [INFO ] Added : 6 causal constraints over 2 iterations in 125 ms. Result :sat
Minimization took 22 ms.
Current structural bounds on expressions (after SMT) : [3, 3, 3, 3, 3, 1, -1, -1] Max seen :[3, 2, 2, 2, 2, 1, 1, 1]
FORMULA PhilosophersDyn-PT-03-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PhilosophersDyn-PT-03-UpperBounds-00 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Incomplete Parikh walk after 2300 steps, including 479 resets, run finished after 6 ms. (steps per millisecond=383 ) properties (out of 6) seen :10 could not realise parikh vector
Incomplete Parikh walk after 3100 steps, including 533 resets, run finished after 20 ms. (steps per millisecond=155 ) properties (out of 6) seen :10 could not realise parikh vector
Incomplete Parikh walk after 4700 steps, including 884 resets, run finished after 20 ms. (steps per millisecond=235 ) properties (out of 6) seen :10 could not realise parikh vector
Incomplete Parikh walk after 4800 steps, including 633 resets, run finished after 12 ms. (steps per millisecond=400 ) properties (out of 6) seen :10 could not realise parikh vector
Incomplete Parikh walk after 4700 steps, including 884 resets, run finished after 9 ms. (steps per millisecond=522 ) properties (out of 6) seen :10 could not realise parikh vector
Incomplete Parikh walk after 4800 steps, including 646 resets, run finished after 10 ms. (steps per millisecond=480 ) properties (out of 6) seen :10 could not realise parikh vector
Support contains 8 out of 30 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 30/30 places, 81/81 transitions.
Applied a total of 0 rules in 11 ms. Remains 30 /30 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2021-05-16 15:32:46] [INFO ] Flow matrix only has 57 transitions (discarded 24 similar events)
// Phase 1: matrix 57 rows 30 cols
[2021-05-16 15:32:46] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 15:32:46] [INFO ] Dead Transitions using invariants and state equation in 59 ms returned [0, 6, 7, 8, 12, 13, 15, 16, 19, 20, 21, 22, 23, 24, 26, 28, 39, 44, 45, 48, 53, 55, 56, 61, 64, 66, 71, 72, 74, 75]
Found 30 dead transitions using SMT.
Drop transitions removed 30 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 30 transitions :[75, 74, 72, 71, 66, 64, 61, 56, 55, 53, 48, 45, 44, 39, 28, 26, 24, 23, 22, 21, 20, 19, 16, 15, 13, 12, 8, 7, 6, 0]
Starting structural reductions, iteration 1 : 30/30 places, 51/81 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 30/30 places, 51/81 transitions.
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 15:32:46] [INFO ] Computed 11 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 143061 resets, run finished after 1312 ms. (steps per millisecond=762 ) properties (out of 6) seen :10
Incomplete Best-First random walk after 1000001 steps, including 38322 resets, run finished after 571 ms. (steps per millisecond=1751 ) properties (out of 6) seen :10
Incomplete Best-First random walk after 1000001 steps, including 34754 resets, run finished after 524 ms. (steps per millisecond=1908 ) properties (out of 6) seen :10
Incomplete Best-First random walk after 1000000 steps, including 38282 resets, run finished after 451 ms. (steps per millisecond=2217 ) properties (out of 6) seen :10
Incomplete Best-First random walk after 1000001 steps, including 34886 resets, run finished after 519 ms. (steps per millisecond=1926 ) properties (out of 6) seen :10
Incomplete Best-First random walk after 1000000 steps, including 30866 resets, run finished after 451 ms. (steps per millisecond=2217 ) properties (out of 6) seen :10
Incomplete Best-First random walk after 1000001 steps, including 30918 resets, run finished after 415 ms. (steps per millisecond=2409 ) properties (out of 6) seen :10
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 15:32:51] [INFO ] Computed 11 place invariants in 2 ms
[2021-05-16 15:32:51] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-16 15:32:51] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 1 ms returned sat
[2021-05-16 15:32:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:32:51] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2021-05-16 15:32:51] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:32:51] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-16 15:32:51] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 6 ms returned sat
[2021-05-16 15:32:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 15:32:51] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2021-05-16 15:32:51] [INFO ] State equation strengthened by 30 read => feed constraints.
[2021-05-16 15:32:51] [INFO ] [Nat]Added 30 Read/Feed constraints in 4 ms returned sat
[2021-05-16 15:32:51] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 1 ms to minimize.
[2021-05-16 15:32:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 41 ms
[2021-05-16 15:32:51] [INFO ] Computed and/alt/rep : 15/123/15 causal constraints (skipped 33 transitions) in 4 ms.
[2021-05-16 15:32:51] [INFO ] Added : 7 causal constraints over 2 iterations in 15 ms. Result :sat
Minimization took 15 ms.
[2021-05-16 15:32:51] [INFO ] [Real]Absence check using 6 positive place invariants in 52 ms returned sat
[2021-05-16 15:32:51] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 52 ms returned sat
[2021-05-16 15:32:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:32:51] [INFO ] [Real]Absence check using state equation in 242 ms returned sat
[2021-05-16 15:32:51] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:32:51] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-16 15:32:51] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 1 ms returned sat
[2021-05-16 15:32:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 15:32:51] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2021-05-16 15:32:51] [INFO ] [Nat]Added 30 Read/Feed constraints in 3 ms returned sat
[2021-05-16 15:32:51] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 1 ms to minimize.
[2021-05-16 15:32:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 48 ms
[2021-05-16 15:32:51] [INFO ] Computed and/alt/rep : 15/123/15 causal constraints (skipped 33 transitions) in 4 ms.
[2021-05-16 15:32:51] [INFO ] Added : 7 causal constraints over 2 iterations in 16 ms. Result :sat
Minimization took 11 ms.
[2021-05-16 15:32:51] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-16 15:32:51] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 1 ms returned sat
[2021-05-16 15:32:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:32:51] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2021-05-16 15:32:51] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:32:51] [INFO ] [Nat]Absence check using 6 positive place invariants in 7 ms returned sat
[2021-05-16 15:32:51] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 1 ms returned sat
[2021-05-16 15:32:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 15:32:51] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2021-05-16 15:32:51] [INFO ] [Nat]Added 30 Read/Feed constraints in 3 ms returned sat
[2021-05-16 15:32:51] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 0 ms to minimize.
[2021-05-16 15:32:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 51 ms
[2021-05-16 15:32:51] [INFO ] Computed and/alt/rep : 15/123/15 causal constraints (skipped 33 transitions) in 5 ms.
[2021-05-16 15:32:51] [INFO ] Added : 7 causal constraints over 2 iterations in 18 ms. Result :sat
Minimization took 11 ms.
[2021-05-16 15:32:52] [INFO ] [Real]Absence check using 6 positive place invariants in 53 ms returned sat
[2021-05-16 15:32:52] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 52 ms returned sat
[2021-05-16 15:32:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:32:52] [INFO ] [Real]Absence check using state equation in 298 ms returned sat
[2021-05-16 15:32:52] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:32:52] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2021-05-16 15:32:52] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 2 ms returned sat
[2021-05-16 15:32:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 15:32:52] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2021-05-16 15:32:52] [INFO ] [Nat]Added 30 Read/Feed constraints in 3 ms returned sat
[2021-05-16 15:32:52] [INFO ] Deduced a trap composed of 7 places in 279 ms of which 27 ms to minimize.
[2021-05-16 15:32:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 289 ms
[2021-05-16 15:32:52] [INFO ] Computed and/alt/rep : 15/123/15 causal constraints (skipped 33 transitions) in 4 ms.
[2021-05-16 15:32:52] [INFO ] Added : 7 causal constraints over 2 iterations in 17 ms. Result :sat
Minimization took 11 ms.
[2021-05-16 15:32:52] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-16 15:32:52] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 1 ms returned sat
[2021-05-16 15:32:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:32:52] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2021-05-16 15:32:52] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:32:52] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-16 15:32:52] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 1 ms returned sat
[2021-05-16 15:32:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 15:32:52] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2021-05-16 15:32:52] [INFO ] [Nat]Added 30 Read/Feed constraints in 3 ms returned sat
[2021-05-16 15:32:52] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 1 ms to minimize.
[2021-05-16 15:32:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 47 ms
[2021-05-16 15:32:52] [INFO ] Computed and/alt/rep : 15/123/15 causal constraints (skipped 33 transitions) in 6 ms.
[2021-05-16 15:32:52] [INFO ] Added : 9 causal constraints over 2 iterations in 20 ms. Result :sat
Minimization took 19 ms.
[2021-05-16 15:32:52] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-16 15:32:52] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 1 ms returned sat
[2021-05-16 15:32:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:32:52] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2021-05-16 15:32:52] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:32:53] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-16 15:32:53] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 5 ms returned sat
[2021-05-16 15:32:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 15:32:53] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2021-05-16 15:32:53] [INFO ] [Nat]Added 30 Read/Feed constraints in 3 ms returned sat
[2021-05-16 15:32:53] [INFO ] Deduced a trap composed of 7 places in 17 ms of which 1 ms to minimize.
[2021-05-16 15:32:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 34 ms
[2021-05-16 15:32:53] [INFO ] Computed and/alt/rep : 15/123/15 causal constraints (skipped 33 transitions) in 5 ms.
[2021-05-16 15:32:53] [INFO ] Added : 9 causal constraints over 2 iterations in 33 ms. Result :sat
Minimization took 19 ms.
Current structural bounds on expressions (after SMT) : [3, 3, 3, 3, -1, -1] Max seen :[2, 2, 2, 2, 1, 1]
Incomplete Parikh walk after 4600 steps, including 589 resets, run finished after 13 ms. (steps per millisecond=353 ) properties (out of 6) seen :10 could not realise parikh vector
Incomplete Parikh walk after 4800 steps, including 674 resets, run finished after 8 ms. (steps per millisecond=600 ) properties (out of 6) seen :10 could not realise parikh vector
Incomplete Parikh walk after 5300 steps, including 631 resets, run finished after 9 ms. (steps per millisecond=588 ) properties (out of 6) seen :10 could not realise parikh vector
Incomplete Parikh walk after 4100 steps, including 552 resets, run finished after 7 ms. (steps per millisecond=585 ) properties (out of 6) seen :10 could not realise parikh vector
Incomplete Parikh walk after 5300 steps, including 675 resets, run finished after 9 ms. (steps per millisecond=588 ) properties (out of 6) seen :10 could not realise parikh vector
Incomplete Parikh walk after 4100 steps, including 564 resets, run finished after 9 ms. (steps per millisecond=455 ) properties (out of 6) seen :10 could not realise parikh vector
Support contains 8 out of 30 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 51/51 transitions.
Starting structural reductions, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 15:32:53] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 15:32:53] [INFO ] Implicit Places using invariants in 42 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 15:32:53] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-16 15:32:53] [INFO ] State equation strengthened by 30 read => feed constraints.
[2021-05-16 15:32:53] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
[2021-05-16 15:32:53] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 15:32:53] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 15:32:53] [INFO ] Dead Transitions using invariants and state equation in 60 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 51/51 transitions.
Starting property specific reduction for PhilosophersDyn-PT-03-UpperBounds-01
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 15:32:53] [INFO ] Computed 11 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 1448 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 10001 steps, including 392 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :2
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 15:32:53] [INFO ] Computed 11 place invariants in 4 ms
[2021-05-16 15:32:53] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-16 15:32:53] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 1 ms returned sat
[2021-05-16 15:32:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:32:53] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2021-05-16 15:32:53] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:32:53] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-16 15:32:53] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 1 ms returned sat
[2021-05-16 15:32:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 15:32:53] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2021-05-16 15:32:53] [INFO ] State equation strengthened by 30 read => feed constraints.
[2021-05-16 15:32:53] [INFO ] [Nat]Added 30 Read/Feed constraints in 4 ms returned sat
[2021-05-16 15:32:53] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 0 ms to minimize.
[2021-05-16 15:32:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 25 ms
[2021-05-16 15:32:53] [INFO ] Computed and/alt/rep : 15/123/15 causal constraints (skipped 33 transitions) in 4 ms.
[2021-05-16 15:32:53] [INFO ] Added : 7 causal constraints over 2 iterations in 18 ms. Result :sat
Minimization took 11 ms.
Current structural bounds on expressions (after SMT) : [4] Max seen :[2]
Incomplete Parikh walk after 4100 steps, including 558 resets, run finished after 7 ms. (steps per millisecond=585 ) properties (out of 1) seen :2 could not realise parikh vector
Support contains 3 out of 30 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 15:32:53] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 15:32:53] [INFO ] Dead Transitions using invariants and state equation in 28 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 51/51 transitions.
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 15:32:53] [INFO ] Computed 11 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 143157 resets, run finished after 1108 ms. (steps per millisecond=902 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000001 steps, including 38262 resets, run finished after 444 ms. (steps per millisecond=2252 ) properties (out of 1) seen :2
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 15:32:55] [INFO ] Computed 11 place invariants in 3 ms
[2021-05-16 15:32:55] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-16 15:32:55] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 1 ms returned sat
[2021-05-16 15:32:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:32:55] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2021-05-16 15:32:55] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:32:55] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-16 15:32:55] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 1 ms returned sat
[2021-05-16 15:32:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 15:32:55] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2021-05-16 15:32:55] [INFO ] State equation strengthened by 30 read => feed constraints.
[2021-05-16 15:32:55] [INFO ] [Nat]Added 30 Read/Feed constraints in 3 ms returned sat
[2021-05-16 15:32:55] [INFO ] Deduced a trap composed of 7 places in 20 ms of which 1 ms to minimize.
[2021-05-16 15:32:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 26 ms
[2021-05-16 15:32:55] [INFO ] Computed and/alt/rep : 15/123/15 causal constraints (skipped 33 transitions) in 4 ms.
[2021-05-16 15:32:55] [INFO ] Added : 7 causal constraints over 2 iterations in 17 ms. Result :sat
Minimization took 10 ms.
Current structural bounds on expressions (after SMT) : [4] Max seen :[2]
Incomplete Parikh walk after 4100 steps, including 571 resets, run finished after 11 ms. (steps per millisecond=372 ) properties (out of 1) seen :2 could not realise parikh vector
Support contains 3 out of 30 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 51/51 transitions.
Starting structural reductions, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 15:32:55] [INFO ] Computed 11 place invariants in 2 ms
[2021-05-16 15:32:55] [INFO ] Implicit Places using invariants in 57 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 15:32:55] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 15:32:55] [INFO ] State equation strengthened by 30 read => feed constraints.
[2021-05-16 15:32:55] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 143 ms to find 0 implicit places.
[2021-05-16 15:32:55] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 15:32:55] [INFO ] Computed 11 place invariants in 3 ms
[2021-05-16 15:32:55] [INFO ] Dead Transitions using invariants and state equation in 35 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 51/51 transitions.
Ending property specific reduction for PhilosophersDyn-PT-03-UpperBounds-01 in 2127 ms.
Starting property specific reduction for PhilosophersDyn-PT-03-UpperBounds-02
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 15:32:55] [INFO ] Computed 11 place invariants in 2 ms
Incomplete random walk after 10000 steps, including 1414 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 10001 steps, including 355 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :2
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 15:32:55] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-16 15:32:55] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-16 15:32:55] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 1 ms returned sat
[2021-05-16 15:32:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:32:55] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2021-05-16 15:32:55] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:32:55] [INFO ] [Nat]Absence check using 6 positive place invariants in 10 ms returned sat
[2021-05-16 15:32:55] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 1 ms returned sat
[2021-05-16 15:32:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 15:32:55] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2021-05-16 15:32:55] [INFO ] State equation strengthened by 30 read => feed constraints.
[2021-05-16 15:32:55] [INFO ] [Nat]Added 30 Read/Feed constraints in 2 ms returned sat
[2021-05-16 15:32:55] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 1 ms to minimize.
[2021-05-16 15:32:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 39 ms
[2021-05-16 15:32:55] [INFO ] Computed and/alt/rep : 15/123/15 causal constraints (skipped 33 transitions) in 6 ms.
[2021-05-16 15:32:55] [INFO ] Added : 7 causal constraints over 2 iterations in 20 ms. Result :sat
Minimization took 27 ms.
Current structural bounds on expressions (after SMT) : [3] Max seen :[2]
Incomplete Parikh walk after 5300 steps, including 654 resets, run finished after 7 ms. (steps per millisecond=757 ) properties (out of 1) seen :2 could not realise parikh vector
Support contains 3 out of 30 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 30/30 places, 51/51 transitions.
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 30 transition count 48
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 6 place count 27 transition count 48
Applied a total of 6 rules in 4 ms. Remains 27 /30 variables (removed 3) and now considering 48/51 (removed 3) transitions.
// Phase 1: matrix 48 rows 27 cols
[2021-05-16 15:32:55] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-16 15:32:55] [INFO ] Dead Transitions using invariants and state equation in 60 ms returned []
Finished structural reductions, in 1 iterations. Remains : 27/30 places, 48/51 transitions.
// Phase 1: matrix 48 rows 27 cols
[2021-05-16 15:32:55] [INFO ] Computed 11 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 146688 resets, run finished after 1128 ms. (steps per millisecond=886 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000001 steps, including 45400 resets, run finished after 438 ms. (steps per millisecond=2283 ) properties (out of 1) seen :2
// Phase 1: matrix 48 rows 27 cols
[2021-05-16 15:32:57] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 15:32:57] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-16 15:32:57] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 1 ms returned sat
[2021-05-16 15:32:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:32:57] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2021-05-16 15:32:57] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:32:57] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-16 15:32:57] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 2 ms returned sat
[2021-05-16 15:32:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 15:32:57] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2021-05-16 15:32:57] [INFO ] State equation strengthened by 30 read => feed constraints.
[2021-05-16 15:32:57] [INFO ] [Nat]Added 30 Read/Feed constraints in 3 ms returned sat
[2021-05-16 15:32:57] [INFO ] Computed and/alt/rep : 12/93/12 causal constraints (skipped 33 transitions) in 4 ms.
[2021-05-16 15:32:57] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 1 ms to minimize.
[2021-05-16 15:32:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 44 ms
[2021-05-16 15:32:57] [INFO ] Added : 4 causal constraints over 1 iterations in 58 ms. Result :sat
Minimization took 9 ms.
Current structural bounds on expressions (after SMT) : [3] Max seen :[2]
Incomplete Parikh walk after 3600 steps, including 501 resets, run finished after 11 ms. (steps per millisecond=327 ) properties (out of 1) seen :2 could not realise parikh vector
Support contains 3 out of 27 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 27/27 places, 48/48 transitions.
Applied a total of 0 rules in 1 ms. Remains 27 /27 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 27/27 places, 48/48 transitions.
Starting structural reductions, iteration 0 : 27/27 places, 48/48 transitions.
Applied a total of 0 rules in 2 ms. Remains 27 /27 variables (removed 0) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 27 cols
[2021-05-16 15:32:57] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 15:32:57] [INFO ] Implicit Places using invariants in 24 ms returned [1, 18, 21]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 25 ms to find 3 implicit places.
[2021-05-16 15:32:57] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 48 rows 24 cols
[2021-05-16 15:32:57] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-16 15:32:57] [INFO ] Dead Transitions using invariants and state equation in 44 ms returned []
Starting structural reductions, iteration 1 : 24/27 places, 48/48 transitions.
Free-agglomeration rule applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 24 transition count 45
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 6 place count 21 transition count 45
Applied a total of 6 rules in 4 ms. Remains 21 /24 variables (removed 3) and now considering 45/48 (removed 3) transitions.
// Phase 1: matrix 45 rows 21 cols
[2021-05-16 15:32:57] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-16 15:32:57] [INFO ] Implicit Places using invariants in 41 ms returned []
// Phase 1: matrix 45 rows 21 cols
[2021-05-16 15:32:57] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-16 15:32:57] [INFO ] State equation strengthened by 30 read => feed constraints.
[2021-05-16 15:32:57] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 21/27 places, 45/48 transitions.
// Phase 1: matrix 45 rows 21 cols
[2021-05-16 15:32:57] [INFO ] Computed 8 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 203587 resets, run finished after 975 ms. (steps per millisecond=1025 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000001 steps, including 66666 resets, run finished after 335 ms. (steps per millisecond=2985 ) properties (out of 1) seen :2
// Phase 1: matrix 45 rows 21 cols
[2021-05-16 15:32:59] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-16 15:32:59] [INFO ] [Real]Absence check using 5 positive place invariants in 23 ms returned sat
[2021-05-16 15:32:59] [INFO ] [Real]Absence check using 5 positive and 3 generalized place invariants in 23 ms returned sat
[2021-05-16 15:32:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:32:59] [INFO ] [Real]Absence check using state equation in 180 ms returned sat
[2021-05-16 15:32:59] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:32:59] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2021-05-16 15:32:59] [INFO ] [Nat]Absence check using 5 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-16 15:32:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 15:32:59] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2021-05-16 15:32:59] [INFO ] State equation strengthened by 30 read => feed constraints.
[2021-05-16 15:32:59] [INFO ] [Nat]Added 30 Read/Feed constraints in 26 ms returned sat
[2021-05-16 15:32:59] [INFO ] Computed and/alt/rep : 9/69/9 causal constraints (skipped 33 transitions) in 6 ms.
[2021-05-16 15:32:59] [INFO ] Added : 1 causal constraints over 1 iterations in 14 ms. Result :sat
Minimization took 8 ms.
Current structural bounds on expressions (after SMT) : [3] Max seen :[2]
Incomplete Parikh walk after 3300 steps, including 837 resets, run finished after 4 ms. (steps per millisecond=825 ) properties (out of 1) seen :2 could not realise parikh vector
Support contains 3 out of 21 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 21/21 places, 45/45 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 21/21 places, 45/45 transitions.
Starting structural reductions, iteration 0 : 21/21 places, 45/45 transitions.
Applied a total of 0 rules in 2 ms. Remains 21 /21 variables (removed 0) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 21 cols
[2021-05-16 15:32:59] [INFO ] Computed 8 place invariants in 0 ms
[2021-05-16 15:32:59] [INFO ] Implicit Places using invariants in 126 ms returned []
// Phase 1: matrix 45 rows 21 cols
[2021-05-16 15:32:59] [INFO ] Computed 8 place invariants in 0 ms
[2021-05-16 15:32:59] [INFO ] State equation strengthened by 30 read => feed constraints.
[2021-05-16 15:32:59] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 159 ms to find 0 implicit places.
[2021-05-16 15:32:59] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 45 rows 21 cols
[2021-05-16 15:32:59] [INFO ] Computed 8 place invariants in 0 ms
[2021-05-16 15:32:59] [INFO ] Dead Transitions using invariants and state equation in 54 ms returned []
Finished structural reductions, in 1 iterations. Remains : 21/21 places, 45/45 transitions.
Ending property specific reduction for PhilosophersDyn-PT-03-UpperBounds-02 in 4211 ms.
Starting property specific reduction for PhilosophersDyn-PT-03-UpperBounds-04
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 15:32:59] [INFO ] Computed 11 place invariants in 0 ms
Incomplete random walk after 10000 steps, including 1443 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 10001 steps, including 382 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :2
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 15:32:59] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 15:32:59] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-16 15:32:59] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 1 ms returned sat
[2021-05-16 15:32:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:32:59] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2021-05-16 15:32:59] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:32:59] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-16 15:32:59] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 1 ms returned sat
[2021-05-16 15:32:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 15:32:59] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2021-05-16 15:32:59] [INFO ] State equation strengthened by 30 read => feed constraints.
[2021-05-16 15:32:59] [INFO ] [Nat]Added 30 Read/Feed constraints in 2 ms returned sat
[2021-05-16 15:32:59] [INFO ] Deduced a trap composed of 7 places in 10 ms of which 0 ms to minimize.
[2021-05-16 15:32:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 15 ms
[2021-05-16 15:32:59] [INFO ] Computed and/alt/rep : 15/123/15 causal constraints (skipped 33 transitions) in 3 ms.
[2021-05-16 15:32:59] [INFO ] Added : 7 causal constraints over 2 iterations in 15 ms. Result :sat
Minimization took 12 ms.
Current structural bounds on expressions (after SMT) : [4] Max seen :[2]
Incomplete Parikh walk after 4100 steps, including 557 resets, run finished after 5 ms. (steps per millisecond=820 ) properties (out of 1) seen :2 could not realise parikh vector
Support contains 3 out of 30 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 15:32:59] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-16 15:32:59] [INFO ] Dead Transitions using invariants and state equation in 50 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 51/51 transitions.
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 15:33:00] [INFO ] Computed 11 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 143062 resets, run finished after 1004 ms. (steps per millisecond=996 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000001 steps, including 38270 resets, run finished after 370 ms. (steps per millisecond=2702 ) properties (out of 1) seen :2
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 15:33:01] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 15:33:01] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-16 15:33:01] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 1 ms returned sat
[2021-05-16 15:33:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:33:01] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2021-05-16 15:33:01] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:33:01] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-16 15:33:01] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 0 ms returned sat
[2021-05-16 15:33:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 15:33:01] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2021-05-16 15:33:01] [INFO ] State equation strengthened by 30 read => feed constraints.
[2021-05-16 15:33:01] [INFO ] [Nat]Added 30 Read/Feed constraints in 3 ms returned sat
[2021-05-16 15:33:01] [INFO ] Deduced a trap composed of 7 places in 11 ms of which 1 ms to minimize.
[2021-05-16 15:33:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 15 ms
[2021-05-16 15:33:01] [INFO ] Computed and/alt/rep : 15/123/15 causal constraints (skipped 33 transitions) in 5 ms.
[2021-05-16 15:33:01] [INFO ] Added : 7 causal constraints over 2 iterations in 37 ms. Result :sat
Minimization took 19 ms.
Current structural bounds on expressions (after SMT) : [4] Max seen :[2]
Incomplete Parikh walk after 4100 steps, including 552 resets, run finished after 5 ms. (steps per millisecond=820 ) properties (out of 1) seen :2 could not realise parikh vector
Support contains 3 out of 30 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 3 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 51/51 transitions.
Starting structural reductions, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 15:33:01] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 15:33:01] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 15:33:01] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 15:33:01] [INFO ] State equation strengthened by 30 read => feed constraints.
[2021-05-16 15:33:01] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
[2021-05-16 15:33:01] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 15:33:01] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-16 15:33:01] [INFO ] Dead Transitions using invariants and state equation in 37 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 51/51 transitions.
Ending property specific reduction for PhilosophersDyn-PT-03-UpperBounds-04 in 1911 ms.
Starting property specific reduction for PhilosophersDyn-PT-03-UpperBounds-06
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 15:33:01] [INFO ] Computed 11 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 1446 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 10000 steps, including 327 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :2
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 15:33:01] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-16 15:33:01] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-16 15:33:01] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 1 ms returned sat
[2021-05-16 15:33:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:33:01] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2021-05-16 15:33:01] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:33:01] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-16 15:33:01] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 1 ms returned sat
[2021-05-16 15:33:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 15:33:01] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2021-05-16 15:33:01] [INFO ] State equation strengthened by 30 read => feed constraints.
[2021-05-16 15:33:01] [INFO ] [Nat]Added 30 Read/Feed constraints in 20 ms returned sat
[2021-05-16 15:33:01] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 1 ms to minimize.
[2021-05-16 15:33:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 32 ms
[2021-05-16 15:33:01] [INFO ] Computed and/alt/rep : 15/123/15 causal constraints (skipped 33 transitions) in 3 ms.
[2021-05-16 15:33:01] [INFO ] Added : 7 causal constraints over 2 iterations in 26 ms. Result :sat
Minimization took 10 ms.
Current structural bounds on expressions (after SMT) : [3] Max seen :[2]
Incomplete Parikh walk after 5300 steps, including 641 resets, run finished after 7 ms. (steps per millisecond=757 ) properties (out of 1) seen :2 could not realise parikh vector
Support contains 3 out of 30 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 30/30 places, 51/51 transitions.
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 30 transition count 48
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 6 place count 27 transition count 48
Applied a total of 6 rules in 2 ms. Remains 27 /30 variables (removed 3) and now considering 48/51 (removed 3) transitions.
// Phase 1: matrix 48 rows 27 cols
[2021-05-16 15:33:01] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-16 15:33:01] [INFO ] Dead Transitions using invariants and state equation in 45 ms returned []
Finished structural reductions, in 1 iterations. Remains : 27/30 places, 48/51 transitions.
// Phase 1: matrix 48 rows 27 cols
[2021-05-16 15:33:01] [INFO ] Computed 11 place invariants in 9 ms
Incomplete random walk after 1000000 steps, including 146670 resets, run finished after 999 ms. (steps per millisecond=1001 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000001 steps, including 45498 resets, run finished after 424 ms. (steps per millisecond=2358 ) properties (out of 1) seen :2
// Phase 1: matrix 48 rows 27 cols
[2021-05-16 15:33:03] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 15:33:03] [INFO ] [Real]Absence check using 6 positive place invariants in 15 ms returned sat
[2021-05-16 15:33:03] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 1 ms returned sat
[2021-05-16 15:33:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:33:03] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2021-05-16 15:33:03] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:33:03] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-16 15:33:03] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 0 ms returned sat
[2021-05-16 15:33:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 15:33:03] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2021-05-16 15:33:03] [INFO ] State equation strengthened by 30 read => feed constraints.
[2021-05-16 15:33:03] [INFO ] [Nat]Added 30 Read/Feed constraints in 2 ms returned sat
[2021-05-16 15:33:03] [INFO ] Computed and/alt/rep : 12/93/12 causal constraints (skipped 33 transitions) in 3 ms.
[2021-05-16 15:33:03] [INFO ] Deduced a trap composed of 7 places in 9 ms of which 1 ms to minimize.
[2021-05-16 15:33:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 14 ms
[2021-05-16 15:33:03] [INFO ] Added : 4 causal constraints over 1 iterations in 27 ms. Result :sat
Minimization took 10 ms.
Current structural bounds on expressions (after SMT) : [3] Max seen :[2]
Incomplete Parikh walk after 3600 steps, including 502 resets, run finished after 7 ms. (steps per millisecond=514 ) properties (out of 1) seen :2 could not realise parikh vector
Support contains 3 out of 27 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 27/27 places, 48/48 transitions.
Applied a total of 0 rules in 1 ms. Remains 27 /27 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 27/27 places, 48/48 transitions.
Starting structural reductions, iteration 0 : 27/27 places, 48/48 transitions.
Applied a total of 0 rules in 2 ms. Remains 27 /27 variables (removed 0) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 27 cols
[2021-05-16 15:33:03] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 15:33:03] [INFO ] Implicit Places using invariants in 57 ms returned [1, 18, 21]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 60 ms to find 3 implicit places.
[2021-05-16 15:33:03] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 48 rows 24 cols
[2021-05-16 15:33:03] [INFO ] Computed 8 place invariants in 0 ms
[2021-05-16 15:33:03] [INFO ] Dead Transitions using invariants and state equation in 29 ms returned []
Starting structural reductions, iteration 1 : 24/27 places, 48/48 transitions.
Free-agglomeration rule applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 24 transition count 45
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 6 place count 21 transition count 45
Applied a total of 6 rules in 3 ms. Remains 21 /24 variables (removed 3) and now considering 45/48 (removed 3) transitions.
// Phase 1: matrix 45 rows 21 cols
[2021-05-16 15:33:03] [INFO ] Computed 8 place invariants in 0 ms
[2021-05-16 15:33:03] [INFO ] Implicit Places using invariants in 39 ms returned []
// Phase 1: matrix 45 rows 21 cols
[2021-05-16 15:33:03] [INFO ] Computed 8 place invariants in 0 ms
[2021-05-16 15:33:03] [INFO ] State equation strengthened by 30 read => feed constraints.
[2021-05-16 15:33:03] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 21/27 places, 45/48 transitions.
// Phase 1: matrix 45 rows 21 cols
[2021-05-16 15:33:03] [INFO ] Computed 8 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 203394 resets, run finished after 941 ms. (steps per millisecond=1062 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000001 steps, including 66666 resets, run finished after 288 ms. (steps per millisecond=3472 ) properties (out of 1) seen :2
// Phase 1: matrix 45 rows 21 cols
[2021-05-16 15:33:04] [INFO ] Computed 8 place invariants in 0 ms
[2021-05-16 15:33:04] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2021-05-16 15:33:04] [INFO ] [Real]Absence check using 5 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-16 15:33:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:33:04] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2021-05-16 15:33:04] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:33:04] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2021-05-16 15:33:04] [INFO ] [Nat]Absence check using 5 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-16 15:33:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 15:33:05] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2021-05-16 15:33:05] [INFO ] State equation strengthened by 30 read => feed constraints.
[2021-05-16 15:33:05] [INFO ] [Nat]Added 30 Read/Feed constraints in 3 ms returned sat
[2021-05-16 15:33:05] [INFO ] Computed and/alt/rep : 9/69/9 causal constraints (skipped 33 transitions) in 3 ms.
[2021-05-16 15:33:05] [INFO ] Added : 1 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 7 ms.
Current structural bounds on expressions (after SMT) : [3] Max seen :[2]
Incomplete Parikh walk after 3300 steps, including 818 resets, run finished after 4 ms. (steps per millisecond=825 ) properties (out of 1) seen :2 could not realise parikh vector
Support contains 3 out of 21 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 21/21 places, 45/45 transitions.
Applied a total of 0 rules in 2 ms. Remains 21 /21 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 21/21 places, 45/45 transitions.
Starting structural reductions, iteration 0 : 21/21 places, 45/45 transitions.
Applied a total of 0 rules in 2 ms. Remains 21 /21 variables (removed 0) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 21 cols
[2021-05-16 15:33:05] [INFO ] Computed 8 place invariants in 4 ms
[2021-05-16 15:33:05] [INFO ] Implicit Places using invariants in 36 ms returned []
// Phase 1: matrix 45 rows 21 cols
[2021-05-16 15:33:05] [INFO ] Computed 8 place invariants in 3 ms
[2021-05-16 15:33:05] [INFO ] State equation strengthened by 30 read => feed constraints.
[2021-05-16 15:33:05] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
[2021-05-16 15:33:05] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 45 rows 21 cols
[2021-05-16 15:33:05] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-16 15:33:05] [INFO ] Dead Transitions using invariants and state equation in 31 ms returned []
Finished structural reductions, in 1 iterations. Remains : 21/21 places, 45/45 transitions.
Ending property specific reduction for PhilosophersDyn-PT-03-UpperBounds-06 in 3499 ms.
Starting property specific reduction for PhilosophersDyn-PT-03-UpperBounds-14
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 15:33:05] [INFO ] Computed 11 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 1420 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10001 steps, including 305 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :1
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 15:33:05] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 15:33:05] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-16 15:33:05] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 1 ms returned sat
[2021-05-16 15:33:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:33:05] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2021-05-16 15:33:05] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:33:05] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-16 15:33:05] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 1 ms returned sat
[2021-05-16 15:33:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 15:33:05] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2021-05-16 15:33:05] [INFO ] State equation strengthened by 30 read => feed constraints.
[2021-05-16 15:33:05] [INFO ] [Nat]Added 30 Read/Feed constraints in 3 ms returned sat
[2021-05-16 15:33:05] [INFO ] Deduced a trap composed of 7 places in 419 ms of which 5 ms to minimize.
[2021-05-16 15:33:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 435 ms
[2021-05-16 15:33:05] [INFO ] Computed and/alt/rep : 15/123/15 causal constraints (skipped 33 transitions) in 14 ms.
[2021-05-16 15:33:05] [INFO ] Added : 9 causal constraints over 2 iterations in 29 ms. Result :sat
Minimization took 17 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[1]
Incomplete Parikh walk after 4800 steps, including 672 resets, run finished after 5 ms. (steps per millisecond=960 ) properties (out of 1) seen :1 could not realise parikh vector
Support contains 1 out of 30 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 30/30 places, 51/51 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 30 transition count 49
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 28 transition count 49
Applied a total of 4 rules in 4 ms. Remains 28 /30 variables (removed 2) and now considering 49/51 (removed 2) transitions.
// Phase 1: matrix 49 rows 28 cols
[2021-05-16 15:33:05] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 15:33:05] [INFO ] Dead Transitions using invariants and state equation in 48 ms returned []
Finished structural reductions, in 1 iterations. Remains : 28/30 places, 49/51 transitions.
// Phase 1: matrix 49 rows 28 cols
[2021-05-16 15:33:05] [INFO ] Computed 11 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 142868 resets, run finished after 1015 ms. (steps per millisecond=985 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000000 steps, including 30794 resets, run finished after 351 ms. (steps per millisecond=2849 ) properties (out of 1) seen :1
// Phase 1: matrix 49 rows 28 cols
[2021-05-16 15:33:07] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 15:33:07] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-16 15:33:07] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 57 ms returned sat
[2021-05-16 15:33:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:33:07] [INFO ] [Real]Absence check using state equation in 133 ms returned sat
[2021-05-16 15:33:07] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:33:07] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-16 15:33:07] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 1 ms returned sat
[2021-05-16 15:33:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 15:33:07] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2021-05-16 15:33:07] [INFO ] State equation strengthened by 30 read => feed constraints.
[2021-05-16 15:33:07] [INFO ] [Nat]Added 30 Read/Feed constraints in 2 ms returned sat
[2021-05-16 15:33:07] [INFO ] Computed and/alt/rep : 13/103/13 causal constraints (skipped 33 transitions) in 3 ms.
[2021-05-16 15:33:07] [INFO ] Added : 5 causal constraints over 1 iterations in 24 ms. Result :sat
Minimization took 16 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[1]
Incomplete Parikh walk after 3600 steps, including 535 resets, run finished after 6 ms. (steps per millisecond=600 ) properties (out of 1) seen :1 could not realise parikh vector
Support contains 1 out of 28 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 28/28 places, 49/49 transitions.
Applied a total of 0 rules in 2 ms. Remains 28 /28 variables (removed 0) and now considering 49/49 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 28/28 places, 49/49 transitions.
Starting structural reductions, iteration 0 : 28/28 places, 49/49 transitions.
Applied a total of 0 rules in 2 ms. Remains 28 /28 variables (removed 0) and now considering 49/49 (removed 0) transitions.
// Phase 1: matrix 49 rows 28 cols
[2021-05-16 15:33:07] [INFO ] Computed 11 place invariants in 4 ms
[2021-05-16 15:33:07] [INFO ] Implicit Places using invariants in 35 ms returned [1, 18]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 49 ms to find 2 implicit places.
[2021-05-16 15:33:07] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 49 rows 26 cols
[2021-05-16 15:33:07] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-16 15:33:07] [INFO ] Dead Transitions using invariants and state equation in 45 ms returned []
Starting structural reductions, iteration 1 : 26/28 places, 49/49 transitions.
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 26 transition count 47
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 24 transition count 47
Applied a total of 4 rules in 6 ms. Remains 24 /26 variables (removed 2) and now considering 47/49 (removed 2) transitions.
// Phase 1: matrix 47 rows 24 cols
[2021-05-16 15:33:07] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-16 15:33:07] [INFO ] Implicit Places using invariants in 41 ms returned []
// Phase 1: matrix 47 rows 24 cols
[2021-05-16 15:33:07] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-16 15:33:07] [INFO ] State equation strengthened by 30 read => feed constraints.
[2021-05-16 15:33:07] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 24/28 places, 47/49 transitions.
// Phase 1: matrix 47 rows 24 cols
[2021-05-16 15:33:07] [INFO ] Computed 9 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 176261 resets, run finished after 916 ms. (steps per millisecond=1091 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000000 steps, including 41793 resets, run finished after 313 ms. (steps per millisecond=3194 ) properties (out of 1) seen :1
// Phase 1: matrix 47 rows 24 cols
[2021-05-16 15:33:09] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-16 15:33:09] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-16 15:33:09] [INFO ] [Real]Absence check using 6 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-16 15:33:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:33:09] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2021-05-16 15:33:09] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:33:09] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-16 15:33:09] [INFO ] [Nat]Absence check using 6 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-16 15:33:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 15:33:09] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2021-05-16 15:33:09] [INFO ] State equation strengthened by 30 read => feed constraints.
[2021-05-16 15:33:09] [INFO ] [Nat]Added 30 Read/Feed constraints in 4 ms returned sat
[2021-05-16 15:33:09] [INFO ] Computed and/alt/rep : 11/87/11 causal constraints (skipped 33 transitions) in 3 ms.
[2021-05-16 15:33:09] [INFO ] Added : 6 causal constraints over 2 iterations in 27 ms. Result :sat
Minimization took 18 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[1]
Incomplete Parikh walk after 3100 steps, including 443 resets, run finished after 4 ms. (steps per millisecond=775 ) properties (out of 1) seen :1 could not realise parikh vector
Support contains 1 out of 24 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 24/24 places, 47/47 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 47/47 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 24/24 places, 47/47 transitions.
Starting structural reductions, iteration 0 : 24/24 places, 47/47 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 47/47 (removed 0) transitions.
// Phase 1: matrix 47 rows 24 cols
[2021-05-16 15:33:09] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-16 15:33:09] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 47 rows 24 cols
[2021-05-16 15:33:09] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-16 15:33:09] [INFO ] State equation strengthened by 30 read => feed constraints.
[2021-05-16 15:33:09] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
[2021-05-16 15:33:09] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 47 rows 24 cols
[2021-05-16 15:33:09] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-16 15:33:09] [INFO ] Dead Transitions using invariants and state equation in 36 ms returned []
Finished structural reductions, in 1 iterations. Remains : 24/24 places, 47/47 transitions.
Ending property specific reduction for PhilosophersDyn-PT-03-UpperBounds-14 in 4153 ms.
Starting property specific reduction for PhilosophersDyn-PT-03-UpperBounds-15
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 15:33:09] [INFO ] Computed 11 place invariants in 0 ms
Incomplete random walk after 10000 steps, including 1427 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10001 steps, including 306 resets, run finished after 4 ms. (steps per millisecond=2500 ) properties (out of 1) seen :1
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 15:33:09] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-16 15:33:09] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-16 15:33:09] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 1 ms returned sat
[2021-05-16 15:33:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:33:09] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2021-05-16 15:33:09] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:33:09] [INFO ] [Nat]Absence check using 6 positive place invariants in 26 ms returned sat
[2021-05-16 15:33:09] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 1 ms returned sat
[2021-05-16 15:33:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 15:33:09] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2021-05-16 15:33:09] [INFO ] State equation strengthened by 30 read => feed constraints.
[2021-05-16 15:33:09] [INFO ] [Nat]Added 30 Read/Feed constraints in 3 ms returned sat
[2021-05-16 15:33:09] [INFO ] Deduced a trap composed of 7 places in 16 ms of which 1 ms to minimize.
[2021-05-16 15:33:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 22 ms
[2021-05-16 15:33:09] [INFO ] Computed and/alt/rep : 15/123/15 causal constraints (skipped 33 transitions) in 3 ms.
[2021-05-16 15:33:09] [INFO ] Added : 9 causal constraints over 2 iterations in 16 ms. Result :sat
Minimization took 16 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[1]
Incomplete Parikh walk after 4600 steps, including 589 resets, run finished after 5 ms. (steps per millisecond=920 ) properties (out of 1) seen :1 could not realise parikh vector
Support contains 1 out of 30 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 30/30 places, 51/51 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 30 transition count 49
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 28 transition count 49
Applied a total of 4 rules in 8 ms. Remains 28 /30 variables (removed 2) and now considering 49/51 (removed 2) transitions.
// Phase 1: matrix 49 rows 28 cols
[2021-05-16 15:33:09] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 15:33:09] [INFO ] Dead Transitions using invariants and state equation in 25 ms returned []
Finished structural reductions, in 1 iterations. Remains : 28/30 places, 49/51 transitions.
// Phase 1: matrix 49 rows 28 cols
[2021-05-16 15:33:09] [INFO ] Computed 11 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 143014 resets, run finished after 987 ms. (steps per millisecond=1013 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 30664 resets, run finished after 315 ms. (steps per millisecond=3174 ) properties (out of 1) seen :1
// Phase 1: matrix 49 rows 28 cols
[2021-05-16 15:33:10] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-16 15:33:10] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2021-05-16 15:33:10] [INFO ] [Real]Absence check using 7 positive and 4 generalized place invariants in 2 ms returned sat
[2021-05-16 15:33:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:33:10] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2021-05-16 15:33:10] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:33:11] [INFO ] [Nat]Absence check using 7 positive place invariants in 15 ms returned sat
[2021-05-16 15:33:11] [INFO ] [Nat]Absence check using 7 positive and 4 generalized place invariants in 1 ms returned sat
[2021-05-16 15:33:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 15:33:11] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2021-05-16 15:33:11] [INFO ] State equation strengthened by 30 read => feed constraints.
[2021-05-16 15:33:11] [INFO ] [Nat]Added 30 Read/Feed constraints in 7 ms returned sat
[2021-05-16 15:33:11] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
[2021-05-16 15:33:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 31 ms
[2021-05-16 15:33:11] [INFO ] Computed and/alt/rep : 13/103/13 causal constraints (skipped 33 transitions) in 2 ms.
[2021-05-16 15:33:11] [INFO ] Added : 7 causal constraints over 2 iterations in 17 ms. Result :sat
Minimization took 13 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[1]
Incomplete Parikh walk after 3900 steps, including 519 resets, run finished after 14 ms. (steps per millisecond=278 ) properties (out of 1) seen :1 could not realise parikh vector
Support contains 1 out of 28 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 28/28 places, 49/49 transitions.
Applied a total of 0 rules in 11 ms. Remains 28 /28 variables (removed 0) and now considering 49/49 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 28/28 places, 49/49 transitions.
Starting structural reductions, iteration 0 : 28/28 places, 49/49 transitions.
Applied a total of 0 rules in 1 ms. Remains 28 /28 variables (removed 0) and now considering 49/49 (removed 0) transitions.
// Phase 1: matrix 49 rows 28 cols
[2021-05-16 15:33:11] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-16 15:33:11] [INFO ] Implicit Places using invariants in 42 ms returned [1, 22]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 53 ms to find 2 implicit places.
[2021-05-16 15:33:11] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 49 rows 26 cols
[2021-05-16 15:33:11] [INFO ] Computed 9 place invariants in 2 ms
[2021-05-16 15:33:11] [INFO ] Dead Transitions using invariants and state equation in 61 ms returned []
Starting structural reductions, iteration 1 : 26/28 places, 49/49 transitions.
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 26 transition count 47
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 24 transition count 47
Applied a total of 4 rules in 4 ms. Remains 24 /26 variables (removed 2) and now considering 47/49 (removed 2) transitions.
// Phase 1: matrix 47 rows 24 cols
[2021-05-16 15:33:11] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-16 15:33:11] [INFO ] Implicit Places using invariants in 42 ms returned []
// Phase 1: matrix 47 rows 24 cols
[2021-05-16 15:33:11] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-16 15:33:11] [INFO ] State equation strengthened by 30 read => feed constraints.
[2021-05-16 15:33:11] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 24/28 places, 47/49 transitions.
// Phase 1: matrix 47 rows 24 cols
[2021-05-16 15:33:11] [INFO ] Computed 9 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 176031 resets, run finished after 925 ms. (steps per millisecond=1081 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 41734 resets, run finished after 268 ms. (steps per millisecond=3731 ) properties (out of 1) seen :1
// Phase 1: matrix 47 rows 24 cols
[2021-05-16 15:33:12] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-16 15:33:12] [INFO ] [Real]Absence check using 4 positive place invariants in 0 ms returned sat
[2021-05-16 15:33:12] [INFO ] [Real]Absence check using 4 positive and 5 generalized place invariants in 2 ms returned sat
[2021-05-16 15:33:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:33:12] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2021-05-16 15:33:12] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:33:12] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2021-05-16 15:33:12] [INFO ] [Nat]Absence check using 4 positive and 5 generalized place invariants in 2 ms returned sat
[2021-05-16 15:33:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 15:33:12] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2021-05-16 15:33:12] [INFO ] State equation strengthened by 30 read => feed constraints.
[2021-05-16 15:33:12] [INFO ] [Nat]Added 30 Read/Feed constraints in 4 ms returned sat
[2021-05-16 15:33:12] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 0 ms to minimize.
[2021-05-16 15:33:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 27 ms
[2021-05-16 15:33:12] [INFO ] Computed and/alt/rep : 11/87/11 causal constraints (skipped 33 transitions) in 4 ms.
[2021-05-16 15:33:12] [INFO ] Added : 4 causal constraints over 1 iterations in 25 ms. Result :sat
Minimization took 25 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[1]
Incomplete Parikh walk after 2200 steps, including 391 resets, run finished after 3 ms. (steps per millisecond=733 ) properties (out of 1) seen :1 could not realise parikh vector
Support contains 1 out of 24 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 24/24 places, 47/47 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 47/47 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 24/24 places, 47/47 transitions.
Starting structural reductions, iteration 0 : 24/24 places, 47/47 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 47/47 (removed 0) transitions.
// Phase 1: matrix 47 rows 24 cols
[2021-05-16 15:33:12] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-16 15:33:12] [INFO ] Implicit Places using invariants in 29 ms returned []
// Phase 1: matrix 47 rows 24 cols
[2021-05-16 15:33:12] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-16 15:33:12] [INFO ] State equation strengthened by 30 read => feed constraints.
[2021-05-16 15:33:12] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 149 ms to find 0 implicit places.
[2021-05-16 15:33:12] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 47 rows 24 cols
[2021-05-16 15:33:12] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-16 15:33:12] [INFO ] Dead Transitions using invariants and state equation in 30 ms returned []
Finished structural reductions, in 1 iterations. Remains : 24/24 places, 47/47 transitions.
Ending property specific reduction for PhilosophersDyn-PT-03-UpperBounds-15 in 3573 ms.
[2021-05-16 15:33:13] [INFO ] Flatten gal took : 101 ms
[2021-05-16 15:33:13] [INFO ] Applying decomposition
[2021-05-16 15:33:13] [INFO ] Flatten gal took : 9 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/graph12271711182697791957.txt, -o, /tmp/graph12271711182697791957.bin, -w, /tmp/graph12271711182697791957.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/graph12271711182697791957.bin, -l, -1, -v, -w, /tmp/graph12271711182697791957.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-16 15:33:13] [INFO ] Decomposing Gal with order
[2021-05-16 15:33:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-16 15:33:13] [INFO ] Removed a total of 107 redundant transitions.
[2021-05-16 15:33:13] [INFO ] Flatten gal took : 34 ms
[2021-05-16 15:33:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2021-05-16 15:33:13] [INFO ] Time to serialize gal into /tmp/UpperBounds5195616686093732134.gal : 6 ms
[2021-05-16 15:33:13] [INFO ] Time to serialize properties into /tmp/UpperBounds8429858624505978312.prop : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds5195616686093732134.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds8429858624505978312.prop, --nowitness, --gen-order, FOLLOW], 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/UpperBounds5195616686093732134.gal -t CGAL -reachable-file /tmp/UpperBounds8429858624505978312.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/UpperBounds8429858624505978312.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\_flatf,325,0.042322,4360,2,473,5,2185,6,0,180,1911,0
Total reachable state count : 325

Verifying 6 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 2
Bounds property PhilosophersDyn-PT-03-UpperBounds-01 :0 <= gi1.gu3.HasLeft_2+gi0.gu4.HasLeft_3+gi2.gu8.HasLeft_1 <= 2
FORMULA PhilosophersDyn-PT-03-UpperBounds-01 2 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
PhilosophersDyn-PT-03-UpperBounds-01,0,0.055597,4360,1,0,7,2185,9,1,271,1911,4
Min sum of variable value : 0
Maximum sum along a path : 2
Bounds property PhilosophersDyn-PT-03-UpperBounds-02 :0 <= gi1.gu0.HasRight_2+gi2.gu6.HasRight_1+gi0.gu7.HasRight_3 <= 2
FORMULA PhilosophersDyn-PT-03-UpperBounds-02 2 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
PhilosophersDyn-PT-03-UpperBounds-02,0,0.056136,4360,1,0,8,2185,10,1,332,1911,5
Min sum of variable value : 0
Maximum sum along a path : 2
Bounds property PhilosophersDyn-PT-03-UpperBounds-04 :0 <= gi1.gu3.HasLeft_2+gi0.gu4.HasLeft_3+gi2.gu8.HasLeft_1 <= 2
FORMULA PhilosophersDyn-PT-03-UpperBounds-04 2 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
PhilosophersDyn-PT-03-UpperBounds-04,0,0.056192,4360,1,0,8,2185,10,1,332,1911,5
Min sum of variable value : 0
Maximum sum along a path : 2
Bounds property PhilosophersDyn-PT-03-UpperBounds-06 :0 <= gi1.gu0.HasRight_2+gi2.gu6.HasRight_1+gi0.gu7.HasRight_3 <= 2
FORMULA PhilosophersDyn-PT-03-UpperBounds-06 2 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
PhilosophersDyn-PT-03-UpperBounds-06,0,0.056244,4360,1,0,8,2185,10,1,332,1911,5
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property PhilosophersDyn-PT-03-UpperBounds-14 :0 <= gi2.gu8.Forks_1 <= 1
FORMULA PhilosophersDyn-PT-03-UpperBounds-14 1 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
PhilosophersDyn-PT-03-UpperBounds-14,0,0.056612,4360,1,0,9,2185,11,1,379,1911,6
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property PhilosophersDyn-PT-03-UpperBounds-15 :0 <= gi0.gu4.Forks_3 <= 1
FORMULA PhilosophersDyn-PT-03-UpperBounds-15 1 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
PhilosophersDyn-PT-03-UpperBounds-15,0,0.056714,4360,1,0,10,2185,12,1,398,1911,7

BK_STOP 1621179195336

--------------------
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="PhilosophersDyn-PT-03"
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 PhilosophersDyn-PT-03, 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 r159-oct2-162089267700043"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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