About the Execution of GreatSPN+red for QuasiCertifProtocol-COL-32
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r311-tall-171662335800053.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is QuasiCertifProtocol-COL-32, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r311-tall-171662335800053
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 612K
-rw-r--r-- 1 mcc users 6.5K Apr 13 04:08 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Apr 13 04:08 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Apr 13 03:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Apr 13 03:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 13 04:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 165K Apr 13 04:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Apr 13 04:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Apr 13 04:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 131K May 18 16:43 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of positive values
NUM_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME QuasiCertifProtocol-COL-32-UpperBounds-00
FORMULA_NAME QuasiCertifProtocol-COL-32-UpperBounds-01
FORMULA_NAME QuasiCertifProtocol-COL-32-UpperBounds-02
FORMULA_NAME QuasiCertifProtocol-COL-32-UpperBounds-03
FORMULA_NAME QuasiCertifProtocol-COL-32-UpperBounds-04
FORMULA_NAME QuasiCertifProtocol-COL-32-UpperBounds-05
FORMULA_NAME QuasiCertifProtocol-COL-32-UpperBounds-06
FORMULA_NAME QuasiCertifProtocol-COL-32-UpperBounds-07
FORMULA_NAME QuasiCertifProtocol-COL-32-UpperBounds-08
FORMULA_NAME QuasiCertifProtocol-COL-32-UpperBounds-09
FORMULA_NAME QuasiCertifProtocol-COL-32-UpperBounds-10
FORMULA_NAME QuasiCertifProtocol-COL-32-UpperBounds-11
FORMULA_NAME QuasiCertifProtocol-COL-32-UpperBounds-12
FORMULA_NAME QuasiCertifProtocol-COL-32-UpperBounds-13
FORMULA_NAME QuasiCertifProtocol-COL-32-UpperBounds-14
FORMULA_NAME QuasiCertifProtocol-COL-32-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1716654637123
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-COL-32
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-25 16:30:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-25 16:30:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 16:30:38] [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.
[2024-05-25 16:30:38] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-25 16:30:39] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 626 ms
[2024-05-25 16:30:39] [INFO ] Imported 30 HL places and 26 HL transitions for a total of 3806 PT places and 506.0 transition bindings in 19 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
[2024-05-25 16:30:39] [INFO ] Built PT skeleton of HLPN with 30 places and 26 transitions 77 arcs in 4 ms.
[2024-05-25 16:30:39] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
// Phase 1: matrix 26 rows 30 cols
[2024-05-25 16:30:39] [INFO ] Computed 5 invariants in 12 ms
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 33] Max Struct:[+inf, 1, 1, +inf, 33, 1, 1, 33, 33, 33, 33, 19, 33, 1089, +inf, 33]
FORMULA QuasiCertifProtocol-COL-32-UpperBounds-15 33 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-32-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2024-05-25 16:30:39] [INFO ] Invariant cache hit.
[2024-05-25 16:30:39] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2024-05-25 16:30:39] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2024-05-25 16:30:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:30:39] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2024-05-25 16:30:39] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2024-05-25 16:30:39] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-25 16:30:39] [INFO ] Added : 5 causal constraints over 1 iterations in 29 ms. Result :sat
Minimization took 8 ms.
[2024-05-25 16:30:39] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2024-05-25 16:30:39] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2024-05-25 16:30:39] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-25 16:30:39] [INFO ] Added : 5 causal constraints over 1 iterations in 11 ms. Result :sat
Minimization took 9 ms.
[2024-05-25 16:30:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:30:39] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-25 16:30:39] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2024-05-25 16:30:39] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-25 16:30:39] [INFO ] Added : 5 causal constraints over 1 iterations in 54 ms. Result :sat
Minimization took 5 ms.
[2024-05-25 16:30:39] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-25 16:30:39] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2024-05-25 16:30:39] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-25 16:30:39] [INFO ] Added : 7 causal constraints over 2 iterations in 47 ms. Result :sat
Minimization took 6 ms.
[2024-05-25 16:30:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:30:39] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-25 16:30:39] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-05-25 16:30:39] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 11 ms.
[2024-05-25 16:30:39] [INFO ] Added : 7 causal constraints over 2 iterations in 24 ms. Result :sat
Minimization took 8 ms.
[2024-05-25 16:30:39] [INFO ] [Real]Absence check using 5 positive place invariants in 7 ms returned sat
[2024-05-25 16:30:39] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-05-25 16:30:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:30:39] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2024-05-25 16:30:39] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2024-05-25 16:30:39] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-25 16:30:39] [INFO ] Added : 3 causal constraints over 1 iterations in 14 ms. Result :sat
Minimization took 8 ms.
[2024-05-25 16:30:40] [INFO ] [Real]Absence check using 5 positive place invariants in 6 ms returned sat
[2024-05-25 16:30:40] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2024-05-25 16:30:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:30:40] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-25 16:30:40] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2024-05-25 16:30:40] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-25 16:30:40] [INFO ] Added : 9 causal constraints over 2 iterations in 16 ms. Result :sat
Minimization took 16 ms.
[2024-05-25 16:30:40] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-25 16:30:40] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-25 16:30:40] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 16:30:40] [INFO ] Added : 1 causal constraints over 1 iterations in 9 ms. Result :sat
Minimization took 6 ms.
[2024-05-25 16:30:40] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-25 16:30:40] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2024-05-25 16:30:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:30:40] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-25 16:30:40] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-05-25 16:30:40] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-25 16:30:40] [INFO ] Added : 11 causal constraints over 3 iterations in 26 ms. Result :sat
Minimization took 9 ms.
[2024-05-25 16:30:40] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-25 16:30:40] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-25 16:30:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:30:40] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-25 16:30:40] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-05-25 16:30:40] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 7 ms.
[2024-05-25 16:30:40] [INFO ] Added : 11 causal constraints over 3 iterations in 22 ms. Result :sat
Minimization took 6 ms.
[2024-05-25 16:30:40] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-25 16:30:40] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-25 16:30:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:30:40] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-25 16:30:40] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-05-25 16:30:40] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-25 16:30:40] [INFO ] Added : 8 causal constraints over 2 iterations in 15 ms. Result :sat
Minimization took 7 ms.
[2024-05-25 16:30:40] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-25 16:30:40] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2024-05-25 16:30:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:30:40] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-25 16:30:40] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-05-25 16:30:40] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 16:30:40] [INFO ] Added : 11 causal constraints over 3 iterations in 27 ms. Result :sat
Minimization took 8 ms.
[2024-05-25 16:30:40] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-25 16:30:40] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2024-05-25 16:30:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:30:40] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-25 16:30:40] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-05-25 16:30:40] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 16:30:40] [INFO ] Added : 0 causal constraints over 0 iterations in 4 ms. Result :sat
Minimization took 5 ms.
[2024-05-25 16:30:40] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-25 16:30:40] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-25 16:30:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:30:40] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-25 16:30:40] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-25 16:30:40] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 16:30:40] [INFO ] Added : 4 causal constraints over 1 iterations in 15 ms. Result :sat
Minimization took 5 ms.
[2024-05-25 16:30:40] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-25 16:30:40] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-25 16:30:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:30:40] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-25 16:30:40] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2024-05-25 16:30:40] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-25 16:30:40] [INFO ] Added : 12 causal constraints over 3 iterations in 14 ms. Result :sat
Minimization took 6 ms.
[2024-05-25 16:30:40] [INFO ] [Real]Absence check using 5 positive place invariants in 40 ms returned sat
[2024-05-25 16:30:40] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-25 16:30:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:30:40] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-25 16:30:40] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-05-25 16:30:40] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 16:30:40] [INFO ] Added : 9 causal constraints over 2 iterations in 11 ms. Result :sat
Minimization took 11 ms.
Current structural bounds on expressions (after SMT on skeleton) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, +inf, 33, 1, 33, 33, 33, 33, 19, 33, 1089, +inf]
Domain [tsid(33), tsid(33)] of place n9 breaks symmetries in sort tsid
[2024-05-25 16:30:41] [INFO ] Unfolded HLPN to a Petri net with 3806 places and 506 transitions 8173 arcs in 51 ms.
[2024-05-25 16:30:41] [INFO ] Unfolded 14 HLPN properties in 1 ms.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, +inf, 33, 1, 33, 33, 33, 33, 19, 33, 1089, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, +inf, 33, 1, 33, 33, 33, 33, 19, 33, 1089, +inf]
// Phase 1: matrix 506 rows 3806 cols
[2024-05-25 16:30:41] [INFO ] Computed 3301 invariants in 140 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, +inf, 33, 1, 33, 33, 33, 33, 19, 33, 1089, +inf]
RANDOM walk for 10000 steps (267 resets) in 330 ms. (30 steps per ms)
FORMULA QuasiCertifProtocol-COL-32-UpperBounds-11 19 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA QuasiCertifProtocol-COL-32-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 120011 steps (133 resets) in 457 ms. (262 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, +inf, 33, 33, 33, 33, 33, 33, 1089, +inf]
[2024-05-25 16:30:42] [INFO ] Invariant cache hit.
[2024-05-25 16:30:42] [INFO ] [Real]Absence check using 37 positive place invariants in 93 ms returned sat
[2024-05-25 16:30:43] [INFO ] [Real]Absence check using 37 positive and 3264 generalized place invariants in 625 ms returned sat
[2024-05-25 16:30:44] [INFO ] [Real]Absence check using state equation in 1497 ms returned sat
[2024-05-25 16:30:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:30:45] [INFO ] [Nat]Absence check using 37 positive place invariants in 90 ms returned sat
[2024-05-25 16:30:45] [INFO ] [Nat]Absence check using 37 positive and 3264 generalized place invariants in 677 ms returned sat
[2024-05-25 16:30:47] [INFO ] [Nat]Absence check using state equation in 1594 ms returned sat
[2024-05-25 16:30:47] [INFO ] Computed and/alt/rep : 370/436/370 causal constraints (skipped 102 transitions) in 56 ms.
[2024-05-25 16:30:48] [INFO ] Added : 67 causal constraints over 14 iterations in 1340 ms. Result :sat
Minimization took 679 ms.
[2024-05-25 16:30:50] [INFO ] [Real]Absence check using 37 positive place invariants in 81 ms returned sat
[2024-05-25 16:30:50] [INFO ] [Real]Absence check using 37 positive and 3264 generalized place invariants in 629 ms returned sat
[2024-05-25 16:30:52] [INFO ] [Real]Absence check using state equation in 1593 ms returned sat
[2024-05-25 16:30:52] [INFO ] Computed and/alt/rep : 370/436/370 causal constraints (skipped 102 transitions) in 46 ms.
[2024-05-25 16:30:53] [INFO ] Added : 59 causal constraints over 12 iterations in 1243 ms. Result :sat
Minimization took 662 ms.
[2024-05-25 16:30:54] [INFO ] [Real]Absence check using 37 positive place invariants in 81 ms returned sat
[2024-05-25 16:30:55] [INFO ] [Real]Absence check using 37 positive and 3264 generalized place invariants in 617 ms returned sat
[2024-05-25 16:30:57] [INFO ] [Real]Absence check using state equation in 1598 ms returned sat
[2024-05-25 16:30:57] [INFO ] Computed and/alt/rep : 370/436/370 causal constraints (skipped 102 transitions) in 48 ms.
[2024-05-25 16:30:59] [INFO ] Added : 108 causal constraints over 22 iterations in 2124 ms. Result :sat
Minimization took 21 ms.
[2024-05-25 16:30:59] [INFO ] [Real]Absence check using 37 positive place invariants in 71 ms returned sat
[2024-05-25 16:31:00] [INFO ] [Real]Absence check using 37 positive and 3264 generalized place invariants in 629 ms returned sat
[2024-05-25 16:31:02] [INFO ] [Real]Absence check using state equation in 1536 ms returned sat
[2024-05-25 16:31:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:31:02] [INFO ] [Nat]Absence check using 37 positive place invariants in 76 ms returned sat
[2024-05-25 16:31:03] [INFO ] [Nat]Absence check using 37 positive and 3264 generalized place invariants in 610 ms returned sat
[2024-05-25 16:31:04] [INFO ] [Nat]Absence check using state equation in 1729 ms returned sat
[2024-05-25 16:31:04] [INFO ] Computed and/alt/rep : 370/436/370 causal constraints (skipped 102 transitions) in 47 ms.
[2024-05-25 16:31:05] [INFO ] Added : 39 causal constraints over 8 iterations in 798 ms. Result :sat
Minimization took 664 ms.
[2024-05-25 16:31:06] [INFO ] [Real]Absence check using 37 positive place invariants in 73 ms returned sat
[2024-05-25 16:31:07] [INFO ] [Real]Absence check using 37 positive and 3264 generalized place invariants in 613 ms returned sat
[2024-05-25 16:31:11] [INFO ] [Real]Absence check using state equation in 3972 ms returned unknown
[2024-05-25 16:31:11] [INFO ] [Real]Absence check using 37 positive place invariants in 73 ms returned sat
[2024-05-25 16:31:12] [INFO ] [Real]Absence check using 37 positive and 3264 generalized place invariants in 658 ms returned sat
[2024-05-25 16:31:13] [INFO ] [Real]Absence check using state equation in 1258 ms returned sat
[2024-05-25 16:31:13] [INFO ] Computed and/alt/rep : 370/436/370 causal constraints (skipped 102 transitions) in 44 ms.
[2024-05-25 16:31:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:31:16] [INFO ] [Nat]Absence check using 37 positive place invariants in 77 ms returned sat
[2024-05-25 16:31:17] [INFO ] [Nat]Absence check using 37 positive and 3264 generalized place invariants in 660 ms returned sat
[2024-05-25 16:31:18] [INFO ] [Nat]Absence check using state equation in 1292 ms returned sat
[2024-05-25 16:31:19] [INFO ] Computed and/alt/rep : 370/436/370 causal constraints (skipped 102 transitions) in 40 ms.
[2024-05-25 16:31:21] [INFO ] Added : 135 causal constraints over 27 iterations in 2325 ms. Result :sat
Minimization took 160 ms.
[2024-05-25 16:31:21] [INFO ] [Real]Absence check using 37 positive place invariants in 74 ms returned sat
[2024-05-25 16:31:22] [INFO ] [Real]Absence check using 37 positive and 3264 generalized place invariants in 651 ms returned sat
[2024-05-25 16:31:24] [INFO ] [Real]Absence check using state equation in 1572 ms returned sat
[2024-05-25 16:31:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:31:24] [INFO ] [Nat]Absence check using 37 positive place invariants in 78 ms returned sat
[2024-05-25 16:31:25] [INFO ] [Nat]Absence check using 37 positive and 3264 generalized place invariants in 665 ms returned sat
[2024-05-25 16:31:26] [INFO ] [Nat]Absence check using state equation in 1609 ms returned sat
[2024-05-25 16:31:27] [INFO ] Computed and/alt/rep : 370/436/370 causal constraints (skipped 102 transitions) in 38 ms.
Maximisation of solution failed !
Minimization took 3 ms.
[2024-05-25 16:31:29] [INFO ] [Real]Absence check using 37 positive place invariants in 77 ms returned sat
[2024-05-25 16:31:30] [INFO ] [Real]Absence check using 37 positive and 3264 generalized place invariants in 616 ms returned sat
[2024-05-25 16:31:31] [INFO ] [Real]Absence check using state equation in 1521 ms returned sat
[2024-05-25 16:31:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:31:32] [INFO ] [Nat]Absence check using 37 positive place invariants in 74 ms returned sat
[2024-05-25 16:31:32] [INFO ] [Nat]Absence check using 37 positive and 3264 generalized place invariants in 634 ms returned sat
[2024-05-25 16:31:34] [INFO ] [Nat]Absence check using state equation in 1997 ms returned sat
[2024-05-25 16:31:35] [INFO ] Computed and/alt/rep : 370/436/370 causal constraints (skipped 102 transitions) in 35 ms.
Maximisation of solution failed !
Minimization took 1 ms.
[2024-05-25 16:31:37] [INFO ] [Real]Absence check using 37 positive place invariants in 75 ms returned sat
[2024-05-25 16:31:37] [INFO ] [Real]Absence check using 37 positive and 3264 generalized place invariants in 639 ms returned sat
[2024-05-25 16:31:41] [INFO ] [Real]Absence check using state equation in 3913 ms returned unknown
[2024-05-25 16:31:42] [INFO ] [Real]Absence check using 37 positive place invariants in 71 ms returned sat
[2024-05-25 16:31:42] [INFO ] [Real]Absence check using 37 positive and 3264 generalized place invariants in 654 ms returned sat
[2024-05-25 16:31:45] [INFO ] [Real]Absence check using state equation in 2633 ms returned sat
[2024-05-25 16:31:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:31:46] [INFO ] [Nat]Absence check using 37 positive place invariants in 82 ms returned sat
[2024-05-25 16:31:46] [INFO ] [Nat]Absence check using 37 positive and 3264 generalized place invariants in 620 ms returned sat
[2024-05-25 16:31:48] [INFO ] [Nat]Absence check using state equation in 2009 ms returned sat
[2024-05-25 16:31:51] [INFO ] Deduced a trap composed of 6 places in 3025 ms of which 190 ms to minimize.
[2024-05-25 16:31:51] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 9
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-25 16:31:52] [INFO ] [Real]Absence check using 37 positive place invariants in 79 ms returned sat
[2024-05-25 16:31:53] [INFO ] [Real]Absence check using 37 positive and 3264 generalized place invariants in 629 ms returned sat
[2024-05-25 16:31:56] [INFO ] [Real]Absence check using state equation in 3423 ms returned sat
[2024-05-25 16:31:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:31:56] [INFO ] [Nat]Absence check using 37 positive place invariants in 75 ms returned sat
[2024-05-25 16:31:57] [INFO ] [Nat]Absence check using 37 positive and 3264 generalized place invariants in 637 ms returned sat
[2024-05-25 16:32:01] [INFO ] [Nat]Absence check using state equation in 3960 ms returned unknown
[2024-05-25 16:32:01] [INFO ] [Real]Absence check using 37 positive place invariants in 77 ms returned sat
[2024-05-25 16:32:02] [INFO ] [Real]Absence check using 37 positive and 3264 generalized place invariants in 651 ms returned sat
[2024-05-25 16:32:04] [INFO ] [Real]Absence check using state equation in 1556 ms returned sat
[2024-05-25 16:32:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:32:04] [INFO ] [Nat]Absence check using 37 positive place invariants in 77 ms returned sat
[2024-05-25 16:32:05] [INFO ] [Nat]Absence check using 37 positive and 3264 generalized place invariants in 663 ms returned sat
[2024-05-25 16:32:07] [INFO ] [Nat]Absence check using state equation in 1786 ms returned sat
[2024-05-25 16:32:07] [INFO ] Computed and/alt/rep : 370/436/370 causal constraints (skipped 102 transitions) in 36 ms.
Maximisation of solution failed !
Minimization took 0 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, +inf, 33, 33, 33, 33, 33, 33, 1089, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, +inf, 33, 33, 33, 33, 33, 33, 1089, +inf]
Support contains 1388 out of 3806 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3806/3806 places, 506/506 transitions.
Graph (complete) has 43474 edges and 3806 vertex of which 3769 are kept as prefixes of interest. Removing 37 places using SCC suffix rule.21 ms
Discarding 37 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 69 transitions
Reduce isomorphic transitions removed 69 transitions.
Discarding 33 places :
Implicit places reduction removed 33 places
Iterating post reduction 0 with 102 rules applied. Total rules applied 103 place count 3736 transition count 437
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 34 Pre rules applied. Total rules applied 103 place count 3736 transition count 403
Deduced a syphon composed of 34 places in 2 ms
Ensure Unique test removed 65 places
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 1 with 133 rules applied. Total rules applied 236 place count 3637 transition count 403
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 236 place count 3637 transition count 402
Deduced a syphon composed of 1 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 3 rules applied. Total rules applied 239 place count 3635 transition count 402
Applied a total of 239 rules in 472 ms. Remains 3635 /3806 variables (removed 171) and now considering 402/506 (removed 104) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 481 ms. Remains : 3635/3806 places, 402/506 transitions.
When looking for a positive semi flow solution, solver replied unsat
// Phase 1: matrix 402 rows 3635 cols
[2024-05-25 16:32:10] [INFO ] Computed 3233 invariants in 43 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, +inf, 33, 33, 33, 33, 33, 33, 1089, +inf]
RANDOM walk for 1000000 steps (18029 resets) in 24283 ms. (41 steps per ms)
FORMULA QuasiCertifProtocol-COL-32-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA QuasiCertifProtocol-COL-32-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA QuasiCertifProtocol-COL-32-UpperBounds-12 33 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 8306004 steps (6127 resets) in 26833 ms. (309 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[33, 33, 14, 0, 0, 14, 0, 0, 14] Max Struct:[+inf, +inf, 33, 33, 33, 33, 33, 1089, +inf]
[2024-05-25 16:33:01] [INFO ] Invariant cache hit.
[2024-05-25 16:33:02] [INFO ] [Real]Absence check using 0 positive and 3233 generalized place invariants in 679 ms returned sat
[2024-05-25 16:33:08] [INFO ] [Real]Absence check using state equation in 5082 ms returned unsat
[2024-05-25 16:33:09] [INFO ] [Real]Absence check using 0 positive and 3233 generalized place invariants in 672 ms returned sat
[2024-05-25 16:33:17] [INFO ] [Real]Absence check using state equation in 8620 ms returned unsat
[2024-05-25 16:33:18] [INFO ] [Real]Absence check using 0 positive and 3233 generalized place invariants in 666 ms returned sat
[2024-05-25 16:33:20] [INFO ] [Real]Absence check using state equation in 1347 ms returned sat
[2024-05-25 16:33:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:33:21] [INFO ] [Nat]Absence check using 0 positive and 3233 generalized place invariants in 666 ms returned sat
[2024-05-25 16:33:22] [INFO ] [Nat]Absence check using state equation in 1664 ms returned sat
[2024-05-25 16:33:22] [INFO ] Computed and/alt/rep : 300/333/300 causal constraints (skipped 101 transitions) in 46 ms.
[2024-05-25 16:33:24] [INFO ] Added : 99 causal constraints over 20 iterations in 1640 ms. Result :sat
Minimization took 5263 ms.
[2024-05-25 16:33:30] [INFO ] [Real]Absence check using 0 positive and 3233 generalized place invariants in 655 ms returned sat
[2024-05-25 16:33:32] [INFO ] [Real]Absence check using state equation in 1782 ms returned sat
[2024-05-25 16:33:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:33:33] [INFO ] [Nat]Absence check using 0 positive and 3233 generalized place invariants in 676 ms returned sat
[2024-05-25 16:33:36] [INFO ] [Nat]Absence check using state equation in 2829 ms returned sat
[2024-05-25 16:33:36] [INFO ] Computed and/alt/rep : 300/333/300 causal constraints (skipped 101 transitions) in 36 ms.
[2024-05-25 16:33:39] [INFO ] Added : 151 causal constraints over 31 iterations in 2613 ms. Result :sat
Minimization took 5271 ms.
[2024-05-25 16:33:45] [INFO ] [Real]Absence check using 0 positive and 3233 generalized place invariants in 663 ms returned sat
[2024-05-25 16:33:46] [INFO ] [Real]Absence check using state equation in 1173 ms returned sat
[2024-05-25 16:33:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:33:47] [INFO ] [Nat]Absence check using 0 positive and 3233 generalized place invariants in 686 ms returned sat
[2024-05-25 16:33:49] [INFO ] [Nat]Absence check using state equation in 1218 ms returned sat
[2024-05-25 16:33:49] [INFO ] Computed and/alt/rep : 300/333/300 causal constraints (skipped 101 transitions) in 30 ms.
[2024-05-25 16:33:50] [INFO ] Added : 119 causal constraints over 24 iterations in 1898 ms. Result :sat
Minimization took 5259 ms.
[2024-05-25 16:33:57] [INFO ] [Real]Absence check using 0 positive and 3233 generalized place invariants in 691 ms returned sat
[2024-05-25 16:33:58] [INFO ] [Real]Absence check using state equation in 1082 ms returned sat
[2024-05-25 16:33:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:33:59] [INFO ] [Nat]Absence check using 0 positive and 3233 generalized place invariants in 671 ms returned sat
[2024-05-25 16:34:00] [INFO ] [Nat]Absence check using state equation in 1101 ms returned sat
[2024-05-25 16:34:00] [INFO ] Computed and/alt/rep : 300/333/300 causal constraints (skipped 101 transitions) in 33 ms.
[2024-05-25 16:34:01] [INFO ] Added : 68 causal constraints over 14 iterations in 1176 ms. Result :sat
Minimization took 5347 ms.
[2024-05-25 16:34:08] [INFO ] [Real]Absence check using 0 positive and 3233 generalized place invariants in 683 ms returned sat
[2024-05-25 16:34:09] [INFO ] [Real]Absence check using state equation in 1464 ms returned sat
[2024-05-25 16:34:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:34:10] [INFO ] [Nat]Absence check using 0 positive and 3233 generalized place invariants in 685 ms returned sat
[2024-05-25 16:34:12] [INFO ] [Nat]Absence check using state equation in 1462 ms returned sat
[2024-05-25 16:34:12] [INFO ] Computed and/alt/rep : 300/333/300 causal constraints (skipped 101 transitions) in 41 ms.
[2024-05-25 16:34:14] [INFO ] Added : 116 causal constraints over 24 iterations in 1916 ms. Result :sat
Minimization took 5263 ms.
[2024-05-25 16:34:20] [INFO ] [Real]Absence check using 0 positive and 3233 generalized place invariants in 688 ms returned sat
[2024-05-25 16:34:22] [INFO ] [Real]Absence check using state equation in 1802 ms returned sat
[2024-05-25 16:34:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:34:23] [INFO ] [Nat]Absence check using 0 positive and 3233 generalized place invariants in 695 ms returned sat
[2024-05-25 16:34:25] [INFO ] [Nat]Absence check using state equation in 1773 ms returned sat
[2024-05-25 16:34:25] [INFO ] Computed and/alt/rep : 300/333/300 causal constraints (skipped 101 transitions) in 32 ms.
[2024-05-25 16:34:27] [INFO ] Added : 134 causal constraints over 27 iterations in 2127 ms. Result :sat
Minimization took 5252 ms.
[2024-05-25 16:34:33] [INFO ] [Real]Absence check using 0 positive and 3233 generalized place invariants in 681 ms returned sat
[2024-05-25 16:34:34] [INFO ] [Real]Absence check using state equation in 1044 ms returned sat
[2024-05-25 16:34:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:34:35] [INFO ] [Nat]Absence check using 0 positive and 3233 generalized place invariants in 706 ms returned sat
[2024-05-25 16:34:37] [INFO ] [Nat]Absence check using state equation in 1945 ms returned sat
[2024-05-25 16:34:37] [INFO ] Computed and/alt/rep : 300/333/300 causal constraints (skipped 101 transitions) in 32 ms.
[2024-05-25 16:34:39] [INFO ] Added : 86 causal constraints over 18 iterations in 1490 ms. Result :sat
Minimization took 5249 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[33, 33, 14, 0, 0, 14, 0, 0, 14] Max Struct:[33, 33, 33, 33, 33, 33, 33, 1089, +inf]
FORMULA QuasiCertifProtocol-COL-32-UpperBounds-03 33 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-COL-32-UpperBounds-00 33 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[14, 0, 0, 14, 0, 0, 14] Max Struct:[33, 33, 33, 33, 33, 1089, +inf]
Support contains 1287 out of 3635 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3635/3635 places, 402/402 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Discarding 33 places :
Implicit places reduction removed 33 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 69 rules applied. Total rules applied 69 place count 3602 transition count 366
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 70 place count 3601 transition count 366
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 33 Pre rules applied. Total rules applied 70 place count 3601 transition count 333
Deduced a syphon composed of 33 places in 1 ms
Ensure Unique test removed 33 places
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 2 with 99 rules applied. Total rules applied 169 place count 3535 transition count 333
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 170 place count 3535 transition count 332
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 171 place count 3534 transition count 332
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 172 place count 3533 transition count 331
Applied a total of 172 rules in 426 ms. Remains 3533 /3635 variables (removed 102) and now considering 331/402 (removed 71) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 426 ms. Remains : 3533/3635 places, 331/402 transitions.
When looking for a positive semi flow solution, solver replied unsat
// Phase 1: matrix 331 rows 3533 cols
[2024-05-25 16:34:46] [INFO ] Computed 3202 invariants in 15 ms
Current structural bounds on expressions (after invariants) : Max Seen:[14, 0, 0, 14, 0, 0, 14] Max Struct:[33, 33, 33, 33, 33, 1089, +inf]
RANDOM walk for 927790 steps (12371 resets) in 30001 ms. (30 steps per ms)
FORMULA QuasiCertifProtocol-COL-32-UpperBounds-13 1089 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA QuasiCertifProtocol-COL-32-UpperBounds-07 33 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA QuasiCertifProtocol-COL-32-UpperBounds-04 33 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 3259082 steps (1286 resets) in 18682 ms. (174 steps per ms)
FORMULA QuasiCertifProtocol-COL-32-UpperBounds-09 33 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Current structural bounds on expressions (after WALK) : Max Seen:[21, 1, 33] Max Struct:[33, 33, +inf]
[2024-05-25 16:35:34] [INFO ] Invariant cache hit.
[2024-05-25 16:35:35] [INFO ] [Real]Absence check using 0 positive and 3202 generalized place invariants in 620 ms returned sat
[2024-05-25 16:35:36] [INFO ] [Real]Absence check using state equation in 1190 ms returned sat
[2024-05-25 16:35:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:35:37] [INFO ] [Nat]Absence check using 0 positive and 3202 generalized place invariants in 657 ms returned sat
[2024-05-25 16:35:39] [INFO ] [Nat]Absence check using state equation in 1412 ms returned sat
[2024-05-25 16:35:39] [INFO ] Computed and/alt/rep : 198/198/198 causal constraints (skipped 100 transitions) in 32 ms.
[2024-05-25 16:35:40] [INFO ] Added : 51 causal constraints over 11 iterations in 893 ms. Result :sat
Minimization took 5203 ms.
[2024-05-25 16:35:46] [INFO ] [Real]Absence check using 0 positive and 3202 generalized place invariants in 636 ms returned sat
[2024-05-25 16:35:47] [INFO ] [Real]Absence check using state equation in 1521 ms returned sat
[2024-05-25 16:35:48] [INFO ] Computed and/alt/rep : 198/198/198 causal constraints (skipped 100 transitions) in 27 ms.
[2024-05-25 16:35:49] [INFO ] Added : 52 causal constraints over 11 iterations in 970 ms. Result :sat
Minimization took 6248 ms.
[2024-05-25 16:35:56] [INFO ] [Real]Absence check using 0 positive and 3202 generalized place invariants in 685 ms returned sat
[2024-05-25 16:35:57] [INFO ] [Real]Absence check using state equation in 983 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[21, 1, 33] Max Struct:[33, 33, 33]
FORMULA QuasiCertifProtocol-COL-32-UpperBounds-14 33 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[21, 1] Max Struct:[33, 33]
Support contains 66 out of 3533 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3533/3533 places, 331/331 transitions.
Graph (complete) has 41580 edges and 3533 vertex of which 3466 are kept as prefixes of interest. Removing 67 places using SCC suffix rule.5 ms
Discarding 67 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 66 transitions
Reduce isomorphic transitions removed 66 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 99 rules applied. Total rules applied 100 place count 3466 transition count 231
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 133 place count 3433 transition count 231
Reduce places removed 33 places and 33 transitions.
Iterating global reduction 2 with 33 rules applied. Total rules applied 166 place count 3400 transition count 198
Ensure Unique test removed 1089 places
Iterating post reduction 2 with 1089 rules applied. Total rules applied 1255 place count 2311 transition count 198
Applied a total of 1255 rules in 628 ms. Remains 2311 /3533 variables (removed 1222) and now considering 198/331 (removed 133) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 641 ms. Remains : 2311/3533 places, 198/331 transitions.
// Phase 1: matrix 198 rows 2311 cols
[2024-05-25 16:35:58] [INFO ] Computed 2113 invariants in 29 ms
Current structural bounds on expressions (after invariants) : Max Seen:[21, 1] Max Struct:[33, 33]
RANDOM walk for 1000000 steps (7519 resets) in 20336 ms. (49 steps per ms)
FORMULA QuasiCertifProtocol-COL-32-UpperBounds-08 33 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 974244 steps (254 resets) in 10002 ms. (97 steps per ms)
FORMULA QuasiCertifProtocol-COL-32-UpperBounds-10 33 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 5 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 350176 ms.
ITS solved all properties within timeout
BK_STOP 1716654988504
--------------------
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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
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="QuasiCertifProtocol-COL-32"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is QuasiCertifProtocol-COL-32, 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 r311-tall-171662335800053"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/QuasiCertifProtocol-COL-32.tgz
mv QuasiCertifProtocol-COL-32 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 ;