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.r343-tall-167889215100088.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 ltsminxred
Input is RERS17pb114-PT-9, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r343-tall-167889215100088
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 73M
-rw-r--r-- 1 mcc users 8.7K Feb 26 05:00 CTLCardinality.txt
-rw-r--r-- 1 mcc users 99K Feb 26 05:00 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Feb 26 04:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 26 04:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.3K Feb 25 16:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Feb 25 16:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 26 05:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 162K Feb 26 05:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Feb 26 05:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 37K Feb 26 05:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K 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 1679127513227

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=ltsminxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=RERS17pb114-PT-9
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-18 08:18:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2023-03-18 08:18:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 08:18:37] [INFO ] Load time of PNML (sax parser for PT used): 2047 ms
[2023-03-18 08:18:37] [INFO ] Transformed 1446 places.
[2023-03-18 08:18:37] [INFO ] Transformed 151085 transitions.
[2023-03-18 08:18:37] [INFO ] Parsed PT model containing 1446 places and 151085 transitions and 604252 arcs in 2830 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1536 ms. (steps per millisecond=6 ) properties (out of 1446) seen :894
Running SMT prover for 552 properties.
[2023-03-18 08:18:41] [INFO ] Flow matrix only has 84691 transitions (discarded 66394 similar events)
// Phase 1: matrix 84691 rows 1446 cols
[2023-03-18 08:18:41] [INFO ] Computed 35 place invariants in 432 ms
[2023-03-18 08:18:57] [INFO ] After 16220ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:552
[2023-03-18 08:19:10] [INFO ] [Nat]Absence check using 18 positive place invariants in 25 ms returned sat
[2023-03-18 08:19:10] [INFO ] [Nat]Absence check using 18 positive and 17 generalized place invariants in 22 ms returned sat
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
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-18 08:19:22] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 08:19:22] [INFO ] After 25221ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:552
Fused 552 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 552 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 2814 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 2828 ms. Remains : 1428/1446 places, 150572/151085 transitions.
Interrupted random walk after 203020 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=6 ) properties seen 532
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 475 ms. (steps per millisecond=210 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 482 ms. (steps per millisecond=207 ) properties (out of 20) seen :2
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 441 ms. (steps per millisecond=226 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 510 ms. (steps per millisecond=196 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 441 ms. (steps per millisecond=226 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 445 ms. (steps per millisecond=224 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 442 ms. (steps per millisecond=226 ) properties (out of 18) seen :1
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 449 ms. (steps per millisecond=222 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 433 ms. (steps per millisecond=230 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 452 ms. (steps per millisecond=221 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 440 ms. (steps per millisecond=227 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 439 ms. (steps per millisecond=227 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 462 ms. (steps per millisecond=216 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 441 ms. (steps per millisecond=226 ) properties (out of 17) seen :1
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 437 ms. (steps per millisecond=228 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 435 ms. (steps per millisecond=229 ) properties (out of 16) seen :0
Running SMT prover for 16 properties.
[2023-03-18 08:20:03] [INFO ] Flow matrix only has 84689 transitions (discarded 65883 similar events)
// Phase 1: matrix 84689 rows 1428 cols
[2023-03-18 08:20:03] [INFO ] Computed 18 place invariants in 437 ms
[2023-03-18 08:20:04] [INFO ] After 524ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:16
[2023-03-18 08:20:04] [INFO ] [Nat]Absence check using 18 positive place invariants in 16 ms returned sat
[2023-03-18 08:20:42] [INFO ] After 37305ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :16
[2023-03-18 08:20:44] [INFO ] State equation strengthened by 773 read => feed constraints.
[2023-03-18 08:21:10] [INFO ] After 26345ms SMT Verify possible using 773 Read/Feed constraints in natural domain returned unsat :0 sat :16
[2023-03-18 08:21:20] [INFO ] Deduced a trap composed of 64 places in 8512 ms of which 5 ms to minimize.
[2023-03-18 08:21:29] [INFO ] Deduced a trap composed of 40 places in 7943 ms of which 3 ms to minimize.
[2023-03-18 08:21:39] [INFO ] Deduced a trap composed of 64 places in 8614 ms of which 4 ms to minimize.
[2023-03-18 08:21:48] [INFO ] Deduced a trap composed of 64 places in 7823 ms of which 3 ms to minimize.
[2023-03-18 08:21:56] [INFO ] Deduced a trap composed of 64 places in 7345 ms of which 1 ms to minimize.
[2023-03-18 08:22:04] [INFO ] Deduced a trap composed of 40 places in 6592 ms of which 1 ms to minimize.
[2023-03-18 08:22:12] [INFO ] Deduced a trap composed of 96 places in 6709 ms of which 0 ms to minimize.
[2023-03-18 08:22:18] [INFO ] Deduced a trap composed of 96 places in 5306 ms of which 2 ms to minimize.
[2023-03-18 08:22:24] [INFO ] Deduced a trap composed of 96 places in 4287 ms of which 1 ms to minimize.
[2023-03-18 08:22:28] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 77959 ms
[2023-03-18 08:23:45] [INFO ] After 181173ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :16
Attempting to minimize the solution found.
Minimization took 4240 ms.
[2023-03-18 08:23:49] [INFO ] After 225133ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :16
Fused 16 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 16 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 1237 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 1237 ms. Remains : 1428/1428 places, 150572/150572 transitions.
Interrupted random walk after 220789 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=7 ) properties seen 11
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3858 ms. (steps per millisecond=259 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4462 ms. (steps per millisecond=224 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4294 ms. (steps per millisecond=232 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4257 ms. (steps per millisecond=234 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-18 08:24:38] [INFO ] Flow matrix only has 84689 transitions (discarded 65883 similar events)
[2023-03-18 08:24:38] [INFO ] Invariant cache hit.
[2023-03-18 08:24:38] [INFO ] After 250ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-18 08:24:38] [INFO ] [Nat]Absence check using 18 positive place invariants in 16 ms returned sat
[2023-03-18 08:25:02] [INFO ] After 24300ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-18 08:25:03] [INFO ] State equation strengthened by 773 read => feed constraints.
[2023-03-18 08:25:14] [INFO ] After 10501ms SMT Verify possible using 773 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-18 08:25:27] [INFO ] Deduced a trap composed of 40 places in 12105 ms of which 3 ms to minimize.
[2023-03-18 08:25:40] [INFO ] Deduced a trap composed of 96 places in 11738 ms of which 2 ms to minimize.
[2023-03-18 08:25:53] [INFO ] Deduced a trap composed of 64 places in 11362 ms of which 2 ms to minimize.
[2023-03-18 08:26:04] [INFO ] Deduced a trap composed of 64 places in 10513 ms of which 3 ms to minimize.
[2023-03-18 08:26:16] [INFO ] Deduced a trap composed of 64 places in 10227 ms of which 1 ms to minimize.
[2023-03-18 08:26:27] [INFO ] Deduced a trap composed of 40 places in 9598 ms of which 1 ms to minimize.
[2023-03-18 08:26:37] [INFO ] Deduced a trap composed of 64 places in 8612 ms of which 2 ms to minimize.
[2023-03-18 08:26:46] [INFO ] Deduced a trap composed of 96 places in 8170 ms of which 1 ms to minimize.
[2023-03-18 08:26:55] [INFO ] Deduced a trap composed of 128 places in 7452 ms of which 1 ms to minimize.
[2023-03-18 08:27:03] [INFO ] Deduced a trap composed of 96 places in 6477 ms of which 1 ms to minimize.
[2023-03-18 08:27:09] [INFO ] Deduced a trap composed of 96 places in 4712 ms of which 0 ms to minimize.
[2023-03-18 08:27:14] [INFO ] Deduced a trap composed of 64 places in 4036 ms of which 1 ms to minimize.
[2023-03-18 08:27:19] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 124752 ms
[2023-03-18 08:27:31] [INFO ] After 147454ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 4055 ms.
[2023-03-18 08:27:35] [INFO ] After 177049ms 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 1461 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 1461 ms. Remains : 1428/1428 places, 150572/150572 transitions.
Interrupted random walk after 221699 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=7 ) properties seen 0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4395 ms. (steps per millisecond=227 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4481 ms. (steps per millisecond=223 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4246 ms. (steps per millisecond=235 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 173767 steps, run timeout after 129001 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 173767 steps, saw 160533 distinct states, run finished after 129005 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-18 08:30:29] [INFO ] Flow matrix only has 84689 transitions (discarded 65883 similar events)
[2023-03-18 08:30:29] [INFO ] Invariant cache hit.
[2023-03-18 08:30:29] [INFO ] After 206ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-18 08:30:30] [INFO ] [Nat]Absence check using 18 positive place invariants in 17 ms returned sat
[2023-03-18 08:30:55] [INFO ] After 24993ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-18 08:30:56] [INFO ] State equation strengthened by 773 read => feed constraints.
[2023-03-18 08:31:07] [INFO ] After 11128ms SMT Verify possible using 773 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-18 08:31:19] [INFO ] Deduced a trap composed of 40 places in 11068 ms of which 2 ms to minimize.
[2023-03-18 08:31:31] [INFO ] Deduced a trap composed of 96 places in 10498 ms of which 2 ms to minimize.
[2023-03-18 08:31:42] [INFO ] Deduced a trap composed of 64 places in 10164 ms of which 2 ms to minimize.
[2023-03-18 08:31:53] [INFO ] Deduced a trap composed of 64 places in 9818 ms of which 2 ms to minimize.
[2023-03-18 08:32:03] [INFO ] Deduced a trap composed of 64 places in 8594 ms of which 1 ms to minimize.
[2023-03-18 08:32:12] [INFO ] Deduced a trap composed of 40 places in 8353 ms of which 1 ms to minimize.
[2023-03-18 08:32:21] [INFO ] Deduced a trap composed of 64 places in 8079 ms of which 1 ms to minimize.
[2023-03-18 08:32:30] [INFO ] Deduced a trap composed of 96 places in 7414 ms of which 1 ms to minimize.
[2023-03-18 08:32:38] [INFO ] Deduced a trap composed of 128 places in 6643 ms of which 1 ms to minimize.
[2023-03-18 08:32:45] [INFO ] Deduced a trap composed of 96 places in 5932 ms of which 1 ms to minimize.
[2023-03-18 08:32:50] [INFO ] Deduced a trap composed of 96 places in 4573 ms of which 0 ms to minimize.
[2023-03-18 08:32:55] [INFO ] Deduced a trap composed of 64 places in 3911 ms of which 0 ms to minimize.
[2023-03-18 08:33:00] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 113207 ms
[2023-03-18 08:33:11] [INFO ] After 135553ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 3357 ms.
[2023-03-18 08:33:14] [INFO ] After 165060ms 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 1423 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 1423 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 1208 ms. Remains 1428 /1428 variables (removed 0) and now considering 150572/150572 (removed 0) transitions.
[2023-03-18 08:33:17] [INFO ] Flow matrix only has 84689 transitions (discarded 65883 similar events)
[2023-03-18 08:33:17] [INFO ] Invariant cache hit.
[2023-03-18 08:33:26] [INFO ] Implicit Places using invariants in 9080 ms returned []
Implicit Place search using SMT only with invariants took 9082 ms to find 0 implicit places.
[2023-03-18 08:33:26] [INFO ] Flow matrix only has 84689 transitions (discarded 65883 similar events)
[2023-03-18 08:33:26] [INFO ] Invariant cache hit.
[2023-03-18 08:33:56] [INFO ] Performed 95173/150572 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-18 08:34:14] [INFO ] Dead Transitions using invariants and state equation in 47984 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58299 ms. Remains : 1428/1428 places, 150572/150572 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 12794 ms. (steps per millisecond=7 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-18 08:34:28] [INFO ] Flow matrix only has 84689 transitions (discarded 65883 similar events)
[2023-03-18 08:34:28] [INFO ] Invariant cache hit.
[2023-03-18 08:34:28] [INFO ] [Real]Absence check using 18 positive place invariants in 12 ms returned sat
[2023-03-18 08:34:49] [INFO ] After 20806ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3
[2023-03-18 08:34:50] [INFO ] State equation strengthened by 773 read => feed constraints.
[2023-03-18 08:34:57] [INFO ] After 7701ms SMT Verify possible using 773 Read/Feed constraints in real domain returned unsat :0 sat :3
[2023-03-18 08:35:10] [INFO ] Deduced a trap composed of 40 places in 11521 ms of which 2 ms to minimize.
[2023-03-18 08:35:24] [INFO ] Deduced a trap composed of 96 places in 11968 ms of which 2 ms to minimize.
[2023-03-18 08:35:36] [INFO ] Deduced a trap composed of 64 places in 11397 ms of which 2 ms to minimize.
[2023-03-18 08:35:48] [INFO ] Deduced a trap composed of 64 places in 10583 ms of which 3 ms to minimize.
[2023-03-18 08:35:59] [INFO ] Deduced a trap composed of 64 places in 9640 ms of which 2 ms to minimize.
[2023-03-18 08:36:10] [INFO ] Deduced a trap composed of 40 places in 9839 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-18 08:36:10] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 08:36:10] [INFO ] After 102376ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Interrupted random walk after 265058 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=8 ) properties seen 2
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3638 ms. (steps per millisecond=274 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-18 08:36:44] [INFO ] Flow matrix only has 84689 transitions (discarded 65883 similar events)
[2023-03-18 08:36:44] [INFO ] Invariant cache hit.
[2023-03-18 08:36:44] [INFO ] After 172ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 08:36:44] [INFO ] [Nat]Absence check using 18 positive place invariants in 16 ms returned sat
[2023-03-18 08:37:06] [INFO ] After 21866ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 08:37:07] [INFO ] State equation strengthened by 773 read => feed constraints.
[2023-03-18 08:37:16] [INFO ] After 9498ms SMT Verify possible using 773 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 08:37:30] [INFO ] Deduced a trap composed of 40 places in 12035 ms of which 2 ms to minimize.
[2023-03-18 08:37:43] [INFO ] Deduced a trap composed of 64 places in 11656 ms of which 2 ms to minimize.
[2023-03-18 08:37:55] [INFO ] Deduced a trap composed of 64 places in 11379 ms of which 3 ms to minimize.
[2023-03-18 08:38:07] [INFO ] Deduced a trap composed of 64 places in 10881 ms of which 1 ms to minimize.
[2023-03-18 08:38:18] [INFO ] Deduced a trap composed of 64 places in 9481 ms of which 2 ms to minimize.
[2023-03-18 08:38:28] [INFO ] Deduced a trap composed of 96 places in 9054 ms of which 3 ms to minimize.
[2023-03-18 08:38:38] [INFO ] Deduced a trap composed of 40 places in 8100 ms of which 1 ms to minimize.
[2023-03-18 08:38:47] [INFO ] Deduced a trap composed of 96 places in 8681 ms of which 1 ms to minimize.
[2023-03-18 08:38:57] [INFO ] Deduced a trap composed of 64 places in 7834 ms of which 2 ms to minimize.
[2023-03-18 08:39:04] [INFO ] Deduced a trap composed of 96 places in 6712 ms of which 1 ms to minimize.
[2023-03-18 08:39:12] [INFO ] Deduced a trap composed of 96 places in 5983 ms of which 0 ms to minimize.
[2023-03-18 08:39:18] [INFO ] Deduced a trap composed of 128 places in 5371 ms of which 1 ms to minimize.
[2023-03-18 08:39:23] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 126353 ms
[2023-03-18 08:39:24] [INFO ] After 136612ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1305 ms.
[2023-03-18 08:39:25] [INFO ] After 160839ms 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 1482 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 1482 ms. Remains : 1428/1428 places, 150572/150572 transitions.
Finished random walk after 7748 steps, including 0 resets, run visited all 1 properties in 834 ms. (steps per millisecond=9 )
Able to resolve query StableMarking after proving 1446 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK BESTFIRST_WALK TOPOLOGICAL
Total runtime 1253459 ms.
ITS solved all properties within timeout

BK_STOP 1679128769228

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ 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-9"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is RERS17pb114-PT-9, 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 r343-tall-167889215100088"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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