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.r097-smll-174860111800056.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 FlexibleBarrier-PT-08b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r097-smll-174860111800056
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 664K
-rw-r--r-- 1 mcc users 5.7K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 56K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K 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 3.6K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 111K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 241K 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 FlexibleBarrier-PT-08b-UpperBounds-00
FORMULA_NAME FlexibleBarrier-PT-08b-UpperBounds-01
FORMULA_NAME FlexibleBarrier-PT-08b-UpperBounds-02
FORMULA_NAME FlexibleBarrier-PT-08b-UpperBounds-03
FORMULA_NAME FlexibleBarrier-PT-08b-UpperBounds-04
FORMULA_NAME FlexibleBarrier-PT-08b-UpperBounds-05
FORMULA_NAME FlexibleBarrier-PT-08b-UpperBounds-06
FORMULA_NAME FlexibleBarrier-PT-08b-UpperBounds-07
FORMULA_NAME FlexibleBarrier-PT-08b-UpperBounds-08
FORMULA_NAME FlexibleBarrier-PT-08b-UpperBounds-09
FORMULA_NAME FlexibleBarrier-PT-08b-UpperBounds-10
FORMULA_NAME FlexibleBarrier-PT-08b-UpperBounds-11
FORMULA_NAME FlexibleBarrier-PT-08b-UpperBounds-12
FORMULA_NAME FlexibleBarrier-PT-08b-UpperBounds-13
FORMULA_NAME FlexibleBarrier-PT-08b-UpperBounds-14
FORMULA_NAME FlexibleBarrier-PT-08b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748678983205

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FlexibleBarrier-PT-08b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-05-31 08:09:45] [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-05-31 08:09:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-31 08:09:45] [INFO ] Load time of PNML (sax parser for PT used): 255 ms
[2025-05-31 08:09:45] [INFO ] Transformed 920 places.
[2025-05-31 08:09:45] [INFO ] Transformed 1057 transitions.
[2025-05-31 08:09:45] [INFO ] Found NUPN structural information;
[2025-05-31 08:09:45] [INFO ] Parsed PT model containing 920 places and 1057 transitions and 2627 arcs in 515 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 18 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 1057 rows 920 cols
[2025-05-31 08:09:46] [INFO ] Computed 10 invariants in 78 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 (154 resets) in 127 ms. (78 steps per ms)
FORMULA FlexibleBarrier-PT-08b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-08b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-08b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-08b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-08b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-08b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-08b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-08b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-08b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 70007 steps (139 resets) in 165 ms. (421 steps per ms)
FORMULA FlexibleBarrier-PT-08b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
[2025-05-31 08:09:46] [INFO ] Invariant cache hit.
[2025-05-31 08:09:48] [INFO ] [Real]Absence check using 10 positive place invariants in 38 ms returned sat
[2025-05-31 08:09:48] [INFO ] [Real]Absence check using state equation in 826 ms returned sat
[2025-05-31 08:09:49] [INFO ] Deduced a trap composed of 54 places in 379 ms of which 47 ms to minimize.
[2025-05-31 08:09:49] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 08:09:50] [INFO ] [Nat]Absence check using 10 positive place invariants in 31 ms returned sat
[2025-05-31 08:09:50] [INFO ] [Nat]Absence check using state equation in 598 ms returned sat
[2025-05-31 08:09:50] [INFO ] Deduced a trap composed of 54 places in 151 ms of which 3 ms to minimize.
[2025-05-31 08:09:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 295 ms
[2025-05-31 08:09:51] [INFO ] Computed and/alt/rep : 968/1629/968 causal constraints (skipped 88 transitions) in 161 ms.
Maximisation of solution failed !
Minimization took 1 ms.
[2025-05-31 08:09:55] [INFO ] [Real]Absence check using 10 positive place invariants in 24 ms returned sat
[2025-05-31 08:09:55] [INFO ] [Real]Absence check using state equation in 566 ms returned sat
[2025-05-31 08:09:56] [INFO ] Deduced a trap composed of 85 places in 774 ms of which 8 ms to minimize.
[2025-05-31 08:09:56] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 08:09:56] [INFO ] [Nat]Absence check using 10 positive place invariants in 26 ms returned sat
[2025-05-31 08:09:57] [INFO ] [Nat]Absence check using state equation in 613 ms returned sat
[2025-05-31 08:09:58] [INFO ] Deduced a trap composed of 85 places in 782 ms of which 12 ms to minimize.
[2025-05-31 08:09:59] [INFO ] Deduced a trap composed of 347 places in 679 ms of which 8 ms to minimize.
[2025-05-31 08:09:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1629 ms
[2025-05-31 08:09:59] [INFO ] Computed and/alt/rep : 968/1629/968 causal constraints (skipped 88 transitions) in 131 ms.
Maximisation of solution failed !
Minimization took 0 ms.
[2025-05-31 08:10:01] [INFO ] [Real]Absence check using 10 positive place invariants in 38 ms returned sat
[2025-05-31 08:10:02] [INFO ] [Real]Absence check using state equation in 636 ms returned sat
[2025-05-31 08:10:03] [INFO ] Deduced a trap composed of 277 places in 544 ms of which 13 ms to minimize.
[2025-05-31 08:10:03] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 08:10:03] [INFO ] [Nat]Absence check using 10 positive place invariants in 40 ms returned sat
[2025-05-31 08:10:04] [INFO ] [Nat]Absence check using state equation in 704 ms returned sat
[2025-05-31 08:10:04] [INFO ] Deduced a trap composed of 277 places in 429 ms of which 7 ms to minimize.
[2025-05-31 08:10:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 515 ms
[2025-05-31 08:10:05] [INFO ] Computed and/alt/rep : 968/1629/968 causal constraints (skipped 88 transitions) in 88 ms.
[2025-05-31 08:10:08] [INFO ] Added : 265 causal constraints over 53 iterations in 3407 ms. Result :unknown
[2025-05-31 08:10:08] [INFO ] [Real]Absence check using 10 positive place invariants in 24 ms returned sat
[2025-05-31 08:10:09] [INFO ] [Real]Absence check using state equation in 461 ms returned sat
[2025-05-31 08:10:09] [INFO ] Computed and/alt/rep : 968/1629/968 causal constraints (skipped 88 transitions) in 86 ms.
[2025-05-31 08:10:09] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 08:10:09] [INFO ] [Nat]Absence check using 10 positive place invariants in 25 ms returned sat
[2025-05-31 08:10:10] [INFO ] [Nat]Absence check using state equation in 456 ms returned sat
[2025-05-31 08:10:10] [INFO ] Computed and/alt/rep : 968/1629/968 causal constraints (skipped 88 transitions) in 75 ms.
[2025-05-31 08:10:14] [INFO ] Deduced a trap composed of 52 places in 366 ms of which 6 ms to minimize.
[2025-05-31 08:10:14] [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 3
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.refineWithCausalOrder(DeadlockTester.java:1128)
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-05-31 08:10:14] [INFO ] [Real]Absence check using 10 positive place invariants in 24 ms returned sat
[2025-05-31 08:10:15] [INFO ] [Real]Absence check using state equation in 490 ms returned sat
[2025-05-31 08:10:15] [INFO ] Deduced a trap composed of 288 places in 461 ms of which 7 ms to minimize.
[2025-05-31 08:10:16] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 08:10:16] [INFO ] [Nat]Absence check using 10 positive place invariants in 25 ms returned sat
[2025-05-31 08:10:16] [INFO ] [Nat]Absence check using state equation in 498 ms returned sat
[2025-05-31 08:10:17] [INFO ] Deduced a trap composed of 288 places in 458 ms of which 9 ms to minimize.
[2025-05-31 08:10:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 544 ms
[2025-05-31 08:10:17] [INFO ] Computed and/alt/rep : 968/1629/968 causal constraints (skipped 88 transitions) in 88 ms.
[2025-05-31 08:10:21] [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)
[2025-05-31 08:10:21] [INFO ] [Real]Absence check using 10 positive place invariants in 25 ms returned sat
[2025-05-31 08:10:21] [INFO ] [Real]Absence check using state equation in 578 ms returned sat
[2025-05-31 08:10:22] [INFO ] Deduced a trap composed of 81 places in 413 ms of which 7 ms to minimize.
[2025-05-31 08:10:22] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 08:10:22] [INFO ] [Nat]Absence check using 10 positive place invariants in 28 ms returned sat
[2025-05-31 08:10:23] [INFO ] [Nat]Absence check using state equation in 524 ms returned sat
[2025-05-31 08:10:23] [INFO ] Deduced a trap composed of 81 places in 290 ms of which 4 ms to minimize.
[2025-05-31 08:10:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 378 ms
[2025-05-31 08:10:23] [INFO ] Computed and/alt/rep : 968/1629/968 causal constraints (skipped 88 transitions) in 78 ms.
[2025-05-31 08:10:27] [INFO ] Added : 285 causal constraints over 57 iterations in 3776 ms. Result :unknown
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
FORMULA FlexibleBarrier-PT-08b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 1, 0, 0] Max Struct:[1, 1, 1, 1, 1]
Support contains 5 out of 920 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 920/920 places, 1057/1057 transitions.
Graph (trivial) has 888 edges and 920 vertex of which 50 / 920 are part of one of the 8 SCC in 10 ms
Free SCC test removed 42 places
Drop transitions (Empty/Sink Transition effects.) removed 51 transitions
Reduce isomorphic transitions removed 51 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 240 transitions
Trivial Post-agglo rules discarded 240 transitions
Performed 240 trivial Post agglomeration. Transition count delta: 240
Iterating post reduction 0 with 240 rules applied. Total rules applied 241 place count 878 transition count 766
Reduce places removed 240 places and 0 transitions.
Iterating post reduction 1 with 240 rules applied. Total rules applied 481 place count 638 transition count 766
Performed 55 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 55 Pre rules applied. Total rules applied 481 place count 638 transition count 711
Deduced a syphon composed of 55 places in 2 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 2 with 110 rules applied. Total rules applied 591 place count 583 transition count 711
Discarding 314 places :
Symmetric choice reduction at 2 with 314 rule applications. Total rules 905 place count 269 transition count 397
Iterating global reduction 2 with 314 rules applied. Total rules applied 1219 place count 269 transition count 397
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 1219 place count 269 transition count 389
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 1235 place count 261 transition count 389
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 1241 place count 261 transition count 383
Discarding 46 places :
Symmetric choice reduction at 3 with 46 rule applications. Total rules 1287 place count 215 transition count 337
Iterating global reduction 3 with 46 rules applied. Total rules applied 1333 place count 215 transition count 337
Ensure Unique test removed 46 transitions
Reduce isomorphic transitions removed 46 transitions.
Iterating post reduction 3 with 46 rules applied. Total rules applied 1379 place count 215 transition count 291
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 1 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 4 with 82 rules applied. Total rules applied 1461 place count 174 transition count 250
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 1470 place count 174 transition count 241
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 1476 place count 168 transition count 235
Iterating global reduction 5 with 6 rules applied. Total rules applied 1482 place count 168 transition count 235
Free-agglomeration rule applied 117 times.
Iterating global reduction 5 with 117 rules applied. Total rules applied 1599 place count 168 transition count 118
Reduce places removed 117 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 49 transitions
Reduce isomorphic transitions removed 49 transitions.
Graph (complete) has 136 edges and 51 vertex of which 41 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.1 ms
Discarding 10 places :
Also discarding 0 output transitions
Iterating post reduction 5 with 167 rules applied. Total rules applied 1766 place count 41 transition count 69
Drop transitions (Empty/Sink Transition effects.) removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 6 with 14 rules applied. Total rules applied 1780 place count 41 transition count 55
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 1781 place count 41 transition count 55
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1782 place count 41 transition count 54
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1783 place count 40 transition count 53
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t2.t3.t4.t913.t586.t587 and 1 places that fell out of Prefix Of Interest.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 29 edges and 38 vertex of which 8 / 38 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
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 8 with 5 rules applied. Total rules applied 1788 place count 34 transition count 49
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 9 with 10 rules applied. Total rules applied 1798 place count 32 transition count 41
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 7 Pre rules applied. Total rules applied 1798 place count 32 transition count 34
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 10 with 14 rules applied. Total rules applied 1812 place count 25 transition count 34
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 10 with 6 rules applied. Total rules applied 1818 place count 25 transition count 28
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 1 Pre rules applied. Total rules applied 1818 place count 25 transition count 27
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 1820 place count 24 transition count 27
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 11 with 10 rules applied. Total rules applied 1830 place count 19 transition count 22
Free-agglomeration rule applied 6 times.
Iterating global reduction 11 with 6 rules applied. Total rules applied 1836 place count 19 transition count 16
Reduce places removed 8 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 11 with 13 rules applied. Total rules applied 1849 place count 11 transition count 11
Applied a total of 1849 rules in 288 ms. Remains 11 /920 variables (removed 909) and now considering 11/1057 (removed 1046) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 303 ms. Remains : 11/920 places, 11/1057 transitions.
// Phase 1: matrix 11 rows 11 cols
[2025-05-31 08:10:28] [INFO ] Computed 5 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 1, 0, 0] Max Struct:[1, 1, 1, 1, 1]
FORMULA FlexibleBarrier-PT-08b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (2 resets) in 815 ms. (1225 steps per ms)
FORMULA FlexibleBarrier-PT-08b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-08b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-08b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-08b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (2 resets) in 236 ms. (4219 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-05-31 08:10:29] [INFO ] Flatten gal took : 36 ms
[2025-05-31 08:10:29] [INFO ] Flatten gal took : 6 ms
[2025-05-31 08:10:29] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10945369564521235572.gal : 8 ms
[2025-05-31 08:10:29] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6131554733642246147.prop : 1 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/ReachabilityCardinality10945369564521235572.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6131554733642246147.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
Loading property file /tmp/ReachabilityCardinality6131554733642246147.prop.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 3 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,2,0.013492,3428,2,13,5,39,6,0,58,15,0
Total reachable state count : 2

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 44434 ms.

BK_STOP 1748679029896

--------------------
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="FlexibleBarrier-PT-08b"
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 FlexibleBarrier-PT-08b, 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 r097-smll-174860111800056"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FlexibleBarrier-PT-08b.tgz
mv FlexibleBarrier-PT-08b 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 ;