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.r179-tall-171640600800093.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 FlexibleBarrier-PT-14b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r179-tall-171640600800093
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 15:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:21 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.4K Apr 13 08:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 68K Apr 13 08:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Apr 13 08:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 45K Apr 13 08:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:45 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:45 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 726K May 18 16:42 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 FlexibleBarrier-PT-14b-UpperBounds-00
FORMULA_NAME FlexibleBarrier-PT-14b-UpperBounds-01
FORMULA_NAME FlexibleBarrier-PT-14b-UpperBounds-02
FORMULA_NAME FlexibleBarrier-PT-14b-UpperBounds-03
FORMULA_NAME FlexibleBarrier-PT-14b-UpperBounds-04
FORMULA_NAME FlexibleBarrier-PT-14b-UpperBounds-05
FORMULA_NAME FlexibleBarrier-PT-14b-UpperBounds-06
FORMULA_NAME FlexibleBarrier-PT-14b-UpperBounds-07
FORMULA_NAME FlexibleBarrier-PT-14b-UpperBounds-08
FORMULA_NAME FlexibleBarrier-PT-14b-UpperBounds-09
FORMULA_NAME FlexibleBarrier-PT-14b-UpperBounds-10
FORMULA_NAME FlexibleBarrier-PT-14b-UpperBounds-11
FORMULA_NAME FlexibleBarrier-PT-14b-UpperBounds-12
FORMULA_NAME FlexibleBarrier-PT-14b-UpperBounds-13
FORMULA_NAME FlexibleBarrier-PT-14b-UpperBounds-14
FORMULA_NAME FlexibleBarrier-PT-14b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716421831190

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FlexibleBarrier-PT-14b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 23:50:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-22 23:50:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 23:50:32] [INFO ] Load time of PNML (sax parser for PT used): 167 ms
[2024-05-22 23:50:32] [INFO ] Transformed 2678 places.
[2024-05-22 23:50:32] [INFO ] Transformed 3085 transitions.
[2024-05-22 23:50:32] [INFO ] Found NUPN structural information;
[2024-05-22 23:50:32] [INFO ] Parsed PT model containing 2678 places and 3085 transitions and 7733 arcs in 279 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 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 3085 rows 2678 cols
[2024-05-22 23:50:32] [INFO ] Computed 16 invariants in 107 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 (100 resets) in 64 ms. (153 steps per ms)
FORMULA FlexibleBarrier-PT-14b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-14b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-14b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-14b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-14b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-14b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-14b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 90009 steps (83 resets) in 92 ms. (967 steps per ms)
FORMULA FlexibleBarrier-PT-14b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-22 23:50:33] [INFO ] Invariant cache hit.
[2024-05-22 23:50:33] [INFO ] [Real]Absence check using 16 positive place invariants in 58 ms returned sat
[2024-05-22 23:50:34] [INFO ] [Real]Absence check using state equation in 1040 ms returned sat
[2024-05-22 23:50:35] [INFO ] Deduced a trap composed of 82 places in 444 ms of which 44 ms to minimize.
[2024-05-22 23:50:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 23:50:36] [INFO ] [Nat]Absence check using 16 positive place invariants in 57 ms returned sat
[2024-05-22 23:50:37] [INFO ] [Nat]Absence check using state equation in 974 ms returned sat
[2024-05-22 23:50:37] [INFO ] Deduced a trap composed of 82 places in 268 ms of which 6 ms to minimize.
[2024-05-22 23:50:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 501 ms
[2024-05-22 23:50:37] [INFO ] Computed and/alt/rep : 2839/4489/2839 causal constraints (skipped 245 transitions) in 224 ms.
Maximisation of solution failed !
Minimization took 3 ms.
[2024-05-22 23:50:41] [INFO ] [Real]Absence check using 16 positive place invariants in 67 ms returned sat
[2024-05-22 23:50:42] [INFO ] [Real]Absence check using state equation in 939 ms returned sat
[2024-05-22 23:50:42] [INFO ] Deduced a trap composed of 268 places in 177 ms of which 8 ms to minimize.
[2024-05-22 23:50:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 23:50:42] [INFO ] [Nat]Absence check using 16 positive place invariants in 55 ms returned sat
[2024-05-22 23:50:43] [INFO ] [Nat]Absence check using state equation in 934 ms returned sat
[2024-05-22 23:50:44] [INFO ] Deduced a trap composed of 268 places in 207 ms of which 3 ms to minimize.
[2024-05-22 23:50:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 379 ms
[2024-05-22 23:50:44] [INFO ] Computed and/alt/rep : 2839/4489/2839 causal constraints (skipped 245 transitions) in 179 ms.
Maximisation of solution failed !
Minimization took 0 ms.
[2024-05-22 23:50:48] [INFO ] [Real]Absence check using 16 positive place invariants in 56 ms returned sat
[2024-05-22 23:50:49] [INFO ] [Real]Absence check using state equation in 993 ms returned sat
[2024-05-22 23:50:49] [INFO ] Deduced a trap composed of 26 places in 228 ms of which 5 ms to minimize.
[2024-05-22 23:50:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 23:50:49] [INFO ] [Nat]Absence check using 16 positive place invariants in 55 ms returned sat
[2024-05-22 23:50:50] [INFO ] [Nat]Absence check using state equation in 1023 ms returned sat
[2024-05-22 23:50:51] [INFO ] Deduced a trap composed of 26 places in 216 ms of which 5 ms to minimize.
[2024-05-22 23:50:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 400 ms
[2024-05-22 23:50:51] [INFO ] Computed and/alt/rep : 2839/4489/2839 causal constraints (skipped 245 transitions) in 151 ms.
[2024-05-22 23:50:54] [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 2
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-05-22 23:50:55] [INFO ] [Real]Absence check using 16 positive place invariants in 55 ms returned sat
[2024-05-22 23:50:56] [INFO ] [Real]Absence check using state equation in 974 ms returned sat
[2024-05-22 23:50:57] [INFO ] Deduced a trap composed of 933 places in 1250 ms of which 13 ms to minimize.
[2024-05-22 23:50:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 23:50:58] [INFO ] [Nat]Absence check using 16 positive place invariants in 55 ms returned sat
[2024-05-22 23:50:58] [INFO ] [Nat]Absence check using state equation in 935 ms returned sat
[2024-05-22 23:51:00] [INFO ] Deduced a trap composed of 933 places in 1159 ms of which 13 ms to minimize.
[2024-05-22 23:51:01] [INFO ] Deduced a trap composed of 255 places in 1143 ms of which 12 ms to minimize.
[2024-05-22 23:51:02] [INFO ] Deduced a trap composed of 269 places in 1159 ms of which 13 ms to minimize.
[2024-05-22 23:51:02] [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.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-22 23:51:03] [INFO ] [Real]Absence check using 16 positive place invariants in 55 ms returned sat
[2024-05-22 23:51:04] [INFO ] [Real]Absence check using state equation in 952 ms returned sat
[2024-05-22 23:51:04] [INFO ] Deduced a trap composed of 268 places in 273 ms of which 5 ms to minimize.
[2024-05-22 23:51:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 23:51:05] [INFO ] [Nat]Absence check using 16 positive place invariants in 55 ms returned sat
[2024-05-22 23:51:05] [INFO ] [Nat]Absence check using state equation in 949 ms returned sat
[2024-05-22 23:51:06] [INFO ] Deduced a trap composed of 268 places in 248 ms of which 5 ms to minimize.
[2024-05-22 23:51:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 431 ms
[2024-05-22 23:51:06] [INFO ] Computed and/alt/rep : 2839/4489/2839 causal constraints (skipped 245 transitions) in 154 ms.
Maximisation of solution failed !
Minimization took 0 ms.
[2024-05-22 23:51:10] [INFO ] [Real]Absence check using 16 positive place invariants in 54 ms returned sat
[2024-05-22 23:51:11] [INFO ] [Real]Absence check using state equation in 945 ms returned sat
[2024-05-22 23:51:11] [INFO ] Deduced a trap composed of 82 places in 260 ms of which 5 ms to minimize.
[2024-05-22 23:51:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 23:51:11] [INFO ] [Nat]Absence check using 16 positive place invariants in 55 ms returned sat
[2024-05-22 23:51:12] [INFO ] [Nat]Absence check using state equation in 950 ms returned sat
[2024-05-22 23:51:13] [INFO ] Deduced a trap composed of 82 places in 263 ms of which 5 ms to minimize.
[2024-05-22 23:51:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 459 ms
[2024-05-22 23:51:13] [INFO ] Computed and/alt/rep : 2839/4489/2839 causal constraints (skipped 245 transitions) in 141 ms.
Maximisation of solution failed !
Minimization took 0 ms.
[2024-05-22 23:51:16] [INFO ] [Real]Absence check using 16 positive place invariants in 52 ms returned sat
[2024-05-22 23:51:18] [INFO ] [Real]Absence check using state equation in 1075 ms returned sat
[2024-05-22 23:51:18] [INFO ] Computed and/alt/rep : 2839/4489/2839 causal constraints (skipped 245 transitions) in 155 ms.
[2024-05-22 23:51:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 23:51:19] [INFO ] [Nat]Absence check using 16 positive place invariants in 55 ms returned sat
[2024-05-22 23:51:20] [INFO ] [Nat]Absence check using state equation in 1063 ms returned sat
[2024-05-22 23:51:20] [INFO ] Computed and/alt/rep : 2839/4489/2839 causal constraints (skipped 245 transitions) in 142 ms.
Maximisation of solution failed !
Minimization took 0 ms.
[2024-05-22 23:51:24] [INFO ] [Real]Absence check using 16 positive place invariants in 55 ms returned sat
[2024-05-22 23:51:25] [INFO ] [Real]Absence check using state equation in 936 ms returned sat
[2024-05-22 23:51:25] [INFO ] Deduced a trap composed of 94 places in 155 ms of which 3 ms to minimize.
[2024-05-22 23:51:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 23:51:26] [INFO ] [Nat]Absence check using 16 positive place invariants in 54 ms returned sat
[2024-05-22 23:51:26] [INFO ] [Nat]Absence check using state equation in 939 ms returned sat
[2024-05-22 23:51:27] [INFO ] Deduced a trap composed of 94 places in 171 ms of which 3 ms to minimize.
[2024-05-22 23:51:27] [INFO ] Deduced a trap composed of 146 places in 161 ms of which 3 ms to minimize.
[2024-05-22 23:51:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 598 ms
[2024-05-22 23:51:27] [INFO ] Computed and/alt/rep : 2839/4489/2839 causal constraints (skipped 245 transitions) in 150 ms.
Maximisation of solution failed !
Minimization took 0 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 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, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1]
Support contains 8 out of 2678 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2678/2678 places, 3085/3085 transitions.
Graph (trivial) has 2620 edges and 2678 vertex of which 86 / 2678 are part of one of the 14 SCC in 13 ms
Free SCC test removed 72 places
Drop transitions (Empty/Sink Transition effects.) removed 87 transitions
Reduce isomorphic transitions removed 87 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 662 transitions
Trivial Post-agglo rules discarded 662 transitions
Performed 662 trivial Post agglomeration. Transition count delta: 662
Iterating post reduction 0 with 662 rules applied. Total rules applied 663 place count 2606 transition count 2336
Reduce places removed 662 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 665 rules applied. Total rules applied 1328 place count 1944 transition count 2333
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 1331 place count 1941 transition count 2333
Performed 176 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 176 Pre rules applied. Total rules applied 1331 place count 1941 transition count 2157
Deduced a syphon composed of 176 places in 2 ms
Reduce places removed 176 places and 0 transitions.
Iterating global reduction 3 with 352 rules applied. Total rules applied 1683 place count 1765 transition count 2157
Discarding 1042 places :
Symmetric choice reduction at 3 with 1042 rule applications. Total rules 2725 place count 723 transition count 1115
Iterating global reduction 3 with 1042 rules applied. Total rules applied 3767 place count 723 transition count 1115
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 3767 place count 723 transition count 1101
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 3795 place count 709 transition count 1101
Discarding 167 places :
Symmetric choice reduction at 3 with 167 rule applications. Total rules 3962 place count 542 transition count 934
Iterating global reduction 3 with 167 rules applied. Total rules applied 4129 place count 542 transition count 934
Ensure Unique test removed 164 transitions
Reduce isomorphic transitions removed 164 transitions.
Iterating post reduction 3 with 164 rules applied. Total rules applied 4293 place count 542 transition count 770
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 0 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 4 with 144 rules applied. Total rules applied 4437 place count 470 transition count 698
Drop transitions (Empty/Sink Transition effects.) removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 4 with 28 rules applied. Total rules applied 4465 place count 470 transition count 670
Discarding 14 places :
Symmetric choice reduction at 5 with 14 rule applications. Total rules 4479 place count 456 transition count 656
Iterating global reduction 5 with 14 rules applied. Total rules applied 4493 place count 456 transition count 656
Free-agglomeration rule applied 371 times.
Iterating global reduction 5 with 371 rules applied. Total rules applied 4864 place count 456 transition count 285
Reduce places removed 371 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 167 transitions
Reduce isomorphic transitions removed 167 transitions.
Graph (complete) has 230 edges and 85 vertex of which 65 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.1 ms
Discarding 20 places :
Also discarding 0 output transitions
Iterating post reduction 5 with 539 rules applied. Total rules applied 5403 place count 65 transition count 118
Drop transitions (Empty/Sink Transition effects.) removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 6 with 28 rules applied. Total rules applied 5431 place count 65 transition count 90
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 5432 place count 65 transition count 90
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 5433 place count 64 transition count 89
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 50 edges and 63 vertex of which 20 / 63 are part of one of the 10 SCC in 1 ms
Free SCC test removed 10 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 7 with 3 rules applied. Total rules applied 5436 place count 53 transition count 88
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 8 with 21 rules applied. Total rules applied 5457 place count 52 transition count 68
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 9 Pre rules applied. Total rules applied 5457 place count 52 transition count 59
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 9 with 18 rules applied. Total rules applied 5475 place count 43 transition count 59
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 9 with 9 rules applied. Total rules applied 5484 place count 43 transition count 50
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 10 with 18 rules applied. Total rules applied 5502 place count 34 transition count 41
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 5504 place count 33 transition count 40
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 5505 place count 33 transition count 39
Free-agglomeration rule applied 9 times.
Iterating global reduction 10 with 9 rules applied. Total rules applied 5514 place count 33 transition count 30
Reduce places removed 14 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 10 with 23 rules applied. Total rules applied 5537 place count 19 transition count 21
Free-agglomeration rule applied 1 times.
Iterating global reduction 11 with 1 rules applied. Total rules applied 5538 place count 19 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 5539 place count 18 transition count 20
Applied a total of 5539 rules in 579 ms. Remains 18 /2678 variables (removed 2660) and now considering 20/3085 (removed 3065) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 590 ms. Remains : 18/2678 places, 20/3085 transitions.
// Phase 1: matrix 20 rows 18 cols
[2024-05-22 23:51:31] [INFO ] Computed 6 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (2 resets) in 805 ms. (1240 steps per ms)
FORMULA FlexibleBarrier-PT-14b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-14b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-14b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-14b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-14b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-14b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-14b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-14b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (2 resets) in 242 ms. (4115 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 )
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 60034 ms.
ITS solved all properties within timeout

BK_STOP 1716421892406

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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="FlexibleBarrier-PT-14b"
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 FlexibleBarrier-PT-14b, 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 r179-tall-171640600800093"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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