About the Execution of LTSMin+red for ShieldIIPt-PT-030B
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15959.436 | 3600000.00 | 14120688.00 | 43.30 | ????????????T??? | 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.r393-oct2-167903716900298.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-030B, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r393-oct2-167903716900298
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 904K
-rw-r--r-- 1 mcc users 6.3K Feb 25 17:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K Feb 25 17:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Feb 25 17:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 25 17:01 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.5K Feb 25 16:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 17:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 104K Feb 25 17:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 25 17:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 33K Feb 25 17:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K 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 512K 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-030B-CTLFireability-00
FORMULA_NAME ShieldIIPt-PT-030B-CTLFireability-01
FORMULA_NAME ShieldIIPt-PT-030B-CTLFireability-02
FORMULA_NAME ShieldIIPt-PT-030B-CTLFireability-03
FORMULA_NAME ShieldIIPt-PT-030B-CTLFireability-04
FORMULA_NAME ShieldIIPt-PT-030B-CTLFireability-05
FORMULA_NAME ShieldIIPt-PT-030B-CTLFireability-06
FORMULA_NAME ShieldIIPt-PT-030B-CTLFireability-07
FORMULA_NAME ShieldIIPt-PT-030B-CTLFireability-08
FORMULA_NAME ShieldIIPt-PT-030B-CTLFireability-09
FORMULA_NAME ShieldIIPt-PT-030B-CTLFireability-10
FORMULA_NAME ShieldIIPt-PT-030B-CTLFireability-11
FORMULA_NAME ShieldIIPt-PT-030B-CTLFireability-12
FORMULA_NAME ShieldIIPt-PT-030B-CTLFireability-13
FORMULA_NAME ShieldIIPt-PT-030B-CTLFireability-14
FORMULA_NAME ShieldIIPt-PT-030B-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1679437168608
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=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-030B
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-21 22:19:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-21 22:19:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 22:19:31] [INFO ] Load time of PNML (sax parser for PT used): 131 ms
[2023-03-21 22:19:31] [INFO ] Transformed 2103 places.
[2023-03-21 22:19:31] [INFO ] Transformed 1953 transitions.
[2023-03-21 22:19:31] [INFO ] Found NUPN structural information;
[2023-03-21 22:19:31] [INFO ] Parsed PT model containing 2103 places and 1953 transitions and 4866 arcs in 284 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 11 ms.
Support contains 166 out of 2103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2103/2103 places, 1953/1953 transitions.
Discarding 297 places :
Symmetric choice reduction at 0 with 297 rule applications. Total rules 297 place count 1806 transition count 1656
Iterating global reduction 0 with 297 rules applied. Total rules applied 594 place count 1806 transition count 1656
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 595 place count 1805 transition count 1655
Iterating global reduction 0 with 1 rules applied. Total rules applied 596 place count 1805 transition count 1655
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 597 place count 1804 transition count 1654
Iterating global reduction 0 with 1 rules applied. Total rules applied 598 place count 1804 transition count 1654
Applied a total of 598 rules in 1080 ms. Remains 1804 /2103 variables (removed 299) and now considering 1654/1953 (removed 299) transitions.
// Phase 1: matrix 1654 rows 1804 cols
[2023-03-21 22:19:32] [INFO ] Computed 271 place invariants in 26 ms
[2023-03-21 22:19:33] [INFO ] Implicit Places using invariants in 905 ms returned []
[2023-03-21 22:19:33] [INFO ] Invariant cache hit.
[2023-03-21 22:19:35] [INFO ] Implicit Places using invariants and state equation in 2193 ms returned []
Implicit Place search using SMT with State Equation took 3147 ms to find 0 implicit places.
[2023-03-21 22:19:35] [INFO ] Invariant cache hit.
[2023-03-21 22:19:36] [INFO ] Dead Transitions using invariants and state equation in 1216 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1804/2103 places, 1654/1953 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5457 ms. Remains : 1804/2103 places, 1654/1953 transitions.
Support contains 166 out of 1804 places after structural reductions.
[2023-03-21 22:19:37] [INFO ] Flatten gal took : 156 ms
[2023-03-21 22:19:37] [INFO ] Flatten gal took : 65 ms
[2023-03-21 22:19:37] [INFO ] Input system was already deterministic with 1654 transitions.
Support contains 165 out of 1804 places (down from 166) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 576 ms. (steps per millisecond=17 ) properties (out of 108) seen :46
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 62) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 62) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 62) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 62) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 62) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 62) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 62) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 62) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 62) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 62) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 62) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 62) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 62) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 62) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 62) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 62) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 62) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 62) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 62) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 62) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 62) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 62) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 62) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 62) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 62) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 62) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 62) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 62) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 62) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 62) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 62) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 62) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 62) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 62) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 62) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 62) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 62) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 62) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 62) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 62) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 62) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 62) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 62) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 62) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 62) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 62) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 62) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 62) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 62) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 62) seen :0
Running SMT prover for 62 properties.
[2023-03-21 22:19:38] [INFO ] Invariant cache hit.
[2023-03-21 22:19:43] [INFO ] [Real]Absence check using 271 positive place invariants in 649 ms returned sat
[2023-03-21 22:19:46] [INFO ] After 8617ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:61
[2023-03-21 22:19:49] [INFO ] [Nat]Absence check using 271 positive place invariants in 116 ms returned sat
[2023-03-21 22:19:56] [INFO ] After 5487ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :61
[2023-03-21 22:19:57] [INFO ] Deduced a trap composed of 19 places in 437 ms of which 6 ms to minimize.
[2023-03-21 22:19:57] [INFO ] Deduced a trap composed of 12 places in 335 ms of which 1 ms to minimize.
[2023-03-21 22:19:58] [INFO ] Deduced a trap composed of 29 places in 284 ms of which 1 ms to minimize.
[2023-03-21 22:19:58] [INFO ] Deduced a trap composed of 19 places in 441 ms of which 1 ms to minimize.
[2023-03-21 22:19:59] [INFO ] Deduced a trap composed of 21 places in 332 ms of which 3 ms to minimize.
[2023-03-21 22:19:59] [INFO ] Deduced a trap composed of 23 places in 255 ms of which 1 ms to minimize.
[2023-03-21 22:19:59] [INFO ] Deduced a trap composed of 18 places in 267 ms of which 1 ms to minimize.
[2023-03-21 22:20:00] [INFO ] Deduced a trap composed of 23 places in 275 ms of which 1 ms to minimize.
[2023-03-21 22:20:00] [INFO ] Deduced a trap composed of 22 places in 307 ms of which 1 ms to minimize.
[2023-03-21 22:20:00] [INFO ] Deduced a trap composed of 16 places in 253 ms of which 1 ms to minimize.
[2023-03-21 22:20:00] [INFO ] Deduced a trap composed of 26 places in 217 ms of which 1 ms to minimize.
[2023-03-21 22:20:01] [INFO ] Deduced a trap composed of 25 places in 276 ms of which 1 ms to minimize.
[2023-03-21 22:20:01] [INFO ] Deduced a trap composed of 24 places in 274 ms of which 1 ms to minimize.
[2023-03-21 22:20:02] [INFO ] Deduced a trap composed of 25 places in 415 ms of which 1 ms to minimize.
[2023-03-21 22:20:02] [INFO ] Deduced a trap composed of 22 places in 206 ms of which 1 ms to minimize.
[2023-03-21 22:20:02] [INFO ] Deduced a trap composed of 22 places in 290 ms of which 0 ms to minimize.
[2023-03-21 22:20:03] [INFO ] Deduced a trap composed of 27 places in 335 ms of which 1 ms to minimize.
[2023-03-21 22:20:03] [INFO ] Deduced a trap composed of 35 places in 226 ms of which 1 ms to minimize.
[2023-03-21 22:20:03] [INFO ] Deduced a trap composed of 38 places in 220 ms of which 1 ms to minimize.
[2023-03-21 22:20:04] [INFO ] Deduced a trap composed of 41 places in 241 ms of which 0 ms to minimize.
[2023-03-21 22:20:04] [INFO ] Deduced a trap composed of 30 places in 249 ms of which 1 ms to minimize.
[2023-03-21 22:20:04] [INFO ] Deduced a trap composed of 37 places in 303 ms of which 38 ms to minimize.
[2023-03-21 22:20:04] [INFO ] Deduced a trap composed of 40 places in 171 ms of which 1 ms to minimize.
[2023-03-21 22:20:05] [INFO ] Deduced a trap composed of 39 places in 182 ms of which 1 ms to minimize.
[2023-03-21 22:20:05] [INFO ] Deduced a trap composed of 39 places in 161 ms of which 1 ms to minimize.
[2023-03-21 22:20:05] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 8540 ms
[2023-03-21 22:20:05] [INFO ] Deduced a trap composed of 24 places in 178 ms of which 0 ms to minimize.
[2023-03-21 22:20:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 313 ms
[2023-03-21 22:20:06] [INFO ] Deduced a trap composed of 40 places in 243 ms of which 1 ms to minimize.
[2023-03-21 22:20:06] [INFO ] Deduced a trap composed of 42 places in 204 ms of which 1 ms to minimize.
[2023-03-21 22:20:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 652 ms
[2023-03-21 22:20:07] [INFO ] Deduced a trap composed of 29 places in 265 ms of which 1 ms to minimize.
[2023-03-21 22:20:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 388 ms
[2023-03-21 22:20:07] [INFO ] Deduced a trap composed of 28 places in 191 ms of which 0 ms to minimize.
[2023-03-21 22:20:07] [INFO ] Deduced a trap composed of 27 places in 187 ms of which 1 ms to minimize.
[2023-03-21 22:20:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 601 ms
[2023-03-21 22:20:08] [INFO ] Deduced a trap composed of 25 places in 308 ms of which 0 ms to minimize.
[2023-03-21 22:20:08] [INFO ] Deduced a trap composed of 31 places in 272 ms of which 1 ms to minimize.
[2023-03-21 22:20:08] [INFO ] Deduced a trap composed of 17 places in 205 ms of which 1 ms to minimize.
[2023-03-21 22:20:09] [INFO ] Deduced a trap composed of 29 places in 208 ms of which 1 ms to minimize.
[2023-03-21 22:20:09] [INFO ] Deduced a trap composed of 36 places in 226 ms of which 1 ms to minimize.
[2023-03-21 22:20:09] [INFO ] Deduced a trap composed of 31 places in 296 ms of which 0 ms to minimize.
[2023-03-21 22:20:10] [INFO ] Deduced a trap composed of 29 places in 239 ms of which 14 ms to minimize.
[2023-03-21 22:20:10] [INFO ] Deduced a trap composed of 45 places in 179 ms of which 0 ms to minimize.
[2023-03-21 22:20:10] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2666 ms
[2023-03-21 22:20:10] [INFO ] Deduced a trap composed of 39 places in 178 ms of which 14 ms to minimize.
[2023-03-21 22:20:11] [INFO ] Deduced a trap composed of 44 places in 163 ms of which 0 ms to minimize.
[2023-03-21 22:20:11] [INFO ] Deduced a trap composed of 42 places in 212 ms of which 0 ms to minimize.
[2023-03-21 22:20:11] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 770 ms
[2023-03-21 22:20:12] [INFO ] Deduced a trap composed of 35 places in 288 ms of which 0 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.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:626)
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 22:20:12] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-21 22:20:12] [INFO ] After 25037ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0 real:61
Fused 62 Parikh solutions to 61 different solutions.
Parikh walk visited 1 properties in 4903 ms.
Support contains 96 out of 1804 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1804/1804 places, 1654/1654 transitions.
Drop transitions removed 323 transitions
Trivial Post-agglo rules discarded 323 transitions
Performed 323 trivial Post agglomeration. Transition count delta: 323
Iterating post reduction 0 with 323 rules applied. Total rules applied 323 place count 1804 transition count 1331
Reduce places removed 323 places and 0 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Iterating post reduction 1 with 335 rules applied. Total rules applied 658 place count 1481 transition count 1319
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 670 place count 1469 transition count 1319
Performed 204 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 204 Pre rules applied. Total rules applied 670 place count 1469 transition count 1115
Deduced a syphon composed of 204 places in 2 ms
Reduce places removed 204 places and 0 transitions.
Iterating global reduction 3 with 408 rules applied. Total rules applied 1078 place count 1265 transition count 1115
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 1088 place count 1255 transition count 1105
Iterating global reduction 3 with 10 rules applied. Total rules applied 1098 place count 1255 transition count 1105
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 1098 place count 1255 transition count 1099
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 1110 place count 1249 transition count 1099
Performed 486 Post agglomeration using F-continuation condition.Transition count delta: 486
Deduced a syphon composed of 486 places in 3 ms
Reduce places removed 486 places and 0 transitions.
Iterating global reduction 3 with 972 rules applied. Total rules applied 2082 place count 763 transition count 613
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2083 place count 763 transition count 612
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2085 place count 762 transition count 611
Performed 67 Post agglomeration using F-continuation condition.Transition count delta: -33
Deduced a syphon composed of 67 places in 2 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 4 with 134 rules applied. Total rules applied 2219 place count 695 transition count 644
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2220 place count 695 transition count 643
Free-agglomeration rule applied 7 times.
Iterating global reduction 5 with 7 rules applied. Total rules applied 2227 place count 695 transition count 636
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 2234 place count 688 transition count 636
Partial Free-agglomeration rule applied 32 times.
Drop transitions removed 32 transitions
Iterating global reduction 6 with 32 rules applied. Total rules applied 2266 place count 688 transition count 636
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 2267 place count 687 transition count 635
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 2269 place count 685 transition count 635
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 2269 place count 685 transition count 634
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 2271 place count 684 transition count 634
Applied a total of 2271 rules in 475 ms. Remains 684 /1804 variables (removed 1120) and now considering 634/1654 (removed 1020) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 475 ms. Remains : 684/1804 places, 634/1654 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 257 ms. (steps per millisecond=38 ) properties (out of 60) seen :10
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 50) seen :0
Running SMT prover for 50 properties.
// Phase 1: matrix 634 rows 684 cols
[2023-03-21 22:20:17] [INFO ] Computed 269 place invariants in 2 ms
[2023-03-21 22:20:18] [INFO ] [Real]Absence check using 269 positive place invariants in 86 ms returned sat
[2023-03-21 22:20:19] [INFO ] After 1188ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:50
[2023-03-21 22:20:19] [INFO ] [Nat]Absence check using 269 positive place invariants in 48 ms returned sat
[2023-03-21 22:20:22] [INFO ] After 1949ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :50
[2023-03-21 22:20:22] [INFO ] State equation strengthened by 15 read => feed constraints.
[2023-03-21 22:20:24] [INFO ] After 2203ms SMT Verify possible using 15 Read/Feed constraints in natural domain returned unsat :0 sat :50
[2023-03-21 22:20:25] [INFO ] Deduced a trap composed of 7 places in 90 ms of which 1 ms to minimize.
[2023-03-21 22:20:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 188 ms
[2023-03-21 22:20:25] [INFO ] Deduced a trap composed of 7 places in 73 ms of which 1 ms to minimize.
[2023-03-21 22:20:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 108 ms
[2023-03-21 22:20:25] [INFO ] Deduced a trap composed of 5 places in 79 ms of which 1 ms to minimize.
[2023-03-21 22:20:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 118 ms
[2023-03-21 22:20:26] [INFO ] Deduced a trap composed of 6 places in 115 ms of which 0 ms to minimize.
[2023-03-21 22:20:26] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 0 ms to minimize.
[2023-03-21 22:20:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 285 ms
[2023-03-21 22:20:26] [INFO ] Deduced a trap composed of 4 places in 92 ms of which 0 ms to minimize.
[2023-03-21 22:20:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 143 ms
[2023-03-21 22:20:28] [INFO ] Deduced a trap composed of 8 places in 87 ms of which 1 ms to minimize.
[2023-03-21 22:20:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 145 ms
[2023-03-21 22:20:28] [INFO ] After 6219ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :50
Attempting to minimize the solution found.
Minimization took 1864 ms.
[2023-03-21 22:20:30] [INFO ] After 11589ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :50
Parikh walk visited 0 properties in 891 ms.
Support contains 84 out of 684 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 684/684 places, 634/634 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 684 transition count 633
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 683 transition count 633
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 683 transition count 631
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 681 transition count 631
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 7 place count 680 transition count 630
Iterating global reduction 2 with 1 rules applied. Total rules applied 8 place count 680 transition count 630
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 20 place count 674 transition count 624
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 26 place count 671 transition count 627
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 27 place count 670 transition count 626
Applied a total of 27 rules in 76 ms. Remains 670 /684 variables (removed 14) and now considering 626/634 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 76 ms. Remains : 670/684 places, 626/634 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 296 ms. (steps per millisecond=33 ) properties (out of 50) seen :12
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 38) seen :0
Running SMT prover for 38 properties.
// Phase 1: matrix 626 rows 670 cols
[2023-03-21 22:20:32] [INFO ] Computed 269 place invariants in 2 ms
[2023-03-21 22:20:32] [INFO ] [Real]Absence check using 269 positive place invariants in 95 ms returned sat
[2023-03-21 22:20:32] [INFO ] After 850ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:38
[2023-03-21 22:20:33] [INFO ] [Nat]Absence check using 269 positive place invariants in 46 ms returned sat
[2023-03-21 22:20:36] [INFO ] After 1925ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :38
[2023-03-21 22:20:36] [INFO ] State equation strengthened by 15 read => feed constraints.
[2023-03-21 22:20:37] [INFO ] After 1303ms SMT Verify possible using 15 Read/Feed constraints in natural domain returned unsat :0 sat :38
[2023-03-21 22:20:37] [INFO ] Deduced a trap composed of 7 places in 179 ms of which 1 ms to minimize.
[2023-03-21 22:20:37] [INFO ] Deduced a trap composed of 5 places in 197 ms of which 1 ms to minimize.
[2023-03-21 22:20:38] [INFO ] Deduced a trap composed of 5 places in 95 ms of which 1 ms to minimize.
[2023-03-21 22:20:38] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 604 ms
[2023-03-21 22:20:38] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 0 ms to minimize.
[2023-03-21 22:20:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 113 ms
[2023-03-21 22:20:39] [INFO ] Deduced a trap composed of 5 places in 129 ms of which 2 ms to minimize.
[2023-03-21 22:20:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 170 ms
[2023-03-21 22:20:40] [INFO ] After 4278ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :38
Attempting to minimize the solution found.
Minimization took 1272 ms.
[2023-03-21 22:20:41] [INFO ] After 8763ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :38
Fused 38 Parikh solutions to 37 different solutions.
Parikh walk visited 0 properties in 473 ms.
Support contains 60 out of 670 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 670/670 places, 626/626 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 670 transition count 622
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 666 transition count 622
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 8 place count 666 transition count 613
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 26 place count 657 transition count 613
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 38 place count 651 transition count 607
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 50 place count 645 transition count 610
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 51 place count 645 transition count 609
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 52 place count 644 transition count 609
Reduce places removed 5 places and 5 transitions.
Iterating global reduction 3 with 5 rules applied. Total rules applied 57 place count 639 transition count 604
Applied a total of 57 rules in 77 ms. Remains 639 /670 variables (removed 31) and now considering 604/626 (removed 22) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77 ms. Remains : 639/670 places, 604/626 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 350 ms. (steps per millisecond=28 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 38) seen :0
Interrupted probabilistic random walk after 106454 steps, run timeout after 3001 ms. (steps per millisecond=35 ) properties seen :{}
Probabilistic random walk after 106454 steps, saw 69372 distinct states, run finished after 3002 ms. (steps per millisecond=35 ) properties seen :0
Running SMT prover for 38 properties.
// Phase 1: matrix 604 rows 639 cols
[2023-03-21 22:20:45] [INFO ] Computed 269 place invariants in 2 ms
[2023-03-21 22:20:46] [INFO ] [Real]Absence check using 269 positive place invariants in 34 ms returned sat
[2023-03-21 22:20:46] [INFO ] After 559ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:38
[2023-03-21 22:20:47] [INFO ] [Nat]Absence check using 269 positive place invariants in 117 ms returned sat
[2023-03-21 22:20:49] [INFO ] After 1314ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :38
[2023-03-21 22:20:49] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-21 22:20:50] [INFO ] After 1411ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :38
[2023-03-21 22:20:50] [INFO ] Deduced a trap composed of 4 places in 127 ms of which 1 ms to minimize.
[2023-03-21 22:20:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 163 ms
[2023-03-21 22:20:52] [INFO ] Deduced a trap composed of 5 places in 147 ms of which 0 ms to minimize.
[2023-03-21 22:20:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 208 ms
[2023-03-21 22:20:53] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 0 ms to minimize.
[2023-03-21 22:20:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 114 ms
[2023-03-21 22:20:53] [INFO ] After 4498ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :38
Attempting to minimize the solution found.
Minimization took 1419 ms.
[2023-03-21 22:20:55] [INFO ] After 8662ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :38
Parikh walk visited 0 properties in 530 ms.
Support contains 60 out of 639 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 639/639 places, 604/604 transitions.
Applied a total of 0 rules in 12 ms. Remains 639 /639 variables (removed 0) and now considering 604/604 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 639/639 places, 604/604 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 639/639 places, 604/604 transitions.
Applied a total of 0 rules in 12 ms. Remains 639 /639 variables (removed 0) and now considering 604/604 (removed 0) transitions.
[2023-03-21 22:20:55] [INFO ] Invariant cache hit.
[2023-03-21 22:20:55] [INFO ] Implicit Places using invariants in 291 ms returned [628]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 293 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 638/639 places, 604/604 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 637 transition count 603
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 637 transition count 603
Applied a total of 2 rules in 18 ms. Remains 637 /638 variables (removed 1) and now considering 603/604 (removed 1) transitions.
// Phase 1: matrix 603 rows 637 cols
[2023-03-21 22:20:55] [INFO ] Computed 268 place invariants in 2 ms
[2023-03-21 22:20:56] [INFO ] Implicit Places using invariants in 320 ms returned []
[2023-03-21 22:20:56] [INFO ] Invariant cache hit.
[2023-03-21 22:20:56] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-21 22:20:57] [INFO ] Implicit Places using invariants and state equation in 865 ms returned []
Implicit Place search using SMT with State Equation took 1187 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 637/639 places, 603/604 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1511 ms. Remains : 637/639 places, 603/604 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 359 ms. (steps per millisecond=27 ) properties (out of 38) seen :6
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 32) seen :0
Running SMT prover for 32 properties.
[2023-03-21 22:20:57] [INFO ] Invariant cache hit.
[2023-03-21 22:20:58] [INFO ] [Real]Absence check using 268 positive place invariants in 148 ms returned sat
[2023-03-21 22:20:58] [INFO ] After 1014ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:32
[2023-03-21 22:20:59] [INFO ] [Nat]Absence check using 268 positive place invariants in 32 ms returned sat
[2023-03-21 22:21:00] [INFO ] After 828ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :32
[2023-03-21 22:21:00] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-21 22:21:01] [INFO ] After 1122ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :32
[2023-03-21 22:21:01] [INFO ] Deduced a trap composed of 4 places in 120 ms of which 0 ms to minimize.
[2023-03-21 22:21:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 172 ms
[2023-03-21 22:21:03] [INFO ] After 3317ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :32
Attempting to minimize the solution found.
Minimization took 1262 ms.
[2023-03-21 22:21:05] [INFO ] After 6415ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :32
Parikh walk visited 0 properties in 655 ms.
Support contains 53 out of 637 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 637/637 places, 603/603 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 637 transition count 601
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 635 transition count 601
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 14 place count 630 transition count 596
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 629 transition count 596
Applied a total of 16 rules in 30 ms. Remains 629 /637 variables (removed 8) and now considering 596/603 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 629/637 places, 596/603 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 391 ms. (steps per millisecond=25 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 32) seen :0
Interrupted probabilistic random walk after 99374 steps, run timeout after 3001 ms. (steps per millisecond=33 ) properties seen :{}
Probabilistic random walk after 99374 steps, saw 65202 distinct states, run finished after 3001 ms. (steps per millisecond=33 ) properties seen :0
Running SMT prover for 32 properties.
// Phase 1: matrix 596 rows 629 cols
[2023-03-21 22:21:09] [INFO ] Computed 268 place invariants in 2 ms
[2023-03-21 22:21:10] [INFO ] [Real]Absence check using 268 positive place invariants in 110 ms returned sat
[2023-03-21 22:21:10] [INFO ] After 867ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:32
[2023-03-21 22:21:10] [INFO ] [Nat]Absence check using 268 positive place invariants in 50 ms returned sat
[2023-03-21 22:21:13] [INFO ] After 1705ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :32
[2023-03-21 22:21:13] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-21 22:21:14] [INFO ] After 1169ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :32
[2023-03-21 22:21:14] [INFO ] Deduced a trap composed of 4 places in 255 ms of which 34 ms to minimize.
[2023-03-21 22:21:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 312 ms
[2023-03-21 22:21:15] [INFO ] Deduced a trap composed of 6 places in 114 ms of which 1 ms to minimize.
[2023-03-21 22:21:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 189 ms
[2023-03-21 22:21:16] [INFO ] After 3354ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :32
Attempting to minimize the solution found.
Minimization took 851 ms.
[2023-03-21 22:21:17] [INFO ] After 7172ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :32
Parikh walk visited 0 properties in 370 ms.
Support contains 53 out of 629 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 629/629 places, 596/596 transitions.
Applied a total of 0 rules in 10 ms. Remains 629 /629 variables (removed 0) and now considering 596/596 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 629/629 places, 596/596 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 629/629 places, 596/596 transitions.
Applied a total of 0 rules in 11 ms. Remains 629 /629 variables (removed 0) and now considering 596/596 (removed 0) transitions.
[2023-03-21 22:21:17] [INFO ] Invariant cache hit.
[2023-03-21 22:21:18] [INFO ] Implicit Places using invariants in 392 ms returned []
[2023-03-21 22:21:18] [INFO ] Invariant cache hit.
[2023-03-21 22:21:18] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-21 22:21:19] [INFO ] Implicit Places using invariants and state equation in 913 ms returned []
Implicit Place search using SMT with State Equation took 1309 ms to find 0 implicit places.
[2023-03-21 22:21:19] [INFO ] Redundant transitions in 21 ms returned []
[2023-03-21 22:21:19] [INFO ] Invariant cache hit.
[2023-03-21 22:21:19] [INFO ] Dead Transitions using invariants and state equation in 349 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1697 ms. Remains : 629/629 places, 596/596 transitions.
Successfully simplified 1 atomic propositions for a total of 16 simplifications.
[2023-03-21 22:21:19] [INFO ] Flatten gal took : 59 ms
[2023-03-21 22:21:19] [INFO ] Flatten gal took : 52 ms
[2023-03-21 22:21:19] [INFO ] Input system was already deterministic with 1654 transitions.
Support contains 158 out of 1804 places (down from 163) after GAL structural reductions.
Computed a total of 489 stabilizing places and 489 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 1804/1804 places, 1654/1654 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 1771 transition count 1621
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 1771 transition count 1621
Applied a total of 66 rules in 184 ms. Remains 1771 /1804 variables (removed 33) and now considering 1621/1654 (removed 33) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 185 ms. Remains : 1771/1804 places, 1621/1654 transitions.
[2023-03-21 22:21:20] [INFO ] Flatten gal took : 42 ms
[2023-03-21 22:21:20] [INFO ] Flatten gal took : 44 ms
[2023-03-21 22:21:20] [INFO ] Input system was already deterministic with 1621 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1804/1804 places, 1654/1654 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 359 transitions
Trivial Post-agglo rules discarded 359 transitions
Performed 359 trivial Post agglomeration. Transition count delta: 359
Iterating post reduction 0 with 359 rules applied. Total rules applied 359 place count 1803 transition count 1294
Reduce places removed 359 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 361 rules applied. Total rules applied 720 place count 1444 transition count 1292
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 722 place count 1442 transition count 1292
Performed 227 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 227 Pre rules applied. Total rules applied 722 place count 1442 transition count 1065
Deduced a syphon composed of 227 places in 1 ms
Reduce places removed 227 places and 0 transitions.
Iterating global reduction 3 with 454 rules applied. Total rules applied 1176 place count 1215 transition count 1065
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 1198 place count 1193 transition count 1043
Iterating global reduction 3 with 22 rules applied. Total rules applied 1220 place count 1193 transition count 1043
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 1220 place count 1193 transition count 1028
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 1250 place count 1178 transition count 1028
Performed 472 Post agglomeration using F-continuation condition.Transition count delta: 472
Deduced a syphon composed of 472 places in 0 ms
Reduce places removed 472 places and 0 transitions.
Iterating global reduction 3 with 944 rules applied. Total rules applied 2194 place count 706 transition count 556
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2195 place count 706 transition count 555
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 2197 place count 705 transition count 554
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 2198 place count 705 transition count 554
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2200 place count 703 transition count 552
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 2202 place count 701 transition count 552
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 2202 place count 701 transition count 551
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 2204 place count 700 transition count 551
Applied a total of 2204 rules in 316 ms. Remains 700 /1804 variables (removed 1104) and now considering 551/1654 (removed 1103) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 317 ms. Remains : 700/1804 places, 551/1654 transitions.
[2023-03-21 22:21:20] [INFO ] Flatten gal took : 18 ms
[2023-03-21 22:21:20] [INFO ] Flatten gal took : 18 ms
[2023-03-21 22:21:20] [INFO ] Input system was already deterministic with 551 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1804/1804 places, 1654/1654 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 1774 transition count 1624
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 1774 transition count 1624
Applied a total of 60 rules in 151 ms. Remains 1774 /1804 variables (removed 30) and now considering 1624/1654 (removed 30) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 152 ms. Remains : 1774/1804 places, 1624/1654 transitions.
[2023-03-21 22:21:20] [INFO ] Flatten gal took : 38 ms
[2023-03-21 22:21:20] [INFO ] Flatten gal took : 40 ms
[2023-03-21 22:21:21] [INFO ] Input system was already deterministic with 1624 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1804/1804 places, 1654/1654 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 1772 transition count 1622
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 1772 transition count 1622
Applied a total of 64 rules in 137 ms. Remains 1772 /1804 variables (removed 32) and now considering 1622/1654 (removed 32) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 137 ms. Remains : 1772/1804 places, 1622/1654 transitions.
[2023-03-21 22:21:21] [INFO ] Flatten gal took : 62 ms
[2023-03-21 22:21:21] [INFO ] Flatten gal took : 37 ms
[2023-03-21 22:21:21] [INFO ] Input system was already deterministic with 1622 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1804/1804 places, 1654/1654 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 358 transitions
Trivial Post-agglo rules discarded 358 transitions
Performed 358 trivial Post agglomeration. Transition count delta: 358
Iterating post reduction 0 with 358 rules applied. Total rules applied 358 place count 1803 transition count 1295
Reduce places removed 358 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 360 rules applied. Total rules applied 718 place count 1445 transition count 1293
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 720 place count 1443 transition count 1293
Performed 223 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 223 Pre rules applied. Total rules applied 720 place count 1443 transition count 1070
Deduced a syphon composed of 223 places in 1 ms
Reduce places removed 223 places and 0 transitions.
Iterating global reduction 3 with 446 rules applied. Total rules applied 1166 place count 1220 transition count 1070
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 1190 place count 1196 transition count 1046
Iterating global reduction 3 with 24 rules applied. Total rules applied 1214 place count 1196 transition count 1046
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 17 Pre rules applied. Total rules applied 1214 place count 1196 transition count 1029
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 1248 place count 1179 transition count 1029
Performed 469 Post agglomeration using F-continuation condition.Transition count delta: 469
Deduced a syphon composed of 469 places in 1 ms
Reduce places removed 469 places and 0 transitions.
Iterating global reduction 3 with 938 rules applied. Total rules applied 2186 place count 710 transition count 560
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2187 place count 710 transition count 559
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2189 place count 709 transition count 558
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2191 place count 707 transition count 556
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 2193 place count 705 transition count 556
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 2193 place count 705 transition count 555
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 2195 place count 704 transition count 555
Applied a total of 2195 rules in 220 ms. Remains 704 /1804 variables (removed 1100) and now considering 555/1654 (removed 1099) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 220 ms. Remains : 704/1804 places, 555/1654 transitions.
[2023-03-21 22:21:21] [INFO ] Flatten gal took : 15 ms
[2023-03-21 22:21:21] [INFO ] Flatten gal took : 16 ms
[2023-03-21 22:21:21] [INFO ] Input system was already deterministic with 555 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1804/1804 places, 1654/1654 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 1776 transition count 1626
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 1776 transition count 1626
Applied a total of 56 rules in 136 ms. Remains 1776 /1804 variables (removed 28) and now considering 1626/1654 (removed 28) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 136 ms. Remains : 1776/1804 places, 1626/1654 transitions.
[2023-03-21 22:21:21] [INFO ] Flatten gal took : 34 ms
[2023-03-21 22:21:21] [INFO ] Flatten gal took : 36 ms
[2023-03-21 22:21:22] [INFO ] Input system was already deterministic with 1626 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1804/1804 places, 1654/1654 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 1774 transition count 1624
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 1774 transition count 1624
Applied a total of 60 rules in 184 ms. Remains 1774 /1804 variables (removed 30) and now considering 1624/1654 (removed 30) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 184 ms. Remains : 1774/1804 places, 1624/1654 transitions.
[2023-03-21 22:21:22] [INFO ] Flatten gal took : 33 ms
[2023-03-21 22:21:22] [INFO ] Flatten gal took : 34 ms
[2023-03-21 22:21:22] [INFO ] Input system was already deterministic with 1624 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1804/1804 places, 1654/1654 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 367 transitions
Trivial Post-agglo rules discarded 367 transitions
Performed 367 trivial Post agglomeration. Transition count delta: 367
Iterating post reduction 0 with 367 rules applied. Total rules applied 367 place count 1803 transition count 1286
Reduce places removed 367 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 368 rules applied. Total rules applied 735 place count 1436 transition count 1285
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 736 place count 1435 transition count 1285
Performed 224 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 224 Pre rules applied. Total rules applied 736 place count 1435 transition count 1061
Deduced a syphon composed of 224 places in 1 ms
Reduce places removed 224 places and 0 transitions.
Iterating global reduction 3 with 448 rules applied. Total rules applied 1184 place count 1211 transition count 1061
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 1208 place count 1187 transition count 1037
Iterating global reduction 3 with 24 rules applied. Total rules applied 1232 place count 1187 transition count 1037
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 17 Pre rules applied. Total rules applied 1232 place count 1187 transition count 1020
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 1266 place count 1170 transition count 1020
Performed 474 Post agglomeration using F-continuation condition.Transition count delta: 474
Deduced a syphon composed of 474 places in 1 ms
Reduce places removed 474 places and 0 transitions.
Iterating global reduction 3 with 948 rules applied. Total rules applied 2214 place count 696 transition count 546
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2215 place count 696 transition count 545
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 2217 place count 695 transition count 544
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2219 place count 693 transition count 542
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 2221 place count 691 transition count 542
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 2221 place count 691 transition count 541
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 2223 place count 690 transition count 541
Applied a total of 2223 rules in 238 ms. Remains 690 /1804 variables (removed 1114) and now considering 541/1654 (removed 1113) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 238 ms. Remains : 690/1804 places, 541/1654 transitions.
[2023-03-21 22:21:22] [INFO ] Flatten gal took : 13 ms
[2023-03-21 22:21:22] [INFO ] Flatten gal took : 13 ms
[2023-03-21 22:21:22] [INFO ] Input system was already deterministic with 541 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1804/1804 places, 1654/1654 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 1773 transition count 1623
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 1773 transition count 1623
Applied a total of 62 rules in 162 ms. Remains 1773 /1804 variables (removed 31) and now considering 1623/1654 (removed 31) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 163 ms. Remains : 1773/1804 places, 1623/1654 transitions.
[2023-03-21 22:21:22] [INFO ] Flatten gal took : 45 ms
[2023-03-21 22:21:22] [INFO ] Flatten gal took : 33 ms
[2023-03-21 22:21:22] [INFO ] Input system was already deterministic with 1623 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1804/1804 places, 1654/1654 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 1775 transition count 1625
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 1775 transition count 1625
Applied a total of 58 rules in 149 ms. Remains 1775 /1804 variables (removed 29) and now considering 1625/1654 (removed 29) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 149 ms. Remains : 1775/1804 places, 1625/1654 transitions.
[2023-03-21 22:21:23] [INFO ] Flatten gal took : 31 ms
[2023-03-21 22:21:23] [INFO ] Flatten gal took : 33 ms
[2023-03-21 22:21:23] [INFO ] Input system was already deterministic with 1625 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1804/1804 places, 1654/1654 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 360 transitions
Trivial Post-agglo rules discarded 360 transitions
Performed 360 trivial Post agglomeration. Transition count delta: 360
Iterating post reduction 0 with 360 rules applied. Total rules applied 360 place count 1803 transition count 1293
Reduce places removed 360 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 363 rules applied. Total rules applied 723 place count 1443 transition count 1290
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 726 place count 1440 transition count 1290
Performed 221 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 221 Pre rules applied. Total rules applied 726 place count 1440 transition count 1069
Deduced a syphon composed of 221 places in 1 ms
Reduce places removed 221 places and 0 transitions.
Iterating global reduction 3 with 442 rules applied. Total rules applied 1168 place count 1219 transition count 1069
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 1190 place count 1197 transition count 1047
Iterating global reduction 3 with 22 rules applied. Total rules applied 1212 place count 1197 transition count 1047
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 16 Pre rules applied. Total rules applied 1212 place count 1197 transition count 1031
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 1244 place count 1181 transition count 1031
Performed 473 Post agglomeration using F-continuation condition.Transition count delta: 473
Deduced a syphon composed of 473 places in 1 ms
Reduce places removed 473 places and 0 transitions.
Iterating global reduction 3 with 946 rules applied. Total rules applied 2190 place count 708 transition count 558
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2191 place count 708 transition count 557
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2193 place count 707 transition count 556
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 2194 place count 707 transition count 556
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2196 place count 705 transition count 554
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 2198 place count 703 transition count 554
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 2198 place count 703 transition count 553
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 2200 place count 702 transition count 553
Applied a total of 2200 rules in 237 ms. Remains 702 /1804 variables (removed 1102) and now considering 553/1654 (removed 1101) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 238 ms. Remains : 702/1804 places, 553/1654 transitions.
[2023-03-21 22:21:23] [INFO ] Flatten gal took : 15 ms
[2023-03-21 22:21:23] [INFO ] Flatten gal took : 19 ms
[2023-03-21 22:21:23] [INFO ] Input system was already deterministic with 553 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1804/1804 places, 1654/1654 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 1773 transition count 1623
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 1773 transition count 1623
Applied a total of 62 rules in 138 ms. Remains 1773 /1804 variables (removed 31) and now considering 1623/1654 (removed 31) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 139 ms. Remains : 1773/1804 places, 1623/1654 transitions.
[2023-03-21 22:21:23] [INFO ] Flatten gal took : 32 ms
[2023-03-21 22:21:23] [INFO ] Flatten gal took : 36 ms
[2023-03-21 22:21:23] [INFO ] Input system was already deterministic with 1623 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1804/1804 places, 1654/1654 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 369 transitions
Trivial Post-agglo rules discarded 369 transitions
Performed 369 trivial Post agglomeration. Transition count delta: 369
Iterating post reduction 0 with 369 rules applied. Total rules applied 369 place count 1803 transition count 1284
Reduce places removed 369 places and 0 transitions.
Iterating post reduction 1 with 369 rules applied. Total rules applied 738 place count 1434 transition count 1284
Performed 224 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 224 Pre rules applied. Total rules applied 738 place count 1434 transition count 1060
Deduced a syphon composed of 224 places in 1 ms
Reduce places removed 224 places and 0 transitions.
Iterating global reduction 2 with 448 rules applied. Total rules applied 1186 place count 1210 transition count 1060
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 1209 place count 1187 transition count 1037
Iterating global reduction 2 with 23 rules applied. Total rules applied 1232 place count 1187 transition count 1037
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 1232 place count 1187 transition count 1020
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 1266 place count 1170 transition count 1020
Performed 477 Post agglomeration using F-continuation condition.Transition count delta: 477
Deduced a syphon composed of 477 places in 1 ms
Reduce places removed 477 places and 0 transitions.
Iterating global reduction 2 with 954 rules applied. Total rules applied 2220 place count 693 transition count 543
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2221 place count 693 transition count 542
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2223 place count 692 transition count 541
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2225 place count 690 transition count 539
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 2227 place count 688 transition count 539
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 2227 place count 688 transition count 538
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 2229 place count 687 transition count 538
Applied a total of 2229 rules in 175 ms. Remains 687 /1804 variables (removed 1117) and now considering 538/1654 (removed 1116) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 176 ms. Remains : 687/1804 places, 538/1654 transitions.
[2023-03-21 22:21:24] [INFO ] Flatten gal took : 13 ms
[2023-03-21 22:21:24] [INFO ] Flatten gal took : 14 ms
[2023-03-21 22:21:24] [INFO ] Input system was already deterministic with 538 transitions.
Finished random walk after 4953 steps, including 1 resets, run visited all 1 properties in 26 ms. (steps per millisecond=190 )
FORMULA ShieldIIPt-PT-030B-CTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 1804/1804 places, 1654/1654 transitions.
Drop transitions removed 368 transitions
Trivial Post-agglo rules discarded 368 transitions
Performed 368 trivial Post agglomeration. Transition count delta: 368
Iterating post reduction 0 with 368 rules applied. Total rules applied 368 place count 1804 transition count 1286
Reduce places removed 368 places and 0 transitions.
Iterating post reduction 1 with 368 rules applied. Total rules applied 736 place count 1436 transition count 1286
Performed 224 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 224 Pre rules applied. Total rules applied 736 place count 1436 transition count 1062
Deduced a syphon composed of 224 places in 1 ms
Reduce places removed 224 places and 0 transitions.
Iterating global reduction 2 with 448 rules applied. Total rules applied 1184 place count 1212 transition count 1062
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 1208 place count 1188 transition count 1038
Iterating global reduction 2 with 24 rules applied. Total rules applied 1232 place count 1188 transition count 1038
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 1232 place count 1188 transition count 1021
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 1266 place count 1171 transition count 1021
Performed 476 Post agglomeration using F-continuation condition.Transition count delta: 476
Deduced a syphon composed of 476 places in 0 ms
Reduce places removed 476 places and 0 transitions.
Iterating global reduction 2 with 952 rules applied. Total rules applied 2218 place count 695 transition count 545
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2219 place count 695 transition count 544
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2221 place count 694 transition count 543
Applied a total of 2221 rules in 245 ms. Remains 694 /1804 variables (removed 1110) and now considering 543/1654 (removed 1111) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 245 ms. Remains : 694/1804 places, 543/1654 transitions.
[2023-03-21 22:21:24] [INFO ] Flatten gal took : 22 ms
[2023-03-21 22:21:24] [INFO ] Flatten gal took : 22 ms
[2023-03-21 22:21:24] [INFO ] Input system was already deterministic with 543 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1804/1804 places, 1654/1654 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 1774 transition count 1624
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 1774 transition count 1624
Applied a total of 60 rules in 143 ms. Remains 1774 /1804 variables (removed 30) and now considering 1624/1654 (removed 30) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 144 ms. Remains : 1774/1804 places, 1624/1654 transitions.
[2023-03-21 22:21:24] [INFO ] Flatten gal took : 33 ms
[2023-03-21 22:21:24] [INFO ] Flatten gal took : 33 ms
[2023-03-21 22:21:24] [INFO ] Input system was already deterministic with 1624 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1804/1804 places, 1654/1654 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 1775 transition count 1625
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 1775 transition count 1625
Applied a total of 58 rules in 133 ms. Remains 1775 /1804 variables (removed 29) and now considering 1625/1654 (removed 29) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 135 ms. Remains : 1775/1804 places, 1625/1654 transitions.
[2023-03-21 22:21:25] [INFO ] Flatten gal took : 34 ms
[2023-03-21 22:21:25] [INFO ] Flatten gal took : 35 ms
[2023-03-21 22:21:25] [INFO ] Input system was already deterministic with 1625 transitions.
[2023-03-21 22:21:25] [INFO ] Flatten gal took : 35 ms
[2023-03-21 22:21:25] [INFO ] Flatten gal took : 78 ms
[2023-03-21 22:21:25] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2023-03-21 22:21:25] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1804 places, 1654 transitions and 4268 arcs took 7 ms.
Total runtime 114388 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 --ctl=/tmp/746/ctl_0_ --ctl=/tmp/746/ctl_1_ --ctl=/tmp/746/ctl_2_ --ctl=/tmp/746/ctl_3_ --ctl=/tmp/746/ctl_4_ --ctl=/tmp/746/ctl_5_ --ctl=/tmp/746/ctl_6_ --ctl=/tmp/746/ctl_7_ --ctl=/tmp/746/ctl_8_ --ctl=/tmp/746/ctl_9_ --ctl=/tmp/746/ctl_10_ --ctl=/tmp/746/ctl_11_ --ctl=/tmp/746/ctl_12_ --ctl=/tmp/746/ctl_13_ --ctl=/tmp/746/ctl_14_ --mu-par --mu-opt
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 187236 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16088816 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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -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-030B"
export BK_EXAMINATION="CTLFireability"
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-030B, examination is CTLFireability"
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-167903716900298"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPt-PT-030B.tgz
mv ShieldIIPt-PT-030B execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;