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.r549-tall-171734898300301.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 FireWire-PT-17, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r549-tall-171734898300301
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 7.8K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 7.8K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 77K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 153K Jun 2 16:33 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 FireWire-PT-17-UpperBounds-00
FORMULA_NAME FireWire-PT-17-UpperBounds-01
FORMULA_NAME FireWire-PT-17-UpperBounds-02
FORMULA_NAME FireWire-PT-17-UpperBounds-03
FORMULA_NAME FireWire-PT-17-UpperBounds-04
FORMULA_NAME FireWire-PT-17-UpperBounds-05
FORMULA_NAME FireWire-PT-17-UpperBounds-06
FORMULA_NAME FireWire-PT-17-UpperBounds-07
FORMULA_NAME FireWire-PT-17-UpperBounds-08
FORMULA_NAME FireWire-PT-17-UpperBounds-09
FORMULA_NAME FireWire-PT-17-UpperBounds-10
FORMULA_NAME FireWire-PT-17-UpperBounds-11
FORMULA_NAME FireWire-PT-17-UpperBounds-12
FORMULA_NAME FireWire-PT-17-UpperBounds-13
FORMULA_NAME FireWire-PT-17-UpperBounds-14
FORMULA_NAME FireWire-PT-17-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717371801047

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-17
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-02 23:43:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-02 23:43:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 23:43:22] [INFO ] Load time of PNML (sax parser for PT used): 96 ms
[2024-06-02 23:43:22] [INFO ] Transformed 428 places.
[2024-06-02 23:43:22] [INFO ] Transformed 656 transitions.
[2024-06-02 23:43:22] [INFO ] Found NUPN structural information;
[2024-06-02 23:43:22] [INFO ] Parsed PT model containing 428 places and 656 transitions and 1904 arcs in 202 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 9 ms.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 656 rows 428 cols
[2024-06-02 23:43:22] [INFO ] Computed 9 invariants in 31 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (2 resets) in 36 ms. (270 steps per ms)
FORMULA FireWire-PT-17-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-17-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-17-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-17-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-17-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-17-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-17-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-17-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-17-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 70000 steps (24 resets) in 116 ms. (598 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
[2024-06-02 23:43:22] [INFO ] Invariant cache hit.
[2024-06-02 23:43:23] [INFO ] [Real]Absence check using 9 positive place invariants in 23 ms returned sat
[2024-06-02 23:43:23] [INFO ] [Real]Absence check using state equation in 256 ms returned sat
[2024-06-02 23:43:23] [INFO ] Deduced a trap composed of 53 places in 273 ms of which 29 ms to minimize.
[2024-06-02 23:43:23] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 23:43:23] [INFO ] [Nat]Absence check using 9 positive place invariants in 22 ms returned sat
[2024-06-02 23:43:24] [INFO ] [Nat]Absence check using state equation in 238 ms returned sat
[2024-06-02 23:43:24] [INFO ] Deduced a trap composed of 53 places in 107 ms of which 13 ms to minimize.
[2024-06-02 23:43:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 176 ms
[2024-06-02 23:43:24] [INFO ] Computed and/alt/rep : 585/1578/585 causal constraints (skipped 70 transitions) in 87 ms.
[2024-06-02 23:43:28] [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)
[2024-06-02 23:43:28] [INFO ] [Real]Absence check using 9 positive place invariants in 9 ms returned sat
[2024-06-02 23:43:29] [INFO ] [Real]Absence check using state equation in 178 ms returned sat
[2024-06-02 23:43:29] [INFO ] Deduced a trap composed of 17 places in 144 ms of which 3 ms to minimize.
[2024-06-02 23:43:29] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 23:43:29] [INFO ] [Nat]Absence check using 9 positive place invariants in 9 ms returned sat
[2024-06-02 23:43:29] [INFO ] [Nat]Absence check using state equation in 169 ms returned sat
[2024-06-02 23:43:29] [INFO ] Deduced a trap composed of 17 places in 153 ms of which 3 ms to minimize.
[2024-06-02 23:43:29] [INFO ] Deduced a trap composed of 103 places in 142 ms of which 3 ms to minimize.
[2024-06-02 23:43:29] [INFO ] Deduced a trap composed of 79 places in 123 ms of which 3 ms to minimize.
[2024-06-02 23:43:30] [INFO ] Deduced a trap composed of 140 places in 141 ms of which 2 ms to minimize.
[2024-06-02 23:43:30] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 683 ms
[2024-06-02 23:43:30] [INFO ] Computed and/alt/rep : 585/1578/585 causal constraints (skipped 70 transitions) in 43 ms.
[2024-06-02 23:43:34] [INFO ] Added : 460 causal constraints over 92 iterations in 4068 ms. Result :unknown
[2024-06-02 23:43:34] [INFO ] [Real]Absence check using 9 positive place invariants in 8 ms returned sat
[2024-06-02 23:43:34] [INFO ] [Real]Absence check using state equation in 147 ms returned sat
[2024-06-02 23:43:34] [INFO ] Computed and/alt/rep : 585/1578/585 causal constraints (skipped 70 transitions) in 46 ms.
[2024-06-02 23:43:34] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 23:43:34] [INFO ] [Nat]Absence check using 9 positive place invariants in 8 ms returned sat
[2024-06-02 23:43:35] [INFO ] [Nat]Absence check using state equation in 151 ms returned sat
[2024-06-02 23:43:35] [INFO ] Computed and/alt/rep : 585/1578/585 causal constraints (skipped 70 transitions) in 45 ms.
[2024-06-02 23:43:39] [INFO ] Added : 486 causal constraints over 98 iterations in 4719 ms. Result :sat
Minimization took 31 ms.
[2024-06-02 23:43:39] [INFO ] [Real]Absence check using 9 positive place invariants in 8 ms returned sat
[2024-06-02 23:43:40] [INFO ] [Real]Absence check using state equation in 141 ms returned sat
[2024-06-02 23:43:40] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
[2024-06-02 23:43:40] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 23:43:40] [INFO ] [Nat]Absence check using 9 positive place invariants in 9 ms returned sat
[2024-06-02 23:43:40] [INFO ] [Nat]Absence check using state equation in 145 ms returned sat
[2024-06-02 23:43:40] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 1 ms to minimize.
[2024-06-02 23:43:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 91 ms
[2024-06-02 23:43:40] [INFO ] Computed and/alt/rep : 585/1578/585 causal constraints (skipped 70 transitions) in 34 ms.
[2024-06-02 23:43:44] [INFO ] Deduced a trap composed of 106 places in 135 ms of which 2 ms to minimize.
[2024-06-02 23:43:44] [INFO ] Deduced a trap composed of 104 places in 73 ms of which 1 ms to minimize.
[2024-06-02 23:43:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 355 ms
[2024-06-02 23:43:44] [INFO ] Added : 405 causal constraints over 81 iterations in 4056 ms. Result :sat
Minimization took 430 ms.
[2024-06-02 23:43:45] [INFO ] [Real]Absence check using 9 positive place invariants in 9 ms returned sat
[2024-06-02 23:43:45] [INFO ] [Real]Absence check using state equation in 164 ms returned sat
[2024-06-02 23:43:45] [INFO ] Computed and/alt/rep : 585/1578/585 causal constraints (skipped 70 transitions) in 48 ms.
[2024-06-02 23:43:45] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 23:43:45] [INFO ] [Nat]Absence check using 9 positive place invariants in 8 ms returned sat
[2024-06-02 23:43:45] [INFO ] [Nat]Absence check using state equation in 142 ms returned sat
[2024-06-02 23:43:45] [INFO ] Computed and/alt/rep : 585/1578/585 causal constraints (skipped 70 transitions) in 51 ms.
[2024-06-02 23:43:50] [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 4
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.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)
[2024-06-02 23:43:50] [INFO ] [Real]Absence check using 9 positive place invariants in 9 ms returned sat
[2024-06-02 23:43:50] [INFO ] [Real]Absence check using state equation in 164 ms returned sat
[2024-06-02 23:43:50] [INFO ] Computed and/alt/rep : 585/1578/585 causal constraints (skipped 70 transitions) in 39 ms.
[2024-06-02 23:43:50] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 23:43:51] [INFO ] [Nat]Absence check using 9 positive place invariants in 14 ms returned sat
[2024-06-02 23:43:51] [INFO ] [Nat]Absence check using state equation in 160 ms returned sat
[2024-06-02 23:43:51] [INFO ] Computed and/alt/rep : 585/1578/585 causal constraints (skipped 70 transitions) in 42 ms.
[2024-06-02 23:43:55] [INFO ] Deduced a trap composed of 112 places in 127 ms of which 2 ms to minimize.
[2024-06-02 23:43:55] [INFO ] Deduced a trap composed of 89 places in 112 ms of which 2 ms to minimize.
[2024-06-02 23:43:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 398 ms
[2024-06-02 23:43:55] [INFO ] Added : 401 causal constraints over 81 iterations in 4085 ms. Result :sat
Minimization took 426 ms.
[2024-06-02 23:43:55] [INFO ] [Real]Absence check using 9 positive place invariants in 8 ms returned sat
[2024-06-02 23:43:56] [INFO ] [Real]Absence check using state equation in 161 ms returned sat
[2024-06-02 23:43:56] [INFO ] Deduced a trap composed of 211 places in 160 ms of which 3 ms to minimize.
[2024-06-02 23:43:56] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 23:43:56] [INFO ] [Nat]Absence check using 9 positive place invariants in 9 ms returned sat
[2024-06-02 23:43:56] [INFO ] [Nat]Absence check using state equation in 150 ms returned sat
[2024-06-02 23:43:56] [INFO ] Deduced a trap composed of 211 places in 155 ms of which 3 ms to minimize.
[2024-06-02 23:43:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 196 ms
[2024-06-02 23:43:56] [INFO ] Computed and/alt/rep : 585/1578/585 causal constraints (skipped 70 transitions) in 39 ms.
Maximisation of solution failed !
Minimization took 1 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
Support contains 7 out of 428 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 428/428 places, 656/656 transitions.
Graph (trivial) has 349 edges and 428 vertex of which 19 / 428 are part of one of the 3 SCC in 5 ms
Free SCC test removed 16 places
Drop transitions (Empty/Sink Transition effects.) removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Graph (complete) has 1083 edges and 412 vertex of which 406 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 123 transitions
Trivial Post-agglo rules discarded 123 transitions
Performed 123 trivial Post agglomeration. Transition count delta: 123
Iterating post reduction 0 with 125 rules applied. Total rules applied 127 place count 406 transition count 511
Reduce places removed 123 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 126 rules applied. Total rules applied 253 place count 283 transition count 508
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 4 rules applied. Total rules applied 257 place count 281 transition count 506
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 259 place count 279 transition count 506
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 259 place count 279 transition count 498
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 275 place count 271 transition count 498
Discarding 42 places :
Symmetric choice reduction at 4 with 42 rule applications. Total rules 317 place count 229 transition count 455
Iterating global reduction 4 with 42 rules applied. Total rules applied 359 place count 229 transition count 455
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 361 place count 229 transition count 453
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 11 Pre rules applied. Total rules applied 361 place count 229 transition count 442
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 5 with 22 rules applied. Total rules applied 383 place count 218 transition count 442
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 393 place count 208 transition count 388
Iterating global reduction 5 with 10 rules applied. Total rules applied 403 place count 208 transition count 388
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 5 with 5 rules applied. Total rules applied 408 place count 208 transition count 383
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 410 place count 206 transition count 383
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 7 with 70 rules applied. Total rules applied 480 place count 171 transition count 348
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: -97
Deduced a syphon composed of 31 places in 1 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 7 with 62 rules applied. Total rules applied 542 place count 140 transition count 445
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 548 place count 140 transition count 439
Drop transitions (Redundant composition of simpler transitions.) removed 36 transitions
Redundant transition composition rules discarded 36 transitions
Iterating global reduction 8 with 36 rules applied. Total rules applied 584 place count 140 transition count 403
Free-agglomeration rule applied 19 times.
Iterating global reduction 8 with 19 rules applied. Total rules applied 603 place count 140 transition count 384
Reduce places removed 19 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 8 with 25 rules applied. Total rules applied 628 place count 121 transition count 378
Drop transitions (Redundant composition of simpler transitions.) removed 56 transitions
Redundant transition composition rules discarded 56 transitions
Iterating global reduction 9 with 56 rules applied. Total rules applied 684 place count 121 transition count 322
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 9 with 3 rules applied. Total rules applied 687 place count 121 transition count 322
Applied a total of 687 rules in 245 ms. Remains 121 /428 variables (removed 307) and now considering 322/656 (removed 334) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 257 ms. Remains : 121/428 places, 322/656 transitions.
[2024-06-02 23:44:02] [INFO ] Flow matrix only has 287 transitions (discarded 35 similar events)
// Phase 1: matrix 287 rows 121 cols
[2024-06-02 23:44:02] [INFO ] Computed 7 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (57515 resets) in 1351 ms. (739 steps per ms)
FORMULA FireWire-PT-17-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-17-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-17-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-17-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-17-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-17-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-17-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000000 steps (14821 resets) in 452 ms. (2207 steps per ms)
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 42491 ms.
ITS solved all properties within timeout

BK_STOP 1717371844809

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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="FireWire-PT-17"
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 FireWire-PT-17, 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 r549-tall-171734898300301"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FireWire-PT-17.tgz
mv FireWire-PT-17 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;