About the Execution of Marcie+red for PhilosophersDyn-PT-03
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 5448.951 | 26106.00 | 25329.00 | 5797.30 | 3 3 3 3 2 3 3 3 1 1 1 1 1 1 1 1 | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r298-tall-167873951600317.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
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 r298-tall-167873951600317
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 692K
-rw-r--r-- 1 mcc users 10K Feb 26 12:07 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Feb 26 12:07 CTLCardinality.xml
-rw-r--r-- 1 mcc users 15K Feb 26 12:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 92K Feb 26 12:07 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 16:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Feb 25 16:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 25 16:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 31K Feb 25 16:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Feb 26 12:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 128K Feb 26 12:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 21K Feb 26 12:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 117K Feb 26 12:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:33 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.6K Feb 25 16:33 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 87K Mar 5 18:23 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 1679508594917
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PhilosophersDyn-PT-03
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 18:09:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-22 18:09:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 18:09:56] [INFO ] Load time of PNML (sax parser for PT used): 43 ms
[2023-03-22 18:09:56] [INFO ] Transformed 30 places.
[2023-03-22 18:09:56] [INFO ] Transformed 84 transitions.
[2023-03-22 18:09:56] [INFO ] Parsed PT model containing 30 places and 84 transitions and 564 arcs in 100 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 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
[2023-03-22 18:09:56] [INFO ] Computed 11 place invariants in 10 ms
FORMULA PhilosophersDyn-PT-03-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-PT-03-UpperBounds-06 3 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-PT-03-UpperBounds-01 3 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 1425 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 13) seen :24
FORMULA PhilosophersDyn-PT-03-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PhilosophersDyn-PT-03-UpperBounds-14 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
FORMULA PhilosophersDyn-PT-03-UpperBounds-05 3 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PhilosophersDyn-PT-03-UpperBounds-03 3 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PhilosophersDyn-PT-03-UpperBounds-02 3 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 261 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :6
Incomplete Best-First random walk after 10000 steps, including 338 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 3) seen :6
Incomplete Best-First random walk after 10000 steps, including 304 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 3) seen :6
[2023-03-22 18:09:56] [INFO ] Flow matrix only has 57 transitions (discarded 24 similar events)
// Phase 1: matrix 57 rows 30 cols
[2023-03-22 18:09:56] [INFO ] Computed 11 place invariants in 3 ms
[2023-03-22 18:09:56] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2023-03-22 18:09:56] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 2 ms returned unsat
[2023-03-22 18:09:56] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-22 18:09:56] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-22 18:09:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 18:09:56] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2023-03-22 18:09:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 18:09:56] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-22 18:09:56] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-22 18:09:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 18:09:56] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2023-03-22 18:09:56] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-22 18:09:56] [INFO ] [Nat]Added 36 Read/Feed constraints in 7 ms returned sat
[2023-03-22 18:09:56] [INFO ] Computed and/alt/rep : 6/45/6 causal constraints (skipped 48 transitions) in 8 ms.
[2023-03-22 18:09:56] [INFO ] Added : 0 causal constraints over 0 iterations in 17 ms. Result :sat
Minimization took 15 ms.
[2023-03-22 18:09:56] [INFO ] [Real]Absence check using 8 positive place invariants in 11 ms returned sat
[2023-03-22 18:09:56] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-22 18:09:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 18:09:56] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-22 18:09:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 18:09:57] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-22 18:09:57] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-22 18:09:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 18:09:57] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2023-03-22 18:09:57] [INFO ] [Nat]Added 36 Read/Feed constraints in 4 ms returned sat
[2023-03-22 18:09:57] [INFO ] Computed and/alt/rep : 6/45/6 causal constraints (skipped 48 transitions) in 8 ms.
[2023-03-22 18:09:57] [INFO ] Added : 5 causal constraints over 3 iterations in 32 ms. Result :sat
Minimization took 19 ms.
Current structural bounds on expressions (after SMT) : [3, 3, -1] Max seen :[3, 2, 1]
FORMULA PhilosophersDyn-PT-03-UpperBounds-00 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 4 out of 30 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 81/81 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 79
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 79
Applied a total of 4 rules in 33 ms. Remains 28 /30 variables (removed 2) and now considering 79/81 (removed 2) transitions.
[2023-03-22 18:09:57] [INFO ] Flow matrix only has 55 transitions (discarded 24 similar events)
// Phase 1: matrix 55 rows 28 cols
[2023-03-22 18:09:57] [INFO ] Computed 11 place invariants in 1 ms
[2023-03-22 18:09:57] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 30 transitions.
Found 30 dead transitions using SMT.
Drop transitions removed 30 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 30 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 28/30 places, 49/81 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 REACHABILITY mode , in 1 iterations and 86 ms. Remains : 28/30 places, 49/81 transitions.
// Phase 1: matrix 49 rows 28 cols
[2023-03-22 18:09:57] [INFO ] Computed 11 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 142645 resets, run finished after 1282 ms. (steps per millisecond=780 ) properties (out of 2) seen :3
Incomplete Best-First random walk after 1000001 steps, including 42821 resets, run finished after 494 ms. (steps per millisecond=2024 ) properties (out of 2) seen :3
Incomplete Best-First random walk after 1000001 steps, including 30699 resets, run finished after 460 ms. (steps per millisecond=2173 ) properties (out of 2) seen :3
[2023-03-22 18:09:59] [INFO ] Invariant cache hit.
[2023-03-22 18:09:59] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2023-03-22 18:09:59] [INFO ] [Real]Absence check using 7 positive and 4 generalized place invariants in 2 ms returned sat
[2023-03-22 18:09:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 18:09:59] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2023-03-22 18:09:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 18:09:59] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2023-03-22 18:09:59] [INFO ] [Nat]Absence check using 7 positive and 4 generalized place invariants in 2 ms returned sat
[2023-03-22 18:09:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 18:09:59] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2023-03-22 18:09:59] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-22 18:09:59] [INFO ] [Nat]Added 30 Read/Feed constraints in 5 ms returned sat
[2023-03-22 18:09:59] [INFO ] Computed and/alt/rep : 13/103/13 causal constraints (skipped 33 transitions) in 16 ms.
[2023-03-22 18:09:59] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 3 ms to minimize.
[2023-03-22 18:09:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 36 ms
[2023-03-22 18:09:59] [INFO ] Added : 5 causal constraints over 2 iterations in 82 ms. Result :sat
Minimization took 13 ms.
[2023-03-22 18:09:59] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2023-03-22 18:09:59] [INFO ] [Real]Absence check using 7 positive and 4 generalized place invariants in 1 ms returned sat
[2023-03-22 18:09:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 18:09:59] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-22 18:09:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 18:09:59] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2023-03-22 18:09:59] [INFO ] [Nat]Absence check using 7 positive and 4 generalized place invariants in 1 ms returned sat
[2023-03-22 18:09:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 18:09:59] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2023-03-22 18:09:59] [INFO ] [Nat]Added 30 Read/Feed constraints in 4 ms returned sat
[2023-03-22 18:09:59] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 0 ms to minimize.
[2023-03-22 18:09:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 56 ms
[2023-03-22 18:09:59] [INFO ] Computed and/alt/rep : 13/103/13 causal constraints (skipped 33 transitions) in 5 ms.
[2023-03-22 18:09:59] [INFO ] Added : 5 causal constraints over 1 iterations in 20 ms. Result :sat
Minimization took 23 ms.
Current structural bounds on expressions (after SMT) : [3, -1] Max seen :[2, 1]
Support contains 4 out of 28 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 28/28 places, 49/49 transitions.
Applied a total of 0 rules in 3 ms. Remains 28 /28 variables (removed 0) and now considering 49/49 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 28/28 places, 49/49 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 28/28 places, 49/49 transitions.
Applied a total of 0 rules in 4 ms. Remains 28 /28 variables (removed 0) and now considering 49/49 (removed 0) transitions.
[2023-03-22 18:09:59] [INFO ] Invariant cache hit.
[2023-03-22 18:09:59] [INFO ] Implicit Places using invariants in 75 ms returned [19, 22]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 76 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, 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 5 ms. Remains 24 /26 variables (removed 2) and now considering 47/49 (removed 2) transitions.
// Phase 1: matrix 47 rows 24 cols
[2023-03-22 18:09:59] [INFO ] Computed 9 place invariants in 0 ms
[2023-03-22 18:09:59] [INFO ] Implicit Places using invariants in 43 ms returned []
[2023-03-22 18:09:59] [INFO ] Invariant cache hit.
[2023-03-22 18:10:00] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-22 18:10:00] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 24/28 places, 47/49 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 210 ms. Remains : 24/28 places, 47/49 transitions.
[2023-03-22 18:10:00] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 176458 resets, run finished after 1138 ms. (steps per millisecond=878 ) properties (out of 2) seen :3
Incomplete Best-First random walk after 1000001 steps, including 58836 resets, run finished after 306 ms. (steps per millisecond=3267 ) properties (out of 2) seen :3
Incomplete Best-First random walk after 1000001 steps, including 41968 resets, run finished after 347 ms. (steps per millisecond=2881 ) properties (out of 2) seen :3
[2023-03-22 18:10:01] [INFO ] Invariant cache hit.
[2023-03-22 18:10:01] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-22 18:10:01] [INFO ] [Real]Absence check using 6 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-22 18:10:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 18:10:01] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-22 18:10:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 18:10:01] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-22 18:10:01] [INFO ] [Nat]Absence check using 6 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-22 18:10:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 18:10:01] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2023-03-22 18:10:01] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-22 18:10:01] [INFO ] [Nat]Added 30 Read/Feed constraints in 4 ms returned sat
[2023-03-22 18:10:01] [INFO ] Computed and/alt/rep : 11/87/11 causal constraints (skipped 33 transitions) in 4 ms.
[2023-03-22 18:10:01] [INFO ] Added : 1 causal constraints over 1 iterations in 10 ms. Result :sat
Minimization took 8 ms.
[2023-03-22 18:10:01] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-22 18:10:01] [INFO ] [Real]Absence check using 6 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-22 18:10:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 18:10:01] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-22 18:10:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 18:10:01] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-22 18:10:01] [INFO ] [Nat]Absence check using 6 positive and 3 generalized place invariants in 0 ms returned sat
[2023-03-22 18:10:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 18:10:01] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2023-03-22 18:10:01] [INFO ] [Nat]Added 30 Read/Feed constraints in 4 ms returned sat
[2023-03-22 18:10:02] [INFO ] Computed and/alt/rep : 11/87/11 causal constraints (skipped 33 transitions) in 3 ms.
[2023-03-22 18:10:02] [INFO ] Added : 3 causal constraints over 1 iterations in 11 ms. Result :sat
Minimization took 12 ms.
Current structural bounds on expressions (after SMT) : [3, -1] Max seen :[2, 1]
Support contains 4 out of 24 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 24/24 places, 47/47 transitions.
Applied a total of 0 rules in 2 ms. Remains 24 /24 variables (removed 0) and now considering 47/47 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 24/24 places, 47/47 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 24/24 places, 47/47 transitions.
Applied a total of 0 rules in 4 ms. Remains 24 /24 variables (removed 0) and now considering 47/47 (removed 0) transitions.
[2023-03-22 18:10:02] [INFO ] Invariant cache hit.
[2023-03-22 18:10:02] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-22 18:10:02] [INFO ] Invariant cache hit.
[2023-03-22 18:10:02] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-22 18:10:02] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
[2023-03-22 18:10:02] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 18:10:02] [INFO ] Invariant cache hit.
[2023-03-22 18:10:02] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 129 ms. Remains : 24/24 places, 47/47 transitions.
Starting property specific reduction for PhilosophersDyn-PT-03-UpperBounds-04
[2023-03-22 18:10:02] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 1784 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 589 resets, run finished after 4 ms. (steps per millisecond=2500 ) properties (out of 1) seen :2
[2023-03-22 18:10:02] [INFO ] Invariant cache hit.
[2023-03-22 18:10:02] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-22 18:10:02] [INFO ] [Real]Absence check using 6 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-22 18:10:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 18:10:02] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-22 18:10:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 18:10:02] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-22 18:10:02] [INFO ] [Nat]Absence check using 6 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-22 18:10:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 18:10:02] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2023-03-22 18:10:02] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-22 18:10:02] [INFO ] [Nat]Added 30 Read/Feed constraints in 4 ms returned sat
[2023-03-22 18:10:02] [INFO ] Computed and/alt/rep : 11/87/11 causal constraints (skipped 33 transitions) in 4 ms.
[2023-03-22 18:10:02] [INFO ] Added : 1 causal constraints over 1 iterations in 11 ms. Result :sat
Minimization took 9 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[2]
Support contains 3 out of 24 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 24/24 places, 47/47 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 24 transition count 46
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 23 transition count 46
Applied a total of 2 rules in 5 ms. Remains 23 /24 variables (removed 1) and now considering 46/47 (removed 1) transitions.
// Phase 1: matrix 46 rows 23 cols
[2023-03-22 18:10:02] [INFO ] Computed 9 place invariants in 2 ms
[2023-03-22 18:10:02] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 23/24 places, 46/47 transitions.
[2023-03-22 18:10:02] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 178595 resets, run finished after 1095 ms. (steps per millisecond=913 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000001 steps, including 58818 resets, run finished after 310 ms. (steps per millisecond=3225 ) properties (out of 1) seen :2
[2023-03-22 18:10:03] [INFO ] Invariant cache hit.
[2023-03-22 18:10:03] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2023-03-22 18:10:03] [INFO ] [Real]Absence check using 6 positive and 3 generalized place invariants in 0 ms returned sat
[2023-03-22 18:10:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 18:10:03] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-22 18:10:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 18:10:03] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-22 18:10:03] [INFO ] [Nat]Absence check using 6 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-22 18:10:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 18:10:03] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2023-03-22 18:10:03] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-22 18:10:03] [INFO ] [Nat]Added 30 Read/Feed constraints in 6 ms returned sat
[2023-03-22 18:10:03] [INFO ] Computed and/alt/rep : 10/77/10 causal constraints (skipped 33 transitions) in 3 ms.
[2023-03-22 18:10:03] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 2 ms to minimize.
[2023-03-22 18:10:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 43 ms
[2023-03-22 18:10:03] [INFO ] Added : 3 causal constraints over 2 iterations in 58 ms. Result :sat
Minimization took 11 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[2]
Support contains 3 out of 23 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 23/23 places, 46/46 transitions.
Applied a total of 0 rules in 2 ms. Remains 23 /23 variables (removed 0) and now considering 46/46 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 23/23 places, 46/46 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 23/23 places, 46/46 transitions.
Applied a total of 0 rules in 1 ms. Remains 23 /23 variables (removed 0) and now considering 46/46 (removed 0) transitions.
[2023-03-22 18:10:03] [INFO ] Invariant cache hit.
[2023-03-22 18:10:03] [INFO ] Implicit Places using invariants in 33 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 33 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 22/23 places, 46/46 transitions.
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 22 transition count 45
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 21 transition count 45
Applied a total of 2 rules in 4 ms. Remains 21 /22 variables (removed 1) and now considering 45/46 (removed 1) transitions.
// Phase 1: matrix 45 rows 21 cols
[2023-03-22 18:10:03] [INFO ] Computed 8 place invariants in 1 ms
[2023-03-22 18:10:03] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-22 18:10:03] [INFO ] Invariant cache hit.
[2023-03-22 18:10:04] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-22 18:10:04] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 21/23 places, 45/46 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 121 ms. Remains : 21/23 places, 45/46 transitions.
[2023-03-22 18:10:04] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 203597 resets, run finished after 1037 ms. (steps per millisecond=964 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000001 steps, including 66666 resets, run finished after 311 ms. (steps per millisecond=3215 ) properties (out of 1) seen :2
[2023-03-22 18:10:05] [INFO ] Invariant cache hit.
[2023-03-22 18:10:05] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-22 18:10:05] [INFO ] [Real]Absence check using 5 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-22 18:10:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 18:10:05] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-22 18:10:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 18:10:05] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-22 18:10:05] [INFO ] [Nat]Absence check using 5 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-22 18:10:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 18:10:05] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2023-03-22 18:10:05] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-22 18:10:05] [INFO ] [Nat]Added 30 Read/Feed constraints in 9 ms returned sat
[2023-03-22 18:10:05] [INFO ] Computed and/alt/rep : 9/69/9 causal constraints (skipped 33 transitions) in 6 ms.
[2023-03-22 18:10:05] [INFO ] Added : 0 causal constraints over 0 iterations in 11 ms. Result :sat
Minimization took 9 ms.
Current structural bounds on expressions (after SMT) : [3] Max seen :[2]
Support contains 3 out of 21 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, 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 REACHABILITY mode , in 1 iterations and 2 ms. Remains : 21/21 places, 45/45 transitions.
Starting structural reductions in REACHABILITY mode, 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.
[2023-03-22 18:10:05] [INFO ] Invariant cache hit.
[2023-03-22 18:10:05] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-22 18:10:05] [INFO ] Invariant cache hit.
[2023-03-22 18:10:05] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-22 18:10:05] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
[2023-03-22 18:10:05] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-22 18:10:05] [INFO ] Invariant cache hit.
[2023-03-22 18:10:05] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 130 ms. Remains : 21/21 places, 45/45 transitions.
Ending property specific reduction for PhilosophersDyn-PT-03-UpperBounds-04 in 3463 ms.
Starting property specific reduction for PhilosophersDyn-PT-03-UpperBounds-11
// Phase 1: matrix 47 rows 24 cols
[2023-03-22 18:10:05] [INFO ] Computed 9 place invariants in 2 ms
Incomplete random walk after 10000 steps, including 1755 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 426 resets, run finished after 4 ms. (steps per millisecond=2500 ) properties (out of 1) seen :1
[2023-03-22 18:10:05] [INFO ] Invariant cache hit.
[2023-03-22 18:10:05] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-22 18:10:05] [INFO ] [Real]Absence check using 6 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-22 18:10:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 18:10:05] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2023-03-22 18:10:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 18:10:05] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-22 18:10:05] [INFO ] [Nat]Absence check using 6 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-22 18:10:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 18:10:05] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2023-03-22 18:10:05] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-22 18:10:05] [INFO ] [Nat]Added 30 Read/Feed constraints in 4 ms returned sat
[2023-03-22 18:10:05] [INFO ] Computed and/alt/rep : 11/87/11 causal constraints (skipped 33 transitions) in 4 ms.
[2023-03-22 18:10:05] [INFO ] Added : 3 causal constraints over 1 iterations in 12 ms. Result :sat
Minimization took 15 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[1]
Support contains 1 out of 24 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 24/24 places, 47/47 transitions.
Applied a total of 0 rules in 3 ms. Remains 24 /24 variables (removed 0) and now considering 47/47 (removed 0) transitions.
[2023-03-22 18:10:05] [INFO ] Invariant cache hit.
[2023-03-22 18:10:05] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 24/24 places, 47/47 transitions.
[2023-03-22 18:10:05] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 176245 resets, run finished after 1069 ms. (steps per millisecond=935 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000000 steps, including 41715 resets, run finished after 346 ms. (steps per millisecond=2890 ) properties (out of 1) seen :1
[2023-03-22 18:10:07] [INFO ] Invariant cache hit.
[2023-03-22 18:10:07] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-22 18:10:07] [INFO ] [Real]Absence check using 6 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-22 18:10:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 18:10:07] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-03-22 18:10:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 18:10:07] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-22 18:10:07] [INFO ] [Nat]Absence check using 6 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-22 18:10:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 18:10:07] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2023-03-22 18:10:07] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-22 18:10:07] [INFO ] [Nat]Added 30 Read/Feed constraints in 5 ms returned sat
[2023-03-22 18:10:07] [INFO ] Computed and/alt/rep : 11/87/11 causal constraints (skipped 33 transitions) in 3 ms.
[2023-03-22 18:10:07] [INFO ] Added : 3 causal constraints over 1 iterations in 14 ms. Result :sat
Minimization took 14 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[1]
Support contains 1 out of 24 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 24/24 places, 47/47 transitions.
Applied a total of 0 rules in 3 ms. Remains 24 /24 variables (removed 0) and now considering 47/47 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 24/24 places, 47/47 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 24/24 places, 47/47 transitions.
Applied a total of 0 rules in 2 ms. Remains 24 /24 variables (removed 0) and now considering 47/47 (removed 0) transitions.
[2023-03-22 18:10:07] [INFO ] Invariant cache hit.
[2023-03-22 18:10:07] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-22 18:10:07] [INFO ] Invariant cache hit.
[2023-03-22 18:10:07] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-22 18:10:07] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
[2023-03-22 18:10:07] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 18:10:07] [INFO ] Invariant cache hit.
[2023-03-22 18:10:07] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 118 ms. Remains : 24/24 places, 47/47 transitions.
Ending property specific reduction for PhilosophersDyn-PT-03-UpperBounds-11 in 1832 ms.
[2023-03-22 18:10:07] [INFO ] Flatten gal took : 28 ms
[2023-03-22 18:10:07] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/UpperBounds.sr.xml took 1 ms.
[2023-03-22 18:10:07] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 24 places, 47 transitions and 309 arcs took 1 ms.
Total runtime 11286 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only
Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets
authors: Alex Tovchigrechko (IDD package and CTL model checking)
Martin Schwarick (Symbolic numerical analysis and CSL model checking)
Christian Rohr (Simulative and approximative numerical model checking)
marcie@informatik.tu-cottbus.de
called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=UpperBounds.xml --memory=6 --mcc-mode
parse successfull
net created successfully
Net: PhilosophersDyn_PT_03
(NrP: 24 NrTr: 47 NrArc: 309)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec
net check time: 0m 0.000sec
init dd package: 0m 2.755sec
RS generation: 0m 0.002sec
-> reachability set: #nodes 293 (2.9e+02) #states 101
starting MCC model checker
--------------------------
checking: place_bound(p11)
normalized: place_bound(p11)
-> the formula is 1
FORMULA PhilosophersDyn-PT-03-UpperBounds-11 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: place_bound(p2,p16,p20)
normalized: place_bound(p2,p16,p20)
-> the formula is 2
FORMULA PhilosophersDyn-PT-03-UpperBounds-04 2 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
totally nodes used: 1106 (1.1e+03)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 2274 11159 13433
used/not used/entry size/cache size: 11223 67097641 16 1024MB
basic ops cache: hits/miss/sum: 17 329 346
used/not used/entry size/cache size: 963 16776253 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 8 128MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 12 192MB
state nr cache: hits/miss/sum: 60 293 353
used/not used/entry size/cache size: 293 8388315 32 256MB
max state cache: hits/miss/sum: 60 293 353
used/not used/entry size/cache size: 293 8388315 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 67107761
1 1100
2 3
3 0
4 0
5 0
6 0
7 0
8 0
9 0
>= 10 0
Total processing time: 0m 4.410sec
BK_STOP 1679508621023
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok
initing FirstDep: 0m 0.000sec
iterations count:789 (16), effective:48 (1)
initing FirstDep: 0m 0.000sec
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="marciexred"
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-5348"
echo " Executing tool marciexred"
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 r298-tall-167873951600317"
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 '
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 ;