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-167889213500058.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-3, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r341-tall-167889213500058
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 73M
-rw-r--r-- 1 mcc users 7.9K Feb 26 04:43 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K Feb 26 04:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 26 04:39 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 26 04:39 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:38 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Feb 25 16:38 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:38 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.4K Feb 26 04:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 97K Feb 26 04:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 04:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K Feb 26 04:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:38 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:38 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 1679092537208

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-3
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-17 22:35:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2023-03-17 22:35:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-17 22:35:42] [INFO ] Load time of PNML (sax parser for PT used): 4267 ms
[2023-03-17 22:35:44] [INFO ] Transformed 1446 places.
[2023-03-17 22:35:44] [INFO ] Transformed 151085 transitions.
[2023-03-17 22:35:44] [INFO ] Parsed PT model containing 1446 places and 151085 transitions and 604252 arcs in 5659 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1791 ms. (steps per millisecond=5 ) properties (out of 1446) seen :1142
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=7 ) properties (out of 304) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=5 ) properties (out of 304) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=5 ) properties (out of 304) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=7 ) properties (out of 304) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=7 ) properties (out of 304) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=7 ) properties (out of 304) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=7 ) properties (out of 304) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=8 ) properties (out of 304) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=8 ) properties (out of 304) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=7 ) properties (out of 304) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=7 ) properties (out of 304) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=8 ) properties (out of 304) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=8 ) properties (out of 304) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=7 ) properties (out of 304) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=8 ) properties (out of 304) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=7 ) properties (out of 304) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=7 ) properties (out of 304) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=7 ) properties (out of 304) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=8 ) properties (out of 304) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=8 ) properties (out of 304) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=8 ) properties (out of 304) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=7 ) properties (out of 304) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=7 ) properties (out of 304) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=7 ) properties (out of 304) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=7 ) properties (out of 304) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=7 ) properties (out of 304) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=7 ) properties (out of 304) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=7 ) properties (out of 304) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=7 ) properties (out of 304) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=7 ) properties (out of 304) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=7 ) properties (out of 304) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=7 ) properties (out of 304) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=7 ) properties (out of 304) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=7 ) properties (out of 304) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=7 ) properties (out of 304) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=8 ) properties (out of 304) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=7 ) properties (out of 304) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=8 ) properties (out of 304) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=7 ) properties (out of 304) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=7 ) properties (out of 304) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=8 ) properties (out of 304) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=6 ) properties (out of 304) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=5 ) properties (out of 304) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=8 ) properties (out of 304) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=8 ) properties (out of 304) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=8 ) properties (out of 304) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=8 ) properties (out of 304) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=8 ) properties (out of 304) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=7 ) properties (out of 304) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=7 ) properties (out of 304) seen :0
Running SMT prover for 304 properties.
[2023-03-17 22:35:48] [INFO ] Flow matrix only has 84691 transitions (discarded 66394 similar events)
// Phase 1: matrix 84691 rows 1446 cols
[2023-03-17 22:35:49] [INFO ] Computed 35 place invariants in 446 ms
[2023-03-17 22:35:57] [INFO ] After 8192ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:304
[2023-03-17 22:36:03] [INFO ] [Nat]Absence check using 18 positive place invariants in 26 ms returned sat
[2023-03-17 22:36:03] [INFO ] [Nat]Absence check using 18 positive and 17 generalized place invariants in 27 ms returned sat
[2023-03-17 22:36:22] [INFO ] After 11009ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :303
[2023-03-17 22:36:24] [INFO ] State equation strengthened by 2342 read => feed constraints.
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.verifyPossible(DeadlockTester.java:642)
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 22:36:24] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 22:36:24] [INFO ] After 27264ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:304
Fused 304 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 304 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 3347 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 3364 ms. Remains : 1428/1446 places, 150572/151085 transitions.
Interrupted random walk after 267467 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=8 ) properties seen 300
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3318 ms. (steps per millisecond=301 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3354 ms. (steps per millisecond=298 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3290 ms. (steps per millisecond=303 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3239 ms. (steps per millisecond=308 ) properties (out of 3) seen :1
Running SMT prover for 2 properties.
[2023-03-17 22:37:11] [INFO ] Flow matrix only has 84689 transitions (discarded 65883 similar events)
// Phase 1: matrix 84689 rows 1428 cols
[2023-03-17 22:37:11] [INFO ] Computed 18 place invariants in 309 ms
[2023-03-17 22:37:12] [INFO ] After 195ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-17 22:37:12] [INFO ] [Nat]Absence check using 18 positive place invariants in 11 ms returned sat
[2023-03-17 22:37:34] [INFO ] After 21694ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-17 22:37:35] [INFO ] State equation strengthened by 773 read => feed constraints.
[2023-03-17 22:37:43] [INFO ] After 8694ms SMT Verify possible using 773 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-17 22:37:56] [INFO ] Deduced a trap composed of 40 places in 11581 ms of which 16 ms to minimize.
[2023-03-17 22:38:09] [INFO ] Deduced a trap composed of 64 places in 11544 ms of which 2 ms to minimize.
[2023-03-17 22:38:20] [INFO ] Deduced a trap composed of 96 places in 9768 ms of which 3 ms to minimize.
[2023-03-17 22:38:29] [INFO ] Deduced a trap composed of 40 places in 8531 ms of which 2 ms to minimize.
[2023-03-17 22:38:39] [INFO ] Deduced a trap composed of 64 places in 8393 ms of which 1 ms to minimize.
[2023-03-17 22:38:48] [INFO ] Deduced a trap composed of 64 places in 8279 ms of which 1 ms to minimize.
[2023-03-17 22:38:57] [INFO ] Deduced a trap composed of 64 places in 7504 ms of which 1 ms to minimize.
[2023-03-17 22:39:05] [INFO ] Deduced a trap composed of 96 places in 7347 ms of which 1 ms to minimize.
[2023-03-17 22:39:13] [INFO ] Deduced a trap composed of 128 places in 7014 ms of which 0 ms to minimize.
[2023-03-17 22:39:21] [INFO ] Deduced a trap composed of 64 places in 6409 ms of which 1 ms to minimize.
[2023-03-17 22:39:28] [INFO ] Deduced a trap composed of 64 places in 5622 ms of which 0 ms to minimize.
[2023-03-17 22:39:34] [INFO ] Deduced a trap composed of 96 places in 5407 ms of which 1 ms to minimize.
[2023-03-17 22:39:39] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 115378 ms
[2023-03-17 22:39:45] [INFO ] After 130046ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 2272 ms.
[2023-03-17 22:39:47] [INFO ] After 155167ms 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 1198 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 1198 ms. Remains : 1428/1428 places, 150572/150572 transitions.
Interrupted random walk after 309622 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 3283 ms. (steps per millisecond=304 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3213 ms. (steps per millisecond=311 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 182857 steps, run timeout after 108003 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 182857 steps, saw 168668 distinct states, run finished after 108007 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-17 22:42:13] [INFO ] Flow matrix only has 84689 transitions (discarded 65883 similar events)
[2023-03-17 22:42:13] [INFO ] Invariant cache hit.
[2023-03-17 22:42:13] [INFO ] After 180ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-17 22:42:13] [INFO ] [Nat]Absence check using 18 positive place invariants in 17 ms returned sat
[2023-03-17 22:42:36] [INFO ] After 22218ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-17 22:42:36] [INFO ] State equation strengthened by 773 read => feed constraints.
[2023-03-17 22:42:46] [INFO ] After 9519ms SMT Verify possible using 773 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-17 22:42:59] [INFO ] Deduced a trap composed of 64 places in 11700 ms of which 5 ms to minimize.
[2023-03-17 22:43:11] [INFO ] Deduced a trap composed of 40 places in 11282 ms of which 3 ms to minimize.
[2023-03-17 22:43:23] [INFO ] Deduced a trap composed of 40 places in 10946 ms of which 2 ms to minimize.
[2023-03-17 22:43:35] [INFO ] Deduced a trap composed of 96 places in 10586 ms of which 2 ms to minimize.
[2023-03-17 22:43:46] [INFO ] Deduced a trap composed of 64 places in 9660 ms of which 2 ms to minimize.
[2023-03-17 22:43:56] [INFO ] Deduced a trap composed of 64 places in 8870 ms of which 1 ms to minimize.
[2023-03-17 22:44:05] [INFO ] Deduced a trap composed of 128 places in 7638 ms of which 1 ms to minimize.
[2023-03-17 22:44:13] [INFO ] Deduced a trap composed of 64 places in 7033 ms of which 1 ms to minimize.
[2023-03-17 22:44:21] [INFO ] Deduced a trap composed of 64 places in 6561 ms of which 0 ms to minimize.
[2023-03-17 22:44:28] [INFO ] Deduced a trap composed of 96 places in 6532 ms of which 0 ms to minimize.
[2023-03-17 22:44:35] [INFO ] Deduced a trap composed of 96 places in 5180 ms of which 0 ms to minimize.
[2023-03-17 22:44:40] [INFO ] Deduced a trap composed of 129 places in 4657 ms of which 0 ms to minimize.
[2023-03-17 22:44:45] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 119242 ms
[2023-03-17 22:44:51] [INFO ] After 134889ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 2352 ms.
[2023-03-17 22:44:53] [INFO ] After 160335ms 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 1334 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 1334 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 1299 ms. Remains 1428 /1428 variables (removed 0) and now considering 150572/150572 (removed 0) transitions.
[2023-03-17 22:44:56] [INFO ] Flow matrix only has 84689 transitions (discarded 65883 similar events)
[2023-03-17 22:44:56] [INFO ] Invariant cache hit.
[2023-03-17 22:45:05] [INFO ] Implicit Places using invariants in 8591 ms returned []
Implicit Place search using SMT only with invariants took 8592 ms to find 0 implicit places.
[2023-03-17 22:45:05] [INFO ] Flow matrix only has 84689 transitions (discarded 65883 similar events)
[2023-03-17 22:45:05] [INFO ] Invariant cache hit.
[2023-03-17 22:45:35] [INFO ] Performed 94375/150572 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 22:45:54] [INFO ] Dead Transitions using invariants and state equation in 48862 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58773 ms. Remains : 1428/1428 places, 150572/150572 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 12703 ms. (steps per millisecond=7 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-17 22:46:07] [INFO ] Flow matrix only has 84689 transitions (discarded 65883 similar events)
[2023-03-17 22:46:07] [INFO ] Invariant cache hit.
[2023-03-17 22:46:07] [INFO ] [Real]Absence check using 18 positive place invariants in 12 ms returned sat
[2023-03-17 22:46:27] [INFO ] After 20434ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2023-03-17 22:46:28] [INFO ] State equation strengthened by 773 read => feed constraints.
[2023-03-17 22:46:36] [INFO ] After 7824ms SMT Verify possible using 773 Read/Feed constraints in real domain returned unsat :0 sat :2
[2023-03-17 22:46:49] [INFO ] Deduced a trap composed of 64 places in 11221 ms of which 2 ms to minimize.
[2023-03-17 22:47:02] [INFO ] Deduced a trap composed of 40 places in 11931 ms of which 3 ms to minimize.
[2023-03-17 22:47:15] [INFO ] Deduced a trap composed of 40 places in 11762 ms of which 2 ms to minimize.
[2023-03-17 22:47:26] [INFO ] Deduced a trap composed of 96 places in 10100 ms of which 1 ms to minimize.
[2023-03-17 22:47:37] [INFO ] Deduced a trap composed of 64 places in 9104 ms of which 2 ms to minimize.
[2023-03-17 22:47:47] [INFO ] Deduced a trap composed of 64 places in 8980 ms of which 3 ms to minimize.
[2023-03-17 22:48:00] [INFO ] Deduced a trap composed of 4 places in 12655 ms of which 3 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 22:48:00] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 22:48:00] [INFO ] After 112690ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Interrupted random walk after 301563 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 3272 ms. (steps per millisecond=305 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-17 22:48:33] [INFO ] Flow matrix only has 84689 transitions (discarded 65883 similar events)
[2023-03-17 22:48:33] [INFO ] Invariant cache hit.
[2023-03-17 22:48:33] [INFO ] After 152ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-17 22:48:33] [INFO ] [Nat]Absence check using 18 positive place invariants in 13 ms returned sat
[2023-03-17 22:48:54] [INFO ] After 21155ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-17 22:48:55] [INFO ] State equation strengthened by 773 read => feed constraints.
[2023-03-17 22:49:03] [INFO ] After 8226ms SMT Verify possible using 773 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-17 22:49:16] [INFO ] Deduced a trap composed of 40 places in 11818 ms of which 3 ms to minimize.
[2023-03-17 22:49:29] [INFO ] Deduced a trap composed of 64 places in 11158 ms of which 6 ms to minimize.
[2023-03-17 22:49:41] [INFO ] Deduced a trap composed of 96 places in 11021 ms of which 2 ms to minimize.
[2023-03-17 22:49:52] [INFO ] Deduced a trap composed of 96 places in 10350 ms of which 2 ms to minimize.
[2023-03-17 22:50:03] [INFO ] Deduced a trap composed of 64 places in 9623 ms of which 2 ms to minimize.
[2023-03-17 22:50:13] [INFO ] Deduced a trap composed of 64 places in 9163 ms of which 1 ms to minimize.
[2023-03-17 22:50:23] [INFO ] Deduced a trap composed of 96 places in 8561 ms of which 2 ms to minimize.
[2023-03-17 22:50:33] [INFO ] Deduced a trap composed of 128 places in 8373 ms of which 2 ms to minimize.
[2023-03-17 22:50:42] [INFO ] Deduced a trap composed of 64 places in 8109 ms of which 1 ms to minimize.
[2023-03-17 22:50:51] [INFO ] Deduced a trap composed of 64 places in 8059 ms of which 2 ms to minimize.
[2023-03-17 22:51:00] [INFO ] Deduced a trap composed of 40 places in 7693 ms of which 0 ms to minimize.
[2023-03-17 22:51:09] [INFO ] Deduced a trap composed of 96 places in 7457 ms of which 1 ms to minimize.
[2023-03-17 22:51:17] [INFO ] Deduced a trap composed of 96 places in 6807 ms of which 0 ms to minimize.
[2023-03-17 22:51:23] [INFO ] Deduced a trap composed of 128 places in 4945 ms of which 0 ms to minimize.
[2023-03-17 22:51:28] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 144095 ms
[2023-03-17 22:51:28] [INFO ] After 153073ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1178 ms.
[2023-03-17 22:51:29] [INFO ] After 176280ms 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 1381 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 1381 ms. Remains : 1428/1428 places, 150572/150572 transitions.
Finished random walk after 121566 steps, including 0 resets, run visited all 1 properties in 11360 ms. (steps per millisecond=10 )
Able to resolve query StableMarking after proving 1446 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK BESTFIRST_WALK TOPOLOGICAL
Total runtime 964426 ms.
ITS solved all properties within timeout

BK_STOP 1679093503941

--------------------
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-3"
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-3, 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-167889213500058"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/RERS17pb114-PT-3.tgz
mv RERS17pb114-PT-3 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 '' StableMarking.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;