Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r549-tall-171734898300317.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is FireWire-PT-19, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r549-tall-171734898300317
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 668K
-rw-r--r-- 1 mcc users 7.8K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 9.5K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 100K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 221K Jun 2 16:33 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME FireWire-PT-19-UpperBounds-00
FORMULA_NAME FireWire-PT-19-UpperBounds-01
FORMULA_NAME FireWire-PT-19-UpperBounds-02
FORMULA_NAME FireWire-PT-19-UpperBounds-03
FORMULA_NAME FireWire-PT-19-UpperBounds-04
FORMULA_NAME FireWire-PT-19-UpperBounds-05
FORMULA_NAME FireWire-PT-19-UpperBounds-06
FORMULA_NAME FireWire-PT-19-UpperBounds-07
FORMULA_NAME FireWire-PT-19-UpperBounds-08
FORMULA_NAME FireWire-PT-19-UpperBounds-09
FORMULA_NAME FireWire-PT-19-UpperBounds-10
FORMULA_NAME FireWire-PT-19-UpperBounds-11
FORMULA_NAME FireWire-PT-19-UpperBounds-12
FORMULA_NAME FireWire-PT-19-UpperBounds-13
FORMULA_NAME FireWire-PT-19-UpperBounds-14
FORMULA_NAME FireWire-PT-19-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717374725160

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-19
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-03 00:32:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-03 00:32:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-03 00:32:06] [INFO ] Load time of PNML (sax parser for PT used): 107 ms
[2024-06-03 00:32:06] [INFO ] Transformed 602 places.
[2024-06-03 00:32:06] [INFO ] Transformed 944 transitions.
[2024-06-03 00:32:06] [INFO ] Found NUPN structural information;
[2024-06-03 00:32:06] [INFO ] Parsed PT model containing 602 places and 944 transitions and 2776 arcs in 219 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 944 rows 602 cols
[2024-06-03 00:32:06] [INFO ] Computed 13 invariants in 33 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 (8 resets) in 42 ms. (232 steps per ms)
FORMULA FireWire-PT-19-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-19-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-19-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-19-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-19-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 110002 steps (45 resets) in 179 ms. (611 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 00:32:06] [INFO ] Invariant cache hit.
[2024-06-03 00:32:07] [INFO ] [Real]Absence check using 13 positive place invariants in 19 ms returned sat
[2024-06-03 00:32:07] [INFO ] [Real]Absence check using state equation in 255 ms returned sat
[2024-06-03 00:32:07] [INFO ] Computed and/alt/rep : 807/2024/807 causal constraints (skipped 136 transitions) in 82 ms.
[2024-06-03 00:32:07] [INFO ] Solution in real domain found non-integer solution.
[2024-06-03 00:32:08] [INFO ] [Nat]Absence check using 13 positive place invariants in 12 ms returned sat
[2024-06-03 00:32:08] [INFO ] [Nat]Absence check using state equation in 240 ms returned sat
[2024-06-03 00:32:08] [INFO ] Computed and/alt/rep : 807/2024/807 causal constraints (skipped 136 transitions) in 69 ms.
[2024-06-03 00:32:13] [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 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-06-03 00:32:13] [INFO ] [Real]Absence check using 13 positive place invariants in 14 ms returned sat
[2024-06-03 00:32:13] [INFO ] [Real]Absence check using state equation in 219 ms returned sat
[2024-06-03 00:32:13] [INFO ] Computed and/alt/rep : 807/2024/807 causal constraints (skipped 136 transitions) in 49 ms.
[2024-06-03 00:32:13] [INFO ] Solution in real domain found non-integer solution.
[2024-06-03 00:32:13] [INFO ] [Nat]Absence check using 13 positive place invariants in 12 ms returned sat
[2024-06-03 00:32:14] [INFO ] [Nat]Absence check using state equation in 233 ms returned sat
[2024-06-03 00:32:14] [INFO ] Computed and/alt/rep : 807/2024/807 causal constraints (skipped 136 transitions) in 54 ms.
[2024-06-03 00:32:18] [INFO ] Added : 445 causal constraints over 89 iterations in 4638 ms. Result :unknown
[2024-06-03 00:32:18] [INFO ] [Real]Absence check using 13 positive place invariants in 11 ms returned sat
[2024-06-03 00:32:19] [INFO ] [Real]Absence check using state equation in 222 ms returned sat
[2024-06-03 00:32:19] [INFO ] Deduced a trap composed of 176 places in 239 ms of which 36 ms to minimize.
[2024-06-03 00:32:19] [INFO ] Solution in real domain found non-integer solution.
[2024-06-03 00:32:19] [INFO ] [Nat]Absence check using 13 positive place invariants in 12 ms returned sat
[2024-06-03 00:32:19] [INFO ] [Nat]Absence check using state equation in 215 ms returned sat
[2024-06-03 00:32:20] [INFO ] Deduced a trap composed of 176 places in 218 ms of which 4 ms to minimize.
[2024-06-03 00:32:20] [INFO ] Deduced a trap composed of 87 places in 222 ms of which 4 ms to minimize.
[2024-06-03 00:32:20] [INFO ] Deduced a trap composed of 83 places in 205 ms of which 4 ms to minimize.
[2024-06-03 00:32:20] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 762 ms
[2024-06-03 00:32:20] [INFO ] Computed and/alt/rep : 807/2024/807 causal constraints (skipped 136 transitions) in 47 ms.
[2024-06-03 00:32:24] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-06-03 00:32:24] [INFO ] [Real]Absence check using 13 positive place invariants in 11 ms returned sat
[2024-06-03 00:32:24] [INFO ] [Real]Absence check using state equation in 205 ms returned sat
[2024-06-03 00:32:25] [INFO ] Deduced a trap composed of 104 places in 114 ms of which 2 ms to minimize.
[2024-06-03 00:32:25] [INFO ] Solution in real domain found non-integer solution.
[2024-06-03 00:32:25] [INFO ] [Nat]Absence check using 13 positive place invariants in 14 ms returned sat
[2024-06-03 00:32:25] [INFO ] [Nat]Absence check using state equation in 196 ms returned sat
[2024-06-03 00:32:25] [INFO ] Deduced a trap composed of 104 places in 109 ms of which 2 ms to minimize.
[2024-06-03 00:32:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 163 ms
[2024-06-03 00:32:25] [INFO ] Computed and/alt/rep : 807/2024/807 causal constraints (skipped 136 transitions) in 40 ms.
[2024-06-03 00:32:30] [INFO ] Added : 430 causal constraints over 86 iterations in 4541 ms. Result :unknown
[2024-06-03 00:32:30] [INFO ] [Real]Absence check using 13 positive place invariants in 11 ms returned sat
[2024-06-03 00:32:30] [INFO ] [Real]Absence check using state equation in 234 ms returned sat
[2024-06-03 00:32:30] [INFO ] Computed and/alt/rep : 807/2024/807 causal constraints (skipped 136 transitions) in 54 ms.
[2024-06-03 00:32:30] [INFO ] Solution in real domain found non-integer solution.
[2024-06-03 00:32:30] [INFO ] [Nat]Absence check using 13 positive place invariants in 12 ms returned sat
[2024-06-03 00:32:31] [INFO ] [Nat]Absence check using state equation in 233 ms returned sat
[2024-06-03 00:32:31] [INFO ] Computed and/alt/rep : 807/2024/807 causal constraints (skipped 136 transitions) in 51 ms.
[2024-06-03 00:32:35] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 4
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-06-03 00:32:35] [INFO ] [Real]Absence check using 13 positive place invariants in 11 ms returned sat
[2024-06-03 00:32:36] [INFO ] [Real]Absence check using state equation in 218 ms returned sat
[2024-06-03 00:32:36] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 1 ms to minimize.
[2024-06-03 00:32:36] [INFO ] Solution in real domain found non-integer solution.
[2024-06-03 00:32:36] [INFO ] [Nat]Absence check using 13 positive place invariants in 12 ms returned sat
[2024-06-03 00:32:36] [INFO ] [Nat]Absence check using state equation in 211 ms returned sat
[2024-06-03 00:32:36] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 2 ms to minimize.
[2024-06-03 00:32:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 112 ms
[2024-06-03 00:32:36] [INFO ] Computed and/alt/rep : 807/2024/807 causal constraints (skipped 136 transitions) in 41 ms.
Maximisation of solution failed !
Minimization took 1 ms.
[2024-06-03 00:32:41] [INFO ] [Real]Absence check using 13 positive place invariants in 11 ms returned sat
[2024-06-03 00:32:41] [INFO ] [Real]Absence check using state equation in 250 ms returned sat
[2024-06-03 00:32:41] [INFO ] Deduced a trap composed of 305 places in 191 ms of which 4 ms to minimize.
[2024-06-03 00:32:41] [INFO ] Solution in real domain found non-integer solution.
[2024-06-03 00:32:42] [INFO ] [Nat]Absence check using 13 positive place invariants in 12 ms returned sat
[2024-06-03 00:32:42] [INFO ] [Nat]Absence check using state equation in 231 ms returned sat
[2024-06-03 00:32:42] [INFO ] Deduced a trap composed of 305 places in 191 ms of which 4 ms to minimize.
[2024-06-03 00:32:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 261 ms
[2024-06-03 00:32:42] [INFO ] Computed and/alt/rep : 807/2024/807 causal constraints (skipped 136 transitions) in 48 ms.
[2024-06-03 00:32:47] [INFO ] Added : 420 causal constraints over 84 iterations in 4406 ms. Result :unknown
[2024-06-03 00:32:47] [INFO ] [Real]Absence check using 13 positive place invariants in 11 ms returned sat
[2024-06-03 00:32:47] [INFO ] [Real]Absence check using state equation in 213 ms returned sat
[2024-06-03 00:32:47] [INFO ] Deduced a trap composed of 17 places in 200 ms of which 5 ms to minimize.
[2024-06-03 00:32:47] [INFO ] Solution in real domain found non-integer solution.
[2024-06-03 00:32:47] [INFO ] [Nat]Absence check using 13 positive place invariants in 11 ms returned sat
[2024-06-03 00:32:47] [INFO ] [Nat]Absence check using state equation in 208 ms returned sat
[2024-06-03 00:32:48] [INFO ] Deduced a trap composed of 17 places in 190 ms of which 4 ms to minimize.
[2024-06-03 00:32:48] [INFO ] Deduced a trap composed of 82 places in 180 ms of which 3 ms to minimize.
[2024-06-03 00:32:48] [INFO ] Deduced a trap composed of 131 places in 181 ms of which 3 ms to minimize.
[2024-06-03 00:32:48] [INFO ] Deduced a trap composed of 117 places in 175 ms of which 3 ms to minimize.
[2024-06-03 00:32:48] [INFO ] Deduced a trap composed of 145 places in 189 ms of which 4 ms to minimize.
[2024-06-03 00:32:49] [INFO ] Deduced a trap composed of 83 places in 207 ms of which 4 ms to minimize.
[2024-06-03 00:32:49] [INFO ] Deduced a trap composed of 103 places in 185 ms of which 3 ms to minimize.
[2024-06-03 00:32:49] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1535 ms
[2024-06-03 00:32:49] [INFO ] Computed and/alt/rep : 807/2024/807 causal constraints (skipped 136 transitions) in 48 ms.
[2024-06-03 00:32:52] [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:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-06-03 00:32:52] [INFO ] [Real]Absence check using 13 positive place invariants in 12 ms returned sat
[2024-06-03 00:32:52] [INFO ] [Real]Absence check using state equation in 208 ms returned sat
[2024-06-03 00:32:53] [INFO ] Deduced a trap composed of 231 places in 203 ms of which 3 ms to minimize.
[2024-06-03 00:32:53] [INFO ] Solution in real domain found non-integer solution.
[2024-06-03 00:32:53] [INFO ] [Nat]Absence check using 13 positive place invariants in 13 ms returned sat
[2024-06-03 00:32:53] [INFO ] [Nat]Absence check using state equation in 206 ms returned sat
[2024-06-03 00:32:53] [INFO ] Deduced a trap composed of 231 places in 201 ms of which 4 ms to minimize.
[2024-06-03 00:32:54] [INFO ] Deduced a trap composed of 96 places in 201 ms of which 3 ms to minimize.
[2024-06-03 00:32:54] [INFO ] Deduced a trap composed of 83 places in 188 ms of which 3 ms to minimize.
[2024-06-03 00:32:54] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 700 ms
[2024-06-03 00:32:54] [INFO ] Computed and/alt/rep : 807/2024/807 causal constraints (skipped 136 transitions) in 44 ms.
Maximisation of solution failed !
Minimization took 0 ms.
[2024-06-03 00:32:58] [INFO ] [Real]Absence check using 13 positive place invariants in 11 ms returned sat
[2024-06-03 00:32:58] [INFO ] [Real]Absence check using state equation in 209 ms returned sat
[2024-06-03 00:32:58] [INFO ] Computed and/alt/rep : 807/2024/807 causal constraints (skipped 136 transitions) in 59 ms.
[2024-06-03 00:32:58] [INFO ] Solution in real domain found non-integer solution.
[2024-06-03 00:32:59] [INFO ] [Nat]Absence check using 13 positive place invariants in 12 ms returned sat
[2024-06-03 00:32:59] [INFO ] [Nat]Absence check using state equation in 198 ms returned sat
[2024-06-03 00:32:59] [INFO ] Computed and/alt/rep : 807/2024/807 causal constraints (skipped 136 transitions) in 45 ms.
[2024-06-03 00:33:03] [INFO ] Added : 445 causal constraints over 89 iterations in 4664 ms. Result :unknown
[2024-06-03 00:33:04] [INFO ] [Real]Absence check using 13 positive place invariants in 10 ms returned sat
[2024-06-03 00:33:04] [INFO ] [Real]Absence check using state equation in 205 ms returned sat
[2024-06-03 00:33:04] [INFO ] Deduced a trap composed of 82 places in 191 ms of which 3 ms to minimize.
[2024-06-03 00:33:04] [INFO ] Solution in real domain found non-integer solution.
[2024-06-03 00:33:04] [INFO ] [Nat]Absence check using 13 positive place invariants in 12 ms returned sat
[2024-06-03 00:33:04] [INFO ] [Nat]Absence check using state equation in 202 ms returned sat
[2024-06-03 00:33:05] [INFO ] Deduced a trap composed of 82 places in 190 ms of which 4 ms to minimize.
[2024-06-03 00:33:05] [INFO ] Deduced a trap composed of 83 places in 193 ms of which 3 ms to minimize.
[2024-06-03 00:33:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 474 ms
[2024-06-03 00:33:05] [INFO ] Computed and/alt/rep : 807/2024/807 causal constraints (skipped 136 transitions) in 51 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, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
FORMULA FireWire-PT-19-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FireWire-PT-19-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FireWire-PT-19-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FireWire-PT-19-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FireWire-PT-19-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
Support contains 6 out of 602 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 602/602 places, 944/944 transitions.
Graph (trivial) has 481 edges and 602 vertex of which 19 / 602 are part of one of the 3 SCC in 4 ms
Free SCC test removed 16 places
Drop transitions (Empty/Sink Transition effects.) removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Graph (complete) has 1585 edges and 586 vertex of which 577 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.3 ms
Discarding 9 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 173 transitions
Trivial Post-agglo rules discarded 173 transitions
Performed 173 trivial Post agglomeration. Transition count delta: 173
Iterating post reduction 0 with 176 rules applied. Total rules applied 178 place count 577 transition count 748
Reduce places removed 173 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 176 rules applied. Total rules applied 354 place count 404 transition count 745
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 4 rules applied. Total rules applied 358 place count 402 transition count 743
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 360 place count 400 transition count 743
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 12 Pre rules applied. Total rules applied 360 place count 400 transition count 731
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 384 place count 388 transition count 731
Discarding 61 places :
Symmetric choice reduction at 4 with 61 rule applications. Total rules 445 place count 327 transition count 669
Iterating global reduction 4 with 61 rules applied. Total rules applied 506 place count 327 transition count 669
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 509 place count 327 transition count 666
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 16 Pre rules applied. Total rules applied 509 place count 327 transition count 650
Deduced a syphon composed of 16 places in 2 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 5 with 32 rules applied. Total rules applied 541 place count 311 transition count 650
Discarding 14 places :
Symmetric choice reduction at 5 with 14 rule applications. Total rules 555 place count 297 transition count 569
Iterating global reduction 5 with 14 rules applied. Total rules applied 569 place count 297 transition count 569
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 5 with 7 rules applied. Total rules applied 576 place count 297 transition count 562
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 579 place count 294 transition count 562
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 7 with 100 rules applied. Total rules applied 679 place count 244 transition count 512
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: -124
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 7 with 84 rules applied. Total rules applied 763 place count 202 transition count 636
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 7 with 9 rules applied. Total rules applied 772 place count 202 transition count 627
Drop transitions (Redundant composition of simpler transitions.) removed 53 transitions
Redundant transition composition rules discarded 53 transitions
Iterating global reduction 8 with 53 rules applied. Total rules applied 825 place count 202 transition count 574
Free-agglomeration rule applied 29 times.
Iterating global reduction 8 with 29 rules applied. Total rules applied 854 place count 202 transition count 545
Reduce places removed 29 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 8 with 38 rules applied. Total rules applied 892 place count 173 transition count 536
Drop transitions (Redundant composition of simpler transitions.) removed 83 transitions
Redundant transition composition rules discarded 83 transitions
Iterating global reduction 9 with 83 rules applied. Total rules applied 975 place count 173 transition count 453
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 9 with 3 rules applied. Total rules applied 978 place count 173 transition count 453
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 980 place count 173 transition count 453
Applied a total of 980 rules in 221 ms. Remains 173 /602 variables (removed 429) and now considering 453/944 (removed 491) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 232 ms. Remains : 173/602 places, 453/944 transitions.
[2024-06-03 00:33:12] [INFO ] Flow matrix only has 398 transitions (discarded 55 similar events)
// Phase 1: matrix 398 rows 173 cols
[2024-06-03 00:33:12] [INFO ] Computed 10 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (40283 resets) in 1642 ms. (608 steps per ms)
FORMULA FireWire-PT-19-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-19-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-19-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-19-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-19-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-19-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (8216 resets) in 496 ms. (2012 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 68525 ms.
ITS solved all properties within timeout

BK_STOP 1717374794918

--------------------
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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FireWire-PT-19"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is FireWire-PT-19, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r549-tall-171734898300317"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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