fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r113-smll-162075355700080
Last Updated
Jun 28, 2021

About the Execution of 2020-gold for FlexibleBarrier-PT-22b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
4300.128 3600000.00 482624.00 1008.90 TTFTTFTFFTTFTTFF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r113-smll-162075355700080.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2021-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2020
Input is FlexibleBarrier-PT-22b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r113-smll-162075355700080
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.1M
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 107K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 90K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Mar 28 16:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 28 16:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 28 16:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 23 11:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 23 11:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 22 19:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Mar 22 19:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 4 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 1.8M May 5 16:51 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME FlexibleBarrier-PT-22b-ReachabilityFireability-00
FORMULA_NAME FlexibleBarrier-PT-22b-ReachabilityFireability-01
FORMULA_NAME FlexibleBarrier-PT-22b-ReachabilityFireability-02
FORMULA_NAME FlexibleBarrier-PT-22b-ReachabilityFireability-03
FORMULA_NAME FlexibleBarrier-PT-22b-ReachabilityFireability-04
FORMULA_NAME FlexibleBarrier-PT-22b-ReachabilityFireability-05
FORMULA_NAME FlexibleBarrier-PT-22b-ReachabilityFireability-06
FORMULA_NAME FlexibleBarrier-PT-22b-ReachabilityFireability-07
FORMULA_NAME FlexibleBarrier-PT-22b-ReachabilityFireability-08
FORMULA_NAME FlexibleBarrier-PT-22b-ReachabilityFireability-09
FORMULA_NAME FlexibleBarrier-PT-22b-ReachabilityFireability-10
FORMULA_NAME FlexibleBarrier-PT-22b-ReachabilityFireability-11
FORMULA_NAME FlexibleBarrier-PT-22b-ReachabilityFireability-12
FORMULA_NAME FlexibleBarrier-PT-22b-ReachabilityFireability-13
FORMULA_NAME FlexibleBarrier-PT-22b-ReachabilityFireability-14
FORMULA_NAME FlexibleBarrier-PT-22b-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1620944705610

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-13 22:25:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2021-05-13 22:25:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 22:25:09] [INFO ] Load time of PNML (sax parser for PT used): 602 ms
[2021-05-13 22:25:09] [INFO ] Transformed 6478 places.
[2021-05-13 22:25:09] [INFO ] Transformed 7469 transitions.
[2021-05-13 22:25:09] [INFO ] Found NUPN structural information;
[2021-05-13 22:25:09] [INFO ] Parsed PT model containing 6478 places and 7469 transitions in 764 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 171 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 68 resets, run finished after 204 ms. (steps per millisecond=49 ) properties seen :[0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1]
FORMULA FlexibleBarrier-PT-22b-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-22b-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 25 ms. (steps per millisecond=400 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 20 ms. (steps per millisecond=500 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 31 ms. (steps per millisecond=322 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 21 ms. (steps per millisecond=476 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 31 ms. (steps per millisecond=322 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 58 ms. (steps per millisecond=172 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 16 ms. (steps per millisecond=625 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 12 ms. (steps per millisecond=833 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 14 ms. (steps per millisecond=714 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 18 ms. (steps per millisecond=555 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 24 ms. (steps per millisecond=416 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 7469 rows 6478 cols
[2021-05-13 22:25:11] [INFO ] Computed 24 place invariants in 1183 ms
[2021-05-13 22:25:14] [INFO ] [Real]Absence check using 24 positive place invariants in 663 ms returned sat
[2021-05-13 22:25:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 22:25:16] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 22:25:16] [INFO ] [Real]Absence check using state equation in 2655 ms returned unknown
[2021-05-13 22:25:18] [INFO ] [Real]Absence check using 24 positive place invariants in 628 ms returned sat
[2021-05-13 22:25:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 22:25:21] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 22:25:21] [INFO ] [Real]Absence check using state equation in 2979 ms returned (error "Failed to check-sat")
[2021-05-13 22:25:23] [INFO ] [Real]Absence check using 24 positive place invariants in 619 ms returned sat
[2021-05-13 22:25:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 22:25:26] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 22:25:26] [INFO ] [Real]Absence check using state equation in 3100 ms returned (error "Failed to check-sat")
[2021-05-13 22:25:28] [INFO ] [Real]Absence check using 24 positive place invariants in 579 ms returned sat
[2021-05-13 22:25:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 22:25:31] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 22:25:31] [INFO ] [Real]Absence check using state equation in 3193 ms returned (error "Failed to check-sat")
[2021-05-13 22:25:33] [INFO ] [Real]Absence check using 24 positive place invariants in 717 ms returned sat
[2021-05-13 22:25:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 22:25:36] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 22:25:36] [INFO ] [Real]Absence check using state equation in 2906 ms returned unknown
[2021-05-13 22:25:38] [INFO ] [Real]Absence check using 24 positive place invariants in 730 ms returned sat
[2021-05-13 22:25:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 22:25:41] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 22:25:41] [INFO ] [Real]Absence check using state equation in 2983 ms returned unknown
[2021-05-13 22:25:43] [INFO ] [Real]Absence check using 24 positive place invariants in 583 ms returned sat
[2021-05-13 22:25:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 22:25:46] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 22:25:46] [INFO ] [Real]Absence check using state equation in 3182 ms returned (error "Failed to check-sat")
[2021-05-13 22:25:48] [INFO ] [Real]Absence check using 24 positive place invariants in 520 ms returned unsat
[2021-05-13 22:25:49] [INFO ] [Real]Absence check using 24 positive place invariants in 579 ms returned sat
[2021-05-13 22:25:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 22:25:53] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 22:25:53] [INFO ] [Real]Absence check using state equation in 3422 ms returned (error "Failed to check-sat")
[2021-05-13 22:25:55] [INFO ] [Real]Absence check using 24 positive place invariants in 572 ms returned sat
[2021-05-13 22:25:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 22:25:58] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 22:25:58] [INFO ] [Real]Absence check using state equation in 3346 ms returned (error "Failed to check-sat")
[2021-05-13 22:26:00] [INFO ] [Real]Absence check using 24 positive place invariants in 568 ms returned sat
[2021-05-13 22:26:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 22:26:03] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 22:26:03] [INFO ] [Real]Absence check using state equation in 3404 ms returned (error "Failed to check-sat")
[2021-05-13 22:26:05] [INFO ] [Real]Absence check using 24 positive place invariants in 579 ms returned unsat
[2021-05-13 22:26:06] [INFO ] [Real]Absence check using 24 positive place invariants in 526 ms returned unsat
[2021-05-13 22:26:08] [INFO ] [Real]Absence check using 24 positive place invariants in 598 ms returned sat
[2021-05-13 22:26:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 22:26:11] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 22:26:11] [INFO ] [Real]Absence check using state equation in 3348 ms returned unknown
FORMULA FlexibleBarrier-PT-22b-ReachabilityFireability-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA FlexibleBarrier-PT-22b-ReachabilityFireability-12 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA FlexibleBarrier-PT-22b-ReachabilityFireability-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Support contains 39 out of 6478 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 6478/6478 places, 7469/7469 transitions.
Graph (trivial) has 5265 edges and 6478 vertex of which 104 / 6478 are part of one of the 17 SCC in 52 ms
Free SCC test removed 87 places
Drop transitions removed 105 transitions
Reduce isomorphic transitions removed 105 transitions.
Performed 1119 Post agglomeration using F-continuation condition.Transition count delta: 1119
Iterating post reduction 0 with 1224 rules applied. Total rules applied 1225 place count 6391 transition count 6245
Reduce places removed 1119 places and 0 transitions.
Iterating post reduction 1 with 1119 rules applied. Total rules applied 2344 place count 5272 transition count 6245
Performed 900 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 900 Pre rules applied. Total rules applied 2344 place count 5272 transition count 5345
Deduced a syphon composed of 900 places in 8 ms
Reduce places removed 900 places and 0 transitions.
Iterating global reduction 2 with 1800 rules applied. Total rules applied 4144 place count 4372 transition count 5345
Symmetric choice reduction at 2 with 2673 rule applications. Total rules 6817 place count 4372 transition count 5345
Deduced a syphon composed of 2673 places in 14 ms
Reduce places removed 2673 places and 2673 transitions.
Iterating global reduction 2 with 5346 rules applied. Total rules applied 12163 place count 1699 transition count 2672
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 12163 place count 1699 transition count 2655
Deduced a syphon composed of 17 places in 7 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 12197 place count 1682 transition count 2655
Symmetric choice reduction at 2 with 428 rule applications. Total rules 12625 place count 1682 transition count 2655
Deduced a syphon composed of 428 places in 9 ms
Reduce places removed 428 places and 428 transitions.
Iterating global reduction 2 with 856 rules applied. Total rules applied 13481 place count 1254 transition count 2227
Ensure Unique test removed 419 transitions
Reduce isomorphic transitions removed 419 transitions.
Iterating post reduction 2 with 419 rules applied. Total rules applied 13900 place count 1254 transition count 1808
Performed 126 Post agglomeration using F-continuation condition.Transition count delta: 126
Deduced a syphon composed of 126 places in 2 ms
Reduce places removed 126 places and 0 transitions.
Iterating global reduction 3 with 252 rules applied. Total rules applied 14152 place count 1128 transition count 1682
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 14162 place count 1123 transition count 1682
Free-agglomeration rule applied 391 times.
Iterating global reduction 3 with 391 rules applied. Total rules applied 14553 place count 1123 transition count 1291
Reduce places removed 391 places and 0 transitions.
Iterating post reduction 3 with 391 rules applied. Total rules applied 14944 place count 732 transition count 1291
Symmetric choice reduction at 4 with 84 rule applications. Total rules 15028 place count 732 transition count 1291
Deduced a syphon composed of 84 places in 1 ms
Reduce places removed 84 places and 84 transitions.
Iterating global reduction 4 with 168 rules applied. Total rules applied 15196 place count 648 transition count 1207
Ensure Unique test removed 84 transitions
Reduce isomorphic transitions removed 84 transitions.
Iterating post reduction 4 with 84 rules applied. Total rules applied 15280 place count 648 transition count 1123
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 15286 place count 648 transition count 1123
Drop transitions removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 5 with 13 rules applied. Total rules applied 15299 place count 648 transition count 1110
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 15300 place count 647 transition count 1109
Applied a total of 15300 rules in 2844 ms. Remains 647 /6478 variables (removed 5831) and now considering 1109/7469 (removed 6360) transitions.
Finished structural reductions, in 1 iterations. Remains : 647/6478 places, 1109/7469 transitions.
Incomplete random walk after 1000000 steps, including 6517 resets, run finished after 5039 ms. (steps per millisecond=198 ) properties seen :[0, 0, 1, 1, 0, 0, 1, 1, 0, 1, 0]
FORMULA FlexibleBarrier-PT-22b-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-22b-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-22b-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-22b-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-22b-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 28 resets, run finished after 827 ms. (steps per millisecond=1209 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 663 resets, run finished after 912 ms. (steps per millisecond=1096 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 669 resets, run finished after 963 ms. (steps per millisecond=1038 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 617 resets, run finished after 1048 ms. (steps per millisecond=954 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 17 resets, run finished after 653 ms. (steps per millisecond=1531 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 178 resets, run finished after 1112 ms. (steps per millisecond=899 ) properties seen :[0, 0, 0, 0, 0, 0]
[2021-05-13 22:26:25] [INFO ] Flow matrix only has 1072 transitions (discarded 37 similar events)
// Phase 1: matrix 1072 rows 647 cols
[2021-05-13 22:26:25] [INFO ] Computed 24 place invariants in 29 ms
[2021-05-13 22:26:25] [INFO ] [Real]Absence check using 24 positive place invariants in 41 ms returned sat
[2021-05-13 22:26:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 22:26:26] [INFO ] [Real]Absence check using state equation in 1362 ms returned sat
[2021-05-13 22:26:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-13 22:26:27] [INFO ] [Real]Added 1 Read/Feed constraints in 27 ms returned sat
[2021-05-13 22:26:27] [INFO ] Computed and/alt/rep : 1096/2183/1059 causal constraints in 134 ms.
[2021-05-13 22:26:27] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 22:26:27] [INFO ] [Nat]Absence check using 24 positive place invariants in 66 ms returned sat
[2021-05-13 22:26:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 22:26:29] [INFO ] [Nat]Absence check using state equation in 1527 ms returned sat
[2021-05-13 22:26:29] [INFO ] [Nat]Added 1 Read/Feed constraints in 8 ms returned sat
[2021-05-13 22:26:29] [INFO ] Computed and/alt/rep : 1096/2183/1059 causal constraints in 125 ms.
[2021-05-13 22:26:35] [INFO ] Added : 369 causal constraints over 74 iterations in 6370 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 35 ms.
[2021-05-13 22:26:36] [INFO ] [Real]Absence check using 24 positive place invariants in 65 ms returned sat
[2021-05-13 22:26:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 22:26:37] [INFO ] [Real]Absence check using state equation in 1581 ms returned sat
[2021-05-13 22:26:37] [INFO ] [Real]Added 1 Read/Feed constraints in 9 ms returned sat
[2021-05-13 22:26:38] [INFO ] Computed and/alt/rep : 1096/2183/1059 causal constraints in 120 ms.
[2021-05-13 22:26:38] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 22:26:38] [INFO ] [Nat]Absence check using 24 positive place invariants in 66 ms returned sat
[2021-05-13 22:26:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 22:26:40] [INFO ] [Nat]Absence check using state equation in 1635 ms returned sat
[2021-05-13 22:26:40] [INFO ] [Nat]Added 1 Read/Feed constraints in 9 ms returned sat
[2021-05-13 22:26:40] [INFO ] Computed and/alt/rep : 1096/2183/1059 causal constraints in 63 ms.
[2021-05-13 22:26:47] [INFO ] Added : 372 causal constraints over 76 iterations in 7437 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 34 ms.
[2021-05-13 22:26:48] [INFO ] [Real]Absence check using 24 positive place invariants in 63 ms returned sat
[2021-05-13 22:26:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 22:26:49] [INFO ] [Real]Absence check using state equation in 1442 ms returned sat
[2021-05-13 22:26:49] [INFO ] [Real]Added 1 Read/Feed constraints in 9 ms returned sat
[2021-05-13 22:26:49] [INFO ] Computed and/alt/rep : 1096/2183/1059 causal constraints in 69 ms.
[2021-05-13 22:26:49] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 22:26:50] [INFO ] [Nat]Absence check using 24 positive place invariants in 65 ms returned sat
[2021-05-13 22:26:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 22:26:51] [INFO ] [Nat]Absence check using state equation in 1688 ms returned sat
[2021-05-13 22:26:51] [INFO ] [Nat]Added 1 Read/Feed constraints in 8 ms returned sat
[2021-05-13 22:26:51] [INFO ] Computed and/alt/rep : 1096/2183/1059 causal constraints in 66 ms.
[2021-05-13 22:26:59] [INFO ] Added : 380 causal constraints over 76 iterations in 7221 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 34 ms.
[2021-05-13 22:26:59] [INFO ] [Real]Absence check using 24 positive place invariants in 43 ms returned sat
[2021-05-13 22:26:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 22:27:00] [INFO ] [Real]Absence check using state equation in 1476 ms returned sat
[2021-05-13 22:27:00] [INFO ] [Real]Added 1 Read/Feed constraints in 11 ms returned sat
[2021-05-13 22:27:01] [INFO ] Computed and/alt/rep : 1096/2183/1059 causal constraints in 103 ms.
[2021-05-13 22:27:01] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 22:27:01] [INFO ] [Nat]Absence check using 24 positive place invariants in 63 ms returned sat
[2021-05-13 22:27:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 22:27:03] [INFO ] [Nat]Absence check using state equation in 1494 ms returned sat
[2021-05-13 22:27:03] [INFO ] [Nat]Added 1 Read/Feed constraints in 9 ms returned sat
[2021-05-13 22:27:03] [INFO ] Computed and/alt/rep : 1096/2183/1059 causal constraints in 67 ms.
[2021-05-13 22:27:10] [INFO ] Added : 380 causal constraints over 76 iterations in 7481 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 33 ms.
[2021-05-13 22:27:11] [INFO ] [Real]Absence check using 24 positive place invariants in 62 ms returned sat
[2021-05-13 22:27:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 22:27:12] [INFO ] [Real]Absence check using state equation in 1647 ms returned sat
[2021-05-13 22:27:12] [INFO ] [Real]Added 1 Read/Feed constraints in 8 ms returned sat
[2021-05-13 22:27:12] [INFO ] Computed and/alt/rep : 1096/2183/1059 causal constraints in 67 ms.
[2021-05-13 22:27:13] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 22:27:13] [INFO ] [Nat]Absence check using 24 positive place invariants in 63 ms returned sat
[2021-05-13 22:27:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 22:27:15] [INFO ] [Nat]Absence check using state equation in 1777 ms returned sat
[2021-05-13 22:27:15] [INFO ] [Nat]Added 1 Read/Feed constraints in 8 ms returned sat
[2021-05-13 22:27:15] [INFO ] Computed and/alt/rep : 1096/2183/1059 causal constraints in 65 ms.
[2021-05-13 22:27:22] [INFO ] Added : 374 causal constraints over 76 iterations in 7539 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 34 ms.
[2021-05-13 22:27:23] [INFO ] [Real]Absence check using 24 positive place invariants in 83 ms returned sat
[2021-05-13 22:27:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 22:27:24] [INFO ] [Real]Absence check using state equation in 1671 ms returned sat
[2021-05-13 22:27:24] [INFO ] [Real]Added 1 Read/Feed constraints in 9 ms returned sat
[2021-05-13 22:27:24] [INFO ] Computed and/alt/rep : 1096/2183/1059 causal constraints in 81 ms.
[2021-05-13 22:27:25] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 22:27:25] [INFO ] [Nat]Absence check using 24 positive place invariants in 69 ms returned sat
[2021-05-13 22:27:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 22:27:27] [INFO ] [Nat]Absence check using state equation in 1706 ms returned sat
[2021-05-13 22:27:27] [INFO ] [Nat]Added 1 Read/Feed constraints in 10 ms returned sat
[2021-05-13 22:27:27] [INFO ] Computed and/alt/rep : 1096/2183/1059 causal constraints in 65 ms.
[2021-05-13 22:27:34] [INFO ] Added : 356 causal constraints over 72 iterations in 7038 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 31 ms.
Incomplete Parikh walk after 79500 steps, including 802 resets, run finished after 723 ms. (steps per millisecond=109 ) properties seen :[0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 80100 steps, including 769 resets, run finished after 466 ms. (steps per millisecond=171 ) properties seen :[0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 80800 steps, including 765 resets, run finished after 462 ms. (steps per millisecond=174 ) properties seen :[0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 81300 steps, including 759 resets, run finished after 474 ms. (steps per millisecond=171 ) properties seen :[0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 79400 steps, including 770 resets, run finished after 455 ms. (steps per millisecond=174 ) properties seen :[0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 78900 steps, including 781 resets, run finished after 460 ms. (steps per millisecond=171 ) properties seen :[0, 0, 0, 0, 0, 0] could not realise parikh vector
Support contains 29 out of 647 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 647/647 places, 1109/1109 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 640 transition count 1102
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 640 transition count 1102
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 23 place count 637 transition count 1099
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 26 place count 637 transition count 1096
Free-agglomeration rule applied 2 times with reduction of 1 identical transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 28 place count 637 transition count 1093
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 30 place count 635 transition count 1093
Applied a total of 30 rules in 122 ms. Remains 635 /647 variables (removed 12) and now considering 1093/1109 (removed 16) transitions.
Finished structural reductions, in 1 iterations. Remains : 635/647 places, 1093/1109 transitions.
Incomplete random walk after 1000000 steps, including 6063 resets, run finished after 5056 ms. (steps per millisecond=197 ) properties seen :[0, 0, 1, 0, 0, 0]
FORMULA FlexibleBarrier-PT-22b-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000000 steps, including 60 resets, run finished after 972 ms. (steps per millisecond=1028 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 638 resets, run finished after 910 ms. (steps per millisecond=1098 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 574 resets, run finished after 1043 ms. (steps per millisecond=958 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 15 resets, run finished after 653 ms. (steps per millisecond=1531 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 169 resets, run finished after 1107 ms. (steps per millisecond=903 ) properties seen :[0, 0, 0, 0, 0]
[2021-05-13 22:27:47] [INFO ] Flow matrix only has 1056 transitions (discarded 37 similar events)
// Phase 1: matrix 1056 rows 635 cols
[2021-05-13 22:27:47] [INFO ] Computed 24 place invariants in 19 ms
[2021-05-13 22:27:47] [INFO ] [Real]Absence check using 24 positive place invariants in 38 ms returned sat
[2021-05-13 22:27:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 22:27:48] [INFO ] [Real]Absence check using state equation in 1308 ms returned sat
[2021-05-13 22:27:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-13 22:27:48] [INFO ] [Real]Added 1 Read/Feed constraints in 8 ms returned sat
[2021-05-13 22:27:48] [INFO ] Computed and/alt/rep : 1082/2145/1045 causal constraints in 65 ms.
[2021-05-13 22:27:49] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 22:27:49] [INFO ] [Nat]Absence check using 24 positive place invariants in 66 ms returned sat
[2021-05-13 22:27:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 22:27:50] [INFO ] [Nat]Absence check using state equation in 1487 ms returned sat
[2021-05-13 22:27:50] [INFO ] [Nat]Added 1 Read/Feed constraints in 8 ms returned sat
[2021-05-13 22:27:51] [INFO ] Computed and/alt/rep : 1082/2145/1045 causal constraints in 62 ms.
[2021-05-13 22:27:58] [INFO ] Added : 367 causal constraints over 74 iterations in 7174 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 33 ms.
[2021-05-13 22:27:58] [INFO ] [Real]Absence check using 24 positive place invariants in 61 ms returned sat
[2021-05-13 22:27:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 22:28:00] [INFO ] [Real]Absence check using state equation in 1494 ms returned sat
[2021-05-13 22:28:00] [INFO ] [Real]Added 1 Read/Feed constraints in 12 ms returned sat
[2021-05-13 22:28:00] [INFO ] Computed and/alt/rep : 1082/2145/1045 causal constraints in 121 ms.
[2021-05-13 22:28:00] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 22:28:00] [INFO ] [Nat]Absence check using 24 positive place invariants in 63 ms returned sat
[2021-05-13 22:28:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 22:28:02] [INFO ] [Nat]Absence check using state equation in 1568 ms returned sat
[2021-05-13 22:28:02] [INFO ] [Nat]Added 1 Read/Feed constraints in 9 ms returned sat
[2021-05-13 22:28:02] [INFO ] Computed and/alt/rep : 1082/2145/1045 causal constraints in 74 ms.
[2021-05-13 22:28:09] [INFO ] Added : 372 causal constraints over 75 iterations in 7255 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 34 ms.
[2021-05-13 22:28:10] [INFO ] [Real]Absence check using 24 positive place invariants in 62 ms returned sat
[2021-05-13 22:28:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 22:28:11] [INFO ] [Real]Absence check using state equation in 1459 ms returned sat
[2021-05-13 22:28:11] [INFO ] [Real]Added 1 Read/Feed constraints in 8 ms returned sat
[2021-05-13 22:28:11] [INFO ] Computed and/alt/rep : 1082/2145/1045 causal constraints in 64 ms.
[2021-05-13 22:28:11] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 22:28:12] [INFO ] [Nat]Absence check using 24 positive place invariants in 65 ms returned sat
[2021-05-13 22:28:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 22:28:13] [INFO ] [Nat]Absence check using state equation in 1487 ms returned sat
[2021-05-13 22:28:13] [INFO ] [Nat]Added 1 Read/Feed constraints in 11 ms returned sat
[2021-05-13 22:28:13] [INFO ] Computed and/alt/rep : 1082/2145/1045 causal constraints in 61 ms.
[2021-05-13 22:28:21] [INFO ] Added : 397 causal constraints over 80 iterations in 7776 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 33 ms.
[2021-05-13 22:28:21] [INFO ] [Real]Absence check using 24 positive place invariants in 62 ms returned sat
[2021-05-13 22:28:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 22:28:23] [INFO ] [Real]Absence check using state equation in 1561 ms returned sat
[2021-05-13 22:28:23] [INFO ] [Real]Added 1 Read/Feed constraints in 9 ms returned sat
[2021-05-13 22:28:23] [INFO ] Computed and/alt/rep : 1082/2145/1045 causal constraints in 65 ms.
[2021-05-13 22:28:23] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 22:28:23] [INFO ] [Nat]Absence check using 24 positive place invariants in 65 ms returned sat
[2021-05-13 22:28:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 22:28:25] [INFO ] [Nat]Absence check using state equation in 1476 ms returned sat
[2021-05-13 22:28:25] [INFO ] [Nat]Added 1 Read/Feed constraints in 8 ms returned sat
[2021-05-13 22:28:25] [INFO ] Computed and/alt/rep : 1082/2145/1045 causal constraints in 85 ms.
[2021-05-13 22:28:32] [INFO ] Added : 361 causal constraints over 73 iterations in 7271 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 30 ms.
[2021-05-13 22:28:33] [INFO ] [Real]Absence check using 24 positive place invariants in 63 ms returned sat
[2021-05-13 22:28:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 22:28:34] [INFO ] [Real]Absence check using state equation in 1529 ms returned sat
[2021-05-13 22:28:34] [INFO ] [Real]Added 1 Read/Feed constraints in 9 ms returned sat
[2021-05-13 22:28:34] [INFO ] Computed and/alt/rep : 1082/2145/1045 causal constraints in 86 ms.
[2021-05-13 22:28:35] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 22:28:35] [INFO ] [Nat]Absence check using 24 positive place invariants in 67 ms returned sat
[2021-05-13 22:28:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 22:28:36] [INFO ] [Nat]Absence check using state equation in 1587 ms returned sat
[2021-05-13 22:28:36] [INFO ] [Nat]Added 1 Read/Feed constraints in 9 ms returned sat
[2021-05-13 22:28:36] [INFO ] Computed and/alt/rep : 1082/2145/1045 causal constraints in 64 ms.
[2021-05-13 22:28:44] [INFO ] Added : 377 causal constraints over 76 iterations in 7450 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 32 ms.
Incomplete Parikh walk after 80100 steps, including 733 resets, run finished after 646 ms. (steps per millisecond=123 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 58000 steps, including 590 resets, run finished after 329 ms. (steps per millisecond=176 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 81400 steps, including 756 resets, run finished after 455 ms. (steps per millisecond=178 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 77300 steps, including 732 resets, run finished after 433 ms. (steps per millisecond=178 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 67300 steps, including 647 resets, run finished after 381 ms. (steps per millisecond=176 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Support contains 27 out of 635 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 635/635 places, 1093/1093 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 635 transition count 1092
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 634 transition count 1092
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 632 transition count 1090
Symmetric choice reduction at 2 with 2 rule applications. Total rules 8 place count 632 transition count 1090
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 12 place count 630 transition count 1088
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 14 place count 630 transition count 1086
Applied a total of 14 rules in 58 ms. Remains 630 /635 variables (removed 5) and now considering 1086/1093 (removed 7) transitions.
Finished structural reductions, in 1 iterations. Remains : 630/635 places, 1086/1093 transitions.
Incomplete random walk after 1000000 steps, including 6072 resets, run finished after 4914 ms. (steps per millisecond=203 ) properties seen :[0, 1, 0, 0, 0]
FORMULA FlexibleBarrier-PT-22b-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 52 resets, run finished after 841 ms. (steps per millisecond=1189 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 579 resets, run finished after 1036 ms. (steps per millisecond=965 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 15 resets, run finished after 653 ms. (steps per millisecond=1531 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 176 resets, run finished after 1109 ms. (steps per millisecond=901 ) properties seen :[0, 0, 0, 0]
[2021-05-13 22:28:55] [INFO ] Flow matrix only has 1049 transitions (discarded 37 similar events)
// Phase 1: matrix 1049 rows 630 cols
[2021-05-13 22:28:55] [INFO ] Computed 24 place invariants in 22 ms
[2021-05-13 22:28:55] [INFO ] [Real]Absence check using 24 positive place invariants in 59 ms returned sat
[2021-05-13 22:28:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 22:28:56] [INFO ] [Real]Absence check using state equation in 1418 ms returned sat
[2021-05-13 22:28:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-13 22:28:56] [INFO ] [Real]Added 1 Read/Feed constraints in 9 ms returned sat
[2021-05-13 22:28:57] [INFO ] Computed and/alt/rep : 1075/2136/1038 causal constraints in 66 ms.
[2021-05-13 22:28:57] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 22:28:57] [INFO ] [Nat]Absence check using 24 positive place invariants in 57 ms returned sat
[2021-05-13 22:28:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 22:28:59] [INFO ] [Nat]Absence check using state equation in 1553 ms returned sat
[2021-05-13 22:28:59] [INFO ] [Nat]Added 1 Read/Feed constraints in 8 ms returned sat
[2021-05-13 22:28:59] [INFO ] Computed and/alt/rep : 1075/2136/1038 causal constraints in 65 ms.
[2021-05-13 22:29:06] [INFO ] Added : 368 causal constraints over 74 iterations in 7160 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 33 ms.
[2021-05-13 22:29:06] [INFO ] [Real]Absence check using 24 positive place invariants in 64 ms returned sat
[2021-05-13 22:29:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 22:29:08] [INFO ] [Real]Absence check using state equation in 1629 ms returned sat
[2021-05-13 22:29:08] [INFO ] [Real]Added 1 Read/Feed constraints in 8 ms returned sat
[2021-05-13 22:29:08] [INFO ] Computed and/alt/rep : 1075/2136/1038 causal constraints in 67 ms.
[2021-05-13 22:29:08] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 22:29:08] [INFO ] [Nat]Absence check using 24 positive place invariants in 60 ms returned sat
[2021-05-13 22:29:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 22:29:10] [INFO ] [Nat]Absence check using state equation in 1517 ms returned sat
[2021-05-13 22:29:10] [INFO ] [Nat]Added 1 Read/Feed constraints in 8 ms returned sat
[2021-05-13 22:29:10] [INFO ] Computed and/alt/rep : 1075/2136/1038 causal constraints in 67 ms.
[2021-05-13 22:29:17] [INFO ] Added : 375 causal constraints over 75 iterations in 7300 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 32 ms.
[2021-05-13 22:29:18] [INFO ] [Real]Absence check using 24 positive place invariants in 62 ms returned sat
[2021-05-13 22:29:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 22:29:19] [INFO ] [Real]Absence check using state equation in 1541 ms returned sat
[2021-05-13 22:29:19] [INFO ] [Real]Added 1 Read/Feed constraints in 9 ms returned sat
[2021-05-13 22:29:19] [INFO ] Computed and/alt/rep : 1075/2136/1038 causal constraints in 61 ms.
[2021-05-13 22:29:20] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 22:29:20] [INFO ] [Nat]Absence check using 24 positive place invariants in 61 ms returned sat
[2021-05-13 22:29:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 22:29:21] [INFO ] [Nat]Absence check using state equation in 1528 ms returned sat
[2021-05-13 22:29:21] [INFO ] [Nat]Added 1 Read/Feed constraints in 11 ms returned sat
[2021-05-13 22:29:21] [INFO ] Computed and/alt/rep : 1075/2136/1038 causal constraints in 65 ms.
[2021-05-13 22:29:29] [INFO ] Added : 370 causal constraints over 74 iterations in 7284 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 31 ms.
[2021-05-13 22:29:29] [INFO ] [Real]Absence check using 24 positive place invariants in 64 ms returned sat
[2021-05-13 22:29:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 22:29:31] [INFO ] [Real]Absence check using state equation in 1643 ms returned sat
[2021-05-13 22:29:31] [INFO ] [Real]Added 1 Read/Feed constraints in 8 ms returned sat
[2021-05-13 22:29:31] [INFO ] Computed and/alt/rep : 1075/2136/1038 causal constraints in 66 ms.
[2021-05-13 22:29:31] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 22:29:31] [INFO ] [Nat]Absence check using 24 positive place invariants in 62 ms returned sat
[2021-05-13 22:29:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 22:29:33] [INFO ] [Nat]Absence check using state equation in 1560 ms returned sat
[2021-05-13 22:29:33] [INFO ] [Nat]Added 1 Read/Feed constraints in 8 ms returned sat
[2021-05-13 22:29:33] [INFO ] Computed and/alt/rep : 1075/2136/1038 causal constraints in 63 ms.
[2021-05-13 22:29:40] [INFO ] Added : 361 causal constraints over 73 iterations in 6744 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 31 ms.
Incomplete Parikh walk after 75000 steps, including 702 resets, run finished after 674 ms. (steps per millisecond=111 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 76400 steps, including 717 resets, run finished after 432 ms. (steps per millisecond=176 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 76300 steps, including 717 resets, run finished after 435 ms. (steps per millisecond=175 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 77100 steps, including 712 resets, run finished after 429 ms. (steps per millisecond=179 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Support contains 26 out of 630 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 630/630 places, 1086/1086 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 629 transition count 1085
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 629 transition count 1085
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 628 transition count 1084
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 6 place count 628 transition count 1083
Applied a total of 6 rules in 49 ms. Remains 628 /630 variables (removed 2) and now considering 1083/1086 (removed 3) transitions.
Finished structural reductions, in 1 iterations. Remains : 628/630 places, 1083/1086 transitions.
Incomplete random walk after 1000000 steps, including 6055 resets, run finished after 4513 ms. (steps per millisecond=221 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 65 resets, run finished after 846 ms. (steps per millisecond=1182 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 577 resets, run finished after 1244 ms. (steps per millisecond=803 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 16 resets, run finished after 652 ms. (steps per millisecond=1533 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 180 resets, run finished after 1106 ms. (steps per millisecond=904 ) properties seen :[0, 0, 0, 0]
Interrupted probabilistic random walk after 3667932 steps, run timeout after 30001 ms. (steps per millisecond=122 ) properties seen :[0, 0, 0, 0]
Probabilistic random walk after 3667932 steps, saw 812468 distinct states, run finished after 30001 ms. (steps per millisecond=122 ) properties seen :[0, 0, 0, 0]
[2021-05-13 22:30:20] [INFO ] Flow matrix only has 1046 transitions (discarded 37 similar events)
// Phase 1: matrix 1046 rows 628 cols
[2021-05-13 22:30:20] [INFO ] Computed 24 place invariants in 19 ms
[2021-05-13 22:30:20] [INFO ] [Real]Absence check using 24 positive place invariants in 37 ms returned sat
[2021-05-13 22:30:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 22:30:22] [INFO ] [Real]Absence check using state equation in 1456 ms returned sat
[2021-05-13 22:30:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-13 22:30:22] [INFO ] [Real]Added 1 Read/Feed constraints in 9 ms returned sat
[2021-05-13 22:30:22] [INFO ] Computed and/alt/rep : 1072/2131/1035 causal constraints in 66 ms.
[2021-05-13 22:30:22] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 22:30:22] [INFO ] [Nat]Absence check using 24 positive place invariants in 61 ms returned sat
[2021-05-13 22:30:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 22:30:24] [INFO ] [Nat]Absence check using state equation in 1492 ms returned sat
[2021-05-13 22:30:24] [INFO ] [Nat]Added 1 Read/Feed constraints in 9 ms returned sat
[2021-05-13 22:30:24] [INFO ] Computed and/alt/rep : 1072/2131/1035 causal constraints in 92 ms.
[2021-05-13 22:30:31] [INFO ] Added : 371 causal constraints over 75 iterations in 7267 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 33 ms.
[2021-05-13 22:30:32] [INFO ] [Real]Absence check using 24 positive place invariants in 62 ms returned sat
[2021-05-13 22:30:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 22:30:33] [INFO ] [Real]Absence check using state equation in 1576 ms returned sat
[2021-05-13 22:30:33] [INFO ] [Real]Added 1 Read/Feed constraints in 8 ms returned sat
[2021-05-13 22:30:33] [INFO ] Computed and/alt/rep : 1072/2131/1035 causal constraints in 58 ms.
[2021-05-13 22:30:34] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 22:30:34] [INFO ] [Nat]Absence check using 24 positive place invariants in 60 ms returned sat
[2021-05-13 22:30:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 22:30:35] [INFO ] [Nat]Absence check using state equation in 1709 ms returned sat
[2021-05-13 22:30:35] [INFO ] [Nat]Added 1 Read/Feed constraints in 8 ms returned sat
[2021-05-13 22:30:36] [INFO ] Computed and/alt/rep : 1072/2131/1035 causal constraints in 60 ms.
[2021-05-13 22:30:42] [INFO ] Added : 375 causal constraints over 75 iterations in 6991 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 34 ms.
[2021-05-13 22:30:43] [INFO ] [Real]Absence check using 24 positive place invariants in 60 ms returned sat
[2021-05-13 22:30:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 22:30:44] [INFO ] [Real]Absence check using state equation in 1484 ms returned sat
[2021-05-13 22:30:44] [INFO ] [Real]Added 1 Read/Feed constraints in 8 ms returned sat
[2021-05-13 22:30:45] [INFO ] Computed and/alt/rep : 1072/2131/1035 causal constraints in 71 ms.
[2021-05-13 22:30:45] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 22:30:45] [INFO ] [Nat]Absence check using 24 positive place invariants in 41 ms returned sat
[2021-05-13 22:30:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 22:30:46] [INFO ] [Nat]Absence check using state equation in 1412 ms returned sat
[2021-05-13 22:30:46] [INFO ] [Nat]Added 1 Read/Feed constraints in 9 ms returned sat
[2021-05-13 22:30:46] [INFO ] Computed and/alt/rep : 1072/2131/1035 causal constraints in 73 ms.
[2021-05-13 22:30:53] [INFO ] Added : 361 causal constraints over 73 iterations in 6780 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 31 ms.
[2021-05-13 22:30:53] [INFO ] [Real]Absence check using 24 positive place invariants in 65 ms returned sat
[2021-05-13 22:30:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 22:30:55] [INFO ] [Real]Absence check using state equation in 1595 ms returned sat
[2021-05-13 22:30:55] [INFO ] [Real]Added 1 Read/Feed constraints in 8 ms returned sat
[2021-05-13 22:30:55] [INFO ] Computed and/alt/rep : 1072/2131/1035 causal constraints in 56 ms.
[2021-05-13 22:30:55] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 22:30:55] [INFO ] [Nat]Absence check using 24 positive place invariants in 41 ms returned sat
[2021-05-13 22:30:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 22:30:57] [INFO ] [Nat]Absence check using state equation in 1469 ms returned sat
[2021-05-13 22:30:57] [INFO ] [Nat]Added 1 Read/Feed constraints in 8 ms returned sat
[2021-05-13 22:30:57] [INFO ] Computed and/alt/rep : 1072/2131/1035 causal constraints in 61 ms.
[2021-05-13 22:31:04] [INFO ] Added : 359 causal constraints over 72 iterations in 7133 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 33 ms.
Incomplete Parikh walk after 73400 steps, including 725 resets, run finished after 689 ms. (steps per millisecond=106 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 73900 steps, including 723 resets, run finished after 425 ms. (steps per millisecond=173 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 77200 steps, including 741 resets, run finished after 614 ms. (steps per millisecond=125 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 75700 steps, including 719 resets, run finished after 427 ms. (steps per millisecond=177 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Support contains 26 out of 628 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 628/628 places, 1083/1083 transitions.
Applied a total of 0 rules in 22 ms. Remains 628 /628 variables (removed 0) and now considering 1083/1083 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 628/628 places, 1083/1083 transitions.
Starting structural reductions, iteration 0 : 628/628 places, 1083/1083 transitions.
Applied a total of 0 rules in 19 ms. Remains 628 /628 variables (removed 0) and now considering 1083/1083 (removed 0) transitions.
[2021-05-13 22:31:06] [INFO ] Flow matrix only has 1046 transitions (discarded 37 similar events)
// Phase 1: matrix 1046 rows 628 cols
[2021-05-13 22:31:07] [INFO ] Computed 24 place invariants in 20 ms
[2021-05-13 22:31:08] [INFO ] Implicit Places using invariants in 1523 ms returned []
[2021-05-13 22:31:08] [INFO ] Flow matrix only has 1046 transitions (discarded 37 similar events)
// Phase 1: matrix 1046 rows 628 cols
[2021-05-13 22:31:08] [INFO ] Computed 24 place invariants in 34 ms
[2021-05-13 22:31:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-13 22:31:15] [INFO ] Implicit Places using invariants and state equation in 6486 ms returned []
Implicit Place search using SMT with State Equation took 8011 ms to find 0 implicit places.
[2021-05-13 22:31:15] [INFO ] Redundant transitions in 167 ms returned []
[2021-05-13 22:31:15] [INFO ] Flow matrix only has 1046 transitions (discarded 37 similar events)
// Phase 1: matrix 1046 rows 628 cols
[2021-05-13 22:31:15] [INFO ] Computed 24 place invariants in 33 ms
[2021-05-13 22:31:17] [INFO ] Dead Transitions using invariants and state equation in 2214 ms returned []
Finished structural reductions, in 1 iterations. Remains : 628/628 places, 1083/1083 transitions.
Incomplete random walk after 100000 steps, including 603 resets, run finished after 467 ms. (steps per millisecond=214 ) properties seen :[0, 0, 0, 0]
[2021-05-13 22:31:17] [INFO ] Flow matrix only has 1046 transitions (discarded 37 similar events)
// Phase 1: matrix 1046 rows 628 cols
[2021-05-13 22:31:17] [INFO ] Computed 24 place invariants in 19 ms
[2021-05-13 22:31:18] [INFO ] [Real]Absence check using 24 positive place invariants in 58 ms returned sat
[2021-05-13 22:31:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 22:31:19] [INFO ] [Real]Absence check using state equation in 1495 ms returned sat
[2021-05-13 22:31:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-13 22:31:19] [INFO ] [Real]Added 1 Read/Feed constraints in 9 ms returned sat
[2021-05-13 22:31:19] [INFO ] Computed and/alt/rep : 1072/2131/1035 causal constraints in 66 ms.
[2021-05-13 22:31:19] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 22:31:20] [INFO ] [Nat]Absence check using 24 positive place invariants in 60 ms returned sat
[2021-05-13 22:31:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 22:31:21] [INFO ] [Nat]Absence check using state equation in 1486 ms returned sat
[2021-05-13 22:31:21] [INFO ] [Nat]Added 1 Read/Feed constraints in 9 ms returned sat
[2021-05-13 22:31:21] [INFO ] Computed and/alt/rep : 1072/2131/1035 causal constraints in 64 ms.
[2021-05-13 22:31:28] [INFO ] Added : 371 causal constraints over 75 iterations in 7312 ms. Result :sat
[2021-05-13 22:31:29] [INFO ] [Real]Absence check using 24 positive place invariants in 65 ms returned sat
[2021-05-13 22:31:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 22:31:30] [INFO ] [Real]Absence check using state equation in 1605 ms returned sat
[2021-05-13 22:31:30] [INFO ] [Real]Added 1 Read/Feed constraints in 9 ms returned sat
[2021-05-13 22:31:31] [INFO ] Computed and/alt/rep : 1072/2131/1035 causal constraints in 106 ms.
[2021-05-13 22:31:31] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 22:31:31] [INFO ] [Nat]Absence check using 24 positive place invariants in 61 ms returned sat
[2021-05-13 22:31:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 22:31:33] [INFO ] [Nat]Absence check using state equation in 1475 ms returned sat
[2021-05-13 22:31:33] [INFO ] [Nat]Added 1 Read/Feed constraints in 8 ms returned sat
[2021-05-13 22:31:33] [INFO ] Computed and/alt/rep : 1072/2131/1035 causal constraints in 60 ms.
[2021-05-13 22:31:38] [INFO ] Added : 375 causal constraints over 75 iterations in 5871 ms. Result :sat
[2021-05-13 22:31:39] [INFO ] [Real]Absence check using 24 positive place invariants in 58 ms returned sat
[2021-05-13 22:31:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 22:31:40] [INFO ] [Real]Absence check using state equation in 1557 ms returned sat
[2021-05-13 22:31:40] [INFO ] [Real]Added 1 Read/Feed constraints in 9 ms returned sat
[2021-05-13 22:31:40] [INFO ] Computed and/alt/rep : 1072/2131/1035 causal constraints in 69 ms.
[2021-05-13 22:31:41] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 22:31:41] [INFO ] [Nat]Absence check using 24 positive place invariants in 40 ms returned sat
[2021-05-13 22:31:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 22:31:42] [INFO ] [Nat]Absence check using state equation in 1407 ms returned sat
[2021-05-13 22:31:42] [INFO ] [Nat]Added 1 Read/Feed constraints in 9 ms returned sat
[2021-05-13 22:31:42] [INFO ] Computed and/alt/rep : 1072/2131/1035 causal constraints in 66 ms.
[2021-05-13 22:31:48] [INFO ] Added : 361 causal constraints over 73 iterations in 5425 ms. Result :sat
[2021-05-13 22:31:48] [INFO ] [Real]Absence check using 24 positive place invariants in 65 ms returned sat
[2021-05-13 22:31:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 22:31:50] [INFO ] [Real]Absence check using state equation in 1734 ms returned sat
[2021-05-13 22:31:50] [INFO ] [Real]Added 1 Read/Feed constraints in 9 ms returned sat
[2021-05-13 22:31:50] [INFO ] Computed and/alt/rep : 1072/2131/1035 causal constraints in 66 ms.
[2021-05-13 22:31:50] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 22:31:50] [INFO ] [Nat]Absence check using 24 positive place invariants in 63 ms returned sat
[2021-05-13 22:31:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 22:31:52] [INFO ] [Nat]Absence check using state equation in 1452 ms returned sat
[2021-05-13 22:31:52] [INFO ] [Nat]Added 1 Read/Feed constraints in 8 ms returned sat
[2021-05-13 22:31:52] [INFO ] Computed and/alt/rep : 1072/2131/1035 causal constraints in 69 ms.
[2021-05-13 22:31:57] [INFO ] Added : 359 causal constraints over 72 iterations in 5759 ms. Result :sat
Ensure Unique test removed 37 transitions
Reduce isomorphic transitions removed 37 transitions.
Performed 133 Post agglomeration using F-continuation condition.Transition count delta: 133
Iterating post reduction 0 with 170 rules applied. Total rules applied 170 place count 628 transition count 913
Reduce places removed 133 places and 0 transitions.
Ensure Unique test removed 133 transitions
Reduce isomorphic transitions removed 133 transitions.
Iterating post reduction 1 with 266 rules applied. Total rules applied 436 place count 495 transition count 780
Symmetric choice reduction at 2 with 126 rule applications. Total rules 562 place count 495 transition count 780
Deduced a syphon composed of 126 places in 1 ms
Reduce places removed 126 places and 126 transitions.
Iterating global reduction 2 with 252 rules applied. Total rules applied 814 place count 369 transition count 654
Ensure Unique test removed 104 transitions
Reduce isomorphic transitions removed 104 transitions.
Iterating post reduction 2 with 104 rules applied. Total rules applied 918 place count 369 transition count 550
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 919 place count 369 transition count 550
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 920 place count 369 transition count 549
Applied a total of 920 rules in 59 ms. Remains 369 /628 variables (removed 259) and now considering 549/1083 (removed 534) transitions.
// Phase 1: matrix 549 rows 369 cols
[2021-05-13 22:31:57] [INFO ] Computed 24 place invariants in 7 ms
[2021-05-13 22:31:58] [INFO ] [Real]Absence check using 24 positive place invariants in 28 ms returned sat
[2021-05-13 22:31:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 22:31:58] [INFO ] [Real]Absence check using state equation in 548 ms returned sat
[2021-05-13 22:31:58] [INFO ] Computed and/alt/rep : 538/1135/538 causal constraints in 55 ms.
[2021-05-13 22:31:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 22:31:59] [INFO ] [Nat]Absence check using 24 positive place invariants in 38 ms returned sat
[2021-05-13 22:31:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 22:31:59] [INFO ] [Nat]Absence check using state equation in 555 ms returned sat
[2021-05-13 22:31:59] [INFO ] Computed and/alt/rep : 538/1135/538 causal constraints in 52 ms.
[2021-05-13 22:32:01] [INFO ] Added : 152 causal constraints over 31 iterations in 1688 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 17 ms.
[2021-05-13 22:32:01] [INFO ] [Real]Absence check using 24 positive place invariants in 28 ms returned sat
[2021-05-13 22:32:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 22:32:02] [INFO ] [Real]Absence check using state equation in 537 ms returned sat
[2021-05-13 22:32:02] [INFO ] Computed and/alt/rep : 538/1135/538 causal constraints in 49 ms.
[2021-05-13 22:32:02] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 22:32:02] [INFO ] [Nat]Absence check using 24 positive place invariants in 64 ms returned sat
[2021-05-13 22:32:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 22:32:03] [INFO ] [Nat]Absence check using state equation in 684 ms returned sat
[2021-05-13 22:32:03] [INFO ] Computed and/alt/rep : 538/1135/538 causal constraints in 35 ms.
[2021-05-13 22:32:04] [INFO ] Added : 167 causal constraints over 34 iterations in 1666 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 16 ms.
[2021-05-13 22:32:05] [INFO ] [Real]Absence check using 24 positive place invariants in 42 ms returned sat
[2021-05-13 22:32:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 22:32:05] [INFO ] [Real]Absence check using state equation in 631 ms returned sat
[2021-05-13 22:32:05] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 22:32:05] [INFO ] [Nat]Absence check using 24 positive place invariants in 27 ms returned sat
[2021-05-13 22:32:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 22:32:06] [INFO ] [Nat]Absence check using state equation in 662 ms returned sat
[2021-05-13 22:32:06] [INFO ] Computed and/alt/rep : 538/1135/538 causal constraints in 35 ms.
[2021-05-13 22:32:07] [INFO ] Added : 157 causal constraints over 32 iterations in 1255 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 18 ms.
[2021-05-13 22:32:07] [INFO ] [Real]Absence check using 24 positive place invariants in 42 ms returned sat
[2021-05-13 22:32:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 22:32:08] [INFO ] [Real]Absence check using state equation in 676 ms returned sat
[2021-05-13 22:32:08] [INFO ] Computed and/alt/rep : 538/1135/538 causal constraints in 36 ms.
[2021-05-13 22:32:08] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 22:32:08] [INFO ] [Nat]Absence check using 24 positive place invariants in 28 ms returned sat
[2021-05-13 22:32:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 22:32:09] [INFO ] [Nat]Absence check using state equation in 686 ms returned sat
[2021-05-13 22:32:09] [INFO ] Computed and/alt/rep : 538/1135/538 causal constraints in 35 ms.
[2021-05-13 22:32:11] [INFO ] Added : 152 causal constraints over 31 iterations in 1454 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 16 ms.
[2021-05-13 22:32:11] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 8 ms.
[2021-05-13 22:32:11] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 29 ms.
[2021-05-13 22:32:11] [INFO ] Flatten gal took : 261 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityFireability @ FlexibleBarrier-PT-22b @ 3570 seconds

FORMULA FlexibleBarrier-PT-22b-ReachabilityFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FlexibleBarrier-PT-22b-ReachabilityFireability-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FlexibleBarrier-PT-22b-ReachabilityFireability-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FlexibleBarrier-PT-22b-ReachabilityFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3562
rslt: Output for ReachabilityFireability @ FlexibleBarrier-PT-22b

{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=ReachabilityFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--safe",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--json=ReachabilityFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Thu May 13 22:32:12 2021
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 890
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "E (F (((1 <= p1) AND (1 <= p152) AND (1 <= p624) AND ((p92 <= 0)))))",
"processed_size": 68,
"rewrites": 1
},
"result":
{
"edges": 8,
"markings": 9,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 4
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1187
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 3,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "A (G (((p230 <= 0) OR ((1 <= p190)) OR (((p10 <= 0)) AND ((p120 <= 0) OR (p627 <= 0))))))",
"processed_size": 92,
"rewrites": 2
},
"result":
{
"edges": 21,
"markings": 20,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 7,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1781
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 7,
"adisj": 3,
"aneg": 0,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "E (F (((1 <= p188) AND (((1 <= p91)) OR ((1 <= p251))) AND (((1 <= p624)) OR ((1 <= p221))) AND (((1 <= p238)) OR ((1 <= p519))))))",
"processed_size": 134,
"rewrites": 1
},
"result":
{
"edges": 8,
"markings": 9,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 32,
"problems": 8
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3563
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 5,
"adisj": 4,
"aneg": 0,
"comp": 12,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 12,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 12,
"visible_transitions": 0
},
"processed": "A (G (((p43 <= 0) OR ((1 <= p380)) OR (p319 <= 0) OR (((p192 <= 0)) AND ((p13 <= 0) OR (p223 <= 0) OR (p546 <= 0))) OR ((1 <= p624) AND (((1 <= p492)) OR ((1 <= p153) AND (1 <= p258) AND (1 <= p503)))))))",
"processed_size": 211,
"rewrites": 2
},
"result":
{
"produced_by": "state equation",
"value": false
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 54,
"problems": 8
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"error": null,
"memory": 43816,
"runtime": 8.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "E(F(**)) : A(G(**)) : E(F(**)) : A(G(**))"
},
"net":
{
"arcs": 4050,
"conflict_clusters": 25,
"places": 628,
"places_significant": 604,
"singleton_clusters": 0,
"transitions": 1083
},
"result":
{
"preliminary_value": "yes no yes no ",
"value": "yes no yes no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 1711/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 628
lola: finding significant places
lola: 628 places, 1083 transitions, 604 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from ReachabilityFireability.xml
lola: LP says that atomic proposition is always true: (p188 <= 1)
lola: LP says that atomic proposition is always true: (p91 <= 1)
lola: LP says that atomic proposition is always true: (p251 <= 1)
lola: LP says that atomic proposition is always true: (p624 <= 1)
lola: LP says that atomic proposition is always true: (p221 <= 1)
lola: LP says that atomic proposition is always true: (p238 <= 1)
lola: LP says that atomic proposition is always true: (p519 <= 1)
lola: LP says that atomic proposition is always true: (p190 <= 1)
lola: LP says that atomic proposition is always true: (p230 <= 1)
lola: LP says that atomic proposition is always true: (p10 <= 1)
lola: LP says that atomic proposition is always true: (p120 <= 1)
lola: LP says that atomic proposition is always true: (p627 <= 1)
lola: LP says that atomic proposition is always true: (p1 <= 1)
lola: LP says that atomic proposition is always true: (p152 <= 1)
lola: LP says that atomic proposition is always true: (p624 <= 1)
lola: LP says that atomic proposition is always true: (p92 <= 1)
lola: LP says that atomic proposition is always true: (p43 <= 1)
lola: LP says that atomic proposition is always true: (p380 <= 1)
lola: LP says that atomic proposition is always true: (p319 <= 1)
lola: LP says that atomic proposition is always true: (p192 <= 1)
lola: LP says that atomic proposition is always true: (p13 <= 1)
lola: LP says that atomic proposition is always true: (p223 <= 1)
lola: LP says that atomic proposition is always true: (p546 <= 1)
lola: LP says that atomic proposition is always true: (p624 <= 1)
lola: LP says that atomic proposition is always true: (p492 <= 1)
lola: LP says that atomic proposition is always true: (p153 <= 1)
lola: LP says that atomic proposition is always true: (p258 <= 1)
lola: LP says that atomic proposition is always true: (p503 <= 1)
lola: E (F (((1 <= p188) AND (((1 <= p91)) OR ((1 <= p251))) AND (((1 <= p624)) OR ((1 <= p221))) AND (((1 <= p238)) OR ((1 <= p519)))))) : A (G (((p230 <= 0) OR ((1 <= p190)) OR (((p10 <= 0)) AND ((p120 <= 0) OR (p627 <= 0)))))) : E (F (((1 <= p1) AND (1 <= p152) AND (1 <= p624) AND ((p92 <= 0))))) : A (G (((p43 <= 0) OR ((1 <= p380)) OR (p319 <= 0) OR (((p192 <= 0)) AND ((p13 <= 0) OR (p223 <= 0) OR (p546 <= 0))) OR ((1 <= p624) AND (((1 <= p492)) OR ((1 <= p153) AND (1 <= p258) AND (1 <= p503)))))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 890 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p1) AND (1 <= p152) AND (1 <= p624) AND ((p92 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((1 <= p1) AND (1 <= p152) AND (1 <= p624) AND ((p92 <= 0)))))
lola: processed formula length: 68
lola: 1 rewrites
lola: closed formula file ReachabilityFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p1) AND (1 <= p152) AND (1 <= p624) AND ((p92 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 9 markings, 8 edges
lola: ========================================
lola: subprocess 1 will run for 1187 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p230 <= 0) OR ((1 <= p190)) OR (((p10 <= 0)) AND ((p120 <= 0) OR (p627 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G (((p230 <= 0) OR ((1 <= p190)) OR (((p10 <= 0)) AND ((p120 <= 0) OR (p627 <= 0))))))
lola: processed formula length: 92
lola: 2 rewrites
lola: closed formula file ReachabilityFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p230) AND ((p190 <= 0)) AND (((1 <= p10)) OR ((1 <= p120) AND (1 <= p627))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 7 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 20 markings, 21 edges
lola: ========================================
lola: subprocess 2 will run for 1781 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p188) AND (((1 <= p91)) OR ((1 <= p251))) AND (((1 <= p624)) OR ((1 <= p221))) AND (((1 <= p238)) OR ((1 <= p519))))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((1 <= p188) AND (((1 <= p91)) OR ((1 <= p251))) AND (((1 <= p624)) OR ((1 <= p221))) AND (((1 <= p238)) OR ((1 <= p519))))))
lola: processed formula length: 134
lola: 1 rewrites
lola: closed formula file ReachabilityFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p188) AND (((1 <= p91)) OR ((1 <= p251))) AND (((1 <= p624)) OR ((1 <= p221))) AND (((1 <= p238)) OR ((1 <= p519))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 32 literals and 8 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 9 markings, 8 edges
lola: ========================================
lola: subprocess 3 will run for 3563 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p43 <= 0) OR ((1 <= p380)) OR (p319 <= 0) OR (((p192 <= 0)) AND ((p13 <= 0) OR (p223 <= 0) OR (p546 <= 0))) OR ((1 <= p624) AND (((1 <= p492)) OR ((1 <= p153) AND (1 <= p258) AND (1 <= p503)))))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G (((p43 <= 0) OR ((1 <= p380)) OR (p319 <= 0) OR (((p192 <= 0)) AND ((p13 <= 0) OR (p223 <= 0) OR (p546 <= 0))) OR ((1 <= p624) AND (((1 <= p492)) OR ((1 <= p153) AND (1 <= p258) AND (1 <= p503)))))))
lola: processed formula length: 211
lola: 2 rewrites
lola: closed formula file ReachabilityFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p43) AND ((p380 <= 0)) AND (1 <= p319) AND (((1 <= p192)) OR ((1 <= p13) AND (1 <= p223) AND (1 <= p546))) AND ((p624 <= 0) OR (((p492 <= 0)) AND ((p153 <= 0) OR (p258 <= 0) OR (p503 <= 0)))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 54 literals and 8 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityFireability-3-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityFireability-3-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is not invariant.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no yes no
lola:
preliminary result: yes no yes no
lola: memory consumption: 43816 KB
lola: time consumption: 8 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityFireability.json
lola: closed JSON file ReachabilityFireability.json
rslt: finished

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

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="FlexibleBarrier-PT-22b"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="gold2020"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool gold2020"
echo " Input is FlexibleBarrier-PT-22b, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r113-smll-162075355700080"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FlexibleBarrier-PT-22b.tgz
mv FlexibleBarrier-PT-22b execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;