About the Execution of LTSMin+red for FlexibleBarrier-PT-20b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1789.512 | 3600000.00 | 14187032.00 | 494.80 | TFTFFTFFFFFTTTTF | 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.r169-tall-167838856100582.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is FlexibleBarrier-PT-20b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r169-tall-167838856100582
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 7.1K Feb 25 12:32 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Feb 25 12:32 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 25 12:31 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 25 12:31 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:08 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:08 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Feb 25 12:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 171K Feb 25 12:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Feb 25 12:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 25 12:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:08 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:08 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 1.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 FlexibleBarrier-PT-20b-ReachabilityCardinality-00
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityCardinality-01
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityCardinality-02
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityCardinality-03
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityCardinality-04
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityCardinality-05
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityCardinality-06
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityCardinality-07
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityCardinality-08
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityCardinality-09
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityCardinality-10
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityCardinality-11
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityCardinality-12
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityCardinality-13
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityCardinality-14
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1678577516893
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=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FlexibleBarrier-PT-20b
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-11 23:31:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-11 23:31:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 23:31:58] [INFO ] Load time of PNML (sax parser for PT used): 216 ms
[2023-03-11 23:31:58] [INFO ] Transformed 5372 places.
[2023-03-11 23:31:58] [INFO ] Transformed 6193 transitions.
[2023-03-11 23:31:58] [INFO ] Found NUPN structural information;
[2023-03-11 23:31:58] [INFO ] Parsed PT model containing 5372 places and 6193 transitions and 15575 arcs in 316 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 40 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 74 resets, run finished after 646 ms. (steps per millisecond=15 ) properties (out of 16) seen :2
FORMULA FlexibleBarrier-PT-20b-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-20b-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 14) seen :0
Running SMT prover for 14 properties.
// Phase 1: matrix 6193 rows 5372 cols
[2023-03-11 23:32:00] [INFO ] Computed 22 place invariants in 182 ms
[2023-03-11 23:32:02] [INFO ] After 2099ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2023-03-11 23:32:04] [INFO ] [Nat]Absence check using 22 positive place invariants in 54 ms returned sat
[2023-03-11 23:32:12] [INFO ] After 7253ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :14
[2023-03-11 23:32:16] [INFO ] Deduced a trap composed of 112 places in 3514 ms of which 10 ms to minimize.
[2023-03-11 23:32:19] [INFO ] Deduced a trap composed of 1946 places in 3498 ms of which 10 ms to minimize.
[2023-03-11 23:32:23] [INFO ] Deduced a trap composed of 1989 places in 3562 ms of which 4 ms to minimize.
[2023-03-11 23:32:26] [INFO ] Deduced a trap composed of 1892 places in 3296 ms of which 3 ms to minimize.
[2023-03-11 23:32:30] [INFO ] Deduced a trap composed of 1898 places in 3196 ms of which 3 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java: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-11 23:32:30] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-11 23:32:30] [INFO ] After 27932ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:14
FORMULA FlexibleBarrier-PT-20b-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 279 ms.
Support contains 236 out of 5372 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5372/5372 places, 6193/6193 transitions.
Graph (trivial) has 4839 edges and 5372 vertex of which 60 / 5372 are part of one of the 10 SCC in 18 ms
Free SCC test removed 50 places
Drop transitions removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Drop transitions removed 1194 transitions
Trivial Post-agglo rules discarded 1194 transitions
Performed 1194 trivial Post agglomeration. Transition count delta: 1194
Iterating post reduction 0 with 1194 rules applied. Total rules applied 1195 place count 5322 transition count 4939
Reduce places removed 1194 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 59
Iterating post reduction 1 with 1254 rules applied. Total rules applied 2449 place count 4128 transition count 4879
Reduce places removed 59 places and 0 transitions.
Iterating post reduction 2 with 59 rules applied. Total rules applied 2508 place count 4069 transition count 4879
Performed 332 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 332 Pre rules applied. Total rules applied 2508 place count 4069 transition count 4547
Deduced a syphon composed of 332 places in 5 ms
Reduce places removed 332 places and 0 transitions.
Iterating global reduction 3 with 664 rules applied. Total rules applied 3172 place count 3737 transition count 4547
Discarding 2037 places :
Symmetric choice reduction at 3 with 2037 rule applications. Total rules 5209 place count 1700 transition count 2510
Iterating global reduction 3 with 2037 rules applied. Total rules applied 7246 place count 1700 transition count 2510
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 7246 place count 1700 transition count 2507
Deduced a syphon composed of 3 places in 6 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 7252 place count 1697 transition count 2507
Discarding 257 places :
Symmetric choice reduction at 3 with 257 rule applications. Total rules 7509 place count 1440 transition count 2250
Iterating global reduction 3 with 257 rules applied. Total rules applied 7766 place count 1440 transition count 2250
Ensure Unique test removed 231 transitions
Reduce isomorphic transitions removed 231 transitions.
Iterating post reduction 3 with 231 rules applied. Total rules applied 7997 place count 1440 transition count 2019
Performed 146 Post agglomeration using F-continuation condition.Transition count delta: 146
Deduced a syphon composed of 146 places in 1 ms
Reduce places removed 146 places and 0 transitions.
Iterating global reduction 4 with 292 rules applied. Total rules applied 8289 place count 1294 transition count 1873
Drop transitions removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 4 with 28 rules applied. Total rules applied 8317 place count 1294 transition count 1845
Discarding 17 places :
Symmetric choice reduction at 5 with 17 rule applications. Total rules 8334 place count 1277 transition count 1828
Iterating global reduction 5 with 17 rules applied. Total rules applied 8351 place count 1277 transition count 1828
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 8365 place count 1270 transition count 1828
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 5 with 16 rules applied. Total rules applied 8381 place count 1270 transition count 1812
Free-agglomeration rule applied 780 times.
Iterating global reduction 5 with 780 rules applied. Total rules applied 9161 place count 1270 transition count 1032
Reduce places removed 780 places and 0 transitions.
Drop transitions removed 77 transitions
Reduce isomorphic transitions removed 77 transitions.
Iterating post reduction 5 with 857 rules applied. Total rules applied 10018 place count 490 transition count 955
Drop transitions removed 117 transitions
Redundant transition composition rules discarded 117 transitions
Iterating global reduction 6 with 117 rules applied. Total rules applied 10135 place count 490 transition count 838
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 10143 place count 490 transition count 838
Drop transitions removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 6 with 14 rules applied. Total rules applied 10157 place count 490 transition count 824
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 10158 place count 489 transition count 823
Applied a total of 10158 rules in 2026 ms. Remains 489 /5372 variables (removed 4883) and now considering 823/6193 (removed 5370) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2027 ms. Remains : 489/5372 places, 823/6193 transitions.
Incomplete random walk after 10000 steps, including 127 resets, run finished after 243 ms. (steps per millisecond=41 ) properties (out of 13) seen :6
FORMULA FlexibleBarrier-PT-20b-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-20b-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-20b-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-20b-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-20b-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-20b-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2023-03-11 23:32:33] [INFO ] Flow matrix only has 802 transitions (discarded 21 similar events)
// Phase 1: matrix 802 rows 489 cols
[2023-03-11 23:32:33] [INFO ] Computed 22 place invariants in 4 ms
[2023-03-11 23:32:33] [INFO ] After 119ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-11 23:32:33] [INFO ] [Nat]Absence check using 22 positive place invariants in 7 ms returned sat
[2023-03-11 23:32:33] [INFO ] After 382ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-11 23:32:33] [INFO ] State equation strengthened by 383 read => feed constraints.
[2023-03-11 23:32:34] [INFO ] After 277ms SMT Verify possible using 383 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-11 23:32:34] [INFO ] Deduced a trap composed of 56 places in 124 ms of which 0 ms to minimize.
[2023-03-11 23:32:34] [INFO ] Deduced a trap composed of 104 places in 132 ms of which 0 ms to minimize.
[2023-03-11 23:32:34] [INFO ] Deduced a trap composed of 109 places in 122 ms of which 1 ms to minimize.
[2023-03-11 23:32:34] [INFO ] Deduced a trap composed of 76 places in 49 ms of which 0 ms to minimize.
[2023-03-11 23:32:34] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 579 ms
[2023-03-11 23:32:34] [INFO ] Deduced a trap composed of 125 places in 125 ms of which 1 ms to minimize.
[2023-03-11 23:32:35] [INFO ] Deduced a trap composed of 108 places in 115 ms of which 0 ms to minimize.
[2023-03-11 23:32:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 328 ms
[2023-03-11 23:32:35] [INFO ] Deduced a trap composed of 54 places in 44 ms of which 1 ms to minimize.
[2023-03-11 23:32:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 92 ms
[2023-03-11 23:32:35] [INFO ] Deduced a trap composed of 101 places in 123 ms of which 0 ms to minimize.
[2023-03-11 23:32:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 176 ms
[2023-03-11 23:32:35] [INFO ] After 1728ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 245 ms.
[2023-03-11 23:32:35] [INFO ] After 2531ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 52 ms.
Support contains 154 out of 489 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 489/489 places, 823/823 transitions.
Graph (trivial) has 171 edges and 489 vertex of which 11 / 489 are part of one of the 5 SCC in 1 ms
Free SCC test removed 6 places
Drop transitions removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 35 place count 483 transition count 778
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 69 place count 449 transition count 778
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 69 place count 449 transition count 776
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 73 place count 447 transition count 776
Discarding 33 places :
Symmetric choice reduction at 2 with 33 rule applications. Total rules 106 place count 414 transition count 743
Iterating global reduction 2 with 33 rules applied. Total rules applied 139 place count 414 transition count 743
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 140 place count 414 transition count 742
Performed 22 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 184 place count 392 transition count 718
Drop transitions removed 29 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 3 with 30 rules applied. Total rules applied 214 place count 392 transition count 688
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 215 place count 391 transition count 687
Iterating global reduction 4 with 1 rules applied. Total rules applied 216 place count 391 transition count 687
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 217 place count 391 transition count 686
Drop transitions removed 37 transitions
Redundant transition composition rules discarded 37 transitions
Iterating global reduction 5 with 37 rules applied. Total rules applied 254 place count 391 transition count 649
Free-agglomeration rule applied 62 times with reduction of 2 identical transitions.
Iterating global reduction 5 with 62 rules applied. Total rules applied 316 place count 391 transition count 585
Reduce places removed 62 places and 0 transitions.
Drop transitions removed 38 transitions
Reduce isomorphic transitions removed 38 transitions.
Iterating post reduction 5 with 100 rules applied. Total rules applied 416 place count 329 transition count 547
Drop transitions removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 6 with 18 rules applied. Total rules applied 434 place count 329 transition count 529
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 436 place count 329 transition count 529
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 437 place count 328 transition count 528
Applied a total of 437 rules in 139 ms. Remains 328 /489 variables (removed 161) and now considering 528/823 (removed 295) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 139 ms. Remains : 328/489 places, 528/823 transitions.
Incomplete random walk after 10000 steps, including 126 resets, run finished after 253 ms. (steps per millisecond=39 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 7) seen :1
FORMULA FlexibleBarrier-PT-20b-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-03-11 23:32:36] [INFO ] Flow matrix only has 523 transitions (discarded 5 similar events)
// Phase 1: matrix 523 rows 328 cols
[2023-03-11 23:32:36] [INFO ] Computed 22 place invariants in 2 ms
[2023-03-11 23:32:36] [INFO ] After 79ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-11 23:32:36] [INFO ] [Nat]Absence check using 22 positive place invariants in 5 ms returned sat
[2023-03-11 23:32:36] [INFO ] After 228ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-11 23:32:36] [INFO ] State equation strengthened by 286 read => feed constraints.
[2023-03-11 23:32:36] [INFO ] After 181ms SMT Verify possible using 286 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-11 23:32:37] [INFO ] Deduced a trap composed of 52 places in 85 ms of which 1 ms to minimize.
[2023-03-11 23:32:37] [INFO ] Deduced a trap composed of 54 places in 69 ms of which 1 ms to minimize.
[2023-03-11 23:32:37] [INFO ] Deduced a trap composed of 53 places in 78 ms of which 1 ms to minimize.
[2023-03-11 23:32:37] [INFO ] Deduced a trap composed of 69 places in 76 ms of which 1 ms to minimize.
[2023-03-11 23:32:37] [INFO ] Deduced a trap composed of 74 places in 75 ms of which 1 ms to minimize.
[2023-03-11 23:32:37] [INFO ] Deduced a trap composed of 71 places in 76 ms of which 0 ms to minimize.
[2023-03-11 23:32:37] [INFO ] Deduced a trap composed of 53 places in 73 ms of which 0 ms to minimize.
[2023-03-11 23:32:37] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 665 ms
[2023-03-11 23:32:37] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 0 ms to minimize.
[2023-03-11 23:32:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 70 ms
[2023-03-11 23:32:37] [INFO ] Deduced a trap composed of 55 places in 75 ms of which 0 ms to minimize.
[2023-03-11 23:32:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 113 ms
[2023-03-11 23:32:38] [INFO ] Deduced a trap composed of 67 places in 76 ms of which 0 ms to minimize.
[2023-03-11 23:32:38] [INFO ] Deduced a trap composed of 60 places in 74 ms of which 0 ms to minimize.
[2023-03-11 23:32:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 207 ms
[2023-03-11 23:32:38] [INFO ] After 1394ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 158 ms.
[2023-03-11 23:32:38] [INFO ] After 1893ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 39 ms.
Support contains 111 out of 328 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 328/328 places, 528/528 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 328 transition count 519
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 319 transition count 519
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 36 place count 301 transition count 501
Iterating global reduction 2 with 18 rules applied. Total rules applied 54 place count 301 transition count 501
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 56 place count 301 transition count 499
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 88 place count 285 transition count 483
Drop transitions removed 12 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 3 with 13 rules applied. Total rules applied 101 place count 285 transition count 470
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 102 place count 284 transition count 469
Iterating global reduction 4 with 1 rules applied. Total rules applied 103 place count 284 transition count 469
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 105 place count 283 transition count 469
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 106 place count 283 transition count 468
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 107 place count 282 transition count 467
Iterating global reduction 5 with 1 rules applied. Total rules applied 108 place count 282 transition count 467
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 5 with 7 rules applied. Total rules applied 115 place count 282 transition count 460
Free-agglomeration rule applied 7 times.
Iterating global reduction 5 with 7 rules applied. Total rules applied 122 place count 282 transition count 453
Reduce places removed 7 places and 0 transitions.
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 12 rules applied. Total rules applied 134 place count 275 transition count 448
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 135 place count 275 transition count 447
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 136 place count 274 transition count 446
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 106 edges and 273 vertex of which 27 / 273 are part of one of the 13 SCC in 0 ms
Free SCC test removed 14 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 6 with 4 rules applied. Total rules applied 140 place count 259 transition count 444
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 7 with 30 rules applied. Total rules applied 170 place count 257 transition count 416
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 171 place count 256 transition count 416
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 18 Pre rules applied. Total rules applied 171 place count 256 transition count 398
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 9 with 36 rules applied. Total rules applied 207 place count 238 transition count 398
Drop transitions removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 9 with 17 rules applied. Total rules applied 224 place count 238 transition count 381
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 10 with 58 rules applied. Total rules applied 282 place count 209 transition count 352
Drop transitions removed 2 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 286 place count 209 transition count 348
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 11 with 8 rules applied. Total rules applied 294 place count 209 transition count 340
Free-agglomeration rule applied 17 times.
Iterating global reduction 11 with 17 rules applied. Total rules applied 311 place count 209 transition count 323
Reduce places removed 17 places and 0 transitions.
Drop transitions removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 11 with 30 rules applied. Total rules applied 341 place count 192 transition count 310
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 12 with 3 rules applied. Total rules applied 344 place count 192 transition count 307
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 12 with 3 rules applied. Total rules applied 347 place count 192 transition count 307
Applied a total of 347 rules in 116 ms. Remains 192 /328 variables (removed 136) and now considering 307/528 (removed 221) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 116 ms. Remains : 192/328 places, 307/528 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 307 ms. (steps per millisecond=32 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 6) seen :1
FORMULA FlexibleBarrier-PT-20b-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 5) 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 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
Running SMT prover for 5 properties.
[2023-03-11 23:32:39] [INFO ] Flow matrix only has 301 transitions (discarded 6 similar events)
// Phase 1: matrix 301 rows 192 cols
[2023-03-11 23:32:39] [INFO ] Computed 21 place invariants in 1 ms
[2023-03-11 23:32:39] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-11 23:32:39] [INFO ] [Nat]Absence check using 21 positive place invariants in 3 ms returned sat
[2023-03-11 23:32:39] [INFO ] After 128ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-11 23:32:39] [INFO ] State equation strengthened by 91 read => feed constraints.
[2023-03-11 23:32:39] [INFO ] After 81ms SMT Verify possible using 91 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-11 23:32:39] [INFO ] Deduced a trap composed of 41 places in 52 ms of which 1 ms to minimize.
[2023-03-11 23:32:39] [INFO ] Deduced a trap composed of 40 places in 47 ms of which 0 ms to minimize.
[2023-03-11 23:32:39] [INFO ] Deduced a trap composed of 43 places in 41 ms of which 1 ms to minimize.
[2023-03-11 23:32:39] [INFO ] Deduced a trap composed of 43 places in 43 ms of which 1 ms to minimize.
[2023-03-11 23:32:39] [INFO ] Deduced a trap composed of 46 places in 47 ms of which 1 ms to minimize.
[2023-03-11 23:32:39] [INFO ] Deduced a trap composed of 48 places in 39 ms of which 1 ms to minimize.
[2023-03-11 23:32:39] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 333 ms
[2023-03-11 23:32:39] [INFO ] Deduced a trap composed of 65 places in 54 ms of which 0 ms to minimize.
[2023-03-11 23:32:40] [INFO ] Deduced a trap composed of 64 places in 45 ms of which 0 ms to minimize.
[2023-03-11 23:32:40] [INFO ] Deduced a trap composed of 44 places in 48 ms of which 1 ms to minimize.
[2023-03-11 23:32:40] [INFO ] Deduced a trap composed of 42 places in 43 ms of which 1 ms to minimize.
[2023-03-11 23:32:40] [INFO ] Deduced a trap composed of 50 places in 41 ms of which 1 ms to minimize.
[2023-03-11 23:32:40] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 291 ms
[2023-03-11 23:32:40] [INFO ] Deduced a trap composed of 42 places in 54 ms of which 0 ms to minimize.
[2023-03-11 23:32:40] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
[2023-03-11 23:32:40] [INFO ] Deduced a trap composed of 35 places in 46 ms of which 1 ms to minimize.
[2023-03-11 23:32:40] [INFO ] Deduced a trap composed of 35 places in 50 ms of which 0 ms to minimize.
[2023-03-11 23:32:40] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 246 ms
[2023-03-11 23:32:40] [INFO ] After 1049ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 92 ms.
[2023-03-11 23:32:40] [INFO ] After 1340ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 6 ms.
Support contains 99 out of 192 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 192/192 places, 307/307 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 192 transition count 303
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 188 transition count 303
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 11 place count 185 transition count 300
Iterating global reduction 2 with 3 rules applied. Total rules applied 14 place count 185 transition count 300
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 9 places and 0 transitions.
Iterating global reduction 2 with 17 rules applied. Total rules applied 31 place count 176 transition count 292
Drop transitions removed 6 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 38 place count 176 transition count 285
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 3 with 7 rules applied. Total rules applied 45 place count 176 transition count 278
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 46 place count 176 transition count 277
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 47 place count 175 transition count 277
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 48 place count 175 transition count 276
Applied a total of 48 rules in 23 ms. Remains 175 /192 variables (removed 17) and now considering 276/307 (removed 31) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 175/192 places, 276/307 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 5) seen :0
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 10000 steps, including 2 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 346515 steps, run timeout after 3001 ms. (steps per millisecond=115 ) properties seen :{0=1}
Probabilistic random walk after 346515 steps, saw 191752 distinct states, run finished after 3002 ms. (steps per millisecond=115 ) properties seen :1
FORMULA FlexibleBarrier-PT-20b-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 4 properties.
// Phase 1: matrix 276 rows 175 cols
[2023-03-11 23:32:44] [INFO ] Computed 20 place invariants in 6 ms
[2023-03-11 23:32:44] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-11 23:32:44] [INFO ] [Nat]Absence check using 20 positive place invariants in 3 ms returned sat
[2023-03-11 23:32:44] [INFO ] After 122ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-11 23:32:44] [INFO ] State equation strengthened by 85 read => feed constraints.
[2023-03-11 23:32:44] [INFO ] After 73ms SMT Verify possible using 85 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-11 23:32:44] [INFO ] Deduced a trap composed of 36 places in 52 ms of which 0 ms to minimize.
[2023-03-11 23:32:44] [INFO ] Deduced a trap composed of 39 places in 41 ms of which 0 ms to minimize.
[2023-03-11 23:32:44] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 0 ms to minimize.
[2023-03-11 23:32:44] [INFO ] Deduced a trap composed of 41 places in 45 ms of which 0 ms to minimize.
[2023-03-11 23:32:44] [INFO ] Deduced a trap composed of 43 places in 38 ms of which 0 ms to minimize.
[2023-03-11 23:32:44] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 281 ms
[2023-03-11 23:32:44] [INFO ] Deduced a trap composed of 38 places in 42 ms of which 1 ms to minimize.
[2023-03-11 23:32:44] [INFO ] Deduced a trap composed of 43 places in 40 ms of which 0 ms to minimize.
[2023-03-11 23:32:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 109 ms
[2023-03-11 23:32:44] [INFO ] After 541ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 70 ms.
[2023-03-11 23:32:45] [INFO ] After 808ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
FORMULA FlexibleBarrier-PT-20b-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FlexibleBarrier-PT-20b-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 2 properties in 13 ms.
Support contains 62 out of 175 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 175/175 places, 276/276 transitions.
Graph (trivial) has 57 edges and 175 vertex of which 9 / 175 are part of one of the 4 SCC in 1 ms
Free SCC test removed 5 places
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 170 transition count 257
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 160 transition count 257
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 35 place count 146 transition count 243
Iterating global reduction 2 with 14 rules applied. Total rules applied 49 place count 146 transition count 243
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 50 place count 146 transition count 242
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 72 place count 135 transition count 231
Drop transitions removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 3 with 16 rules applied. Total rules applied 88 place count 135 transition count 215
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 90 place count 134 transition count 215
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 92 place count 134 transition count 213
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 101 place count 134 transition count 204
Free-agglomeration rule applied 10 times.
Iterating global reduction 5 with 10 rules applied. Total rules applied 111 place count 134 transition count 194
Reduce places removed 10 places and 0 transitions.
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 5 with 18 rules applied. Total rules applied 129 place count 124 transition count 186
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 130 place count 124 transition count 185
Applied a total of 130 rules in 22 ms. Remains 124 /175 variables (removed 51) and now considering 185/276 (removed 91) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 124/175 places, 185/276 transitions.
Incomplete random walk after 10000 steps, including 270 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 2) 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 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) seen :1
FORMULA FlexibleBarrier-PT-20b-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 1 properties.
// Phase 1: matrix 185 rows 124 cols
[2023-03-11 23:32:45] [INFO ] Computed 20 place invariants in 1 ms
[2023-03-11 23:32:45] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 23:32:45] [INFO ] [Nat]Absence check using 20 positive place invariants in 3 ms returned sat
[2023-03-11 23:32:45] [INFO ] After 53ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 23:32:45] [INFO ] State equation strengthened by 60 read => feed constraints.
[2023-03-11 23:32:45] [INFO ] After 21ms SMT Verify possible using 60 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 23:32:45] [INFO ] After 47ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2023-03-11 23:32:45] [INFO ] After 168ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 37 out of 124 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 124/124 places, 185/185 transitions.
Graph (trivial) has 58 edges and 124 vertex of which 2 / 124 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 9 place count 123 transition count 175
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 17 place count 115 transition count 175
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 27 place count 105 transition count 165
Iterating global reduction 2 with 10 rules applied. Total rules applied 37 place count 105 transition count 165
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 38 place count 105 transition count 164
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 58 place count 95 transition count 154
Drop transitions removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 3 with 15 rules applied. Total rules applied 73 place count 95 transition count 139
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 77 place count 95 transition count 135
Free-agglomeration rule applied 26 times.
Iterating global reduction 4 with 26 rules applied. Total rules applied 103 place count 95 transition count 109
Reduce places removed 26 places and 0 transitions.
Drop transitions removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 4 with 47 rules applied. Total rules applied 150 place count 69 transition count 88
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 153 place count 69 transition count 85
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 154 place count 68 transition count 84
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 158 place count 64 transition count 84
Applied a total of 158 rules in 16 ms. Remains 64 /124 variables (removed 60) and now considering 84/185 (removed 101) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 64/124 places, 84/185 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2635750 steps, run timeout after 3001 ms. (steps per millisecond=878 ) properties seen :{}
Probabilistic random walk after 2635750 steps, saw 987432 distinct states, run finished after 3001 ms. (steps per millisecond=878 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 84 rows 64 cols
[2023-03-11 23:32:48] [INFO ] Computed 16 place invariants in 1 ms
[2023-03-11 23:32:48] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 23:32:48] [INFO ] [Nat]Absence check using 16 positive place invariants in 4 ms returned sat
[2023-03-11 23:32:48] [INFO ] After 30ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 23:32:48] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-11 23:32:48] [INFO ] After 14ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 23:32:48] [INFO ] After 30ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-11 23:32:48] [INFO ] After 113ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 37 out of 64 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 64/64 places, 84/84 transitions.
Applied a total of 0 rules in 3 ms. Remains 64 /64 variables (removed 0) and now considering 84/84 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 64/64 places, 84/84 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 64/64 places, 84/84 transitions.
Applied a total of 0 rules in 2 ms. Remains 64 /64 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2023-03-11 23:32:48] [INFO ] Invariant cache hit.
[2023-03-11 23:32:48] [INFO ] Implicit Places using invariants in 30 ms returned [8]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 32 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 63/64 places, 84/84 transitions.
Applied a total of 0 rules in 1 ms. Remains 63 /63 variables (removed 0) and now considering 84/84 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 35 ms. Remains : 63/64 places, 84/84 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Finished Best-First random walk after 4723 steps, including 1 resets, run visited all 1 properties in 7 ms. (steps per millisecond=674 )
FORMULA FlexibleBarrier-PT-20b-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
All properties solved without resorting to model-checking.
Total runtime 50365 ms.
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --invariant=/tmp/649/inv_0_ --invariant=/tmp/649/inv_1_ --invariant=/tmp/649/inv_2_ --invariant=/tmp/649/inv_3_ --invariant=/tmp/649/inv_4_ --invariant=/tmp/649/inv_5_ --invariant=/tmp/649/inv_6_ --invariant=/tmp/649/inv_7_ --invariant=/tmp/649/inv_8_ --invariant=/tmp/649/inv_9_ --invariant=/tmp/649/inv_10_ --invariant=/tmp/649/inv_11_ --invariant=/tmp/649/inv_12_ --invariant=/tmp/649/inv_13_ --invariant=/tmp/649/inv_14_ --invariant=/tmp/649/inv_15_ --inv-par
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 14357692 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16097188 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 ReachabilityCardinality -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="FlexibleBarrier-PT-20b"
export BK_EXAMINATION="ReachabilityCardinality"
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 FlexibleBarrier-PT-20b, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r169-tall-167838856100582"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FlexibleBarrier-PT-20b.tgz
mv FlexibleBarrier-PT-20b execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;