About the Execution of LoLa+red for RERS17pb114-PT-8
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 5292.691 | 1800000.00 | 1953590.00 | 3549.10 | [undef] | Time out reached |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r341-tall-167889213500083.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is RERS17pb114-PT-8, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r341-tall-167889213500083
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 73M
-rw-r--r-- 1 mcc users 6.2K Feb 26 05:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Feb 26 05:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Feb 26 05:00 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Feb 26 05:00 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 16:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Feb 25 16:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 05:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 159K Feb 26 05:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Feb 26 05:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Feb 26 05:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:39 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 2 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 73M Mar 5 18:23 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
FORMULA_NAME StableMarking
=== Now, execution of the tool begins
BK_START 1679095064328
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=lolaxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=RERS17pb114-PT-8
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-17 23:17:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2023-03-17 23:17:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-17 23:17:48] [INFO ] Load time of PNML (sax parser for PT used): 1990 ms
[2023-03-17 23:17:48] [INFO ] Transformed 1446 places.
[2023-03-17 23:17:48] [INFO ] Transformed 151085 transitions.
[2023-03-17 23:17:48] [INFO ] Parsed PT model containing 1446 places and 151085 transitions and 604252 arcs in 2560 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1559 ms. (steps per millisecond=6 ) properties (out of 1446) seen :943
Running SMT prover for 503 properties.
[2023-03-17 23:17:51] [INFO ] Flow matrix only has 84691 transitions (discarded 66394 similar events)
// Phase 1: matrix 84691 rows 1446 cols
[2023-03-17 23:17:52] [INFO ] Computed 35 place invariants in 522 ms
[2023-03-17 23:18:06] [INFO ] After 14412ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:503
[2023-03-17 23:18:19] [INFO ] [Nat]Absence check using 18 positive place invariants in 39 ms returned sat
[2023-03-17 23:18:19] [INFO ] [Nat]Absence check using 18 positive and 17 generalized place invariants in 40 ms returned sat
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:629)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.applyReachabilitySolver(GlobalPropertySolver.java:724)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:558)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preSolveLiveness(GlobalPropertySolver.java:412)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preStableMarking(GlobalPropertySolver.java:321)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:294)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:386)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-17 23:18:31] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 23:18:31] [INFO ] After 25012ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:503
Fused 503 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 503 out of 1446 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1446/1446 places, 151085/151085 transitions.
Ensure Unique test removed 17 places
Drop transitions removed 512 transitions
Reduce isomorphic transitions removed 512 transitions.
Iterating post reduction 0 with 529 rules applied. Total rules applied 529 place count 1429 transition count 150573
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 530 place count 1428 transition count 150572
Applied a total of 530 rules in 3181 ms. Remains 1428 /1446 variables (removed 18) and now considering 150572/151085 (removed 513) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3196 ms. Remains : 1428/1446 places, 150572/151085 transitions.
Interrupted random walk after 213976 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=7 ) properties seen 492
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4254 ms. (steps per millisecond=235 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 4096 ms. (steps per millisecond=244 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4053 ms. (steps per millisecond=246 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3889 ms. (steps per millisecond=257 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3694 ms. (steps per millisecond=270 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3777 ms. (steps per millisecond=264 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3791 ms. (steps per millisecond=263 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3762 ms. (steps per millisecond=265 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3785 ms. (steps per millisecond=264 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3791 ms. (steps per millisecond=263 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
[2023-03-17 23:19:44] [INFO ] Flow matrix only has 84689 transitions (discarded 65883 similar events)
// Phase 1: matrix 84689 rows 1428 cols
[2023-03-17 23:19:44] [INFO ] Computed 18 place invariants in 322 ms
[2023-03-17 23:19:45] [INFO ] After 384ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-17 23:19:45] [INFO ] [Nat]Absence check using 18 positive place invariants in 16 ms returned sat
[2023-03-17 23:20:16] [INFO ] After 30771ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-17 23:20:17] [INFO ] State equation strengthened by 773 read => feed constraints.
[2023-03-17 23:20:35] [INFO ] After 17422ms SMT Verify possible using 773 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2023-03-17 23:20:47] [INFO ] Deduced a trap composed of 64 places in 11325 ms of which 10 ms to minimize.
[2023-03-17 23:20:59] [INFO ] Deduced a trap composed of 40 places in 10442 ms of which 3 ms to minimize.
[2023-03-17 23:21:11] [INFO ] Deduced a trap composed of 64 places in 10699 ms of which 2 ms to minimize.
[2023-03-17 23:21:21] [INFO ] Deduced a trap composed of 64 places in 9243 ms of which 3 ms to minimize.
[2023-03-17 23:21:31] [INFO ] Deduced a trap composed of 40 places in 8863 ms of which 2 ms to minimize.
[2023-03-17 23:21:42] [INFO ] Deduced a trap composed of 96 places in 9063 ms of which 1 ms to minimize.
[2023-03-17 23:21:51] [INFO ] Deduced a trap composed of 96 places in 7762 ms of which 1 ms to minimize.
[2023-03-17 23:21:59] [INFO ] Deduced a trap composed of 64 places in 6663 ms of which 2 ms to minimize.
[2023-03-17 23:22:06] [INFO ] Deduced a trap composed of 64 places in 6159 ms of which 0 ms to minimize.
[2023-03-17 23:22:12] [INFO ] Deduced a trap composed of 128 places in 5231 ms of which 1 ms to minimize.
[2023-03-17 23:22:17] [INFO ] Deduced a trap composed of 64 places in 4018 ms of which 0 ms to minimize.
[2023-03-17 23:22:22] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 107154 ms
[2023-03-17 23:23:05] [INFO ] After 167474ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 11004 ms.
[2023-03-17 23:23:16] [INFO ] After 210876ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Fused 9 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 9 out of 1428 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1428/1428 places, 150572/150572 transitions.
Applied a total of 0 rules in 1183 ms. Remains 1428 /1428 variables (removed 0) and now considering 150572/150572 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1183 ms. Remains : 1428/1428 places, 150572/150572 transitions.
Interrupted random walk after 276803 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=9 ) properties seen 4
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3540 ms. (steps per millisecond=282 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3497 ms. (steps per millisecond=285 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3453 ms. (steps per millisecond=289 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3459 ms. (steps per millisecond=289 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3569 ms. (steps per millisecond=280 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-17 23:24:05] [INFO ] Flow matrix only has 84689 transitions (discarded 65883 similar events)
[2023-03-17 23:24:05] [INFO ] Invariant cache hit.
[2023-03-17 23:24:05] [INFO ] After 264ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-17 23:24:05] [INFO ] [Nat]Absence check using 18 positive place invariants in 15 ms returned sat
[2023-03-17 23:24:31] [INFO ] After 25424ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-17 23:24:32] [INFO ] State equation strengthened by 773 read => feed constraints.
[2023-03-17 23:24:45] [INFO ] After 12716ms SMT Verify possible using 773 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-17 23:24:56] [INFO ] Deduced a trap composed of 40 places in 10309 ms of which 2 ms to minimize.
[2023-03-17 23:25:07] [INFO ] Deduced a trap composed of 40 places in 10133 ms of which 4 ms to minimize.
[2023-03-17 23:25:18] [INFO ] Deduced a trap composed of 96 places in 9786 ms of which 2 ms to minimize.
[2023-03-17 23:25:29] [INFO ] Deduced a trap composed of 96 places in 9218 ms of which 1 ms to minimize.
[2023-03-17 23:25:38] [INFO ] Deduced a trap composed of 64 places in 8497 ms of which 1 ms to minimize.
[2023-03-17 23:25:48] [INFO ] Deduced a trap composed of 64 places in 8022 ms of which 1 ms to minimize.
[2023-03-17 23:25:56] [INFO ] Deduced a trap composed of 64 places in 7654 ms of which 1 ms to minimize.
[2023-03-17 23:26:05] [INFO ] Deduced a trap composed of 64 places in 7585 ms of which 1 ms to minimize.
[2023-03-17 23:26:14] [INFO ] Deduced a trap composed of 64 places in 7435 ms of which 1 ms to minimize.
[2023-03-17 23:26:21] [INFO ] Deduced a trap composed of 96 places in 6595 ms of which 1 ms to minimize.
[2023-03-17 23:26:29] [INFO ] Deduced a trap composed of 96 places in 6400 ms of which 0 ms to minimize.
[2023-03-17 23:26:36] [INFO ] Deduced a trap composed of 96 places in 5744 ms of which 1 ms to minimize.
[2023-03-17 23:26:42] [INFO ] Deduced a trap composed of 128 places in 4841 ms of which 0 ms to minimize.
[2023-03-17 23:26:46] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 121559 ms
[2023-03-17 23:27:08] [INFO ] After 155809ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 5746 ms.
[2023-03-17 23:27:13] [INFO ] After 188415ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 1428 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1428/1428 places, 150572/150572 transitions.
Applied a total of 0 rules in 1156 ms. Remains 1428 /1428 variables (removed 0) and now considering 150572/150572 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1156 ms. Remains : 1428/1428 places, 150572/150572 transitions.
Interrupted random walk after 287796 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=9 ) properties seen 2
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3475 ms. (steps per millisecond=287 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3405 ms. (steps per millisecond=293 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3375 ms. (steps per millisecond=296 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-17 23:27:55] [INFO ] Flow matrix only has 84689 transitions (discarded 65883 similar events)
[2023-03-17 23:27:55] [INFO ] Invariant cache hit.
[2023-03-17 23:27:56] [INFO ] After 182ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-17 23:27:56] [INFO ] [Nat]Absence check using 18 positive place invariants in 17 ms returned sat
[2023-03-17 23:28:19] [INFO ] After 23470ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-17 23:28:20] [INFO ] State equation strengthened by 773 read => feed constraints.
[2023-03-17 23:28:31] [INFO ] After 10728ms SMT Verify possible using 773 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-17 23:28:44] [INFO ] Deduced a trap composed of 64 places in 12509 ms of which 2 ms to minimize.
[2023-03-17 23:28:58] [INFO ] Deduced a trap composed of 64 places in 12065 ms of which 2 ms to minimize.
[2023-03-17 23:29:09] [INFO ] Deduced a trap composed of 64 places in 10561 ms of which 2 ms to minimize.
[2023-03-17 23:29:20] [INFO ] Deduced a trap composed of 40 places in 9596 ms of which 2 ms to minimize.
[2023-03-17 23:29:30] [INFO ] Deduced a trap composed of 40 places in 9386 ms of which 2 ms to minimize.
[2023-03-17 23:29:41] [INFO ] Deduced a trap composed of 64 places in 9110 ms of which 1 ms to minimize.
[2023-03-17 23:29:50] [INFO ] Deduced a trap composed of 96 places in 8673 ms of which 1 ms to minimize.
[2023-03-17 23:29:59] [INFO ] Deduced a trap composed of 96 places in 7462 ms of which 1 ms to minimize.
[2023-03-17 23:30:07] [INFO ] Deduced a trap composed of 64 places in 7088 ms of which 3 ms to minimize.
[2023-03-17 23:30:15] [INFO ] Deduced a trap composed of 64 places in 6842 ms of which 7 ms to minimize.
[2023-03-17 23:30:23] [INFO ] Deduced a trap composed of 96 places in 6460 ms of which 1 ms to minimize.
[2023-03-17 23:30:29] [INFO ] Deduced a trap composed of 128 places in 5424 ms of which 3 ms to minimize.
[2023-03-17 23:30:35] [INFO ] Deduced a trap composed of 129 places in 4640 ms of which 0 ms to minimize.
[2023-03-17 23:30:40] [INFO ] Deduced a trap composed of 96 places in 4342 ms of which 2 ms to minimize.
[2023-03-17 23:30:45] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 134216 ms
[2023-03-17 23:30:56] [INFO ] After 156200ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 3315 ms.
[2023-03-17 23:30:59] [INFO ] After 183923ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 1428 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1428/1428 places, 150572/150572 transitions.
Applied a total of 0 rules in 1298 ms. Remains 1428 /1428 variables (removed 0) and now considering 150572/150572 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1298 ms. Remains : 1428/1428 places, 150572/150572 transitions.
Interrupted random walk after 304271 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=10 ) properties seen 0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3533 ms. (steps per millisecond=283 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3542 ms. (steps per millisecond=282 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3653 ms. (steps per millisecond=273 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 207038 steps, run timeout after 120006 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 207038 steps, saw 191561 distinct states, run finished after 120009 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-17 23:33:42] [INFO ] Flow matrix only has 84689 transitions (discarded 65883 similar events)
[2023-03-17 23:33:42] [INFO ] Invariant cache hit.
[2023-03-17 23:33:42] [INFO ] After 186ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-17 23:33:42] [INFO ] [Nat]Absence check using 18 positive place invariants in 15 ms returned sat
[2023-03-17 23:34:06] [INFO ] After 23275ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-17 23:34:06] [INFO ] State equation strengthened by 773 read => feed constraints.
[2023-03-17 23:34:16] [INFO ] After 9859ms SMT Verify possible using 773 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-17 23:34:28] [INFO ] Deduced a trap composed of 64 places in 10828 ms of which 2 ms to minimize.
[2023-03-17 23:34:40] [INFO ] Deduced a trap composed of 64 places in 10824 ms of which 1 ms to minimize.
[2023-03-17 23:34:51] [INFO ] Deduced a trap composed of 64 places in 10128 ms of which 2 ms to minimize.
[2023-03-17 23:35:02] [INFO ] Deduced a trap composed of 40 places in 9501 ms of which 1 ms to minimize.
[2023-03-17 23:35:13] [INFO ] Deduced a trap composed of 40 places in 9655 ms of which 2 ms to minimize.
[2023-03-17 23:35:23] [INFO ] Deduced a trap composed of 64 places in 8943 ms of which 2 ms to minimize.
[2023-03-17 23:35:33] [INFO ] Deduced a trap composed of 96 places in 8772 ms of which 1 ms to minimize.
[2023-03-17 23:35:41] [INFO ] Deduced a trap composed of 96 places in 7364 ms of which 1 ms to minimize.
[2023-03-17 23:35:49] [INFO ] Deduced a trap composed of 64 places in 7073 ms of which 1 ms to minimize.
[2023-03-17 23:35:58] [INFO ] Deduced a trap composed of 64 places in 7135 ms of which 2 ms to minimize.
[2023-03-17 23:36:05] [INFO ] Deduced a trap composed of 96 places in 6626 ms of which 5 ms to minimize.
[2023-03-17 23:36:12] [INFO ] Deduced a trap composed of 128 places in 5332 ms of which 0 ms to minimize.
[2023-03-17 23:36:18] [INFO ] Deduced a trap composed of 129 places in 4609 ms of which 0 ms to minimize.
[2023-03-17 23:36:23] [INFO ] Deduced a trap composed of 96 places in 4316 ms of which 0 ms to minimize.
[2023-03-17 23:36:28] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 131367 ms
[2023-03-17 23:36:39] [INFO ] After 152580ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 3477 ms.
[2023-03-17 23:36:42] [INFO ] After 180357ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 1428 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1428/1428 places, 150572/150572 transitions.
Applied a total of 0 rules in 1270 ms. Remains 1428 /1428 variables (removed 0) and now considering 150572/150572 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1270 ms. Remains : 1428/1428 places, 150572/150572 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1428/1428 places, 150572/150572 transitions.
Applied a total of 0 rules in 1319 ms. Remains 1428 /1428 variables (removed 0) and now considering 150572/150572 (removed 0) transitions.
[2023-03-17 23:36:45] [INFO ] Flow matrix only has 84689 transitions (discarded 65883 similar events)
[2023-03-17 23:36:45] [INFO ] Invariant cache hit.
[2023-03-17 23:36:54] [INFO ] Implicit Places using invariants in 9078 ms returned []
Implicit Place search using SMT only with invariants took 9080 ms to find 0 implicit places.
[2023-03-17 23:36:54] [INFO ] Flow matrix only has 84689 transitions (discarded 65883 similar events)
[2023-03-17 23:36:54] [INFO ] Invariant cache hit.
[2023-03-17 23:37:24] [INFO ] Performed 94683/150572 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 23:37:42] [INFO ] Dead Transitions using invariants and state equation in 48281 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58697 ms. Remains : 1428/1428 places, 150572/150572 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 9678 ms. (steps per millisecond=10 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-17 23:37:53] [INFO ] Flow matrix only has 84689 transitions (discarded 65883 similar events)
[2023-03-17 23:37:53] [INFO ] Invariant cache hit.
[2023-03-17 23:37:53] [INFO ] [Real]Absence check using 18 positive place invariants in 11 ms returned sat
[2023-03-17 23:38:14] [INFO ] After 21113ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3
[2023-03-17 23:38:15] [INFO ] State equation strengthened by 773 read => feed constraints.
[2023-03-17 23:38:23] [INFO ] After 7529ms SMT Verify possible using 773 Read/Feed constraints in real domain returned unsat :0 sat :3
[2023-03-17 23:38:36] [INFO ] Deduced a trap composed of 64 places in 11599 ms of which 4 ms to minimize.
[2023-03-17 23:38:48] [INFO ] Deduced a trap composed of 64 places in 10760 ms of which 2 ms to minimize.
[2023-03-17 23:38:59] [INFO ] Deduced a trap composed of 64 places in 10303 ms of which 2 ms to minimize.
[2023-03-17 23:39:10] [INFO ] Deduced a trap composed of 40 places in 9760 ms of which 2 ms to minimize.
[2023-03-17 23:39:21] [INFO ] Deduced a trap composed of 40 places in 9665 ms of which 1 ms to minimize.
[2023-03-17 23:39:31] [INFO ] Deduced a trap composed of 64 places in 8860 ms of which 1 ms to minimize.
[2023-03-17 23:39:41] [INFO ] Deduced a trap composed of 96 places in 8484 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:215)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositions(AtomicReducerSR.java:267)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:46)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:225)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.applyReachabilitySolver(GlobalPropertySolver.java:724)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:558)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preSolveLiveness(GlobalPropertySolver.java:412)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preStableMarking(GlobalPropertySolver.java:321)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:294)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:386)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-17 23:39:41] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 23:39:41] [INFO ] After 108062ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Interrupted random walk after 307627 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=10 ) properties seen 1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3418 ms. (steps per millisecond=292 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3370 ms. (steps per millisecond=296 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-17 23:40:18] [INFO ] Flow matrix only has 84689 transitions (discarded 65883 similar events)
[2023-03-17 23:40:18] [INFO ] Invariant cache hit.
[2023-03-17 23:40:18] [INFO ] After 194ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-17 23:40:18] [INFO ] [Nat]Absence check using 18 positive place invariants in 17 ms returned sat
[2023-03-17 23:40:41] [INFO ] After 23117ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-17 23:40:42] [INFO ] State equation strengthened by 773 read => feed constraints.
[2023-03-17 23:40:51] [INFO ] After 8746ms SMT Verify possible using 773 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-17 23:41:03] [INFO ] Deduced a trap composed of 64 places in 11392 ms of which 4 ms to minimize.
[2023-03-17 23:41:16] [INFO ] Deduced a trap composed of 40 places in 11021 ms of which 2 ms to minimize.
[2023-03-17 23:41:27] [INFO ] Deduced a trap composed of 40 places in 10366 ms of which 2 ms to minimize.
[2023-03-17 23:41:38] [INFO ] Deduced a trap composed of 96 places in 9596 ms of which 1 ms to minimize.
[2023-03-17 23:41:48] [INFO ] Deduced a trap composed of 64 places in 9099 ms of which 2 ms to minimize.
[2023-03-17 23:41:58] [INFO ] Deduced a trap composed of 64 places in 8618 ms of which 2 ms to minimize.
[2023-03-17 23:42:06] [INFO ] Deduced a trap composed of 128 places in 7559 ms of which 0 ms to minimize.
[2023-03-17 23:42:14] [INFO ] Deduced a trap composed of 64 places in 7081 ms of which 1 ms to minimize.
[2023-03-17 23:42:22] [INFO ] Deduced a trap composed of 64 places in 6562 ms of which 1 ms to minimize.
[2023-03-17 23:42:30] [INFO ] Deduced a trap composed of 96 places in 6486 ms of which 0 ms to minimize.
[2023-03-17 23:42:36] [INFO ] Deduced a trap composed of 96 places in 5191 ms of which 1 ms to minimize.
[2023-03-17 23:42:42] [INFO ] Deduced a trap composed of 129 places in 4688 ms of which 0 ms to minimize.
[2023-03-17 23:42:47] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 115622 ms
[2023-03-17 23:42:53] [INFO ] After 130449ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 2305 ms.
[2023-03-17 23:42:55] [INFO ] After 157116ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 1428 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1428/1428 places, 150572/150572 transitions.
Applied a total of 0 rules in 1292 ms. Remains 1428 /1428 variables (removed 0) and now considering 150572/150572 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1293 ms. Remains : 1428/1428 places, 150572/150572 transitions.
Interrupted random walk after 308339 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=10 ) properties seen 1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3246 ms. (steps per millisecond=308 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-17 23:43:30] [INFO ] Flow matrix only has 84689 transitions (discarded 65883 similar events)
[2023-03-17 23:43:30] [INFO ] Invariant cache hit.
[2023-03-17 23:43:30] [INFO ] After 145ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-17 23:43:30] [INFO ] [Nat]Absence check using 18 positive place invariants in 12 ms returned sat
[2023-03-17 23:43:51] [INFO ] After 20961ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-17 23:43:52] [INFO ] State equation strengthened by 773 read => feed constraints.
[2023-03-17 23:44:00] [INFO ] After 8322ms SMT Verify possible using 773 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-17 23:44:13] [INFO ] Deduced a trap composed of 40 places in 11311 ms of which 2 ms to minimize.
[2023-03-17 23:44:25] [INFO ] Deduced a trap composed of 64 places in 10807 ms of which 2 ms to minimize.
[2023-03-17 23:44:37] [INFO ] Deduced a trap composed of 96 places in 10616 ms of which 2 ms to minimize.
[2023-03-17 23:44:48] [INFO ] Deduced a trap composed of 96 places in 10359 ms of which 2 ms to minimize.
[2023-03-17 23:45:00] [INFO ] Deduced a trap composed of 64 places in 10615 ms of which 2 ms to minimize.
[2023-03-17 23:45:10] [INFO ] Deduced a trap composed of 64 places in 9015 ms of which 2 ms to minimize.
[2023-03-17 23:45:20] [INFO ] Deduced a trap composed of 96 places in 8103 ms of which 1 ms to minimize.
[2023-03-17 23:45:30] [INFO ] Deduced a trap composed of 128 places in 8862 ms of which 2 ms to minimize.
[2023-03-17 23:45:38] [INFO ] Deduced a trap composed of 128 places in 7508 ms of which 1 ms to minimize.
[2023-03-17 23:45:48] [INFO ] Deduced a trap composed of 40 places in 8250 ms of which 1 ms to minimize.
[2023-03-17 23:45:56] [INFO ] Deduced a trap composed of 64 places in 7580 ms of which 1 ms to minimize.
[2023-03-17 23:46:04] [INFO ] Deduced a trap composed of 64 places in 6987 ms of which 1 ms to minimize.
[2023-03-17 23:46:12] [INFO ] Deduced a trap composed of 96 places in 6602 ms of which 1 ms to minimize.
[2023-03-17 23:46:18] [INFO ] Deduced a trap composed of 128 places in 4911 ms of which 0 ms to minimize.
[2023-03-17 23:46:23] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 142331 ms
[2023-03-17 23:46:24] [INFO ] After 151423ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1151 ms.
[2023-03-17 23:46:25] [INFO ] After 174586ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 1428 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1428/1428 places, 150572/150572 transitions.
Applied a total of 0 rules in 1343 ms. Remains 1428 /1428 variables (removed 0) and now considering 150572/150572 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1343 ms. Remains : 1428/1428 places, 150572/150572 transitions.
Interrupted random walk after 329003 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=10 ) properties seen 0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3260 ms. (steps per millisecond=306 ) properties (out of 1) seen :0
TIME LIMIT: Killed by timeout after 1800 seconds
MemTotal: 16393216 kB
MemFree: 11696532 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16043480 kB
BK_TIME_CONFINEMENT_REACHED
--------------------
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.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination StableMarking -timeout 180 -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="RERS17pb114-PT-8"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="lolaxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
echo " Input is RERS17pb114-PT-8, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r341-tall-167889213500083"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/RERS17pb114-PT-8.tgz
mv RERS17pb114-PT-8 execution
cd execution
if [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "UpperBounds" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] || [ "StableMarking" = "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 [ "StableMarking" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "StableMarking" != "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 "StableMarking.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property StableMarking.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "StableMarking.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 [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] ; then
echo "FORMULA_NAME StableMarking"
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 ;