Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r170-tall-167838857300485.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
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 r170-tall-167838857300485
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 668K
-rw-r--r-- 1 mcc users 6.5K Feb 25 12:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Feb 25 12:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 25 12:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Feb 25 12:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 16:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 12:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 127K Feb 25 12:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Feb 25 12:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 25 12:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 241K Mar 5 18:22 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-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 1678555178000

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FlexibleBarrier-PT-08b
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-11 17:19:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-11 17:19:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 17:19:39] [INFO ] Load time of PNML (sax parser for PT used): 76 ms
[2023-03-11 17:19:39] [INFO ] Transformed 920 places.
[2023-03-11 17:19:39] [INFO ] Transformed 1057 transitions.
[2023-03-11 17:19:39] [INFO ] Found NUPN structural information;
[2023-03-11 17:19:39] [INFO ] Parsed PT model containing 920 places and 1057 transitions and 2627 arcs in 139 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 4 ms.
// Phase 1: matrix 1057 rows 920 cols
[2023-03-11 17:19:39] [INFO ] Computed 10 place invariants in 37 ms
Incomplete random walk after 10000 steps, including 157 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 16) seen :9
FORMULA FlexibleBarrier-PT-08b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-08b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-08b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-08b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-08b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-08b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-08b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-08b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-08b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 7) seen :0
[2023-03-11 17:19:39] [INFO ] Invariant cache hit.
[2023-03-11 17:19:40] [INFO ] [Real]Absence check using 10 positive place invariants in 18 ms returned sat
[2023-03-11 17:19:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 17:19:40] [INFO ] [Real]Absence check using state equation in 295 ms returned sat
[2023-03-11 17:19:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 17:19:40] [INFO ] [Nat]Absence check using 10 positive place invariants in 15 ms returned sat
[2023-03-11 17:19:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 17:19:41] [INFO ] [Nat]Absence check using state equation in 272 ms returned sat
[2023-03-11 17:19:41] [INFO ] Deduced a trap composed of 298 places in 216 ms of which 4 ms to minimize.
[2023-03-11 17:19:41] [INFO ] Deduced a trap composed of 283 places in 180 ms of which 1 ms to minimize.
[2023-03-11 17:19:41] [INFO ] Deduced a trap composed of 83 places in 203 ms of which 1 ms to minimize.
[2023-03-11 17:19:41] [INFO ] Deduced a trap composed of 84 places in 190 ms of which 1 ms to minimize.
[2023-03-11 17:19:42] [INFO ] Deduced a trap composed of 117 places in 228 ms of which 1 ms to minimize.
[2023-03-11 17:19:42] [INFO ] Deduced a trap composed of 82 places in 198 ms of which 1 ms to minimize.
[2023-03-11 17:19:42] [INFO ] Deduced a trap composed of 85 places in 68 ms of which 0 ms to minimize.
[2023-03-11 17:19:42] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1579 ms
[2023-03-11 17:19:42] [INFO ] Computed and/alt/rep : 968/1629/968 causal constraints (skipped 88 transitions) in 58 ms.
[2023-03-11 17:19:45] [INFO ] Added : 295 causal constraints over 59 iterations in 3009 ms. Result :unknown
[2023-03-11 17:19:45] [INFO ] [Real]Absence check using 10 positive place invariants in 13 ms returned sat
[2023-03-11 17:19:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 17:19:46] [INFO ] [Real]Absence check using state equation in 270 ms returned sat
[2023-03-11 17:19:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 17:19:46] [INFO ] [Nat]Absence check using 10 positive place invariants in 15 ms returned sat
[2023-03-11 17:19:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 17:19:46] [INFO ] [Nat]Absence check using state equation in 270 ms returned sat
[2023-03-11 17:19:46] [INFO ] Deduced a trap composed of 358 places in 197 ms of which 1 ms to minimize.
[2023-03-11 17:19:46] [INFO ] Deduced a trap composed of 290 places in 182 ms of which 0 ms to minimize.
[2023-03-11 17:19:47] [INFO ] Deduced a trap composed of 317 places in 182 ms of which 0 ms to minimize.
[2023-03-11 17:19:47] [INFO ] Deduced a trap composed of 319 places in 167 ms of which 1 ms to minimize.
[2023-03-11 17:19:47] [INFO ] Deduced a trap composed of 289 places in 147 ms of which 0 ms to minimize.
[2023-03-11 17:19:47] [INFO ] Deduced a trap composed of 312 places in 185 ms of which 0 ms to minimize.
[2023-03-11 17:19:47] [INFO ] Deduced a trap composed of 284 places in 182 ms of which 1 ms to minimize.
[2023-03-11 17:19:48] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1512 ms
[2023-03-11 17:19:48] [INFO ] Computed and/alt/rep : 968/1629/968 causal constraints (skipped 88 transitions) in 57 ms.
[2023-03-11 17:19:51] [INFO ] Deduced a trap composed of 92 places in 263 ms of which 1 ms to minimize.
[2023-03-11 17:19:51] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
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:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-11 17:19:51] [INFO ] [Real]Absence check using 10 positive place invariants in 14 ms returned sat
[2023-03-11 17:19:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 17:19:51] [INFO ] [Real]Absence check using state equation in 274 ms returned sat
[2023-03-11 17:19:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 17:19:51] [INFO ] [Nat]Absence check using 10 positive place invariants in 15 ms returned sat
[2023-03-11 17:19:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 17:19:52] [INFO ] [Nat]Absence check using state equation in 263 ms returned sat
[2023-03-11 17:19:52] [INFO ] Deduced a trap composed of 359 places in 183 ms of which 0 ms to minimize.
[2023-03-11 17:19:52] [INFO ] Deduced a trap composed of 341 places in 162 ms of which 0 ms to minimize.
[2023-03-11 17:19:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 451 ms
[2023-03-11 17:19:52] [INFO ] Computed and/alt/rep : 968/1629/968 causal constraints (skipped 88 transitions) in 53 ms.
[2023-03-11 17:19:56] [INFO ] Added : 337 causal constraints over 68 iterations in 3497 ms. Result :sat
Minimization took 191 ms.
[2023-03-11 17:19:56] [INFO ] [Real]Absence check using 10 positive place invariants in 14 ms returned sat
[2023-03-11 17:19:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 17:19:56] [INFO ] [Real]Absence check using state equation in 264 ms returned sat
[2023-03-11 17:19:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 17:19:56] [INFO ] [Nat]Absence check using 10 positive place invariants in 17 ms returned sat
[2023-03-11 17:19:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 17:19:57] [INFO ] [Nat]Absence check using state equation in 251 ms returned sat
[2023-03-11 17:19:57] [INFO ] Deduced a trap composed of 85 places in 66 ms of which 0 ms to minimize.
[2023-03-11 17:19:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 133 ms
[2023-03-11 17:19:57] [INFO ] Computed and/alt/rep : 968/1629/968 causal constraints (skipped 88 transitions) in 51 ms.
[2023-03-11 17:20:00] [INFO ] Deduced a trap composed of 310 places in 259 ms of which 1 ms to minimize.
[2023-03-11 17:20:01] [INFO ] Deduced a trap composed of 307 places in 254 ms of which 1 ms to minimize.
[2023-03-11 17:20:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 659 ms
[2023-03-11 17:20:01] [INFO ] Added : 326 causal constraints over 67 iterations in 4218 ms. Result :sat
Minimization took 182 ms.
[2023-03-11 17:20:01] [INFO ] [Real]Absence check using 10 positive place invariants in 14 ms returned sat
[2023-03-11 17:20:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 17:20:02] [INFO ] [Real]Absence check using state equation in 284 ms returned sat
[2023-03-11 17:20:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 17:20:02] [INFO ] [Nat]Absence check using 10 positive place invariants in 15 ms returned sat
[2023-03-11 17:20:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 17:20:02] [INFO ] [Nat]Absence check using state equation in 269 ms returned sat
[2023-03-11 17:20:02] [INFO ] Computed and/alt/rep : 968/1629/968 causal constraints (skipped 88 transitions) in 44 ms.
[2023-03-11 17:20:06] [INFO ] Deduced a trap composed of 310 places in 184 ms of which 1 ms to minimize.
[2023-03-11 17:20:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 269 ms
[2023-03-11 17:20:06] [INFO ] Added : 324 causal constraints over 65 iterations in 3651 ms. Result :sat
Minimization took 178 ms.
[2023-03-11 17:20:06] [INFO ] [Real]Absence check using 10 positive place invariants in 18 ms returned sat
[2023-03-11 17:20:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 17:20:06] [INFO ] [Real]Absence check using state equation in 267 ms returned sat
[2023-03-11 17:20:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 17:20:07] [INFO ] [Nat]Absence check using 10 positive place invariants in 15 ms returned sat
[2023-03-11 17:20:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 17:20:07] [INFO ] [Nat]Absence check using state equation in 269 ms returned sat
[2023-03-11 17:20:07] [INFO ] Deduced a trap composed of 313 places in 204 ms of which 1 ms to minimize.
[2023-03-11 17:20:07] [INFO ] Deduced a trap composed of 319 places in 182 ms of which 0 ms to minimize.
[2023-03-11 17:20:08] [INFO ] Deduced a trap composed of 282 places in 167 ms of which 1 ms to minimize.
[2023-03-11 17:20:08] [INFO ] Deduced a trap composed of 312 places in 173 ms of which 1 ms to minimize.
[2023-03-11 17:20:08] [INFO ] Deduced a trap composed of 20 places in 169 ms of which 0 ms to minimize.
[2023-03-11 17:20:08] [INFO ] Deduced a trap composed of 307 places in 184 ms of which 1 ms to minimize.
[2023-03-11 17:20:08] [INFO ] Deduced a trap composed of 284 places in 157 ms of which 1 ms to minimize.
[2023-03-11 17:20:09] [INFO ] Deduced a trap composed of 311 places in 206 ms of which 1 ms to minimize.
[2023-03-11 17:20:09] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1783 ms
[2023-03-11 17:20:09] [INFO ] Computed and/alt/rep : 968/1629/968 causal constraints (skipped 88 transitions) in 47 ms.
[2023-03-11 17:20:12] [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 5
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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
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:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-11 17:20:12] [INFO ] [Real]Absence check using 10 positive place invariants in 13 ms returned sat
[2023-03-11 17:20:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 17:20:12] [INFO ] [Real]Absence check using state equation in 281 ms returned sat
[2023-03-11 17:20:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 17:20:12] [INFO ] [Nat]Absence check using 10 positive place invariants in 14 ms returned sat
[2023-03-11 17:20:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 17:20:12] [INFO ] [Nat]Absence check using state equation in 270 ms returned sat
[2023-03-11 17:20:13] [INFO ] Deduced a trap composed of 150 places in 187 ms of which 0 ms to minimize.
[2023-03-11 17:20:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 259 ms
[2023-03-11 17:20:13] [INFO ] Computed and/alt/rep : 968/1629/968 causal constraints (skipped 88 transitions) in 48 ms.
[2023-03-11 17:20:16] [INFO ] Added : 320 causal constraints over 64 iterations in 3204 ms. Result :sat
Minimization took 194 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0]
FORMULA FlexibleBarrier-PT-08b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FlexibleBarrier-PT-08b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FlexibleBarrier-PT-08b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FlexibleBarrier-PT-08b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 3 out of 920 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 920/920 places, 1057/1057 transitions.
Graph (trivial) has 889 edges and 920 vertex of which 50 / 920 are part of one of the 8 SCC in 5 ms
Free SCC test removed 42 places
Drop transitions removed 51 transitions
Reduce isomorphic transitions removed 51 transitions.
Drop transitions removed 238 transitions
Trivial Post-agglo rules discarded 238 transitions
Performed 238 trivial Post agglomeration. Transition count delta: 238
Iterating post reduction 0 with 238 rules applied. Total rules applied 239 place count 878 transition count 768
Reduce places removed 238 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 239 rules applied. Total rules applied 478 place count 640 transition count 767
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 479 place count 639 transition count 767
Performed 55 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 55 Pre rules applied. Total rules applied 479 place count 639 transition count 712
Deduced a syphon composed of 55 places in 1 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 3 with 110 rules applied. Total rules applied 589 place count 584 transition count 712
Discarding 315 places :
Symmetric choice reduction at 3 with 315 rule applications. Total rules 904 place count 269 transition count 397
Iterating global reduction 3 with 315 rules applied. Total rules applied 1219 place count 269 transition count 397
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 1219 place count 269 transition count 388
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 1237 place count 260 transition count 388
Discarding 49 places :
Symmetric choice reduction at 3 with 49 rule applications. Total rules 1286 place count 211 transition count 339
Iterating global reduction 3 with 49 rules applied. Total rules applied 1335 place count 211 transition count 339
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 3 with 48 rules applied. Total rules applied 1383 place count 211 transition count 291
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 4 with 80 rules applied. Total rules applied 1463 place count 171 transition count 251
Drop transitions removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 4 with 16 rules applied. Total rules applied 1479 place count 171 transition count 235
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 1487 place count 163 transition count 227
Iterating global reduction 5 with 8 rules applied. Total rules applied 1495 place count 163 transition count 227
Free-agglomeration rule applied 116 times.
Iterating global reduction 5 with 116 rules applied. Total rules applied 1611 place count 163 transition count 111
Reduce places removed 116 places and 0 transitions.
Drop transitions removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Graph (complete) has 123 edges and 47 vertex of which 32 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.1 ms
Discarding 15 places :
Also discarding 0 output transitions
Iterating post reduction 5 with 165 rules applied. Total rules applied 1776 place count 32 transition count 63
Drop transitions removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 6 with 21 rules applied. Total rules applied 1797 place count 32 transition count 42
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 1798 place count 31 transition count 41
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 25 edges and 30 vertex of which 10 / 30 are part of one of the 5 SCC in 0 ms
Free SCC test removed 5 places
Iterating post reduction 7 with 2 rules applied. Total rules applied 1800 place count 25 transition count 41
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 8 with 10 rules applied. Total rules applied 1810 place count 25 transition count 31
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 5 Pre rules applied. Total rules applied 1810 place count 25 transition count 26
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 9 with 10 rules applied. Total rules applied 1820 place count 20 transition count 26
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 1824 place count 20 transition count 22
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 10 with 8 rules applied. Total rules applied 1832 place count 16 transition count 18
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 1834 place count 15 transition count 17
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 1835 place count 15 transition count 16
Free-agglomeration rule applied 4 times.
Iterating global reduction 10 with 4 rules applied. Total rules applied 1839 place count 15 transition count 12
Reduce places removed 7 places and 0 transitions.
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 10 with 11 rules applied. Total rules applied 1850 place count 8 transition count 8
Free-agglomeration rule applied 1 times.
Iterating global reduction 11 with 1 rules applied. Total rules applied 1851 place count 8 transition count 7
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 1852 place count 7 transition count 7
Applied a total of 1852 rules in 141 ms. Remains 7 /920 variables (removed 913) and now considering 7/1057 (removed 1050) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 142 ms. Remains : 7/920 places, 7/1057 transitions.
// Phase 1: matrix 7 rows 7 cols
[2023-03-11 17:20:17] [INFO ] Computed 3 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 538 ms. (steps per millisecond=1858 ) properties (out of 3) seen :3
FORMULA FlexibleBarrier-PT-08b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-08b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-08b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 38403 ms.
ITS solved all properties within timeout

BK_STOP 1678555218676

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /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-08b"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="marciexred"
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-5348"
echo " Executing tool marciexred"
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 r170-tall-167838857300485"
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.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 ;