Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r400-tall-171690533400885.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is Szymanski-PT-b08, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r400-tall-171690533400885
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.0M
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 19 16:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 19:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.8K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 89K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 46K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 19 07:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 19 15:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 3.7M May 18 16:43 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-b08-UpperBounds-00
FORMULA_NAME Szymanski-PT-b08-UpperBounds-01
FORMULA_NAME Szymanski-PT-b08-UpperBounds-02
FORMULA_NAME Szymanski-PT-b08-UpperBounds-03
FORMULA_NAME Szymanski-PT-b08-UpperBounds-04
FORMULA_NAME Szymanski-PT-b08-UpperBounds-05
FORMULA_NAME Szymanski-PT-b08-UpperBounds-06
FORMULA_NAME Szymanski-PT-b08-UpperBounds-07
FORMULA_NAME Szymanski-PT-b08-UpperBounds-08
FORMULA_NAME Szymanski-PT-b08-UpperBounds-09
FORMULA_NAME Szymanski-PT-b08-UpperBounds-10
FORMULA_NAME Szymanski-PT-b08-UpperBounds-11
FORMULA_NAME Szymanski-PT-b08-UpperBounds-12
FORMULA_NAME Szymanski-PT-b08-UpperBounds-13
FORMULA_NAME Szymanski-PT-b08-UpperBounds-14
FORMULA_NAME Szymanski-PT-b08-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717091562219

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-b08
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2024-05-30 17:52:43] [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]
[2024-05-30 17:52:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 17:52:43] [INFO ] Load time of PNML (sax parser for PT used): 371 ms
[2024-05-30 17:52:43] [INFO ] Transformed 568 places.
[2024-05-30 17:52:43] [INFO ] Transformed 8320 transitions.
[2024-05-30 17:52:43] [INFO ] Parsed PT model containing 568 places and 8320 transitions and 33408 arcs in 527 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 40 ms.
Deduced a syphon composed of 260 places in 19 ms
Reduce places removed 260 places and 256 transitions.
FORMULA Szymanski-PT-b08-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b08-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b08-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b08-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b08-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b08-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b08-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b08-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b08-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b08-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b08-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf]
[2024-05-30 17:52:44] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
// Phase 1: matrix 2733 rows 308 cols
[2024-05-30 17:52:44] [INFO ] Computed 3 invariants in 61 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 8, 1]
RANDOM walk for 10005 steps (2 resets) in 61 ms. (161 steps per ms)
FORMULA Szymanski-PT-b08-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Szymanski-PT-b08-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 30003 steps (9 resets) in 90 ms. (329 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 6, 0] Max Struct:[1, 8, 1]
[2024-05-30 17:52:44] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
[2024-05-30 17:52:44] [INFO ] Invariant cache hit.
[2024-05-30 17:52:44] [INFO ] [Real]Absence check using 2 positive place invariants in 8 ms returned sat
[2024-05-30 17:52:44] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 14 ms returned sat
[2024-05-30 17:52:45] [INFO ] [Real]Absence check using state equation in 478 ms returned sat
[2024-05-30 17:52:45] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-30 17:52:46] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-30 17:52:46] [INFO ] [Real]Added 147 Read/Feed constraints in 816 ms returned sat
[2024-05-30 17:52:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 17:52:46] [INFO ] [Nat]Absence check using 2 positive place invariants in 13 ms returned sat
[2024-05-30 17:52:46] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-30 17:52:46] [INFO ] [Nat]Absence check using state equation in 592 ms returned sat
[2024-05-30 17:52:47] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-30 17:52:47] [INFO ] [Nat]Added 147 Read/Feed constraints in 1126 ms returned unknown
[2024-05-30 17:52:48] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-30 17:52:48] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-30 17:52:48] [INFO ] [Real]Absence check using state equation in 388 ms returned sat
[2024-05-30 17:52:48] [INFO ] [Real]Added 147 Read/Feed constraints in 55 ms returned sat
[2024-05-30 17:52:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 17:52:48] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-30 17:52:48] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-30 17:52:49] [INFO ] [Nat]Absence check using state equation in 499 ms returned sat
[2024-05-30 17:52:49] [INFO ] [Nat]Added 147 Read/Feed constraints in 199 ms returned sat
[2024-05-30 17:52:50] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2722 transitions) in 647 ms.
[2024-05-30 17:52:50] [INFO ] Added : 0 causal constraints over 0 iterations in 854 ms. Result :sat
Minimization took 598 ms.
[2024-05-30 17:52:50] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2024-05-30 17:52:50] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-30 17:52:51] [INFO ] [Real]Absence check using state equation in 616 ms returned sat
[2024-05-30 17:52:51] [INFO ] [Real]Added 147 Read/Feed constraints in 195 ms returned sat
[2024-05-30 17:52:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 17:52:51] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-30 17:52:51] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 5 ms returned sat
[2024-05-30 17:52:52] [INFO ] [Nat]Absence check using state equation in 628 ms returned sat
[2024-05-30 17:52:53] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-30 17:52:53] [INFO ] [Nat]Added 147 Read/Feed constraints in 876 ms returned sat
[2024-05-30 17:52:54] [INFO ] Deduced a trap composed of 136 places in 633 ms of which 25 ms to minimize.
[2024-05-30 17:52:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 809 ms
[2024-05-30 17:52:54] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2722 transitions) in 588 ms.
[2024-05-30 17:52:55] [INFO ] Added : 0 causal constraints over 0 iterations in 785 ms. Result :sat
Minimization took 589 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 6, 0] Max Struct:[1, 8, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 6, 0] Max Struct:[1, 8, 1]
Support contains 3 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.19 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 128 transitions
Reduce isomorphic transitions removed 128 transitions.
Iterating post reduction 0 with 128 rules applied. Total rules applied 129 place count 306 transition count 7936
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 130 place count 305 transition count 7808
Iterating global reduction 1 with 1 rules applied. Total rules applied 131 place count 305 transition count 7808
Applied a total of 131 rules in 430 ms. Remains 305 /308 variables (removed 3) and now considering 7808/8064 (removed 256) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 445 ms. Remains : 305/308 places, 7808/8064 transitions.
[2024-05-30 17:52:56] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
// Phase 1: matrix 2604 rows 305 cols
[2024-05-30 17:52:56] [INFO ] Computed 3 invariants in 33 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 6, 0] Max Struct:[1, 8, 1]
RANDOM walk for 1000007 steps (2 resets) in 1044 ms. (956 steps per ms)
FORMULA Szymanski-PT-b08-UpperBounds-09 8 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 3000001 steps (6 resets) in 2776 ms. (1080 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 1]
[2024-05-30 17:52:59] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-05-30 17:52:59] [INFO ] Invariant cache hit.
[2024-05-30 17:53:00] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-30 17:53:00] [INFO ] [Real]Absence check using state equation in 385 ms returned sat
[2024-05-30 17:53:00] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-30 17:53:00] [INFO ] [Real]Added 147 Read/Feed constraints in 75 ms returned sat
[2024-05-30 17:53:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 17:53:00] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-30 17:53:01] [INFO ] [Nat]Absence check using state equation in 390 ms returned sat
[2024-05-30 17:53:05] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-30 17:53:06] [INFO ] [Nat]Added 147 Read/Feed constraints in 5499 ms returned sat
[2024-05-30 17:53:07] [INFO ] Deduced a trap composed of 136 places in 539 ms of which 2 ms to minimize.
[2024-05-30 17:53:07] [INFO ] Deduced a trap composed of 133 places in 526 ms of which 3 ms to minimize.
[2024-05-30 17:53:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1282 ms
[2024-05-30 17:53:08] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2593 transitions) in 306 ms.
[2024-05-30 17:53:08] [INFO ] Added : 0 causal constraints over 0 iterations in 467 ms. Result :sat
Minimization took 4898 ms.
[2024-05-30 17:53:13] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-30 17:53:13] [INFO ] [Real]Absence check using state equation in 369 ms returned sat
[2024-05-30 17:53:13] [INFO ] [Real]Added 147 Read/Feed constraints in 121 ms returned sat
[2024-05-30 17:53:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 17:53:13] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-30 17:53:14] [INFO ] [Nat]Absence check using state equation in 376 ms returned sat
[2024-05-30 17:53:15] [INFO ] [Nat]Added 147 Read/Feed constraints in 975 ms returned sat
[2024-05-30 17:53:15] [INFO ] Deduced a trap composed of 130 places in 546 ms of which 4 ms to minimize.
[2024-05-30 17:53:16] [INFO ] Deduced a trap composed of 78 places in 519 ms of which 3 ms to minimize.
[2024-05-30 17:53:16] [INFO ] Deduced a trap composed of 129 places in 543 ms of which 2 ms to minimize.
[2024-05-30 17:53:17] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1844 ms
[2024-05-30 17:53:17] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2593 transitions) in 497 ms.
[2024-05-30 17:53:17] [INFO ] Added : 0 causal constraints over 0 iterations in 654 ms. Result :sat
Minimization took 4896 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 1]
Support contains 2 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 377 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 378 ms. Remains : 305/305 places, 7808/7808 transitions.
[2024-05-30 17:53:23] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-05-30 17:53:23] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[1, 1]
RANDOM walk for 1000000 steps (2 resets) in 886 ms. (1127 steps per ms)
BEST_FIRST walk for 2000001 steps (4 resets) in 1429 ms. (1398 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 1]
[2024-05-30 17:53:25] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-05-30 17:53:25] [INFO ] Invariant cache hit.
[2024-05-30 17:53:25] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-30 17:53:25] [INFO ] [Real]Absence check using state equation in 406 ms returned sat
[2024-05-30 17:53:25] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-30 17:53:25] [INFO ] [Real]Added 147 Read/Feed constraints in 79 ms returned sat
[2024-05-30 17:53:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 17:53:26] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-30 17:53:26] [INFO ] [Nat]Absence check using state equation in 380 ms returned sat
[2024-05-30 17:53:30] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-30 17:53:31] [INFO ] [Nat]Added 147 Read/Feed constraints in 5139 ms returned sat
[2024-05-30 17:53:32] [INFO ] Deduced a trap composed of 78 places in 530 ms of which 2 ms to minimize.
[2024-05-30 17:53:32] [INFO ] Deduced a trap composed of 136 places in 528 ms of which 4 ms to minimize.
[2024-05-30 17:53:33] [INFO ] Deduced a trap composed of 133 places in 522 ms of which 2 ms to minimize.
[2024-05-30 17:53:33] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1881 ms
[2024-05-30 17:53:33] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2593 transitions) in 361 ms.
[2024-05-30 17:53:34] [INFO ] Added : 0 causal constraints over 0 iterations in 531 ms. Result :sat
Minimization took 4905 ms.
[2024-05-30 17:53:38] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-30 17:53:39] [INFO ] [Real]Absence check using state equation in 369 ms returned sat
[2024-05-30 17:53:39] [INFO ] [Real]Added 147 Read/Feed constraints in 113 ms returned sat
[2024-05-30 17:53:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 17:53:39] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-30 17:53:39] [INFO ] [Nat]Absence check using state equation in 354 ms returned sat
[2024-05-30 17:53:40] [INFO ] [Nat]Added 147 Read/Feed constraints in 979 ms returned sat
[2024-05-30 17:53:41] [INFO ] Deduced a trap composed of 130 places in 546 ms of which 2 ms to minimize.
[2024-05-30 17:53:42] [INFO ] Deduced a trap composed of 78 places in 502 ms of which 2 ms to minimize.
[2024-05-30 17:53:42] [INFO ] Deduced a trap composed of 129 places in 549 ms of which 2 ms to minimize.
[2024-05-30 17:53:42] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1818 ms
[2024-05-30 17:53:43] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2593 transitions) in 339 ms.
[2024-05-30 17:53:43] [INFO ] Added : 0 causal constraints over 0 iterations in 496 ms. Result :sat
Minimization took 4900 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 1]
Support contains 2 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 202 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 202 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 189 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
[2024-05-30 17:53:48] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-05-30 17:53:48] [INFO ] Invariant cache hit.
[2024-05-30 17:53:49] [INFO ] Implicit Places using invariants in 647 ms returned []
[2024-05-30 17:53:49] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-05-30 17:53:49] [INFO ] Invariant cache hit.
[2024-05-30 17:53:49] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-30 17:54:10] [INFO ] Implicit Places using invariants and state equation in 21456 ms returned []
Implicit Place search using SMT with State Equation took 22110 ms to find 0 implicit places.
[2024-05-30 17:54:11] [INFO ] Redundant transitions in 933 ms returned []
Running 7806 sub problems to find dead transitions.
[2024-05-30 17:54:11] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-05-30 17:54:11] [INFO ] Invariant cache hit.
[2024-05-30 17:54:11] [INFO ] State equation strengthened by 147 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 7806 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 305/2909 variables, and 3 constraints, problems are : Problem set: 0 solved, 7806 unsolved in 30204 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/305 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 7806/7806 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7806 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 7806 unsolved
[2024-05-30 17:55:12] [INFO ] Deduced a trap composed of 138 places in 436 ms of which 2 ms to minimize.
[2024-05-30 17:55:14] [INFO ] Deduced a trap composed of 48 places in 330 ms of which 2 ms to minimize.
[2024-05-30 17:55:14] [INFO ] Deduced a trap composed of 86 places in 312 ms of which 2 ms to minimize.
[2024-05-30 17:55:14] [INFO ] Deduced a trap composed of 70 places in 228 ms of which 1 ms to minimize.
[2024-05-30 17:55:15] [INFO ] Deduced a trap composed of 72 places in 258 ms of which 1 ms to minimize.
[2024-05-30 17:55:15] [INFO ] Deduced a trap composed of 77 places in 305 ms of which 2 ms to minimize.
[2024-05-30 17:55:15] [INFO ] Deduced a trap composed of 72 places in 313 ms of which 2 ms to minimize.
[2024-05-30 17:55:16] [INFO ] Deduced a trap composed of 85 places in 255 ms of which 2 ms to minimize.
[2024-05-30 17:55:16] [INFO ] Deduced a trap composed of 99 places in 395 ms of which 2 ms to minimize.
[2024-05-30 17:55:16] [INFO ] Deduced a trap composed of 50 places in 321 ms of which 2 ms to minimize.
[2024-05-30 17:55:17] [INFO ] Deduced a trap composed of 78 places in 386 ms of which 2 ms to minimize.
[2024-05-30 17:55:17] [INFO ] Deduced a trap composed of 107 places in 395 ms of which 2 ms to minimize.
[2024-05-30 17:55:17] [INFO ] Deduced a trap composed of 132 places in 279 ms of which 2 ms to minimize.
[2024-05-30 17:55:18] [INFO ] Deduced a trap composed of 77 places in 350 ms of which 2 ms to minimize.
[2024-05-30 17:55:18] [INFO ] Deduced a trap composed of 122 places in 338 ms of which 2 ms to minimize.
[2024-05-30 17:55:19] [INFO ] Deduced a trap composed of 137 places in 252 ms of which 1 ms to minimize.
[2024-05-30 17:55:19] [INFO ] Deduced a trap composed of 72 places in 360 ms of which 2 ms to minimize.
[2024-05-30 17:55:19] [INFO ] Deduced a trap composed of 122 places in 389 ms of which 2 ms to minimize.
[2024-05-30 17:55:20] [INFO ] Deduced a trap composed of 134 places in 253 ms of which 2 ms to minimize.
[2024-05-30 17:55:23] [INFO ] Deduced a trap composed of 135 places in 488 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/305 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 7806 unsolved
[2024-05-30 17:55:27] [INFO ] Deduced a trap composed of 195 places in 207 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 305/2909 variables, and 24 constraints, problems are : Problem set: 0 solved, 7806 unsolved in 30112 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/305 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 0/7806 constraints, Known Traps: 21/21 constraints]
After SMT, in 87051ms problems are : Problem set: 0 solved, 7806 unsolved
Search for dead transitions found 0 dead transitions in 87164ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 110451 ms. Remains : 305/305 places, 7808/7808 transitions.
RANDOM walk for 40017 steps (8 resets) in 667 ms. (59 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 141 ms. (281 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 161 ms. (246 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 120 ms. (330 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 134 ms. (296 steps per ms) remains 2/4 properties
[2024-05-30 17:55:39] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-05-30 17:55:39] [INFO ] Invariant cache hit.
[2024-05-30 17:55:39] [INFO ] State equation strengthened by 147 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 255/256 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 30/286 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-30 17:55:39] [INFO ] Flatten gal took : 516 ms
[2024-05-30 17:55:39] [INFO ] Deduced a trap composed of 75 places in 410 ms of which 2 ms to minimize.
[2024-05-30 17:55:40] [INFO ] Flatten gal took : 259 ms
[2024-05-30 17:55:40] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6208386674873056407.gal : 86 ms
[2024-05-30 17:55:40] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15595535496996142576.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6208386674873056407.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15595535496996142576.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.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
[2024-05-30 17:55:40] [INFO ] Deduced a trap composed of 130 places in 417 ms of which 2 ms to minimize.
[2024-05-30 17:55:40] [INFO ] Deduced a trap composed of 129 places in 403 ms of which 2 ms to minimize.
Loading property file /tmp/ReachabilityCardinality15595535496996142576.prop.
[2024-05-30 17:55:41] [INFO ] Deduced a trap composed of 130 places in 419 ms of which 2 ms to minimize.
[2024-05-30 17:55:41] [INFO ] Deduced a trap composed of 37 places in 441 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 19/305 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/305 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 2604/2909 variables, 305/313 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/2909 variables, 147/460 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2909 variables, 0/460 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/2909 variables, 0/460 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2909/2909 variables, and 460 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3117 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 255/256 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 30/286 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-30 17:55:42] [INFO ] Deduced a trap composed of 135 places in 400 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/286 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 19/305 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/305 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :5 after 9
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :9 after 45
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :45 after 495
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :495 after 44355
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :44355 after 114824
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :114824 after 448899
At refinement iteration 9 (OVERLAPS) 2604/2909 variables, 305/314 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :448899 after 1.24607e+06
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2909/2909 variables, and 461 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3319 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 6/6 constraints]
After SMT, in 6505ms problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
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 194 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 197 ms. Remains : 305/305 places, 7808/7808 transitions.
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1.24607e+06 after 1.84843e+06
RANDOM walk for 40015 steps (8 resets) in 239 ms. (166 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 91 ms. (434 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 84 ms. (470 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 161321 steps, run timeout after 3001 ms. (steps per millisecond=53 ) properties seen :0 out of 2
Probabilistic random walk after 161321 steps, saw 110005 distinct states, run finished after 3004 ms. (steps per millisecond=53 ) properties seen :0
[2024-05-30 17:55:49] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-05-30 17:55:49] [INFO ] Invariant cache hit.
[2024-05-30 17:55:49] [INFO ] State equation strengthened by 147 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 255/256 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 30/286 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-30 17:55:49] [INFO ] Deduced a trap composed of 75 places in 448 ms of which 2 ms to minimize.
[2024-05-30 17:55:50] [INFO ] Deduced a trap composed of 130 places in 405 ms of which 2 ms to minimize.
[2024-05-30 17:55:50] [INFO ] Deduced a trap composed of 129 places in 406 ms of which 2 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1.84843e+06 after 5.13026e+06
[2024-05-30 17:55:51] [INFO ] Deduced a trap composed of 130 places in 410 ms of which 2 ms to minimize.
[2024-05-30 17:55:51] [INFO ] Deduced a trap composed of 37 places in 393 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 19/305 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/305 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 2604/2909 variables, 305/313 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/2909 variables, 147/460 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2909 variables, 0/460 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/2909 variables, 0/460 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2909/2909 variables, and 460 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3102 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 255/256 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 30/286 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-30 17:55:52] [INFO ] Deduced a trap composed of 135 places in 366 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/286 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 19/305 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/305 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 2604/2909 variables, 305/314 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :5.13026e+06 after 2.56929e+07
At refinement iteration 10 (INCLUDED_ONLY) 0/2909 variables, 147/461 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2909 variables, 2/463 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2909 variables, 0/463 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/2909 variables, 0/463 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2909/2909 variables, and 463 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3448 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 6/6 constraints]
After SMT, in 6585ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 159 ms.
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 181 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 181 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 179 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
[2024-05-30 17:55:56] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-05-30 17:55:56] [INFO ] Invariant cache hit.
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :2.56929e+07 after 4.61265e+07
[2024-05-30 17:55:56] [INFO ] Implicit Places using invariants in 584 ms returned []
[2024-05-30 17:55:56] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-05-30 17:55:56] [INFO ] Invariant cache hit.
[2024-05-30 17:55:57] [INFO ] State equation strengthened by 147 read => feed constraints.
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :4.61265e+07 after 9.74772e+07
[2024-05-30 17:56:20] [INFO ] Implicit Places using invariants and state equation in 23216 ms returned []
Implicit Place search using SMT with State Equation took 23823 ms to find 0 implicit places.
[2024-05-30 17:56:20] [INFO ] Redundant transitions in 781 ms returned []
Running 7806 sub problems to find dead transitions.
[2024-05-30 17:56:21] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-05-30 17:56:21] [INFO ] Invariant cache hit.
[2024-05-30 17:56:21] [INFO ] State equation strengthened by 147 read => feed constraints.
Detected timeout of ITS tools.
[2024-05-30 17:56:30] [INFO ] Flatten gal took : 235 ms
[2024-05-30 17:56:30] [INFO ] Applying decomposition
[2024-05-30 17:56:30] [INFO ] Flatten gal took : 255 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph9015781437476479459.txt' '-o' '/tmp/graph9015781437476479459.bin' '-w' '/tmp/graph9015781437476479459.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9015781437476479459.bin' '-l' '-1' '-v' '-w' '/tmp/graph9015781437476479459.weights' '-q' '0' '-e' '0.001'
[2024-05-30 17:56:31] [INFO ] Decomposing Gal with order
[2024-05-30 17:56:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 17:56:32] [INFO ] Removed a total of 18109 redundant transitions.
[2024-05-30 17:56:32] [INFO ] Flatten gal took : 786 ms
[2024-05-30 17:56:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 1060 labels/synchronizations in 446 ms.
[2024-05-30 17:56:33] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1105957194127918035.gal : 34 ms
[2024-05-30 17:56:33] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9145805611823440990.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality1105957194127918035.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9145805611823440990.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality9145805611823440990.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :1 after 8
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :8 after 105
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :105 after 689
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :689 after 2886
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :2886 after 9046
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :9046 after 22458
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :22458 after 43404
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :43404 after 70642
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :70642 after 221315
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :221315 after 238385
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :238385 after 240177

BK_STOP 1717091833844

--------------------
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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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-b08"
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-5568"
echo " Executing tool itstools"
echo " Input is Szymanski-PT-b08, 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 r400-tall-171690533400885"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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