Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r167-tall-174881266200102.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool gold2024
Input is QuasiCertifProtocol-PT-22, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r167-tall-174881266200102
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.5M
-rw-r--r-- 1 mcc users 26K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 187K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 14K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 87K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 39K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 171K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 7.6K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 40K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 147K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 950K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 42K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 270K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 7.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 22K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 503K May 29 14:32 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

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

=== Now, execution of the tool begins

BK_START 1748900385220

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-PT-22
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-06-02 21:39:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-02 21:39:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 21:39:46] [INFO ] Load time of PNML (sax parser for PT used): 110 ms
[2025-06-02 21:39:46] [INFO ] Transformed 1966 places.
[2025-06-02 21:39:46] [INFO ] Transformed 356 transitions.
[2025-06-02 21:39:46] [INFO ] Parsed PT model containing 1966 places and 356 transitions and 4323 arcs in 205 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 15 ms.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 13, 0, 0, 0, 0, 0, 1, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 13, 0, 0, 0, 0, 0, 1, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 356 rows 1966 cols
[2025-06-02 21:39:46] [INFO ] Computed 1611 invariants in 94 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 13, 0, 0, 0, 0, 0, 1, 0, 0] Max Struct:[12167, 529, 529, 13, 1, 529, 1, 13, +inf, +inf, 23, 1, +inf, 23, +inf, 1]
FORMULA QuasiCertifProtocol-PT-22-UpperBounds-07 13 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 10000 steps (373 resets) in 150 ms. (66 steps per ms)
FORMULA QuasiCertifProtocol-PT-22-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA QuasiCertifProtocol-PT-22-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 130012 steps (288 resets) in 326 ms. (397 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0] Max Struct:[12167, 529, 529, 13, 529, +inf, +inf, 23, 1, +inf, 23, +inf, 1]
[2025-06-02 21:39:47] [INFO ] Invariant cache hit.
[2025-06-02 21:39:47] [INFO ] [Real]Absence check using 3 positive place invariants in 28 ms returned sat
[2025-06-02 21:39:48] [INFO ] [Real]Absence check using 3 positive and 1608 generalized place invariants in 544 ms returned sat
[2025-06-02 21:39:52] [INFO ] [Real]Absence check using state equation in 4019 ms returned sat
[2025-06-02 21:39:52] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:39:52] [INFO ] [Nat]Absence check using 3 positive place invariants in 19 ms returned sat
[2025-06-02 21:39:53] [INFO ] [Nat]Absence check using 3 positive and 1608 generalized place invariants in 279 ms returned sat
[2025-06-02 21:39:56] [INFO ] [Nat]Absence check using state equation in 3564 ms returned sat
[2025-06-02 21:39:56] [INFO ] Deduced a trap composed of 6 places in 93 ms of which 17 ms to minimize.
[2025-06-02 21:39:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 262 ms
[2025-06-02 21:39:56] [INFO ] Computed and/alt/rep : 260/306/260 causal constraints (skipped 72 transitions) in 67 ms.
[2025-06-02 21:39:57] [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: Broken pipe ... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
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)
[2025-06-02 21:39:57] [INFO ] [Real]Absence check using 3 positive place invariants in 20 ms returned sat
[2025-06-02 21:39:58] [INFO ] [Real]Absence check using 3 positive and 1608 generalized place invariants in 310 ms returned sat
[2025-06-02 21:39:58] [INFO ] [Real]Absence check using state equation in 823 ms returned sat
[2025-06-02 21:39:58] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:39:59] [INFO ] [Nat]Absence check using 3 positive place invariants in 17 ms returned sat
[2025-06-02 21:39:59] [INFO ] [Nat]Absence check using 3 positive and 1608 generalized place invariants in 284 ms returned sat
[2025-06-02 21:40:00] [INFO ] [Nat]Absence check using state equation in 849 ms returned sat
[2025-06-02 21:40:00] [INFO ] Computed and/alt/rep : 260/306/260 causal constraints (skipped 72 transitions) in 26 ms.
[2025-06-02 21:40:01] [INFO ] Added : 71 causal constraints over 15 iterations in 810 ms. Result :sat
Minimization took 603 ms.
[2025-06-02 21:40:01] [INFO ] [Real]Absence check using 3 positive place invariants in 16 ms returned sat
[2025-06-02 21:40:02] [INFO ] [Real]Absence check using 3 positive and 1608 generalized place invariants in 293 ms returned sat
[2025-06-02 21:40:03] [INFO ] [Real]Absence check using state equation in 766 ms returned sat
[2025-06-02 21:40:03] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:40:03] [INFO ] [Nat]Absence check using 3 positive place invariants in 22 ms returned sat
[2025-06-02 21:40:03] [INFO ] [Nat]Absence check using 3 positive and 1608 generalized place invariants in 391 ms returned sat
[2025-06-02 21:40:04] [INFO ] [Nat]Absence check using state equation in 1011 ms returned sat
[2025-06-02 21:40:04] [INFO ] Computed and/alt/rep : 260/306/260 causal constraints (skipped 72 transitions) in 24 ms.
[2025-06-02 21:40:05] [INFO ] Added : 119 causal constraints over 24 iterations in 1276 ms. Result :sat
Minimization took 734 ms.
[2025-06-02 21:40:06] [INFO ] [Real]Absence check using 3 positive place invariants in 16 ms returned sat
[2025-06-02 21:40:07] [INFO ] [Real]Absence check using 3 positive and 1608 generalized place invariants in 273 ms returned sat
[2025-06-02 21:40:08] [INFO ] [Real]Absence check using state equation in 1107 ms returned sat
[2025-06-02 21:40:08] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:40:08] [INFO ] [Nat]Absence check using 3 positive place invariants in 17 ms returned sat
[2025-06-02 21:40:08] [INFO ] [Nat]Absence check using 3 positive and 1608 generalized place invariants in 247 ms returned sat
[2025-06-02 21:40:10] [INFO ] [Nat]Absence check using state equation in 1224 ms returned sat
[2025-06-02 21:40:10] [INFO ] Computed and/alt/rep : 260/306/260 causal constraints (skipped 72 transitions) in 29 ms.
[2025-06-02 21:40:11] [INFO ] Deduced a trap composed of 11 places in 213 ms of which 5 ms to minimize.
[2025-06-02 21:40:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 288 ms
[2025-06-02 21:40:11] [INFO ] Added : 107 causal constraints over 22 iterations in 1441 ms. Result :sat
Minimization took 726 ms.
[2025-06-02 21:40:12] [INFO ] [Real]Absence check using 3 positive place invariants in 17 ms returned sat
[2025-06-02 21:40:12] [INFO ] [Real]Absence check using 3 positive and 1608 generalized place invariants in 262 ms returned sat
[2025-06-02 21:40:13] [INFO ] [Real]Absence check using state equation in 848 ms returned sat
[2025-06-02 21:40:13] [INFO ] Computed and/alt/rep : 260/306/260 causal constraints (skipped 72 transitions) in 26 ms.
[2025-06-02 21:40:14] [INFO ] Added : 52 causal constraints over 11 iterations in 657 ms. Result :sat
Minimization took 693 ms.
[2025-06-02 21:40:15] [INFO ] [Real]Absence check using 3 positive place invariants in 16 ms returned sat
[2025-06-02 21:40:15] [INFO ] [Real]Absence check using 3 positive and 1608 generalized place invariants in 271 ms returned sat
[2025-06-02 21:40:16] [INFO ] [Real]Absence check using state equation in 695 ms returned sat
[2025-06-02 21:40:16] [INFO ] Computed and/alt/rep : 260/306/260 causal constraints (skipped 72 transitions) in 22 ms.
[2025-06-02 21:40:16] [INFO ] Added : 53 causal constraints over 11 iterations in 632 ms. Result :sat
Minimization took 697 ms.
[2025-06-02 21:40:17] [INFO ] [Real]Absence check using 3 positive place invariants in 15 ms returned sat
[2025-06-02 21:40:18] [INFO ] [Real]Absence check using 3 positive and 1608 generalized place invariants in 265 ms returned sat
[2025-06-02 21:40:18] [INFO ] [Real]Absence check using state equation in 857 ms returned sat
[2025-06-02 21:40:19] [INFO ] Computed and/alt/rep : 260/306/260 causal constraints (skipped 72 transitions) in 29 ms.
[2025-06-02 21:40:20] [INFO ] Added : 106 causal constraints over 22 iterations in 1223 ms. Result :sat
Minimization took 689 ms.
[2025-06-02 21:40:21] [INFO ] [Real]Absence check using 3 positive place invariants in 16 ms returned sat
[2025-06-02 21:40:21] [INFO ] [Real]Absence check using 3 positive and 1608 generalized place invariants in 266 ms returned sat
[2025-06-02 21:40:21] [INFO ] [Real]Absence check using state equation in 64 ms returned unsat
[2025-06-02 21:40:21] [INFO ] [Real]Absence check using 3 positive place invariants in 16 ms returned sat
[2025-06-02 21:40:21] [INFO ] [Real]Absence check using 3 positive and 1608 generalized place invariants in 269 ms returned sat
[2025-06-02 21:40:22] [INFO ] [Real]Absence check using state equation in 790 ms returned sat
[2025-06-02 21:40:22] [INFO ] Computed and/alt/rep : 260/306/260 causal constraints (skipped 72 transitions) in 30 ms.
[2025-06-02 21:40:23] [INFO ] Added : 83 causal constraints over 17 iterations in 933 ms. Result :sat
Minimization took 704 ms.
[2025-06-02 21:40:24] [INFO ] [Real]Absence check using 3 positive place invariants in 15 ms returned sat
[2025-06-02 21:40:25] [INFO ] [Real]Absence check using 3 positive and 1608 generalized place invariants in 278 ms returned sat
[2025-06-02 21:40:25] [INFO ] [Real]Absence check using state equation in 690 ms returned sat
[2025-06-02 21:40:25] [INFO ] Computed and/alt/rep : 260/306/260 causal constraints (skipped 72 transitions) in 25 ms.
[2025-06-02 21:40:26] [INFO ] Added : 28 causal constraints over 6 iterations in 377 ms. Result :sat
Minimization took 700 ms.
[2025-06-02 21:40:27] [INFO ] [Real]Absence check using 3 positive place invariants in 15 ms returned sat
[2025-06-02 21:40:27] [INFO ] [Real]Absence check using 3 positive and 1608 generalized place invariants in 269 ms returned sat
[2025-06-02 21:40:27] [INFO ] [Real]Absence check using state equation in 64 ms returned unsat
[2025-06-02 21:40:27] [INFO ] [Real]Absence check using 3 positive place invariants in 15 ms returned sat
[2025-06-02 21:40:27] [INFO ] [Real]Absence check using 3 positive and 1608 generalized place invariants in 274 ms returned sat
[2025-06-02 21:40:28] [INFO ] [Real]Absence check using state equation in 804 ms returned sat
[2025-06-02 21:40:28] [INFO ] Computed and/alt/rep : 260/306/260 causal constraints (skipped 72 transitions) in 23 ms.
[2025-06-02 21:40:29] [INFO ] Added : 53 causal constraints over 11 iterations in 639 ms. Result :sat
Minimization took 694 ms.
[2025-06-02 21:40:30] [INFO ] [Real]Absence check using 3 positive place invariants in 15 ms returned sat
[2025-06-02 21:40:30] [INFO ] [Real]Absence check using 3 positive and 1608 generalized place invariants in 272 ms returned sat
[2025-06-02 21:40:31] [INFO ] [Real]Absence check using state equation in 796 ms returned sat
[2025-06-02 21:40:31] [INFO ] Computed and/alt/rep : 260/306/260 causal constraints (skipped 72 transitions) in 25 ms.
[2025-06-02 21:40:32] [INFO ] Added : 48 causal constraints over 10 iterations in 585 ms. Result :sat
Minimization took 695 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0] Max Struct:[12167, 529, 529, 13, 529, +inf, +inf, 1, 1, +inf, 1, +inf, 1]
FORMULA QuasiCertifProtocol-PT-22-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-22-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[12167, 529, 529, 13, 529, +inf, +inf, 1, +inf, +inf, 1]
Support contains 605 out of 1966 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1966/1966 places, 356/356 transitions.
Graph (complete) has 16044 edges and 1966 vertex of which 1941 are kept as prefixes of interest. Removing 25 places using SCC suffix rule.10 ms
Discarding 25 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 96 transitions
Reduce isomorphic transitions removed 96 transitions.
Discarding 46 places :
Implicit places reduction removed 46 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 143 rules applied. Total rules applied 144 place count 1895 transition count 259
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 145 place count 1894 transition count 259
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 45 Pre rules applied. Total rules applied 145 place count 1894 transition count 214
Deduced a syphon composed of 45 places in 1 ms
Ensure Unique test removed 67 places
Reduce places removed 112 places and 0 transitions.
Iterating global reduction 2 with 157 rules applied. Total rules applied 302 place count 1782 transition count 214
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 303 place count 1781 transition count 214
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 303 place count 1781 transition count 212
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 5 rules applied. Total rules applied 308 place count 1778 transition count 212
Applied a total of 308 rules in 278 ms. Remains 1778 /1966 variables (removed 188) and now considering 212/356 (removed 144) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 294 ms. Remains : 1778/1966 places, 212/356 transitions.
When looking for a positive semi flow solution, solver replied unsat
// Phase 1: matrix 212 rows 1778 cols
[2025-06-02 21:40:33] [INFO ] Computed 1566 invariants in 12 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[3496, 529, 23, 13, 529, +inf, 21, 1, +inf, +inf, 1]
RANDOM walk for 1000000 steps (33548 resets) in 15425 ms. (64 steps per ms)
FORMULA QuasiCertifProtocol-PT-22-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA QuasiCertifProtocol-PT-22-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA QuasiCertifProtocol-PT-22-UpperBounds-03 13 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 7131800 steps (11310 resets) in 28190 ms. (252 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[529, 23, 10, 23, 1, 1, 1, 1] Max Struct:[3496, 529, 23, 529, +inf, 21, +inf, +inf]
[2025-06-02 21:41:16] [INFO ] Invariant cache hit.
[2025-06-02 21:41:17] [INFO ] [Real]Absence check using 23 positive place invariants in 26 ms returned sat
[2025-06-02 21:41:20] [INFO ] [Real]Absence check using 23 positive and 1543 generalized place invariants in 2960 ms returned unsat
[2025-06-02 21:41:20] [INFO ] [Real]Absence check using 23 positive place invariants in 18 ms returned sat
[2025-06-02 21:41:20] [INFO ] [Real]Absence check using 23 positive and 1543 generalized place invariants in 292 ms returned sat
[2025-06-02 21:41:22] [INFO ] [Real]Absence check using state equation in 1574 ms returned unsat
[2025-06-02 21:41:22] [INFO ] [Real]Absence check using 23 positive place invariants in 21 ms returned sat
[2025-06-02 21:41:22] [INFO ] [Real]Absence check using 23 positive and 1543 generalized place invariants in 261 ms returned sat
[2025-06-02 21:41:23] [INFO ] [Real]Absence check using state equation in 577 ms returned sat
[2025-06-02 21:41:23] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:41:23] [INFO ] [Nat]Absence check using 23 positive place invariants in 17 ms returned sat
[2025-06-02 21:41:23] [INFO ] [Nat]Absence check using 23 positive and 1543 generalized place invariants in 291 ms returned sat
[2025-06-02 21:41:24] [INFO ] [Nat]Absence check using state equation in 580 ms returned sat
[2025-06-02 21:41:24] [INFO ] Computed and/alt/rep : 141/141/141 causal constraints (skipped 70 transitions) in 18 ms.
[2025-06-02 21:41:24] [INFO ] Added : 71 causal constraints over 15 iterations in 666 ms. Result :sat
Minimization took 3637 ms.
[2025-06-02 21:41:28] [INFO ] [Real]Absence check using 23 positive place invariants in 16 ms returned sat
[2025-06-02 21:41:29] [INFO ] [Real]Absence check using 23 positive and 1543 generalized place invariants in 278 ms returned sat
[2025-06-02 21:41:30] [INFO ] [Real]Absence check using state equation in 1292 ms returned unsat
[2025-06-02 21:41:30] [INFO ] [Real]Absence check using 23 positive place invariants in 19 ms returned sat
[2025-06-02 21:41:30] [INFO ] [Real]Absence check using 23 positive and 1543 generalized place invariants in 280 ms returned sat
[2025-06-02 21:41:31] [INFO ] [Real]Absence check using state equation in 551 ms returned unsat
[2025-06-02 21:41:31] [INFO ] [Real]Absence check using 23 positive place invariants in 18 ms returned sat
[2025-06-02 21:41:31] [INFO ] [Real]Absence check using 23 positive and 1543 generalized place invariants in 212 ms returned unsat
[2025-06-02 21:41:32] [INFO ] [Real]Absence check using 23 positive place invariants in 17 ms returned sat
[2025-06-02 21:41:32] [INFO ] [Real]Absence check using 23 positive and 1543 generalized place invariants in 276 ms returned sat
[2025-06-02 21:41:32] [INFO ] [Real]Absence check using state equation in 437 ms returned unsat
[2025-06-02 21:41:32] [INFO ] [Real]Absence check using 23 positive place invariants in 19 ms returned sat
[2025-06-02 21:41:33] [INFO ] [Real]Absence check using 23 positive and 1543 generalized place invariants in 280 ms returned sat
[2025-06-02 21:41:33] [INFO ] [Real]Absence check using state equation in 461 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[529, 23, 10, 23, 1, 1, 1, 1] Max Struct:[529, 23, 23, 23, 1, 1, 1, 1]
FORMULA QuasiCertifProtocol-PT-22-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-22-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-22-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-22-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-22-UpperBounds-05 23 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-22-UpperBounds-01 23 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-22-UpperBounds-00 529 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[23] Max Struct:[23]
Support contains 23 out of 1778 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1778/1778 places, 212/212 transitions.
Graph (complete) has 15553 edges and 1778 vertex of which 1751 are kept as prefixes of interest. Removing 27 places using SCC suffix rule.2 ms
Discarding 27 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 70 transitions
Reduce isomorphic transitions removed 70 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 118 rules applied. Total rules applied 119 place count 1751 transition count 93
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 167 place count 1703 transition count 93
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 1 ms
Ensure Unique test removed 506 places
Reduce places removed 529 places and 0 transitions.
Iterating global reduction 2 with 552 rules applied. Total rules applied 719 place count 1174 transition count 70
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 720 place count 1173 transition count 69
Ensure Unique test removed 23 places
Iterating post reduction 2 with 23 rules applied. Total rules applied 743 place count 1150 transition count 69
Reduce places removed 23 places and 23 transitions.
Iterating global reduction 3 with 23 rules applied. Total rules applied 766 place count 1127 transition count 46
Ensure Unique test removed 529 places
Iterating post reduction 3 with 529 rules applied. Total rules applied 1295 place count 598 transition count 46
Reduce places removed 23 places and 23 transitions.
Iterating global reduction 4 with 23 rules applied. Total rules applied 1318 place count 575 transition count 23
Ensure Unique test removed 529 places
Iterating post reduction 4 with 529 rules applied. Total rules applied 1847 place count 46 transition count 23
Applied a total of 1847 rules in 249 ms. Remains 46 /1778 variables (removed 1732) and now considering 23/212 (removed 189) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 249 ms. Remains : 46/1778 places, 23/212 transitions.
// Phase 1: matrix 23 rows 46 cols
[2025-06-02 21:41:34] [INFO ] Computed 23 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[23] Max Struct:[23]
FORMULA QuasiCertifProtocol-PT-22-UpperBounds-02 23 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (41666 resets) in 1015 ms. (984 steps per ms)
BEST_FIRST walk for 0 steps (0 resets) in 0 ms. (0 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 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 )
[2025-06-02 21:41:35] [INFO ] Flatten gal took : 115 ms
[2025-06-02 21:41:35] [INFO ] Flatten gal took : 4 ms
[2025-06-02 21:41:35] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11195305474123432666.gal : 3 ms
[2025-06-02 21:41:35] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8692826631062328183.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality11195305474123432666.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8692826631062328183.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 108900 ms.

BK_STOP 1748900495368

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="QuasiCertifProtocol-PT-22"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2024"
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-5832"
echo " Executing tool gold2024"
echo " Input is QuasiCertifProtocol-PT-22, 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 r167-tall-174881266200102"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/QuasiCertifProtocol-PT-22.tgz
mv QuasiCertifProtocol-PT-22 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.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;