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.r197-tall-171640624700026.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 gold2023
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 r197-tall-171640624700026
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 668K
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K 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.7K Apr 22 14:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 18:20 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.9K Apr 13 08:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 91K Apr 13 08:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Apr 13 08:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 70K Apr 13 08:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:45 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K 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 241K 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-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 1716495763192

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=gold2023
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FlexibleBarrier-PT-08b
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-05-23 20:22:44] [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]
[2024-05-23 20:22:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 20:22:44] [INFO ] Load time of PNML (sax parser for PT used): 81 ms
[2024-05-23 20:22:44] [INFO ] Transformed 920 places.
[2024-05-23 20:22:45] [INFO ] Transformed 1057 transitions.
[2024-05-23 20:22:45] [INFO ] Found NUPN structural information;
[2024-05-23 20:22:45] [INFO ] Parsed PT model containing 920 places and 1057 transitions and 2627 arcs in 445 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
// Phase 1: matrix 1057 rows 920 cols
[2024-05-23 20:22:45] [INFO ] Computed 10 invariants in 41 ms
Incomplete random walk after 10000 steps, including 159 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 16) seen :7
FORMULA FlexibleBarrier-PT-08b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-08b-UpperBounds-13 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-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-08b-UpperBounds-01 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 10 ms. (steps per millisecond=1000 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 9) 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 9) 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 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 9) seen :0
[2024-05-23 20:22:45] [INFO ] Invariant cache hit.
[2024-05-23 20:22:45] [INFO ] [Real]Absence check using 10 positive place invariants in 17 ms returned sat
[2024-05-23 20:22:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 20:22:45] [INFO ] [Real]Absence check using state equation in 311 ms returned sat
[2024-05-23 20:22:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 20:22:46] [INFO ] [Nat]Absence check using 10 positive place invariants in 15 ms returned sat
[2024-05-23 20:22:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 20:22:46] [INFO ] [Nat]Absence check using state equation in 295 ms returned sat
[2024-05-23 20:22:46] [INFO ] Deduced a trap composed of 166 places in 163 ms of which 9 ms to minimize.
[2024-05-23 20:22:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 255 ms
[2024-05-23 20:22:46] [INFO ] Computed and/alt/rep : 968/1629/968 causal constraints (skipped 88 transitions) in 118 ms.
[2024-05-23 20:22:50] [INFO ] Added : 308 causal constraints over 62 iterations in 3512 ms. Result :sat
Minimization took 195 ms.
[2024-05-23 20:22:50] [INFO ] [Real]Absence check using 10 positive place invariants in 15 ms returned sat
[2024-05-23 20:22:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 20:22:50] [INFO ] [Real]Absence check using state equation in 299 ms returned sat
[2024-05-23 20:22:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 20:22:51] [INFO ] [Nat]Absence check using 10 positive place invariants in 16 ms returned sat
[2024-05-23 20:22:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 20:22:51] [INFO ] [Nat]Absence check using state equation in 290 ms returned sat
[2024-05-23 20:22:51] [INFO ] Computed and/alt/rep : 968/1629/968 causal constraints (skipped 88 transitions) in 61 ms.
[2024-05-23 20:22:54] [INFO ] Added : 294 causal constraints over 59 iterations in 3266 ms. Result :sat
Minimization took 172 ms.
[2024-05-23 20:22:55] [INFO ] [Real]Absence check using 10 positive place invariants in 15 ms returned sat
[2024-05-23 20:22:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 20:22:55] [INFO ] [Real]Absence check using state equation in 291 ms returned sat
[2024-05-23 20:22:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 20:22:55] [INFO ] [Nat]Absence check using 10 positive place invariants in 15 ms returned sat
[2024-05-23 20:22:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 20:22:55] [INFO ] [Nat]Absence check using state equation in 325 ms returned sat
[2024-05-23 20:22:56] [INFO ] Deduced a trap composed of 311 places in 229 ms of which 1 ms to minimize.
[2024-05-23 20:22:56] [INFO ] Deduced a trap composed of 313 places in 197 ms of which 0 ms to minimize.
[2024-05-23 20:22:56] [INFO ] Deduced a trap composed of 284 places in 190 ms of which 1 ms to minimize.
[2024-05-23 20:22:56] [INFO ] Deduced a trap composed of 283 places in 165 ms of which 1 ms to minimize.
[2024-05-23 20:22:56] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 982 ms
[2024-05-23 20:22:56] [INFO ] Computed and/alt/rep : 968/1629/968 causal constraints (skipped 88 transitions) in 65 ms.
[2024-05-23 20:23:00] [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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1189)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:926)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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)
[2024-05-23 20:23:00] [INFO ] [Real]Absence check using 10 positive place invariants in 15 ms returned sat
[2024-05-23 20:23:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 20:23:00] [INFO ] [Real]Absence check using state equation in 296 ms returned sat
[2024-05-23 20:23:01] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 20:23:01] [INFO ] [Nat]Absence check using 10 positive place invariants in 16 ms returned sat
[2024-05-23 20:23:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 20:23:01] [INFO ] [Nat]Absence check using state equation in 288 ms returned sat
[2024-05-23 20:23:01] [INFO ] Deduced a trap composed of 316 places in 208 ms of which 1 ms to minimize.
[2024-05-23 20:23:01] [INFO ] Deduced a trap composed of 140 places in 169 ms of which 1 ms to minimize.
[2024-05-23 20:23:02] [INFO ] Deduced a trap composed of 314 places in 189 ms of which 0 ms to minimize.
[2024-05-23 20:23:02] [INFO ] Deduced a trap composed of 282 places in 165 ms of which 0 ms to minimize.
[2024-05-23 20:23:02] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 931 ms
[2024-05-23 20:23:02] [INFO ] Computed and/alt/rep : 968/1629/968 causal constraints (skipped 88 transitions) in 49 ms.
[2024-05-23 20:23:05] [INFO ] Added : 311 causal constraints over 63 iterations in 3538 ms. Result :sat
Minimization took 88 ms.
[2024-05-23 20:23:06] [INFO ] [Real]Absence check using 10 positive place invariants in 14 ms returned sat
[2024-05-23 20:23:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 20:23:06] [INFO ] [Real]Absence check using state equation in 272 ms returned sat
[2024-05-23 20:23:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 20:23:06] [INFO ] [Nat]Absence check using 10 positive place invariants in 15 ms returned sat
[2024-05-23 20:23:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 20:23:06] [INFO ] [Nat]Absence check using state equation in 281 ms returned sat
[2024-05-23 20:23:07] [INFO ] Deduced a trap composed of 303 places in 220 ms of which 3 ms to minimize.
[2024-05-23 20:23:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 290 ms
[2024-05-23 20:23:07] [INFO ] Computed and/alt/rep : 968/1629/968 causal constraints (skipped 88 transitions) in 59 ms.
[2024-05-23 20:23:11] [INFO ] Added : 350 causal constraints over 70 iterations in 3841 ms. Result :sat
Minimization took 232 ms.
[2024-05-23 20:23:11] [INFO ] [Real]Absence check using 10 positive place invariants in 18 ms returned sat
[2024-05-23 20:23:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 20:23:11] [INFO ] [Real]Absence check using state equation in 289 ms returned sat
[2024-05-23 20:23:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 20:23:11] [INFO ] [Nat]Absence check using 10 positive place invariants in 15 ms returned sat
[2024-05-23 20:23:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 20:23:12] [INFO ] [Nat]Absence check using state equation in 291 ms returned sat
[2024-05-23 20:23:12] [INFO ] Computed and/alt/rep : 968/1629/968 causal constraints (skipped 88 transitions) in 54 ms.
[2024-05-23 20:23:16] [INFO ] Added : 373 causal constraints over 75 iterations in 4113 ms. Result :sat
Minimization took 215 ms.
[2024-05-23 20:23:16] [INFO ] [Real]Absence check using 10 positive place invariants in 15 ms returned sat
[2024-05-23 20:23:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 20:23:17] [INFO ] [Real]Absence check using state equation in 300 ms returned sat
[2024-05-23 20:23:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 20:23:17] [INFO ] [Nat]Absence check using 10 positive place invariants in 15 ms returned sat
[2024-05-23 20:23:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 20:23:17] [INFO ] [Nat]Absence check using state equation in 307 ms returned sat
[2024-05-23 20:23:17] [INFO ] Computed and/alt/rep : 968/1629/968 causal constraints (skipped 88 transitions) in 48 ms.
[2024-05-23 20:23:21] [INFO ] Added : 313 causal constraints over 63 iterations in 3403 ms. Result :sat
Minimization took 176 ms.
[2024-05-23 20:23:21] [INFO ] [Real]Absence check using 10 positive place invariants in 14 ms returned sat
[2024-05-23 20:23:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 20:23:21] [INFO ] [Real]Absence check using state equation in 294 ms returned sat
[2024-05-23 20:23:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 20:23:21] [INFO ] [Nat]Absence check using 10 positive place invariants in 16 ms returned sat
[2024-05-23 20:23:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 20:23:22] [INFO ] [Nat]Absence check using state equation in 297 ms returned sat
[2024-05-23 20:23:22] [INFO ] Deduced a trap composed of 52 places in 206 ms of which 1 ms to minimize.
[2024-05-23 20:23:22] [INFO ] Deduced a trap composed of 323 places in 205 ms of which 1 ms to minimize.
[2024-05-23 20:23:22] [INFO ] Deduced a trap composed of 316 places in 171 ms of which 1 ms to minimize.
[2024-05-23 20:23:23] [INFO ] Deduced a trap composed of 284 places in 174 ms of which 1 ms to minimize.
[2024-05-23 20:23:23] [INFO ] Deduced a trap composed of 316 places in 155 ms of which 1 ms to minimize.
[2024-05-23 20:23:23] [INFO ] Deduced a trap composed of 280 places in 162 ms of which 0 ms to minimize.
[2024-05-23 20:23:23] [INFO ] Deduced a trap composed of 283 places in 136 ms of which 1 ms to minimize.
[2024-05-23 20:23:23] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1508 ms
[2024-05-23 20:23:23] [INFO ] Computed and/alt/rep : 968/1629/968 causal constraints (skipped 88 transitions) in 55 ms.
[2024-05-23 20:23:27] [INFO ] Deduced a trap composed of 92 places in 307 ms of which 0 ms to minimize.
[2024-05-23 20:23:27] [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 7
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:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1180)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:926)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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)
[2024-05-23 20:23:27] [INFO ] [Real]Absence check using 10 positive place invariants in 14 ms returned sat
[2024-05-23 20:23:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 20:23:27] [INFO ] [Real]Absence check using state equation in 284 ms returned sat
[2024-05-23 20:23:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 20:23:27] [INFO ] [Nat]Absence check using 10 positive place invariants in 16 ms returned sat
[2024-05-23 20:23:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 20:23:28] [INFO ] [Nat]Absence check using state equation in 295 ms returned sat
[2024-05-23 20:23:28] [INFO ] Deduced a trap composed of 20 places in 95 ms of which 1 ms to minimize.
[2024-05-23 20:23:28] [INFO ] Deduced a trap composed of 52 places in 90 ms of which 1 ms to minimize.
[2024-05-23 20:23:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 287 ms
[2024-05-23 20:23:28] [INFO ] Computed and/alt/rep : 968/1629/968 causal constraints (skipped 88 transitions) in 71 ms.
[2024-05-23 20:23:31] [INFO ] Added : 302 causal constraints over 61 iterations in 3401 ms. Result :sat
Minimization took 170 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
FORMULA FlexibleBarrier-PT-08b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FlexibleBarrier-PT-08b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FlexibleBarrier-PT-08b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FlexibleBarrier-PT-08b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FlexibleBarrier-PT-08b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FlexibleBarrier-PT-08b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FlexibleBarrier-PT-08b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 2 out of 920 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 920/920 places, 1057/1057 transitions.
Graph (trivial) has 892 edges and 920 vertex of which 50 / 920 are part of one of the 8 SCC in 6 ms
Free SCC test removed 42 places
Drop transitions removed 51 transitions
Reduce isomorphic transitions removed 51 transitions.
Drop transitions removed 239 transitions
Trivial Post-agglo rules discarded 239 transitions
Performed 239 trivial Post agglomeration. Transition count delta: 239
Iterating post reduction 0 with 239 rules applied. Total rules applied 240 place count 878 transition count 767
Reduce places removed 239 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 241 rules applied. Total rules applied 481 place count 639 transition count 765
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 483 place count 637 transition count 765
Performed 55 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 55 Pre rules applied. Total rules applied 483 place count 637 transition count 710
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 593 place count 582 transition count 710
Discarding 315 places :
Symmetric choice reduction at 3 with 315 rule applications. Total rules 908 place count 267 transition count 395
Iterating global reduction 3 with 315 rules applied. Total rules applied 1223 place count 267 transition count 395
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 1223 place count 267 transition count 385
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 1243 place count 257 transition count 385
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 1251 place count 257 transition count 377
Discarding 48 places :
Symmetric choice reduction at 4 with 48 rule applications. Total rules 1299 place count 209 transition count 329
Iterating global reduction 4 with 48 rules applied. Total rules applied 1347 place count 209 transition count 329
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 47 transitions.
Iterating post reduction 4 with 47 rules applied. Total rules applied 1394 place count 209 transition count 282
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 5 with 80 rules applied. Total rules applied 1474 place count 169 transition count 242
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 1482 place count 169 transition count 234
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 1490 place count 161 transition count 226
Iterating global reduction 6 with 8 rules applied. Total rules applied 1498 place count 161 transition count 226
Free-agglomeration rule applied 116 times.
Iterating global reduction 6 with 116 rules applied. Total rules applied 1614 place count 161 transition count 110
Reduce places removed 116 places and 0 transitions.
Drop transitions removed 49 transitions
Reduce isomorphic transitions removed 49 transitions.
Graph (complete) has 122 edges and 45 vertex of which 20 are kept as prefixes of interest. Removing 25 places using SCC suffix rule.0 ms
Discarding 25 places :
Also discarding 0 output transitions
Iterating post reduction 6 with 166 rules applied. Total rules applied 1780 place count 20 transition count 61
Drop transitions removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Iterating post reduction 7 with 35 rules applied. Total rules applied 1815 place count 20 transition count 26
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1816 place count 19 transition count 25
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 21 edges and 17 vertex of which 15 / 17 are part of one of the 3 SCC in 0 ms
Free SCC test removed 12 places
Iterating post reduction 8 with 3 rules applied. Total rules applied 1819 place count 5 transition count 25
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 9 with 23 rules applied. Total rules applied 1842 place count 3 transition count 4
Applied a total of 1842 rules in 144 ms. Remains 3 /920 variables (removed 917) and now considering 4/1057 (removed 1053) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 144 ms. Remains : 3/920 places, 4/1057 transitions.
// Phase 1: matrix 4 rows 3 cols
[2024-05-23 20:23:32] [INFO ] Computed 1 invariants in 0 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 397 ms. (steps per millisecond=2518 ) properties (out of 2) seen :2
FORMULA FlexibleBarrier-PT-08b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-08b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 48386 ms.

BK_STOP 1716495813979

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /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="gold2023"
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 gold2023"
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 r197-tall-171640624700026"
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 ;