fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r485-tall-167912699400469
Last Updated
May 14, 2023

About the Execution of ITS-Tools for Szymanski-PT-b06

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16223.184 3600000.00 3270586.00 281634.50 1 0 0 ? 6 0 1 1 0 0 6 1 1 6 1 0 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.r485-tall-167912699400469.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 itstools
Input is Szymanski-PT-b06, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r485-tall-167912699400469
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.0M
-rw-r--r-- 1 mcc users 6.1K Feb 26 17:00 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K Feb 26 17:00 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 26 16:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 26 16:59 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 17:19 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 17:19 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:19 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:19 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.7K Feb 26 17:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 75K Feb 26 17:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Feb 26 17:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 26 17:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:19 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:19 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 3.7M 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 Szymanski-PT-b06-UpperBounds-00
FORMULA_NAME Szymanski-PT-b06-UpperBounds-01
FORMULA_NAME Szymanski-PT-b06-UpperBounds-02
FORMULA_NAME Szymanski-PT-b06-UpperBounds-03
FORMULA_NAME Szymanski-PT-b06-UpperBounds-04
FORMULA_NAME Szymanski-PT-b06-UpperBounds-05
FORMULA_NAME Szymanski-PT-b06-UpperBounds-06
FORMULA_NAME Szymanski-PT-b06-UpperBounds-07
FORMULA_NAME Szymanski-PT-b06-UpperBounds-08
FORMULA_NAME Szymanski-PT-b06-UpperBounds-09
FORMULA_NAME Szymanski-PT-b06-UpperBounds-10
FORMULA_NAME Szymanski-PT-b06-UpperBounds-11
FORMULA_NAME Szymanski-PT-b06-UpperBounds-12
FORMULA_NAME Szymanski-PT-b06-UpperBounds-13
FORMULA_NAME Szymanski-PT-b06-UpperBounds-14
FORMULA_NAME Szymanski-PT-b06-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1679227688917

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=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Szymanski-PT-b06
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202303021504
[2023-03-19 12:08:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-19 12:08:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 12:08:11] [INFO ] Load time of PNML (sax parser for PT used): 297 ms
[2023-03-19 12:08:11] [INFO ] Transformed 568 places.
[2023-03-19 12:08:11] [INFO ] Transformed 8320 transitions.
[2023-03-19 12:08:11] [INFO ] Parsed PT model containing 568 places and 8320 transitions and 33408 arcs in 641 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
Deduced a syphon composed of 260 places in 19 ms
Reduce places removed 260 places and 256 transitions.
FORMULA Szymanski-PT-b06-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b06-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b06-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b06-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b06-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b06-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Normalized transition count is 2733 out of 8064 initially.
// Phase 1: matrix 2733 rows 308 cols
[2023-03-19 12:08:12] [INFO ] Computed 3 place invariants in 63 ms
Incomplete random walk after 10001 steps, including 5 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 10) seen :16
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 10) seen :10
FORMULA Szymanski-PT-b06-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Szymanski-PT-b06-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 8) seen :11
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 8) seen :11
FORMULA Szymanski-PT-b06-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 7) seen :10
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 7) seen :5
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 7) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 7) seen :7
FORMULA Szymanski-PT-b06-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2023-03-19 12:08:12] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
// Phase 1: matrix 2733 rows 308 cols
[2023-03-19 12:08:12] [INFO ] Computed 3 place invariants in 36 ms
[2023-03-19 12:08:12] [INFO ] [Real]Absence check using 2 positive place invariants in 6 ms returned sat
[2023-03-19 12:08:12] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-19 12:08:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 12:08:13] [INFO ] [Real]Absence check using state equation in 907 ms returned sat
[2023-03-19 12:08:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 12:08:13] [INFO ] [Nat]Absence check using 2 positive place invariants in 23 ms returned sat
[2023-03-19 12:08:13] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 11 ms returned sat
[2023-03-19 12:08:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 12:08:14] [INFO ] [Nat]Absence check using state equation in 745 ms returned sat
[2023-03-19 12:08:14] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 12:08:15] [INFO ] [Nat]Added 147 Read/Feed constraints in 1097 ms returned sat
[2023-03-19 12:08:16] [INFO ] Deduced a trap composed of 138 places in 855 ms of which 4 ms to minimize.
[2023-03-19 12:08:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1024 ms
[2023-03-19 12:08:17] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2722 transitions) in 836 ms.
[2023-03-19 12:08:18] [INFO ] Added : 0 causal constraints over 0 iterations in 1228 ms. Result :sat
Minimization took 635 ms.
[2023-03-19 12:08:18] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-19 12:08:18] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-19 12:08:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 12:08:19] [INFO ] [Real]Absence check using state equation in 697 ms returned sat
[2023-03-19 12:08:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 12:08:19] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-19 12:08:19] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-19 12:08:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 12:08:20] [INFO ] [Nat]Absence check using state equation in 669 ms returned sat
[2023-03-19 12:08:23] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-19 12:08:24] [INFO ] [Nat]Added 147 Read/Feed constraints in 4277 ms returned unknown
[2023-03-19 12:08:24] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-19 12:08:24] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-19 12:08:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 12:08:25] [INFO ] [Real]Absence check using state equation in 508 ms returned sat
[2023-03-19 12:08:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 12:08:25] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-19 12:08:25] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-19 12:08:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 12:08:25] [INFO ] [Nat]Absence check using state equation in 509 ms returned sat
[2023-03-19 12:08:28] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-19 12:08:30] [INFO ] [Nat]Added 147 Read/Feed constraints in 4444 ms returned unknown
[2023-03-19 12:08:30] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-19 12:08:30] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-19 12:08:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 12:08:30] [INFO ] [Real]Absence check using state equation in 563 ms returned sat
[2023-03-19 12:08:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 12:08:30] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-19 12:08:30] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-19 12:08:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 12:08:31] [INFO ] [Nat]Absence check using state equation in 600 ms returned sat
[2023-03-19 12:08:34] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-19 12:08:35] [INFO ] [Nat]Added 147 Read/Feed constraints in 4352 ms returned unknown
[2023-03-19 12:08:35] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-19 12:08:35] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-19 12:08:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 12:08:36] [INFO ] [Real]Absence check using state equation in 511 ms returned sat
[2023-03-19 12:08:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 12:08:36] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-19 12:08:36] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 12:08:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 12:08:37] [INFO ] [Nat]Absence check using state equation in 535 ms returned sat
[2023-03-19 12:08:38] [INFO ] [Nat]Added 147 Read/Feed constraints in 931 ms returned sat
[2023-03-19 12:08:38] [INFO ] Deduced a trap composed of 44 places in 519 ms of which 1 ms to minimize.
[2023-03-19 12:08:39] [INFO ] Deduced a trap composed of 38 places in 552 ms of which 1 ms to minimize.
[2023-03-19 12:08:39] [INFO ] Deduced a trap composed of 49 places in 533 ms of which 17 ms to minimize.
[2023-03-19 12:08:40] [INFO ] Deduced a trap composed of 77 places in 414 ms of which 0 ms to minimize.
[2023-03-19 12:08:40] [INFO ] Deduced a trap composed of 76 places in 390 ms of which 0 ms to minimize.
[2023-03-19 12:08:40] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2753 ms
[2023-03-19 12:08:41] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2722 transitions) in 514 ms.
[2023-03-19 12:08:41] [INFO ] Added : 0 causal constraints over 0 iterations in 660 ms. Result :sat
Minimization took 63 ms.
[2023-03-19 12:08:41] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-19 12:08:41] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 4 ms returned sat
[2023-03-19 12:08:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 12:08:42] [INFO ] [Real]Absence check using state equation in 762 ms returned unsat
Current structural bounds on expressions (after SMT) : [1, 13, 13, 13, 1, 6] Max seen :[0, 3, 5, 4, 0, 6]
FORMULA Szymanski-PT-b06-UpperBounds-13 6 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 5 out of 308 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 8064/8064 transitions.
Graph (complete) has 9195 edges and 308 vertex of which 306 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.16 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 0 with 126 rules applied. Total rules applied 127 place count 306 transition count 7938
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 128 place count 305 transition count 7810
Iterating global reduction 1 with 1 rules applied. Total rules applied 129 place count 305 transition count 7810
Applied a total of 129 rules in 452 ms. Remains 305 /308 variables (removed 3) and now considering 7810/8064 (removed 254) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 455 ms. Remains : 305/308 places, 7810/8064 transitions.
Normalized transition count is 2606 out of 7810 initially.
// Phase 1: matrix 2606 rows 305 cols
[2023-03-19 12:08:42] [INFO ] Computed 1 place invariants in 24 ms
Incomplete random walk after 1000001 steps, including 2 resets, run finished after 1469 ms. (steps per millisecond=680 ) properties (out of 5) seen :16
FORMULA Szymanski-PT-b06-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 803 ms. (steps per millisecond=1245 ) properties (out of 4) seen :10
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 756 ms. (steps per millisecond=1322 ) properties (out of 4) seen :11
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 758 ms. (steps per millisecond=1319 ) properties (out of 4) seen :7
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 869 ms. (steps per millisecond=1150 ) properties (out of 4) seen :10
[2023-03-19 12:08:47] [INFO ] Flow matrix only has 2606 transitions (discarded 5204 similar events)
// Phase 1: matrix 2606 rows 305 cols
[2023-03-19 12:08:47] [INFO ] Computed 1 place invariants in 23 ms
[2023-03-19 12:08:47] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 4 ms returned sat
[2023-03-19 12:08:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 12:08:48] [INFO ] [Real]Absence check using state equation in 526 ms returned sat
[2023-03-19 12:08:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 12:08:48] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-19 12:08:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 12:08:48] [INFO ] [Nat]Absence check using state equation in 492 ms returned sat
[2023-03-19 12:08:48] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 12:08:50] [INFO ] [Nat]Added 147 Read/Feed constraints in 1957 ms returned sat
[2023-03-19 12:08:51] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2595 transitions) in 333 ms.
[2023-03-19 12:08:51] [INFO ] Added : 0 causal constraints over 0 iterations in 485 ms. Result :sat
Minimization took 662 ms.
[2023-03-19 12:08:52] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-19 12:08:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 12:08:52] [INFO ] [Real]Absence check using state equation in 448 ms returned sat
[2023-03-19 12:08:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 12:08:52] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-19 12:08:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 12:08:53] [INFO ] [Nat]Absence check using state equation in 448 ms returned sat
[2023-03-19 12:08:56] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-19 12:08:59] [INFO ] [Nat]Added 147 Read/Feed constraints in 6038 ms returned unknown
[2023-03-19 12:08:59] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-19 12:08:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 12:08:59] [INFO ] [Real]Absence check using state equation in 432 ms returned unsat
[2023-03-19 12:08:59] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-19 12:08:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 12:09:00] [INFO ] [Real]Absence check using state equation in 433 ms returned unsat
Current structural bounds on expressions (after SMT) : [1, 13, 6, 6] Max seen :[0, 6, 6, 6]
FORMULA Szymanski-PT-b06-UpperBounds-10 6 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Szymanski-PT-b06-UpperBounds-04 6 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7810/7810 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 305 transition count 7808
Applied a total of 2 rules in 219 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7810 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 219 ms. Remains : 305/305 places, 7808/7810 transitions.
Normalized transition count is 2604 out of 7808 initially.
// Phase 1: matrix 2604 rows 305 cols
[2023-03-19 12:09:00] [INFO ] Computed 3 place invariants in 26 ms
Incomplete random walk after 1000004 steps, including 2 resets, run finished after 1094 ms. (steps per millisecond=914 ) properties (out of 2) seen :5
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 803 ms. (steps per millisecond=1245 ) properties (out of 2) seen :2
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 751 ms. (steps per millisecond=1331 ) properties (out of 2) seen :6
[2023-03-19 12:09:03] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
// Phase 1: matrix 2604 rows 305 cols
[2023-03-19 12:09:03] [INFO ] Computed 3 place invariants in 25 ms
[2023-03-19 12:09:03] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-19 12:09:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 12:09:03] [INFO ] [Real]Absence check using state equation in 406 ms returned sat
[2023-03-19 12:09:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 12:09:03] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-19 12:09:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 12:09:04] [INFO ] [Nat]Absence check using state equation in 499 ms returned sat
[2023-03-19 12:09:04] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 12:09:05] [INFO ] [Nat]Added 147 Read/Feed constraints in 1093 ms returned sat
[2023-03-19 12:09:05] [INFO ] Deduced a trap composed of 137 places in 535 ms of which 1 ms to minimize.
[2023-03-19 12:09:06] [INFO ] Deduced a trap composed of 132 places in 540 ms of which 0 ms to minimize.
[2023-03-19 12:09:07] [INFO ] Deduced a trap composed of 132 places in 527 ms of which 1 ms to minimize.
[2023-03-19 12:09:07] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1852 ms
[2023-03-19 12:09:07] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2593 transitions) in 357 ms.
[2023-03-19 12:09:08] [INFO ] Deduced a trap composed of 129 places in 526 ms of which 1 ms to minimize.
[2023-03-19 12:09:08] [INFO ] Deduced a trap composed of 129 places in 466 ms of which 1 ms to minimize.
[2023-03-19 12:09:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1232 ms
[2023-03-19 12:09:09] [INFO ] Added : 3 causal constraints over 2 iterations in 1992 ms. Result :sat
Minimization took 1570 ms.
[2023-03-19 12:09:10] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-19 12:09:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 12:09:11] [INFO ] [Real]Absence check using state equation in 439 ms returned sat
[2023-03-19 12:09:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 12:09:11] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-19 12:09:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 12:09:11] [INFO ] [Nat]Absence check using state equation in 396 ms returned sat
[2023-03-19 12:09:14] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-19 12:09:17] [INFO ] [Nat]Added 147 Read/Feed constraints in 6037 ms returned unknown
Current structural bounds on expressions (after SMT) : [1, 7] Max seen :[0, 6]
FORMULA Szymanski-PT-b06-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 1 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 288 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 288 ms. Remains : 305/305 places, 7808/7808 transitions.
Normalized transition count is 2604 out of 7808 initially.
// Phase 1: matrix 2604 rows 305 cols
[2023-03-19 12:09:18] [INFO ] Computed 3 place invariants in 14 ms
Incomplete random walk after 1000001 steps, including 2 resets, run finished after 1220 ms. (steps per millisecond=819 ) properties (out of 1) seen :5
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 805 ms. (steps per millisecond=1242 ) properties (out of 1) seen :6
[2023-03-19 12:09:20] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
// Phase 1: matrix 2604 rows 305 cols
[2023-03-19 12:09:20] [INFO ] Computed 3 place invariants in 19 ms
[2023-03-19 12:09:20] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-19 12:09:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 12:09:20] [INFO ] [Real]Absence check using state equation in 476 ms returned sat
[2023-03-19 12:09:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 12:09:21] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-19 12:09:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 12:09:21] [INFO ] [Nat]Absence check using state equation in 392 ms returned sat
[2023-03-19 12:09:21] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 12:09:24] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-19 12:09:27] [INFO ] [Nat]Added 147 Read/Feed constraints in 6047 ms returned unknown
Current structural bounds on expressions (after SMT) : [7] Max seen :[6]
Support contains 1 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 185 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 185 ms. Remains : 305/305 places, 7808/7808 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 184 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
[2023-03-19 12:09:27] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2023-03-19 12:09:27] [INFO ] Invariant cache hit.
[2023-03-19 12:09:28] [INFO ] Implicit Places using invariants in 590 ms returned []
[2023-03-19 12:09:28] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2023-03-19 12:09:28] [INFO ] Invariant cache hit.
[2023-03-19 12:09:28] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 12:09:31] [INFO ] Implicit Places using invariants and state equation in 3145 ms returned []
Implicit Place search using SMT with State Equation took 3738 ms to find 0 implicit places.
[2023-03-19 12:09:32] [INFO ] Redundant transitions in 896 ms returned []
[2023-03-19 12:09:32] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2023-03-19 12:09:32] [INFO ] Invariant cache hit.
[2023-03-19 12:09:34] [INFO ] Dead Transitions using invariants and state equation in 2242 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7070 ms. Remains : 305/305 places, 7808/7808 transitions.
Starting property specific reduction for Szymanski-PT-b06-UpperBounds-03
Normalized transition count is 2604 out of 7808 initially.
// Phase 1: matrix 2604 rows 305 cols
[2023-03-19 12:09:34] [INFO ] Computed 3 place invariants in 21 ms
Incomplete random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :5
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :4
[2023-03-19 12:09:34] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
// Phase 1: matrix 2604 rows 305 cols
[2023-03-19 12:09:34] [INFO ] Computed 3 place invariants in 12 ms
[2023-03-19 12:09:34] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-19 12:09:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 12:09:35] [INFO ] [Real]Absence check using state equation in 437 ms returned sat
[2023-03-19 12:09:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 12:09:35] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-19 12:09:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 12:09:35] [INFO ] [Nat]Absence check using state equation in 435 ms returned sat
[2023-03-19 12:09:35] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 12:09:38] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-19 12:09:40] [INFO ] [Nat]Added 147 Read/Feed constraints in 4509 ms returned unknown
Current structural bounds on expressions (after SMT) : [7] Max seen :[5]
Support contains 1 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 205 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 206 ms. Remains : 305/305 places, 7808/7808 transitions.
Normalized transition count is 2604 out of 7808 initially.
// Phase 1: matrix 2604 rows 305 cols
[2023-03-19 12:09:40] [INFO ] Computed 3 place invariants in 22 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1641 ms. (steps per millisecond=609 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 909 ms. (steps per millisecond=1100 ) properties (out of 1) seen :6
[2023-03-19 12:09:43] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
// Phase 1: matrix 2604 rows 305 cols
[2023-03-19 12:09:43] [INFO ] Computed 3 place invariants in 16 ms
[2023-03-19 12:09:43] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-19 12:09:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 12:09:43] [INFO ] [Real]Absence check using state equation in 452 ms returned sat
[2023-03-19 12:09:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 12:09:43] [INFO ] [Nat]Absence check using 3 positive place invariants in 21 ms returned sat
[2023-03-19 12:09:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 12:09:44] [INFO ] [Nat]Absence check using state equation in 389 ms returned sat
[2023-03-19 12:09:44] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 12:09:47] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-19 12:09:50] [INFO ] [Nat]Added 147 Read/Feed constraints in 6040 ms returned unknown
Current structural bounds on expressions (after SMT) : [7] Max seen :[6]
Support contains 1 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 189 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 189 ms. Remains : 305/305 places, 7808/7808 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 174 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
[2023-03-19 12:09:50] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2023-03-19 12:09:50] [INFO ] Invariant cache hit.
[2023-03-19 12:09:51] [INFO ] Implicit Places using invariants in 501 ms returned []
[2023-03-19 12:09:51] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2023-03-19 12:09:51] [INFO ] Invariant cache hit.
[2023-03-19 12:09:51] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 12:09:54] [INFO ] Implicit Places using invariants and state equation in 2928 ms returned []
Implicit Place search using SMT with State Equation took 3453 ms to find 0 implicit places.
[2023-03-19 12:09:54] [INFO ] Redundant transitions in 632 ms returned []
[2023-03-19 12:09:54] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2023-03-19 12:09:54] [INFO ] Invariant cache hit.
[2023-03-19 12:09:57] [INFO ] Dead Transitions using invariants and state equation in 2260 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6555 ms. Remains : 305/305 places, 7808/7808 transitions.
Normalized transition count is 2604 out of 7808 initially.
// Phase 1: matrix 2604 rows 305 cols
[2023-03-19 12:09:57] [INFO ] Computed 3 place invariants in 19 ms
Incomplete random walk after 1000002 steps, including 2 resets, run finished after 1229 ms. (steps per millisecond=813 ) properties (out of 1) seen :5
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 814 ms. (steps per millisecond=1228 ) properties (out of 1) seen :5
[2023-03-19 12:09:59] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
// Phase 1: matrix 2604 rows 305 cols
[2023-03-19 12:09:59] [INFO ] Computed 3 place invariants in 20 ms
[2023-03-19 12:09:59] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-19 12:09:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 12:09:59] [INFO ] [Real]Absence check using state equation in 429 ms returned sat
[2023-03-19 12:09:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 12:09:59] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-19 12:09:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 12:10:00] [INFO ] [Nat]Absence check using state equation in 367 ms returned sat
[2023-03-19 12:10:00] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 12:10:03] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-19 12:10:06] [INFO ] [Nat]Added 147 Read/Feed constraints in 6043 ms returned unknown
Current structural bounds on expressions (after SMT) : [7] Max seen :[6]
Support contains 1 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 188 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 188 ms. Remains : 305/305 places, 7808/7808 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 180 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
[2023-03-19 12:10:06] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2023-03-19 12:10:06] [INFO ] Invariant cache hit.
[2023-03-19 12:10:07] [INFO ] Implicit Places using invariants in 495 ms returned []
[2023-03-19 12:10:07] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2023-03-19 12:10:07] [INFO ] Invariant cache hit.
[2023-03-19 12:10:07] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 12:10:09] [INFO ] Implicit Places using invariants and state equation in 2867 ms returned []
Implicit Place search using SMT with State Equation took 3370 ms to find 0 implicit places.
[2023-03-19 12:10:10] [INFO ] Redundant transitions in 821 ms returned []
[2023-03-19 12:10:10] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2023-03-19 12:10:10] [INFO ] Invariant cache hit.
[2023-03-19 12:10:12] [INFO ] Dead Transitions using invariants and state equation in 2164 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6548 ms. Remains : 305/305 places, 7808/7808 transitions.
Ending property specific reduction for Szymanski-PT-b06-UpperBounds-03 in 38164 ms.
[2023-03-19 12:10:14] [INFO ] Flatten gal took : 788 ms
[2023-03-19 12:10:14] [INFO ] Applying decomposition
[2023-03-19 12:10:14] [INFO ] Flatten gal took : 230 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph13526649022429548318.txt' '-o' '/tmp/graph13526649022429548318.bin' '-w' '/tmp/graph13526649022429548318.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph13526649022429548318.bin' '-l' '-1' '-v' '-w' '/tmp/graph13526649022429548318.weights' '-q' '0' '-e' '0.001'
[2023-03-19 12:10:15] [INFO ] Decomposing Gal with order
[2023-03-19 12:10:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 12:10:16] [INFO ] Removed a total of 18109 redundant transitions.
[2023-03-19 12:10:16] [INFO ] Flatten gal took : 737 ms
[2023-03-19 12:10:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 1045 labels/synchronizations in 335 ms.
[2023-03-19 12:10:16] [INFO ] Time to serialize gal into /tmp/UpperBounds18085691039285696232.gal : 45 ms
[2023-03-19 12:10:16] [INFO ] Time to serialize properties into /tmp/UpperBounds1092923469951001471.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds18085691039285696232.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds1092923469951001471.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...284
Loading property file /tmp/UpperBounds1092923469951001471.prop.
Detected timeout of ITS tools.
[2023-03-19 12:30:57] [INFO ] Flatten gal took : 245 ms
[2023-03-19 12:30:57] [INFO ] Time to serialize gal into /tmp/UpperBounds4838178582080549548.gal : 41 ms
[2023-03-19 12:30:57] [INFO ] Time to serialize properties into /tmp/UpperBounds3193667037595725361.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds4838178582080549548.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds3193667037595725361.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...304
Loading property file /tmp/UpperBounds3193667037595725361.prop.
Detected timeout of ITS tools.
[2023-03-19 12:51:48] [INFO ] Flatten gal took : 1513 ms
[2023-03-19 12:52:04] [INFO ] Input system was already deterministic with 7808 transitions.
[2023-03-19 12:52:04] [INFO ] Transformed 305 places.
[2023-03-19 12:52:04] [INFO ] Transformed 7808 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2023-03-19 12:52:05] [INFO ] Time to serialize gal into /tmp/UpperBounds13750312503897470221.gal : 114 ms
[2023-03-19 12:52:05] [INFO ] Time to serialize properties into /tmp/UpperBounds12751628317351905830.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds13750312503897470221.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds12751628317351905830.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...351
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds12751628317351905830.prop.
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 153796 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16167884 kB

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="Szymanski-PT-b06"
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-5348"
echo " Executing tool itstools"
echo " Input is Szymanski-PT-b06, 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 r485-tall-167912699400469"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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