About the Execution of LTSMin+red for CANConstruction-PT-080
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
7954.392 | 3600000.00 | 13474866.00 | 225.70 | ???TF?TFFTTFF?TF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2023-input.r041-tajo-167813695000679.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is CANConstruction-PT-080, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r041-tajo-167813695000679
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 10M
-rw-r--r-- 1 mcc users 11K Feb 25 22:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K Feb 25 22:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Feb 25 21:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 25 21:53 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.3K Feb 25 15:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Feb 25 15:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Feb 25 22:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 134K Feb 25 22:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Feb 25 22:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K Feb 25 22:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 15:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Feb 25 15:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 9.5M Mar 5 18:22 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME CANConstruction-PT-080-ReachabilityFireability-00
FORMULA_NAME CANConstruction-PT-080-ReachabilityFireability-01
FORMULA_NAME CANConstruction-PT-080-ReachabilityFireability-02
FORMULA_NAME CANConstruction-PT-080-ReachabilityFireability-03
FORMULA_NAME CANConstruction-PT-080-ReachabilityFireability-04
FORMULA_NAME CANConstruction-PT-080-ReachabilityFireability-05
FORMULA_NAME CANConstruction-PT-080-ReachabilityFireability-06
FORMULA_NAME CANConstruction-PT-080-ReachabilityFireability-07
FORMULA_NAME CANConstruction-PT-080-ReachabilityFireability-08
FORMULA_NAME CANConstruction-PT-080-ReachabilityFireability-09
FORMULA_NAME CANConstruction-PT-080-ReachabilityFireability-10
FORMULA_NAME CANConstruction-PT-080-ReachabilityFireability-11
FORMULA_NAME CANConstruction-PT-080-ReachabilityFireability-12
FORMULA_NAME CANConstruction-PT-080-ReachabilityFireability-13
FORMULA_NAME CANConstruction-PT-080-ReachabilityFireability-14
FORMULA_NAME CANConstruction-PT-080-ReachabilityFireability-15
=== Now, execution of the tool begins
BK_START 1678656090357
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=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANConstruction-PT-080
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 21:21:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 21:21:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 21:21:33] [INFO ] Load time of PNML (sax parser for PT used): 838 ms
[2023-03-12 21:21:33] [INFO ] Transformed 13762 places.
[2023-03-12 21:21:33] [INFO ] Transformed 26240 transitions.
[2023-03-12 21:21:34] [INFO ] Parsed PT model containing 13762 places and 26240 transitions and 78400 arcs in 1183 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 61 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 7 resets, run finished after 1102 ms. (steps per millisecond=9 ) properties (out of 16) seen :3
FORMULA CANConstruction-PT-080-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-080-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-080-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
// Phase 1: matrix 26240 rows 13762 cols
[2023-03-12 21:21:36] [INFO ] Computed 161 place invariants in 473 ms
[2023-03-12 21:21:43] [INFO ] [Real]Absence check using 81 positive place invariants in 399 ms returned sat
[2023-03-12 21:21:43] [INFO ] [Real]Absence check using 81 positive and 80 generalized place invariants in 125 ms returned sat
[2023-03-12 21:21:43] [INFO ] After 6916ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2023-03-12 21:21:49] [INFO ] [Nat]Absence check using 81 positive place invariants in 423 ms returned sat
[2023-03-12 21:21:50] [INFO ] [Nat]Absence check using 81 positive and 80 generalized place invariants in 251 ms returned sat
[2023-03-12 21:22:08] [INFO ] After 15940ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2023-03-12 21:22:09] [INFO ] State equation strengthened by 12720 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.Application.startNoEx(Application.java:902)
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-12 21:22:09] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-12 21:22:09] [INFO ] After 25249ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:13
Fused 13 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 256 out of 13762 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 13762/13762 places, 26240/26240 transitions.
Drop transitions removed 459 transitions
Trivial Post-agglo rules discarded 459 transitions
Performed 459 trivial Post agglomeration. Transition count delta: 459
Iterating post reduction 0 with 459 rules applied. Total rules applied 459 place count 13762 transition count 25781
Reduce places removed 459 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 462 rules applied. Total rules applied 921 place count 13303 transition count 25778
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 924 place count 13300 transition count 25778
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 36 Pre rules applied. Total rules applied 924 place count 13300 transition count 25742
Deduced a syphon composed of 36 places in 12 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 72 rules applied. Total rules applied 996 place count 13264 transition count 25742
Discarding 6142 places :
Symmetric choice reduction at 3 with 6142 rule applications. Total rules 7138 place count 7122 transition count 13458
Iterating global reduction 3 with 6142 rules applied. Total rules applied 13280 place count 7122 transition count 13458
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: 43
Deduced a syphon composed of 43 places in 7 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 3 with 86 rules applied. Total rules applied 13366 place count 7079 transition count 13415
Free-agglomeration rule applied 48 times.
Iterating global reduction 3 with 48 rules applied. Total rules applied 13414 place count 7079 transition count 13367
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 3 with 48 rules applied. Total rules applied 13462 place count 7031 transition count 13367
Free-agglomeration rule (complex) applied 56 times.
Iterating global reduction 4 with 56 rules applied. Total rules applied 13518 place count 7031 transition count 13311
Reduce places removed 56 places and 0 transitions.
Iterating post reduction 4 with 56 rules applied. Total rules applied 13574 place count 6975 transition count 13311
Partial Free-agglomeration rule applied 148 times.
Drop transitions removed 148 transitions
Iterating global reduction 5 with 148 rules applied. Total rules applied 13722 place count 6975 transition count 13311
Partial Free-agglomeration rule applied 25 times.
Drop transitions removed 25 transitions
Iterating global reduction 5 with 25 rules applied. Total rules applied 13747 place count 6975 transition count 13311
Applied a total of 13747 rules in 16292 ms. Remains 6975 /13762 variables (removed 6787) and now considering 13311/26240 (removed 12929) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16296 ms. Remains : 6975/13762 places, 13311/26240 transitions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 413 ms. (steps per millisecond=24 ) properties (out of 13) seen :4
FORMULA CANConstruction-PT-080-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-080-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-080-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-080-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 13311 rows 6975 cols
[2023-03-12 21:22:26] [INFO ] Computed 161 place invariants in 145 ms
[2023-03-12 21:22:29] [INFO ] [Real]Absence check using 81 positive place invariants in 365 ms returned sat
[2023-03-12 21:22:29] [INFO ] [Real]Absence check using 81 positive and 80 generalized place invariants in 200 ms returned sat
[2023-03-12 21:22:29] [INFO ] After 2894ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-12 21:22:31] [INFO ] [Nat]Absence check using 81 positive place invariants in 223 ms returned sat
[2023-03-12 21:22:31] [INFO ] [Nat]Absence check using 81 positive and 80 generalized place invariants in 91 ms returned sat
[2023-03-12 21:22:44] [INFO ] After 11070ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-12 21:22:44] [INFO ] State equation strengthened by 12850 read => feed constraints.
[2023-03-12 21:22:54] [INFO ] After 10354ms SMT Verify possible using 12850 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-12 21:22:54] [INFO ] After 10355ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-03-12 21:22:54] [INFO ] After 25047ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
FORMULA CANConstruction-PT-080-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 381 ms.
Support contains 178 out of 6975 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6975/6975 places, 13311/13311 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 6975 transition count 13310
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 6974 transition count 13310
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 8 place count 6968 transition count 13298
Iterating global reduction 2 with 6 rules applied. Total rules applied 14 place count 6968 transition count 13298
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 4 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 2 with 78 rules applied. Total rules applied 92 place count 6929 transition count 13259
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 5 places in 5 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 102 place count 6924 transition count 13260
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 103 place count 6924 transition count 13259
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 104 place count 6923 transition count 13259
Applied a total of 104 rules in 8502 ms. Remains 6923 /6975 variables (removed 52) and now considering 13259/13311 (removed 52) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8515 ms. Remains : 6923/6975 places, 13259/13311 transitions.
Incomplete random walk after 10000 steps, including 17 resets, run finished after 877 ms. (steps per millisecond=11 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 59725 steps, run timeout after 3003 ms. (steps per millisecond=19 ) properties seen :{5=1}
Probabilistic random walk after 59725 steps, saw 58317 distinct states, run finished after 3005 ms. (steps per millisecond=19 ) properties seen :1
FORMULA CANConstruction-PT-080-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 7 properties.
// Phase 1: matrix 13259 rows 6923 cols
[2023-03-12 21:23:07] [INFO ] Computed 161 place invariants in 145 ms
[2023-03-12 21:23:10] [INFO ] [Real]Absence check using 81 positive place invariants in 201 ms returned sat
[2023-03-12 21:23:10] [INFO ] [Real]Absence check using 81 positive and 80 generalized place invariants in 103 ms returned sat
[2023-03-12 21:23:10] [INFO ] After 2183ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-12 21:23:12] [INFO ] [Nat]Absence check using 81 positive place invariants in 272 ms returned sat
[2023-03-12 21:23:12] [INFO ] [Nat]Absence check using 81 positive and 80 generalized place invariants in 129 ms returned sat
[2023-03-12 21:23:29] [INFO ] After 15661ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-12 21:23:29] [INFO ] State equation strengthened by 12888 read => feed constraints.
[2023-03-12 21:23:35] [INFO ] After 6230ms SMT Verify possible using 12888 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-12 21:23:35] [INFO ] After 6231ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-12 21:23:35] [INFO ] After 25051ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 207 ms.
Support contains 176 out of 6923 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6923/6923 places, 13259/13259 transitions.
Applied a total of 0 rules in 2227 ms. Remains 6923 /6923 variables (removed 0) and now considering 13259/13259 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2239 ms. Remains : 6923/6923 places, 13259/13259 transitions.
Incomplete random walk after 10000 steps, including 17 resets, run finished after 827 ms. (steps per millisecond=12 ) properties (out of 7) seen :1
FORMULA CANConstruction-PT-080-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-03-12 21:23:38] [INFO ] Invariant cache hit.
[2023-03-12 21:23:41] [INFO ] [Real]Absence check using 81 positive place invariants in 610 ms returned sat
[2023-03-12 21:23:41] [INFO ] [Real]Absence check using 81 positive and 80 generalized place invariants in 544 ms returned sat
[2023-03-12 21:23:42] [INFO ] After 3123ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-12 21:23:43] [INFO ] [Nat]Absence check using 81 positive place invariants in 205 ms returned sat
[2023-03-12 21:23:43] [INFO ] [Nat]Absence check using 81 positive and 80 generalized place invariants in 89 ms returned sat
[2023-03-12 21:23:57] [INFO ] After 12559ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-12 21:23:57] [INFO ] State equation strengthened by 12888 read => feed constraints.
[2023-03-12 21:24:07] [INFO ] After 9808ms SMT Verify possible using 12888 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-12 21:24:07] [INFO ] After 9824ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-12 21:24:07] [INFO ] After 25048ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 204 ms.
Support contains 130 out of 6923 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6923/6923 places, 13259/13259 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 6921 transition count 13255
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 6921 transition count 13255
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 5 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 0 with 56 rules applied. Total rules applied 60 place count 6893 transition count 13227
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 16 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 64 place count 6891 transition count 13227
Applied a total of 64 rules in 7581 ms. Remains 6891 /6923 variables (removed 32) and now considering 13227/13259 (removed 32) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7581 ms. Remains : 6891/6923 places, 13227/13259 transitions.
Incomplete random walk after 10000 steps, including 17 resets, run finished after 732 ms. (steps per millisecond=13 ) properties (out of 6) seen :1
FORMULA CANConstruction-PT-080-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 13227 rows 6891 cols
[2023-03-12 21:24:16] [INFO ] Computed 161 place invariants in 125 ms
[2023-03-12 21:24:18] [INFO ] [Real]Absence check using 81 positive place invariants in 211 ms returned sat
[2023-03-12 21:24:18] [INFO ] [Real]Absence check using 81 positive and 80 generalized place invariants in 183 ms returned sat
[2023-03-12 21:24:18] [INFO ] After 2315ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-12 21:24:20] [INFO ] [Nat]Absence check using 81 positive place invariants in 267 ms returned sat
[2023-03-12 21:24:20] [INFO ] [Nat]Absence check using 81 positive and 80 generalized place invariants in 217 ms returned sat
[2023-03-12 21:24:34] [INFO ] After 13658ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-12 21:24:34] [INFO ] State equation strengthened by 12914 read => feed constraints.
[2023-03-12 21:24:43] [INFO ] After 8674ms SMT Verify possible using 12914 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-12 21:24:43] [INFO ] After 8764ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-03-12 21:24:43] [INFO ] After 25042ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 90 ms.
Support contains 129 out of 6891 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6891/6891 places, 13227/13227 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 6890 transition count 13226
Applied a total of 2 rules in 4075 ms. Remains 6890 /6891 variables (removed 1) and now considering 13226/13227 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4075 ms. Remains : 6890/6891 places, 13226/13227 transitions.
Incomplete random walk after 10000 steps, including 17 resets, run finished after 518 ms. (steps per millisecond=19 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 73564 steps, run timeout after 3001 ms. (steps per millisecond=24 ) properties seen :{}
Probabilistic random walk after 73564 steps, saw 65380 distinct states, run finished after 3003 ms. (steps per millisecond=24 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 13226 rows 6890 cols
[2023-03-12 21:24:51] [INFO ] Computed 161 place invariants in 137 ms
[2023-03-12 21:24:53] [INFO ] [Real]Absence check using 81 positive place invariants in 184 ms returned sat
[2023-03-12 21:24:53] [INFO ] [Real]Absence check using 81 positive and 80 generalized place invariants in 91 ms returned sat
[2023-03-12 21:24:53] [INFO ] After 1917ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-12 21:24:55] [INFO ] [Nat]Absence check using 81 positive place invariants in 163 ms returned sat
[2023-03-12 21:24:55] [INFO ] [Nat]Absence check using 81 positive and 80 generalized place invariants in 97 ms returned sat
[2023-03-12 21:25:04] [INFO ] After 8979ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-12 21:25:05] [INFO ] State equation strengthened by 12915 read => feed constraints.
[2023-03-12 21:25:14] [INFO ] After 9213ms SMT Verify possible using 12915 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-12 21:25:18] [INFO ] After 13564ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-12 21:25:18] [INFO ] After 25054ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 140 ms.
Support contains 129 out of 6890 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6890/6890 places, 13226/13226 transitions.
Applied a total of 0 rules in 2133 ms. Remains 6890 /6890 variables (removed 0) and now considering 13226/13226 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2133 ms. Remains : 6890/6890 places, 13226/13226 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6890/6890 places, 13226/13226 transitions.
Applied a total of 0 rules in 2106 ms. Remains 6890 /6890 variables (removed 0) and now considering 13226/13226 (removed 0) transitions.
[2023-03-12 21:25:23] [INFO ] Invariant cache hit.
[2023-03-12 21:25:29] [INFO ] Implicit Places using invariants in 6420 ms returned []
Implicit Place search using SMT only with invariants took 6421 ms to find 0 implicit places.
[2023-03-12 21:25:29] [INFO ] Invariant cache hit.
[2023-03-12 21:25:37] [INFO ] Dead Transitions using invariants and state equation in 8452 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16995 ms. Remains : 6890/6890 places, 13226/13226 transitions.
Graph (trivial) has 11392 edges and 6890 vertex of which 5081 / 6890 are part of one of the 63 SCC in 15 ms
Free SCC test removed 5018 places
Drop transitions removed 9939 transitions
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 9950 transitions.
Graph (complete) has 3814 edges and 1872 vertex of which 1743 are kept as prefixes of interest. Removing 129 places using SCC suffix rule.2 ms
Discarding 129 places :
Also discarding 57 output transitions
Drop transitions removed 57 transitions
Ensure Unique test removed 7 places
Drop transitions removed 87 transitions
Reduce isomorphic transitions removed 87 transitions.
Performed 1331 Post agglomeration using F-continuation condition.Transition count delta: 1331
Iterating post reduction 0 with 1425 rules applied. Total rules applied 1427 place count 1736 transition count 1801
Reduce places removed 1331 places and 0 transitions.
Ensure Unique test removed 1300 transitions
Reduce isomorphic transitions removed 1300 transitions.
Iterating post reduction 1 with 2631 rules applied. Total rules applied 4058 place count 405 transition count 501
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 4058 place count 405 transition count 490
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 4080 place count 394 transition count 490
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 4094 place count 380 transition count 472
Iterating global reduction 2 with 14 rules applied. Total rules applied 4108 place count 380 transition count 472
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 9 rules applied. Total rules applied 4117 place count 379 transition count 464
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 4133 place count 371 transition count 456
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 4139 place count 368 transition count 459
Drop transitions removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 3 with 11 rules applied. Total rules applied 4150 place count 368 transition count 448
Free-agglomeration rule applied 51 times.
Iterating global reduction 3 with 51 rules applied. Total rules applied 4201 place count 368 transition count 397
Ensure Unique test removed 8 places
Reduce places removed 59 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 3 with 72 rules applied. Total rules applied 4273 place count 309 transition count 384
Free-agglomeration rule applied 8 times.
Iterating global reduction 4 with 8 rules applied. Total rules applied 4281 place count 309 transition count 376
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 4289 place count 301 transition count 376
Partial Free-agglomeration rule applied 19 times.
Drop transitions removed 19 transitions
Iterating global reduction 5 with 19 rules applied. Total rules applied 4308 place count 301 transition count 376
Discarding 13 places :
Symmetric choice reduction at 5 with 13 rule applications. Total rules 4321 place count 288 transition count 363
Iterating global reduction 5 with 13 rules applied. Total rules applied 4334 place count 288 transition count 363
Reduce places removed 5 places and 5 transitions.
Iterating global reduction 5 with 5 rules applied. Total rules applied 4339 place count 283 transition count 358
Applied a total of 4339 rules in 329 ms. Remains 283 /6890 variables (removed 6607) and now considering 358/13226 (removed 12868) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 358 rows 283 cols
[2023-03-12 21:25:38] [INFO ] Computed 81 place invariants in 3 ms
[2023-03-12 21:25:38] [INFO ] [Real]Absence check using 81 positive place invariants in 10 ms returned sat
[2023-03-12 21:25:38] [INFO ] After 80ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-12 21:25:38] [INFO ] [Nat]Absence check using 81 positive place invariants in 11 ms returned sat
[2023-03-12 21:25:38] [INFO ] After 171ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-12 21:25:38] [INFO ] After 296ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 112 ms.
[2023-03-12 21:25:38] [INFO ] After 503ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
[2023-03-12 21:25:38] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 3 ms.
[2023-03-12 21:25:38] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 6890 places, 13226 transitions and 52796 arcs took 59 ms.
[2023-03-12 21:25:40] [INFO ] Flatten gal took : 1038 ms
Total runtime 247724 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --inv-bin-par --invariant=/tmp/541/inv_0_ --invariant=/tmp/541/inv_1_ --invariant=/tmp/541/inv_2_ --invariant=/tmp/541/inv_3_ --invariant=/tmp/541/inv_4_ --inv-par
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 8174144 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16081912 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//
++ 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 ReachabilityFireability -timeout 360 -rebuildPNML
mcc2023
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="CANConstruction-PT-080"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is CANConstruction-PT-080, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r041-tajo-167813695000679"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CANConstruction-PT-080.tgz
mv CANConstruction-PT-080 execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;