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.r491-tall-167912710500485.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 smartxred
Input is Szymanski-PT-b10, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r491-tall-167912710500485
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.0M
-rw-r--r-- 1 mcc users 6.9K Feb 26 17:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Feb 26 17:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 26 16:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K 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 24K Feb 25 17:19 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:19 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 17:19 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.2K Feb 26 17:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 83K Feb 26 17:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Feb 26 17:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Feb 26 17:02 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-b10-UpperBounds-00
FORMULA_NAME Szymanski-PT-b10-UpperBounds-01
FORMULA_NAME Szymanski-PT-b10-UpperBounds-02
FORMULA_NAME Szymanski-PT-b10-UpperBounds-03
FORMULA_NAME Szymanski-PT-b10-UpperBounds-04
FORMULA_NAME Szymanski-PT-b10-UpperBounds-05
FORMULA_NAME Szymanski-PT-b10-UpperBounds-06
FORMULA_NAME Szymanski-PT-b10-UpperBounds-07
FORMULA_NAME Szymanski-PT-b10-UpperBounds-08
FORMULA_NAME Szymanski-PT-b10-UpperBounds-09
FORMULA_NAME Szymanski-PT-b10-UpperBounds-10
FORMULA_NAME Szymanski-PT-b10-UpperBounds-11
FORMULA_NAME Szymanski-PT-b10-UpperBounds-12
FORMULA_NAME Szymanski-PT-b10-UpperBounds-13
FORMULA_NAME Szymanski-PT-b10-UpperBounds-14
FORMULA_NAME Szymanski-PT-b10-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1679259718354

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=smartxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Szymanski-PT-b10
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-19 21:02:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-19 21:02:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 21:02:00] [INFO ] Load time of PNML (sax parser for PT used): 289 ms
[2023-03-19 21:02:00] [INFO ] Transformed 568 places.
[2023-03-19 21:02:00] [INFO ] Transformed 8320 transitions.
[2023-03-19 21:02:00] [INFO ] Parsed PT model containing 568 places and 8320 transitions and 33408 arcs in 410 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Deduced a syphon composed of 260 places in 18 ms
Reduce places removed 260 places and 256 transitions.
FORMULA Szymanski-PT-b10-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b10-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b10-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b10-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b10-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b10-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b10-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Normalized transition count is 2733 out of 8064 initially.
// Phase 1: matrix 2733 rows 308 cols
[2023-03-19 21:02:00] [INFO ] Computed 3 place invariants in 52 ms
Incomplete random walk after 10000 steps, including 3 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 9) seen :11
FORMULA Szymanski-PT-b10-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 8) seen :3
FORMULA Szymanski-PT-b10-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Szymanski-PT-b10-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 6) seen :2
FORMULA Szymanski-PT-b10-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 5) seen :3
FORMULA Szymanski-PT-b10-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 4) seen :1
[2023-03-19 21:02:01] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
// Phase 1: matrix 2733 rows 308 cols
[2023-03-19 21:02:01] [INFO ] Computed 3 place invariants in 30 ms
[2023-03-19 21:02:01] [INFO ] [Real]Absence check using 2 positive place invariants in 6 ms returned sat
[2023-03-19 21:02:01] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 21:02:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 21:02:01] [INFO ] [Real]Absence check using state equation in 527 ms returned sat
[2023-03-19 21:02:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 21:02:02] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-19 21:02:02] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-19 21:02:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 21:02:02] [INFO ] [Nat]Absence check using state equation in 512 ms returned sat
[2023-03-19 21:02:02] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 21:02:03] [INFO ] [Nat]Added 147 Read/Feed constraints in 1014 ms returned sat
[2023-03-19 21:02:04] [INFO ] Deduced a trap composed of 130 places in 625 ms of which 4 ms to minimize.
[2023-03-19 21:02:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 909 ms
[2023-03-19 21:02:05] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2722 transitions) in 570 ms.
[2023-03-19 21:02:05] [INFO ] Added : 0 causal constraints over 0 iterations in 765 ms. Result :sat
Minimization took 775 ms.
[2023-03-19 21:02:06] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-19 21:02:06] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-19 21:02:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 21:02:06] [INFO ] [Real]Absence check using state equation in 579 ms returned sat
[2023-03-19 21:02:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 21:02:06] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-19 21:02:06] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-19 21:02:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 21:02:07] [INFO ] [Nat]Absence check using state equation in 543 ms returned sat
[2023-03-19 21:02:10] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-19 21:02:11] [INFO ] [Nat]Added 147 Read/Feed constraints in 4418 ms returned unknown
[2023-03-19 21:02:12] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-19 21:02:12] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-19 21:02:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 21:02:12] [INFO ] [Real]Absence check using state equation in 535 ms returned sat
[2023-03-19 21:02:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 21:02:12] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-19 21:02:12] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-19 21:02:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 21:02:13] [INFO ] [Nat]Absence check using state equation in 585 ms returned sat
[2023-03-19 21:02:13] [INFO ] [Nat]Added 147 Read/Feed constraints in 480 ms returned sat
[2023-03-19 21:02:14] [INFO ] Deduced a trap composed of 138 places in 418 ms of which 2 ms to minimize.
[2023-03-19 21:02:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 547 ms
[2023-03-19 21:02:15] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2722 transitions) in 1037 ms.
[2023-03-19 21:02:15] [INFO ] Added : 0 causal constraints over 0 iterations in 1208 ms. Result :sat
Minimization took 630 ms.
[2023-03-19 21:02:16] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-19 21:02:16] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-19 21:02:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 21:02:16] [INFO ] [Real]Absence check using state equation in 461 ms returned sat
[2023-03-19 21:02:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 21:02:16] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-19 21:02:16] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-19 21:02:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 21:02:17] [INFO ] [Nat]Absence check using state equation in 508 ms returned sat
[2023-03-19 21:02:18] [INFO ] [Nat]Added 147 Read/Feed constraints in 1668 ms returned sat
[2023-03-19 21:02:19] [INFO ] Deduced a trap composed of 136 places in 626 ms of which 1 ms to minimize.
[2023-03-19 21:02:20] [INFO ] Deduced a trap composed of 137 places in 580 ms of which 2 ms to minimize.
[2023-03-19 21:02:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1427 ms
[2023-03-19 21:02:20] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2722 transitions) in 385 ms.
[2023-03-19 21:02:20] [INFO ] Added : 0 causal constraints over 0 iterations in 550 ms. Result :sat
Minimization took 804 ms.
Current structural bounds on expressions (after SMT) : [1, 21, 1, 1] Max seen :[0, 10, 0, 0]
Support contains 4 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.15 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions 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 463 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 465 ms. Remains : 305/308 places, 7808/8064 transitions.
Normalized transition count is 2604 out of 7808 initially.
// Phase 1: matrix 2604 rows 305 cols
[2023-03-19 21:02:22] [INFO ] Computed 3 place invariants in 35 ms
Incomplete random walk after 1000008 steps, including 2 resets, run finished after 1158 ms. (steps per millisecond=863 ) properties (out of 4) seen :5
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 978 ms. (steps per millisecond=1022 ) properties (out of 4) seen :4
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 857 ms. (steps per millisecond=1166 ) properties (out of 4) seen :9
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 938 ms. (steps per millisecond=1066 ) properties (out of 4) seen :4
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 876 ms. (steps per millisecond=1141 ) properties (out of 4) seen :4
[2023-03-19 21:02:27] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
// Phase 1: matrix 2604 rows 305 cols
[2023-03-19 21:02:27] [INFO ] Computed 3 place invariants in 24 ms
[2023-03-19 21:02:27] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-19 21:02:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 21:02:27] [INFO ] [Real]Absence check using state equation in 502 ms returned sat
[2023-03-19 21:02:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 21:02:28] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-19 21:02:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 21:02:28] [INFO ] [Nat]Absence check using state equation in 464 ms returned sat
[2023-03-19 21:02:28] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 21:02:29] [INFO ] [Nat]Added 147 Read/Feed constraints in 679 ms returned sat
[2023-03-19 21:02:29] [INFO ] Deduced a trap composed of 138 places in 641 ms of which 1 ms to minimize.
[2023-03-19 21:02:30] [INFO ] Deduced a trap composed of 37 places in 631 ms of which 0 ms to minimize.
[2023-03-19 21:02:31] [INFO ] Deduced a trap composed of 129 places in 655 ms of which 2 ms to minimize.
[2023-03-19 21:02:31] [INFO ] Deduced a trap composed of 129 places in 627 ms of which 0 ms to minimize.
[2023-03-19 21:02:32] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2834 ms
[2023-03-19 21:02:32] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2593 transitions) in 407 ms.
[2023-03-19 21:02:32] [INFO ] Added : 0 causal constraints over 0 iterations in 577 ms. Result :sat
Minimization took 1256 ms.
[2023-03-19 21:02:34] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-19 21:02:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 21:02:34] [INFO ] [Real]Absence check using state equation in 509 ms returned sat
[2023-03-19 21:02:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 21:02:34] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-19 21:02:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 21:02:35] [INFO ] [Nat]Absence check using state equation in 429 ms returned sat
[2023-03-19 21:02:38] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-19 21:02:41] [INFO ] [Nat]Added 147 Read/Feed constraints in 6040 ms returned unknown
[2023-03-19 21:02:41] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-19 21:02:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 21:02:41] [INFO ] [Real]Absence check using state equation in 433 ms returned sat
[2023-03-19 21:02:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 21:02:41] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2023-03-19 21:02:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 21:02:42] [INFO ] [Nat]Absence check using state equation in 454 ms returned sat
[2023-03-19 21:02:43] [INFO ] [Nat]Added 147 Read/Feed constraints in 1847 ms returned sat
[2023-03-19 21:02:44] [INFO ] Deduced a trap composed of 130 places in 597 ms of which 1 ms to minimize.
[2023-03-19 21:02:45] [INFO ] Deduced a trap composed of 137 places in 589 ms of which 0 ms to minimize.
[2023-03-19 21:02:45] [INFO ] Deduced a trap composed of 129 places in 592 ms of which 1 ms to minimize.
[2023-03-19 21:02:45] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2004 ms
[2023-03-19 21:02:46] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2593 transitions) in 360 ms.
[2023-03-19 21:02:46] [INFO ] Added : 0 causal constraints over 0 iterations in 519 ms. Result :sat
Minimization took 856 ms.
[2023-03-19 21:02:47] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2023-03-19 21:02:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 21:02:47] [INFO ] [Real]Absence check using state equation in 433 ms returned sat
[2023-03-19 21:02:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 21:02:48] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-19 21:02:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 21:02:48] [INFO ] [Nat]Absence check using state equation in 460 ms returned sat
[2023-03-19 21:02:50] [INFO ] [Nat]Added 147 Read/Feed constraints in 1575 ms returned sat
[2023-03-19 21:02:50] [INFO ] Deduced a trap composed of 138 places in 558 ms of which 0 ms to minimize.
[2023-03-19 21:02:51] [INFO ] Deduced a trap composed of 143 places in 552 ms of which 1 ms to minimize.
[2023-03-19 21:02:52] [INFO ] Deduced a trap composed of 84 places in 550 ms of which 1 ms to minimize.
[2023-03-19 21:02:52] [INFO ] Deduced a trap composed of 130 places in 546 ms of which 1 ms to minimize.
[2023-03-19 21:02:53] [INFO ] Deduced a trap composed of 136 places in 550 ms of which 0 ms to minimize.
[2023-03-19 21:02:54] [INFO ] Deduced a trap composed of 50 places in 561 ms of which 0 ms to minimize.
[2023-03-19 21:02:54] [INFO ] Deduced a trap composed of 137 places in 572 ms of which 1 ms to minimize.
[2023-03-19 21:02:54] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 4666 ms
[2023-03-19 21:02:55] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2593 transitions) in 353 ms.
[2023-03-19 21:02:55] [INFO ] Added : 3 causal constraints over 2 iterations in 687 ms. Result :sat
Minimization took 1769 ms.
Current structural bounds on expressions (after SMT) : [1, 11, 1, 1] Max seen :[0, 10, 0, 0]
Support contains 4 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 241 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 241 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 339 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
[2023-03-19 21:02:58] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2023-03-19 21:02:58] [INFO ] Invariant cache hit.
[2023-03-19 21:02:58] [INFO ] Implicit Places using invariants in 584 ms returned []
[2023-03-19 21:02:58] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2023-03-19 21:02:58] [INFO ] Invariant cache hit.
[2023-03-19 21:02:59] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 21:03:02] [INFO ] Implicit Places using invariants and state equation in 3585 ms returned []
Implicit Place search using SMT with State Equation took 4171 ms to find 0 implicit places.
[2023-03-19 21:03:03] [INFO ] Redundant transitions in 946 ms returned []
[2023-03-19 21:03:03] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2023-03-19 21:03:03] [INFO ] Invariant cache hit.
[2023-03-19 21:03:05] [INFO ] Dead Transitions using invariants and state equation in 2504 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7973 ms. Remains : 305/305 places, 7808/7808 transitions.
Starting property specific reduction for Szymanski-PT-b10-UpperBounds-07
Normalized transition count is 2604 out of 7808 initially.
// Phase 1: matrix 2604 rows 305 cols
[2023-03-19 21:03:05] [INFO ] Computed 3 place invariants in 23 ms
Incomplete random walk after 10003 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
[2023-03-19 21:03:05] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
// Phase 1: matrix 2604 rows 305 cols
[2023-03-19 21:03:05] [INFO ] Computed 3 place invariants in 17 ms
[2023-03-19 21:03:06] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-19 21:03:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 21:03:06] [INFO ] [Real]Absence check using state equation in 480 ms returned sat
[2023-03-19 21:03:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 21:03:06] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-19 21:03:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 21:03:07] [INFO ] [Nat]Absence check using state equation in 434 ms returned sat
[2023-03-19 21:03:07] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 21:03:07] [INFO ] [Nat]Added 147 Read/Feed constraints in 679 ms returned sat
[2023-03-19 21:03:08] [INFO ] Deduced a trap composed of 138 places in 599 ms of which 1 ms to minimize.
[2023-03-19 21:03:09] [INFO ] Deduced a trap composed of 37 places in 607 ms of which 0 ms to minimize.
[2023-03-19 21:03:09] [INFO ] Deduced a trap composed of 129 places in 612 ms of which 0 ms to minimize.
[2023-03-19 21:03:10] [INFO ] Deduced a trap composed of 129 places in 602 ms of which 1 ms to minimize.
[2023-03-19 21:03:10] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2693 ms
[2023-03-19 21:03:10] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2593 transitions) in 363 ms.
[2023-03-19 21:03:11] [INFO ] Added : 0 causal constraints over 0 iterations in 522 ms. Result :sat
Minimization took 604 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
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 198 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 201 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 21:03:11] [INFO ] Computed 3 place invariants in 19 ms
Incomplete random walk after 1000002 steps, including 2 resets, run finished after 1176 ms. (steps per millisecond=850 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1017 ms. (steps per millisecond=983 ) properties (out of 1) seen :0
[2023-03-19 21:03:14] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
// Phase 1: matrix 2604 rows 305 cols
[2023-03-19 21:03:14] [INFO ] Computed 3 place invariants in 29 ms
[2023-03-19 21:03:14] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-19 21:03:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 21:03:14] [INFO ] [Real]Absence check using state equation in 554 ms returned sat
[2023-03-19 21:03:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 21:03:14] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-19 21:03:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 21:03:15] [INFO ] [Nat]Absence check using state equation in 478 ms returned sat
[2023-03-19 21:03:15] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 21:03:16] [INFO ] [Nat]Added 147 Read/Feed constraints in 745 ms returned sat
[2023-03-19 21:03:16] [INFO ] Deduced a trap composed of 138 places in 645 ms of which 0 ms to minimize.
[2023-03-19 21:03:17] [INFO ] Deduced a trap composed of 37 places in 653 ms of which 1 ms to minimize.
[2023-03-19 21:03:18] [INFO ] Deduced a trap composed of 129 places in 673 ms of which 0 ms to minimize.
[2023-03-19 21:03:18] [INFO ] Deduced a trap composed of 129 places in 585 ms of which 0 ms to minimize.
[2023-03-19 21:03:18] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2852 ms
[2023-03-19 21:03:19] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2593 transitions) in 357 ms.
[2023-03-19 21:03:19] [INFO ] Added : 0 causal constraints over 0 iterations in 509 ms. Result :sat
Minimization took 1249 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
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 207 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 208 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 196 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
[2023-03-19 21:03:21] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2023-03-19 21:03:21] [INFO ] Invariant cache hit.
[2023-03-19 21:03:21] [INFO ] Implicit Places using invariants in 583 ms returned []
[2023-03-19 21:03:21] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2023-03-19 21:03:21] [INFO ] Invariant cache hit.
[2023-03-19 21:03:22] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 21:03:23] [INFO ] Implicit Places using invariants and state equation in 1849 ms returned []
Implicit Place search using SMT with State Equation took 2435 ms to find 0 implicit places.
[2023-03-19 21:03:24] [INFO ] Redundant transitions in 921 ms returned []
[2023-03-19 21:03:24] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2023-03-19 21:03:24] [INFO ] Invariant cache hit.
[2023-03-19 21:03:27] [INFO ] Dead Transitions using invariants and state equation in 2558 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6131 ms. Remains : 305/305 places, 7808/7808 transitions.
Ending property specific reduction for Szymanski-PT-b10-UpperBounds-07 in 21305 ms.
Starting property specific reduction for Szymanski-PT-b10-UpperBounds-10
Normalized transition count is 2604 out of 7808 initially.
// Phase 1: matrix 2604 rows 305 cols
[2023-03-19 21:03:27] [INFO ] Computed 3 place invariants in 13 ms
Incomplete random walk after 10002 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :4
[2023-03-19 21:03:27] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
// Phase 1: matrix 2604 rows 305 cols
[2023-03-19 21:03:27] [INFO ] Computed 3 place invariants in 18 ms
[2023-03-19 21:03:27] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-19 21:03:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 21:03:27] [INFO ] [Real]Absence check using state equation in 489 ms returned sat
[2023-03-19 21:03:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 21:03:27] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2023-03-19 21:03:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 21:03:28] [INFO ] [Nat]Absence check using state equation in 485 ms returned sat
[2023-03-19 21:03:28] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 21:03:31] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-19 21:03:32] [INFO ] [Nat]Added 147 Read/Feed constraints in 4454 ms returned unknown
Current structural bounds on expressions (after SMT) : [11] Max seen :[8]
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 180 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 184 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 21:03:33] [INFO ] Computed 3 place invariants in 15 ms
Incomplete random walk after 1000006 steps, including 2 resets, run finished after 1249 ms. (steps per millisecond=800 ) properties (out of 1) seen :9
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 810 ms. (steps per millisecond=1234 ) properties (out of 1) seen :10
[2023-03-19 21:03:35] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
// Phase 1: matrix 2604 rows 305 cols
[2023-03-19 21:03:35] [INFO ] Computed 3 place invariants in 21 ms
[2023-03-19 21:03:35] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-19 21:03:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 21:03:35] [INFO ] [Real]Absence check using state equation in 496 ms returned sat
[2023-03-19 21:03:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 21:03:35] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-19 21:03:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 21:03:36] [INFO ] [Nat]Absence check using state equation in 417 ms returned sat
[2023-03-19 21:03:36] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 21:03:39] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-19 21:03:42] [INFO ] [Nat]Added 147 Read/Feed constraints in 6055 ms returned unknown
Current structural bounds on expressions (after SMT) : [11] Max seen :[10]
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 182 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.
[2023-03-19 21:03:42] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2023-03-19 21:03:42] [INFO ] Invariant cache hit.
[2023-03-19 21:03:43] [INFO ] Implicit Places using invariants in 542 ms returned []
[2023-03-19 21:03:43] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2023-03-19 21:03:43] [INFO ] Invariant cache hit.
[2023-03-19 21:03:43] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 21:03:46] [INFO ] Implicit Places using invariants and state equation in 3357 ms returned []
Implicit Place search using SMT with State Equation took 3901 ms to find 0 implicit places.
[2023-03-19 21:03:47] [INFO ] Redundant transitions in 658 ms returned []
[2023-03-19 21:03:47] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2023-03-19 21:03:47] [INFO ] Invariant cache hit.
[2023-03-19 21:03:49] [INFO ] Dead Transitions using invariants and state equation in 2465 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7211 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 21:03:49] [INFO ] Computed 3 place invariants in 18 ms
Incomplete random walk after 1000004 steps, including 2 resets, run finished after 1011 ms. (steps per millisecond=989 ) properties (out of 1) seen :9
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 807 ms. (steps per millisecond=1239 ) properties (out of 1) seen :9
[2023-03-19 21:03:51] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
// Phase 1: matrix 2604 rows 305 cols
[2023-03-19 21:03:51] [INFO ] Computed 3 place invariants in 22 ms
[2023-03-19 21:03:51] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-19 21:03:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 21:03:52] [INFO ] [Real]Absence check using state equation in 505 ms returned sat
[2023-03-19 21:03:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 21:03:52] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-19 21:03:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 21:03:52] [INFO ] [Nat]Absence check using state equation in 419 ms returned sat
[2023-03-19 21:03:52] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 21:03:55] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-19 21:03:58] [INFO ] [Nat]Added 147 Read/Feed constraints in 6040 ms returned unknown
Current structural bounds on expressions (after SMT) : [11] Max seen :[10]
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 195 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 175 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
[2023-03-19 21:03:59] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2023-03-19 21:03:59] [INFO ] Invariant cache hit.
[2023-03-19 21:03:59] [INFO ] Implicit Places using invariants in 545 ms returned []
[2023-03-19 21:03:59] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2023-03-19 21:03:59] [INFO ] Invariant cache hit.
[2023-03-19 21:04:00] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 21:04:01] [INFO ] Implicit Places using invariants and state equation in 2181 ms returned []
Implicit Place search using SMT with State Equation took 2728 ms to find 0 implicit places.
[2023-03-19 21:04:02] [INFO ] Redundant transitions in 889 ms returned []
[2023-03-19 21:04:02] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2023-03-19 21:04:02] [INFO ] Invariant cache hit.
[2023-03-19 21:04:05] [INFO ] Dead Transitions using invariants and state equation in 2464 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6267 ms. Remains : 305/305 places, 7808/7808 transitions.
Ending property specific reduction for Szymanski-PT-b10-UpperBounds-10 in 38020 ms.
Starting property specific reduction for Szymanski-PT-b10-UpperBounds-12
Normalized transition count is 2604 out of 7808 initially.
// Phase 1: matrix 2604 rows 305 cols
[2023-03-19 21:04:05] [INFO ] Computed 3 place invariants in 15 ms
Incomplete random walk after 10007 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
[2023-03-19 21:04:05] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
// Phase 1: matrix 2604 rows 305 cols
[2023-03-19 21:04:05] [INFO ] Computed 3 place invariants in 16 ms
[2023-03-19 21:04:05] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-19 21:04:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 21:04:05] [INFO ] [Real]Absence check using state equation in 446 ms returned sat
[2023-03-19 21:04:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 21:04:05] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-19 21:04:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 21:04:06] [INFO ] [Nat]Absence check using state equation in 434 ms returned sat
[2023-03-19 21:04:06] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 21:04:08] [INFO ] [Nat]Added 147 Read/Feed constraints in 1892 ms returned sat
[2023-03-19 21:04:08] [INFO ] Deduced a trap composed of 130 places in 598 ms of which 0 ms to minimize.
[2023-03-19 21:04:09] [INFO ] Deduced a trap composed of 137 places in 566 ms of which 1 ms to minimize.
[2023-03-19 21:04:10] [INFO ] Deduced a trap composed of 129 places in 554 ms of which 1 ms to minimize.
[2023-03-19 21:04:10] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1929 ms
[2023-03-19 21:04:10] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2593 transitions) in 341 ms.
[2023-03-19 21:04:10] [INFO ] Added : 0 causal constraints over 0 iterations in 495 ms. Result :sat
Minimization took 179 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
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 182 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 21:04:11] [INFO ] Computed 3 place invariants in 21 ms
Incomplete random walk after 1000004 steps, including 2 resets, run finished after 1099 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 838 ms. (steps per millisecond=1193 ) properties (out of 1) seen :1
FORMULA Szymanski-PT-b10-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Ending property specific reduction for Szymanski-PT-b10-UpperBounds-12 in 7821 ms.
Starting property specific reduction for Szymanski-PT-b10-UpperBounds-13
[2023-03-19 21:04:13] [INFO ] Invariant cache hit.
Incomplete random walk after 10005 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
[2023-03-19 21:04:13] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
// Phase 1: matrix 2604 rows 305 cols
[2023-03-19 21:04:13] [INFO ] Computed 3 place invariants in 18 ms
[2023-03-19 21:04:13] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-19 21:04:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 21:04:13] [INFO ] [Real]Absence check using state equation in 438 ms returned sat
[2023-03-19 21:04:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 21:04:13] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-19 21:04:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 21:04:14] [INFO ] [Nat]Absence check using state equation in 467 ms returned sat
[2023-03-19 21:04:14] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 21:04:15] [INFO ] [Nat]Added 147 Read/Feed constraints in 1674 ms returned sat
[2023-03-19 21:04:16] [INFO ] Deduced a trap composed of 138 places in 582 ms of which 1 ms to minimize.
[2023-03-19 21:04:17] [INFO ] Deduced a trap composed of 143 places in 576 ms of which 1 ms to minimize.
[2023-03-19 21:04:18] [INFO ] Deduced a trap composed of 84 places in 559 ms of which 0 ms to minimize.
[2023-03-19 21:04:18] [INFO ] Deduced a trap composed of 130 places in 556 ms of which 1 ms to minimize.
[2023-03-19 21:04:18] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:733)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
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 170 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 170 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 21:04:18] [INFO ] Computed 3 place invariants in 18 ms
Incomplete random walk after 1000006 steps, including 2 resets, run finished after 970 ms. (steps per millisecond=1030 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 885 ms. (steps per millisecond=1129 ) properties (out of 1) seen :0
[2023-03-19 21:04:20] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
// Phase 1: matrix 2604 rows 305 cols
[2023-03-19 21:04:20] [INFO ] Computed 3 place invariants in 16 ms
[2023-03-19 21:04:20] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-19 21:04:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 21:04:21] [INFO ] [Real]Absence check using state equation in 438 ms returned sat
[2023-03-19 21:04:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 21:04:21] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-19 21:04:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 21:04:21] [INFO ] [Nat]Absence check using state equation in 460 ms returned sat
[2023-03-19 21:04:21] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 21:04:23] [INFO ] [Nat]Added 147 Read/Feed constraints in 1632 ms returned sat
[2023-03-19 21:04:24] [INFO ] Deduced a trap composed of 138 places in 591 ms of which 1 ms to minimize.
[2023-03-19 21:04:24] [INFO ] Deduced a trap composed of 143 places in 587 ms of which 0 ms to minimize.
[2023-03-19 21:04:25] [INFO ] Deduced a trap composed of 84 places in 564 ms of which 1 ms to minimize.
[2023-03-19 21:04:26] [INFO ] Deduced a trap composed of 130 places in 575 ms of which 1 ms to minimize.
[2023-03-19 21:04:26] [INFO ] Deduced a trap composed of 136 places in 574 ms of which 1 ms to minimize.
[2023-03-19 21:04:27] [INFO ] Deduced a trap composed of 50 places in 595 ms of which 0 ms to minimize.
[2023-03-19 21:04:28] [INFO ] Deduced a trap composed of 137 places in 577 ms of which 0 ms to minimize.
[2023-03-19 21:04:28] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 4839 ms
[2023-03-19 21:04:28] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2593 transitions) in 332 ms.
[2023-03-19 21:04:28] [INFO ] Added : 3 causal constraints over 2 iterations in 640 ms. Result :sat
Minimization took 1784 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
FORMULA Szymanski-PT-b10-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Ending property specific reduction for Szymanski-PT-b10-UpperBounds-13 in 18007 ms.
[2023-03-19 21:04:31] [INFO ] Flatten gal took : 449 ms
[2023-03-19 21:04:31] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2023-03-19 21:04:31] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 305 places, 7808 transitions and 31360 arcs took 33 ms.
Total runtime 151503 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running Szymanski (PT), instance b10
Examination UpperBounds
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/UpperBoundParse.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//upper_bound//smart

PNML FILE: model.pnml
Petri model created: 305 places, 7808 transitions, 31360 arcs.
Final Score: 90805.631
Took : 116 seconds
Bounds file is: UpperBounds.xml
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 2282584 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16095292 kB

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
Caught signal 15, terminating.

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-b10"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="smartxred"
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 smartxred"
echo " Input is Szymanski-PT-b10, 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 r491-tall-167912710500485"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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