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.r393-oct2-167903716900335.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is ShieldIIPt-PT-050B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r393-oct2-167903716900335
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 7.2K Feb 25 17:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Feb 25 17:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Feb 25 17:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 25 17:03 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 25 17:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 141K Feb 25 17:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Feb 25 17:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 25 17:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:57 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:57 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 860K Mar 5 18:23 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityFireability-00
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityFireability-01
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityFireability-02
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityFireability-03
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityFireability-04
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityFireability-05
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityFireability-06
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityFireability-07
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityFireability-08
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityFireability-09
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityFireability-10
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityFireability-11
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityFireability-12
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityFireability-13
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityFireability-14
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679440535515

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-050B
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-21 23:15:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-21 23:15:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 23:15:37] [INFO ] Load time of PNML (sax parser for PT used): 156 ms
[2023-03-21 23:15:38] [INFO ] Transformed 3503 places.
[2023-03-21 23:15:38] [INFO ] Transformed 3253 transitions.
[2023-03-21 23:15:38] [INFO ] Found NUPN structural information;
[2023-03-21 23:15:38] [INFO ] Parsed PT model containing 3503 places and 3253 transitions and 8106 arcs in 374 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 568 ms. (steps per millisecond=17 ) properties (out of 16) seen :3
FORMULA ShieldIIPt-PT-050B-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-050B-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-050B-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 13) 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 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
// Phase 1: matrix 3253 rows 3503 cols
[2023-03-21 23:15:39] [INFO ] Computed 451 place invariants in 69 ms
[2023-03-21 23:15:41] [INFO ] [Real]Absence check using 451 positive place invariants in 321 ms returned sat
[2023-03-21 23:15:44] [INFO ] After 4755ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2023-03-21 23:15:45] [INFO ] [Nat]Absence check using 451 positive place invariants in 300 ms returned sat
[2023-03-21 23:15:58] [INFO ] After 12008ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :13
[2023-03-21 23:16:00] [INFO ] Deduced a trap composed of 38 places in 1240 ms of which 8 ms to minimize.
[2023-03-21 23:16:01] [INFO ] Deduced a trap composed of 30 places in 1043 ms of which 3 ms to minimize.
[2023-03-21 23:16:02] [INFO ] Deduced a trap composed of 27 places in 1171 ms of which 2 ms to minimize.
[2023-03-21 23:16:03] [INFO ] Deduced a trap composed of 17 places in 1107 ms of which 2 ms to minimize.
[2023-03-21 23:16:05] [INFO ] Deduced a trap composed of 36 places in 1171 ms of which 6 ms to minimize.
[2023-03-21 23:16:06] [INFO ] Deduced a trap composed of 38 places in 1582 ms of which 3 ms to minimize.
[2023-03-21 23:16:08] [INFO ] Deduced a trap composed of 48 places in 975 ms of which 14 ms to minimize.
[2023-03-21 23:16:09] [INFO ] Deduced a trap composed of 42 places in 1402 ms of which 2 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-21 23:16:09] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-21 23:16:09] [INFO ] After 25446ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:13
Parikh walk visited 0 properties in 2597 ms.
Support contains 118 out of 3503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3503/3503 places, 3253/3253 transitions.
Drop transitions removed 764 transitions
Trivial Post-agglo rules discarded 764 transitions
Performed 764 trivial Post agglomeration. Transition count delta: 764
Iterating post reduction 0 with 764 rules applied. Total rules applied 764 place count 3503 transition count 2489
Reduce places removed 764 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 766 rules applied. Total rules applied 1530 place count 2739 transition count 2487
Reduce places removed 1 places and 0 transitions.
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 44
Iterating post reduction 2 with 45 rules applied. Total rules applied 1575 place count 2738 transition count 2443
Reduce places removed 44 places and 0 transitions.
Iterating post reduction 3 with 44 rules applied. Total rules applied 1619 place count 2694 transition count 2443
Performed 206 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 206 Pre rules applied. Total rules applied 1619 place count 2694 transition count 2237
Deduced a syphon composed of 206 places in 9 ms
Reduce places removed 206 places and 0 transitions.
Iterating global reduction 4 with 412 rules applied. Total rules applied 2031 place count 2488 transition count 2237
Discarding 316 places :
Symmetric choice reduction at 4 with 316 rule applications. Total rules 2347 place count 2172 transition count 1921
Iterating global reduction 4 with 316 rules applied. Total rules applied 2663 place count 2172 transition count 1921
Performed 125 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 125 Pre rules applied. Total rules applied 2663 place count 2172 transition count 1796
Deduced a syphon composed of 125 places in 12 ms
Reduce places removed 125 places and 0 transitions.
Iterating global reduction 4 with 250 rules applied. Total rules applied 2913 place count 2047 transition count 1796
Performed 802 Post agglomeration using F-continuation condition.Transition count delta: 802
Deduced a syphon composed of 802 places in 3 ms
Reduce places removed 802 places and 0 transitions.
Iterating global reduction 4 with 1604 rules applied. Total rules applied 4517 place count 1245 transition count 994
Renaming transitions due to excessive name length > 1024 char.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -50
Deduced a syphon composed of 101 places in 3 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 4719 place count 1144 transition count 1044
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 24 places in 2 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 4 with 48 rules applied. Total rules applied 4767 place count 1120 transition count 1058
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 4768 place count 1120 transition count 1057
Free-agglomeration rule applied 5 times.
Iterating global reduction 5 with 5 rules applied. Total rules applied 4773 place count 1120 transition count 1052
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 4778 place count 1115 transition count 1052
Partial Free-agglomeration rule applied 46 times.
Drop transitions removed 46 transitions
Iterating global reduction 6 with 46 rules applied. Total rules applied 4824 place count 1115 transition count 1052
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 4825 place count 1114 transition count 1051
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 4827 place count 1112 transition count 1051
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 4827 place count 1112 transition count 1050
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 4829 place count 1111 transition count 1050
Applied a total of 4829 rules in 1197 ms. Remains 1111 /3503 variables (removed 2392) and now considering 1050/3253 (removed 2203) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1198 ms. Remains : 1111/3503 places, 1050/3253 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 307 ms. (steps per millisecond=32 ) properties (out of 13) seen :1
FORMULA ShieldIIPt-PT-050B-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 12) seen :0
Interrupted probabilistic random walk after 79392 steps, run timeout after 3001 ms. (steps per millisecond=26 ) properties seen :{}
Probabilistic random walk after 79392 steps, saw 67353 distinct states, run finished after 3003 ms. (steps per millisecond=26 ) properties seen :0
Running SMT prover for 12 properties.
// Phase 1: matrix 1050 rows 1111 cols
[2023-03-21 23:16:17] [INFO ] Computed 449 place invariants in 5 ms
[2023-03-21 23:16:18] [INFO ] [Real]Absence check using 449 positive place invariants in 118 ms returned sat
[2023-03-21 23:16:18] [INFO ] After 975ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-21 23:16:19] [INFO ] [Nat]Absence check using 449 positive place invariants in 146 ms returned sat
[2023-03-21 23:16:20] [INFO ] After 1375ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2023-03-21 23:16:20] [INFO ] State equation strengthened by 334 read => feed constraints.
[2023-03-21 23:16:23] [INFO ] After 2826ms SMT Verify possible using 334 Read/Feed constraints in natural domain returned unsat :0 sat :12
[2023-03-21 23:16:24] [INFO ] Deduced a trap composed of 7 places in 278 ms of which 0 ms to minimize.
[2023-03-21 23:16:24] [INFO ] Deduced a trap composed of 12 places in 120 ms of which 0 ms to minimize.
[2023-03-21 23:16:24] [INFO ] Deduced a trap composed of 9 places in 113 ms of which 1 ms to minimize.
[2023-03-21 23:16:24] [INFO ] Deduced a trap composed of 10 places in 111 ms of which 1 ms to minimize.
[2023-03-21 23:16:24] [INFO ] Deduced a trap composed of 10 places in 150 ms of which 1 ms to minimize.
[2023-03-21 23:16:25] [INFO ] Deduced a trap composed of 6 places in 119 ms of which 1 ms to minimize.
[2023-03-21 23:16:25] [INFO ] Deduced a trap composed of 9 places in 130 ms of which 0 ms to minimize.
[2023-03-21 23:16:25] [INFO ] Deduced a trap composed of 5 places in 172 ms of which 1 ms to minimize.
[2023-03-21 23:16:25] [INFO ] Deduced a trap composed of 5 places in 152 ms of which 1 ms to minimize.
[2023-03-21 23:16:25] [INFO ] Deduced a trap composed of 6 places in 135 ms of which 1 ms to minimize.
[2023-03-21 23:16:25] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2175 ms
[2023-03-21 23:16:28] [INFO ] Deduced a trap composed of 8 places in 86 ms of which 1 ms to minimize.
[2023-03-21 23:16:31] [INFO ] Deduced a trap composed of 6 places in 138 ms of which 0 ms to minimize.
[2023-03-21 23:16:32] [INFO ] Deduced a trap composed of 11 places in 67 ms of which 1 ms to minimize.
[2023-03-21 23:16:32] [INFO ] Deduced a trap composed of 8 places in 99 ms of which 1 ms to minimize.
[2023-03-21 23:16:32] [INFO ] Deduced a trap composed of 9 places in 99 ms of which 1 ms to minimize.
[2023-03-21 23:16:32] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 4743 ms
[2023-03-21 23:16:32] [INFO ] Deduced a trap composed of 11 places in 118 ms of which 0 ms to minimize.
[2023-03-21 23:16:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 268 ms
[2023-03-21 23:16:34] [INFO ] Deduced a trap composed of 5 places in 85 ms of which 1 ms to minimize.
[2023-03-21 23:16:34] [INFO ] Deduced a trap composed of 5 places in 110 ms of which 3 ms to minimize.
[2023-03-21 23:16:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 422 ms
[2023-03-21 23:16:34] [INFO ] Deduced a trap composed of 5 places in 87 ms of which 0 ms to minimize.
[2023-03-21 23:16:34] [INFO ] Deduced a trap composed of 5 places in 82 ms of which 0 ms to minimize.
[2023-03-21 23:16:35] [INFO ] Deduced a trap composed of 7 places in 90 ms of which 0 ms to minimize.
[2023-03-21 23:16:35] [INFO ] Deduced a trap composed of 7 places in 121 ms of which 1 ms to minimize.
[2023-03-21 23:16:35] [INFO ] Deduced a trap composed of 7 places in 120 ms of which 1 ms to minimize.
[2023-03-21 23:16:35] [INFO ] Deduced a trap composed of 8 places in 166 ms of which 1 ms to minimize.
[2023-03-21 23:16:35] [INFO ] Deduced a trap composed of 8 places in 138 ms of which 0 ms to minimize.
[2023-03-21 23:16:36] [INFO ] Deduced a trap composed of 9 places in 114 ms of which 2 ms to minimize.
[2023-03-21 23:16:36] [INFO ] Deduced a trap composed of 7 places in 123 ms of which 1 ms to minimize.
[2023-03-21 23:16:36] [INFO ] Deduced a trap composed of 8 places in 221 ms of which 1 ms to minimize.
[2023-03-21 23:16:36] [INFO ] Deduced a trap composed of 6 places in 109 ms of which 1 ms to minimize.
[2023-03-21 23:16:36] [INFO ] Deduced a trap composed of 9 places in 110 ms of which 0 ms to minimize.
[2023-03-21 23:16:37] [INFO ] Deduced a trap composed of 9 places in 182 ms of which 0 ms to minimize.
[2023-03-21 23:16:37] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 2552 ms
[2023-03-21 23:16:37] [INFO ] Deduced a trap composed of 7 places in 189 ms of which 4 ms to minimize.
[2023-03-21 23:16:37] [INFO ] Deduced a trap composed of 9 places in 153 ms of which 1 ms to minimize.
[2023-03-21 23:16:38] [INFO ] Deduced a trap composed of 5 places in 153 ms of which 1 ms to minimize.
[2023-03-21 23:16:38] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 699 ms
[2023-03-21 23:16:38] [INFO ] After 17292ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :12
Attempting to minimize the solution found.
Minimization took 3236 ms.
[2023-03-21 23:16:41] [INFO ] After 22905ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :12
Parikh walk visited 0 properties in 818 ms.
Support contains 116 out of 1111 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1111/1111 places, 1050/1050 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1111 transition count 1049
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1110 transition count 1049
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 6 place count 1108 transition count 1047
Applied a total of 6 rules in 90 ms. Remains 1108 /1111 variables (removed 3) and now considering 1047/1050 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 91 ms. Remains : 1108/1111 places, 1047/1050 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 450 ms. (steps per millisecond=22 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 12) seen :0
Interrupted probabilistic random walk after 67647 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :{}
Probabilistic random walk after 67647 steps, saw 57361 distinct states, run finished after 3002 ms. (steps per millisecond=22 ) properties seen :0
Running SMT prover for 12 properties.
// Phase 1: matrix 1047 rows 1108 cols
[2023-03-21 23:16:46] [INFO ] Computed 449 place invariants in 4 ms
[2023-03-21 23:16:47] [INFO ] [Real]Absence check using 449 positive place invariants in 154 ms returned sat
[2023-03-21 23:16:47] [INFO ] After 580ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-21 23:16:47] [INFO ] [Nat]Absence check using 449 positive place invariants in 123 ms returned sat
[2023-03-21 23:16:50] [INFO ] After 1818ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2023-03-21 23:16:50] [INFO ] State equation strengthened by 334 read => feed constraints.
[2023-03-21 23:16:53] [INFO ] After 3587ms SMT Verify possible using 334 Read/Feed constraints in natural domain returned unsat :0 sat :12
[2023-03-21 23:16:54] [INFO ] Deduced a trap composed of 9 places in 270 ms of which 1 ms to minimize.
[2023-03-21 23:16:54] [INFO ] Deduced a trap composed of 8 places in 197 ms of which 1 ms to minimize.
[2023-03-21 23:16:54] [INFO ] Deduced a trap composed of 6 places in 183 ms of which 0 ms to minimize.
[2023-03-21 23:16:54] [INFO ] Deduced a trap composed of 8 places in 139 ms of which 1 ms to minimize.
[2023-03-21 23:16:55] [INFO ] Deduced a trap composed of 7 places in 129 ms of which 0 ms to minimize.
[2023-03-21 23:16:55] [INFO ] Deduced a trap composed of 6 places in 150 ms of which 1 ms to minimize.
[2023-03-21 23:16:55] [INFO ] Deduced a trap composed of 7 places in 188 ms of which 0 ms to minimize.
[2023-03-21 23:16:55] [INFO ] Deduced a trap composed of 7 places in 133 ms of which 1 ms to minimize.
[2023-03-21 23:16:56] [INFO ] Deduced a trap composed of 7 places in 122 ms of which 0 ms to minimize.
[2023-03-21 23:16:56] [INFO ] Deduced a trap composed of 11 places in 164 ms of which 0 ms to minimize.
[2023-03-21 23:16:56] [INFO ] Deduced a trap composed of 11 places in 164 ms of which 1 ms to minimize.
[2023-03-21 23:16:56] [INFO ] Deduced a trap composed of 9 places in 141 ms of which 1 ms to minimize.
[2023-03-21 23:16:56] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 2806 ms
[2023-03-21 23:17:00] [INFO ] Deduced a trap composed of 6 places in 182 ms of which 0 ms to minimize.
[2023-03-21 23:17:00] [INFO ] Deduced a trap composed of 5 places in 142 ms of which 0 ms to minimize.
[2023-03-21 23:17:00] [INFO ] Deduced a trap composed of 10 places in 127 ms of which 0 ms to minimize.
[2023-03-21 23:17:00] [INFO ] Deduced a trap composed of 5 places in 134 ms of which 0 ms to minimize.
[2023-03-21 23:17:00] [INFO ] Deduced a trap composed of 5 places in 148 ms of which 0 ms to minimize.
[2023-03-21 23:17:01] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1253 ms
[2023-03-21 23:17:02] [INFO ] Deduced a trap composed of 5 places in 298 ms of which 1 ms to minimize.
[2023-03-21 23:17:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 404 ms
[2023-03-21 23:17:02] [INFO ] Deduced a trap composed of 6 places in 145 ms of which 1 ms to minimize.
[2023-03-21 23:17:02] [INFO ] Deduced a trap composed of 5 places in 189 ms of which 1 ms to minimize.
[2023-03-21 23:17:03] [INFO ] Deduced a trap composed of 10 places in 144 ms of which 0 ms to minimize.
[2023-03-21 23:17:03] [INFO ] Deduced a trap composed of 11 places in 149 ms of which 0 ms to minimize.
[2023-03-21 23:17:03] [INFO ] Deduced a trap composed of 8 places in 200 ms of which 24 ms to minimize.
[2023-03-21 23:17:04] [INFO ] Deduced a trap composed of 5 places in 170 ms of which 1 ms to minimize.
[2023-03-21 23:17:04] [INFO ] Deduced a trap composed of 7 places in 155 ms of which 14 ms to minimize.
[2023-03-21 23:17:04] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1940 ms
[2023-03-21 23:17:05] [INFO ] Deduced a trap composed of 9 places in 140 ms of which 1 ms to minimize.
[2023-03-21 23:17:05] [INFO ] Deduced a trap composed of 7 places in 141 ms of which 1 ms to minimize.
[2023-03-21 23:17:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 550 ms
[2023-03-21 23:17:05] [INFO ] After 15554ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :12
Attempting to minimize the solution found.
Minimization took 3155 ms.
[2023-03-21 23:17:08] [INFO ] After 21668ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :12
Parikh walk visited 0 properties in 495 ms.
Support contains 116 out of 1108 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1108/1108 places, 1047/1047 transitions.
Applied a total of 0 rules in 27 ms. Remains 1108 /1108 variables (removed 0) and now considering 1047/1047 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 1108/1108 places, 1047/1047 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1108/1108 places, 1047/1047 transitions.
Applied a total of 0 rules in 24 ms. Remains 1108 /1108 variables (removed 0) and now considering 1047/1047 (removed 0) transitions.
[2023-03-21 23:17:09] [INFO ] Invariant cache hit.
[2023-03-21 23:17:10] [INFO ] Implicit Places using invariants in 615 ms returned [1096]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 618 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1107/1108 places, 1047/1047 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1106 transition count 1046
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1106 transition count 1046
Applied a total of 2 rules in 41 ms. Remains 1106 /1107 variables (removed 1) and now considering 1046/1047 (removed 1) transitions.
// Phase 1: matrix 1046 rows 1106 cols
[2023-03-21 23:17:10] [INFO ] Computed 448 place invariants in 6 ms
[2023-03-21 23:17:10] [INFO ] Implicit Places using invariants in 682 ms returned []
[2023-03-21 23:17:10] [INFO ] Invariant cache hit.
[2023-03-21 23:17:11] [INFO ] State equation strengthened by 333 read => feed constraints.
[2023-03-21 23:17:15] [INFO ] Implicit Places using invariants and state equation in 4755 ms returned []
Implicit Place search using SMT with State Equation took 5443 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1106/1108 places, 1046/1047 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 6127 ms. Remains : 1106/1108 places, 1046/1047 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 373 ms. (steps per millisecond=26 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 12) seen :0
Interrupted probabilistic random walk after 73497 steps, run timeout after 3001 ms. (steps per millisecond=24 ) properties seen :{}
Probabilistic random walk after 73497 steps, saw 57257 distinct states, run finished after 3001 ms. (steps per millisecond=24 ) properties seen :0
Running SMT prover for 12 properties.
[2023-03-21 23:17:20] [INFO ] Invariant cache hit.
[2023-03-21 23:17:20] [INFO ] [Real]Absence check using 448 positive place invariants in 110 ms returned sat
[2023-03-21 23:17:20] [INFO ] After 433ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-21 23:17:21] [INFO ] [Nat]Absence check using 448 positive place invariants in 130 ms returned sat
[2023-03-21 23:17:23] [INFO ] After 1580ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2023-03-21 23:17:23] [INFO ] State equation strengthened by 333 read => feed constraints.
[2023-03-21 23:17:25] [INFO ] After 2488ms SMT Verify possible using 333 Read/Feed constraints in natural domain returned unsat :0 sat :12
[2023-03-21 23:17:25] [INFO ] Deduced a trap composed of 8 places in 193 ms of which 0 ms to minimize.
[2023-03-21 23:17:26] [INFO ] Deduced a trap composed of 7 places in 159 ms of which 1 ms to minimize.
[2023-03-21 23:17:26] [INFO ] Deduced a trap composed of 7 places in 159 ms of which 0 ms to minimize.
[2023-03-21 23:17:26] [INFO ] Deduced a trap composed of 6 places in 191 ms of which 1 ms to minimize.
[2023-03-21 23:17:26] [INFO ] Deduced a trap composed of 5 places in 148 ms of which 1 ms to minimize.
[2023-03-21 23:17:27] [INFO ] Deduced a trap composed of 9 places in 188 ms of which 0 ms to minimize.
[2023-03-21 23:17:27] [INFO ] Deduced a trap composed of 8 places in 170 ms of which 0 ms to minimize.
[2023-03-21 23:17:27] [INFO ] Deduced a trap composed of 11 places in 170 ms of which 1 ms to minimize.
[2023-03-21 23:17:27] [INFO ] Deduced a trap composed of 7 places in 170 ms of which 1 ms to minimize.
[2023-03-21 23:17:28] [INFO ] Deduced a trap composed of 6 places in 138 ms of which 1 ms to minimize.
[2023-03-21 23:17:28] [INFO ] Deduced a trap composed of 8 places in 151 ms of which 0 ms to minimize.
[2023-03-21 23:17:28] [INFO ] Deduced a trap composed of 8 places in 130 ms of which 0 ms to minimize.
[2023-03-21 23:17:28] [INFO ] Deduced a trap composed of 9 places in 145 ms of which 0 ms to minimize.
[2023-03-21 23:17:28] [INFO ] Deduced a trap composed of 9 places in 182 ms of which 1 ms to minimize.
[2023-03-21 23:17:28] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 3346 ms
[2023-03-21 23:17:30] [INFO ] Deduced a trap composed of 6 places in 130 ms of which 1 ms to minimize.
[2023-03-21 23:17:30] [INFO ] Deduced a trap composed of 5 places in 121 ms of which 1 ms to minimize.
[2023-03-21 23:17:30] [INFO ] Deduced a trap composed of 7 places in 108 ms of which 1 ms to minimize.
[2023-03-21 23:17:30] [INFO ] Deduced a trap composed of 7 places in 118 ms of which 0 ms to minimize.
[2023-03-21 23:17:31] [INFO ] Deduced a trap composed of 10 places in 109 ms of which 0 ms to minimize.
[2023-03-21 23:17:31] [INFO ] Deduced a trap composed of 8 places in 111 ms of which 0 ms to minimize.
[2023-03-21 23:17:31] [INFO ] Deduced a trap composed of 10 places in 131 ms of which 1 ms to minimize.
[2023-03-21 23:17:31] [INFO ] Deduced a trap composed of 11 places in 125 ms of which 0 ms to minimize.
[2023-03-21 23:17:32] [INFO ] Deduced a trap composed of 8 places in 106 ms of which 0 ms to minimize.
[2023-03-21 23:17:32] [INFO ] Deduced a trap composed of 5 places in 213 ms of which 1 ms to minimize.
[2023-03-21 23:17:32] [INFO ] Deduced a trap composed of 9 places in 164 ms of which 1 ms to minimize.
[2023-03-21 23:17:33] [INFO ] Deduced a trap composed of 10 places in 142 ms of which 0 ms to minimize.
[2023-03-21 23:17:33] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 3125 ms
[2023-03-21 23:17:34] [INFO ] Deduced a trap composed of 6 places in 163 ms of which 1 ms to minimize.
[2023-03-21 23:17:34] [INFO ] Deduced a trap composed of 9 places in 192 ms of which 0 ms to minimize.
[2023-03-21 23:17:34] [INFO ] Deduced a trap composed of 5 places in 237 ms of which 0 ms to minimize.
[2023-03-21 23:17:34] [INFO ] Deduced a trap composed of 7 places in 168 ms of which 0 ms to minimize.
[2023-03-21 23:17:35] [INFO ] Deduced a trap composed of 11 places in 119 ms of which 1 ms to minimize.
[2023-03-21 23:17:35] [INFO ] Deduced a trap composed of 10 places in 113 ms of which 1 ms to minimize.
[2023-03-21 23:17:35] [INFO ] Deduced a trap composed of 8 places in 163 ms of which 1 ms to minimize.
[2023-03-21 23:17:35] [INFO ] Deduced a trap composed of 10 places in 206 ms of which 0 ms to minimize.
[2023-03-21 23:17:35] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1927 ms
[2023-03-21 23:17:36] [INFO ] Deduced a trap composed of 5 places in 123 ms of which 1 ms to minimize.
[2023-03-21 23:17:36] [INFO ] Deduced a trap composed of 6 places in 138 ms of which 0 ms to minimize.
[2023-03-21 23:17:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 497 ms
[2023-03-21 23:17:37] [INFO ] Deduced a trap composed of 10 places in 172 ms of which 1 ms to minimize.
[2023-03-21 23:17:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 325 ms
[2023-03-21 23:17:38] [INFO ] Deduced a trap composed of 13 places in 186 ms of which 0 ms to minimize.
[2023-03-21 23:17:38] [INFO ] Deduced a trap composed of 5 places in 227 ms of which 0 ms to minimize.
[2023-03-21 23:17:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 604 ms
[2023-03-21 23:17:38] [INFO ] After 15440ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :12
Attempting to minimize the solution found.
Minimization took 3813 ms.
[2023-03-21 23:17:42] [INFO ] After 21872ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :12
Parikh walk visited 0 properties in 416 ms.
Support contains 116 out of 1106 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1106/1106 places, 1046/1046 transitions.
Applied a total of 0 rules in 24 ms. Remains 1106 /1106 variables (removed 0) and now considering 1046/1046 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 1106/1106 places, 1046/1046 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1106/1106 places, 1046/1046 transitions.
Applied a total of 0 rules in 24 ms. Remains 1106 /1106 variables (removed 0) and now considering 1046/1046 (removed 0) transitions.
[2023-03-21 23:17:42] [INFO ] Invariant cache hit.
[2023-03-21 23:17:43] [INFO ] Implicit Places using invariants in 567 ms returned []
[2023-03-21 23:17:43] [INFO ] Invariant cache hit.
[2023-03-21 23:17:44] [INFO ] State equation strengthened by 333 read => feed constraints.
[2023-03-21 23:17:48] [INFO ] Implicit Places using invariants and state equation in 4799 ms returned []
Implicit Place search using SMT with State Equation took 5371 ms to find 0 implicit places.
[2023-03-21 23:17:48] [INFO ] Redundant transitions in 90 ms returned []
[2023-03-21 23:17:48] [INFO ] Invariant cache hit.
[2023-03-21 23:17:49] [INFO ] Dead Transitions using invariants and state equation in 788 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6296 ms. Remains : 1106/1106 places, 1046/1046 transitions.
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 1106 transition count 1045
Partial Free-agglomeration rule applied 175 times.
Drop transitions removed 175 transitions
Iterating global reduction 0 with 175 rules applied. Total rules applied 176 place count 1106 transition count 1045
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 177 place count 1106 transition count 1044
Applied a total of 177 rules in 122 ms. Remains 1106 /1106 variables (removed 0) and now considering 1044/1046 (removed 2) transitions.
Running SMT prover for 12 properties.
// Phase 1: matrix 1044 rows 1106 cols
[2023-03-21 23:17:49] [INFO ] Computed 448 place invariants in 5 ms
[2023-03-21 23:17:49] [INFO ] [Real]Absence check using 448 positive place invariants in 120 ms returned sat
[2023-03-21 23:17:49] [INFO ] After 592ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-21 23:17:50] [INFO ] [Nat]Absence check using 448 positive place invariants in 110 ms returned sat
[2023-03-21 23:17:52] [INFO ] After 1696ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2023-03-21 23:17:52] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-03-21 23:17:54] [INFO ] After 1609ms SMT Verify possible using 164 Read/Feed constraints in natural domain returned unsat :0 sat :12
[2023-03-21 23:17:54] [INFO ] Deduced a trap composed of 5 places in 162 ms of which 0 ms to minimize.
[2023-03-21 23:17:54] [INFO ] Deduced a trap composed of 5 places in 161 ms of which 0 ms to minimize.
[2023-03-21 23:17:54] [INFO ] Deduced a trap composed of 5 places in 156 ms of which 1 ms to minimize.
[2023-03-21 23:17:54] [INFO ] Deduced a trap composed of 8 places in 178 ms of which 0 ms to minimize.
[2023-03-21 23:17:55] [INFO ] Deduced a trap composed of 5 places in 163 ms of which 0 ms to minimize.
[2023-03-21 23:17:55] [INFO ] Deduced a trap composed of 8 places in 187 ms of which 1 ms to minimize.
[2023-03-21 23:17:55] [INFO ] Deduced a trap composed of 8 places in 192 ms of which 1 ms to minimize.
[2023-03-21 23:17:55] [INFO ] Deduced a trap composed of 8 places in 167 ms of which 0 ms to minimize.
[2023-03-21 23:17:56] [INFO ] Deduced a trap composed of 7 places in 163 ms of which 2 ms to minimize.
[2023-03-21 23:17:56] [INFO ] Deduced a trap composed of 11 places in 193 ms of which 1 ms to minimize.
[2023-03-21 23:17:56] [INFO ] Deduced a trap composed of 7 places in 165 ms of which 0 ms to minimize.
[2023-03-21 23:17:56] [INFO ] Deduced a trap composed of 9 places in 172 ms of which 1 ms to minimize.
[2023-03-21 23:17:57] [INFO ] Deduced a trap composed of 11 places in 165 ms of which 0 ms to minimize.
[2023-03-21 23:17:57] [INFO ] Deduced a trap composed of 15 places in 123 ms of which 0 ms to minimize.
[2023-03-21 23:17:57] [INFO ] Deduced a trap composed of 8 places in 128 ms of which 0 ms to minimize.
[2023-03-21 23:17:57] [INFO ] Deduced a trap composed of 9 places in 121 ms of which 0 ms to minimize.
[2023-03-21 23:17:57] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 3594 ms
[2023-03-21 23:17:58] [INFO ] Deduced a trap composed of 6 places in 136 ms of which 1 ms to minimize.
[2023-03-21 23:17:58] [INFO ] Deduced a trap composed of 5 places in 125 ms of which 0 ms to minimize.
[2023-03-21 23:17:58] [INFO ] Deduced a trap composed of 8 places in 112 ms of which 0 ms to minimize.
[2023-03-21 23:17:58] [INFO ] Deduced a trap composed of 6 places in 117 ms of which 0 ms to minimize.
[2023-03-21 23:17:59] [INFO ] Deduced a trap composed of 5 places in 154 ms of which 1 ms to minimize.
[2023-03-21 23:17:59] [INFO ] Deduced a trap composed of 11 places in 128 ms of which 0 ms to minimize.
[2023-03-21 23:17:59] [INFO ] Deduced a trap composed of 11 places in 130 ms of which 1 ms to minimize.
[2023-03-21 23:17:59] [INFO ] Deduced a trap composed of 7 places in 135 ms of which 0 ms to minimize.
[2023-03-21 23:18:00] [INFO ] Deduced a trap composed of 8 places in 133 ms of which 0 ms to minimize.
[2023-03-21 23:18:00] [INFO ] Deduced a trap composed of 7 places in 127 ms of which 0 ms to minimize.
[2023-03-21 23:18:00] [INFO ] Deduced a trap composed of 8 places in 141 ms of which 1 ms to minimize.
[2023-03-21 23:18:00] [INFO ] Deduced a trap composed of 10 places in 158 ms of which 1 ms to minimize.
[2023-03-21 23:18:00] [INFO ] Deduced a trap composed of 7 places in 86 ms of which 0 ms to minimize.
[2023-03-21 23:18:01] [INFO ] Deduced a trap composed of 10 places in 117 ms of which 1 ms to minimize.
[2023-03-21 23:18:01] [INFO ] Deduced a trap composed of 11 places in 147 ms of which 2 ms to minimize.
[2023-03-21 23:18:01] [INFO ] Deduced a trap composed of 10 places in 113 ms of which 0 ms to minimize.
[2023-03-21 23:18:01] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 3550 ms
[2023-03-21 23:18:02] [INFO ] Deduced a trap composed of 6 places in 180 ms of which 1 ms to minimize.
[2023-03-21 23:18:02] [INFO ] Deduced a trap composed of 5 places in 143 ms of which 1 ms to minimize.
[2023-03-21 23:18:03] [INFO ] Deduced a trap composed of 10 places in 207 ms of which 1 ms to minimize.
[2023-03-21 23:18:03] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 842 ms
[2023-03-21 23:18:03] [INFO ] Deduced a trap composed of 7 places in 131 ms of which 1 ms to minimize.
[2023-03-21 23:18:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 262 ms
[2023-03-21 23:18:04] [INFO ] After 11634ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :12
Attempting to minimize the solution found.
Minimization took 1996 ms.
[2023-03-21 23:18:06] [INFO ] After 16237ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :12
[2023-03-21 23:18:06] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 10 ms.
[2023-03-21 23:18:06] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1106 places, 1046 transitions and 4942 arcs took 18 ms.
[2023-03-21 23:18:06] [INFO ] Flatten gal took : 119 ms
Total runtime 148828 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --inv-bin-par --invariant=/tmp/978/inv_0_ --invariant=/tmp/978/inv_1_ --invariant=/tmp/978/inv_2_ --invariant=/tmp/978/inv_3_ --invariant=/tmp/978/inv_4_ --invariant=/tmp/978/inv_5_ --invariant=/tmp/978/inv_6_ --invariant=/tmp/978/inv_7_ --invariant=/tmp/978/inv_8_ --invariant=/tmp/978/inv_9_ --invariant=/tmp/978/inv_10_ --invariant=/tmp/978/inv_11_ --inv-par
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 158256 kB
After kill :
MemTotal: 16393220 kB
MemFree: 15581964 kB

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
mcc2023

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldIIPt-PT-050B"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is ShieldIIPt-PT-050B, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r393-oct2-167903716900335"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPt-PT-050B.tgz
mv ShieldIIPt-PT-050B execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;