About the Execution of Smart+red for SafeBus-COL-10
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 13825.884 | 3600000.00 | 3657573.00 | 10168.10 | 1 10 1 1 ? 1 ? 1 1 1 1 9 1 1 10 1 | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r363-smll-167891813900221.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 SafeBus-COL-10, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r363-smll-167891813900221
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 456K
-rw-r--r-- 1 mcc users 6.5K Feb 26 01:40 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Feb 26 01:40 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Feb 26 01:37 CTLFireability.txt
-rw-r--r-- 1 mcc users 66K Feb 26 01:37 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.8K Feb 26 01:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 97K Feb 26 01:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Feb 26 01:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 26 01:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 42K 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 SafeBus-COL-10-UpperBounds-00
FORMULA_NAME SafeBus-COL-10-UpperBounds-01
FORMULA_NAME SafeBus-COL-10-UpperBounds-02
FORMULA_NAME SafeBus-COL-10-UpperBounds-03
FORMULA_NAME SafeBus-COL-10-UpperBounds-04
FORMULA_NAME SafeBus-COL-10-UpperBounds-05
FORMULA_NAME SafeBus-COL-10-UpperBounds-06
FORMULA_NAME SafeBus-COL-10-UpperBounds-07
FORMULA_NAME SafeBus-COL-10-UpperBounds-08
FORMULA_NAME SafeBus-COL-10-UpperBounds-09
FORMULA_NAME SafeBus-COL-10-UpperBounds-10
FORMULA_NAME SafeBus-COL-10-UpperBounds-11
FORMULA_NAME SafeBus-COL-10-UpperBounds-12
FORMULA_NAME SafeBus-COL-10-UpperBounds-13
FORMULA_NAME SafeBus-COL-10-UpperBounds-14
FORMULA_NAME SafeBus-COL-10-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1679052308460
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=SafeBus-COL-10
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-17 11:25:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-17 11:25:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-17 11:25:11] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-17 11:25:12] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-17 11:25:12] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1025 ms
[2023-03-17 11:25:12] [INFO ] Detected 1 constant HL places corresponding to 10 PT places.
[2023-03-17 11:25:12] [INFO ] Imported 20 HL places and 14 HL transitions for a total of 326 PT places and 12821.0 transition bindings in 39 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 10 ms.
[2023-03-17 11:25:12] [INFO ] Built PT skeleton of HLPN with 20 places and 14 transitions 68 arcs in 8 ms.
[2023-03-17 11:25:12] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
Reduce places removed 3 places and 0 transitions.
// Phase 1: matrix 14 rows 17 cols
[2023-03-17 11:25:12] [INFO ] Computed 7 place invariants in 6 ms
FORMULA SafeBus-COL-10-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA SafeBus-COL-10-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA SafeBus-COL-10-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA SafeBus-COL-10-UpperBounds-01 10 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2023-03-17 11:25:12] [INFO ] Invariant cache hit.
[2023-03-17 11:25:13] [INFO ] [Real]Absence check using 4 positive place invariants in 7 ms returned sat
[2023-03-17 11:25:13] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-17 11:25:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 11:25:13] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2023-03-17 11:25:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 11:25:13] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2023-03-17 11:25:13] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-17 11:25:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 11:25:13] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2023-03-17 11:25:13] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-17 11:25:13] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2023-03-17 11:25:13] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-17 11:25:13] [INFO ] Added : 10 causal constraints over 3 iterations in 39 ms. Result :sat
Minimization took 15 ms.
[2023-03-17 11:25:13] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-17 11:25:13] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-17 11:25:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 11:25:13] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2023-03-17 11:25:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 11:25:13] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-17 11:25:13] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-17 11:25:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 11:25:13] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2023-03-17 11:25:13] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2023-03-17 11:25:13] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-17 11:25:13] [INFO ] Added : 9 causal constraints over 2 iterations in 24 ms. Result :sat
Minimization took 9 ms.
[2023-03-17 11:25:13] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-17 11:25:13] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 10 ms returned sat
[2023-03-17 11:25:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 11:25:13] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2023-03-17 11:25:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 11:25:13] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-17 11:25:13] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-17 11:25:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 11:25:13] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2023-03-17 11:25:13] [INFO ] [Nat]Added 3 Read/Feed constraints in 3 ms returned sat
[2023-03-17 11:25:13] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-17 11:25:13] [INFO ] Added : 6 causal constraints over 2 iterations in 23 ms. Result :sat
Minimization took 13 ms.
[2023-03-17 11:25:13] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-17 11:25:13] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 13 ms returned sat
[2023-03-17 11:25:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 11:25:13] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2023-03-17 11:25:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 11:25:13] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-17 11:25:13] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-17 11:25:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 11:25:13] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2023-03-17 11:25:13] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2023-03-17 11:25:13] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-17 11:25:13] [INFO ] Added : 10 causal constraints over 3 iterations in 27 ms. Result :sat
Minimization took 11 ms.
[2023-03-17 11:25:13] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-17 11:25:13] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 7 ms returned sat
[2023-03-17 11:25:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 11:25:13] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2023-03-17 11:25:13] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2023-03-17 11:25:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 11:25:13] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-17 11:25:13] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-17 11:25:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 11:25:13] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2023-03-17 11:25:13] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2023-03-17 11:25:13] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-17 11:25:13] [INFO ] Added : 1 causal constraints over 1 iterations in 17 ms. Result :sat
Minimization took 8 ms.
[2023-03-17 11:25:13] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-17 11:25:13] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-17 11:25:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 11:25:13] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-03-17 11:25:13] [INFO ] [Real]Added 3 Read/Feed constraints in 6 ms returned sat
[2023-03-17 11:25:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 11:25:13] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-17 11:25:13] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 36 ms returned sat
[2023-03-17 11:25:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 11:25:14] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2023-03-17 11:25:14] [INFO ] [Nat]Added 3 Read/Feed constraints in 3 ms returned sat
[2023-03-17 11:25:14] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-17 11:25:14] [INFO ] Added : 1 causal constraints over 1 iterations in 17 ms. Result :sat
Minimization took 6 ms.
[2023-03-17 11:25:14] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-17 11:25:14] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-17 11:25:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 11:25:14] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2023-03-17 11:25:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 11:25:14] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-17 11:25:14] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-17 11:25:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 11:25:14] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2023-03-17 11:25:14] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2023-03-17 11:25:14] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-17 11:25:14] [INFO ] Added : 9 causal constraints over 3 iterations in 20 ms. Result :sat
Minimization took 11 ms.
[2023-03-17 11:25:14] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-17 11:25:14] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-17 11:25:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 11:25:14] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2023-03-17 11:25:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 11:25:14] [INFO ] [Nat]Absence check using 4 positive place invariants in 6 ms returned sat
[2023-03-17 11:25:14] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-17 11:25:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 11:25:14] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2023-03-17 11:25:14] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2023-03-17 11:25:14] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 16 ms.
[2023-03-17 11:25:14] [INFO ] Added : 13 causal constraints over 3 iterations in 38 ms. Result :sat
Minimization took 9 ms.
[2023-03-17 11:25:14] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-17 11:25:14] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-17 11:25:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 11:25:14] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2023-03-17 11:25:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 11:25:14] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-17 11:25:14] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-17 11:25:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 11:25:14] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2023-03-17 11:25:14] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2023-03-17 11:25:14] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-17 11:25:14] [INFO ] Added : 8 causal constraints over 2 iterations in 17 ms. Result :sat
Minimization took 11 ms.
[2023-03-17 11:25:14] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-17 11:25:14] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-17 11:25:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 11:25:14] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-03-17 11:25:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 11:25:14] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-17 11:25:14] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-17 11:25:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 11:25:14] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2023-03-17 11:25:14] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2023-03-17 11:25:14] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-17 11:25:14] [INFO ] Added : 8 causal constraints over 3 iterations in 28 ms. Result :sat
Minimization took 10 ms.
[2023-03-17 11:25:14] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-17 11:25:14] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-17 11:25:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 11:25:14] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-03-17 11:25:14] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2023-03-17 11:25:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 11:25:14] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-17 11:25:14] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-17 11:25:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 11:25:14] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2023-03-17 11:25:14] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2023-03-17 11:25:14] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-17 11:25:14] [INFO ] Added : 0 causal constraints over 0 iterations in 6 ms. Result :sat
Minimization took 5 ms.
[2023-03-17 11:25:14] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-17 11:25:14] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-17 11:25:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 11:25:14] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-17 11:25:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 11:25:14] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-17 11:25:14] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-17 11:25:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 11:25:14] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2023-03-17 11:25:14] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2023-03-17 11:25:14] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-17 11:25:14] [INFO ] Added : 13 causal constraints over 3 iterations in 20 ms. Result :sat
Minimization took 7 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 10, 10, 5, 1, 1, 3, 10, 1, 10, 1]
Domain [It(10), It(10)] of place AMC breaks symmetries in sort It
[2023-03-17 11:25:14] [INFO ] Unfolded HLPN to a Petri net with 326 places and 1651 transitions 11294 arcs in 144 ms.
[2023-03-17 11:25:14] [INFO ] Unfolded 12 HLPN properties in 0 ms.
Deduced a syphon composed of 10 places in 7 ms
Reduce places removed 20 places and 20 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 311 ms. (steps per millisecond=32 ) properties (out of 12) seen :32
FORMULA SafeBus-COL-10-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SafeBus-COL-10-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SafeBus-COL-10-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SafeBus-COL-10-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SafeBus-COL-10-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SafeBus-COL-10-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 6) seen :32
FORMULA SafeBus-COL-10-UpperBounds-14 10 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 5) seen :13
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 5) seen :15
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 5) seen :16
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 5) seen :21
[2023-03-17 11:25:15] [INFO ] Flow matrix only has 642 transitions (discarded 989 similar events)
// Phase 1: matrix 642 rows 306 cols
[2023-03-17 11:25:15] [INFO ] Computed 45 place invariants in 38 ms
[2023-03-17 11:25:15] [INFO ] [Real]Absence check using 21 positive place invariants in 11 ms returned sat
[2023-03-17 11:25:15] [INFO ] [Real]Absence check using 21 positive and 24 generalized place invariants in 15 ms returned sat
[2023-03-17 11:25:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 11:25:15] [INFO ] [Real]Absence check using state equation in 247 ms returned sat
[2023-03-17 11:25:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 11:25:16] [INFO ] [Nat]Absence check using 21 positive place invariants in 12 ms returned sat
[2023-03-17 11:25:16] [INFO ] [Nat]Absence check using 21 positive and 24 generalized place invariants in 16 ms returned sat
[2023-03-17 11:25:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 11:25:16] [INFO ] [Nat]Absence check using state equation in 306 ms returned sat
[2023-03-17 11:25:16] [INFO ] State equation strengthened by 111 read => feed constraints.
[2023-03-17 11:25:16] [INFO ] [Nat]Added 111 Read/Feed constraints in 496 ms returned sat
[2023-03-17 11:25:17] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 612 transitions) in 239 ms.
[2023-03-17 11:25:17] [INFO ] Added : 1 causal constraints over 1 iterations in 385 ms. Result :sat
Minimization took 245 ms.
[2023-03-17 11:25:17] [INFO ] [Real]Absence check using 21 positive place invariants in 14 ms returned sat
[2023-03-17 11:25:17] [INFO ] [Real]Absence check using 21 positive and 24 generalized place invariants in 10 ms returned sat
[2023-03-17 11:25:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 11:25:17] [INFO ] [Real]Absence check using state equation in 234 ms returned sat
[2023-03-17 11:25:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 11:25:18] [INFO ] [Nat]Absence check using 21 positive place invariants in 16 ms returned sat
[2023-03-17 11:25:18] [INFO ] [Nat]Absence check using 21 positive and 24 generalized place invariants in 18 ms returned sat
[2023-03-17 11:25:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 11:25:18] [INFO ] [Nat]Absence check using state equation in 306 ms returned sat
[2023-03-17 11:25:19] [INFO ] [Nat]Added 111 Read/Feed constraints in 828 ms returned sat
[2023-03-17 11:25:19] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 612 transitions) in 104 ms.
[2023-03-17 11:25:19] [INFO ] Added : 0 causal constraints over 0 iterations in 172 ms. Result :sat
Minimization took 1845 ms.
[2023-03-17 11:25:21] [INFO ] [Real]Absence check using 21 positive place invariants in 11 ms returned sat
[2023-03-17 11:25:21] [INFO ] [Real]Absence check using 21 positive and 24 generalized place invariants in 11 ms returned unsat
[2023-03-17 11:25:21] [INFO ] [Real]Absence check using 21 positive place invariants in 11 ms returned sat
[2023-03-17 11:25:21] [INFO ] [Real]Absence check using 21 positive and 24 generalized place invariants in 11 ms returned unsat
[2023-03-17 11:25:21] [INFO ] [Real]Absence check using 21 positive place invariants in 14 ms returned sat
[2023-03-17 11:25:21] [INFO ] [Real]Absence check using 21 positive and 24 generalized place invariants in 17 ms returned sat
[2023-03-17 11:25:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 11:25:21] [INFO ] [Real]Absence check using state equation in 280 ms returned sat
[2023-03-17 11:25:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 11:25:21] [INFO ] [Nat]Absence check using 21 positive place invariants in 11 ms returned sat
[2023-03-17 11:25:21] [INFO ] [Nat]Absence check using 21 positive and 24 generalized place invariants in 13 ms returned sat
[2023-03-17 11:25:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 11:25:22] [INFO ] [Nat]Absence check using state equation in 214 ms returned sat
[2023-03-17 11:25:22] [INFO ] [Nat]Added 111 Read/Feed constraints in 446 ms returned sat
[2023-03-17 11:25:22] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 612 transitions) in 85 ms.
[2023-03-17 11:25:22] [INFO ] Added : 1 causal constraints over 1 iterations in 210 ms. Result :sat
Minimization took 927 ms.
Current structural bounds on expressions (after SMT) : [10, 10, 1, 1, 10] Max seen :[9, 9, 1, 1, 7]
FORMULA SafeBus-COL-10-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA SafeBus-COL-10-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 30 out of 306 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 306/306 places, 1631/1631 transitions.
Applied a total of 0 rules in 335 ms. Remains 306 /306 variables (removed 0) and now considering 1631/1631 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 336 ms. Remains : 306/306 places, 1631/1631 transitions.
Normalized transition count is 642 out of 1631 initially.
// Phase 1: matrix 642 rows 306 cols
[2023-03-17 11:25:25] [INFO ] Computed 45 place invariants in 19 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 7757 ms. (steps per millisecond=128 ) properties (out of 3) seen :17
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 1783 ms. (steps per millisecond=560 ) properties (out of 3) seen :20
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2454 ms. (steps per millisecond=407 ) properties (out of 3) seen :11
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1872 ms. (steps per millisecond=534 ) properties (out of 3) seen :22
[2023-03-17 11:25:38] [INFO ] Flow matrix only has 642 transitions (discarded 989 similar events)
// Phase 1: matrix 642 rows 306 cols
[2023-03-17 11:25:38] [INFO ] Computed 45 place invariants in 17 ms
[2023-03-17 11:25:39] [INFO ] [Real]Absence check using 21 positive place invariants in 10 ms returned sat
[2023-03-17 11:25:39] [INFO ] [Real]Absence check using 21 positive and 24 generalized place invariants in 49 ms returned sat
[2023-03-17 11:25:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 11:25:39] [INFO ] [Real]Absence check using state equation in 265 ms returned sat
[2023-03-17 11:25:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 11:25:39] [INFO ] [Nat]Absence check using 21 positive place invariants in 12 ms returned sat
[2023-03-17 11:25:39] [INFO ] [Nat]Absence check using 21 positive and 24 generalized place invariants in 14 ms returned sat
[2023-03-17 11:25:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 11:25:39] [INFO ] [Nat]Absence check using state equation in 295 ms returned sat
[2023-03-17 11:25:39] [INFO ] State equation strengthened by 111 read => feed constraints.
[2023-03-17 11:25:40] [INFO ] [Nat]Added 111 Read/Feed constraints in 493 ms returned sat
[2023-03-17 11:25:40] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 612 transitions) in 116 ms.
[2023-03-17 11:25:40] [INFO ] Added : 1 causal constraints over 1 iterations in 237 ms. Result :sat
Minimization took 257 ms.
[2023-03-17 11:25:40] [INFO ] [Real]Absence check using 21 positive place invariants in 10 ms returned sat
[2023-03-17 11:25:40] [INFO ] [Real]Absence check using 21 positive and 24 generalized place invariants in 14 ms returned sat
[2023-03-17 11:25:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 11:25:41] [INFO ] [Real]Absence check using state equation in 279 ms returned sat
[2023-03-17 11:25:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 11:25:41] [INFO ] [Nat]Absence check using 21 positive place invariants in 17 ms returned sat
[2023-03-17 11:25:41] [INFO ] [Nat]Absence check using 21 positive and 24 generalized place invariants in 18 ms returned sat
[2023-03-17 11:25:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 11:25:41] [INFO ] [Nat]Absence check using state equation in 296 ms returned sat
[2023-03-17 11:25:42] [INFO ] [Nat]Added 111 Read/Feed constraints in 734 ms returned sat
[2023-03-17 11:25:42] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 612 transitions) in 78 ms.
[2023-03-17 11:25:42] [INFO ] Added : 0 causal constraints over 0 iterations in 156 ms. Result :sat
Minimization took 1985 ms.
[2023-03-17 11:25:44] [INFO ] [Real]Absence check using 21 positive place invariants in 15 ms returned sat
[2023-03-17 11:25:44] [INFO ] [Real]Absence check using 21 positive and 24 generalized place invariants in 18 ms returned sat
[2023-03-17 11:25:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 11:25:45] [INFO ] [Real]Absence check using state equation in 326 ms returned sat
[2023-03-17 11:25:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 11:25:45] [INFO ] [Nat]Absence check using 21 positive place invariants in 15 ms returned sat
[2023-03-17 11:25:45] [INFO ] [Nat]Absence check using 21 positive and 24 generalized place invariants in 18 ms returned sat
[2023-03-17 11:25:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 11:25:45] [INFO ] [Nat]Absence check using state equation in 276 ms returned sat
[2023-03-17 11:25:45] [INFO ] [Nat]Added 111 Read/Feed constraints in 508 ms returned sat
[2023-03-17 11:25:46] [INFO ] Deduced a trap composed of 57 places in 305 ms of which 8 ms to minimize.
[2023-03-17 11:25:46] [INFO ] Deduced a trap composed of 84 places in 553 ms of which 2 ms to minimize.
[2023-03-17 11:25:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 917 ms
Current structural bounds on expressions (after SMT) : [10, 10, 9] Max seen :[9, 9, 9]
FORMULA SafeBus-COL-10-UpperBounds-11 9 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 20 out of 306 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 306/306 places, 1631/1631 transitions.
Applied a total of 0 rules in 147 ms. Remains 306 /306 variables (removed 0) and now considering 1631/1631 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 147 ms. Remains : 306/306 places, 1631/1631 transitions.
Normalized transition count is 642 out of 1631 initially.
// Phase 1: matrix 642 rows 306 cols
[2023-03-17 11:25:47] [INFO ] Computed 45 place invariants in 8 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 7397 ms. (steps per millisecond=135 ) properties (out of 2) seen :13
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1778 ms. (steps per millisecond=562 ) properties (out of 2) seen :18
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 2672 ms. (steps per millisecond=374 ) properties (out of 2) seen :10
[2023-03-17 11:25:59] [INFO ] Flow matrix only has 642 transitions (discarded 989 similar events)
// Phase 1: matrix 642 rows 306 cols
[2023-03-17 11:25:59] [INFO ] Computed 45 place invariants in 14 ms
[2023-03-17 11:25:59] [INFO ] [Real]Absence check using 21 positive place invariants in 18 ms returned sat
[2023-03-17 11:25:59] [INFO ] [Real]Absence check using 21 positive and 24 generalized place invariants in 18 ms returned sat
[2023-03-17 11:25:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 11:26:00] [INFO ] [Real]Absence check using state equation in 290 ms returned sat
[2023-03-17 11:26:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 11:26:00] [INFO ] [Nat]Absence check using 21 positive place invariants in 18 ms returned sat
[2023-03-17 11:26:00] [INFO ] [Nat]Absence check using 21 positive and 24 generalized place invariants in 21 ms returned sat
[2023-03-17 11:26:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 11:26:00] [INFO ] [Nat]Absence check using state equation in 368 ms returned sat
[2023-03-17 11:26:00] [INFO ] State equation strengthened by 111 read => feed constraints.
[2023-03-17 11:26:01] [INFO ] [Nat]Added 111 Read/Feed constraints in 800 ms returned sat
[2023-03-17 11:26:01] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 612 transitions) in 78 ms.
[2023-03-17 11:26:01] [INFO ] Added : 1 causal constraints over 1 iterations in 186 ms. Result :sat
Minimization took 258 ms.
[2023-03-17 11:26:01] [INFO ] [Real]Absence check using 21 positive place invariants in 17 ms returned sat
[2023-03-17 11:26:02] [INFO ] [Real]Absence check using 21 positive and 24 generalized place invariants in 19 ms returned sat
[2023-03-17 11:26:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 11:26:02] [INFO ] [Real]Absence check using state equation in 362 ms returned sat
[2023-03-17 11:26:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 11:26:02] [INFO ] [Nat]Absence check using 21 positive place invariants in 11 ms returned sat
[2023-03-17 11:26:02] [INFO ] [Nat]Absence check using 21 positive and 24 generalized place invariants in 14 ms returned sat
[2023-03-17 11:26:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 11:26:02] [INFO ] [Nat]Absence check using state equation in 332 ms returned sat
[2023-03-17 11:26:03] [INFO ] [Nat]Added 111 Read/Feed constraints in 835 ms returned sat
[2023-03-17 11:26:03] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 612 transitions) in 73 ms.
[2023-03-17 11:26:03] [INFO ] Added : 0 causal constraints over 0 iterations in 140 ms. Result :sat
Minimization took 1642 ms.
Current structural bounds on expressions (after SMT) : [10, 10] Max seen :[9, 9]
Support contains 20 out of 306 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 306/306 places, 1631/1631 transitions.
Applied a total of 0 rules in 192 ms. Remains 306 /306 variables (removed 0) and now considering 1631/1631 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 193 ms. Remains : 306/306 places, 1631/1631 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 306/306 places, 1631/1631 transitions.
Applied a total of 0 rules in 133 ms. Remains 306 /306 variables (removed 0) and now considering 1631/1631 (removed 0) transitions.
[2023-03-17 11:26:06] [INFO ] Flow matrix only has 642 transitions (discarded 989 similar events)
[2023-03-17 11:26:06] [INFO ] Invariant cache hit.
[2023-03-17 11:26:07] [INFO ] Implicit Places using invariants in 783 ms returned [231, 232, 233, 234, 235, 236, 237, 238, 239, 240]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 790 ms to find 10 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 296/306 places, 1631/1631 transitions.
Applied a total of 0 rules in 415 ms. Remains 296 /296 variables (removed 0) and now considering 1631/1631 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1339 ms. Remains : 296/306 places, 1631/1631 transitions.
Normalized transition count is 642 out of 1631 initially.
// Phase 1: matrix 642 rows 296 cols
[2023-03-17 11:26:07] [INFO ] Computed 35 place invariants in 5 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 7023 ms. (steps per millisecond=142 ) properties (out of 2) seen :14
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 1573 ms. (steps per millisecond=635 ) properties (out of 2) seen :18
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2300 ms. (steps per millisecond=434 ) properties (out of 2) seen :10
[2023-03-17 11:26:18] [INFO ] Flow matrix only has 642 transitions (discarded 989 similar events)
// Phase 1: matrix 642 rows 296 cols
[2023-03-17 11:26:18] [INFO ] Computed 35 place invariants in 8 ms
[2023-03-17 11:26:18] [INFO ] [Real]Absence check using 14 positive place invariants in 9 ms returned sat
[2023-03-17 11:26:18] [INFO ] [Real]Absence check using 14 positive and 21 generalized place invariants in 11 ms returned sat
[2023-03-17 11:26:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 11:26:19] [INFO ] [Real]Absence check using state equation in 215 ms returned sat
[2023-03-17 11:26:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 11:26:19] [INFO ] [Nat]Absence check using 14 positive place invariants in 13 ms returned sat
[2023-03-17 11:26:19] [INFO ] [Nat]Absence check using 14 positive and 21 generalized place invariants in 15 ms returned sat
[2023-03-17 11:26:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 11:26:19] [INFO ] [Nat]Absence check using state equation in 272 ms returned sat
[2023-03-17 11:26:19] [INFO ] State equation strengthened by 111 read => feed constraints.
[2023-03-17 11:26:20] [INFO ] [Nat]Added 111 Read/Feed constraints in 742 ms returned sat
[2023-03-17 11:26:20] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 612 transitions) in 73 ms.
[2023-03-17 11:26:20] [INFO ] Added : 1 causal constraints over 1 iterations in 168 ms. Result :sat
Minimization took 225 ms.
[2023-03-17 11:26:20] [INFO ] [Real]Absence check using 14 positive place invariants in 8 ms returned sat
[2023-03-17 11:26:20] [INFO ] [Real]Absence check using 14 positive and 21 generalized place invariants in 10 ms returned sat
[2023-03-17 11:26:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 11:26:20] [INFO ] [Real]Absence check using state equation in 193 ms returned sat
[2023-03-17 11:26:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 11:26:21] [INFO ] [Nat]Absence check using 14 positive place invariants in 8 ms returned sat
[2023-03-17 11:26:21] [INFO ] [Nat]Absence check using 14 positive and 21 generalized place invariants in 11 ms returned sat
[2023-03-17 11:26:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 11:26:21] [INFO ] [Nat]Absence check using state equation in 265 ms returned sat
[2023-03-17 11:26:21] [INFO ] [Nat]Added 111 Read/Feed constraints in 361 ms returned sat
[2023-03-17 11:26:21] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 612 transitions) in 71 ms.
[2023-03-17 11:26:21] [INFO ] Added : 0 causal constraints over 0 iterations in 128 ms. Result :sat
Minimization took 839 ms.
Current structural bounds on expressions (after SMT) : [10, 10] Max seen :[9, 9]
Support contains 20 out of 296 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 296/296 places, 1631/1631 transitions.
Applied a total of 0 rules in 207 ms. Remains 296 /296 variables (removed 0) and now considering 1631/1631 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 208 ms. Remains : 296/296 places, 1631/1631 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 296/296 places, 1631/1631 transitions.
Applied a total of 0 rules in 144 ms. Remains 296 /296 variables (removed 0) and now considering 1631/1631 (removed 0) transitions.
[2023-03-17 11:26:23] [INFO ] Flow matrix only has 642 transitions (discarded 989 similar events)
[2023-03-17 11:26:23] [INFO ] Invariant cache hit.
[2023-03-17 11:26:24] [INFO ] Implicit Places using invariants in 626 ms returned []
[2023-03-17 11:26:24] [INFO ] Flow matrix only has 642 transitions (discarded 989 similar events)
[2023-03-17 11:26:24] [INFO ] Invariant cache hit.
[2023-03-17 11:26:24] [INFO ] State equation strengthened by 111 read => feed constraints.
[2023-03-17 11:26:26] [INFO ] Implicit Places using invariants and state equation in 2720 ms returned []
Implicit Place search using SMT with State Equation took 3360 ms to find 0 implicit places.
[2023-03-17 11:26:27] [INFO ] Redundant transitions in 245 ms returned []
[2023-03-17 11:26:27] [INFO ] Flow matrix only has 642 transitions (discarded 989 similar events)
[2023-03-17 11:26:27] [INFO ] Invariant cache hit.
[2023-03-17 11:26:29] [INFO ] Dead Transitions using invariants and state equation in 2339 ms found 100 transitions.
Found 100 dead transitions using SMT.
Drop transitions removed 100 transitions
Dead transitions reduction (with SMT) removed 100 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 296/296 places, 1531/1631 transitions.
Applied a total of 0 rules in 177 ms. Remains 296 /296 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2023-03-17 11:26:29] [INFO ] Redundant transitions in 89 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 6379 ms. Remains : 296/296 places, 1531/1631 transitions.
Normalized transition count is 642 out of 1531 initially.
// Phase 1: matrix 642 rows 296 cols
[2023-03-17 11:26:29] [INFO ] Computed 35 place invariants in 5 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 7016 ms. (steps per millisecond=142 ) properties (out of 2) seen :14
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1514 ms. (steps per millisecond=660 ) properties (out of 2) seen :18
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2246 ms. (steps per millisecond=445 ) properties (out of 2) seen :10
[2023-03-17 11:26:40] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
// Phase 1: matrix 642 rows 296 cols
[2023-03-17 11:26:40] [INFO ] Computed 35 place invariants in 5 ms
[2023-03-17 11:26:40] [INFO ] [Real]Absence check using 14 positive place invariants in 8 ms returned sat
[2023-03-17 11:26:40] [INFO ] [Real]Absence check using 14 positive and 21 generalized place invariants in 10 ms returned sat
[2023-03-17 11:26:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 11:26:40] [INFO ] [Real]Absence check using state equation in 224 ms returned sat
[2023-03-17 11:26:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 11:26:40] [INFO ] [Nat]Absence check using 14 positive place invariants in 9 ms returned sat
[2023-03-17 11:26:41] [INFO ] [Nat]Absence check using 14 positive and 21 generalized place invariants in 11 ms returned sat
[2023-03-17 11:26:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 11:26:41] [INFO ] [Nat]Absence check using state equation in 207 ms returned sat
[2023-03-17 11:26:41] [INFO ] State equation strengthened by 111 read => feed constraints.
[2023-03-17 11:26:41] [INFO ] [Nat]Added 111 Read/Feed constraints in 353 ms returned sat
[2023-03-17 11:26:41] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 612 transitions) in 71 ms.
[2023-03-17 11:26:41] [INFO ] Added : 1 causal constraints over 1 iterations in 158 ms. Result :sat
Minimization took 575 ms.
[2023-03-17 11:26:42] [INFO ] [Real]Absence check using 14 positive place invariants in 9 ms returned sat
[2023-03-17 11:26:42] [INFO ] [Real]Absence check using 14 positive and 21 generalized place invariants in 10 ms returned sat
[2023-03-17 11:26:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 11:26:42] [INFO ] [Real]Absence check using state equation in 239 ms returned sat
[2023-03-17 11:26:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 11:26:42] [INFO ] [Nat]Absence check using 14 positive place invariants in 11 ms returned sat
[2023-03-17 11:26:42] [INFO ] [Nat]Absence check using 14 positive and 21 generalized place invariants in 13 ms returned sat
[2023-03-17 11:26:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 11:26:43] [INFO ] [Nat]Absence check using state equation in 303 ms returned sat
[2023-03-17 11:26:43] [INFO ] [Nat]Added 111 Read/Feed constraints in 376 ms returned sat
[2023-03-17 11:26:44] [INFO ] Deduced a trap composed of 30 places in 607 ms of which 2 ms to minimize.
[2023-03-17 11:26:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 657 ms
[2023-03-17 11:26:44] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 612 transitions) in 75 ms.
[2023-03-17 11:26:44] [INFO ] Added : 0 causal constraints over 0 iterations in 155 ms. Result :sat
Minimization took 1385 ms.
Current structural bounds on expressions (after SMT) : [10, 10] Max seen :[9, 9]
Support contains 20 out of 296 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 296/296 places, 1531/1531 transitions.
Applied a total of 0 rules in 114 ms. Remains 296 /296 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 115 ms. Remains : 296/296 places, 1531/1531 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 296/296 places, 1531/1531 transitions.
Applied a total of 0 rules in 106 ms. Remains 296 /296 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2023-03-17 11:26:46] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2023-03-17 11:26:46] [INFO ] Invariant cache hit.
[2023-03-17 11:26:46] [INFO ] Implicit Places using invariants in 788 ms returned []
[2023-03-17 11:26:46] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2023-03-17 11:26:46] [INFO ] Invariant cache hit.
[2023-03-17 11:26:47] [INFO ] State equation strengthened by 111 read => feed constraints.
[2023-03-17 11:26:50] [INFO ] Implicit Places using invariants and state equation in 3137 ms returned []
Implicit Place search using SMT with State Equation took 3927 ms to find 0 implicit places.
[2023-03-17 11:26:50] [INFO ] Redundant transitions in 44 ms returned []
[2023-03-17 11:26:50] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2023-03-17 11:26:50] [INFO ] Invariant cache hit.
[2023-03-17 11:26:51] [INFO ] Dead Transitions using invariants and state equation in 1794 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5879 ms. Remains : 296/296 places, 1531/1531 transitions.
Starting property specific reduction for SafeBus-COL-10-UpperBounds-04
Normalized transition count is 642 out of 1531 initially.
// Phase 1: matrix 642 rows 296 cols
[2023-03-17 11:26:51] [INFO ] Computed 35 place invariants in 5 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :9
[2023-03-17 11:26:51] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
// Phase 1: matrix 642 rows 296 cols
[2023-03-17 11:26:51] [INFO ] Computed 35 place invariants in 4 ms
[2023-03-17 11:26:52] [INFO ] [Real]Absence check using 14 positive place invariants in 9 ms returned sat
[2023-03-17 11:26:52] [INFO ] [Real]Absence check using 14 positive and 21 generalized place invariants in 11 ms returned sat
[2023-03-17 11:26:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 11:26:52] [INFO ] [Real]Absence check using state equation in 230 ms returned sat
[2023-03-17 11:26:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 11:26:52] [INFO ] [Nat]Absence check using 14 positive place invariants in 9 ms returned sat
[2023-03-17 11:26:52] [INFO ] [Nat]Absence check using 14 positive and 21 generalized place invariants in 11 ms returned sat
[2023-03-17 11:26:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 11:26:52] [INFO ] [Nat]Absence check using state equation in 231 ms returned sat
[2023-03-17 11:26:52] [INFO ] State equation strengthened by 111 read => feed constraints.
[2023-03-17 11:26:52] [INFO ] [Nat]Added 111 Read/Feed constraints in 348 ms returned sat
[2023-03-17 11:26:53] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 612 transitions) in 101 ms.
[2023-03-17 11:26:53] [INFO ] Added : 1 causal constraints over 1 iterations in 226 ms. Result :sat
Minimization took 580 ms.
Current structural bounds on expressions (after SMT) : [19] Max seen :[9]
Support contains 10 out of 296 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 296/296 places, 1531/1531 transitions.
Applied a total of 0 rules in 175 ms. Remains 296 /296 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 177 ms. Remains : 296/296 places, 1531/1531 transitions.
Normalized transition count is 642 out of 1531 initially.
// Phase 1: matrix 642 rows 296 cols
[2023-03-17 11:26:54] [INFO ] Computed 35 place invariants in 9 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 6654 ms. (steps per millisecond=150 ) properties (out of 1) seen :5
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1441 ms. (steps per millisecond=693 ) properties (out of 1) seen :9
[2023-03-17 11:27:02] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
// Phase 1: matrix 642 rows 296 cols
[2023-03-17 11:27:02] [INFO ] Computed 35 place invariants in 8 ms
[2023-03-17 11:27:02] [INFO ] [Real]Absence check using 14 positive place invariants in 12 ms returned sat
[2023-03-17 11:27:02] [INFO ] [Real]Absence check using 14 positive and 21 generalized place invariants in 16 ms returned sat
[2023-03-17 11:27:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 11:27:02] [INFO ] [Real]Absence check using state equation in 233 ms returned sat
[2023-03-17 11:27:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 11:27:02] [INFO ] [Nat]Absence check using 14 positive place invariants in 13 ms returned sat
[2023-03-17 11:27:02] [INFO ] [Nat]Absence check using 14 positive and 21 generalized place invariants in 16 ms returned sat
[2023-03-17 11:27:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 11:27:03] [INFO ] [Nat]Absence check using state equation in 288 ms returned sat
[2023-03-17 11:27:03] [INFO ] State equation strengthened by 111 read => feed constraints.
[2023-03-17 11:27:03] [INFO ] [Nat]Added 111 Read/Feed constraints in 548 ms returned sat
[2023-03-17 11:27:03] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 612 transitions) in 102 ms.
[2023-03-17 11:27:03] [INFO ] Added : 1 causal constraints over 1 iterations in 211 ms. Result :sat
Minimization took 582 ms.
Current structural bounds on expressions (after SMT) : [19] Max seen :[9]
Support contains 10 out of 296 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 296/296 places, 1531/1531 transitions.
Applied a total of 0 rules in 169 ms. Remains 296 /296 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 171 ms. Remains : 296/296 places, 1531/1531 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 296/296 places, 1531/1531 transitions.
Applied a total of 0 rules in 170 ms. Remains 296 /296 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2023-03-17 11:27:04] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2023-03-17 11:27:04] [INFO ] Invariant cache hit.
[2023-03-17 11:27:05] [INFO ] Implicit Places using invariants in 681 ms returned []
[2023-03-17 11:27:05] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2023-03-17 11:27:05] [INFO ] Invariant cache hit.
[2023-03-17 11:27:05] [INFO ] State equation strengthened by 111 read => feed constraints.
[2023-03-17 11:27:08] [INFO ] Implicit Places using invariants and state equation in 3308 ms returned []
Implicit Place search using SMT with State Equation took 3991 ms to find 0 implicit places.
[2023-03-17 11:27:08] [INFO ] Redundant transitions in 38 ms returned []
[2023-03-17 11:27:08] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2023-03-17 11:27:08] [INFO ] Invariant cache hit.
[2023-03-17 11:27:11] [INFO ] Dead Transitions using invariants and state equation in 2090 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6297 ms. Remains : 296/296 places, 1531/1531 transitions.
Ending property specific reduction for SafeBus-COL-10-UpperBounds-04 in 19192 ms.
Starting property specific reduction for SafeBus-COL-10-UpperBounds-06
Normalized transition count is 642 out of 1531 initially.
// Phase 1: matrix 642 rows 296 cols
[2023-03-17 11:27:11] [INFO ] Computed 35 place invariants in 8 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 1) seen :9
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :9
[2023-03-17 11:27:11] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
// Phase 1: matrix 642 rows 296 cols
[2023-03-17 11:27:11] [INFO ] Computed 35 place invariants in 4 ms
[2023-03-17 11:27:11] [INFO ] [Real]Absence check using 14 positive place invariants in 12 ms returned sat
[2023-03-17 11:27:11] [INFO ] [Real]Absence check using 14 positive and 21 generalized place invariants in 15 ms returned sat
[2023-03-17 11:27:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 11:27:11] [INFO ] [Real]Absence check using state equation in 262 ms returned sat
[2023-03-17 11:27:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 11:27:11] [INFO ] [Nat]Absence check using 14 positive place invariants in 13 ms returned sat
[2023-03-17 11:27:11] [INFO ] [Nat]Absence check using 14 positive and 21 generalized place invariants in 15 ms returned sat
[2023-03-17 11:27:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 11:27:12] [INFO ] [Nat]Absence check using state equation in 374 ms returned sat
[2023-03-17 11:27:12] [INFO ] State equation strengthened by 111 read => feed constraints.
[2023-03-17 11:27:12] [INFO ] [Nat]Added 111 Read/Feed constraints in 618 ms returned sat
[2023-03-17 11:27:13] [INFO ] Deduced a trap composed of 30 places in 334 ms of which 2 ms to minimize.
[2023-03-17 11:27:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 409 ms
[2023-03-17 11:27:13] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 612 transitions) in 110 ms.
[2023-03-17 11:27:13] [INFO ] Added : 0 causal constraints over 0 iterations in 204 ms. Result :sat
Minimization took 1391 ms.
Current structural bounds on expressions (after SMT) : [19] Max seen :[9]
Support contains 10 out of 296 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 296/296 places, 1531/1531 transitions.
Applied a total of 0 rules in 101 ms. Remains 296 /296 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 102 ms. Remains : 296/296 places, 1531/1531 transitions.
Normalized transition count is 642 out of 1531 initially.
// Phase 1: matrix 642 rows 296 cols
[2023-03-17 11:27:14] [INFO ] Computed 35 place invariants in 5 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 6601 ms. (steps per millisecond=151 ) properties (out of 1) seen :9
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2086 ms. (steps per millisecond=479 ) properties (out of 1) seen :9
[2023-03-17 11:27:23] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
// Phase 1: matrix 642 rows 296 cols
[2023-03-17 11:27:23] [INFO ] Computed 35 place invariants in 8 ms
[2023-03-17 11:27:23] [INFO ] [Real]Absence check using 14 positive place invariants in 13 ms returned sat
[2023-03-17 11:27:23] [INFO ] [Real]Absence check using 14 positive and 21 generalized place invariants in 16 ms returned sat
[2023-03-17 11:27:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 11:27:23] [INFO ] [Real]Absence check using state equation in 279 ms returned sat
[2023-03-17 11:27:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 11:27:24] [INFO ] [Nat]Absence check using 14 positive place invariants in 8 ms returned sat
[2023-03-17 11:27:24] [INFO ] [Nat]Absence check using 14 positive and 21 generalized place invariants in 11 ms returned sat
[2023-03-17 11:27:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 11:27:24] [INFO ] [Nat]Absence check using state equation in 374 ms returned sat
[2023-03-17 11:27:24] [INFO ] State equation strengthened by 111 read => feed constraints.
[2023-03-17 11:27:25] [INFO ] [Nat]Added 111 Read/Feed constraints in 579 ms returned sat
[2023-03-17 11:27:25] [INFO ] Deduced a trap composed of 30 places in 325 ms of which 1 ms to minimize.
[2023-03-17 11:27:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 371 ms
[2023-03-17 11:27:25] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 612 transitions) in 75 ms.
[2023-03-17 11:27:25] [INFO ] Added : 0 causal constraints over 0 iterations in 154 ms. Result :sat
Minimization took 1479 ms.
Current structural bounds on expressions (after SMT) : [19] Max seen :[9]
Support contains 10 out of 296 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 296/296 places, 1531/1531 transitions.
Applied a total of 0 rules in 128 ms. Remains 296 /296 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 128 ms. Remains : 296/296 places, 1531/1531 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 296/296 places, 1531/1531 transitions.
Applied a total of 0 rules in 175 ms. Remains 296 /296 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2023-03-17 11:27:27] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2023-03-17 11:27:27] [INFO ] Invariant cache hit.
[2023-03-17 11:27:28] [INFO ] Implicit Places using invariants in 826 ms returned []
[2023-03-17 11:27:28] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2023-03-17 11:27:28] [INFO ] Invariant cache hit.
[2023-03-17 11:27:28] [INFO ] State equation strengthened by 111 read => feed constraints.
[2023-03-17 11:27:30] [INFO ] Implicit Places using invariants and state equation in 2476 ms returned []
Implicit Place search using SMT with State Equation took 3311 ms to find 0 implicit places.
[2023-03-17 11:27:30] [INFO ] Redundant transitions in 48 ms returned []
[2023-03-17 11:27:30] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2023-03-17 11:27:30] [INFO ] Invariant cache hit.
[2023-03-17 11:27:32] [INFO ] Dead Transitions using invariants and state equation in 1741 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5285 ms. Remains : 296/296 places, 1531/1531 transitions.
Ending property specific reduction for SafeBus-COL-10-UpperBounds-06 in 21521 ms.
[2023-03-17 11:27:33] [INFO ] Flatten gal took : 302 ms
[2023-03-17 11:27:33] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/UpperBounds.sr.xml took 3 ms.
[2023-03-17 11:27:33] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 296 places, 1531 transitions and 10104 arcs took 15 ms.
Total runtime 141561 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running SafeBus (COL), instance 10
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: 296 places, 1531 transitions, 10104 arcs.
Final Score: 38563.028
Took : 37 seconds
Bounds file is: UpperBounds.xml
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 2320548 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16101220 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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
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="SafeBus-COL-10"
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 SafeBus-COL-10, 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 r363-smll-167891813900221"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/SafeBus-COL-10.tgz
mv SafeBus-COL-10 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;