About the Execution of Smart+red for ShieldPPPt-PT-040B
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 994.659 | 162146.00 | 220796.00 | 79.70 | ??T???T?TT??TTF? | normal |
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.r395-oct2-167903719100671.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool smartxred
Input is ShieldPPPt-PT-040B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r395-oct2-167903719100671
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 6.1K Feb 25 20:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Feb 25 20:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Feb 25 20:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K Feb 25 20:46 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 17:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 17:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 17:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 20:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K Feb 25 20:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Feb 25 20:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K Feb 25 20:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 17:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 762K 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
here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityFireability-00
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityFireability-01
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityFireability-02
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityFireability-03
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityFireability-04
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityFireability-05
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityFireability-06
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityFireability-07
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityFireability-08
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityFireability-09
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityFireability-10
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityFireability-11
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityFireability-12
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityFireability-13
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityFireability-14
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityFireability-15
=== Now, execution of the tool begins
BK_START 1679577477019
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=smartxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPt-PT-040B
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-23 13:17:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-23 13:17:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 13:18:00] [INFO ] Load time of PNML (sax parser for PT used): 189 ms
[2023-03-23 13:18:00] [INFO ] Transformed 3123 places.
[2023-03-23 13:18:00] [INFO ] Transformed 2843 transitions.
[2023-03-23 13:18:00] [INFO ] Found NUPN structural information;
[2023-03-23 13:18:00] [INFO ] Parsed PT model containing 3123 places and 2843 transitions and 7126 arcs in 416 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 592 ms. (steps per millisecond=16 ) properties (out of 16) seen :6
FORMULA ShieldPPPt-PT-040B-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-040B-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-040B-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-040B-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-040B-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-040B-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 10) 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 10) 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 10) 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 10) 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 10) 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 10) 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 10) 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 10) 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 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 2843 rows 3123 cols
[2023-03-23 13:18:01] [INFO ] Computed 441 place invariants in 53 ms
[2023-03-23 13:18:03] [INFO ] After 1525ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-23 13:18:04] [INFO ] [Nat]Absence check using 441 positive place invariants in 331 ms returned sat
[2023-03-23 13:18:15] [INFO ] After 10344ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-23 13:18:17] [INFO ] Deduced a trap composed of 20 places in 1204 ms of which 15 ms to minimize.
[2023-03-23 13:18:18] [INFO ] Deduced a trap composed of 25 places in 1495 ms of which 3 ms to minimize.
[2023-03-23 13:18:20] [INFO ] Deduced a trap composed of 18 places in 1107 ms of which 3 ms to minimize.
[2023-03-23 13:18:21] [INFO ] Deduced a trap composed of 22 places in 1272 ms of which 17 ms to minimize.
[2023-03-23 13:18:22] [INFO ] Deduced a trap composed of 26 places in 1100 ms of which 6 ms to minimize.
[2023-03-23 13:18:24] [INFO ] Deduced a trap composed of 24 places in 1027 ms of which 2 ms to minimize.
[2023-03-23 13:18:25] [INFO ] Deduced a trap composed of 35 places in 919 ms of which 13 ms to minimize.
[2023-03-23 13:18:26] [INFO ] Deduced a trap composed of 32 places in 921 ms of which 2 ms to minimize.
[2023-03-23 13:18:27] [INFO ] Deduced a trap composed of 28 places in 892 ms of which 2 ms to minimize.
[2023-03-23 13:18:28] [INFO ] Deduced a trap composed of 31 places in 753 ms of which 2 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: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-23 13:18:28] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-23 13:18:28] [INFO ] After 25266ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:10
FORMULA ShieldPPPt-PT-040B-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 1731 ms.
Support contains 207 out of 3123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3123/3123 places, 2843/2843 transitions.
Drop transitions removed 585 transitions
Trivial Post-agglo rules discarded 585 transitions
Performed 585 trivial Post agglomeration. Transition count delta: 585
Iterating post reduction 0 with 585 rules applied. Total rules applied 585 place count 3123 transition count 2258
Reduce places removed 585 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 1 with 587 rules applied. Total rules applied 1172 place count 2538 transition count 2256
Reduce places removed 1 places and 0 transitions.
Performed 69 Post agglomeration using F-continuation condition.Transition count delta: 69
Iterating post reduction 2 with 70 rules applied. Total rules applied 1242 place count 2537 transition count 2187
Reduce places removed 69 places and 0 transitions.
Iterating post reduction 3 with 69 rules applied. Total rules applied 1311 place count 2468 transition count 2187
Performed 170 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 170 Pre rules applied. Total rules applied 1311 place count 2468 transition count 2017
Deduced a syphon composed of 170 places in 5 ms
Reduce places removed 170 places and 0 transitions.
Iterating global reduction 4 with 340 rules applied. Total rules applied 1651 place count 2298 transition count 2017
Discarding 265 places :
Symmetric choice reduction at 4 with 265 rule applications. Total rules 1916 place count 2033 transition count 1752
Iterating global reduction 4 with 265 rules applied. Total rules applied 2181 place count 2033 transition count 1752
Performed 84 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 84 Pre rules applied. Total rules applied 2181 place count 2033 transition count 1668
Deduced a syphon composed of 84 places in 12 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 4 with 168 rules applied. Total rules applied 2349 place count 1949 transition count 1668
Performed 606 Post agglomeration using F-continuation condition.Transition count delta: 606
Deduced a syphon composed of 606 places in 5 ms
Reduce places removed 606 places and 0 transitions.
Iterating global reduction 4 with 1212 rules applied. Total rules applied 3561 place count 1343 transition count 1062
Renaming transitions due to excessive name length > 1024 char.
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 72 places in 2 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 4 with 144 rules applied. Total rules applied 3705 place count 1271 transition count 1062
Free-agglomeration rule applied 8 times.
Iterating global reduction 4 with 8 rules applied. Total rules applied 3713 place count 1271 transition count 1054
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 3721 place count 1263 transition count 1054
Partial Free-agglomeration rule applied 97 times.
Drop transitions removed 97 transitions
Iterating global reduction 5 with 97 rules applied. Total rules applied 3818 place count 1263 transition count 1054
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 3819 place count 1262 transition count 1053
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 3820 place count 1261 transition count 1053
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 3820 place count 1261 transition count 1051
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 3824 place count 1259 transition count 1051
Applied a total of 3824 rules in 1143 ms. Remains 1259 /3123 variables (removed 1864) and now considering 1051/2843 (removed 1792) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1144 ms. Remains : 1259/3123 places, 1051/2843 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 433 ms. (steps per millisecond=23 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 9) seen :0
Interrupted probabilistic random walk after 67924 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :{}
Probabilistic random walk after 67924 steps, saw 50435 distinct states, run finished after 3004 ms. (steps per millisecond=22 ) properties seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 1051 rows 1259 cols
[2023-03-23 13:18:35] [INFO ] Computed 440 place invariants in 4 ms
[2023-03-23 13:18:35] [INFO ] After 430ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-23 13:18:36] [INFO ] [Nat]Absence check using 440 positive place invariants in 114 ms returned sat
[2023-03-23 13:18:38] [INFO ] After 1699ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-23 13:18:38] [INFO ] State equation strengthened by 117 read => feed constraints.
[2023-03-23 13:18:40] [INFO ] After 1743ms SMT Verify possible using 117 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2023-03-23 13:18:40] [INFO ] Deduced a trap composed of 6 places in 238 ms of which 1 ms to minimize.
[2023-03-23 13:18:41] [INFO ] Deduced a trap composed of 8 places in 292 ms of which 1 ms to minimize.
[2023-03-23 13:18:41] [INFO ] Deduced a trap composed of 3 places in 148 ms of which 1 ms to minimize.
[2023-03-23 13:18:41] [INFO ] Deduced a trap composed of 3 places in 261 ms of which 0 ms to minimize.
[2023-03-23 13:18:41] [INFO ] Deduced a trap composed of 7 places in 176 ms of which 0 ms to minimize.
[2023-03-23 13:18:42] [INFO ] Deduced a trap composed of 7 places in 214 ms of which 1 ms to minimize.
[2023-03-23 13:18:42] [INFO ] Deduced a trap composed of 5 places in 144 ms of which 0 ms to minimize.
[2023-03-23 13:18:42] [INFO ] Deduced a trap composed of 9 places in 144 ms of which 1 ms to minimize.
[2023-03-23 13:18:42] [INFO ] Deduced a trap composed of 9 places in 229 ms of which 1 ms to minimize.
[2023-03-23 13:18:43] [INFO ] Deduced a trap composed of 9 places in 271 ms of which 1 ms to minimize.
[2023-03-23 13:18:43] [INFO ] Deduced a trap composed of 5 places in 276 ms of which 1 ms to minimize.
[2023-03-23 13:18:43] [INFO ] Deduced a trap composed of 10 places in 239 ms of which 1 ms to minimize.
[2023-03-23 13:18:44] [INFO ] Deduced a trap composed of 10 places in 186 ms of which 1 ms to minimize.
[2023-03-23 13:18:44] [INFO ] Deduced a trap composed of 10 places in 198 ms of which 1 ms to minimize.
[2023-03-23 13:18:44] [INFO ] Deduced a trap composed of 6 places in 193 ms of which 1 ms to minimize.
[2023-03-23 13:18:45] [INFO ] Deduced a trap composed of 8 places in 223 ms of which 1 ms to minimize.
[2023-03-23 13:18:45] [INFO ] Deduced a trap composed of 7 places in 174 ms of which 0 ms to minimize.
[2023-03-23 13:18:45] [INFO ] Deduced a trap composed of 10 places in 374 ms of which 1 ms to minimize.
[2023-03-23 13:18:46] [INFO ] Deduced a trap composed of 9 places in 172 ms of which 1 ms to minimize.
[2023-03-23 13:18:46] [INFO ] Deduced a trap composed of 10 places in 175 ms of which 0 ms to minimize.
[2023-03-23 13:18:47] [INFO ] Deduced a trap composed of 11 places in 267 ms of which 1 ms to minimize.
[2023-03-23 13:18:48] [INFO ] Deduced a trap composed of 8 places in 248 ms of which 1 ms to minimize.
[2023-03-23 13:18:48] [INFO ] Deduced a trap composed of 13 places in 225 ms of which 0 ms to minimize.
[2023-03-23 13:18:48] [INFO ] Deduced a trap composed of 13 places in 220 ms of which 1 ms to minimize.
[2023-03-23 13:18:49] [INFO ] Deduced a trap composed of 11 places in 304 ms of which 1 ms to minimize.
[2023-03-23 13:18:49] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 9031 ms
[2023-03-23 13:18:50] [INFO ] Deduced a trap composed of 7 places in 267 ms of which 1 ms to minimize.
[2023-03-23 13:18:50] [INFO ] Deduced a trap composed of 9 places in 246 ms of which 1 ms to minimize.
[2023-03-23 13:18:50] [INFO ] Deduced a trap composed of 9 places in 272 ms of which 1 ms to minimize.
[2023-03-23 13:18:51] [INFO ] Deduced a trap composed of 13 places in 218 ms of which 0 ms to minimize.
[2023-03-23 13:18:51] [INFO ] Deduced a trap composed of 12 places in 197 ms of which 1 ms to minimize.
[2023-03-23 13:18:51] [INFO ] Deduced a trap composed of 14 places in 198 ms of which 0 ms to minimize.
[2023-03-23 13:18:52] [INFO ] Deduced a trap composed of 8 places in 228 ms of which 1 ms to minimize.
[2023-03-23 13:18:52] [INFO ] Deduced a trap composed of 11 places in 209 ms of which 2 ms to minimize.
[2023-03-23 13:18:52] [INFO ] Deduced a trap composed of 13 places in 196 ms of which 1 ms to minimize.
[2023-03-23 13:18:52] [INFO ] Deduced a trap composed of 12 places in 205 ms of which 2 ms to minimize.
[2023-03-23 13:18:53] [INFO ] Deduced a trap composed of 14 places in 221 ms of which 0 ms to minimize.
[2023-03-23 13:18:53] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 3418 ms
[2023-03-23 13:18:53] [INFO ] Deduced a trap composed of 4 places in 261 ms of which 1 ms to minimize.
[2023-03-23 13:18:53] [INFO ] Deduced a trap composed of 9 places in 209 ms of which 0 ms to minimize.
[2023-03-23 13:18:54] [INFO ] Deduced a trap composed of 11 places in 171 ms of which 0 ms to minimize.
[2023-03-23 13:18:54] [INFO ] Deduced a trap composed of 7 places in 249 ms of which 1 ms to minimize.
[2023-03-23 13:18:54] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1185 ms
[2023-03-23 13:18:54] [INFO ] Deduced a trap composed of 11 places in 186 ms of which 14 ms to minimize.
[2023-03-23 13:18:55] [INFO ] Deduced a trap composed of 16 places in 227 ms of which 1 ms to minimize.
[2023-03-23 13:18:55] [INFO ] Deduced a trap composed of 14 places in 282 ms of which 1 ms to minimize.
[2023-03-23 13:18:55] [INFO ] Deduced a trap composed of 8 places in 238 ms of which 1 ms to minimize.
[2023-03-23 13:18:55] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1223 ms
[2023-03-23 13:18:56] [INFO ] Deduced a trap composed of 7 places in 238 ms of which 0 ms to minimize.
[2023-03-23 13:18:56] [INFO ] Deduced a trap composed of 9 places in 294 ms of which 11 ms to minimize.
[2023-03-23 13:18:57] [INFO ] Deduced a trap composed of 8 places in 189 ms of which 0 ms to minimize.
[2023-03-23 13:18:57] [INFO ] Deduced a trap composed of 5 places in 245 ms of which 0 ms to minimize.
[2023-03-23 13:18:57] [INFO ] Deduced a trap composed of 7 places in 269 ms of which 0 ms to minimize.
[2023-03-23 13:18:58] [INFO ] Deduced a trap composed of 4 places in 195 ms of which 26 ms to minimize.
[2023-03-23 13:18:58] [INFO ] Deduced a trap composed of 10 places in 144 ms of which 1 ms to minimize.
[2023-03-23 13:18:58] [INFO ] Deduced a trap composed of 11 places in 221 ms of which 1 ms to minimize.
[2023-03-23 13:18:58] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2485 ms
[2023-03-23 13:18:59] [INFO ] Deduced a trap composed of 13 places in 206 ms of which 1 ms to minimize.
[2023-03-23 13:18:59] [INFO ] Deduced a trap composed of 7 places in 239 ms of which 14 ms to minimize.
[2023-03-23 13:18:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 650 ms
[2023-03-23 13:18:59] [INFO ] After 21491ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 1002 ms.
[2023-03-23 13:19:00] [INFO ] After 25018ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 415 ms.
Support contains 207 out of 1259 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1259/1259 places, 1051/1051 transitions.
Applied a total of 0 rules in 84 ms. Remains 1259 /1259 variables (removed 0) and now considering 1051/1051 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 84 ms. Remains : 1259/1259 places, 1051/1051 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1259/1259 places, 1051/1051 transitions.
Applied a total of 0 rules in 66 ms. Remains 1259 /1259 variables (removed 0) and now considering 1051/1051 (removed 0) transitions.
[2023-03-23 13:19:01] [INFO ] Invariant cache hit.
[2023-03-23 13:19:02] [INFO ] Implicit Places using invariants in 718 ms returned [1240, 1244]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 735 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1257/1259 places, 1051/1051 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1255 transition count 1049
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1255 transition count 1049
Applied a total of 4 rules in 62 ms. Remains 1255 /1257 variables (removed 2) and now considering 1049/1051 (removed 2) transitions.
// Phase 1: matrix 1049 rows 1255 cols
[2023-03-23 13:19:02] [INFO ] Computed 438 place invariants in 4 ms
[2023-03-23 13:19:02] [INFO ] Implicit Places using invariants in 629 ms returned []
[2023-03-23 13:19:02] [INFO ] Invariant cache hit.
[2023-03-23 13:19:03] [INFO ] State equation strengthened by 115 read => feed constraints.
[2023-03-23 13:19:05] [INFO ] Implicit Places using invariants and state equation in 2719 ms returned []
Implicit Place search using SMT with State Equation took 3375 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1255/1259 places, 1049/1051 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 4244 ms. Remains : 1255/1259 places, 1049/1051 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 374 ms. (steps per millisecond=26 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 9) seen :0
Interrupted probabilistic random walk after 80827 steps, run timeout after 3001 ms. (steps per millisecond=26 ) properties seen :{}
Probabilistic random walk after 80827 steps, saw 57940 distinct states, run finished after 3001 ms. (steps per millisecond=26 ) properties seen :0
Running SMT prover for 9 properties.
[2023-03-23 13:19:09] [INFO ] Invariant cache hit.
[2023-03-23 13:19:10] [INFO ] After 334ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-23 13:19:10] [INFO ] [Nat]Absence check using 438 positive place invariants in 198 ms returned sat
[2023-03-23 13:19:12] [INFO ] After 1567ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-23 13:19:12] [INFO ] State equation strengthened by 115 read => feed constraints.
[2023-03-23 13:19:14] [INFO ] After 1539ms SMT Verify possible using 115 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2023-03-23 13:19:14] [INFO ] Deduced a trap composed of 9 places in 205 ms of which 1 ms to minimize.
[2023-03-23 13:19:15] [INFO ] Deduced a trap composed of 11 places in 165 ms of which 15 ms to minimize.
[2023-03-23 13:19:15] [INFO ] Deduced a trap composed of 10 places in 113 ms of which 11 ms to minimize.
[2023-03-23 13:19:15] [INFO ] Deduced a trap composed of 8 places in 192 ms of which 1 ms to minimize.
[2023-03-23 13:19:15] [INFO ] Deduced a trap composed of 17 places in 164 ms of which 0 ms to minimize.
[2023-03-23 13:19:15] [INFO ] Deduced a trap composed of 9 places in 177 ms of which 1 ms to minimize.
[2023-03-23 13:19:16] [INFO ] Deduced a trap composed of 8 places in 160 ms of which 2 ms to minimize.
[2023-03-23 13:19:16] [INFO ] Deduced a trap composed of 12 places in 299 ms of which 0 ms to minimize.
[2023-03-23 13:19:16] [INFO ] Deduced a trap composed of 9 places in 152 ms of which 0 ms to minimize.
[2023-03-23 13:19:17] [INFO ] Deduced a trap composed of 5 places in 296 ms of which 0 ms to minimize.
[2023-03-23 13:19:17] [INFO ] Deduced a trap composed of 12 places in 198 ms of which 1 ms to minimize.
[2023-03-23 13:19:17] [INFO ] Deduced a trap composed of 5 places in 185 ms of which 1 ms to minimize.
[2023-03-23 13:19:17] [INFO ] Deduced a trap composed of 13 places in 138 ms of which 0 ms to minimize.
[2023-03-23 13:19:18] [INFO ] Deduced a trap composed of 6 places in 280 ms of which 1 ms to minimize.
[2023-03-23 13:19:18] [INFO ] Deduced a trap composed of 7 places in 123 ms of which 1 ms to minimize.
[2023-03-23 13:19:18] [INFO ] Deduced a trap composed of 10 places in 148 ms of which 0 ms to minimize.
[2023-03-23 13:19:18] [INFO ] Deduced a trap composed of 13 places in 128 ms of which 1 ms to minimize.
[2023-03-23 13:19:19] [INFO ] Deduced a trap composed of 10 places in 126 ms of which 1 ms to minimize.
[2023-03-23 13:19:19] [INFO ] Deduced a trap composed of 15 places in 135 ms of which 1 ms to minimize.
[2023-03-23 13:19:19] [INFO ] Deduced a trap composed of 9 places in 149 ms of which 1 ms to minimize.
[2023-03-23 13:19:19] [INFO ] Deduced a trap composed of 12 places in 221 ms of which 0 ms to minimize.
[2023-03-23 13:19:20] [INFO ] Deduced a trap composed of 15 places in 247 ms of which 0 ms to minimize.
[2023-03-23 13:19:20] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 5699 ms
[2023-03-23 13:19:21] [INFO ] Deduced a trap composed of 13 places in 262 ms of which 0 ms to minimize.
[2023-03-23 13:19:21] [INFO ] Deduced a trap composed of 9 places in 188 ms of which 1 ms to minimize.
[2023-03-23 13:19:21] [INFO ] Deduced a trap composed of 8 places in 149 ms of which 1 ms to minimize.
[2023-03-23 13:19:21] [INFO ] Deduced a trap composed of 11 places in 236 ms of which 0 ms to minimize.
[2023-03-23 13:19:22] [INFO ] Deduced a trap composed of 13 places in 192 ms of which 0 ms to minimize.
[2023-03-23 13:19:22] [INFO ] Deduced a trap composed of 16 places in 209 ms of which 0 ms to minimize.
[2023-03-23 13:19:22] [INFO ] Deduced a trap composed of 13 places in 187 ms of which 0 ms to minimize.
[2023-03-23 13:19:23] [INFO ] Deduced a trap composed of 15 places in 223 ms of which 1 ms to minimize.
[2023-03-23 13:19:23] [INFO ] Deduced a trap composed of 8 places in 255 ms of which 0 ms to minimize.
[2023-03-23 13:19:23] [INFO ] Deduced a trap composed of 9 places in 198 ms of which 1 ms to minimize.
[2023-03-23 13:19:23] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2899 ms
[2023-03-23 13:19:24] [INFO ] Deduced a trap composed of 4 places in 245 ms of which 1 ms to minimize.
[2023-03-23 13:19:24] [INFO ] Deduced a trap composed of 8 places in 172 ms of which 1 ms to minimize.
[2023-03-23 13:19:24] [INFO ] Deduced a trap composed of 7 places in 218 ms of which 1 ms to minimize.
[2023-03-23 13:19:24] [INFO ] Deduced a trap composed of 13 places in 196 ms of which 0 ms to minimize.
[2023-03-23 13:19:25] [INFO ] Deduced a trap composed of 10 places in 170 ms of which 1 ms to minimize.
[2023-03-23 13:19:25] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1310 ms
[2023-03-23 13:19:25] [INFO ] Deduced a trap composed of 3 places in 322 ms of which 1 ms to minimize.
[2023-03-23 13:19:25] [INFO ] Deduced a trap composed of 10 places in 193 ms of which 1 ms to minimize.
[2023-03-23 13:19:26] [INFO ] Deduced a trap composed of 18 places in 248 ms of which 1 ms to minimize.
[2023-03-23 13:19:26] [INFO ] Deduced a trap composed of 5 places in 207 ms of which 0 ms to minimize.
[2023-03-23 13:19:26] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1311 ms
[2023-03-23 13:19:27] [INFO ] Deduced a trap composed of 9 places in 152 ms of which 1 ms to minimize.
[2023-03-23 13:19:27] [INFO ] Deduced a trap composed of 3 places in 140 ms of which 0 ms to minimize.
[2023-03-23 13:19:27] [INFO ] Deduced a trap composed of 9 places in 127 ms of which 1 ms to minimize.
[2023-03-23 13:19:27] [INFO ] Deduced a trap composed of 6 places in 205 ms of which 0 ms to minimize.
[2023-03-23 13:19:27] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 954 ms
[2023-03-23 13:19:28] [INFO ] Deduced a trap composed of 7 places in 199 ms of which 2 ms to minimize.
[2023-03-23 13:19:28] [INFO ] Deduced a trap composed of 6 places in 243 ms of which 0 ms to minimize.
[2023-03-23 13:19:28] [INFO ] Deduced a trap composed of 7 places in 199 ms of which 0 ms to minimize.
[2023-03-23 13:19:29] [INFO ] Deduced a trap composed of 10 places in 214 ms of which 0 ms to minimize.
[2023-03-23 13:19:29] [INFO ] Deduced a trap composed of 7 places in 241 ms of which 1 ms to minimize.
[2023-03-23 13:19:29] [INFO ] Deduced a trap composed of 10 places in 251 ms of which 1 ms to minimize.
[2023-03-23 13:19:30] [INFO ] Deduced a trap composed of 12 places in 204 ms of which 0 ms to minimize.
[2023-03-23 13:19:30] [INFO ] Deduced a trap composed of 11 places in 205 ms of which 1 ms to minimize.
[2023-03-23 13:19:30] [INFO ] Deduced a trap composed of 15 places in 272 ms of which 0 ms to minimize.
[2023-03-23 13:19:30] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 2801 ms
[2023-03-23 13:19:31] [INFO ] Deduced a trap composed of 8 places in 164 ms of which 0 ms to minimize.
[2023-03-23 13:19:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 248 ms
[2023-03-23 13:19:31] [INFO ] After 18632ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 1314 ms.
[2023-03-23 13:19:32] [INFO ] After 22418ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Parikh walk visited 0 properties in 417 ms.
Support contains 207 out of 1255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1255/1255 places, 1049/1049 transitions.
Applied a total of 0 rules in 39 ms. Remains 1255 /1255 variables (removed 0) and now considering 1049/1049 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 1255/1255 places, 1049/1049 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1255/1255 places, 1049/1049 transitions.
Applied a total of 0 rules in 30 ms. Remains 1255 /1255 variables (removed 0) and now considering 1049/1049 (removed 0) transitions.
[2023-03-23 13:19:33] [INFO ] Invariant cache hit.
[2023-03-23 13:19:33] [INFO ] Implicit Places using invariants in 761 ms returned []
[2023-03-23 13:19:33] [INFO ] Invariant cache hit.
[2023-03-23 13:19:34] [INFO ] State equation strengthened by 115 read => feed constraints.
[2023-03-23 13:19:36] [INFO ] Implicit Places using invariants and state equation in 2863 ms returned []
Implicit Place search using SMT with State Equation took 3635 ms to find 0 implicit places.
[2023-03-23 13:19:36] [INFO ] Redundant transitions in 69 ms returned []
[2023-03-23 13:19:36] [INFO ] Invariant cache hit.
[2023-03-23 13:19:37] [INFO ] Dead Transitions using invariants and state equation in 980 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4743 ms. Remains : 1255/1255 places, 1049/1049 transitions.
Partial Free-agglomeration rule applied 128 times.
Drop transitions removed 128 transitions
Iterating global reduction 0 with 128 rules applied. Total rules applied 128 place count 1255 transition count 1049
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 129 place count 1255 transition count 1048
Applied a total of 129 rules in 143 ms. Remains 1255 /1255 variables (removed 0) and now considering 1048/1049 (removed 1) transitions.
Running SMT prover for 9 properties.
// Phase 1: matrix 1048 rows 1255 cols
[2023-03-23 13:19:37] [INFO ] Computed 438 place invariants in 4 ms
[2023-03-23 13:19:38] [INFO ] After 422ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-23 13:19:38] [INFO ] [Nat]Absence check using 438 positive place invariants in 167 ms returned sat
[2023-03-23 13:19:40] [INFO ] After 1403ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-23 13:19:40] [INFO ] State equation strengthened by 101 read => feed constraints.
[2023-03-23 13:19:43] [INFO ] After 2542ms SMT Verify possible using 101 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2023-03-23 13:19:44] [INFO ] Deduced a trap composed of 3 places in 281 ms of which 0 ms to minimize.
[2023-03-23 13:19:44] [INFO ] Deduced a trap composed of 5 places in 317 ms of which 2 ms to minimize.
[2023-03-23 13:19:44] [INFO ] Deduced a trap composed of 9 places in 291 ms of which 1 ms to minimize.
[2023-03-23 13:19:45] [INFO ] Deduced a trap composed of 9 places in 351 ms of which 1 ms to minimize.
[2023-03-23 13:19:45] [INFO ] Deduced a trap composed of 12 places in 375 ms of which 1 ms to minimize.
[2023-03-23 13:19:45] [INFO ] Deduced a trap composed of 12 places in 249 ms of which 1 ms to minimize.
[2023-03-23 13:19:46] [INFO ] Deduced a trap composed of 9 places in 303 ms of which 1 ms to minimize.
[2023-03-23 13:19:46] [INFO ] Deduced a trap composed of 12 places in 293 ms of which 0 ms to minimize.
[2023-03-23 13:19:47] [INFO ] Deduced a trap composed of 7 places in 367 ms of which 1 ms to minimize.
[2023-03-23 13:19:47] [INFO ] Deduced a trap composed of 8 places in 255 ms of which 1 ms to minimize.
[2023-03-23 13:19:47] [INFO ] Deduced a trap composed of 8 places in 245 ms of which 0 ms to minimize.
[2023-03-23 13:19:48] [INFO ] Deduced a trap composed of 9 places in 309 ms of which 0 ms to minimize.
[2023-03-23 13:19:48] [INFO ] Deduced a trap composed of 8 places in 278 ms of which 1 ms to minimize.
[2023-03-23 13:19:48] [INFO ] Deduced a trap composed of 12 places in 271 ms of which 0 ms to minimize.
[2023-03-23 13:19:49] [INFO ] Deduced a trap composed of 13 places in 292 ms of which 1 ms to minimize.
[2023-03-23 13:19:49] [INFO ] Deduced a trap composed of 11 places in 375 ms of which 1 ms to minimize.
[2023-03-23 13:19:49] [INFO ] Deduced a trap composed of 14 places in 283 ms of which 1 ms to minimize.
[2023-03-23 13:19:49] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 6234 ms
[2023-03-23 13:19:50] [INFO ] Deduced a trap composed of 15 places in 252 ms of which 1 ms to minimize.
[2023-03-23 13:19:50] [INFO ] Deduced a trap composed of 10 places in 143 ms of which 1 ms to minimize.
[2023-03-23 13:19:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 547 ms
[2023-03-23 13:19:51] [INFO ] Deduced a trap composed of 9 places in 328 ms of which 1 ms to minimize.
[2023-03-23 13:19:51] [INFO ] Deduced a trap composed of 8 places in 202 ms of which 19 ms to minimize.
[2023-03-23 13:19:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 691 ms
[2023-03-23 13:19:51] [INFO ] Deduced a trap composed of 8 places in 317 ms of which 0 ms to minimize.
[2023-03-23 13:19:52] [INFO ] Deduced a trap composed of 9 places in 177 ms of which 1 ms to minimize.
[2023-03-23 13:19:52] [INFO ] Deduced a trap composed of 9 places in 181 ms of which 1 ms to minimize.
[2023-03-23 13:19:52] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 844 ms
[2023-03-23 13:19:53] [INFO ] Deduced a trap composed of 9 places in 208 ms of which 1 ms to minimize.
[2023-03-23 13:19:53] [INFO ] Deduced a trap composed of 11 places in 179 ms of which 0 ms to minimize.
[2023-03-23 13:19:53] [INFO ] Deduced a trap composed of 11 places in 246 ms of which 0 ms to minimize.
[2023-03-23 13:19:53] [INFO ] Deduced a trap composed of 8 places in 186 ms of which 0 ms to minimize.
[2023-03-23 13:19:54] [INFO ] Deduced a trap composed of 18 places in 193 ms of which 0 ms to minimize.
[2023-03-23 13:19:54] [INFO ] Deduced a trap composed of 10 places in 170 ms of which 1 ms to minimize.
[2023-03-23 13:19:54] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1559 ms
[2023-03-23 13:19:54] [INFO ] Deduced a trap composed of 17 places in 236 ms of which 0 ms to minimize.
[2023-03-23 13:19:55] [INFO ] Deduced a trap composed of 10 places in 241 ms of which 0 ms to minimize.
[2023-03-23 13:19:55] [INFO ] Deduced a trap composed of 9 places in 204 ms of which 1 ms to minimize.
[2023-03-23 13:19:55] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 874 ms
[2023-03-23 13:19:56] [INFO ] Deduced a trap composed of 15 places in 208 ms of which 0 ms to minimize.
[2023-03-23 13:19:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 330 ms
[2023-03-23 13:19:56] [INFO ] After 15543ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 1656 ms.
[2023-03-23 13:19:57] [INFO ] After 19396ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
[2023-03-23 13:19:57] [INFO ] Export to MCC of 9 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 11 ms.
[2023-03-23 13:19:57] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1255 places, 1049 transitions and 4082 arcs took 22 ms.
[2023-03-23 13:19:58] [INFO ] Flatten gal took : 123 ms
Total runtime 118548 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running ShieldPPPt (PT), instance 040B
Examination ReachabilityFireability
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/Fireability.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//rem_exec//smart
GOT IT HERE. BS
Petri model created: 1255 places, 1049 transitions, 4082 arcs.
Final Score: 77632.854
Took : 40 seconds
Reachability Fireability file is: ReachabilityFireability.xml
READY TO PARSE. BS
BK_STOP 1679577639165
--------------------
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
ERROR in file model.sm near line 6443:
syntax error
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="ShieldPPPt-PT-040B"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="smartxred"
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 smartxred"
echo " Input is ShieldPPPt-PT-040B, 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 r395-oct2-167903719100671"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPt-PT-040B.tgz
mv ShieldPPPt-PT-040B 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 ;