About the Execution of GreatSPN+red for FlexibleBarrier-PT-16b
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
679.060 | 85222.00 | 107416.00 | 317.40 | 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r179-tall-171640600800109.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is FlexibleBarrier-PT-16b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r179-tall-171640600800109
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K 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 May 19 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 15:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 18:22 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Apr 13 08:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 185K Apr 13 08:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Apr 13 08:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Apr 13 08:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:45 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:45 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 945K 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-16b-UpperBounds-00
FORMULA_NAME FlexibleBarrier-PT-16b-UpperBounds-01
FORMULA_NAME FlexibleBarrier-PT-16b-UpperBounds-02
FORMULA_NAME FlexibleBarrier-PT-16b-UpperBounds-03
FORMULA_NAME FlexibleBarrier-PT-16b-UpperBounds-04
FORMULA_NAME FlexibleBarrier-PT-16b-UpperBounds-05
FORMULA_NAME FlexibleBarrier-PT-16b-UpperBounds-06
FORMULA_NAME FlexibleBarrier-PT-16b-UpperBounds-07
FORMULA_NAME FlexibleBarrier-PT-16b-UpperBounds-08
FORMULA_NAME FlexibleBarrier-PT-16b-UpperBounds-09
FORMULA_NAME FlexibleBarrier-PT-16b-UpperBounds-10
FORMULA_NAME FlexibleBarrier-PT-16b-UpperBounds-11
FORMULA_NAME FlexibleBarrier-PT-16b-UpperBounds-12
FORMULA_NAME FlexibleBarrier-PT-16b-UpperBounds-13
FORMULA_NAME FlexibleBarrier-PT-16b-UpperBounds-14
FORMULA_NAME FlexibleBarrier-PT-16b-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1716424663170
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FlexibleBarrier-PT-16b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 00:37:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-23 00:37:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 00:37:44] [INFO ] Load time of PNML (sax parser for PT used): 184 ms
[2024-05-23 00:37:44] [INFO ] Transformed 3472 places.
[2024-05-23 00:37:44] [INFO ] Transformed 4001 transitions.
[2024-05-23 00:37:44] [INFO ] Found NUPN structural information;
[2024-05-23 00:37:44] [INFO ] Parsed PT model containing 3472 places and 4001 transitions and 10043 arcs in 295 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 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 4001 rows 3472 cols
[2024-05-23 00:37:44] [INFO ] Computed 18 invariants in 167 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 (91 resets) in 65 ms. (151 steps per ms)
FORMULA FlexibleBarrier-PT-16b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-16b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-16b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-16b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-16b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-16b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 100010 steps (77 resets) in 106 ms. (934 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-23 00:37:45] [INFO ] Invariant cache hit.
[2024-05-23 00:37:45] [INFO ] [Real]Absence check using 18 positive place invariants in 99 ms returned sat
[2024-05-23 00:37:48] [INFO ] [Real]Absence check using state equation in 2350 ms returned sat
[2024-05-23 00:37:50] [INFO ] Deduced a trap composed of 1229 places in 1742 ms of which 127 ms to minimize.
[2024-05-23 00:37:50] [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.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2249)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-23 00:37:50] [INFO ] [Real]Absence check using 18 positive place invariants in 85 ms returned sat
[2024-05-23 00:37:53] [INFO ] [Real]Absence check using state equation in 2373 ms returned sat
[2024-05-23 00:37:53] [INFO ] Computed and/alt/rep : 3689/5797/3689 causal constraints (skipped 311 transitions) in 262 ms.
[2024-05-23 00:37:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 00:37:54] [INFO ] [Nat]Absence check using 18 positive place invariants in 90 ms returned sat
[2024-05-23 00:37:57] [INFO ] [Nat]Absence check using state equation in 2378 ms returned sat
[2024-05-23 00:37:57] [INFO ] Computed and/alt/rep : 3689/5797/3689 causal constraints (skipped 311 transitions) in 248 ms.
Maximisation of solution failed !
Minimization took 1 ms.
[2024-05-23 00:37:59] [INFO ] [Real]Absence check using 18 positive place invariants in 77 ms returned sat
[2024-05-23 00:38:02] [INFO ] [Real]Absence check using state equation in 2393 ms returned sat
[2024-05-23 00:38:02] [INFO ] Computed and/alt/rep : 3689/5797/3689 causal constraints (skipped 311 transitions) in 234 ms.
[2024-05-23 00:38:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 00:38:03] [INFO ] [Nat]Absence check using 18 positive place invariants in 82 ms returned sat
[2024-05-23 00:38:06] [INFO ] [Nat]Absence check using state equation in 2505 ms returned sat
[2024-05-23 00:38:06] [INFO ] Computed and/alt/rep : 3689/5797/3689 causal constraints (skipped 311 transitions) in 201 ms.
[2024-05-23 00:38:08] [INFO ] Added : 45 causal constraints over 9 iterations in 1862 ms. Result :unknown
[2024-05-23 00:38:08] [INFO ] [Real]Absence check using 18 positive place invariants in 86 ms returned sat
[2024-05-23 00:38:10] [INFO ] [Real]Absence check using state equation in 1346 ms returned sat
[2024-05-23 00:38:10] [INFO ] Computed and/alt/rep : 3689/5797/3689 causal constraints (skipped 311 transitions) in 205 ms.
[2024-05-23 00:38:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 00:38:11] [INFO ] [Nat]Absence check using 18 positive place invariants in 77 ms returned sat
[2024-05-23 00:38:13] [INFO ] [Nat]Absence check using state equation in 1330 ms returned sat
[2024-05-23 00:38:13] [INFO ] Computed and/alt/rep : 3689/5797/3689 causal constraints (skipped 311 transitions) in 196 ms.
Maximisation of solution failed !
Minimization took 1 ms.
[2024-05-23 00:38:16] [INFO ] [Real]Absence check using 18 positive place invariants in 78 ms returned sat
[2024-05-23 00:38:18] [INFO ] [Real]Absence check using state equation in 1452 ms returned sat
[2024-05-23 00:38:18] [INFO ] Computed and/alt/rep : 3689/5797/3689 causal constraints (skipped 311 transitions) in 212 ms.
[2024-05-23 00:38:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 00:38:19] [INFO ] [Nat]Absence check using 18 positive place invariants in 77 ms returned sat
[2024-05-23 00:38:21] [INFO ] [Nat]Absence check using state equation in 1418 ms returned sat
[2024-05-23 00:38:21] [INFO ] Computed and/alt/rep : 3689/5797/3689 causal constraints (skipped 311 transitions) in 194 ms.
Maximisation of solution failed !
Minimization took 1 ms.
[2024-05-23 00:38:24] [INFO ] [Real]Absence check using 18 positive place invariants in 76 ms returned sat
[2024-05-23 00:38:26] [INFO ] [Real]Absence check using state equation in 1405 ms returned sat
[2024-05-23 00:38:26] [INFO ] Computed and/alt/rep : 3689/5797/3689 causal constraints (skipped 311 transitions) in 207 ms.
[2024-05-23 00:38:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 00:38:27] [INFO ] [Nat]Absence check using 18 positive place invariants in 82 ms returned sat
[2024-05-23 00:38:28] [INFO ] [Nat]Absence check using state equation in 1353 ms returned sat
[2024-05-23 00:38:29] [INFO ] Computed and/alt/rep : 3689/5797/3689 causal constraints (skipped 311 transitions) in 191 ms.
[2024-05-23 00:38:32] [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:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-23 00:38:32] [INFO ] [Real]Absence check using 18 positive place invariants in 75 ms returned sat
[2024-05-23 00:38:35] [INFO ] [Real]Absence check using state equation in 2411 ms returned sat
[2024-05-23 00:38:35] [INFO ] Computed and/alt/rep : 3689/5797/3689 causal constraints (skipped 311 transitions) in 190 ms.
[2024-05-23 00:38:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 00:38:36] [INFO ] [Nat]Absence check using 18 positive place invariants in 82 ms returned sat
[2024-05-23 00:38:38] [INFO ] [Nat]Absence check using state equation in 2403 ms returned sat
[2024-05-23 00:38:39] [INFO ] Computed and/alt/rep : 3689/5797/3689 causal constraints (skipped 311 transitions) in 211 ms.
[2024-05-23 00:38:40] [INFO ] Added : 40 causal constraints over 8 iterations in 1992 ms. Result :unknown
[2024-05-23 00:38:41] [INFO ] [Real]Absence check using 18 positive place invariants in 81 ms returned sat
[2024-05-23 00:38:42] [INFO ] [Real]Absence check using state equation in 1356 ms returned sat
[2024-05-23 00:38:43] [INFO ] Computed and/alt/rep : 3689/5797/3689 causal constraints (skipped 311 transitions) in 187 ms.
[2024-05-23 00:38:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 00:38:44] [INFO ] [Nat]Absence check using 18 positive place invariants in 80 ms returned sat
[2024-05-23 00:38:45] [INFO ] [Nat]Absence check using state equation in 1415 ms returned sat
[2024-05-23 00:38:46] [INFO ] Computed and/alt/rep : 3689/5797/3689 causal constraints (skipped 311 transitions) in 204 ms.
[2024-05-23 00:38:48] [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-05-23 00:38:49] [INFO ] [Real]Absence check using 18 positive place invariants in 78 ms returned sat
[2024-05-23 00:38:50] [INFO ] [Real]Absence check using state equation in 1326 ms returned sat
[2024-05-23 00:38:51] [INFO ] Deduced a trap composed of 153 places in 474 ms of which 8 ms to minimize.
[2024-05-23 00:38:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 00:38:52] [INFO ] [Nat]Absence check using 18 positive place invariants in 83 ms returned sat
[2024-05-23 00:38:53] [INFO ] [Nat]Absence check using state equation in 1384 ms returned sat
[2024-05-23 00:38:54] [INFO ] Deduced a trap composed of 153 places in 478 ms of which 8 ms to minimize.
[2024-05-23 00:38:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 705 ms
[2024-05-23 00:38:54] [INFO ] Computed and/alt/rep : 3689/5797/3689 causal constraints (skipped 311 transitions) in 171 ms.
Maximisation of solution failed !
Minimization took 0 ms.
[2024-05-23 00:38:57] [INFO ] [Real]Absence check using 18 positive place invariants in 77 ms returned sat
[2024-05-23 00:38:58] [INFO ] [Real]Absence check using state equation in 1419 ms returned sat
[2024-05-23 00:39:00] [INFO ] Deduced a trap composed of 1318 places in 1890 ms of which 16 ms to minimize.
[2024-05-23 00:39:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 00:39:01] [INFO ] [Nat]Absence check using 18 positive place invariants in 77 ms returned sat
[2024-05-23 00:39:02] [INFO ] [Nat]Absence check using state equation in 1373 ms returned sat
[2024-05-23 00:39:04] [INFO ] Deduced a trap composed of 1318 places in 1854 ms of which 17 ms to minimize.
[2024-05-23 00:39:06] [INFO ] Deduced a trap composed of 1237 places in 1630 ms of which 16 ms to minimize.
[2024-05-23 00:39:06] [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 9
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
FORMULA FlexibleBarrier-PT-16b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FlexibleBarrier-PT-16b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1]
Support contains 8 out of 3472 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3472/3472 places, 4001/4001 transitions.
Graph (trivial) has 3408 edges and 3472 vertex of which 98 / 3472 are part of one of the 16 SCC in 16 ms
Free SCC test removed 82 places
Drop transitions (Empty/Sink Transition effects.) removed 99 transitions
Reduce isomorphic transitions removed 99 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 851 transitions
Trivial Post-agglo rules discarded 851 transitions
Performed 851 trivial Post agglomeration. Transition count delta: 851
Iterating post reduction 0 with 851 rules applied. Total rules applied 852 place count 3390 transition count 3051
Reduce places removed 851 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 855 rules applied. Total rules applied 1707 place count 2539 transition count 3047
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 1711 place count 2535 transition count 3047
Performed 234 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 234 Pre rules applied. Total rules applied 1711 place count 2535 transition count 2813
Deduced a syphon composed of 234 places in 2 ms
Reduce places removed 234 places and 0 transitions.
Iterating global reduction 3 with 468 rules applied. Total rules applied 2179 place count 2301 transition count 2813
Discarding 1381 places :
Symmetric choice reduction at 3 with 1381 rule applications. Total rules 3560 place count 920 transition count 1432
Iterating global reduction 3 with 1381 rules applied. Total rules applied 4941 place count 920 transition count 1432
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 16 Pre rules applied. Total rules applied 4941 place count 920 transition count 1416
Deduced a syphon composed of 16 places in 2 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 4973 place count 904 transition count 1416
Discarding 223 places :
Symmetric choice reduction at 3 with 223 rule applications. Total rules 5196 place count 681 transition count 1193
Iterating global reduction 3 with 223 rules applied. Total rules applied 5419 place count 681 transition count 1193
Ensure Unique test removed 220 transitions
Reduce isomorphic transitions removed 220 transitions.
Iterating post reduction 3 with 220 rules applied. Total rules applied 5639 place count 681 transition count 973
Performed 83 Post agglomeration using F-continuation condition.Transition count delta: 83
Deduced a syphon composed of 83 places in 1 ms
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 4 with 166 rules applied. Total rules applied 5805 place count 598 transition count 890
Drop transitions (Empty/Sink Transition effects.) removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 4 with 32 rules applied. Total rules applied 5837 place count 598 transition count 858
Discarding 16 places :
Symmetric choice reduction at 5 with 16 rule applications. Total rules 5853 place count 582 transition count 842
Iterating global reduction 5 with 16 rules applied. Total rules applied 5869 place count 582 transition count 842
Free-agglomeration rule applied 487 times.
Iterating global reduction 5 with 487 rules applied. Total rules applied 6356 place count 582 transition count 355
Reduce places removed 487 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 222 transitions
Reduce isomorphic transitions removed 222 transitions.
Graph (complete) has 262 edges and 95 vertex of which 65 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.1 ms
Discarding 30 places :
Also discarding 0 output transitions
Iterating post reduction 5 with 710 rules applied. Total rules applied 7066 place count 65 transition count 133
Drop transitions (Empty/Sink Transition effects.) removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 6 with 42 rules applied. Total rules applied 7108 place count 65 transition count 91
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 7109 place count 64 transition count 90
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 50 edges and 63 vertex of which 20 / 63 are part of one of the 10 SCC in 0 ms
Free SCC test removed 10 places
Iterating post reduction 7 with 2 rules applied. Total rules applied 7111 place count 53 transition count 90
Drop transitions (Empty/Sink Transition effects.) removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 8 with 20 rules applied. Total rules applied 7131 place count 53 transition count 70
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 10 Pre rules applied. Total rules applied 7131 place count 53 transition count 60
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 9 with 20 rules applied. Total rules applied 7151 place count 43 transition count 60
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 9 with 10 rules applied. Total rules applied 7161 place count 43 transition count 50
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 10 with 20 rules applied. Total rules applied 7181 place count 33 transition count 40
Free-agglomeration rule applied 10 times.
Iterating global reduction 10 with 10 rules applied. Total rules applied 7191 place count 33 transition count 30
Reduce places removed 17 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 10 with 27 rules applied. Total rules applied 7218 place count 16 transition count 20
Free-agglomeration rule applied 2 times.
Iterating global reduction 11 with 2 rules applied. Total rules applied 7220 place count 16 transition count 18
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 7222 place count 14 transition count 18
Applied a total of 7222 rules in 697 ms. Remains 14 /3472 variables (removed 3458) and now considering 18/4001 (removed 3983) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 706 ms. Remains : 14/3472 places, 18/4001 transitions.
// Phase 1: matrix 18 rows 14 cols
[2024-05-23 00:39:07] [INFO ] Computed 4 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (2 resets) in 692 ms. (1443 steps per ms)
FORMULA FlexibleBarrier-PT-16b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-16b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-16b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-16b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-16b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-16b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-16b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-16b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000000 steps (2 resets) in 215 ms. (4629 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 84073 ms.
ITS solved all properties within timeout
BK_STOP 1716424748392
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FlexibleBarrier-PT-16b"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is FlexibleBarrier-PT-16b, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r179-tall-171640600800109"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FlexibleBarrier-PT-16b.tgz
mv FlexibleBarrier-PT-16b 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 '
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 ;